planner.py version 0.0.1 Time: 0.03s Memory: 47MB 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: 47MB (+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.05s Memory: 50MB (+3MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 51MB (+1MB) UNSAT Iteration Time: 0.06s 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.04s Memory: 52MB (+1MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 53MB (+1MB) UNSAT Iteration Time: 0.06s 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.04s Memory: 55MB (+2MB) Unblocking actions... Solving... Solving Time: 0.67s Memory: 56MB (+1MB) UNSAT Iteration Time: 0.72s 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.03s Memory: 58MB (+2MB) Unblocking actions... Solving... Answer: 1 occurs(action(("unstack",constant("d"),constant("b"))),1) occurs(action(("stack",constant("d"),constant("h"))),2) occurs(action(("pick-up",constant("a"))),3) occurs(action(("stack",constant("a"),constant("d"))),4) occurs(action(("unstack",constant("b"),constant("f"))),5) occurs(action(("put-down",constant("b"))),6) occurs(action(("unstack",constant("f"),constant("g"))),7) occurs(action(("stack",constant("f"),constant("a"))),8) occurs(action(("pick-up",constant("g"))),9) occurs(action(("stack",constant("g"),constant("f"))),10) occurs(action(("pick-up",constant("e"))),11) occurs(action(("stack",constant("e"),constant("g"))),12) occurs(action(("pick-up",constant("b"))),13) occurs(action(("stack",constant("b"),constant("e"))),14) occurs(action(("pick-up",constant("c"))),15) occurs(action(("put-down",constant("c"))),16) occurs(action(("pick-up",constant("c"))),17) occurs(action(("put-down",constant("c"))),18) occurs(action(("pick-up",constant("c"))),19) occurs(action(("stack",constant("c"),constant("b"))),20) Solving Time: 0.01s Memory: 59MB (+1MB) SAT SATISFIABLE Models : 1+ Calls : 5 Time : 0.919s (Solving: 0.68s 1st Model: 0.00s Unsat: 0.68s) CPU Time : 0.930s Choices : 10819 (Domain: 10819) Conflicts : 6953 (Analyzed: 6950) Restarts : 80 (Average: 86.88 Last: 54) Model-Level : 68.0 Problems : 5 (Average Length: 12.00 Splits: 0) Lemmas : 6950 (Deleted: 4390) Binary : 35 (Ratio: 0.50%) Ternary : 92 (Ratio: 1.32%) Conflict : 6950 (Average Length: 81.6 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 6950 (Average: 1.47 Max: 31 Sum: 10229) Executed : 6938 (Average: 1.46 Max: 31 Sum: 10127 Ratio: 99.00%) Bounded : 12 (Average: 8.50 Max: 17 Sum: 102 Ratio: 1.00%) Rules : 4756 Atoms : 4756 Bodies : 1 (Original: 0) Tight : Yes Variables : 9798 (Eliminated: 0 Frozen: 2755) Constraints : 43344 (Binary: 88.6% Ternary: 8.6% Other: 2.8%) Memory Peak : 60MB Max. Length : 20 steps Sol. Length : 20 steps