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-31.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-31.pddl
|
|
Parsing...
|
|
Parsing: [0.010s CPU, 0.010s 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.008s wall-clock]
|
|
Preparing model... [0.010s CPU, 0.006s wall-clock]
|
|
Generated 21 rules.
|
|
Computing model... [0.080s CPU, 0.088s wall-clock]
|
|
797 relevant atoms
|
|
525 auxiliary atoms
|
|
1322 final queue length
|
|
2257 total queue pushes
|
|
Completing instantiation... [0.140s CPU, 0.138s wall-clock]
|
|
Instantiating: [0.240s CPU, 0.243s wall-clock]
|
|
Computing fact groups...
|
|
Finding invariants...
|
|
10 initial candidates
|
|
Finding invariants: [0.030s CPU, 0.023s wall-clock]
|
|
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
|
|
Instantiating groups... [0.010s CPU, 0.008s wall-clock]
|
|
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
|
|
Choosing groups...
|
|
16 uncovered facts
|
|
Choosing groups: [0.010s CPU, 0.009s wall-clock]
|
|
Building translation key... [0.010s CPU, 0.003s wall-clock]
|
|
Computing fact groups: [0.070s CPU, 0.063s 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.005s wall-clock]
|
|
Translating task...
|
|
Processing axioms...
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
|
Processing axioms: [0.000s CPU, 0.007s wall-clock]
|
|
Translating task: [0.160s CPU, 0.157s wall-clock]
|
|
660 effect conditions simplified
|
|
0 implied preconditions added
|
|
Detecting unreachable propositions...
|
|
0 operators removed
|
|
0 axioms removed
|
|
30 propositions removed
|
|
Detecting unreachable propositions: [0.080s CPU, 0.088s wall-clock]
|
|
Reordering and filtering variables...
|
|
31 of 31 variables necessary.
|
|
16 of 31 mutex groups necessary.
|
|
450 of 450 operators necessary.
|
|
0 of 0 axiom rules necessary.
|
|
Reordering and filtering variables: [0.050s CPU, 0.050s wall-clock]
|
|
Translator variables: 31
|
|
Translator derived variables: 0
|
|
Translator facts: 272
|
|
Translator goal facts: 14
|
|
Translator mutex groups: 16
|
|
Translator total mutex groups size: 256
|
|
Translator operators: 450
|
|
Translator axioms: 0
|
|
Translator task size: 3903
|
|
Translator peak memory: 35416 KB
|
|
Writing output... [0.060s CPU, 0.068s wall-clock]
|
|
Done! [0.690s CPU, 0.698s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 0.66s
|
|
Memory: 86MB
|
|
|
|
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: 86MB (+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.69s
|
|
Memory: 166MB (+80MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.04s
|
|
Memory: 170MB (+4MB)
|
|
UNSAT
|
|
Iteration Time: 0.89s
|
|
|
|
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.81s
|
|
Memory: 215MB (+45MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.04s
|
|
Memory: 218MB (+3MB)
|
|
UNSAT
|
|
Iteration Time: 1.04s
|
|
|
|
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.69s
|
|
Memory: 250MB (+32MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.05s
|
|
Memory: 256MB (+6MB)
|
|
UNSAT
|
|
Iteration Time: 0.93s
|
|
|
|
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.02s
|
|
Memory: 311MB (+55MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.08s
|
|
Memory: 319MB (+8MB)
|
|
UNSAT
|
|
Iteration Time: 1.30s
|
|
|
|
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.68s
|
|
Memory: 348MB (+29MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.15s
|
|
Memory: 358MB (+10MB)
|
|
UNSAT
|
|
Iteration Time: 1.03s
|
|
|
|
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.70s
|
|
Memory: 385MB (+27MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.33s
|
|
Memory: 397MB (+12MB)
|
|
UNSAT
|
|
Iteration Time: 1.23s
|
|
|
|
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.73s
|
|
Memory: 421MB (+24MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.21s
|
|
Memory: 435MB (+14MB)
|
|
UNSAT
|
|
Iteration Time: 1.15s
|
|
|
|
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.46s
|
|
Memory: 506MB (+71MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Answer: 1
|
|
occurs(action(("unstack","e","j")),1) occurs(action(("stack","e","f")),2) occurs(action(("unstack","j","d")),3) occurs(action(("put-down","j")),4) occurs(action(("unstack","d","l")),5) occurs(action(("stack","d","j")),6) occurs(action(("unstack","l","c")),7) occurs(action(("stack","l","b")),8) occurs(action(("unstack","c","g")),9) occurs(action(("put-down","c")),10) occurs(action(("unstack","m","n")),11) occurs(action(("put-down","m")),12) occurs(action(("unstack","i","h")),13) occurs(action(("stack","i","c")),14) occurs(action(("pick-up","n")),15) occurs(action(("stack","n","i")),16) occurs(action(("unstack","d","j")),17) occurs(action(("stack","d","n")),18) occurs(action(("pick-up","j")),19) occurs(action(("stack","j","d")),20) occurs(action(("unstack","l","b")),21) occurs(action(("stack","l","j")),22) occurs(action(("unstack","b","a")),23) occurs(action(("stack","b","l")),24) occurs(action(("unstack","a","o")),25) occurs(action(("stack","a","b")),26) occurs(action(("unstack","e","f")),27) occurs(action(("stack","e","a")),28) occurs(action(("unstack","f","k")),29) occurs(action(("stack","f","e")),30) occurs(action(("pick-up","m")),31) occurs(action(("stack","m","f")),32) occurs(action(("pick-up","k")),33) occurs(action(("stack","k","m")),34) occurs(action(("pick-up","h")),35) occurs(action(("stack","h","k")),36) occurs(action(("pick-up","o")),37) occurs(action(("stack","o","h")),38) occurs(action(("pick-up","g")),39) occurs(action(("stack","g","o")),40)
|
|
Solving Time: 0.35s
|
|
Memory: 522MB (+16MB)
|
|
SAT
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 9
|
|
Time : 10.276s (Solving: 0.76s 1st Model: 0.26s Unsat: 0.49s)
|
|
CPU Time : 10.250s
|
|
|
|
Choices : 20897
|
|
Conflicts : 982 (Analyzed: 975)
|
|
Restarts : 10 (Average: 97.50 Last: 88)
|
|
Model-Level : 196.0
|
|
Problems : 9 (Average Length: 22.00 Splits: 0)
|
|
Lemmas : 1101 (Deleted: 0)
|
|
Binary : 93 (Ratio: 8.45%)
|
|
Ternary : 60 (Ratio: 5.45%)
|
|
Conflict : 975 (Average Length: 136.4 Ratio: 88.56%)
|
|
Loop : 126 (Average Length: 28.1 Ratio: 11.44%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 975 (Average: 21.41 Max: 390 Sum: 20871)
|
|
Executed : 944 (Average: 21.19 Max: 390 Sum: 20660 Ratio: 98.99%)
|
|
Bounded : 31 (Average: 6.81 Max: 41 Sum: 211 Ratio: 1.01%)
|
|
|
|
Rules : 312262
|
|
Atoms : 312262
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 130116 (Eliminated: 0 Frozen: 125084)
|
|
Constraints : 414925 (Binary: 85.6% Ternary: 11.0% Other: 3.3%)
|
|
|
|
Memory Peak : 546MB
|
|
Max. Length : 40 steps
|
|
Sol. Length : 40 steps
|
|
|
|
|