planner.py version 0.0.1

Time:	 0.05s
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.03s
Memory:		 49MB (+1MB)
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(("load-truck",constant("package3"),constant("truck2"),constant("s1"))),1) occurs(action(("load-truck",constant("package2"),constant("truck2"),constant("s1"))),1) occurs(action(("walk",constant("driver2"),constant("s0"),constant("p0-1"))),1) occurs(action(("board-truck",constant("driver1"),constant("truck1"),constant("s0"))),1) occurs(action(("drive-truck",constant("truck1"),constant("s0"),constant("s2"),constant("driver1"))),2) occurs(action(("walk",constant("driver2"),constant("p0-1"),constant("s1"))),2) occurs(action(("board-truck",constant("driver2"),constant("truck2"),constant("s1"))),3) occurs(action(("disembark-truck",constant("driver1"),constant("truck1"),constant("s2"))),3) occurs(action(("drive-truck",constant("truck2"),constant("s1"),constant("s2"),constant("driver2"))),4) occurs(action(("walk",constant("driver1"),constant("s2"),constant("p2-1"))),4) occurs(action(("unload-truck",constant("package2"),constant("truck2"),constant("s2"))),5) occurs(action(("walk",constant("driver1"),constant("p2-1"),constant("s1"))),5) occurs(action(("load-truck",constant("package1"),constant("truck2"),constant("s2"))),5) occurs(action(("drive-truck",constant("truck2"),constant("s2"),constant("s0"),constant("driver2"))),6) occurs(action(("unload-truck",constant("package1"),constant("truck2"),constant("s0"))),7) occurs(action(("disembark-truck",constant("driver2"),constant("truck2"),constant("s0"))),7) occurs(action(("walk",constant("driver2"),constant("s0"),constant("p0-1"))),8) occurs(action(("walk",constant("driver2"),constant("p0-1"),constant("s1"))),9) occurs(action(("unload-truck",constant("package3"),constant("truck2"),constant("s0"))),10)
Solving Time:	 0.00s
Memory:		 52MB (+1MB)
SAT
SATISFIABLE

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

Choices      : 213      (Domain: 212)
Conflicts    : 59       (Analyzed: 58)
Restarts     : 0       
Model-Level  : 47.0    
Problems     : 3        (Average Length: 7.00 Splits: 0)
Lemmas       : 58       (Deleted: 0)
  Binary     : 9        (Ratio:  15.52%)
  Ternary    : 2        (Ratio:   3.45%)
  Conflict   : 58       (Average Length:   22.7 Ratio: 100.00%) 
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 58       (Average:  3.10 Max:  17 Sum:    180)
  Executed   : 56       (Average:  3.07 Max:  17 Sum:    178 Ratio:  98.89%)
  Bounded    : 2        (Average:  1.00 Max:   1 Sum:      2 Ratio:   1.11%)

Rules        : 7690    
Atoms        : 7690    
Bodies       : 1        (Original: 0)
Tight        : Yes
Variables    : 5743     (Eliminated:    0 Frozen:  774)
Constraints  : 17029    (Binary:  81.0% Ternary:  14.2% Other:   4.8%)

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