75 lines
5.0 KiB
Plaintext
75 lines
5.0 KiB
Plaintext
planner.py version 0.0.1
|
|
|
|
Time: 0.06s
|
|
Memory: 50MB
|
|
|
|
Iteration 1
|
|
Queue: [0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75]
|
|
Grounded Until: 0
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 50MB (+0MB)
|
|
UNSAT
|
|
Iteration Time: 0.00s
|
|
|
|
Iteration 2
|
|
Queue: [5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80]
|
|
Grounded Until: 0
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
|
Grounding Time: 0.05s
|
|
Memory: 52MB (+2MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 53MB (+1MB)
|
|
UNSAT
|
|
Iteration Time: 0.06s
|
|
|
|
Iteration 3
|
|
Queue: [10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85]
|
|
Grounded Until: 5
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
|
Grounding Time: 0.04s
|
|
Memory: 55MB (+2MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Answer: 1
|
|
occurs(action(("walk",constant("driver3"),constant("s2"),constant("p0-2"))),1) occurs(action(("walk",constant("driver2"),constant("s2"),constant("p2-1"))),1) occurs(action(("board-truck",constant("driver1"),constant("truck3"),constant("s1"))),2) occurs(action(("walk",constant("driver3"),constant("p0-2"),constant("s0"))),2) occurs(action(("walk",constant("driver2"),constant("p2-1"),constant("s1"))),2) occurs(action(("load-truck",constant("package5"),constant("truck2"),constant("s1"))),3) occurs(action(("board-truck",constant("driver2"),constant("truck2"),constant("s1"))),3) occurs(action(("disembark-truck",constant("driver1"),constant("truck3"),constant("s1"))),3) occurs(action(("walk",constant("driver3"),constant("s0"),constant("p0-1"))),3) occurs(action(("walk",constant("driver3"),constant("p0-1"),constant("s1"))),4) occurs(action(("disembark-truck",constant("driver2"),constant("truck2"),constant("s1"))),4) occurs(action(("board-truck",constant("driver2"),constant("truck1"),constant("s1"))),5) occurs(action(("board-truck",constant("driver1"),constant("truck2"),constant("s1"))),5) occurs(action(("board-truck",constant("driver3"),constant("truck3"),constant("s1"))),5) occurs(action(("unload-truck",constant("package5"),constant("truck2"),constant("s1"))),5) occurs(action(("load-truck",constant("package5"),constant("truck2"),constant("s1"))),6) occurs(action(("load-truck",constant("package4"),constant("truck3"),constant("s1"))),6) occurs(action(("drive-truck",constant("truck1"),constant("s1"),constant("s0"),constant("driver2"))),6) occurs(action(("disembark-truck",constant("driver1"),constant("truck2"),constant("s1"))),6) occurs(action(("drive-truck",constant("truck3"),constant("s1"),constant("s2"),constant("driver3"))),7) occurs(action(("board-truck",constant("driver1"),constant("truck2"),constant("s1"))),7) occurs(action(("drive-truck",constant("truck1"),constant("s0"),constant("s1"),constant("driver2"))),7) occurs(action(("unload-truck",constant("package4"),constant("truck3"),constant("s2"))),8) occurs(action(("load-truck",constant("package2"),constant("truck3"),constant("s2"))),8) occurs(action(("drive-truck",constant("truck2"),constant("s1"),constant("s2"),constant("driver1"))),8) occurs(action(("disembark-truck",constant("driver2"),constant("truck1"),constant("s1"))),8) occurs(action(("drive-truck",constant("truck2"),constant("s2"),constant("s0"),constant("driver1"))),9) occurs(action(("walk",constant("driver2"),constant("s1"),constant("p0-1"))),9) occurs(action(("drive-truck",constant("truck3"),constant("s2"),constant("s1"),constant("driver3"))),9) occurs(action(("unload-truck",constant("package5"),constant("truck2"),constant("s0"))),10) occurs(action(("unload-truck",constant("package2"),constant("truck3"),constant("s1"))),10) occurs(action(("walk",constant("driver2"),constant("p0-1"),constant("s0"))),10) occurs(action(("disembark-truck",constant("driver1"),constant("truck2"),constant("s0"))),10)
|
|
Solving Time: 0.01s
|
|
Memory: 56MB (+1MB)
|
|
SAT
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 3
|
|
Time : 0.190s (Solving: 0.01s 1st Model: 0.01s Unsat: 0.00s)
|
|
CPU Time : 0.190s
|
|
|
|
Choices : 1065
|
|
Conflicts : 272 (Analyzed: 271)
|
|
Restarts : 2 (Average: 135.50 Last: 76)
|
|
Model-Level : 76.0
|
|
Problems : 3 (Average Length: 7.00 Splits: 0)
|
|
Lemmas : 271 (Deleted: 0)
|
|
Binary : 16 (Ratio: 5.90%)
|
|
Ternary : 14 (Ratio: 5.17%)
|
|
Conflict : 271 (Average Length: 17.6 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 271 (Average: 3.71 Max: 98 Sum: 1006)
|
|
Executed : 268 (Average: 3.62 Max: 98 Sum: 981 Ratio: 97.51%)
|
|
Bounded : 3 (Average: 8.33 Max: 12 Sum: 25 Ratio: 2.49%)
|
|
|
|
Rules : 12855
|
|
Atoms : 12855
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 9676 (Eliminated: 0 Frozen: 1485)
|
|
Constraints : 33566 (Binary: 82.2% Ternary: 13.1% Other: 4.7%)
|
|
|
|
Memory Peak : 56MB
|
|
Max. Length : 10 steps
|
|
Sol. Length : 10 steps
|
|
|
|
|