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

Add benchmark result [m-mpc | ipc-1998 | grid-round-2-strips | 4]

Browse Source
This commit is contained in:
Potassco Bot
2017-11-28 00:18:49 +01:00
parent dba1a268b8
commit 9f134234fd
3 changed files with 146 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

100
m-mpc/ipc-1998_grid-round-2-strips_4.out Normal file
View File

@@ -0,0 +1,100 @@
Madagascar 0.99999 25/02/2015 09:45:59 amd64 1-core (no VSIDS)
Options: file:/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/grid-round-2-strips/domain.pddl file:/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/grid-round-2-strips/instances/instance-4.pddlignoring --stats
ignoring --verbose
Domain: grid
Problem: strips-grid-y-4
Parser: 11150 ground actions and 1241 state variables
Invariants: 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 6.05 secs
Goal: conjunctive
Simplified: 10379 ground actions and 861 state variables
Actions: STRIPS
Disabling graph %: 10 20 30 40 50 60 70 80 90 100 0.49 secs (max SCC size 1)
Plan type: E-step
Allocated 32 MB permanent (total 227 MB)
Horizon 5: 57061 variables
5 UNSAT (0 decisions 0 conflicts)
Horizon 7: 79541 variables
7 UNSAT (0 decisions 0 conflicts)
Horizon 10: 113261 variables
Allocated 32 MB (total 508 MB)
Horizon 14: 158221 variables
Horizon 20: 225661 variables
10 UNSAT (122 decisions 121 conflicts)
Horizon 28: 315581 variables
Horizon 40: 450461 variables
Allocated 32 MB permanent (total 1027 MB)
Horizon 56: 630301 variables
Horizon 80: 900061 variables
Allocated 32 MB permanent (total 1340 MB)
Horizon 113: 1270981 variables
SAT (298 decisions 120 conflicts)
PLAN FOUND: 56 steps
STEP 0: move(node4-4,node3-4)
STEP 1: move(node3-4,node2-4)
STEP 2: move(node2-4,node1-4)
STEP 3: move(node1-4,node1-5)
STEP 4: move(node1-5,node1-6)
STEP 5.0: pickup(node1-6,key0)
STEP 5.1: move(node1-6,node1-5)
STEP 6: move(node1-5,node1-4)
STEP 7: move(node1-4,node1-3)
STEP 8: move(node1-3,node1-2)
STEP 9: move(node1-2,node1-1)
STEP 10.0: pickup-and-loose(node1-1,key9,key0)
STEP 10.1: move(node1-1,node1-2)
STEP 11: move(node1-2,node1-3)
STEP 12: move(node1-3,node2-3)
STEP 13: move(node2-3,node3-3)
STEP 14: move(node3-3,node4-3)
STEP 15.0: unlock(node4-3,node5-3,key9,square)
STEP 15.1: move(node4-3,node4-4)
STEP 16: move(node4-4,node5-4)
STEP 17: move(node5-4,node6-4)
STEP 18.0: unlock(node6-4,node6-3,key9,square)
STEP 18.1: move(node6-4,node5-4)
STEP 19: move(node5-4,node5-3)
STEP 20: unlock(node5-3,node5-2,key9,square)
STEP 21: move(node5-3,node5-2)
STEP 22: unlock(node5-2,node5-1,key9,square)
STEP 23: move(node5-2,node5-1)
STEP 24.0: pickup-and-loose(node5-1,key4,key9)
STEP 24.1: move(node5-1,node5-2)
STEP 25: move(node5-2,node5-3)
STEP 26: move(node5-3,node6-3)
STEP 27: move(node6-3,node6-4)
STEP 28.0: putdown(node6-4,key4)
STEP 28.1: move(node6-4,node5-4)
STEP 29: move(node5-4,node5-5)
STEP 30: move(node5-5,node4-5)
STEP 31: move(node4-5,node4-6)
STEP 32: move(node4-6,node3-6)
STEP 33.0: pickup(node3-6,key7)
STEP 33.1: move(node3-6,node3-5)
STEP 34: move(node3-5,node2-5)
STEP 35: move(node2-5,node1-5)
STEP 36: move(node1-5,node0-5)
STEP 37: move(node0-5,node0-4)
STEP 38: move(node0-4,node0-3)
STEP 39.0: pickup-and-loose(node0-3,key3,key7)
STEP 39.1: move(node0-3,node1-3)
STEP 40: move(node1-3,node2-3)
STEP 41: move(node2-3,node2-2)
STEP 42: move(node2-2,node2-1)
STEP 43: move(node2-1,node3-1)
STEP 44: move(node3-1,node3-0)
STEP 45: putdown(node3-0,key3)
54 actions in the plan.
total time 8.87 preprocess 6.88
total size 1.479 GB
max. learned clause length 33482
t val conflicts decisions
5 0 0 0
7 0 0 0
10 0 121 122
14 -1 420 465
20 -1 360 499
28 -1 301 412
40 -1 242 470
56 1 120 298