75 lines
4.8 KiB
Plaintext
75 lines
4.8 KiB
Plaintext
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.17s
|
||
|
|
Memory: 61MB
|
||
|
|
|
||
|
|
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: 61MB (+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.12s
|
||
|
|
Memory: 65MB (+4MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.01s
|
||
|
|
Memory: 68MB (+3MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.15s
|
||
|
|
|
||
|
|
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.14s
|
||
|
|
Memory: 74MB (+6MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("lift",constant("hoist2"),constant("crate3"),constant("crate2"),constant("distributor1"))),1) occurs(action(("lift",constant("hoist1"),constant("crate4"),constant("crate0"),constant("distributor0"))),1) occurs(action(("drive",constant("truck1"),constant("depot0"),constant("distributor0"))),1) occurs(action(("load",constant("hoist1"),constant("crate4"),constant("truck1"),constant("distributor0"))),2) occurs(action(("load",constant("hoist2"),constant("crate3"),constant("truck0"),constant("distributor1"))),2) occurs(action(("lift",constant("hoist2"),constant("crate1"),constant("pallet5"),constant("distributor1"))),3) occurs(action(("drive",constant("truck1"),constant("distributor0"),constant("distributor1"))),3) occurs(action(("drive",constant("truck0"),constant("distributor1"),constant("distributor0"))),3) occurs(action(("unload",constant("hoist1"),constant("crate3"),constant("truck0"),constant("distributor0"))),4) occurs(action(("load",constant("hoist2"),constant("crate1"),constant("truck1"),constant("distributor1"))),4) occurs(action(("drop",constant("hoist1"),constant("crate3"),constant("pallet1"),constant("distributor0"))),5) occurs(action(("lift",constant("hoist0"),constant("crate5"),constant("pallet0"),constant("depot0"))),5) occurs(action(("unload",constant("hoist2"),constant("crate4"),constant("truck1"),constant("distributor1"))),5) occurs(action(("drive",constant("truck0"),constant("distributor0"),constant("depot0"))),5) occurs(action(("drop",constant("hoist2"),constant("crate4"),constant("pallet5"),constant("distributor1"))),6) occurs(action(("lift",constant("hoist1"),constant("crate3"),constant("pallet1"),constant("distributor0"))),6) occurs(action(("load",constant("hoist0"),constant("crate5"),constant("truck0"),constant("depot0"))),6) occurs(action(("drop",constant("hoist1"),constant("crate3"),constant("pallet1"),constant("distributor0"))),7) occurs(action(("unload",constant("hoist2"),constant("crate1"),constant("truck1"),constant("distributor1"))),7) occurs(action(("drop",constant("hoist2"),constant("crate1"),constant("crate4"),constant("distributor1"))),8) occurs(action(("drive",constant("truck0"),constant("depot0"),constant("distributor1"))),8) occurs(action(("drive",constant("truck1"),constant("distributor1"),constant("depot0"))),8) occurs(action(("unload",constant("hoist2"),constant("crate5"),constant("truck0"),constant("distributor1"))),9) occurs(action(("lift",constant("hoist1"),constant("crate0"),constant("pallet4"),constant("distributor0"))),9) occurs(action(("drop",constant("hoist2"),constant("crate5"),constant("crate1"),constant("distributor1"))),10) occurs(action(("drop",constant("hoist1"),constant("crate0"),constant("pallet3"),constant("distributor0"))),10)
|
||
|
|
Solving Time: 0.50s
|
||
|
|
Memory: 77MB (+3MB)
|
||
|
|
SAT
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 3
|
||
|
|
Time : 0.991s (Solving: 0.50s 1st Model: 0.49s Unsat: 0.00s)
|
||
|
|
CPU Time : 0.990s
|
||
|
|
|
||
|
|
Choices : 6146
|
||
|
|
Conflicts : 3689 (Analyzed: 3688)
|
||
|
|
Restarts : 38 (Average: 97.05 Last: 62)
|
||
|
|
Model-Level : 39.0
|
||
|
|
Problems : 3 (Average Length: 7.00 Splits: 0)
|
||
|
|
Lemmas : 3688 (Deleted: 823)
|
||
|
|
Binary : 285 (Ratio: 7.73%)
|
||
|
|
Ternary : 233 (Ratio: 6.32%)
|
||
|
|
Conflict : 3688 (Average Length: 41.6 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 3688 (Average: 1.77 Max: 42 Sum: 6531)
|
||
|
|
Executed : 3636 (Average: 1.63 Max: 42 Sum: 6028 Ratio: 92.30%)
|
||
|
|
Bounded : 52 (Average: 9.67 Max: 12 Sum: 503 Ratio: 7.70%)
|
||
|
|
|
||
|
|
Rules : 46762
|
||
|
|
Atoms : 46762
|
||
|
|
Bodies : 1 (Original: 0)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 20165 (Eliminated: 0 Frozen: 4023)
|
||
|
|
Constraints : 79444 (Binary: 86.6% Ternary: 9.4% Other: 4.0%)
|
||
|
|
|
||
|
|
Memory Peak : 77MB
|
||
|
|
Max. Length : 10 steps
|
||
|
|
Sol. Length : 10 steps
|
||
|
|
|
||
|
|
|