75 lines
4.9 KiB
Plaintext
75 lines
4.9 KiB
Plaintext
planner.py version 0.0.1
|
|
|
|
Time: 0.04s
|
|
Memory: 48MB
|
|
|
|
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: 48MB (+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: 49MB (+1MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 50MB (+1MB)
|
|
UNSAT
|
|
Iteration Time: 0.04s
|
|
|
|
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: 51MB (+1MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Answer: 1
|
|
occurs(action(("load-truck",constant("package3"),constant("truck2"),constant("s1"))),1) occurs(action(("load-truck",constant("package2"),constant("truck2"),constant("s1"))),1) occurs(action(("board-truck",constant("driver2"),constant("truck1"),constant("s0"))),1) occurs(action(("walk",constant("driver1"),constant("s0"),constant("p0-1"))),1) occurs(action(("walk",constant("driver1"),constant("p0-1"),constant("s1"))),2) occurs(action(("drive-truck",constant("truck1"),constant("s0"),constant("s1"),constant("driver2"))),2) occurs(action(("disembark-truck",constant("driver2"),constant("truck1"),constant("s1"))),3) occurs(action(("board-truck",constant("driver1"),constant("truck2"),constant("s1"))),3) occurs(action(("drive-truck",constant("truck2"),constant("s1"),constant("s2"),constant("driver1"))),4) occurs(action(("unload-truck",constant("package2"),constant("truck2"),constant("s2"))),5) occurs(action(("load-truck",constant("package1"),constant("truck2"),constant("s2"))),5) occurs(action(("board-truck",constant("driver2"),constant("truck1"),constant("s1"))),5) occurs(action(("drive-truck",constant("truck1"),constant("s1"),constant("s2"),constant("driver2"))),6) occurs(action(("drive-truck",constant("truck2"),constant("s2"),constant("s1"),constant("driver1"))),6) occurs(action(("drive-truck",constant("truck2"),constant("s1"),constant("s0"),constant("driver1"))),7) occurs(action(("load-truck",constant("package2"),constant("truck1"),constant("s2"))),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(("load-truck",constant("package2"),constant("truck1"),constant("s2"))),9) occurs(action(("load-truck",constant("package1"),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(("unload-truck",constant("package2"),constant("truck1"),constant("s2"))),10) occurs(action(("unload-truck",constant("package1"),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.08s
|
|
Memory: 52MB (+1MB)
|
|
SAT
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 3
|
|
Time : 0.197s (Solving: 0.08s 1st Model: 0.08s Unsat: 0.00s)
|
|
CPU Time : 0.200s
|
|
|
|
Choices : 4040
|
|
Conflicts : 2160 (Analyzed: 2159)
|
|
Restarts : 24 (Average: 89.96 Last: 40)
|
|
Model-Level : 38.0
|
|
Problems : 3 (Average Length: 7.00 Splits: 0)
|
|
Lemmas : 2159 (Deleted: 925)
|
|
Binary : 90 (Ratio: 4.17%)
|
|
Ternary : 104 (Ratio: 4.82%)
|
|
Conflict : 2159 (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 : 2159 (Average: 1.77 Max: 38 Sum: 3813)
|
|
Executed : 2154 (Average: 1.75 Max: 38 Sum: 3786 Ratio: 99.29%)
|
|
Bounded : 5 (Average: 5.40 Max: 12 Sum: 27 Ratio: 0.71%)
|
|
|
|
Rules : 7690
|
|
Atoms : 7690
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 5743 (Eliminated: 0 Frozen: 774)
|
|
Constraints : 17029 (Binary: 81.0% Ternary: 14.2% Other: 4.8%)
|
|
|
|
Memory Peak : 52MB
|
|
Max. Length : 10 steps
|
|
Sol. Length : 10 steps
|
|
|
|
|