1
0
Fork 0

Add benchmark result [m-mp | ipc-2011 | no-mystery-sequential-satisficing | 3]

This commit is contained in:
Potassco Bot 2017-12-03 02:40:04 +01:00
parent 9529d3cf72
commit 3fceba8df2
Signed by: potassco-bot
GPG Key ID: 1F54208CE70DDF73
3 changed files with 106 additions and 0 deletions

View File

@ -0,0 +1,39 @@
command:
- timeout
- -m=9216000
- -t=900
- python3
- /home/pluehne/Documents/ASP/plasp-javier/encodings/planner/runplanner.py
- --domain=/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-sequential-satisficing/domain.pddl
- /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-sequential-satisficing/instances/instance-3.pddl
- --stats
- --verbose
- --print-call
- -m 8192
- --madagascar-Mp
configuration:
id: m-mp
instanceSets:
- lpnmr-easy-instances
- lpnmr-hard-instances
- lpnmr-first-plan-not-serializable
- rintanen-aij-2012
options:
- --stats
- --verbose
- --print-call
- -m 8192
- --madagascar-Mp
exitCode: 0
instance:
domain: no-mystery-sequential-satisficing
instance: 3
ipc: ipc-2011
versions:
clingo: 5.2.2
fastDownward: 10997:847cdf0069cab0c8841a9958e783d1a7340fe2e9 (2017-11-02 15:10 +0100)
planner: 398fcb36ad9c5a23a8c35820fb4b021802dbc349 (2017-11-30 17:03:27 +0100)
plasp: 3.1.1
python: 3.6.3
workingDirectory: /home/pluehne/Documents/ASP/plasp-javier/encodings/planner

View File

@ -0,0 +1,10 @@
# configuration: {'id': 'm-mp', 'options': ['--stats', '--verbose', '--print-call', '-m 8192', '--madagascar-Mp'], 'instanceSets': ['lpnmr-easy-instances', 'lpnmr-hard-instances', 'lpnmr-first-plan-not-serializable', 'rintanen-aij-2012']}
# instance: {'ipc': 'ipc-2011', 'domain': 'no-mystery-sequential-satisficing', 'instance': 3}
# command: ['timeout', '-m=9216000', '-t=900', 'python3', '/home/pluehne/Documents/ASP/plasp-javier/encodings/planner/runplanner.py', '--domain=/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-sequential-satisficing/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-sequential-satisficing/instances/instance-3.pddl', '--stats', '--verbose', '--print-call', '-m 8192', '--madagascar-Mp']
# working directory: /home/pluehne/Documents/ASP/plasp-javier/encodings/planner
# exit code: 0
WARNING: will ignore action costs
# planner call: Mp /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-sequential-satisficing/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-sequential-satisficing/instances/instance-3.pddl --stats --verbose -m 8192
FINISHED CPU 68.48 MEM 33472 MAXMEM 416076 STALE 1 MAXMEM_RSS 118808
<time name="ALL">68410</time>

View File

@ -0,0 +1,57 @@
Madagascar 0.99999 25/02/2015 09:46:27 amd64 1-core (no VSIDS)
Options: file:/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-sequential-satisficing/domain.pddl file:/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-sequential-satisficing/instances/instance-3.pddlignoring --stats
ignoring --verbose
-m 8192
Domain: transport-strips
Problem: transport-l8-t1-p8---int100n150-m25---int100c150---s1---e0
Parser: 4110 ground actions and 16780 state variables
Invariants: 0 1 2 3 4 5 6 0.22 secs
Goal: conjunctive
Simplified: 3736 ground actions and 252 state variables
Actions: STRIPS
Disabling graph %: 10 20 30 40 50 60 70 80 90 100 0.15 secs (max SCC size 1)
Plan type: E-step
Allocated 32 MB permanent (total 160 MB)
Horizon 0: 252 variables
0 UNSAT (0 decisions 0 conflicts)
Horizon 5: 20192 variables
Allocated 32 MB (total 349 MB)
5 UNSAT (3 decisions 3 conflicts)
Horizon 10: 40132 variables
Horizon 15: 60072 variables
SAT (35 decisions 3 conflicts)
PLAN FOUND: 15 steps
STEP 0: drive(t0,l2,l4,level168,level12,level180)
STEP 1.0: load(p0,t0,l4) load(p2,t0,l4)
STEP 1.1: drive(t0,l4,l1,level155,level13,level168)
STEP 2.0: load(p1,t0,l1) load(p5,t0,l1) load(p7,t0,l1) unload(p0,t0,l1)
STEP 2.1: drive(t0,l1,l6,level152,level3,level155)
STEP 3.0: load(p4,t0,l6) unload(p7,t0,l6)
STEP 3.1: drive(t0,l6,l5,level134,level18,level152)
STEP 4.0: unload(p1,t0,l5)
STEP 4.1: drive(t0,l5,l7,level124,level10,level134)
STEP 5.0: load(p6,t0,l7) unload(p2,t0,l7)
STEP 5.1: drive(t0,l7,l2,level106,level18,level124)
STEP 6: drive(t0,l2,l3,level90,level16,level106)
STEP 7: drive(t0,l3,l6,level74,level16,level90)
STEP 8.0: unload(p6,t0,l6)
STEP 8.1: drive(t0,l6,l1,level71,level3,level74)
STEP 9.0: unload(p4,t0,l1)
STEP 9.1: drive(t0,l1,l4,level58,level13,level71)
STEP 10.0: unload(p5,t0,l4)
STEP 10.1: drive(t0,l4,l3,level37,level21,level58)
STEP 11: drive(t0,l3,l0,level19,level18,level37)
STEP 12.0: load(p3,t0,l0)
STEP 12.1: drive(t0,l0,l1,level7,level12,level19)
STEP 13: unload(p3,t0,l1)
29 actions in the plan.
Cost of the plan is 29.
total time 68.16 preprocess 67.89
total size 637.000 MB
max. learned clause length 5581
t val conflicts decisions
0 0 0 0
5 0 3 3
10 -1 120 175
15 1 3 35