221 lines
8.7 KiB
Plaintext
221 lines
8.7 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-29.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-29.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.011s wall-clock]
|
|
Preparing model... [0.010s CPU, 0.007s wall-clock]
|
|
Generated 21 rules.
|
|
Computing model... [0.100s CPU, 0.100s wall-clock]
|
|
702 relevant atoms
|
|
462 auxiliary atoms
|
|
1164 final queue length
|
|
1979 total queue pushes
|
|
Completing instantiation... [0.120s CPU, 0.124s wall-clock]
|
|
Instantiating: [0.240s CPU, 0.247s 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.009s wall-clock]
|
|
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
|
|
Choosing groups...
|
|
15 uncovered facts
|
|
Choosing groups: [0.020s CPU, 0.008s wall-clock]
|
|
Building translation key... [0.000s CPU, 0.003s wall-clock]
|
|
Computing fact groups: [0.060s CPU, 0.061s wall-clock]
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
|
|
Building dictionary for full mutex groups... [0.000s CPU, 0.003s wall-clock]
|
|
Building mutex information...
|
|
Building mutex information: [0.010s CPU, 0.004s wall-clock]
|
|
Translating task...
|
|
Processing axioms...
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
|
Processing axioms: [0.010s CPU, 0.006s wall-clock]
|
|
Translating task: [0.140s CPU, 0.135s wall-clock]
|
|
574 effect conditions simplified
|
|
0 implied preconditions added
|
|
Detecting unreachable propositions...
|
|
0 operators removed
|
|
0 axioms removed
|
|
28 propositions removed
|
|
Detecting unreachable propositions: [0.070s CPU, 0.077s wall-clock]
|
|
Reordering and filtering variables...
|
|
29 of 29 variables necessary.
|
|
15 of 29 mutex groups necessary.
|
|
392 of 392 operators necessary.
|
|
0 of 0 axiom rules necessary.
|
|
Reordering and filtering variables: [0.050s CPU, 0.042s wall-clock]
|
|
Translator variables: 29
|
|
Translator derived variables: 0
|
|
Translator facts: 240
|
|
Translator goal facts: 13
|
|
Translator mutex groups: 15
|
|
Translator total mutex groups size: 225
|
|
Translator operators: 392
|
|
Translator axioms: 0
|
|
Translator task size: 3405
|
|
Translator peak memory: 34904 KB
|
|
Writing output... [0.050s CPU, 0.057s wall-clock]
|
|
Done! [0.630s CPU, 0.650s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 0.55s
|
|
Memory: 78MB
|
|
|
|
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: 78MB (+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.55s
|
|
Memory: 144MB (+66MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.03s
|
|
Memory: 146MB (+2MB)
|
|
UNSAT
|
|
Iteration Time: 0.69s
|
|
|
|
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.68s
|
|
Memory: 186MB (+40MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.03s
|
|
Memory: 187MB (+1MB)
|
|
UNSAT
|
|
Iteration Time: 0.84s
|
|
|
|
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.51s
|
|
Memory: 214MB (+27MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.04s
|
|
Memory: 216MB (+2MB)
|
|
UNSAT
|
|
Iteration Time: 0.68s
|
|
|
|
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.54s
|
|
Memory: 242MB (+26MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.07s
|
|
Memory: 249MB (+7MB)
|
|
UNSAT
|
|
Iteration Time: 0.75s
|
|
|
|
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.88s
|
|
Memory: 297MB (+48MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.20s
|
|
Memory: 306MB (+9MB)
|
|
UNSAT
|
|
Iteration Time: 1.22s
|
|
|
|
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.52s
|
|
Memory: 328MB (+22MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.27s
|
|
Memory: 339MB (+11MB)
|
|
UNSAT
|
|
Iteration Time: 0.94s
|
|
|
|
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.53s
|
|
Memory: 356MB (+17MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.44s
|
|
Memory: 369MB (+13MB)
|
|
UNSAT
|
|
Iteration Time: 1.12s
|
|
|
|
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.54s
|
|
Memory: 384MB (+15MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Answer: 1
|
|
occurs(action(("unstack","a","j")),1) occurs(action(("stack","a","g")),2) occurs(action(("unstack","j","h")),3) occurs(action(("put-down","j")),4) occurs(action(("unstack","h","m")),5) occurs(action(("put-down","h")),6) occurs(action(("unstack","a","g")),7) occurs(action(("stack","a","h")),8) occurs(action(("unstack","g","d")),9) occurs(action(("stack","g","f")),10) occurs(action(("unstack","m","k")),11) occurs(action(("stack","m","a")),12) occurs(action(("unstack","d","i")),13) occurs(action(("stack","d","m")),14) occurs(action(("unstack","i","n")),15) occurs(action(("stack","i","j")),16) occurs(action(("unstack","g","f")),17) occurs(action(("stack","g","d")),18) occurs(action(("unstack","k","c")),19) occurs(action(("stack","k","g")),20) occurs(action(("unstack","c","l")),21) occurs(action(("stack","c","k")),22) occurs(action(("pick-up","n")),23) occurs(action(("stack","n","c")),24) occurs(action(("unstack","l","b")),25) occurs(action(("stack","l","f")),26) occurs(action(("unstack","i","j")),27) occurs(action(("stack","i","n")),28) occurs(action(("pick-up","j")),29) occurs(action(("stack","j","i")),30) occurs(action(("unstack","l","f")),31) occurs(action(("put-down","l")),32) occurs(action(("unstack","b","e")),33) occurs(action(("stack","b","j")),34) occurs(action(("pick-up","f")),35) occurs(action(("stack","f","b")),36) occurs(action(("pick-up","l")),37) occurs(action(("stack","l","f")),38) occurs(action(("pick-up","e")),39) occurs(action(("stack","e","l")),40)
|
|
Solving Time: 0.48s
|
|
Memory: 398MB (+14MB)
|
|
SAT
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 9
|
|
Time : 7.996s (Solving: 1.19s 1st Model: 0.42s Unsat: 0.77s)
|
|
CPU Time : 7.990s
|
|
|
|
Choices : 14301
|
|
Conflicts : 2119 (Analyzed: 2112)
|
|
Restarts : 23 (Average: 91.83 Last: 98)
|
|
Model-Level : 94.0
|
|
Problems : 9 (Average Length: 22.00 Splits: 0)
|
|
Lemmas : 2303 (Deleted: 0)
|
|
Binary : 196 (Ratio: 8.51%)
|
|
Ternary : 87 (Ratio: 3.78%)
|
|
Conflict : 2112 (Average Length: 155.5 Ratio: 91.71%)
|
|
Loop : 191 (Average Length: 44.7 Ratio: 8.29%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 2112 (Average: 7.17 Max: 409 Sum: 15137)
|
|
Executed : 2047 (Average: 6.65 Max: 409 Sum: 14054 Ratio: 92.85%)
|
|
Bounded : 65 (Average: 16.66 Max: 40 Sum: 1083 Ratio: 7.15%)
|
|
|
|
Rules : 240680
|
|
Atoms : 240680
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 113695 (Eliminated: 0 Frozen: 108982)
|
|
Constraints : 354710 (Binary: 85.6% Ternary: 11.0% Other: 3.4%)
|
|
|
|
Memory Peak : 398MB
|
|
Max. Length : 40 steps
|
|
Sol. Length : 40 steps
|
|
|
|
|