75 lines
4.9 KiB
Plaintext
75 lines
4.9 KiB
Plaintext
planner.py version 0.0.1
|
|
|
|
Time: 0.03s
|
|
Memory: 47MB
|
|
|
|
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: 47MB (+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: 49MB (+2MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 50MB (+1MB)
|
|
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...
|
|
Answer: 1
|
|
occurs(action(("unstack",constant("h"),constant("a"))),1) occurs(action(("unstack",constant("e"),constant("c"))),1) occurs(action(("put-down",constant("h"))),2) occurs(action(("stack",constant("h"),constant("f"))),2) occurs(action(("stack",constant("h"),constant("d"))),2) occurs(action(("put-down",constant("e"))),2) occurs(action(("stack",constant("e"),constant("f"))),2) occurs(action(("stack",constant("e"),constant("d"))),2) occurs(action(("unstack",constant("a"),constant("b"))),3) occurs(action(("pick-up",constant("c"))),3) occurs(action(("unstack",constant("h"),constant("d"))),3) occurs(action(("unstack",constant("e"),constant("d"))),3) occurs(action(("unstack",constant("e"),constant("f"))),3) occurs(action(("pick-up",constant("h"))),3) occurs(action(("pick-up",constant("e"))),3) occurs(action(("stack",constant("c"),constant("d"))),4) occurs(action(("stack",constant("h"),constant("d"))),4) occurs(action(("put-down",constant("e"))),4) occurs(action(("put-down",constant("a"))),4) occurs(action(("put-down",constant("c"))),4) occurs(action(("pick-up",constant("a"))),5) occurs(action(("pick-up",constant("f"))),5) occurs(action(("unstack",constant("h"),constant("d"))),5) occurs(action(("unstack",constant("b"),constant("g"))),5) occurs(action(("stack",constant("a"),constant("e"))),6) occurs(action(("put-down",constant("h"))),6) occurs(action(("stack",constant("h"),constant("c"))),6) occurs(action(("stack",constant("h"),constant("e"))),6) occurs(action(("put-down",constant("a"))),6) occurs(action(("stack",constant("a"),constant("c"))),6) occurs(action(("pick-up",constant("a"))),7) occurs(action(("unstack",constant("a"),constant("c"))),7) occurs(action(("pick-up",constant("g"))),7) occurs(action(("pick-up",constant("d"))),7) occurs(action(("unstack",constant("h"),constant("f"))),7) occurs(action(("unstack",constant("h"),constant("e"))),7) occurs(action(("unstack",constant("h"),constant("c"))),7) occurs(action(("pick-up",constant("h"))),7) occurs(action(("stack",constant("g"),constant("f"))),8) occurs(action(("put-down",constant("a"))),8) occurs(action(("put-down",constant("b"))),9) occurs(action(("stack",constant("b"),constant("a"))),9) occurs(action(("stack",constant("b"),constant("g"))),9) occurs(action(("stack",constant("b"),constant("c"))),9) occurs(action(("stack",constant("b"),constant("e"))),9) occurs(action(("put-down",constant("h"))),9) occurs(action(("stack",constant("h"),constant("a"))),9) occurs(action(("stack",constant("h"),constant("g"))),9) occurs(action(("stack",constant("h"),constant("c"))),9) occurs(action(("stack",constant("h"),constant("e"))),9) occurs(action(("stack",constant("f"),constant("h"))),10) occurs(action(("stack",constant("d"),constant("b"))),10) occurs(action(("stack",constant("d"),constant("h"))),10) occurs(action(("stack",constant("f"),constant("b"))),10)
|
|
Solving Time: 0.00s
|
|
Memory: 52MB (+1MB)
|
|
SAT
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 3
|
|
Time : 0.117s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
|
CPU Time : 0.120s
|
|
|
|
Choices : 459
|
|
Conflicts : 59 (Analyzed: 58)
|
|
Restarts : 0
|
|
Model-Level : 59.0
|
|
Problems : 3 (Average Length: 7.00 Splits: 0)
|
|
Lemmas : 58 (Deleted: 0)
|
|
Binary : 2 (Ratio: 3.45%)
|
|
Ternary : 4 (Ratio: 6.90%)
|
|
Conflict : 58 (Average Length: 20.9 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 58 (Average: 7.28 Max: 113 Sum: 422)
|
|
Executed : 57 (Average: 7.10 Max: 113 Sum: 412 Ratio: 97.63%)
|
|
Bounded : 1 (Average: 10.00 Max: 10 Sum: 10 Ratio: 2.37%)
|
|
|
|
Rules : 4443
|
|
Atoms : 4443
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 3849 (Eliminated: 0 Frozen: 0)
|
|
Constraints : 15574 (Binary: 90.6% Ternary: 7.6% Other: 1.8%)
|
|
|
|
Memory Peak : 52MB
|
|
Max. Length : 10 steps
|
|
Sol. Length : 10 steps
|
|
|
|
|