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-24.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-24.pddl
|
|
Parsing...
|
|
Parsing: [0.010s CPU, 0.012s 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.000s CPU, 0.010s wall-clock]
|
|
Preparing model... [0.010s CPU, 0.005s wall-clock]
|
|
Generated 21 rules.
|
|
Computing model... [0.060s CPU, 0.060s wall-clock]
|
|
453 relevant atoms
|
|
297 auxiliary atoms
|
|
750 final queue length
|
|
1258 total queue pushes
|
|
Completing instantiation... [0.080s CPU, 0.082s wall-clock]
|
|
Instantiating: [0.160s CPU, 0.161s wall-clock]
|
|
Computing fact groups...
|
|
Finding invariants...
|
|
10 initial candidates
|
|
Finding invariants: [0.020s CPU, 0.023s wall-clock]
|
|
Checking invariant weight... [0.010s CPU, 0.002s wall-clock]
|
|
Instantiating groups... [0.000s CPU, 0.004s wall-clock]
|
|
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
|
Choosing groups...
|
|
12 uncovered facts
|
|
Choosing groups: [0.000s CPU, 0.005s wall-clock]
|
|
Building translation key... [0.000s CPU, 0.002s wall-clock]
|
|
Computing fact groups: [0.050s CPU, 0.046s wall-clock]
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
|
|
Building dictionary for full mutex groups... [0.000s CPU, 0.002s wall-clock]
|
|
Building mutex information...
|
|
Building mutex information: [0.010s CPU, 0.003s wall-clock]
|
|
Translating task...
|
|
Processing axioms...
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
|
Processing axioms: [0.000s CPU, 0.004s wall-clock]
|
|
Translating task: [0.080s CPU, 0.084s wall-clock]
|
|
352 effect conditions simplified
|
|
0 implied preconditions added
|
|
Detecting unreachable propositions...
|
|
0 operators removed
|
|
0 axioms removed
|
|
22 propositions removed
|
|
Detecting unreachable propositions: [0.050s CPU, 0.049s wall-clock]
|
|
Reordering and filtering variables...
|
|
23 of 23 variables necessary.
|
|
12 of 23 mutex groups necessary.
|
|
242 of 242 operators necessary.
|
|
0 of 0 axiom rules necessary.
|
|
Reordering and filtering variables: [0.020s CPU, 0.026s wall-clock]
|
|
Translator variables: 23
|
|
Translator derived variables: 0
|
|
Translator facts: 156
|
|
Translator goal facts: 10
|
|
Translator mutex groups: 12
|
|
Translator total mutex groups size: 144
|
|
Translator operators: 242
|
|
Translator axioms: 0
|
|
Translator task size: 2115
|
|
Translator peak memory: 34136 KB
|
|
Writing output... [0.030s CPU, 0.037s wall-clock]
|
|
Done! [0.420s CPU, 0.427s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 0.10s
|
|
Memory: 49MB
|
|
|
|
Iteration 1
|
|
Queue: [0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75]
|
|
Grounded Until: 0
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 49MB (+0MB)
|
|
UNSAT
|
|
Iteration Time: 0.00s
|
|
|
|
Iteration 2
|
|
Queue: [5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80]
|
|
Grounded Until: 0
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
|
Grounding Time: 0.05s
|
|
Memory: 51MB (+2MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 51MB (+0MB)
|
|
UNSAT
|
|
Iteration Time: 0.06s
|
|
|
|
Iteration 3
|
|
Queue: [10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85]
|
|
Grounded Until: 5
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
|
Grounding Time: 0.05s
|
|
Memory: 53MB (+2MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 54MB (+1MB)
|
|
UNSAT
|
|
Iteration Time: 0.06s
|
|
|
|
Iteration 4
|
|
Queue: [15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90]
|
|
Grounded Until: 10
|
|
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
|
Grounding Time: 0.04s
|
|
Memory: 56MB (+2MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 56MB (+0MB)
|
|
UNSAT
|
|
Iteration Time: 0.05s
|
|
|
|
Iteration 5
|
|
Queue: [20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 95]
|
|
Grounded Until: 15
|
|
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
|
|
Grounding Time: 0.04s
|
|
Memory: 58MB (+2MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 59MB (+1MB)
|
|
UNSAT
|
|
Iteration Time: 0.06s
|
|
|
|
Iteration 6
|
|
Queue: [25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 95, 100]
|
|
Grounded Until: 20
|
|
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
|
|
Grounding Time: 0.05s
|
|
Memory: 62MB (+3MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.01s
|
|
Memory: 63MB (+1MB)
|
|
UNSAT
|
|
Iteration Time: 0.07s
|
|
|
|
Iteration 7
|
|
Queue: [30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 95, 100, 105]
|
|
Grounded Until: 25
|
|
Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
|
|
Grounding Time: 0.04s
|
|
Memory: 64MB (+1MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.02s
|
|
Memory: 65MB (+1MB)
|
|
UNSAT
|
|
Iteration Time: 0.07s
|
|
|
|
Iteration 8
|
|
Queue: [35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 95, 100, 105, 110]
|
|
Grounded Until: 30
|
|
Grounding... [('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('check', [35])]
|
|
Grounding Time: 0.04s
|
|
Memory: 67MB (+2MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.18s
|
|
Memory: 69MB (+2MB)
|
|
UNSAT
|
|
Iteration Time: 0.24s
|
|
|
|
Iteration 9
|
|
Queue: [40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 95, 100, 105, 110, 115]
|
|
Grounded Until: 35
|
|
Grounding... [('step', [36]), ('step', [37]), ('step', [38]), ('step', [39]), ('step', [40]), ('check', [40])]
|
|
Grounding Time: 0.04s
|
|
Memory: 71MB (+2MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Answer: 1
|
|
occurs(action(("unstack","b","h")),1) occurs(action(("put-down","b")),2) occurs(action(("unstack","h","k")),3) occurs(action(("stack","h","i")),4) occurs(action(("unstack","k","f")),5) occurs(action(("put-down","k")),6) occurs(action(("unstack","f","c")),7) occurs(action(("stack","f","k")),8) occurs(action(("unstack","c","d")),9) occurs(action(("put-down","c")),10) occurs(action(("unstack","d","j")),11) occurs(action(("put-down","d")),12) occurs(action(("unstack","j","a")),13) occurs(action(("put-down","j")),14) occurs(action(("pick-up","a")),15) occurs(action(("stack","a","f")),16) occurs(action(("unstack","h","i")),17) occurs(action(("stack","h","a")),18) occurs(action(("unstack","i","e")),19) occurs(action(("put-down","i")),20) occurs(action(("unstack","h","a")),21) occurs(action(("stack","h","b")),22) occurs(action(("unstack","h","b")),23) occurs(action(("stack","h","a")),24) occurs(action(("pick-up","b")),25) occurs(action(("stack","b","h")),26) occurs(action(("pick-up","j")),27) occurs(action(("stack","j","b")),28) occurs(action(("unstack","e","g")),29) occurs(action(("stack","e","j")),30) occurs(action(("pick-up","d")),31) occurs(action(("stack","d","e")),32) occurs(action(("pick-up","c")),33) occurs(action(("stack","c","g")),34) occurs(action(("unstack","c","g")),35) occurs(action(("stack","c","d")),36) occurs(action(("pick-up","g")),37) occurs(action(("stack","g","c")),38) occurs(action(("pick-up","i")),39) occurs(action(("stack","i","g")),40)
|
|
Solving Time: 0.02s
|
|
Memory: 72MB (+1MB)
|
|
SAT
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 9
|
|
Time : 0.784s (Solving: 0.22s 1st Model: 0.01s Unsat: 0.20s)
|
|
CPU Time : 0.770s
|
|
|
|
Choices : 2748
|
|
Conflicts : 1082 (Analyzed: 1076)
|
|
Restarts : 12 (Average: 89.67 Last: 64)
|
|
Model-Level : 57.0
|
|
Problems : 9 (Average Length: 22.00 Splits: 0)
|
|
Lemmas : 1076 (Deleted: 0)
|
|
Binary : 124 (Ratio: 11.52%)
|
|
Ternary : 52 (Ratio: 4.83%)
|
|
Conflict : 1076 (Average Length: 392.1 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 1076 (Average: 3.97 Max: 128 Sum: 4276)
|
|
Executed : 1011 (Average: 2.53 Max: 128 Sum: 2726 Ratio: 63.75%)
|
|
Bounded : 65 (Average: 23.85 Max: 42 Sum: 1550 Ratio: 36.25%)
|
|
|
|
Rules : 7113
|
|
Atoms : 7113
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 19700 (Eliminated: 0 Frozen: 15609)
|
|
Constraints : 118208 (Binary: 92.4% Ternary: 4.2% Other: 3.4%)
|
|
|
|
Memory Peak : 74MB
|
|
Max. Length : 40 steps
|
|
Sol. Length : 40 steps
|
|
|
|
|