planner.py version 0.0.1 Time: 0.05s 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.04s Memory: 51MB (+2MB) 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... Answer: 1 occurs(action(("board-truck",constant("driver1"),constant("truck1"),constant("s0"))),1) occurs(action(("load-truck",constant("package3"),constant("truck2"),constant("s1"))),2) occurs(action(("walk",constant("driver2"),constant("s0"),constant("p0-1"))),2) occurs(action(("drive-truck",constant("truck1"),constant("s0"),constant("s1"),constant("driver1"))),2) occurs(action(("drive-truck",constant("truck1"),constant("s1"),constant("s2"),constant("driver1"))),3) occurs(action(("load-truck",constant("package2"),constant("truck2"),constant("s1"))),3) occurs(action(("walk",constant("driver2"),constant("p0-1"),constant("s0"))),3) occurs(action(("unload-truck",constant("package3"),constant("truck2"),constant("s1"))),3) occurs(action(("load-truck",constant("package1"),constant("truck1"),constant("s2"))),4) occurs(action(("walk",constant("driver2"),constant("s0"),constant("p0-1"))),4) occurs(action(("drive-truck",constant("truck1"),constant("s2"),constant("s1"),constant("driver1"))),4) occurs(action(("walk",constant("driver2"),constant("p0-1"),constant("s1"))),5) occurs(action(("disembark-truck",constant("driver1"),constant("truck1"),constant("s1"))),5) occurs(action(("load-truck",constant("package3"),constant("truck1"),constant("s1"))),5) occurs(action(("board-truck",constant("driver2"),constant("truck1"),constant("s1"))),6) occurs(action(("board-truck",constant("driver1"),constant("truck2"),constant("s1"))),6) occurs(action(("unload-truck",constant("package1"),constant("truck1"),constant("s1"))),6) occurs(action(("unload-truck",constant("package2"),constant("truck2"),constant("s1"))),6) occurs(action(("unload-truck",constant("package3"),constant("truck1"),constant("s1"))),6) occurs(action(("drive-truck",constant("truck2"),constant("s1"),constant("s0"),constant("driver1"))),7) occurs(action(("drive-truck",constant("truck1"),constant("s1"),constant("s2"),constant("driver2"))),7) occurs(action(("load-truck",constant("package3"),constant("truck2"),constant("s1"))),7) occurs(action(("load-truck",constant("package2"),constant("truck1"),constant("s1"))),7) occurs(action(("load-truck",constant("package1"),constant("truck2"),constant("s1"))),7) occurs(action(("unload-truck",constant("package3"),constant("truck2"),constant("s0"))),8) occurs(action(("unload-truck",constant("package2"),constant("truck1"),constant("s2"))),8) occurs(action(("unload-truck",constant("package1"),constant("truck2"),constant("s0"))),8) occurs(action(("disembark-truck",constant("driver2"),constant("truck1"),constant("s2"))),8) occurs(action(("disembark-truck",constant("driver1"),constant("truck2"),constant("s0"))),8) occurs(action(("load-truck",constant("package3"),constant("truck2"),constant("s0"))),9) occurs(action(("walk",constant("driver2"),constant("s2"),constant("p2-1"))),9) occurs(action(("walk",constant("driver1"),constant("s0"),constant("p0-1"))),9) occurs(action(("unload-truck",constant("package3"),constant("truck2"),constant("s0"))),10) occurs(action(("walk",constant("driver2"),constant("p2-1"),constant("s1"))),10) occurs(action(("walk",constant("driver1"),constant("p0-1"),constant("s1"))),10) Solving Time: 0.04s Memory: 54MB (+1MB) SAT SATISFIABLE Models : 1+ Calls : 3 Time : 0.179s (Solving: 0.04s 1st Model: 0.04s Unsat: 0.00s) CPU Time : 0.180s Choices : 5468 Conflicts : 2056 (Analyzed: 2055) Restarts : 22 (Average: 93.41 Last: 109) Model-Level : 53.0 Problems : 3 (Average Length: 7.00 Splits: 0) Lemmas : 2055 (Deleted: 0) Binary : 435 (Ratio: 21.17%) Ternary : 99 (Ratio: 4.82%) Conflict : 2055 (Average Length: 15.3 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 2055 (Average: 2.56 Max: 79 Sum: 5258) Executed : 2054 (Average: 2.56 Max: 79 Sum: 5257 Ratio: 99.98%) Bounded : 1 (Average: 1.00 Max: 1 Sum: 1 Ratio: 0.02%) Rules : 9628 Atoms : 9628 Bodies : 1 (Original: 0) Tight : Yes Variables : 4720 (Eliminated: 0 Frozen: 2664) Constraints : 8550 (Binary: 86.4% Ternary: 9.5% Other: 4.1%) Memory Peak : 54MB Max. Length : 10 steps Sol. Length : 10 steps