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

Add benchmark result [m-mp | ipc-2006 | tpp-propositional | 9]

Browse Source
This commit is contained in:
Potassco Bot
2017-12-02 09:20:34 +01:00
parent 3037edb2d0
commit e75d457836
3 changed files with 100 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

52
m-mp/ipc-2006_tpp-propositional_9.out Normal file
View File

@@ -0,0 +1,52 @@
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-9.pddlignoring --stats
ignoring --verbose
-m 8192
Domain: tpp-propositional
Problem: tpp
Parser: 774 ground actions and 290 state variables
Invariants: 0 1 2 3 4 5 0.00 secs
Goal: conjunctive
Simplified: 324 ground actions and 184 state variables
Actions: STRIPS
Disabling graph %: 10 20 30 40 50 60 70 80 90 100 0.00 secs (max SCC size 6)
Plan type: E-step
Allocated 32 MB permanent (total 123 MB)
Horizon 0: 184 variables
0 UNSAT (0 decisions 0 conflicts)
Horizon 5: 2724 variables
5 UNSAT (0 decisions 0 conflicts)
Horizon 10: 5264 variables
Allocated 32 MB (total 385 MB)
Horizon 15: 7804 variables
SAT (133 decisions 22 conflicts)
PLAN FOUND: 15 steps
STEP 0: drive(truck1,depot1,market2) drive(truck2,depot1,market2) drive(truck3,depot1,market2)
STEP 1: buy(truck1,goods1,market2,level0,level1,level0,level1) buy(truck1,goods2,market2,level1,level2,level0,level1) buy(truck1,goods9,market2,level0,level1,level0,level1) buy(truck2,goods3,market2,level0,level1,level0,level1) buy(truck2,goods4,market2,level0,level1,level0,level1) buy(truck2,goods6,market2,level0,level1,level0,level1) buy(truck2,goods8,market2,level1,level2,level0,level1)
STEP 2.0: load(goods1,truck2,market2,level0,level1,level0,level1) load(goods2,truck3,market2,level0,level1,level0,level1) load(goods3,truck2,market2,level0,level1,level0,level1) load(goods4,truck2,market2,level0,level1,level0,level1) load(goods6,truck3,market2,level0,level1,level0,level1) load(goods8,truck3,market2,level0,level1,level0,level1) load(goods9,truck2,market2,level0,level1,level0,level1)
STEP 2.1: drive(truck2,market2,depot1) drive(truck3,market2,depot1)
STEP 3.0: buy(truck1,goods2,market2,level0,level1,level0,level1) buy(truck1,goods8,market2,level0,level1,level0,level1) unload(goods1,truck2,depot1,level0,level1,level0,level1) unload(goods2,truck3,depot1,level0,level1,level0,level1) unload(goods3,truck2,depot1,level0,level1,level0,level1) unload(goods4,truck2,depot1,level0,level1,level0,level1) unload(goods6,truck3,depot1,level0,level1,level0,level1) unload(goods8,truck3,depot1,level0,level1,level0,level1) unload(goods9,truck2,depot1,level0,level1,level0,level1)
STEP 3.1: drive(truck1,market2,market3) drive(truck2,depot1,market2) drive(truck3,depot1,market2)
STEP 4.0: drive(truck1,market3,market1) drive(truck2,market2,market3) load(goods2,truck3,market2,level0,level1,level0,level1) load(goods8,truck3,market2,level0,level1,level0,level1)
STEP 4.1: drive(truck3,market2,depot1)
STEP 5.0: buy(truck1,goods3,market1,level0,level1,level0,level1) buy(truck1,goods4,market1,level0,level1,level0,level1) buy(truck1,goods5,market1,level1,level2,level0,level1) buy(truck1,goods7,market1,level1,level2,level0,level1) drive(truck2,market3,market1) unload(goods2,truck3,depot1,level0,level1,level1,level2) unload(goods8,truck3,depot1,level0,level1,level1,level2)
STEP 5.1: drive(truck3,depot1,market2)
STEP 6.0: drive(truck3,market2,market3) load(goods3,truck2,market1,level0,level1,level0,level1) load(goods4,truck1,market1,level0,level1,level0,level1) load(goods5,truck2,market1,level0,level1,level0,level1) load(goods7,truck1,market1,level0,level1,level0,level1)
STEP 6.1: drive(truck1,market1,market3) drive(truck2,market1,market3)
STEP 7: drive(truck1,market3,market2) drive(truck2,market3,market2) drive(truck3,market3,market1)
STEP 8: buy(truck3,goods5,market1,level0,level1,level0,level1) drive(truck1,market2,depot1) drive(truck2,market2,depot1)
STEP 9.0: load(goods5,truck3,market1,level0,level1,level0,level1) unload(goods3,truck2,depot1,level0,level1,level1,level2) unload(goods4,truck1,depot1,level0,level1,level1,level2) unload(goods5,truck2,depot1,level0,level1,level0,level1) unload(goods7,truck1,depot1,level0,level1,level0,level1)
STEP 9.1: drive(truck3,market1,market3)
STEP 10: drive(truck3,market3,market2)
STEP 11: drive(truck3,market2,depot1)
STEP 12: unload(goods5,truck3,depot1,level0,level1,level1,level2)
66 actions in the plan.
total time 0.02 preprocess 0.00
total size 537.000 MB
max. learned clause length 186
t val conflicts decisions
0 0 0 0
5 0 0 0
10 -1 121 353
15 1 22 133