195 lines
7.5 KiB
Plaintext
195 lines
7.5 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-23.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-23.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.010s CPU, 0.010s wall-clock]
|
|
Preparing model... [0.000s CPU, 0.005s wall-clock]
|
|
Generated 21 rules.
|
|
Computing model... [0.060s CPU, 0.057s wall-clock]
|
|
453 relevant atoms
|
|
297 auxiliary atoms
|
|
750 final queue length
|
|
1260 total queue pushes
|
|
Completing instantiation... [0.080s CPU, 0.080s wall-clock]
|
|
Instantiating: [0.150s CPU, 0.155s 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.001s 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.010s CPU, 0.005s wall-clock]
|
|
Building translation key... [0.010s CPU, 0.002s wall-clock]
|
|
Computing fact groups: [0.050s CPU, 0.045s 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.000s 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.048s 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.030s 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.040s CPU, 0.037s wall-clock]
|
|
Done! [0.410s CPU, 0.420s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 0.27s
|
|
Memory: 60MB
|
|
|
|
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: 60MB (+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: 64MB (+4MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 66MB (+2MB)
|
|
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.06s
|
|
Memory: 68MB (+2MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 71MB (+3MB)
|
|
UNSAT
|
|
Iteration Time: 0.08s
|
|
|
|
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.07s
|
|
Memory: 72MB (+1MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 75MB (+3MB)
|
|
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: 77MB (+2MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.01s
|
|
Memory: 81MB (+4MB)
|
|
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.06s
|
|
Memory: 82MB (+1MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.01s
|
|
Memory: 85MB (+3MB)
|
|
UNSAT
|
|
Iteration Time: 0.10s
|
|
|
|
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: 86MB (+1MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Answer: 1
|
|
occurs(action(("unstack","f","e")),1) occurs(action(("put-down","f")),2) occurs(action(("unstack","j","i")),3) occurs(action(("put-down","j")),4) occurs(action(("unstack","d","c")),5) occurs(action(("put-down","d")),6) occurs(action(("unstack","e","k")),7) occurs(action(("put-down","e")),8) occurs(action(("pick-up","i")),9) occurs(action(("stack","i","e")),10) occurs(action(("unstack","g","b")),11) occurs(action(("stack","g","i")),12) occurs(action(("unstack","b","a")),13) occurs(action(("put-down","b")),14) occurs(action(("pick-up","f")),15) occurs(action(("stack","f","g")),16) occurs(action(("unstack","c","h")),17) occurs(action(("stack","c","f")),18) occurs(action(("pick-up","a")),19) occurs(action(("stack","a","c")),20) occurs(action(("pick-up","h")),21) occurs(action(("stack","h","a")),22) occurs(action(("pick-up","k")),23) occurs(action(("stack","k","h")),24) occurs(action(("pick-up","j")),25) occurs(action(("stack","j","k")),26) occurs(action(("pick-up","d")),27) occurs(action(("stack","d","j")),28) occurs(action(("pick-up","b")),29) occurs(action(("stack","b","d")),30)
|
|
Solving Time: 0.04s
|
|
Memory: 92MB (+6MB)
|
|
SAT
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 7
|
|
Time : 0.848s (Solving: 0.05s 1st Model: 0.04s Unsat: 0.01s)
|
|
CPU Time : 0.850s
|
|
|
|
Choices : 1014
|
|
Conflicts : 357 (Analyzed: 352)
|
|
Restarts : 3 (Average: 117.33 Last: 73)
|
|
Model-Level : 41.0
|
|
Problems : 7 (Average Length: 17.00 Splits: 0)
|
|
Lemmas : 352 (Deleted: 0)
|
|
Binary : 53 (Ratio: 15.06%)
|
|
Ternary : 22 (Ratio: 6.25%)
|
|
Conflict : 352 (Average Length: 169.3 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 352 (Average: 3.74 Max: 98 Sum: 1318)
|
|
Executed : 324 (Average: 2.85 Max: 98 Sum: 1002 Ratio: 76.02%)
|
|
Bounded : 28 (Average: 11.29 Max: 32 Sum: 316 Ratio: 23.98%)
|
|
|
|
Rules : 100351
|
|
Atoms : 100351
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 13464 (Eliminated: 0 Frozen: 10870)
|
|
Constraints : 84826 (Binary: 92.7% Ternary: 5.0% Other: 2.3%)
|
|
|
|
Memory Peak : 93MB
|
|
Max. Length : 30 steps
|
|
Sol. Length : 30 steps
|
|
|
|
|