planner.py version 0.0.1

Time:	 0.04s
Memory: 48MB

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:		 48MB (+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:		 52MB (+4MB)
Unblocking actions...
Solving...
Solving Time:	 0.00s
Memory:		 53MB (+1MB)
UNSAT
Iteration Time:	 0.07s

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.05s
Memory:		 56MB (+3MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("unstack",constant("f"),constant("e"))),1) occurs(action(("unstack",constant("j"),constant("i"))),1) occurs(action(("unstack",constant("g"),constant("b"))),1) occurs(action(("unstack",constant("d"),constant("c"))),1) occurs(action(("put-down",constant("g"))),2) occurs(action(("stack",constant("f"),constant("g"))),3) occurs(action(("put-down",constant("d"))),3) occurs(action(("stack",constant("d"),constant("g"))),3) occurs(action(("put-down",constant("j"))),3) occurs(action(("stack",constant("j"),constant("g"))),3) occurs(action(("pick-up",constant("i"))),4) occurs(action(("unstack",constant("c"),constant("h"))),4) occurs(action(("unstack",constant("b"),constant("a"))),4) occurs(action(("unstack",constant("e"),constant("k"))),4) occurs(action(("pick-up",constant("j"))),4) occurs(action(("stack",constant("c"),constant("f"))),5) occurs(action(("stack",constant("j"),constant("k"))),5) occurs(action(("stack",constant("b"),constant("d"))),5) occurs(action(("put-down",constant("e"))),5) occurs(action(("stack",constant("i"),constant("k"))),5) occurs(action(("stack",constant("i"),constant("f"))),5) occurs(action(("stack",constant("j"),constant("d"))),5) occurs(action(("unstack",constant("i"),constant("k"))),6) occurs(action(("unstack",constant("i"),constant("f"))),6) occurs(action(("pick-up",constant("a"))),6) occurs(action(("pick-up",constant("h"))),6) occurs(action(("unstack",constant("j"),constant("g"))),6) occurs(action(("unstack",constant("j"),constant("d"))),6) occurs(action(("stack",constant("i"),constant("e"))),7) occurs(action(("stack",constant("a"),constant("c"))),7) occurs(action(("stack",constant("i"),constant("f"))),7) occurs(action(("stack",constant("a"),constant("b"))),7) occurs(action(("stack",constant("a"),constant("e"))),7) occurs(action(("stack",constant("a"),constant("f"))),7) occurs(action(("put-down",constant("j"))),7) occurs(action(("unstack",constant("i"),constant("f"))),8) occurs(action(("pick-up",constant("g"))),8) occurs(action(("pick-up",constant("k"))),8) occurs(action(("pick-up",constant("d"))),8) occurs(action(("stack",constant("h"),constant("a"))),9) occurs(action(("stack",constant("d"),constant("j"))),9) occurs(action(("put-down",constant("i"))),9) occurs(action(("stack",constant("i"),constant("a"))),9) occurs(action(("stack",constant("i"),constant("f"))),9) occurs(action(("stack",constant("i"),constant("j"))),9) occurs(action(("put-down",constant("h"))),9) occurs(action(("stack",constant("h"),constant("f"))),9) occurs(action(("stack",constant("h"),constant("j"))),9) occurs(action(("put-down",constant("d"))),9) occurs(action(("stack",constant("d"),constant("a"))),9) occurs(action(("stack",constant("d"),constant("f"))),9) occurs(action(("stack",constant("g"),constant("i"))),10) occurs(action(("stack",constant("k"),constant("h"))),10) occurs(action(("stack",constant("g"),constant("d"))),10)
Solving Time:	 0.01s
Memory:		 57MB (+1MB)
SAT
SATISFIABLE

Models       : 1+
Calls        : 3
Time         : 0.191s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
CPU Time     : 0.200s

Choices      : 666     
Conflicts    : 71       (Analyzed: 70)
Restarts     : 0       
Model-Level  : 81.0    
Problems     : 3        (Average Length: 7.00 Splits: 0)
Lemmas       : 70       (Deleted: 0)
  Binary     : 2        (Ratio:   2.86%)
  Ternary    : 1        (Ratio:   1.43%)
  Conflict   : 70       (Average Length:   50.1 Ratio: 100.00%) 
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 70       (Average:  8.54 Max: 122 Sum:    598)
  Executed   : 69       (Average:  8.53 Max: 122 Sum:    597 Ratio:  99.83%)
  Bounded    : 1        (Average:  1.00 Max:   1 Sum:      1 Ratio:   0.17%)

Rules        : 8115    
Atoms        : 8115    
Bodies       : 1        (Original: 0)
Tight        : Yes
Variables    : 6812     (Eliminated:    0 Frozen:    0)
Constraints  : 29318    (Binary:  91.5% Ternary:   7.2% Other:   1.3%)

Memory Peak  : 57MB
Max. Length  : 10 steps
Sol. Length  : 10 steps