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: 51MB (+0MB) 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(("board-truck",constant("driver1"),constant("truck1"),constant("s1"))),1) occurs(action(("drive-truck",constant("truck1"),constant("s1"),constant("s2"),constant("driver1"))),2) occurs(action(("walk",constant("driver2"),constant("s0"),constant("p0-1"))),2) occurs(action(("disembark-truck",constant("driver1"),constant("truck1"),constant("s2"))),3) occurs(action(("walk",constant("driver2"),constant("p0-1"),constant("s1"))),3) occurs(action(("load-truck",constant("package4"),constant("truck1"),constant("s2"))),4) occurs(action(("load-truck",constant("package3"),constant("truck1"),constant("s2"))),4) occurs(action(("board-truck",constant("driver1"),constant("truck1"),constant("s2"))),4) occurs(action(("board-truck",constant("driver2"),constant("truck2"),constant("s1"))),4) occurs(action(("drive-truck",constant("truck1"),constant("s2"),constant("s1"),constant("driver1"))),5) occurs(action(("drive-truck",constant("truck1"),constant("s1"),constant("s0"),constant("driver1"))),6) occurs(action(("unload-truck",constant("package4"),constant("truck1"),constant("s0"))),7) occurs(action(("load-truck",constant("package2"),constant("truck1"),constant("s0"))),7) occurs(action(("load-truck",constant("package1"),constant("truck1"),constant("s0"))),7) occurs(action(("drive-truck",constant("truck1"),constant("s0"),constant("s1"),constant("driver1"))),8) occurs(action(("unload-truck",constant("package3"),constant("truck1"),constant("s1"))),9) occurs(action(("unload-truck",constant("package2"),constant("truck1"),constant("s1"))),9) occurs(action(("unload-truck",constant("package1"),constant("truck1"),constant("s1"))),9) occurs(action(("drive-truck",constant("truck2"),constant("s1"),constant("s2"),constant("driver2"))),9) occurs(action(("drive-truck",constant("truck1"),constant("s1"),constant("s2"),constant("driver1"))),10) occurs(action(("disembark-truck",constant("driver2"),constant("truck2"),constant("s2"))),10) Solving Time: 0.00s Memory: 54MB (+1MB) SAT SATISFIABLE Models : 1+ Calls : 3 Time : 0.148s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s) CPU Time : 0.160s Choices : 371 Conflicts : 59 (Analyzed: 58) Restarts : 0 Model-Level : 198.0 Problems : 3 (Average Length: 7.00 Splits: 0) Lemmas : 58 (Deleted: 0) Binary : 4 (Ratio: 6.90%) Ternary : 4 (Ratio: 6.90%) Conflict : 58 (Average Length: 14.3 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.21 Max: 45 Sum: 186) Executed : 57 (Average: 3.19 Max: 45 Sum: 185 Ratio: 99.46%) Bounded : 1 (Average: 1.00 Max: 1 Sum: 1 Ratio: 0.54%) Rules : 9052 Atoms : 9052 Bodies : 1 (Original: 0) Tight : Yes Variables : 7840 (Eliminated: 0 Frozen: 1125) Constraints : 24811 (Binary: 81.5% Ternary: 14.1% Other: 4.4%) Memory Peak : 54MB Max. Length : 10 steps Sol. Length : 10 steps