1
0
Fork 0
tplp-planning-benchmark/fd-pc-e1-sh/ipc-2000_blocks-strips-type...

225 lines
10 KiB
Plaintext

INFO Running translator.
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/instances/instance-27.pddl']
INFO translator arguments: []
INFO translator time limit: None
INFO translator memory limit: None
INFO callstring: /home/pluehne/.usr/bin/python /home/wv/bin/linux/64/fast-downward-10997/builds/release64/bin/translate/translate.py /home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/instances/instance-27.pddl
Parsing...
Parsing: [0.010s CPU, 0.014s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.003s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.010s wall-clock]
Preparing model... [0.000s CPU, 0.007s wall-clock]
Generated 21 rules.
Computing model... [0.090s CPU, 0.086s wall-clock]
613 relevant atoms
403 auxiliary atoms
1016 final queue length
1721 total queue pushes
Completing instantiation... [0.110s CPU, 0.111s wall-clock]
Instantiating: [0.220s CPU, 0.218s wall-clock]
Computing fact groups...
Finding invariants...
10 initial candidates
Finding invariants: [0.020s CPU, 0.017s wall-clock]
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
Instantiating groups... [0.010s CPU, 0.006s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
Choosing groups...
14 uncovered facts
Choosing groups: [0.010s CPU, 0.008s wall-clock]
Building translation key... [0.010s CPU, 0.002s wall-clock]
Computing fact groups: [0.050s CPU, 0.049s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.002s wall-clock]
Building mutex information...
Building mutex information: [0.010s CPU, 0.004s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.000s CPU, 0.006s wall-clock]
Translating task: [0.120s CPU, 0.120s wall-clock]
494 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
26 propositions removed
Detecting unreachable propositions: [0.070s CPU, 0.068s wall-clock]
Reordering and filtering variables...
27 of 27 variables necessary.
14 of 27 mutex groups necessary.
338 of 338 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.030s CPU, 0.037s wall-clock]
Translator variables: 27
Translator derived variables: 0
Translator facts: 210
Translator goal facts: 12
Translator mutex groups: 14
Translator total mutex groups size: 196
Translator operators: 338
Translator axioms: 0
Translator task size: 2941
Translator peak memory: 34648 KB
Writing output... [0.050s CPU, 0.050s wall-clock]
Done! [0.560s CPU, 0.571s wall-clock]
planner.py version 0.0.1
Time: 0.13s
Memory: 51MB
Iteration 1
Queue: [5]
Grounded Until: 0
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.06s
Memory: 54MB (+3MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 56MB (+2MB)
UNSAT
Iteration Time: 0.08s
Iteration 2
Queue: [7]
Grounded Until: 5
Grounding... [('step', [6]), ('step', [7]), ('check', [7])]
Grounding Time: 0.02s
Memory: 56MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 56MB (+0MB)
UNSAT
Iteration Time: 0.03s
Iteration 3
Queue: [9]
Grounded Until: 7
Grounding... [('step', [8]), ('step', [9]), ('check', [9])]
Grounding Time: 0.02s
Memory: 56MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 57MB (+1MB)
UNSAT
Iteration Time: 0.03s
Iteration 4
Queue: [14]
Grounded Until: 9
Grounding... [('step', [10]), ('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('check', [14])]
Grounding Time: 0.05s
Memory: 59MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 60MB (+1MB)
UNSAT
Iteration Time: 0.07s
Iteration 5
Queue: [19]
Grounded Until: 14
Grounding... [('step', [15]), ('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('check', [19])]
Grounding Time: 0.06s
Memory: 63MB (+3MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 65MB (+2MB)
UNSAT
Iteration Time: 0.08s
Iteration 6
Queue: [27]
Grounded Until: 19
Grounding... [('step', [20]), ('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('step', [26]), ('step', [27]), ('check', [27])]
Grounding Time: 0.09s
Memory: 70MB (+5MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 72MB (+2MB)
UNSAT
Iteration Time: 0.12s
Iteration 7
Queue: [39]
Grounded Until: 27
Grounding... [('step', [28]), ('step', [29]), ('step', [30]), ('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('step', [36]), ('step', [37]), ('step', [38]), ('step', [39]), ('check', [39])]
Grounding Time: 0.15s
Memory: 82MB (+10MB)
Unblocking actions...
Solving...
Solving Time: 0.04s
Memory: 86MB (+4MB)
UNSAT
Iteration Time: 0.23s
Iteration 8
Queue: [55]
Grounded Until: 39
Grounding... [('step', [40]), ('step', [41]), ('step', [42]), ('step', [43]), ('step', [44]), ('step', [45]), ('step', [46]), ('step', [47]), ('step', [48]), ('step', [49]), ('step', [50]), ('step', [51]), ('step', [52]), ('step', [53]), ('step', [54]), ('step', [55]), ('check', [55])]
Grounding Time: 0.18s
Memory: 94MB (+8MB)
Unblocking actions...
Solving...
Solving Time: 0.90s
Memory: 100MB (+6MB)
UNSAT
Iteration Time: 1.15s
Iteration 9
Queue: [78]
Grounded Until: 55
Grounding... [('step', [56]), ('step', [57]), ('step', [58]), ('step', [59]), ('step', [60]), ('step', [61]), ('step', [62]), ('step', [63]), ('step', [64]), ('step', [65]), ('step', [66]), ('step', [67]), ('step', [68]), ('step', [69]), ('step', [70]), ('step', [71]), ('step', [72]), ('step', [73]), ('step', [74]), ('step', [75]), ('step', [76]), ('step', [77]), ('step', [78]), ('check', [78])]
Grounding Time: 0.36s
Memory: 124MB (+24MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("unstack","b","f")),1) occurs(action(("put-down","b")),2) occurs(action(("unstack","f","d")),3) occurs(action(("put-down","f")),4) occurs(action(("unstack","d","c")),5) occurs(action(("put-down","d")),6) occurs(action(("unstack","i","g")),7) occurs(action(("stack","i","d")),8) occurs(action(("unstack","c","j")),9) occurs(action(("stack","c","i")),10) occurs(action(("unstack","j","a")),11) occurs(action(("put-down","j")),12) occurs(action(("unstack","a","e")),13) occurs(action(("stack","a","m")),14) occurs(action(("unstack","e","h")),15) occurs(action(("put-down","e")),16) occurs(action(("pick-up","f")),17) occurs(action(("stack","f","e")),18) occurs(action(("unstack","h","l")),19) occurs(action(("put-down","h")),20) occurs(action(("unstack","c","i")),21) occurs(action(("stack","c","h")),22) occurs(action(("unstack","l","k")),23) occurs(action(("stack","l","i")),24) occurs(action(("pick-up","b")),25) occurs(action(("stack","b","k")),26) occurs(action(("unstack","a","m")),27) occurs(action(("stack","a","c")),28) occurs(action(("pick-up","g")),29) occurs(action(("put-down","g")),30) occurs(action(("unstack","a","c")),31) occurs(action(("stack","a","m")),32) occurs(action(("unstack","c","h")),33) occurs(action(("stack","c","g")),34) occurs(action(("unstack","f","e")),35) occurs(action(("stack","f","c")),36) occurs(action(("pick-up","j")),37) occurs(action(("stack","j","b")),38) occurs(action(("unstack","l","i")),39) occurs(action(("stack","l","j")),40) occurs(action(("pick-up","e")),41) occurs(action(("stack","e","l")),42) occurs(action(("unstack","a","m")),43) occurs(action(("stack","a","f")),44) occurs(action(("unstack","i","d")),45) occurs(action(("put-down","i")),46) occurs(action(("pick-up","h")),47) occurs(action(("stack","h","e")),48) occurs(action(("pick-up","m")),49) occurs(action(("stack","m","i")),50) occurs(action(("unstack","a","f")),51) occurs(action(("stack","a","f")),52) occurs(action(("unstack","m","i")),53) occurs(action(("stack","m","h")),54) occurs(action(("unstack","a","f")),55) occurs(action(("stack","a","m")),56) occurs(action(("unstack","f","c")),57) occurs(action(("stack","f","a")),58) occurs(action(("pick-up","d")),59) occurs(action(("stack","d","f")),60) occurs(action(("unstack","c","g")),61) occurs(action(("stack","c","d")),62) occurs(action(("pick-up","i")),63) occurs(action(("put-down","i")),64) occurs(action(("pick-up","i")),65) occurs(action(("put-down","i")),66) occurs(action(("pick-up","g")),67) occurs(action(("stack","g","i")),68) occurs(action(("unstack","c","d")),69) occurs(action(("stack","c","d")),70) occurs(action(("unstack","g","i")),71) occurs(action(("put-down","g")),72) occurs(action(("unstack","c","d")),73) occurs(action(("stack","c","d")),74) occurs(action(("pick-up","i")),75) occurs(action(("stack","i","c")),76) occurs(action(("pick-up","g")),77) occurs(action(("stack","g","i")),78)
Solving Time: 0.17s
Memory: 130MB (+6MB)
SAT
SATISFIABLE
Models : 1+
Calls : 9
Time : 2.529s (Solving: 1.08s 1st Model: 0.15s Unsat: 0.93s)
CPU Time : 2.530s
Choices : 67179
Conflicts : 4360 (Analyzed: 4355)
Restarts : 40 (Average: 108.88 Last: 43)
Model-Level : 332.0
Problems : 9 (Average Length: 30.11 Splits: 0)
Lemmas : 4355 (Deleted: 971)
Binary : 190 (Ratio: 4.36%)
Ternary : 100 (Ratio: 2.30%)
Conflict : 4355 (Average Length: 412.3 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 4355 (Average: 14.34 Max: 1024 Sum: 62467)
Executed : 4318 (Average: 14.16 Max: 1024 Sum: 61671 Ratio: 98.73%)
Bounded : 37 (Average: 21.51 Max: 57 Sum: 796 Ratio: 1.27%)
Rules : 0
Atoms : 0
Bodies : 0
Tight : Yes
Variables : 54093 (Eliminated: 0 Frozen: 41751)
Constraints : 378559 (Binary: 93.3% Ternary: 4.1% Other: 2.6%)
Memory Peak : 132MB
Max. Length : 78 steps
Sol. Length : 78 steps