75 lines
4.8 KiB
Plaintext
75 lines
4.8 KiB
Plaintext
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.14s
|
||
|
|
Memory: 56MB
|
||
|
|
|
||
|
|
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: 56MB (+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: 57MB (+1MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 58MB (+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: 60MB (+2MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("load-truck",constant("package1"),constant("truck1"),constant("s2"))),1) occurs(action(("walk",constant("driver1"),constant("s4"),constant("p3-4"))),1) occurs(action(("walk",constant("driver2"),constant("s1"),constant("p0-1"))),1) occurs(action(("walk",constant("driver1"),constant("p3-4"),constant("s3"))),2) occurs(action(("walk",constant("driver2"),constant("p0-1"),constant("s0"))),2) occurs(action(("load-truck",constant("package3"),constant("truck3"),constant("s3"))),3) occurs(action(("board-truck",constant("driver2"),constant("truck2"),constant("s0"))),3) occurs(action(("board-truck",constant("driver1"),constant("truck3"),constant("s3"))),3) occurs(action(("drive-truck",constant("truck3"),constant("s3"),constant("s2"),constant("driver1"))),4) occurs(action(("drive-truck",constant("truck2"),constant("s0"),constant("s4"),constant("driver2"))),4) occurs(action(("unload-truck",constant("package1"),constant("truck1"),constant("s2"))),4) occurs(action(("load-truck",constant("package1"),constant("truck3"),constant("s2"))),5) occurs(action(("disembark-truck",constant("driver1"),constant("truck3"),constant("s2"))),5) occurs(action(("drive-truck",constant("truck2"),constant("s4"),constant("s3"),constant("driver2"))),6) occurs(action(("board-truck",constant("driver1"),constant("truck1"),constant("s2"))),6) occurs(action(("unload-truck",constant("package3"),constant("truck3"),constant("s2"))),6) occurs(action(("load-truck",constant("package3"),constant("truck1"),constant("s2"))),7) occurs(action(("drive-truck",constant("truck1"),constant("s2"),constant("s1"),constant("driver1"))),7) occurs(action(("disembark-truck",constant("driver2"),constant("truck2"),constant("s3"))),7) occurs(action(("unload-truck",constant("package3"),constant("truck1"),constant("s1"))),8) occurs(action(("load-truck",constant("package2"),constant("truck1"),constant("s1"))),8) occurs(action(("walk",constant("driver2"),constant("s3"),constant("p3-4"))),8) occurs(action(("drive-truck",constant("truck1"),constant("s1"),constant("s2"),constant("driver1"))),8) occurs(action(("unload-truck",constant("package1"),constant("truck3"),constant("s2"))),8) occurs(action(("unload-truck",constant("package2"),constant("truck1"),constant("s2"))),9) occurs(action(("drive-truck",constant("truck1"),constant("s2"),constant("s3"),constant("driver1"))),9) occurs(action(("load-truck",constant("package1"),constant("truck1"),constant("s2"))),9) occurs(action(("unload-truck",constant("package1"),constant("truck1"),constant("s3"))),10) occurs(action(("walk",constant("driver2"),constant("p3-4"),constant("s4"))),10) occurs(action(("disembark-truck",constant("driver1"),constant("truck1"),constant("s3"))),10)
|
||
|
|
Solving Time: 0.20s
|
||
|
|
Memory: 62MB (+2MB)
|
||
|
|
SAT
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 3
|
||
|
|
Time : 0.460s (Solving: 0.20s 1st Model: 0.20s Unsat: 0.00s)
|
||
|
|
CPU Time : 0.460s
|
||
|
|
|
||
|
|
Choices : 8527
|
||
|
|
Conflicts : 5196 (Analyzed: 5196)
|
||
|
|
Restarts : 54 (Average: 96.22 Last: 66)
|
||
|
|
Model-Level : 34.0
|
||
|
|
Problems : 3 (Average Length: 7.00 Splits: 0)
|
||
|
|
Lemmas : 7732 (Deleted: 2296)
|
||
|
|
Binary : 2772 (Ratio: 35.85%)
|
||
|
|
Ternary : 216 (Ratio: 2.79%)
|
||
|
|
Conflict : 5196 (Average Length: 40.2 Ratio: 67.20%)
|
||
|
|
Loop : 2536 (Average Length: 2.0 Ratio: 32.80%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 5196 (Average: 1.61 Max: 36 Sum: 8362)
|
||
|
|
Executed : 5184 (Average: 1.58 Max: 36 Sum: 8218 Ratio: 98.28%)
|
||
|
|
Bounded : 12 (Average: 12.00 Max: 12 Sum: 144 Ratio: 1.72%)
|
||
|
|
|
||
|
|
Rules : 34034
|
||
|
|
Atoms : 34034
|
||
|
|
Bodies : 1 (Original: 0)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 6379 (Eliminated: 0 Frozen: 2633)
|
||
|
|
Constraints : 17642 (Binary: 90.0% Ternary: 6.2% Other: 3.8%)
|
||
|
|
|
||
|
|
Memory Peak : 62MB
|
||
|
|
Max. Length : 10 steps
|
||
|
|
Sol. Length : 10 steps
|
||
|
|
|
||
|
|
|