Add benchmark result [m-mp | ipc-2006 | tpp-propositional | 11]
This commit is contained in:
parent
84f536d884
commit
ebe27afce6
GPG Key ID:
1F54208CE70DDF73
39
m-mp/ipc-2006_tpp-propositional_11.env
Normal file
39
m-mp/ipc-2006_tpp-propositional_11.env
Normal 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-2006/domains/tpp-propositional/domain.pddl
|
||||
- /home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/tpp-propositional/instances/instance-11.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: tpp-propositional
|
||||
instance: 11
|
||||
ipc: ipc-2006
|
||||
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
|
||||
|
||||
9
m-mp/ipc-2006_tpp-propositional_11.err
Normal file
9
m-mp/ipc-2006_tpp-propositional_11.err
Normal file
@ -0,0 +1,9 @@
|
||||
# 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-2006', 'domain': 'tpp-propositional', 'instance': 11}
|
||||
# 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-2006/domains/tpp-propositional/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/tpp-propositional/instances/instance-11.pddl', '--stats', '--verbose', '--print-call', '-m 8192', '--madagascar-Mp']
|
||||
# working directory: /home/pluehne/Documents/ASP/plasp-javier/encodings/planner
|
||||
# exit code: 0
|
||||
# planner call: Mp /home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/tpp-propositional/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/tpp-propositional/instances/instance-11.pddl --stats --verbose -m 8192
|
||||
FINISHED CPU 0.38 MEM 33472 MAXMEM 33728 STALE 0 MAXMEM_RSS 13304
|
||||
<time name="ALL">320</time>
|
||||
|
||||
60
m-mp/ipc-2006_tpp-propositional_11.out
Normal file
60
m-mp/ipc-2006_tpp-propositional_11.out
Normal file
@ -0,0 +1,60 @@
|
||||
Madagascar 0.99999 25/02/2015 09:46:27 amd64 1-core (no VSIDS)
|
||||
Options: file:/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/tpp-propositional/domain.pddl file:/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/tpp-propositional/instances/instance-11.pddlignoring --stats
|
||||
ignoring --verbose
|
||||
-m 8192
|
||||
Domain: tpp-propositional
|
||||
Problem: tpp
|
||||
Parser: 1320 ground actions and 266 state variables
|
||||
Invariants: 0 1 2 3 4 5 0.00 secs
|
||||
Goal: conjunctive
|
||||
Simplified: 690 ground actions and 173 state variables
|
||||
Actions: STRIPS
|
||||
Disabling graph %: 10 20 30 40 50 60 70 80 90 100 0.00 secs (max SCC size 18)
|
||||
Plan type: E-step
|
||||
Allocated 32 MB permanent (total 126 MB)
|
||||
Horizon 0: 173 variables
|
||||
0 UNSAT (0 decisions 0 conflicts)
|
||||
Horizon 5: 7098 variables
|
||||
5 UNSAT (0 decisions 0 conflicts)
|
||||
Horizon 10: 14023 variables
|
||||
Allocated 32 MB (total 388 MB)
|
||||
Horizon 15: 20948 variables
|
||||
Horizon 20: 27873 variables
|
||||
10 UNSAT (186 decisions 126 conflicts)
|
||||
SAT (145 decisions 24 conflicts)
|
||||
PLAN FOUND: 20 steps
|
||||
STEP 0: drive(truck1,depot2,market2) drive(truck2,depot1,market2) drive(truck3,depot1,market2)
|
||||
STEP 1.0: buy(truck1,goods2,market2,level0,level1,level0,level1) buy(truck1,goods4,market2,level0,level1,level0,level1) drive(truck3,market2,market3)
|
||||
STEP 1.1: drive(truck1,market2,market3)
|
||||
STEP 2.0: buy(truck3,goods2,market3,level0,level1,level0,level1) drive(truck1,market3,market1) load(goods2,truck2,market2,level0,level1,level0,level1) load(goods4,truck2,market2,level0,level1,level0,level1)
|
||||
STEP 2.1: drive(truck2,market2,depot1) drive(truck3,market3,market1)
|
||||
STEP 3.0: buy(truck1,goods2,market1,level0,level1,level0,level1) buy(truck1,goods3,market1,level2,level3,level0,level1) buy(truck1,goods5,market1,level1,level2,level0,level1) buy(truck1,goods6,market1,level2,level3,level0,level1) buy(truck3,goods1,market1,level2,level3,level0,level1) buy(truck3,goods4,market1,level1,level2,level0,level1) unload(goods2,truck2,depot1,level0,level1,level0,level1) unload(goods4,truck2,depot1,level0,level1,level0,level1)
|
||||
STEP 3.1: drive(truck2,depot1,market2)
|
||||
STEP 4.0: buy(truck1,goods3,market1,level1,level2,level1,level2) drive(truck2,market2,market3) load(goods1,truck3,market1,level0,level1,level0,level1) load(goods2,truck1,market1,level0,level1,level0,level1) load(goods4,truck1,market1,level0,level1,level0,level1) load(goods5,truck1,market1,level0,level1,level0,level1) load(goods6,truck1,market1,level0,level1,level0,level1)
|
||||
STEP 4.1: drive(truck1,market1,market3)
|
||||
STEP 5.0: buy(truck3,goods1,market1,level1,level2,level0,level1) buy(truck3,goods4,market1,level0,level1,level0,level1) buy(truck3,goods5,market1,level0,level1,level0,level1) drive(truck1,market3,market2) load(goods2,truck2,market3,level0,level1,level0,level1) load(goods3,truck3,market1,level1,level2,level0,level1)
|
||||
STEP 5.1: drive(truck2,market3,market1) drive(truck3,market1,market3)
|
||||
STEP 6.0: drive(truck1,market2,depot2) drive(truck3,market3,market2) load(goods1,truck2,market1,level0,level1,level0,level1) load(goods3,truck2,market1,level0,level1,level0,level1) load(goods4,truck2,market1,level0,level1,level0,level1) load(goods5,truck2,market1,level0,level1,level0,level1)
|
||||
STEP 6.1: drive(truck2,market1,market3)
|
||||
STEP 7.0: drive(truck2,market3,market2) drive(truck3,market2,depot2) unload(goods2,truck1,depot2,level0,level1,level1,level2) unload(goods4,truck1,depot2,level0,level1,level1,level2) unload(goods5,truck1,depot2,level0,level1,level0,level1) unload(goods6,truck1,depot2,level0,level1,level0,level1)
|
||||
STEP 7.1: drive(truck1,depot2,market2)
|
||||
STEP 8.0: drive(truck1,market2,market3) drive(truck2,market2,depot2) unload(goods1,truck3,depot2,level0,level1,level0,level1) unload(goods3,truck3,depot2,level0,level1,level0,level1)
|
||||
STEP 8.1: drive(truck3,depot2,market2)
|
||||
STEP 9: drive(truck1,market3,market1) drive(truck3,market2,market3) unload(goods1,truck2,depot2,level0,level1,level1,level2) unload(goods2,truck2,depot2,level0,level1,level2,level3) unload(goods3,truck2,depot2,level0,level1,level1,level2) unload(goods4,truck2,depot2,level0,level1,level2,level3) unload(goods5,truck2,depot2,level0,level1,level1,level2)
|
||||
STEP 10: buy(truck1,goods1,market1,level0,level1,level0,level1) buy(truck1,goods3,market1,level0,level1,level0,level1) drive(truck3,market3,market1)
|
||||
STEP 11.0: load(goods1,truck1,market1,level0,level1,level0,level1) load(goods3,truck3,market1,level0,level1,level0,level1)
|
||||
STEP 11.1: drive(truck1,market1,market3) drive(truck3,market1,market3)
|
||||
STEP 12: drive(truck1,market3,market2) drive(truck3,market3,market2)
|
||||
STEP 13: drive(truck1,market2,depot1) drive(truck3,market2,depot2)
|
||||
STEP 14: unload(goods1,truck1,depot1,level0,level1,level2,level3) unload(goods3,truck3,depot2,level0,level1,level2,level3)
|
||||
77 actions in the plan.
|
||||
total time 0.06 preprocess 0.00
|
||||
total size 621.000 MB
|
||||
max. learned clause length 261
|
||||
t val conflicts decisions
|
||||
0 0 0 0
|
||||
5 0 0 0
|
||||
10 0 126 186
|
||||
15 -1 120 419
|
||||
20 1 24 145
|
||||
|
||||
Loading…
Reference in New Issue
Block a user