Add benchmark result [m-mp | ipc-2006 | tpp-propositional | 13]
This commit is contained in:
parent
62ea285bf6
commit
77d451b3b4
39
m-mp/ipc-2006_tpp-propositional_13.env
Normal file
39
m-mp/ipc-2006_tpp-propositional_13.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-13.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: 13
|
||||
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_13.err
Normal file
9
m-mp/ipc-2006_tpp-propositional_13.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': 13}
|
||||
# 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-13.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-13.pddl --stats --verbose -m 8192
|
||||
FINISHED CPU 0.41 MEM 33472 MAXMEM 220068 STALE 0 MAXMEM_RSS 38456
|
||||
<time name="ALL">340</time>
|
||||
|
46
m-mp/ipc-2006_tpp-propositional_13.out
Normal file
46
m-mp/ipc-2006_tpp-propositional_13.out
Normal file
@ -0,0 +1,46 @@
|
||||
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-13.pddlignoring --stats
|
||||
ignoring --verbose
|
||||
-m 8192
|
||||
Domain: tpp-propositional
|
||||
Problem: tpp
|
||||
Parser: 2936 ground actions and 457 state variables
|
||||
Invariants: 0 1 2 3 4 5 0.01 secs
|
||||
Goal: conjunctive
|
||||
Simplified: 1356 ground actions and 287 state variables
|
||||
Actions: STRIPS
|
||||
Disabling graph %: 10 20 30 40 50 60 70 80 90 100 0.00 secs (max SCC size 24)
|
||||
Plan type: E-step
|
||||
Allocated 32 MB permanent (total 130 MB)
|
||||
Horizon 0: 287 variables
|
||||
0 UNSAT (0 decisions 0 conflicts)
|
||||
Horizon 5: 13902 variables
|
||||
5 UNSAT (0 decisions 0 conflicts)
|
||||
Horizon 10: 27517 variables
|
||||
Allocated 32 MB (total 394 MB)
|
||||
SAT (153 decisions 15 conflicts)
|
||||
PLAN FOUND: 10 steps
|
||||
STEP 0: drive(truck1,depot1,market1) drive(truck2,depot1,market1) drive(truck3,depot2,market2) drive(truck4,depot2,market2)
|
||||
STEP 1.0: buy(truck2,goods3,market1,level0,level1,level0,level1) buy(truck2,goods5,market1,level0,level1,level0,level1) buy(truck3,goods2,market2,level1,level2,level0,level1) buy(truck4,goods1,market2,level1,level2,level0,level1) buy(truck4,goods5,market2,level1,level2,level0,level1) buy(truck4,goods6,market2,level0,level1,level0,level1) buy(truck4,goods7,market2,level1,level2,level0,level1) drive(truck1,market1,market2)
|
||||
STEP 1.1: drive(truck2,market1,market4) drive(truck3,market2,market1) drive(truck4,market2,market4)
|
||||
STEP 2.0: buy(truck2,goods1,market4,level0,level1,level0,level1) buy(truck2,goods8,market4,level0,level1,level0,level1) buy(truck4,goods4,market4,level1,level2,level0,level1) load(goods1,truck1,market2,level0,level1,level0,level1) load(goods2,truck1,market2,level0,level1,level0,level1) load(goods3,truck3,market1,level0,level1,level0,level1) load(goods5,truck1,market2,level0,level1,level0,level1) load(goods5,truck3,market1,level0,level1,level0,level1) load(goods6,truck1,market2,level0,level1,level0,level1) load(goods7,truck1,market2,level0,level1,level0,level1)
|
||||
STEP 2.1: drive(truck1,market2,depot2) drive(truck3,market1,depot1) drive(truck4,market4,market2)
|
||||
STEP 3.0: buy(truck4,goods1,market2,level0,level1,level0,level1) buy(truck4,goods5,market2,level0,level1,level0,level1) load(goods1,truck2,market4,level0,level1,level0,level1) load(goods4,truck2,market4,level0,level1,level0,level1) load(goods8,truck2,market4,level0,level1,level0,level1) unload(goods1,truck1,depot2,level0,level1,level0,level1) unload(goods2,truck1,depot2,level0,level1,level0,level1) unload(goods3,truck3,depot1,level0,level1,level0,level1) unload(goods5,truck1,depot2,level0,level1,level0,level1) unload(goods6,truck1,depot2,level0,level1,level0,level1) unload(goods7,truck1,depot2,level0,level1,level0,level1)
|
||||
STEP 3.1: drive(truck1,depot2,market2) drive(truck2,market4,market2) drive(truck4,market2,market4)
|
||||
STEP 4.0: buy(truck4,goods4,market4,level0,level1,level0,level1) drive(truck1,market2,market4) load(goods1,truck2,market2,level0,level1,level1,level2) load(goods5,truck2,market2,level0,level1,level0,level1) unload(goods5,truck3,depot1,level0,level1,level1,level2)
|
||||
STEP 4.1: drive(truck2,market2,depot2) drive(truck4,market4,market3)
|
||||
STEP 5.0: buy(truck4,goods8,market3,level1,level2,level0,level1) load(goods4,truck1,market4,level0,level1,level0,level1) unload(goods1,truck2,depot2,level1,level2,level1,level2) unload(goods4,truck2,depot2,level0,level1,level0,level1) unload(goods5,truck2,depot2,level0,level1,level2,level3) unload(goods8,truck2,depot2,level0,level1,level0,level1)
|
||||
STEP 5.1: drive(truck1,market4,market2)
|
||||
STEP 6.0: drive(truck1,market2,depot2) load(goods8,truck4,market3,level0,level1,level0,level1)
|
||||
STEP 6.1: drive(truck4,market3,market2)
|
||||
STEP 7: drive(truck4,market2,depot2) unload(goods4,truck1,depot2,level0,level1,level1,level2)
|
||||
STEP 8: unload(goods8,truck4,depot2,level0,level1,level1,level2)
|
||||
62 actions in the plan.
|
||||
total time 0.06 preprocess 0.02
|
||||
total size 474.000 MB
|
||||
max. learned clause length 70
|
||||
t val conflicts decisions
|
||||
0 0 0 0
|
||||
5 0 0 0
|
||||
10 1 15 153
|
||||
|
Loading…
Reference in New Issue
Block a user