planner.py version 0.0.1 Time: 0.06s 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.03s Memory: 50MB (+1MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 51MB (+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 (+2MB) Unblocking actions... Solving... Answer: 1 occurs(action(("load-truck",constant("package4"),constant("truck1"),constant("s1"))),1) occurs(action(("board-truck",constant("driver3"),constant("truck2"),constant("s0"))),1) occurs(action(("board-truck",constant("driver2"),constant("truck1"),constant("s1"))),1) occurs(action(("load-truck",constant("package3"),constant("truck2"),constant("s0"))),2) occurs(action(("drive-truck",constant("truck1"),constant("s1"),constant("s0"),constant("driver2"))),2) occurs(action(("disembark-truck",constant("driver3"),constant("truck2"),constant("s0"))),2) occurs(action(("walk",constant("driver1"),constant("s1"),constant("p0-1"))),2) occurs(action(("unload-truck",constant("package4"),constant("truck1"),constant("s0"))),3) occurs(action(("board-truck",constant("driver3"),constant("truck2"),constant("s0"))),3) occurs(action(("walk",constant("driver1"),constant("p0-1"),constant("s0"))),3) occurs(action(("disembark-truck",constant("driver2"),constant("truck1"),constant("s0"))),4) occurs(action(("load-truck",constant("package4"),constant("truck2"),constant("s0"))),4) occurs(action(("disembark-truck",constant("driver3"),constant("truck2"),constant("s0"))),4) occurs(action(("unload-truck",constant("package3"),constant("truck2"),constant("s0"))),4) occurs(action(("unload-truck",constant("package4"),constant("truck2"),constant("s0"))),5) occurs(action(("load-truck",constant("package3"),constant("truck1"),constant("s0"))),5) occurs(action(("board-truck",constant("driver1"),constant("truck2"),constant("s0"))),5) occurs(action(("board-truck",constant("driver3"),constant("truck1"),constant("s0"))),5) occurs(action(("walk",constant("driver2"),constant("s0"),constant("p0-1"))),5) occurs(action(("drive-truck",constant("truck2"),constant("s0"),constant("s2"),constant("driver1"))),6) occurs(action(("drive-truck",constant("truck1"),constant("s0"),constant("s2"),constant("driver3"))),6) occurs(action(("walk",constant("driver2"),constant("p0-1"),constant("s1"))),6) occurs(action(("unload-truck",constant("package3"),constant("truck1"),constant("s2"))),7) occurs(action(("load-truck",constant("package1"),constant("truck1"),constant("s2"))),7) occurs(action(("disembark-truck",constant("driver1"),constant("truck2"),constant("s2"))),7) occurs(action(("drive-truck",constant("truck1"),constant("s2"),constant("s0"),constant("driver3"))),8) occurs(action(("walk",constant("driver2"),constant("s1"),constant("p0-1"))),8) occurs(action(("walk",constant("driver1"),constant("s2"),constant("p1-2"))),8) occurs(action(("walk",constant("driver2"),constant("p0-1"),constant("s0"))),9) occurs(action(("load-truck",constant("package3"),constant("truck2"),constant("s2"))),9) occurs(action(("drive-truck",constant("truck1"),constant("s0"),constant("s1"),constant("driver3"))),9) occurs(action(("unload-truck",constant("package3"),constant("truck2"),constant("s2"))),10) occurs(action(("unload-truck",constant("package1"),constant("truck1"),constant("s1"))),10) occurs(action(("disembark-truck",constant("driver3"),constant("truck1"),constant("s1"))),10) occurs(action(("walk",constant("driver1"),constant("p1-2"),constant("s1"))),10) Solving Time: 0.23s Memory: 54MB (+1MB) SAT SATISFIABLE Models : 1+ Calls : 3 Time : 0.376s (Solving: 0.23s 1st Model: 0.22s Unsat: 0.00s) CPU Time : 0.370s Choices : 10957 Conflicts : 6290 (Analyzed: 6289) Restarts : 63 (Average: 99.83 Last: 52) Model-Level : 46.0 Problems : 3 (Average Length: 7.00 Splits: 0) Lemmas : 6289 (Deleted: 2405) Binary : 187 (Ratio: 2.97%) Ternary : 251 (Ratio: 3.99%) Conflict : 6289 (Average Length: 21.7 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 6289 (Average: 1.70 Max: 47 Sum: 10660) Executed : 6258 (Average: 1.64 Max: 47 Sum: 10304 Ratio: 96.66%) Bounded : 31 (Average: 11.48 Max: 12 Sum: 356 Ratio: 3.34%) Rules : 10809 Atoms : 10809 Bodies : 1 (Original: 0) Tight : Yes Variables : 7181 (Eliminated: 0 Frozen: 855) Constraints : 24003 (Binary: 81.2% Ternary: 14.5% Other: 4.3%) Memory Peak : 54MB Max. Length : 10 steps Sol. Length : 10 steps