88 lines
6.9 KiB
Plaintext
88 lines
6.9 KiB
Plaintext
planner.py version 0.0.1
|
|
|
|
Time: 0.05s
|
|
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.08s
|
|
Memory: 56MB (+7MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 57MB (+1MB)
|
|
UNSAT
|
|
Iteration Time: 0.10s
|
|
|
|
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: 62MB (+5MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 63MB (+1MB)
|
|
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.07s
|
|
Memory: 66MB (+3MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Answer: 1
|
|
occurs(action(("unstack",constant("c"),constant("e"))),1) occurs(action(("unstack",constant("i"),constant("d"))),1) occurs(action(("unstack",constant("g"),constant("j"))),1) occurs(action(("unstack",constant("h"),constant("f"))),1) occurs(action(("stack",constant("h"),constant("n"))),2) occurs(action(("put-down",constant("g"))),2) occurs(action(("stack",constant("i"),constant("d"))),2) occurs(action(("stack",constant("c"),constant("d"))),2) occurs(action(("stack",constant("c"),constant("n"))),2) occurs(action(("pick-up",constant("e"))),3) occurs(action(("unstack",constant("i"),constant("d"))),3) occurs(action(("unstack",constant("f"),constant("a"))),3) occurs(action(("pick-up",constant("g"))),3) occurs(action(("pick-up",constant("j"))),3) occurs(action(("unstack",constant("c"),constant("n"))),3) occurs(action(("put-down",constant("e"))),4) occurs(action(("stack",constant("i"),constant("e"))),5) occurs(action(("stack",constant("f"),constant("e"))),5) occurs(action(("stack",constant("f"),constant("h"))),5) occurs(action(("put-down",constant("g"))),5) occurs(action(("stack",constant("g"),constant("h"))),5) occurs(action(("put-down",constant("i"))),5) occurs(action(("stack",constant("i"),constant("h"))),5) occurs(action(("put-down",constant("c"))),5) occurs(action(("stack",constant("c"),constant("h"))),5) occurs(action(("stack",constant("j"),constant("h"))),5) occurs(action(("put-down",constant("j"))),5) occurs(action(("pick-up",constant("j"))),6) occurs(action(("put-down",constant("j"))),7) occurs(action(("pick-up",constant("n"))),8) occurs(action(("unstack",constant("d"),constant("l"))),8) occurs(action(("unstack",constant("f"),constant("e"))),8) occurs(action(("pick-up",constant("i"))),8) occurs(action(("unstack",constant("a"),constant("k"))),8) occurs(action(("unstack",constant("f"),constant("h"))),8) occurs(action(("pick-up",constant("j"))),8) occurs(action(("pick-up",constant("c"))),8) occurs(action(("put-down",constant("j"))),9) occurs(action(("stack",constant("f"),constant("g"))),10) occurs(action(("put-down",constant("i"))),10) occurs(action(("stack",constant("c"),constant("g"))),10) occurs(action(("unstack",constant("l"),constant("m"))),11) occurs(action(("pick-up",constant("e"))),11) occurs(action(("unstack",constant("k"),constant("b"))),11) occurs(action(("unstack",constant("h"),constant("n"))),11) occurs(action(("unstack",constant("c"),constant("d"))),11) occurs(action(("unstack",constant("c"),constant("g"))),11) occurs(action(("stack",constant("l"),constant("n"))),12) occurs(action(("stack",constant("k"),constant("f"))),12) occurs(action(("put-down",constant("l"))),12) occurs(action(("put-down",constant("a"))),12) occurs(action(("stack",constant("c"),constant("i"))),12) occurs(action(("pick-up",constant("l"))),13) occurs(action(("pick-up",constant("a"))),13) occurs(action(("pick-up",constant("g"))),13) occurs(action(("pick-up",constant("m"))),13) occurs(action(("pick-up",constant("b"))),13) occurs(action(("unstack",constant("j"),constant("h"))),13) occurs(action(("unstack",constant("c"),constant("h"))),13) occurs(action(("unstack",constant("c"),constant("i"))),13) occurs(action(("stack",constant("a"),constant("i"))),14) occurs(action(("stack",constant("m"),constant("k"))),14) occurs(action(("stack",constant("b"),constant("h"))),14) occurs(action(("stack",constant("j"),constant("d"))),14) occurs(action(("stack",constant("l"),constant("k"))),14) occurs(action(("put-down",constant("c"))),14) occurs(action(("stack",constant("n"),constant("c"))),15) occurs(action(("stack",constant("e"),constant("l"))),15) occurs(action(("stack",constant("g"),constant("a"))),15) occurs(action(("stack",constant("h"),constant("m"))),15) occurs(action(("stack",constant("d"),constant("b"))),15) occurs(action(("put-down",constant("e"))),15) occurs(action(("stack",constant("e"),constant("a"))),15) occurs(action(("stack",constant("e"),constant("b"))),15) occurs(action(("stack",constant("e"),constant("m"))),15) occurs(action(("stack",constant("e"),constant("c"))),15) occurs(action(("put-down",constant("d"))),15) occurs(action(("stack",constant("d"),constant("a"))),15) occurs(action(("stack",constant("d"),constant("m"))),15) occurs(action(("put-down",constant("h"))),15) occurs(action(("stack",constant("g"),constant("l"))),15) occurs(action(("stack",constant("g"),constant("b"))),15) occurs(action(("stack",constant("n"),constant("a"))),15) occurs(action(("stack",constant("n"),constant("b"))),15) occurs(action(("stack",constant("n"),constant("m"))),15)
|
|
Solving Time: 0.01s
|
|
Memory: 68MB (+2MB)
|
|
SAT
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 4
|
|
Time : 0.348s (Solving: 0.01s 1st Model: 0.00s Unsat: 0.00s)
|
|
CPU Time : 0.340s
|
|
|
|
Choices : 1890
|
|
Conflicts : 102 (Analyzed: 101)
|
|
Restarts : 0
|
|
Model-Level : 578.0
|
|
Problems : 4 (Average Length: 9.50 Splits: 0)
|
|
Lemmas : 101 (Deleted: 0)
|
|
Binary : 2 (Ratio: 1.98%)
|
|
Ternary : 0 (Ratio: 0.00%)
|
|
Conflict : 101 (Average Length: 56.6 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 101 (Average: 13.80 Max: 398 Sum: 1394)
|
|
Executed : 96 (Average: 13.16 Max: 398 Sum: 1329 Ratio: 95.34%)
|
|
Bounded : 5 (Average: 13.00 Max: 17 Sum: 65 Ratio: 4.66%)
|
|
|
|
Rules : 12886
|
|
Atoms : 12886
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 16245 (Eliminated: 0 Frozen: 0)
|
|
Constraints : 69308 (Binary: 91.9% Ternary: 7.1% Other: 1.0%)
|
|
|
|
Memory Peak : 68MB
|
|
Max. Length : 15 steps
|
|
Sol. Length : 15 steps
|
|
|
|
|