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.020s CPU, 0.012s 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.110s CPU, 0.111s wall-clock]
|
|
898 relevant atoms
|
|
592 auxiliary atoms
|
|
1490 final queue length
|
|
2549 total queue pushes
|
|
Completing instantiation... [0.150s CPU, 0.156s wall-clock]
|
|
Instantiating: [0.280s CPU, 0.290s wall-clock]
|
|
Computing fact groups...
|
|
Finding invariants...
|
|
10 initial candidates
|
|
Finding invariants: [0.030s CPU, 0.024s 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.010s CPU, 0.002s wall-clock]
|
|
Choosing groups...
|
|
17 uncovered facts
|
|
Choosing groups: [0.000s CPU, 0.010s wall-clock]
|
|
Building translation key... [0.010s CPU, 0.004s wall-clock]
|
|
Computing fact groups: [0.080s CPU, 0.071s 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.170s CPU, 0.178s 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.056s 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.074s wall-clock]
|
|
Done! [0.800s CPU, 0.805s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 0.18s
|
|
Memory: 54MB
|
|
|
|
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: 54MB (+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.06s
|
|
Memory: 56MB (+2MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 57MB (+1MB)
|
|
UNSAT
|
|
Iteration Time: 0.08s
|
|
|
|
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.07s
|
|
Memory: 60MB (+3MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 62MB (+2MB)
|
|
UNSAT
|
|
Iteration Time: 0.09s
|
|
|
|
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.06s
|
|
Memory: 64MB (+2MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 66MB (+2MB)
|
|
UNSAT
|
|
Iteration Time: 0.09s
|
|
|
|
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.07s
|
|
Memory: 68MB (+2MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 70MB (+2MB)
|
|
UNSAT
|
|
Iteration Time: 0.09s
|
|
|
|
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.08s
|
|
Memory: 74MB (+4MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 76MB (+2MB)
|
|
UNSAT
|
|
Iteration Time: 0.11s
|
|
|
|
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.07s
|
|
Memory: 79MB (+3MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.01s
|
|
Memory: 80MB (+1MB)
|
|
UNSAT
|
|
Iteration Time: 0.10s
|
|
|
|
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.07s
|
|
Memory: 84MB (+4MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.02s
|
|
Memory: 86MB (+2MB)
|
|
UNSAT
|
|
Iteration Time: 0.11s
|
|
|
|
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.07s
|
|
Memory: 88MB (+2MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.02s
|
|
Memory: 90MB (+2MB)
|
|
UNSAT
|
|
Iteration Time: 0.12s
|
|
|
|
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.07s
|
|
Memory: 92MB (+2MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.04s
|
|
Memory: 93MB (+1MB)
|
|
UNSAT
|
|
Iteration Time: 0.14s
|
|
|
|
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.10s
|
|
Memory: 99MB (+6MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.10s
|
|
Memory: 101MB (+2MB)
|
|
UNSAT
|
|
Iteration Time: 0.25s
|
|
|
|
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.07s
|
|
Memory: 105MB (+4MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.83s
|
|
Memory: 119MB (+14MB)
|
|
UNSAT
|
|
Iteration Time: 0.93s
|
|
|
|
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.07s
|
|
Memory: 124MB (+5MB)
|
|
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(("put-down","m")),6) occurs(action(("unstack","j","p")),7) occurs(action(("stack","j","f")),8) occurs(action(("unstack","p","n")),9) occurs(action(("stack","p","l")),10) occurs(action(("unstack","n","i")),11) occurs(action(("put-down","n")),12) occurs(action(("unstack","i","b")),13) occurs(action(("put-down","i")),14) occurs(action(("unstack","b","d")),15) occurs(action(("put-down","b")),16) occurs(action(("unstack","h","e")),17) occurs(action(("stack","h","j")),18) occurs(action(("unstack","o","g")),19) occurs(action(("put-down","o")),20) occurs(action(("unstack","d","c")),21) occurs(action(("put-down","d")),22) occurs(action(("unstack","c","k")),23) occurs(action(("stack","c","o")),24) occurs(action(("pick-up","m")),25) occurs(action(("stack","m","c")),26) occurs(action(("unstack","p","l")),27) occurs(action(("stack","p","b")),28) occurs(action(("pick-up","e")),29) occurs(action(("stack","e","m")),30) occurs(action(("pick-up","n")),31) occurs(action(("stack","n","e")),32) occurs(action(("unstack","k","a")),33) occurs(action(("stack","k","p")),34) occurs(action(("pick-up","a")),35) occurs(action(("stack","a","n")),36) occurs(action(("unstack","h","j")),37) occurs(action(("stack","h","a")),38) occurs(action(("unstack","j","f")),39) occurs(action(("stack","j","h")),40) occurs(action(("pick-up","l")),41) occurs(action(("stack","l","j")),42) occurs(action(("pick-up","g")),43) occurs(action(("put-down","g")),44) occurs(action(("unstack","k","p")),45) occurs(action(("stack","k","f")),46) occurs(action(("pick-up","i")),47) occurs(action(("stack","i","l")),48) occurs(action(("unstack","k","f")),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(("unstack","p","b")),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: 0.07s
|
|
Memory: 127MB (+3MB)
|
|
SAT
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 13
|
|
Time : 2.490s (Solving: 1.02s 1st Model: 0.06s Unsat: 0.97s)
|
|
CPU Time : 2.480s
|
|
|
|
Choices : 86017
|
|
Conflicts : 5060 (Analyzed: 5051)
|
|
Restarts : 50 (Average: 101.02 Last: 54)
|
|
Model-Level : 256.0
|
|
Problems : 13 (Average Length: 32.00 Splits: 0)
|
|
Lemmas : 5051 (Deleted: 1211)
|
|
Binary : 213 (Ratio: 4.22%)
|
|
Ternary : 141 (Ratio: 2.79%)
|
|
Conflict : 5051 (Average Length: 815.7 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 5051 (Average: 16.34 Max: 1561 Sum: 82524)
|
|
Executed : 4948 (Average: 15.76 Max: 1561 Sum: 79585 Ratio: 96.44%)
|
|
Bounded : 103 (Average: 28.53 Max: 57 Sum: 2939 Ratio: 3.56%)
|
|
|
|
Rules : 13635
|
|
Atoms : 13635
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 53106 (Eliminated: 0 Frozen: 46807)
|
|
Constraints : 305329 (Binary: 93.6% Ternary: 4.7% Other: 1.7%)
|
|
|
|
Memory Peak : 132MB
|
|
Max. Length : 60 steps
|
|
Sol. Length : 60 steps
|
|
|
|
|