Add benchmark result [m-mp | ipc-2006 | tpp-propositional | 12]
This commit is contained in:
56
m-mp/ipc-2006_tpp-propositional_12.out
Normal file
56
m-mp/ipc-2006_tpp-propositional_12.out
Normal file
@@ -0,0 +1,56 @@
|
||||
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-12.pddlignoring --stats
|
||||
ignoring --verbose
|
||||
-m 8192
|
||||
Domain: tpp-propositional
|
||||
Problem: tpp
|
||||
Parser: 1536 ground actions and 306 state variables
|
||||
Invariants: 0 1 2 3 4 5 0.01 secs
|
||||
Goal: conjunctive
|
||||
Simplified: 813 ground actions and 202 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: 202 variables
|
||||
0 UNSAT (0 decisions 0 conflicts)
|
||||
Horizon 5: 8382 variables
|
||||
5 UNSAT (0 decisions 0 conflicts)
|
||||
Horizon 10: 16562 variables
|
||||
Allocated 32 MB (total 389 MB)
|
||||
Horizon 15: 24742 variables
|
||||
Horizon 20: 32922 variables
|
||||
10 UNSAT (186 decisions 146 conflicts)
|
||||
SAT (292 decisions 72 conflicts)
|
||||
PLAN FOUND: 15 steps
|
||||
STEP 0: drive(truck1,depot2,market2) drive(truck2,depot2,market2) drive(truck3,depot1,market2)
|
||||
STEP 1: buy(truck2,goods2,market2,level0,level1,level0,level1) buy(truck2,goods4,market2,level0,level1,level0,level1) drive(truck1,market2,market3)
|
||||
STEP 2.0: buy(truck1,goods2,market3,level0,level1,level0,level1) buy(truck1,goods7,market3,level1,level2,level0,level1) load(goods2,truck3,market2,level0,level1,level0,level1) load(goods4,truck2,market2,level0,level1,level0,level1)
|
||||
STEP 2.1: drive(truck1,market3,market1) drive(truck2,market2,depot1) drive(truck3,market2,depot1)
|
||||
STEP 3.0: buy(truck1,goods1,market1,level2,level3,level0,level1) buy(truck1,goods2,market1,level0,level1,level0,level1) buy(truck1,goods3,market1,level2,level3,level0,level1) buy(truck1,goods4,market1,level1,level2,level0,level1) buy(truck1,goods5,market1,level1,level2,level0,level1) buy(truck1,goods6,market1,level2,level3,level0,level1) buy(truck1,goods7,market1,level0,level1,level0,level1) unload(goods2,truck3,depot1,level0,level1,level0,level1) unload(goods4,truck2,depot1,level0,level1,level0,level1)
|
||||
STEP 3.1: drive(truck2,depot1,market2) drive(truck3,depot1,market2)
|
||||
STEP 4.0: buy(truck1,goods3,market1,level1,level2,level1,level2) drive(truck2,market2,market3) drive(truck3,market2,market3) load(goods1,truck1,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) load(goods7,truck1,market1,level0,level1,level0,level1)
|
||||
STEP 4.1: drive(truck1,market1,market3)
|
||||
STEP 5.0: drive(truck2,market3,market1) load(goods2,truck1,market3,level0,level1,level1,level2) load(goods7,truck3,market3,level0,level1,level0,level1)
|
||||
STEP 5.1: drive(truck1,market3,market2) drive(truck3,market3,market1)
|
||||
STEP 6: buy(truck2,goods1,market1,level1,level2,level0,level1) buy(truck2,goods4,market1,level0,level1,level0,level1) buy(truck3,goods5,market1,level0,level1,level0,level1) drive(truck1,market2,depot2) load(goods3,truck2,market1,level1,level2,level0,level1)
|
||||
STEP 7.0: load(goods1,truck3,market1,level0,level1,level0,level1) load(goods3,truck2,market1,level0,level1,level1,level2) load(goods4,truck3,market1,level0,level1,level0,level1) load(goods5,truck3,market1,level0,level1,level0,level1) unload(goods1,truck1,depot2,level0,level1,level0,level1) unload(goods2,truck1,depot2,level1,level2,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) unload(goods7,truck1,depot2,level0,level1,level0,level1)
|
||||
STEP 7.1: drive(truck1,depot2,market2) drive(truck3,market1,market3)
|
||||
STEP 8: buy(truck2,goods1,market1,level0,level1,level0,level1) buy(truck2,goods3,market1,level0,level1,level0,level1) drive(truck1,market2,market3) drive(truck3,market3,market2)
|
||||
STEP 9.0: drive(truck1,market3,market1) drive(truck3,market2,depot1) load(goods1,truck2,market1,level0,level1,level0,level1)
|
||||
STEP 9.1: drive(truck2,market1,market3)
|
||||
STEP 10.0: drive(truck2,market3,market2) load(goods3,truck1,market1,level0,level1,level0,level1) unload(goods1,truck3,depot1,level0,level1,level1,level2) unload(goods4,truck3,depot1,level0,level1,level2,level3) unload(goods5,truck3,depot1,level0,level1,level1,level2) unload(goods7,truck3,depot1,level0,level1,level1,level2)
|
||||
STEP 10.1: drive(truck1,market1,market3)
|
||||
STEP 11: drive(truck1,market3,market2) drive(truck2,market2,depot2)
|
||||
STEP 12: drive(truck1,market2,depot1) unload(goods1,truck2,depot2,level0,level1,level2,level3) unload(goods3,truck2,depot2,level1,level2,level0,level1)
|
||||
STEP 13: unload(goods3,truck1,depot1,level0,level1,level1,level2)
|
||||
77 actions in the plan.
|
||||
total time 0.05 preprocess 0.01
|
||||
total size 623.000 MB
|
||||
max. learned clause length 113
|
||||
t val conflicts decisions
|
||||
0 0 0 0
|
||||
5 0 0 0
|
||||
10 0 146 186
|
||||
15 1 72 292
|
||||
|
||||
Reference in New Issue
Block a user