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-42.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-42.pddl
Parsing...
Parsing: [0.020s CPU, 0.015s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.004s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.011s wall-clock]
Preparing model... [0.010s CPU, 0.009s wall-clock]
Generated 21 rules.
Computing model... [0.170s CPU, 0.171s wall-clock]
1362 relevant atoms
900 auxiliary atoms
2262 final queue length
3904 total queue pushes
Completing instantiation... [0.270s CPU, 0.270s wall-clock]
Instantiating: [0.460s CPU, 0.467s wall-clock]
Computing fact groups...
Finding invariants...
10 initial candidates
Finding invariants: [0.030s CPU, 0.027s wall-clock]
Checking invariant weight... [0.000s CPU, 0.003s wall-clock]
Instantiating groups... [0.010s CPU, 0.015s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.004s wall-clock]
Choosing groups...
21 uncovered facts
Choosing groups: [0.020s CPU, 0.018s wall-clock]
Building translation key... [0.010s CPU, 0.006s wall-clock]
Computing fact groups: [0.110s CPU, 0.108s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.006s wall-clock]
Building dictionary for full mutex groups... [0.010s CPU, 0.006s wall-clock]
Building mutex information...
Building mutex information: [0.010s CPU, 0.010s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.010s CPU, 0.015s wall-clock]
Translating task: [0.320s CPU, 0.317s wall-clock]
1180 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
40 propositions removed
Detecting unreachable propositions: [0.170s CPU, 0.171s wall-clock]
Reordering and filtering variables...
41 of 41 variables necessary.
21 of 41 mutex groups necessary.
800 of 800 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.100s CPU, 0.097s wall-clock]
Translator variables: 41
Translator derived variables: 0
Translator facts: 462
Translator goal facts: 19
Translator mutex groups: 21
Translator total mutex groups size: 441
Translator operators: 800
Translator axioms: 0
Translator task size: 6903
Translator peak memory: 40396 KB
Writing output... [0.120s CPU, 0.126s wall-clock]
Done! [1.330s CPU, 1.339s wall-clock]
planner.py version 0.0.1
Time: 0.28s
Memory: 64MB
Iteration 1
Queue: [(0,80,0,True)]
Grounded Until: 0
Expected Memory: 64MB
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: 1.87s
Memory: 244MB (+180MB)
Unblocking actions...
Solving...
[start: stats after solve call]
Models : 1+
Calls : 1
Time : 3.496s (Solving: 0.45s 1st Model: 0.44s Unsat: 0.00s)
CPU Time : 3.460s
Choices : 26866 (Domain: 26866)
Conflicts : 188 (Analyzed: 188)
Restarts : 2 (Average: 94.00 Last: 49)
Model-Level : 559.0
Problems : 1 (Average Length: 82.00 Splits: 0)
Lemmas : 188 (Deleted: 0)
Binary : 1 (Ratio: 0.53%)
Ternary : 0 (Ratio: 0.00%)
Conflict : 188 (Average Length: 196.0 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 188 (Average: 147.35 Max: 1307 Sum: 27701)
Executed : 171 (Average: 140.37 Max: 1307 Sum: 26389 Ratio: 95.26%)
Bounded : 17 (Average: 77.18 Max: 82 Sum: 1312 Ratio: 4.74%)
Rules : 0
Atoms : 0
Bodies : 0
Tight : Yes
Variables : 108468 (Eliminated: 0 Frozen: 34924)
Constraints : 691115 (Binary: 94.1% Ternary: 4.6% Other: 1.3%)
Memory Peak : 415MB
Max. Length : 0 steps
Models : 1
[endof: stats after solve call]
Solving Time: 0.54s
Memory: 351MB (+107MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 0.28s
Memory: 352MB (+1MB)
Answer: 1
occurs(action(("unstack","g","m")),1) occurs(action(("put-down","g")),2) occurs(action(("unstack","a","h")),3) occurs(action(("stack","a","h")),4) occurs(action(("pick-up","m")),5) occurs(action(("put-down","m")),6) occurs(action(("pick-up","g")),7) occurs(action(("put-down","g")),8) occurs(action(("unstack","a","h")),9) occurs(action(("put-down","a")),10) occurs(action(("pick-up","a")),11) occurs(action(("put-down","a")),12) occurs(action(("unstack","h","k")),13) occurs(action(("put-down","h")),14) occurs(action(("unstack","k","q")),15) occurs(action(("put-down","k")),16) occurs(action(("unstack","q","t")),17) occurs(action(("put-down","q")),18) occurs(action(("unstack","t","e")),19) occurs(action(("stack","t","q")),20) occurs(action(("unstack","e","i")),21) occurs(action(("put-down","e")),22) occurs(action(("unstack","i","b")),23) occurs(action(("put-down","i")),24) occurs(action(("unstack","b","p")),25) occurs(action(("stack","b","a")),26) occurs(action(("unstack","p","l")),27) occurs(action(("stack","p","i")),28) occurs(action(("unstack","l","d")),29) occurs(action(("stack","l","h")),30) occurs(action(("unstack","d","o")),31) occurs(action(("put-down","d")),32) occurs(action(("unstack","o","j")),33) occurs(action(("put-down","o")),34) occurs(action(("unstack","j","s")),35) occurs(action(("stack","j","l")),36) occurs(action(("unstack","s","c")),37) occurs(action(("put-down","s")),38) occurs(action(("unstack","c","f")),39) occurs(action(("put-down","c")),40) occurs(action(("unstack","f","r")),41) occurs(action(("stack","f","t")),42) occurs(action(("unstack","r","n")),43) occurs(action(("stack","r","e")),44) occurs(action(("unstack","b","a")),45) occurs(action(("stack","b","r")),46) occurs(action(("unstack","f","t")),47) occurs(action(("stack","f","b")),48) occurs(action(("pick-up","m")),49) occurs(action(("stack","m","f")),50) occurs(action(("pick-up","g")),51) occurs(action(("stack","g","m")),52) occurs(action(("unstack","t","q")),53) occurs(action(("stack","t","g")),54) occurs(action(("unstack","j","l")),55) occurs(action(("stack","j","t")),56) occurs(action(("unstack","l","h")),57) occurs(action(("stack","l","j")),58) occurs(action(("unstack","p","i")),59) occurs(action(("stack","p","l")),60) occurs(action(("pick-up","k")),61) occurs(action(("stack","k","p")),62) occurs(action(("pick-up","c")),63) occurs(action(("stack","c","k")),64) occurs(action(("pick-up","d")),65) occurs(action(("stack","d","c")),66) occurs(action(("pick-up","s")),67) occurs(action(("stack","s","d")),68) occurs(action(("pick-up","o")),69) occurs(action(("stack","o","s")),70) occurs(action(("pick-up","i")),71) occurs(action(("stack","i","o")),72) occurs(action(("pick-up","q")),73) occurs(action(("stack","q","i")),74) occurs(action(("pick-up","a")),75) occurs(action(("stack","a","q")),76) occurs(action(("pick-up","n")),77) occurs(action(("stack","n","a")),78) occurs(action(("pick-up","h")),79) occurs(action(("stack","h","n")),80)
SATISFIABLE
Models : 1+
Calls : 1
Time : 3.496s (Solving: 0.45s 1st Model: 0.44s Unsat: 0.00s)
CPU Time : 3.460s
Choices : 26866 (Domain: 26866)
Conflicts : 188 (Analyzed: 188)
Restarts : 2 (Average: 94.00 Last: 49)
Model-Level : 559.0
Problems : 1 (Average Length: 82.00 Splits: 0)
Lemmas : 188 (Deleted: 0)
Binary : 1 (Ratio: 0.53%)
Ternary : 0 (Ratio: 0.00%)
Conflict : 188 (Average Length: 196.0 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 188 (Average: 147.35 Max: 1307 Sum: 27701)
Executed : 171 (Average: 140.37 Max: 1307 Sum: 26389 Ratio: 95.26%)
Bounded : 17 (Average: 77.18 Max: 82 Sum: 1312 Ratio: 4.74%)
Rules : 0
Atoms : 0
Bodies : 0
Tight : Yes
Variables : 108468 (Eliminated: 0 Frozen: 34924)
Constraints : 691115 (Binary: 94.1% Ternary: 4.6% Other: 1.3%)
Memory Peak : 415MB
Max. Length : 80 steps
Sol. Length : 80 steps
Models : 1