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

Add benchmark result [m-mpc | ipc-2000 | blocks-strips-typed | 46]

This commit is contained in:
Potassco Bot 2017-11-28 05:24:27 +01:00
parent 297a3ab6fd
commit 54ffb018a1
Signed by: potassco-bot
GPG Key ID: 1F54208CE70DDF73
3 changed files with 309 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

37
m-mpc/ipc-2000_blocks-strips-typed_46.env Normal file
View File

@ -0,0 +1,37 @@
command:
- timeout
- -m=8000000
- -t=900
- python3
- /home/pluehne/Documents/ASP/plasp-javier/encodings/planner/runplanner.py
- --domain=/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/domain.pddl
- /home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/instances/instance-46.pddl
- --stats
- --verbose
- --print-call
- --madagascar-MpC
configuration:
id: m-mpc
instanceSets:
- lpnmr-easy-instances
- lpnmr-hard-instances
- lpnmr-first-plan-not-serializable
- rintanen-aij-2012
options:
- --stats
- --verbose
- --print-call
- --madagascar-MpC
exitCode: 0
instance:
domain: blocks-strips-typed
instance: 46
ipc: ipc-2000
versions:
clingo: 5.2.2
fastDownward: 10997:847cdf0069cab0c8841a9958e783d1a7340fe2e9 (2017-11-02 15:10 +0100)
planner: 61750c0521c6104870e5b881c8b0c237e2af4a96 (2017-11-27 07:44:27 +0100)
plasp: 3.1.1
python: 3.6.3
workingDirectory: /home/pluehne/Documents/ASP/plasp-javier/encodings/planner

9
m-mpc/ipc-2000_blocks-strips-typed_46.err Normal file
View File

@ -0,0 +1,9 @@
# configuration: {'id': 'm-mpc', 'options': ['--stats', '--verbose', '--print-call', '--madagascar-MpC'], 'instanceSets': ['lpnmr-easy-instances', 'lpnmr-hard-instances', 'lpnmr-first-plan-not-serializable', 'rintanen-aij-2012']}
# instance: {'ipc': 'ipc-2000', 'domain': 'blocks-strips-typed', 'instance': 46}
# command: ['timeout', '-m=8000000', '-t=900', 'python3', '/home/pluehne/Documents/ASP/plasp-javier/encodings/planner/runplanner.py', '--domain=/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/instances/instance-46.pddl', '--stats', '--verbose', '--print-call', '--madagascar-MpC']
# working directory: /home/pluehne/Documents/ASP/plasp-javier/encodings/planner
# exit code: 0
# planner call: MpC /home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/instances/instance-46.pddl --stats --verbose
FINISHED CPU 7.43 MEM 33472 MAXMEM 3199564 STALE 0 MAXMEM_RSS 1229712
<time name="ALL">7330</time>

263
m-mpc/ipc-2000_blocks-strips-typed_46.out Normal file
View File

