1
0
Fork 0
tplp-planning-benchmark/fd-pb-e4/ipc-2000_blocks-strips-type...

273 lines
11 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-34.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-34.pddl
Parsing...
Parsing: [0.010s CPU, 0.013s 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.010s CPU, 0.009s wall-clock]
Preparing model... [0.000s CPU, 0.007s wall-clock]
Generated 21 rules.
Computing model... [0.120s CPU, 0.111s wall-clock]
898 relevant atoms
592 auxiliary atoms
1490 final queue length
2548 total queue pushes
Completing instantiation... [0.150s CPU, 0.155s wall-clock]
Instantiating: [0.280s CPU, 0.288s wall-clock]
Computing fact groups...
Finding invariants...
10 initial candidates
Finding invariants: [0.020s CPU, 0.020s wall-clock]
Checking invariant weight... [0.010s CPU, 0.002s wall-clock]
Instantiating groups... [0.000s CPU, 0.009s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
Choosing groups...
17 uncovered facts
Choosing groups: [0.010s CPU, 0.010s wall-clock]
Building translation key... [0.000s CPU, 0.003s wall-clock]
Computing fact groups: [0.070s CPU, 0.066s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.004s wall-clock]
Building mutex information...
Building mutex information: [0.010s CPU, 0.006s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.010s CPU, 0.008s wall-clock]
Translating task: [0.180s CPU, 0.180s wall-clock]
752 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
32 propositions removed
Detecting unreachable propositions: [0.090s CPU, 0.099s wall-clock]
Reordering and filtering variables...
33 of 33 variables necessary.
17 of 33 mutex groups necessary.
512 of 512 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.060s CPU, 0.057s wall-clock]
Translator variables: 33
Translator derived variables: 0
Translator facts: 306
Translator goal facts: 15
Translator mutex groups: 17
Translator total mutex groups size: 289
Translator operators: 512
Translator axioms: 0
Translator task size: 4435
Translator peak memory: 35672 KB
Writing output... [0.070s CPU, 0.075s wall-clock]
Done! [0.780s CPU, 0.798s wall-clock]
planner.py version 0.0.1
Time: 0.93s
Memory: 102MB
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: 102MB (+0MB)
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.23s
Memory: 117MB (+15MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 117MB (+0MB)
UNSAT
Iteration Time: 0.28s
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.23s
Memory: 125MB (+8MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 133MB (+8MB)
UNSAT
Iteration Time: 0.30s
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.24s
Memory: 133MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 141MB (+8MB)
UNSAT
Iteration Time: 0.31s
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.24s
Memory: 144MB (+3MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 155MB (+11MB)
UNSAT
Iteration Time: 0.33s
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.24s
Memory: 158MB (+3MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 176MB (+18MB)
UNSAT
Iteration Time: 0.33s
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.24s
Memory: 176MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 191MB (+15MB)
UNSAT
Iteration Time: 0.33s
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.25s
Memory: 191MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.02s
Memory: 217MB (+26MB)
UNSAT
Iteration Time: 0.35s
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.25s
Memory: 217MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.03s
Memory: 233MB (+16MB)
UNSAT
Iteration Time: 0.37s
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.25s
Memory: 233MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.02s
Memory: 251MB (+18MB)
UNSAT
Iteration Time: 0.36s
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.25s
Memory: 251MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.07s
Memory: 264MB (+13MB)
UNSAT
Iteration Time: 0.42s
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.26s
Memory: 264MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.95s
Memory: 277MB (+13MB)
UNSAT
Iteration Time: 1.29s
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.26s
Memory: 274MB (+-3MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("unstack","e","f")),1) occurs(action(("put-down","e")),2) occurs(action(("unstack","f","h")),3) occurs(action(("put-down","f")),4) occurs(action(("unstack","h","b")),5) occurs(action(("put-down","h")),6) occurs(action(("unstack","b","c")),7) occurs(action(("put-down","b")),8) occurs(action(("unstack","c","m")),9) occurs(action(("stack","c","h")),10) occurs(action(("unstack","m","d")),11) occurs(action(("stack","m","b")),12) occurs(action(("unstack","d","a")),13) occurs(action(("put-down","d")),14) occurs(action(("unstack","l","o")),15) occurs(action(("put-down","l")),16) occurs(action(("unstack","a","p")),17) occurs(action(("stack","a","f")),18) occurs(action(("unstack","p","n")),19) occurs(action(("stack","p","o")),20) occurs(action(("unstack","a","f")),21) occurs(action(("stack","a","p")),22) occurs(action(("unstack","n","g")),23) occurs(action(("stack","n","a")),24) occurs(action(("unstack","m","b")),25) occurs(action(("stack","m","n")),26) occurs(action(("pick-up","l")),27) occurs(action(("stack","l","m")),28) occurs(action(("unstack","c","h")),29) occurs(action(("stack","c","l")),30) occurs(action(("pick-up","e")),31) occurs(action(("stack","e","c")),32) occurs(action(("unstack","g","i")),33) occurs(action(("stack","g","e")),34) occurs(action(("unstack","i","k")),35) occurs(action(("put-down","i")),36) occurs(action(("unstack","k","j")),37) occurs(action(("stack","k","h")),38) occurs(action(("pick-up","j")),39) occurs(action(("stack","j","g")),40) occurs(action(("unstack","k","h")),41) occurs(action(("stack","k","j")),42) occurs(action(("pick-up","b")),43) occurs(action(("stack","b","k")),44) occurs(action(("pick-up","f")),45) occurs(action(("stack","f","b")),46) occurs(action(("pick-up","h")),47) occurs(action(("stack","h","f")),48) occurs(action(("pick-up","i")),49) occurs(action(("put-down","i")),50) occurs(action(("unstack","h","f")),51) occurs(action(("stack","h","f")),52) occurs(action(("unstack","h","f")),53) occurs(action(("stack","h","i")),54) occurs(action(("unstack","h","i")),55) occurs(action(("stack","h","f")),56) occurs(action(("pick-up","d")),57) occurs(action(("stack","d","h")),58) occurs(action(("pick-up","i")),59) occurs(action(("stack","i","d")),60)
Solving Time: 0.05s
Memory: 305MB (+31MB)
SAT
SATISFIABLE
Models : 1+
Calls : 13
Time : 6.023s (Solving: 1.07s 1st Model: 0.03s Unsat: 1.04s)
CPU Time : 6.020s
Choices : 10561
Conflicts : 3622 (Analyzed: 3613)
Restarts : 41 (Average: 88.12 Last: 58)
Model-Level : 80.0
Problems : 13 (Average Length: 32.00 Splits: 0)
Lemmas : 3613 (Deleted: 1006)
Binary : 337 (Ratio: 9.33%)
Ternary : 127 (Ratio: 3.52%)
Conflict : 3613 (Average Length: 738.4 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 3613 (Average: 4.08 Max: 253 Sum: 14756)
Executed : 3472 (Average: 2.89 Max: 253 Sum: 10428 Ratio: 70.67%)
Bounded : 141 (Average: 30.70 Max: 57 Sum: 4328 Ratio: 29.33%)
Rules : 406674
Atoms : 406674
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 52914 (Eliminated: 0 Frozen: 44692)
Constraints : 281117 (Binary: 93.5% Ternary: 4.8% Other: 1.7%)
Memory Peak : 305MB
Max. Length : 60 steps
Sol. Length : 60 steps