tplp-planning-benchmark/m-mp/ipc-2006_tpp-propositional_13.out

47 lines
4.0 KiB
Plaintext
Raw Normal View History

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