@ -0,0 +1,263 @@
Madagascar 0.99999 25/02/2015 09:45:59 amd64 1-core (no VSIDS)
Options: file:/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/domain.pddl file:/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/instances/instance-46.pddlignoring --stats
ignoring --verbose
Domain: blocks
Problem: blocks-22-1
Parser: 1012 ground actions and 551 state variables
Invariants: 0 1 2 3 4 5 6 7 8 9 10 0.14 secs
Goal: conjunctive
Simplified: 1012 ground actions and 551 state variables
Actions: STRIPS
Disabling graph %: 10 20 30 40 50 60 70 80 90 100 0.06 secs (max SCC size 1)
Plan type: E-step
Allocated 32 MB permanent (total 129 MB)
Horizon 5: 8366 variables
5 UNSAT (0 decisions 0 conflicts)
Horizon 7: 11492 variables
7 UNSAT (0 decisions 0 conflicts)
Horizon 10: 16181 variables
10 UNSAT (0 decisions 0 conflicts)
Horizon 14: 22433 variables
14 UNSAT (0 decisions 0 conflicts)
Horizon 20: 31811 variables
20 UNSAT (0 decisions 0 conflicts)
Horizon 28: 44315 variables
Allocated 32 MB (total 628 MB)
28 UNSAT (22 decisions 20 conflicts)
Horizon 40: 63071 variables
Horizon 56: 88079 variables
Horizon 80: 125591 variables
Horizon 113: 177170 variables
Allocated 32 MB permanent (total 1083 MB)
Horizon 160: 250631 variables
Horizon 226: 353789 variables
Allocated 32 MB permanent (total 1318 MB)
Horizon 320: 500711 variables
Allocated 32 MB permanent (total 1469 MB)
Horizon 452: 707027 variables
Allocated 32 MB permanent (total 1636 MB)
Horizon 640: 1000871 variables
Allocated 32 MB permanent (total 1828 MB)
Allocated 32 MB permanent (total 1860 MB)
Horizon 905: 1415066 variables
Allocated 32 MB permanent (total 2087 MB)
Allocated 32 MB permanent (total 2119 MB)
Horizon 1280: 2001191 variables
Allocated 32 MB permanent (total 2394 MB)
Allocated 32 MB permanent (total 2426 MB)
Allocated 32 MB permanent (total 2458 MB)
Allocated 32 MB permanent (total 2490 MB)
Horizon 1810: 2829581 variables
Allocated 32 MB permanent (total 2835 MB)
Allocated 32 MB permanent (total 2867 MB)
Allocated 32 MB permanent (total 2899 MB)
Allocated 32 MB permanent (total 2931 MB)
Allocated 32 MB permanent (total 2963 MB)
Horizon 2560: 4001831 variables
SAT (1782 decisions 652 conflicts)
PLAN FOUND: 226 steps
STEP 0: pick-up(n)
STEP 1: stack(n,g)
STEP 2: unstack(p,u)
STEP 3: stack(p,o)
STEP 4: unstack(n,g)
STEP 5: stack(n,u)
STEP 6: unstack(p,o)
STEP 7: stack(p,g)
STEP 8: unstack(o,f)
STEP 9: stack(o,p)
STEP 10: unstack(f,i)
STEP 11: stack(f,n)
STEP 12: unstack(o,p)
STEP 13: stack(o,a)
STEP 14: unstack(p,g)
STEP 15: stack(p,f)
STEP 16: unstack(o,a)
STEP 17: stack(o,p)
STEP 18: unstack(o,p)
STEP 19: stack(o,a)
STEP 20: unstack(p,f)
STEP 21: stack(p,g)
STEP 22: unstack(f,n)
STEP 23: stack(f,i)
STEP 24: unstack(n,u)
STEP 25: stack(n,f)
STEP 26: unstack(u,q)
STEP 27: stack(u,p)
STEP 28: pick-up(q)
STEP 29: stack(q,o)
STEP 30: unstack(n,f)
STEP 31: stack(n,u)
STEP 32: unstack(f,i)
STEP 33: stack(f,n)
STEP 34: unstack(q,o)
STEP 35: put-down(q)
STEP 36: unstack(o,a)
STEP 37: stack(o,a)
STEP 38: unstack(f,n)
STEP 39: stack(f,q)
STEP 40: unstack(n,u)
STEP 41: stack(n,u)
STEP 42: unstack(f,q)
STEP 43: stack(f,n)
STEP 44: pick-up(q)
STEP 45: stack(q,o)
STEP 46: unstack(f,n)
STEP 47: stack(f,q)
STEP 48: unstack(n,u)
STEP 49: stack(n,u)
STEP 50: unstack(f,q)
STEP 51: stack(f,n)
STEP 52: unstack(f,n)
STEP 53: stack(f,n)
STEP 54: unstack(f,n)
STEP 55: stack(f,n)
STEP 56: unstack(f,n)
STEP 57: stack(f,q)
STEP 58: unstack(n,u)
STEP 59: stack(n,f)
STEP 60: unstack(u,p)
STEP 61: stack(u,p)
STEP 62: unstack(n,f)
STEP 63: stack(n,u)
STEP 64: unstack(f,q)
STEP 65: stack(f,n)
STEP 66: unstack(q,o)
STEP 67: stack(q,o)
STEP 68: unstack(f,n)
STEP 69: stack(f,q)
STEP 70: unstack(n,u)
STEP 71: stack(n,f)
STEP 72: unstack(u,p)
STEP 73: stack(u,p)
STEP 74: unstack(n,f)
STEP 75: stack(n,u)
STEP 76: unstack(f,q)
STEP 77: stack(f,n)
STEP 78: unstack(f,n)
STEP 79: stack(f,n)
STEP 80: unstack(f,n)
STEP 81: stack(f,n)
STEP 82: unstack(f,n)
STEP 83: stack(f,n)
STEP 84: unstack(f,n)
STEP 85: stack(f,q)
STEP 86: unstack(n,u)
STEP 87: put-down(n)
STEP 88: unstack(u,p)
STEP 89: stack(u,p)
STEP 90: pick-up(n)
STEP 91: stack(n,u)
STEP 92: unstack(f,q)
STEP 93: stack(f,n)
STEP 94: unstack(f,n)
STEP 95: stack(f,q)
STEP 96: unstack(n,u)
STEP 97: stack(n,f)
STEP 98: unstack(u,p)
STEP 99: put-down(u)
STEP 100: unstack(n,f)
STEP 101: stack(n,u)
STEP 102: unstack(f,q)
STEP 103: stack(f,n)
STEP 104: unstack(p,g)
STEP 105: stack(p,f)
STEP 106: unstack(q,o)
STEP 107: put-down(q)
STEP 108: unstack(o,a)
STEP 109: stack(o,p)
STEP 110: pick-up(q)
STEP 111: stack(q,o)
STEP 112: unstack(g,r)
STEP 113: stack(g,i)
STEP 114: unstack(r,l)
STEP 115: stack(r,q)
STEP 116: unstack(l,m)
STEP 117: put-down(l)
STEP 118: unstack(m,v)
STEP 119: stack(m,r)
STEP 120: unstack(v,b)
STEP 121: put-down(v)
STEP 122: unstack(b,s)
STEP 123: put-down(b)
STEP 124: pick-up(a)
STEP 125: stack(a,s)
STEP 126: unstack(a,s)
STEP 127: stack(a,l)
STEP 128: unstack(s,j)
STEP 129: stack(s,m)
STEP 130: unstack(a,l)
STEP 131: stack(a,s)
STEP 132: unstack(a,s)
STEP 133: stack(a,l)
STEP 134: unstack(j,t)
STEP 135: stack(j,b)
STEP 136: unstack(t,d)
STEP 137: stack(t,j)
STEP 138: unstack(s,m)
STEP 139: stack(s,t)
STEP 140: unstack(d,h)
STEP 141: stack(d,m)
STEP 142: unstack(s,t)
STEP 143: stack(s,d)
STEP 144: unstack(a,l)
STEP 145: stack(a,s)
STEP 146: unstack(h,c)
STEP 147: stack(h,a)
STEP 148: unstack(c,e)
STEP 149: stack(c,t)
STEP 150: pick-up(v)
STEP 151: put-down(v)
STEP 152: unstack(e,k)
STEP 153: stack(e,l)
STEP 154: pick-up(k)
STEP 155: stack(k,h)
STEP 156: pick-up(v)
STEP 157: stack(v,k)
STEP 158: unstack(c,t)
STEP 159: stack(c,t)
STEP 160: unstack(c,t)
STEP 161: stack(c,t)
STEP 162: unstack(c,t)
STEP 163: stack(c,e)
STEP 164: unstack(t,j)
STEP 165: put-down(t)
STEP 166: unstack(j,b)
STEP 167: stack(j,v)
STEP 168: pick-up(b)
STEP 169: stack(b,j)
STEP 170: unstack(g,i)
STEP 171: stack(g,b)
STEP 172: pick-up(i)
STEP 173: stack(i,t)
STEP 174: unstack(c,e)
STEP 175: put-down(c)
STEP 176: unstack(e,l)
STEP 177: stack(e,g)
STEP 178: unstack(i,t)
STEP 179: stack(i,e)
STEP 180: pick-up(l)
STEP 181: stack(l,i)
STEP 182: pick-up(t)
STEP 183: stack(t,l)
STEP 184: pick-up(c)
STEP 185: stack(c,t)
186 actions in the plan.
total time 6.83 preprocess 0.21
total size 3.015 GB
max. learned clause length 4965
t val conflicts decisions
5 0 0 0
7 0 0 0
10 0 0 0
14 0 0 0
20 0 0 0
28 0 20 22
40 -1 964 1564
56 -1 903 1680
80 -1 842 1885
113 -1 780 2091
160 -1 720 1985
226 1 652 1782