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

304 lines
12 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-44.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-44.pddl
Parsing...
Parsing: [0.020s CPU, 0.016s 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.010s wall-clock]
Generated 21 rules.
Computing model... [0.200s CPU, 0.193s wall-clock]
1493 relevant atoms
987 auxiliary atoms
2480 final queue length
4289 total queue pushes
Completing instantiation... [0.290s CPU, 0.294s wall-clock]
Instantiating: [0.510s CPU, 0.515s wall-clock]
Computing fact groups...
Finding invariants...
10 initial candidates
Finding invariants: [0.030s CPU, 0.022s wall-clock]
Checking invariant weight... [0.000s CPU, 0.003s wall-clock]
Instantiating groups... [0.020s CPU, 0.017s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.004s wall-clock]
Choosing groups...
22 uncovered facts
Choosing groups: [0.030s CPU, 0.020s wall-clock]
Building translation key... [0.000s CPU, 0.006s wall-clock]
Computing fact groups: [0.110s CPU, 0.111s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.003s wall-clock]
Building dictionary for full mutex groups... [0.020s CPU, 0.006s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.010s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.020s CPU, 0.016s wall-clock]
Translating task: [0.350s CPU, 0.348s wall-clock]
1302 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
42 propositions removed
Detecting unreachable propositions: [0.190s CPU, 0.190s wall-clock]
Reordering and filtering variables...
43 of 43 variables necessary.
22 of 43 mutex groups necessary.
882 of 882 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.100s CPU, 0.104s wall-clock]
Translator variables: 43
Translator derived variables: 0
Translator facts: 506
Translator goal facts: 20
Translator mutex groups: 22
Translator total mutex groups size: 484
Translator operators: 882
Translator axioms: 0
Translator task size: 7605
Translator peak memory: 40908 KB
Writing output... [0.130s CPU, 0.138s wall-clock]
Done! [1.450s CPU, 1.460s wall-clock]
planner.py version 0.0.1
Time: 0.25s
Memory: 64MB
Iteration 1
Queue: [(0,0,0,True), (1,5,0,True), (2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 0
Solving...
Solving Time: 0.00s
Memory: 65MB (+1MB)
UNSAT
Iteration Time: 0.00s
Iteration 2
Queue: [(1,5,0,True), (2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 0
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.10s
Memory: 68MB (+3MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 70MB (+2MB)
UNSAT
Iteration Time: 0.13s
Iteration 3
Queue: [(2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 5
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.10s
Memory: 74MB (+4MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 76MB (+2MB)
UNSAT
Iteration Time: 0.15s
Iteration 4
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 10
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 0.12s
Memory: 82MB (+6MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 84MB (+2MB)
UNSAT
Iteration Time: 0.17s
Iteration 5
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 15
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
Grounding Time: 0.11s
Memory: 89MB (+5MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 92MB (+3MB)
UNSAT
Iteration Time: 0.17s
Iteration 6
Queue: [(5,25,0,True), (6,30,0,True)]
Grounded Until: 20
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
Grounding Time: 0.12s
Memory: 96MB (+4MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 100MB (+4MB)
UNSAT
Iteration Time: 0.17s
Iteration 7
Queue: [(6,30,0,True)]
Grounded Until: 25
Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
Grounding Time: 0.15s
Memory: 107MB (+7MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 108MB (+1MB)
UNSAT
Iteration Time: 0.21s
Iteration 8
Queue: [(7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True)]
Grounded Until: 30
Grounding... [('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('check', [35])]
Grounding Time: 0.11s
Memory: 114MB (+6MB)
Unblocking actions...
Solving...
Solving Time: 0.02s
Memory: 120MB (+6MB)
UNSAT
Iteration Time: 0.18s
Iteration 9
Queue: [(8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True)]
Grounded Until: 35
Grounding... [('step', [36]), ('step', [37]), ('step', [38]), ('step', [39]), ('step', [40]), ('check', [40])]
Grounding Time: 0.12s
Memory: 123MB (+3MB)
Unblocking actions...
Solving...
Solving Time: 0.02s
Memory: 125MB (+2MB)
UNSAT
Iteration Time: 0.19s
Iteration 10
Queue: [(9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True)]
Grounded Until: 40
Grounding... [('step', [41]), ('step', [42]), ('step', [43]), ('step', [44]), ('step', [45]), ('check', [45])]
Grounding Time: 0.12s
Memory: 129MB (+4MB)
Unblocking actions...
Solving...
Solving Time: 0.03s
Memory: 132MB (+3MB)
UNSAT
Iteration Time: 0.22s
Iteration 11
Queue: [(10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True)]
Grounded Until: 45
Grounding... [('step', [46]), ('step', [47]), ('step', [48]), ('step', [49]), ('step', [50]), ('check', [50])]
Grounding Time: 0.12s
Memory: 135MB (+3MB)
Unblocking actions...
Solving...
Solving Time: 0.03s
Memory: 138MB (+3MB)
UNSAT
Iteration Time: 0.22s
Iteration 12
Queue: [(11,55,0,True), (12,60,0,True), (13,65,0,True)]
Grounded Until: 50
Grounding... [('step', [51]), ('step', [52]), ('step', [53]), ('step', [54]), ('step', [55]), ('check', [55])]
Grounding Time: 0.12s
Memory: 141MB (+3MB)
Unblocking actions...
Solving...
Solving Time: 0.05s
Memory: 148MB (+7MB)
UNSAT
Iteration Time: 0.24s
Iteration 13
Queue: [(12,60,0,True), (13,65,0,True)]
Grounded Until: 55
Grounding... [('step', [56]), ('step', [57]), ('step', [58]), ('step', [59]), ('step', [60]), ('check', [60])]
Grounding Time: 0.19s
Memory: 157MB (+9MB)
Unblocking actions...
Solving...
Solving Time: 0.09s
Memory: 159MB (+2MB)
UNSAT
Iteration Time: 0.35s
Iteration 14
Queue: [(13,65,0,True)]
Grounded Until: 60
Grounding... [('step', [61]), ('step', [62]), ('step', [63]), ('step', [64]), ('step', [65]), ('check', [65])]
Grounding Time: 0.11s
Memory: 165MB (+6MB)
Unblocking actions...
Solving...
Solving Time: 0.13s
Memory: 167MB (+2MB)
UNSAT
Iteration Time: 0.32s
Iteration 15
Queue: [(14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True), (18,90,0,True), (19,95,0,True), (20,100,0,True)]
Grounded Until: 65
Grounding... [('step', [66]), ('step', [67]), ('step', [68]), ('step', [69]), ('step', [70]), ('check', [70])]
Grounding Time: 0.12s
Memory: 172MB (+5MB)
Unblocking actions...
Solving...
Solving Time: 0.05s
Memory: 175MB (+3MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 0.21s
Memory: 181MB (+6MB)
Answer: 1
occurs(action(("unstack","f","l")),1) occurs(action(("put-down","f")),2) occurs(action(("unstack","l","d")),3) occurs(action(("put-down","l")),4) occurs(action(("unstack","d","i")),5) occurs(action(("put-down","d")),6) occurs(action(("unstack","i","r")),7) occurs(action(("stack","i","l")),8) occurs(action(("unstack","r","a")),9) occurs(action(("stack","r","d")),10) occurs(action(("unstack","a","j")),11) occurs(action(("put-down","a")),12) occurs(action(("unstack","j","h")),13) occurs(action(("put-down","j")),14) occurs(action(("unstack","h","s")),15) occurs(action(("put-down","h")),16) occurs(action(("unstack","s","q")),17) occurs(action(("stack","s","j")),18) occurs(action(("unstack","q","g")),19) occurs(action(("put-down","q")),20) occurs(action(("unstack","g","u")),21) occurs(action(("put-down","g")),22) occurs(action(("pick-up","a")),23) occurs(action(("stack","a","g")),24) occurs(action(("unstack","u","o")),25) occurs(action(("put-down","u")),26) occurs(action(("unstack","o","p")),27) occurs(action(("put-down","o")),28) occurs(action(("unstack","p","k")),29) occurs(action(("stack","p","a")),30) occurs(action(("pick-up","o")),31) occurs(action(("stack","o","p")),32) occurs(action(("unstack","r","d")),33) occurs(action(("stack","r","o")),34) occurs(action(("unstack","i","l")),35) occurs(action(("stack","i","r")),36) occurs(action(("pick-up","b")),37) occurs(action(("stack","b","i")),38) occurs(action(("pick-up","h")),39) occurs(action(("stack","h","b")),40) occurs(action(("unstack","k","c")),41) occurs(action(("stack","k","h")),42) occurs(action(("unstack","s","j")),43) occurs(action(("stack","s","k")),44) occurs(action(("pick-up","t")),45) occurs(action(("stack","t","s")),46) occurs(action(("pick-up","d")),47) occurs(action(("stack","d","t")),48) occurs(action(("unstack","c","e")),49) occurs(action(("put-down","c")),50) occurs(action(("unstack","e","n")),51) occurs(action(("stack","e","d")),52) occurs(action(("pick-up","u")),53) occurs(action(("stack","u","e")),54) occurs(action(("pick-up","f")),55) occurs(action(("stack","f","u")),56) occurs(action(("unstack","n","m")),57) occurs(action(("stack","n","f")),58) occurs(action(("pick-up","m")),59) occurs(action(("stack","m","n")),60) occurs(action(("pick-up","c")),61) occurs(action(("stack","c","m")),62) occurs(action(("pick-up","j")),63) occurs(action(("stack","j","c")),64) occurs(action(("pick-up","l")),65) occurs(action(("stack","l","j")),66) occurs(action(("pick-up","q")),67) occurs(action(("put-down","q")),68) occurs(action(("pick-up","q")),69) occurs(action(("stack","q","l")),70)
SATISFIABLE
Models : 1+
Calls : 15
Time : 3.222s (Solving: 0.29s 1st Model: 0.02s Unsat: 0.27s)
CPU Time : 3.204s
Choices : 12891 (Domain: 12891)
Conflicts : 196 (Analyzed: 186)
Restarts : 0
Model-Level : 1100.0
Problems : 15 (Average Length: 37.00 Splits: 0)
Lemmas : 186 (Deleted: 0)
Binary : 51 (Ratio: 27.42%)
Ternary : 0 (Ratio: 0.00%)
Conflict : 186 (Average Length: 171.4 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 186 (Average: 77.30 Max: 904 Sum: 14377)
Executed : 122 (Average: 63.78 Max: 904 Sum: 11863 Ratio: 82.51%)
Bounded : 64 (Average: 39.28 Max: 47 Sum: 2514 Ratio: 17.49%)
Rules : 23350
Atoms : 23350
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 102094 (Eliminated: 0 Frozen: 33033)
Constraints : 549518 (Binary: 94.1% Ternary: 4.6% Other: 1.3%)
Memory Peak : 186MB
Max. Length : 70 steps
Sol. Length : 70 steps
Models : 1