1
0
Fork 0
tplp-planning-benchmark/pb-e0-sh/ipc-2000_blocks-strips-type...

75 lines
5.1 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.04s
Memory: 49MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 50MB (+1MB)
UNSAT
Iteration Time: 0.05s
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("d"),constant("h"))),1) occurs(action(("unstack",constant("a"),constant("g"))),1) occurs(action(("stack",constant("a"),constant("b"))),2) occurs(action(("stack",constant("d"),constant("c"))),2) occurs(action(("unstack",constant("g"),constant("e"))),3) occurs(action(("unstack",constant("h"),constant("f"))),3) occurs(action(("unstack",constant("d"),constant("c"))),3) occurs(action(("unstack",constant("a"),constant("b"))),3) occurs(action(("stack",constant("g"),constant("b"))),4) occurs(action(("stack",constant("h"),constant("c"))),4) occurs(action(("stack",constant("d"),constant("f"))),4) occurs(action(("put-down",constant("h"))),4) occurs(action(("stack",constant("h"),constant("f"))),4) occurs(action(("stack",constant("h"),constant("b"))),4) occurs(action(("put-down",constant("a"))),4) occurs(action(("stack",constant("a"),constant("f"))),4) occurs(action(("stack",constant("a"),constant("c"))),4) occurs(action(("stack",constant("a"),constant("b"))),4) occurs(action(("put-down",constant("g"))),4) occurs(action(("stack",constant("g"),constant("f"))),4) occurs(action(("stack",constant("g"),constant("c"))),4) occurs(action(("put-down",constant("d"))),4) occurs(action(("stack",constant("d"),constant("c"))),4) occurs(action(("stack",constant("d"),constant("b"))),4) occurs(action(("pick-up",constant("e"))),5) occurs(action(("unstack",constant("a"),constant("f"))),5) occurs(action(("unstack",constant("a"),constant("c"))),5) occurs(action(("unstack",constant("a"),constant("b"))),5) occurs(action(("pick-up",constant("a"))),5) occurs(action(("stack",constant("e"),constant("h"))),6) occurs(action(("put-down",constant("e"))),6) occurs(action(("stack",constant("e"),constant("g"))),6) occurs(action(("stack",constant("e"),constant("f"))),6) occurs(action(("stack",constant("e"),constant("c"))),6) occurs(action(("stack",constant("e"),constant("b"))),6) occurs(action(("stack",constant("e"),constant("d"))),6) occurs(action(("stack",constant("a"),constant("h"))),6) occurs(action(("stack",constant("a"),constant("g"))),6) occurs(action(("unstack",constant("a"),constant("h"))),7) occurs(action(("unstack",constant("e"),constant("g"))),7) occurs(action(("unstack",constant("e"),constant("f"))),7) occurs(action(("unstack",constant("e"),constant("c"))),7) occurs(action(("unstack",constant("e"),constant("b"))),7) occurs(action(("unstack",constant("e"),constant("d"))),7) occurs(action(("stack",constant("e"),constant("h"))),8) occurs(action(("stack",constant("a"),constant("h"))),8) occurs(action(("pick-up",constant("g"))),9) occurs(action(("pick-up",constant("c"))),9) occurs(action(("pick-up",constant("f"))),9) occurs(action(("pick-up",constant("d"))),9) occurs(action(("pick-up",constant("b"))),9) occurs(action(("stack",constant("c"),constant("a"))),10) occurs(action(("stack",constant("f"),constant("e"))),10) occurs(action(("stack",constant("f"),constant("a"))),10) occurs(action(("stack",constant("b"),constant("e"))),10) occurs(action(("stack",constant("b"),constant("a"))),10)
Solving Time: 0.00s
Memory: 52MB (+1MB)
SAT
SATISFIABLE
Models : 1+
Calls : 3
Time : 0.124s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
CPU Time : 0.120s
Choices : 149
Conflicts : 15 (Analyzed: 14)
Restarts : 0
Model-Level : 84.0
Problems : 3 (Average Length: 7.00 Splits: 0)
Lemmas : 14 (Deleted: 0)
Binary : 0 (Ratio: 0.00%)
Ternary : 1 (Ratio: 7.14%)
Conflict : 14 (Average Length: 31.1 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 14 (Average: 5.57 Max: 23 Sum: 78)
Executed : 13 (Average: 5.50 Max: 23 Sum: 77 Ratio: 98.72%)
Bounded : 1 (Average: 1.00 Max: 1 Sum: 1 Ratio: 1.28%)
Rules : 4443
Atoms : 4443
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 3849 (Eliminated: 0 Frozen: 0)
Constraints : 16015 (Binary: 90.6% Ternary: 7.6% Other: 1.8%)
Memory Peak : 52MB
Max. Length : 10 steps
Sol. Length : 10 steps