patrick/tplp-planning-benchmark
1
0
Fork 0
Code Issues Releases Activity

Add benchmark result [pb-e2 | ipc-2002 | driverlog-strips-automatic | 5]

Browse Source
This commit is contained in:
Potassco Bot
2017-11-25 01:47:47 +01:00
parent fe82b422f5
commit 4381200171
3 changed files with 130 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

61
pb-e2/ipc-2002_driverlog-strips-automatic_5.out Normal file
View File

@@ -0,0 +1,61 @@
planner.py version 0.0.1
Time: 0.06s
Memory: 50MB
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: 50MB (+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.06s
Memory: 55MB (+5MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("drive-truck",constant("truck1"),constant("s1"),constant("s2"),constant("driver1"))),1) occurs(action(("load-truck",constant("package4"),constant("truck1"),constant("s2"))),1) occurs(action(("board-truck",constant("driver1"),constant("truck1"),constant("s1"))),1) occurs(action(("walk",constant("driver3"),constant("s0"),constant("p0-1"))),1) occurs(action(("load-truck",constant("package3"),constant("truck1"),constant("s2"))),2) occurs(action(("load-truck",constant("package2"),constant("truck1"),constant("s0"))),2) occurs(action(("load-truck",constant("package1"),constant("truck1"),constant("s0"))),2) occurs(action(("drive-truck",constant("truck1"),constant("s2"),constant("s0"),constant("driver1"))),2) occurs(action(("disembark-truck",constant("driver1"),constant("truck1"),constant("s0"))),2) occurs(action(("walk",constant("driver3"),constant("p0-1"),constant("s1"))),2) occurs(action(("unload-truck",constant("package4"),constant("truck1"),constant("s0"))),3) occurs(action(("drive-truck",constant("truck2"),constant("s1"),constant("s2"),constant("driver3"))),3) occurs(action(("drive-truck",constant("truck1"),constant("s0"),constant("s2"),constant("driver2"))),3) occurs(action(("board-truck",constant("driver3"),constant("truck2"),constant("s1"))),3) occurs(action(("board-truck",constant("driver2"),constant("truck1"),constant("s0"))),3) occurs(action(("unload-truck",constant("package2"),constant("truck1"),constant("s2"))),3) occurs(action(("unload-truck",constant("package1"),constant("truck1"),constant("s2"))),3) occurs(action(("unload-truck",constant("package3"),constant("truck1"),constant("s2"))),3) occurs(action(("walk",constant("driver1"),constant("s0"),constant("p0-1"))),3) occurs(action(("load-truck",constant("package3"),constant("truck2"),constant("s2"))),4) occurs(action(("load-truck",constant("package2"),constant("truck2"),constant("s2"))),4) occurs(action(("load-truck",constant("package1"),constant("truck2"),constant("s2"))),4) occurs(action(("drive-truck",constant("truck1"),constant("s2"),constant("s0"),constant("driver2"))),4) occurs(action(("drive-truck",constant("truck2"),constant("s2"),constant("s1"),constant("driver3"))),4) occurs(action(("disembark-truck",constant("driver3"),constant("truck2"),constant("s1"))),4) occurs(action(("walk",constant("driver1"),constant("p0-1"),constant("s1"))),4) occurs(action(("unload-truck",constant("package3"),constant("truck2"),constant("s1"))),5) occurs(action(("unload-truck",constant("package2"),constant("truck2"),constant("s1"))),5) occurs(action(("unload-truck",constant("package1"),constant("truck2"),constant("s1"))),5) occurs(action(("drive-truck",constant("truck2"),constant("s1"),constant("s2"),constant("driver3"))),5) occurs(action(("drive-truck",constant("truck1"),constant("s0"),constant("s2"),constant("driver2"))),5) occurs(action(("disembark-truck",constant("driver2"),constant("truck1"),constant("s2"))),5) occurs(action(("board-truck",constant("driver3"),constant("truck2"),constant("s1"))),5)
Solving Time: 0.06s
Memory: 56MB (+1MB)
SAT
SATISFIABLE
Models : 1+
Calls : 2
Time : 0.192s (Solving: 0.06s 1st Model: 0.06s Unsat: 0.00s)
CPU Time : 0.190s
Choices : 5790
Conflicts : 1801 (Analyzed: 1801)
Restarts : 18 (Average: 100.06 Last: 133)
Model-Level : 48.0
Problems : 2 (Average Length: 4.50 Splits: 0)
Lemmas : 1963 (Deleted: 0)
Binary : 579 (Ratio: 29.50%)
Ternary : 214 (Ratio: 10.90%)
Conflict : 1801 (Average Length: 5.8 Ratio: 91.75%)
Loop : 162 (Average Length: 9.1 Ratio: 8.25%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 1801 (Average: 3.47 Max: 36 Sum: 6255)
Executed : 1721 (Average: 3.16 Max: 36 Sum: 5695 Ratio: 91.05%)
Bounded : 80 (Average: 7.00 Max: 7 Sum: 560 Ratio: 8.95%)
Rules : 12710
Atoms : 12710
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 5633 (Eliminated: 0 Frozen: 4487)
Constraints : 13380 (Binary: 83.1% Ternary: 12.5% Other: 4.4%)
Memory Peak : 56MB
Max. Length : 5 steps
Sol. Length : 5 steps