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

247 lines
9.9 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-35.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-35.pddl
Parsing...
Parsing: [0.010s CPU, 0.011s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.002s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.009s wall-clock]
Preparing model... [0.010s CPU, 0.006s wall-clock]
Generated 21 rules.
Computing model... [0.100s CPU, 0.107s wall-clock]
1005 relevant atoms
663 auxiliary atoms
1668 final queue length
2863 total queue pushes
Completing instantiation... [0.180s CPU, 0.174s wall-clock]
Instantiating: [0.300s CPU, 0.299s wall-clock]
Computing fact groups...
Finding invariants...
10 initial candidates
Finding invariants: [0.020s CPU, 0.022s wall-clock]
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
Instantiating groups... [0.020s CPU, 0.010s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
Choosing groups...
18 uncovered facts
Choosing groups: [0.010s CPU, 0.011s wall-clock]
Building translation key... [0.000s CPU, 0.004s wall-clock]
Computing fact groups: [0.070s CPU, 0.074s wall-clock]
Building STRIPS to SAS dictionary... [0.010s CPU, 0.002s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.007s wall-clock]
Building mutex information...
Building mutex information: [0.010s CPU, 0.007s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.010s CPU, 0.009s wall-clock]
Translating task: [0.190s CPU, 0.199s wall-clock]
850 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
34 propositions removed
Detecting unreachable propositions: [0.120s CPU, 0.113s wall-clock]
Reordering and filtering variables...
35 of 35 variables necessary.
18 of 35 mutex groups necessary.
578 of 578 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.060s CPU, 0.064s wall-clock]
Translator variables: 35
Translator derived variables: 0
Translator facts: 342
Translator goal facts: 16
Translator mutex groups: 18
Translator total mutex groups size: 324
Translator operators: 578
Translator axioms: 0
Translator task size: 5001
Translator peak memory: 35928 KB
Writing output... [0.080s CPU, 0.084s wall-clock]
Done! [0.860s CPU, 0.871s wall-clock]
planner.py version 0.0.1
Time: 1.10s
Memory: 113MB
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.01s
Memory: 113MB (+0MB)
UNSAT
Iteration Time: 0.01s
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: 1.10s
Memory: 230MB (+117MB)
Unblocking actions...
Solving...
Solving Time: 0.05s
Memory: 230MB (+0MB)
UNSAT
Iteration Time: 1.37s
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: 1.37s
Memory: 302MB (+72MB)
Unblocking actions...
Solving...
Solving Time: 0.06s
Memory: 302MB (+0MB)
UNSAT
Iteration Time: 1.70s
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: 1.02s
Memory: 349MB (+47MB)
Unblocking actions...
Solving...
Solving Time: 0.07s
Memory: 349MB (+0MB)
UNSAT
Iteration Time: 1.38s
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: 1.06s
Memory: 397MB (+48MB)
Unblocking actions...
Solving...
Solving Time: 0.08s
Memory: 397MB (+0MB)
UNSAT
Iteration Time: 1.46s
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: 1.81s
Memory: 493MB (+96MB)
Unblocking actions...
Solving...
Solving Time: 0.15s
Memory: 494MB (+1MB)
UNSAT
Iteration Time: 2.28s
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: 1.03s
Memory: 542MB (+48MB)
Unblocking actions...
Solving...
Solving Time: 0.17s
Memory: 542MB (+0MB)
UNSAT
Iteration Time: 1.52s
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: 1.06s
Memory: 589MB (+47MB)
Unblocking actions...
Solving...
Solving Time: 0.20s
Memory: 590MB (+1MB)
UNSAT
Iteration Time: 1.57s
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: 1.09s
Memory: 637MB (+47MB)
Unblocking actions...
Solving...
Solving Time: 0.28s
Memory: 638MB (+1MB)
UNSAT
Iteration Time: 1.69s
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: 1.14s
Memory: 685MB (+47MB)
Unblocking actions...
Solving...
Solving Time: 0.64s
Memory: 696MB (+11MB)
UNSAT
Iteration Time: 2.11s
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: 1.18s
Memory: 733MB (+37MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("unstack","q","a")),1) occurs(action(("put-down","q")),2) occurs(action(("unstack","g","d")),3) occurs(action(("stack","g","h")),4) occurs(action(("unstack","l","f")),5) occurs(action(("put-down","l")),6) occurs(action(("unstack","a","j")),7) occurs(action(("stack","a","p")),8) occurs(action(("unstack","j","i")),9) occurs(action(("put-down","j")),10) occurs(action(("unstack","d","c")),11) occurs(action(("put-down","d")),12) occurs(action(("unstack","f","e")),13) occurs(action(("stack","f","d")),14) occurs(action(("unstack","e","k")),15) occurs(action(("stack","e","c")),16) occurs(action(("pick-up","k")),17) occurs(action(("stack","k","f")),18) occurs(action(("unstack","i","b")),19) occurs(action(("stack","i","k")),20) occurs(action(("unstack","b","m")),21) occurs(action(("stack","b","e")),22) occurs(action(("unstack","a","p")),23) occurs(action(("stack","a","m")),24) occurs(action(("unstack","b","e")),25) occurs(action(("stack","b","i")),26) occurs(action(("unstack","g","h")),27) occurs(action(("stack","g","b")),28) occurs(action(("unstack","a","m")),29) occurs(action(("stack","a","g")),30) occurs(action(("pick-up","p")),31) occurs(action(("stack","p","a")),32) occurs(action(("pick-up","m")),33) occurs(action(("stack","m","p")),34) occurs(action(("unstack","e","c")),35) occurs(action(("stack","e","m")),36) occurs(action(("unstack","c","o")),37) occurs(action(("stack","c","e")),38) occurs(action(("unstack","h","n")),39) occurs(action(("stack","h","c")),40) occurs(action(("pick-up","j")),41) occurs(action(("stack","j","h")),42) occurs(action(("pick-up","o")),43) occurs(action(("stack","o","j")),44) occurs(action(("pick-up","l")),45) occurs(action(("stack","l","o")),46) occurs(action(("pick-up","n")),47) occurs(action(("stack","n","l")),48) occurs(action(("pick-up","q")),49) occurs(action(("stack","q","n")),50)
Solving Time: 0.32s
Memory: 747MB (+14MB)
SAT
SATISFIABLE
Models : 1+
Calls : 11
Time : 18.029s (Solving: 1.07s 1st Model: 0.17s Unsat: 0.89s)
CPU Time : 18.020s
Choices : 63039
Conflicts : 3261 (Analyzed: 3253)
Restarts : 33 (Average: 98.58 Last: 76)
Model-Level : 138.0
Problems : 11 (Average Length: 27.00 Splits: 0)
Lemmas : 3253 (Deleted: 1199)
Binary : 219 (Ratio: 6.73%)
Ternary : 79 (Ratio: 2.43%)
Conflict : 3253 (Average Length: 355.9 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 3253 (Average: 19.31 Max: 1271 Sum: 62805)
Executed : 3187 (Average: 18.92 Max: 1271 Sum: 61548 Ratio: 98.00%)
Bounded : 66 (Average: 19.05 Max: 49 Sum: 1257 Ratio: 2.00%)
Rules : 511670
Atoms : 511670
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 104733 (Eliminated: 0 Frozen: 98339)
Constraints : 335582 (Binary: 93.9% Ternary: 4.6% Other: 1.5%)
Memory Peak : 748MB
Max. Length : 50 steps
Sol. Length : 50 steps