273 lines
11 KiB
Plaintext
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-33.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-33.pddl
|
|
Parsing...
|
|
Parsing: [0.000s CPU, 0.011s wall-clock]
|
|
Normalizing task... [0.010s 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.010s wall-clock]
|
|
Preparing model... [0.000s CPU, 0.006s wall-clock]
|
|
Generated 21 rules.
|
|
Computing model... [0.100s CPU, 0.103s wall-clock]
|
|
898 relevant atoms
|
|
592 auxiliary atoms
|
|
1490 final queue length
|
|
2549 total queue pushes
|
|
Completing instantiation... [0.150s CPU, 0.155s wall-clock]
|
|
Instantiating: [0.270s CPU, 0.279s wall-clock]
|
|
Computing fact groups...
|
|
Finding invariants...
|
|
10 initial candidates
|
|
Finding invariants: [0.020s CPU, 0.019s wall-clock]
|
|
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
|
|
Instantiating groups... [0.010s 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.011s wall-clock]
|
|
Building translation key... [0.000s CPU, 0.004s wall-clock]
|
|
Computing fact groups: [0.070s CPU, 0.069s wall-clock]
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
|
|
Building dictionary for full mutex groups... [0.010s CPU, 0.004s wall-clock]
|
|
Building mutex information...
|
|
Building mutex information: [0.000s 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.179s 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.110s CPU, 0.101s 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.050s CPU, 0.055s 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.077s wall-clock]
|
|
Done! [0.780s CPU, 0.791s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 0.92s
|
|
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.97s
|
|
Memory: 209MB (+107MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.05s
|
|
Memory: 209MB (+0MB)
|
|
UNSAT
|
|
Iteration Time: 1.24s
|
|
|
|
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.87s
|
|
Memory: 255MB (+46MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.06s
|
|
Memory: 255MB (+0MB)
|
|
UNSAT
|
|
Iteration Time: 1.17s
|
|
|
|
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.22s
|
|
Memory: 324MB (+69MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.07s
|
|
Memory: 325MB (+1MB)
|
|
UNSAT
|
|
Iteration Time: 1.55s
|
|
|
|
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.88s
|
|
Memory: 370MB (+45MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.10s
|
|
Memory: 371MB (+1MB)
|
|
UNSAT
|
|
Iteration Time: 1.25s
|
|
|
|
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.93s
|
|
Memory: 417MB (+46MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.18s
|
|
Memory: 430MB (+13MB)
|
|
UNSAT
|
|
Iteration Time: 1.38s
|
|
|
|
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.65s
|
|
Memory: 515MB (+85MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.23s
|
|
Memory: 528MB (+13MB)
|
|
UNSAT
|
|
Iteration Time: 2.16s
|
|
|
|
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.89s
|
|
Memory: 560MB (+32MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.48s
|
|
Memory: 575MB (+15MB)
|
|
UNSAT
|
|
Iteration Time: 1.65s
|
|
|
|
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.91s
|
|
Memory: 603MB (+28MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.29s
|
|
Memory: 623MB (+20MB)
|
|
UNSAT
|
|
Iteration Time: 1.49s
|
|
|
|
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.93s
|
|
Memory: 651MB (+28MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.29s
|
|
Memory: 672MB (+21MB)
|
|
UNSAT
|
|
Iteration Time: 1.52s
|
|
|
|
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.95s
|
|
Memory: 696MB (+24MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.59s
|
|
Memory: 719MB (+23MB)
|
|
UNSAT
|
|
Iteration Time: 1.85s
|
|
|
|
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.98s
|
|
Memory: 739MB (+20MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 6.82s
|
|
Memory: 764MB (+25MB)
|
|
UNSAT
|
|
Iteration Time: 8.11s
|
|
|
|
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: 1.03s
|
|
Memory: 800MB (+36MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Answer: 1
|
|
occurs(action(("unstack","f","l")),1) occurs(action(("put-down","f")),2) occurs(action(("unstack","l","m")),3) occurs(action(("put-down","l")),4) occurs(action(("unstack","m","j")),5) occurs(action(("stack","m","l")),6) occurs(action(("unstack","j","p")),7) occurs(action(("put-down","j")),8) occurs(action(("unstack","p","n")),9) occurs(action(("put-down","p")),10) occurs(action(("unstack","n","i")),11) occurs(action(("stack","n","h")),12) occurs(action(("unstack","i","b")),13) occurs(action(("stack","i","p")),14) occurs(action(("unstack","b","d")),15) occurs(action(("put-down","b")),16) occurs(action(("unstack","d","c")),17) occurs(action(("put-down","d")),18) occurs(action(("unstack","o","g")),19) occurs(action(("put-down","o")),20) occurs(action(("unstack","c","k")),21) occurs(action(("stack","c","o")),22) occurs(action(("unstack","k","a")),23) occurs(action(("put-down","k")),24) occurs(action(("unstack","n","h")),25) occurs(action(("stack","n","b")),26) occurs(action(("unstack","h","e")),27) occurs(action(("stack","h","g")),28) occurs(action(("unstack","i","p")),29) occurs(action(("stack","i","p")),30) occurs(action(("unstack","m","l")),31) occurs(action(("stack","m","c")),32) occurs(action(("unstack","m","c")),33) occurs(action(("stack","m","c")),34) occurs(action(("pick-up","e")),35) occurs(action(("stack","e","m")),36) occurs(action(("unstack","n","b")),37) occurs(action(("stack","n","e")),38) occurs(action(("pick-up","a")),39) occurs(action(("stack","a","n")),40) occurs(action(("unstack","h","g")),41) occurs(action(("stack","h","a")),42) occurs(action(("pick-up","j")),43) occurs(action(("stack","j","h")),44) occurs(action(("pick-up","l")),45) occurs(action(("stack","l","j")),46) occurs(action(("unstack","i","p")),47) occurs(action(("stack","i","l")),48) occurs(action(("pick-up","k")),49) occurs(action(("stack","k","i")),50) occurs(action(("pick-up","g")),51) occurs(action(("stack","g","k")),52) occurs(action(("pick-up","f")),53) occurs(action(("stack","f","g")),54) occurs(action(("pick-up","p")),55) occurs(action(("stack","p","f")),56) occurs(action(("pick-up","b")),57) occurs(action(("stack","b","p")),58) occurs(action(("pick-up","d")),59) occurs(action(("stack","d","b")),60)
|
|
Solving Time: 1.78s
|
|
Memory: 828MB (+28MB)
|
|
SAT
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 13
|
|
Time : 27.425s (Solving: 9.75s 1st Model: 1.62s Unsat: 8.12s)
|
|
CPU Time : 27.430s
|
|
|
|
Choices : 129423
|
|
Conflicts : 9983 (Analyzed: 9972)
|
|
Restarts : 100 (Average: 99.72 Last: 69)
|
|
Model-Level : 496.0
|
|
Problems : 13 (Average Length: 32.00 Splits: 0)
|
|
Lemmas : 11200 (Deleted: 6332)
|
|
Binary : 686 (Ratio: 6.12%)
|
|
Ternary : 196 (Ratio: 1.75%)
|
|
Conflict : 9972 (Average Length: 1242.8 Ratio: 89.04%)
|
|
Loop : 1228 (Average Length: 46.9 Ratio: 10.96%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 9972 (Average: 12.34 Max: 1120 Sum: 123063)
|
|
Executed : 9861 (Average: 12.15 Max: 1120 Sum: 121119 Ratio: 98.42%)
|
|
Bounded : 111 (Average: 17.51 Max: 55 Sum: 1944 Ratio: 1.58%)
|
|
|
|
Rules : 398772
|
|
Atoms : 398772
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 221863 (Eliminated: 0 Frozen: 213828)
|
|
Constraints : 709484 (Binary: 85.7% Ternary: 11.1% Other: 3.3%)
|
|
|
|
Memory Peak : 828MB
|
|
Max. Length : 60 steps
|
|
Sol. Length : 60 steps
|
|
|
|
|