49 lines
3.6 KiB
Plaintext
49 lines
3.6 KiB
Plaintext
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-8.pddlignoring --stats
|
|
ignoring --verbose
|
|
-m 8192
|
|
Domain: tpp-propositional
|
|
Problem: tpp
|
|
Parser: 328 ground actions and 180 state variables
|
|
Invariants: 0 1 2 3 4 0.00 secs
|
|
Goal: conjunctive
|
|
Simplified: 184 ground actions and 129 state variables
|
|
Actions: STRIPS
|
|
Disabling graph %: 10 20 30 40 50 60 70 80 90 100 0.00 secs (max SCC size 4)
|
|
Plan type: E-step
|
|
Allocated 32 MB permanent (total 122 MB)
|
|
Horizon 0: 129 variables
|
|
0 UNSAT (0 decisions 0 conflicts)
|
|
Horizon 5: 1694 variables
|
|
5 UNSAT (0 decisions 0 conflicts)
|
|
Horizon 10: 3259 variables
|
|
Allocated 32 MB (total 384 MB)
|
|
SAT (69 decisions 11 conflicts)
|
|
PLAN FOUND: 10 steps
|
|
STEP 0: drive(truck1,depot1,market2) drive(truck2,depot1,market2)
|
|
STEP 1.0: buy(truck2,goods3,market2,level0,level1,level0,level1) drive(truck1,market2,market1)
|
|
STEP 1.1: drive(truck2,market2,market1)
|
|
STEP 2.0: buy(truck1,goods2,market1,level1,level2,level0,level1) buy(truck1,goods4,market1,level1,level2,level0,level1) buy(truck1,goods6,market1,level1,level2,level0,level1) buy(truck2,goods1,market1,level0,level1,level0,level1) buy(truck2,goods5,market1,level1,level2,level0,level1) buy(truck2,goods7,market1,level1,level2,level0,level1) buy(truck2,goods8,market1,level1,level2,level0,level1)
|
|
STEP 2.1: drive(truck2,market1,market2)
|
|
STEP 3.0: buy(truck1,goods2,market1,level0,level1,level1,level2) buy(truck1,goods7,market1,level0,level1,level1,level2) load(goods1,truck1,market1,level0,level1,level0,level1) load(goods3,truck2,market2,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(goods8,truck1,market1,level0,level1,level0,level1)
|
|
STEP 3.1: drive(truck1,market1,market2) drive(truck2,market2,depot1)
|
|
STEP 4.0: drive(truck1,market2,depot1) unload(goods3,truck2,depot1,level0,level1,level0,level1)
|
|
STEP 4.1: drive(truck2,depot1,market2)
|
|
STEP 5.0: drive(truck2,market2,market1) unload(goods1,truck1,depot1,level0,level1,level0,level1) unload(goods4,truck1,depot1,level0,level1,level0,level1) unload(goods5,truck1,depot1,level0,level1,level0,level1) unload(goods6,truck1,depot1,level0,level1,level0,level1) unload(goods8,truck1,depot1,level0,level1,level0,level1)
|
|
STEP 5.1: drive(truck1,depot1,market2)
|
|
STEP 6.0: buy(truck2,goods4,market1,level0,level1,level0,level1) buy(truck2,goods5,market1,level0,level1,level0,level1) drive(truck1,market2,market1) load(goods2,truck2,market1,level1,level2,level0,level1) load(goods7,truck2,market1,level1,level2,level0,level1)
|
|
STEP 6.1: drive(truck2,market1,market2)
|
|
STEP 7.0: drive(truck2,market2,depot1) 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(goods7,truck1,market1,level0,level1,level0,level1)
|
|
STEP 7.1: drive(truck1,market1,market2)
|
|
STEP 8: drive(truck1,market2,depot1) unload(goods2,truck2,depot1,level0,level1,level0,level1) unload(goods7,truck2,depot1,level0,level1,level0,level1)
|
|
STEP 9: unload(goods2,truck1,depot1,level0,level1,level1,level2) unload(goods4,truck1,depot1,level0,level1,level1,level2) unload(goods5,truck1,depot1,level0,level1,level1,level2) unload(goods7,truck1,depot1,level0,level1,level1,level2)
|
|
52 actions in the plan.
|
|
total time 0.00 preprocess 0.00
|
|
total size 458.000 MB
|
|
max. learned clause length 41
|
|
t val conflicts decisions
|
|
0 0 0 0
|
|
5 0 0 0
|
|
10 1 11 69
|
|
|