planner.py version 0.0.1

Time:	 0.06s
Memory: 50MB

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:		 50MB (+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:		 51MB (+1MB)
Unblocking actions...
Solving...
Solving Time:	 0.00s
Memory:		 52MB (+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:		 53MB (+1MB)
Unblocking actions...
Solving...
Solving Time:	 0.34s
Memory:		 54MB (+1MB)
UNKNOWN
Iteration Time:	 0.38s

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.02s
Memory:		 55MB (+1MB)
Unblocking actions...
Solving...
Solving Time:	 0.38s
Memory:		 56MB (+1MB)
UNKNOWN
Iteration Time:	 0.41s

Iteration 5
Queue:		 [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until:	 15
Grounding...	 [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
Grounding Time:	 0.02s
Memory:		 58MB (+2MB)
Unblocking actions...
Solving...
Solving Time:	 0.40s
Memory:		 59MB (+1MB)
UNKNOWN
Iteration Time:	 0.43s

Iteration 6
Queue:		 [(5,25,0,True), (6,30,0,True)]
Grounded Until:	 20
Grounding...	 [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
Grounding Time:	 0.03s
Memory:		 60MB (+1MB)
Unblocking actions...
Solving...
Solving Time:	 0.53s
Memory:		 62MB (+2MB)
UNKNOWN
Iteration Time:	 0.57s

Iteration 7
Queue:		 [(6,30,0,True)]
Grounded Until:	 25
Grounding...	 [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
Grounding Time:	 0.03s
Memory:		 64MB (+2MB)
Unblocking actions...
Solving...
Solving Time:	 0.51s
Memory:		 64MB (+0MB)
UNKNOWN
Iteration Time:	 0.55s

Iteration 8
Queue:		 [(2,10,1,True), (3,15,1,True), (4,20,1,True), (5,25,1,True), (6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True)]
Grounded Until:	 30
Blocking actions...
Solving...
Solving Time:	 0.11s
Memory:		 64MB (+0MB)
UNSAT
Iteration Time:	 0.11s

Iteration 9
Queue:		 [(3,15,1,True), (4,20,1,True), (5,25,1,True), (6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True)]
Grounded Until:	 30
Unblocking actions...
Solving...
Answer: 1
occurs(action(("load-truck",constant("package4"),constant("truck2"),constant("s1"))),1) occurs(action(("board-truck",constant("driver1"),constant("truck2"),constant("s1"))),2) occurs(action(("drive-truck",constant("truck2"),constant("s1"),constant("s2"),constant("driver1"))),3) occurs(action(("load-truck",constant("package2"),constant("truck2"),constant("s2"))),4) occurs(action(("walk",constant("driver2"),constant("s2"),constant("p0-2"))),5) occurs(action(("unload-truck",constant("package4"),constant("truck2"),constant("s2"))),6) occurs(action(("drive-truck",constant("truck2"),constant("s2"),constant("s1"),constant("driver1"))),7) occurs(action(("unload-truck",constant("package2"),constant("truck2"),constant("s1"))),8) occurs(action(("load-truck",constant("package5"),constant("truck2"),constant("s1"))),9) occurs(action(("drive-truck",constant("truck2"),constant("s1"),constant("s0"),constant("driver1"))),10) occurs(action(("unload-truck",constant("package5"),constant("truck2"),constant("s0"))),11) occurs(action(("disembark-truck",constant("driver1"),constant("truck2"),constant("s0"))),12) occurs(action(("walk",constant("driver1"),constant("s0"),constant("p0-2"))),13) occurs(action(("walk",constant("driver1"),constant("p0-2"),constant("s0"))),14) occurs(action(("walk",constant("driver2"),constant("p0-2"),constant("s0"))),15)
Solving Time:	 0.02s
Memory:		 64MB (+0MB)
SAT
SATISFIABLE

Models       : 1+
Calls        : 9
Time         : 2.580s (Solving: 2.26s 1st Model: 0.01s Unsat: 0.11s)
CPU Time     : 2.560s

Choices      : 91628   
Conflicts    : 51142    (Analyzed: 51140)
Restarts     : 521      (Average: 98.16 Last: 169)
Model-Level  : 43.0    
Problems     : 9        (Average Length: 20.33 Splits: 0)
Lemmas       : 51140    (Deleted: 23969)
  Binary     : 3867     (Ratio:   7.56%)
  Ternary    : 4175     (Ratio:   8.16%)
  Conflict   : 51140    (Average Length:   20.7 Ratio: 100.00%) 
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 51140    (Average:  1.68 Max:  69 Sum:  85666)
  Executed   : 51076    (Average:  1.66 Max:  69 Sum:  84993 Ratio:  99.21%)
  Bounded    : 64       (Average: 10.52 Max:  32 Sum:    673 Ratio:   0.79%)

Rules        : 12630   
Atoms        : 12630   
Bodies       : 1        (Original: 0)
Tight        : Yes
Variables    : 14860    (Eliminated:    0 Frozen: 5757)
Constraints  : 56149    (Binary:  88.6% Ternary:   6.7% Other:   4.7%)

Memory Peak  : 66MB
Max. Length  : 30 steps
Sol. Length  : 15 steps