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-21.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-21.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.005s wall-clock]
|
|
Generated 21 rules.
|
|
Computing model... [0.040s CPU, 0.048s wall-clock]
|
|
382 relevant atoms
|
|
250 auxiliary atoms
|
|
632 final queue length
|
|
1054 total queue pushes
|
|
Completing instantiation... [0.070s CPU, 0.067s wall-clock]
|
|
Instantiating: [0.130s CPU, 0.131s wall-clock]
|
|
Computing fact groups...
|
|
Finding invariants...
|
|
10 initial candidates
|
|
Finding invariants: [0.020s CPU, 0.024s wall-clock]
|
|
Checking invariant weight... [0.010s CPU, 0.001s wall-clock]
|
|
Instantiating groups... [0.000s CPU, 0.003s wall-clock]
|
|
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
|
Choosing groups...
|
|
11 uncovered facts
|
|
Choosing groups: [0.010s CPU, 0.004s wall-clock]
|
|
Building translation key... [0.000s CPU, 0.002s wall-clock]
|
|
Computing fact groups: [0.040s CPU, 0.043s wall-clock]
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
|
|
Building dictionary for full mutex groups... [0.010s CPU, 0.002s wall-clock]
|
|
Building mutex information...
|
|
Building mutex information: [0.000s CPU, 0.002s wall-clock]
|
|
Translating task...
|
|
Processing axioms...
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
|
Processing axioms: [0.000s CPU, 0.003s wall-clock]
|
|
Translating task: [0.070s CPU, 0.070s wall-clock]
|
|
290 effect conditions simplified
|
|
0 implied preconditions added
|
|
Detecting unreachable propositions...
|
|
0 operators removed
|
|
0 axioms removed
|
|
20 propositions removed
|
|
Detecting unreachable propositions: [0.040s CPU, 0.038s wall-clock]
|
|
Reordering and filtering variables...
|
|
21 of 21 variables necessary.
|
|
11 of 21 mutex groups necessary.
|
|
200 of 200 operators necessary.
|
|
0 of 0 axiom rules necessary.
|
|
Reordering and filtering variables: [0.020s CPU, 0.022s wall-clock]
|
|
Translator variables: 21
|
|
Translator derived variables: 0
|
|
Translator facts: 132
|
|
Translator goal facts: 9
|
|
Translator mutex groups: 11
|
|
Translator total mutex groups size: 121
|
|
Translator operators: 200
|
|
Translator axioms: 0
|
|
Translator task size: 1753
|
|
Translator peak memory: 33880 KB
|
|
Writing output... [0.030s CPU, 0.031s wall-clock]
|
|
Done! [0.360s CPU, 0.356s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 0.08s
|
|
Memory: 49MB
|
|
|
|
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: 49MB (+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.03s
|
|
Memory: 50MB (+1MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 50MB (+0MB)
|
|
UNSAT
|
|
Iteration Time: 0.04s
|
|
|
|
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.03s
|
|
Memory: 51MB (+1MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 52MB (+1MB)
|
|
UNSAT
|
|
Iteration Time: 0.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.03s
|
|
Memory: 54MB (+2MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 54MB (+0MB)
|
|
UNSAT
|
|
Iteration Time: 0.04s
|
|
|
|
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.03s
|
|
Memory: 55MB (+1MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 56MB (+1MB)
|
|
UNSAT
|
|
Iteration Time: 0.04s
|
|
|
|
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.03s
|
|
Memory: 57MB (+1MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 58MB (+1MB)
|
|
UNSAT
|
|
Iteration Time: 0.04s
|
|
|
|
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.03s
|
|
Memory: 60MB (+2MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.01s
|
|
Memory: 60MB (+0MB)
|
|
UNSAT
|
|
Iteration Time: 0.06s
|
|
|
|
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.03s
|
|
Memory: 62MB (+2MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.07s
|
|
Memory: 63MB (+1MB)
|
|
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.03s
|
|
Memory: 65MB (+2MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Answer: 1
|
|
occurs(action(("unstack","j","i")),1) occurs(action(("put-down","j")),2) occurs(action(("unstack","i","h")),3) occurs(action(("put-down","i")),4) occurs(action(("unstack","h","f")),5) occurs(action(("put-down","h")),6) occurs(action(("unstack","f","d")),7) occurs(action(("stack","f","c")),8) occurs(action(("unstack","d","e")),9) occurs(action(("put-down","d")),10) occurs(action(("pick-up","j")),11) occurs(action(("stack","j","d")),12) occurs(action(("unstack","f","c")),13) occurs(action(("stack","f","j")),14) occurs(action(("unstack","e","g")),15) occurs(action(("put-down","e")),16) occurs(action(("unstack","g","b")),17) occurs(action(("stack","g","e")),18) occurs(action(("unstack","g","e")),19) occurs(action(("stack","g","c")),20) occurs(action(("unstack","b","a")),21) occurs(action(("stack","b","h")),22) occurs(action(("pick-up","a")),23) occurs(action(("stack","a","f")),24) occurs(action(("unstack","g","c")),25) occurs(action(("stack","g","e")),26) occurs(action(("unstack","b","h")),27) occurs(action(("put-down","b")),28) occurs(action(("pick-up","c")),29) occurs(action(("stack","c","a")),30) occurs(action(("pick-up","h")),31) occurs(action(("stack","h","c")),32) occurs(action(("unstack","g","e")),33) occurs(action(("stack","g","h")),34) occurs(action(("pick-up","i")),35) occurs(action(("stack","i","g")),36) occurs(action(("pick-up","e")),37) occurs(action(("stack","e","i")),38) occurs(action(("pick-up","b")),39) occurs(action(("stack","b","e")),40)
|
|
Solving Time: 0.03s
|
|
Memory: 65MB (+0MB)
|
|
SAT
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 9
|
|
Time : 0.524s (Solving: 0.11s 1st Model: 0.03s Unsat: 0.08s)
|
|
CPU Time : 0.510s
|
|
|
|
Choices : 2505
|
|
Conflicts : 1322 (Analyzed: 1316)
|
|
Restarts : 16 (Average: 82.25 Last: 28)
|
|
Model-Level : 61.0
|
|
Problems : 9 (Average Length: 22.00 Splits: 0)
|
|
Lemmas : 1316 (Deleted: 0)
|
|
Binary : 117 (Ratio: 8.89%)
|
|
Ternary : 82 (Ratio: 6.23%)
|
|
Conflict : 1316 (Average Length: 212.3 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 1316 (Average: 2.61 Max: 132 Sum: 3441)
|
|
Executed : 1267 (Average: 1.87 Max: 132 Sum: 2461 Ratio: 71.52%)
|
|
Bounded : 49 (Average: 20.00 Max: 40 Sum: 980 Ratio: 28.48%)
|
|
|
|
Rules : 5408
|
|
Atoms : 5408
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 15101 (Eliminated: 0 Frozen: 12404)
|
|
Constraints : 75389 (Binary: 91.9% Ternary: 5.2% Other: 2.9%)
|
|
|
|
Memory Peak : 67MB
|
|
Max. Length : 40 steps
|
|
Sol. Length : 40 steps
|
|
|
|
|