1
0
Fork 0
tplp-planning-benchmark/gc-ta1-tt1-single-shot/ipc-2000_blocks-strips-type...

161 lines
9.8 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-49.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-49.pddl
Parsing...
Parsing: [0.010s CPU, 0.016s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.005s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.011s wall-clock]
Preparing model... [0.010s CPU, 0.010s wall-clock]
Generated 21 rules.
Computing model... [0.230s CPU, 0.235s wall-clock]
1922 relevant atoms
1272 auxiliary atoms
3194 final queue length
5551 total queue pushes
Completing instantiation... [0.390s CPU, 0.388s wall-clock]
Instantiating: [0.640s CPU, 0.651s wall-clock]
Computing fact groups...
Finding invariants...
10 initial candidates
Finding invariants: [0.020s CPU, 0.021s wall-clock]
Checking invariant weight... [0.010s CPU, 0.004s wall-clock]
Instantiating groups... [0.020s CPU, 0.021s wall-clock]
Collecting mutex groups... [0.010s CPU, 0.005s wall-clock]
Choosing groups...
25 uncovered facts
Choosing groups: [0.030s CPU, 0.026s wall-clock]
Building translation key... [0.010s CPU, 0.008s wall-clock]
Computing fact groups: [0.140s CPU, 0.138s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.004s wall-clock]
Building dictionary for full mutex groups... [0.020s CPU, 0.011s wall-clock]
Building mutex information...
Building mutex information: [0.010s CPU, 0.013s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.020s CPU, 0.019s wall-clock]
Translating task: [0.450s CPU, 0.451s wall-clock]
1704 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
48 propositions removed
Detecting unreachable propositions: [0.280s CPU, 0.279s wall-clock]
Reordering and filtering variables...
49 of 49 variables necessary.
25 of 49 mutex groups necessary.
1152 of 1152 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.140s CPU, 0.143s wall-clock]
Translator variables: 49
Translator derived variables: 0
Translator facts: 650
Translator goal facts: 23
Translator mutex groups: 25
Translator total mutex groups size: 625
Translator operators: 1152
Translator axioms: 0
Translator task size: 9915
Translator peak memory: 42188 KB
Writing output... [0.180s CPU, 0.182s wall-clock]
Done! [1.900s CPU, 1.913s wall-clock]
planner.py version 0.0.1
Time: 0.32s
Memory: 70MB
Iteration 1
Queue: [(0,80,0,True)]
Grounded Until: 0
Expected Memory: 70MB
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('step', [36]), ('step', [37]), ('step', [38]), ('step', [39]), ('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]), ('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]), ('step', [79]), ('step', [80]), ('check', [80])]
Grounding Time: 2.65s
Memory: 317MB (+247MB)
Unblocking actions...
Solving...
[start: stats after solve call]
Models : 1+
Calls : 1
Time : 4.360s (Solving: 0.10s 1st Model: 0.09s Unsat: 0.00s)
CPU Time : 4.320s
Choices : 2375 (Domain: 2375)
Conflicts : 50 (Analyzed: 50)
Restarts : 0
Model-Level : 969.0
Problems : 1 (Average Length: 82.00 Splits: 0)
Lemmas : 50 (Deleted: 0)
Binary : 0 (Ratio: 0.00%)
Ternary : 0 (Ratio: 0.00%)
Conflict : 50 (Average Length: 56.1 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 50 (Average: 31.40 Max: 135 Sum: 1570)
Executed : 49 (Average: 29.76 Max: 135 Sum: 1488 Ratio: 94.78%)
Bounded : 1 (Average: 82.00 Max: 82 Sum: 82 Ratio: 5.22%)
Rules : 0
Atoms : 0
Bodies : 0
Tight : Yes
Variables : 152907 (Eliminated: 0 Frozen: 49601)
Constraints : 1089085 (Binary: 94.5% Ternary: 4.5% Other: 1.0%)
Memory Peak : 501MB
Max. Length : 0 steps
Models : 1
[endof: stats after solve call]
Solving Time: 0.20s
Memory: 437MB (+120MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 0.32s
Memory: 437MB (+0MB)
Answer: 1
occurs(action(("unstack","v","w")),1) occurs(action(("put-down","v")),2) occurs(action(("unstack","w","e")),3) occurs(action(("put-down","w")),4) occurs(action(("unstack","b","o")),5) occurs(action(("stack","b","w")),6) occurs(action(("unstack","o","c")),7) occurs(action(("put-down","o")),8) occurs(action(("unstack","c","l")),9) occurs(action(("stack","c","o")),10) occurs(action(("unstack","l","k")),11) occurs(action(("stack","l","v")),12) occurs(action(("unstack","k","i")),13) occurs(action(("put-down","k")),14) occurs(action(("unstack","i","s")),15) occurs(action(("put-down","i")),16) occurs(action(("unstack","s","d")),17) occurs(action(("stack","s","b")),18) occurs(action(("unstack","g","p")),19) occurs(action(("put-down","g")),20) occurs(action(("unstack","p","a")),21) occurs(action(("put-down","p")),22) occurs(action(("unstack","a","j")),23) occurs(action(("stack","a","m")),24) occurs(action(("unstack","j","n")),25) occurs(action(("stack","j","i")),26) occurs(action(("unstack","n","x")),27) occurs(action(("put-down","n")),28) occurs(action(("unstack","x","q")),29) occurs(action(("put-down","x")),30) occurs(action(("pick-up","q")),31) occurs(action(("stack","q","s")),32) occurs(action(("pick-up","g")),33) occurs(action(("stack","g","q")),34) occurs(action(("unstack","c","o")),35) occurs(action(("stack","c","g")),36) occurs(action(("pick-up","r")),37) occurs(action(("stack","r","c")),38) occurs(action(("unstack","d","t")),39) occurs(action(("stack","d","p")),40) occurs(action(("pick-up","t")),41) occurs(action(("stack","t","r")),42) occurs(action(("unstack","a","m")),43) occurs(action(("stack","a","t")),44) occurs(action(("unstack","e","u")),45) occurs(action(("put-down","e")),46) occurs(action(("unstack","u","f")),47) occurs(action(("stack","u","a")),48) occurs(action(("unstack","d","p")),49) occurs(action(("stack","d","u")),50) occurs(action(("unstack","l","v")),51) occurs(action(("stack","l","d")),52) occurs(action(("pick-up","k")),53) occurs(action(("stack","k","l")),54) occurs(action(("unstack","m","h")),55) occurs(action(("stack","m","p")),56) occurs(action(("pick-up","h")),57) occurs(action(("stack","h","k")),58) occurs(action(("unstack","m","p")),59) occurs(action(("stack","m","h")),60) occurs(action(("pick-up","p")),61) occurs(action(("stack","p","m")),62) occurs(action(("pick-up","v")),63) occurs(action(("stack","v","p")),64) occurs(action(("pick-up","n")),65) occurs(action(("stack","n","v")),66) occurs(action(("unstack","j","i")),67) occurs(action(("stack","j","n")),68) occurs(action(("pick-up","x")),69) occurs(action(("stack","x","j")),70) occurs(action(("pick-up","o")),71) occurs(action(("stack","o","x")),72) occurs(action(("pick-up","f")),73) occurs(action(("stack","f","o")),74) occurs(action(("pick-up","e")),75) occurs(action(("stack","e","f")),76) occurs(action(("pick-up","i")),77) occurs(action(("put-down","i")),78) occurs(action(("pick-up","i")),79) occurs(action(("stack","i","e")),80)
SATISFIABLE
Models : 1+
Calls : 1
Time : 4.360s (Solving: 0.10s 1st Model: 0.09s Unsat: 0.00s)
CPU Time : 4.320s
Choices : 2375 (Domain: 2375)
Conflicts : 50 (Analyzed: 50)
Restarts : 0
Model-Level : 969.0
Problems : 1 (Average Length: 82.00 Splits: 0)
Lemmas : 50 (Deleted: 0)
Binary : 0 (Ratio: 0.00%)
Ternary : 0 (Ratio: 0.00%)
Conflict : 50 (Average Length: 56.1 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 50 (Average: 31.40 Max: 135 Sum: 1570)
Executed : 49 (Average: 29.76 Max: 135 Sum: 1488 Ratio: 94.78%)
Bounded : 1 (Average: 82.00 Max: 82 Sum: 82 Ratio: 5.22%)
Rules : 0
Atoms : 0
Bodies : 0
Tight : Yes
Variables : 152907 (Eliminated: 0 Frozen: 49601)
Constraints : 1089085 (Binary: 94.5% Ternary: 4.5% Other: 1.0%)
Memory Peak : 501MB
Max. Length : 80 steps
Sol. Length : 80 steps
Models : 1