69 lines
2.7 KiB
Plaintext
69 lines
2.7 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-2011/domains/no-mystery-sequential-satisficing/domain.pddl file:/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-sequential-satisficing/instances/instance-8.pddlignoring --stats
|
|
ignoring --verbose
|
|
-m 8192
|
|
Domain: transport-strips
|
|
Problem: transport-l13-t1-p13---int100n150-m25---int100c150---s1---e0
|
|
Parser: 6698 ground actions and 16560 state variables
|
|
Invariants: 0 1 2 3 4 5 6 7 0.67 secs
|
|
Goal: conjunctive
|
|
Simplified: 6536 ground actions and 374 state variables
|
|
Actions: STRIPS
|
|
Disabling graph %: 10 20 30 40 50 60 70 80 90 100 0.30 secs (max SCC size 1)
|
|
Plan type: E-step
|
|
Allocated 32 MB permanent (total 189 MB)
|
|
Horizon 0: 374 variables
|
|
0 UNSAT (0 decisions 0 conflicts)
|
|
Horizon 5: 34924 variables
|
|
5 UNSAT (0 decisions 0 conflicts)
|
|
Horizon 10: 69474 variables
|
|
Allocated 32 MB (total 461 MB)
|
|
Horizon 15: 104024 variables
|
|
Horizon 20: 138574 variables
|
|
Horizon 25: 173124 variables
|
|
Horizon 30: 207674 variables
|
|
Horizon 35: 242224 variables
|
|
10 UNSAT (460 decisions 360 conflicts)
|
|
SAT (375 decisions 133 conflicts)
|
|
PLAN FOUND: 25 steps
|
|
STEP 0: drive(t0,l9,l5,level160,level18,level178)
|
|
STEP 1.0: load(p1,t0,l5) load(p11,t0,l5) load(p12,t0,l5) load(p3,t0,l5) load(p6,t0,l5) load(p7,t0,l5)
|
|
STEP 1.1: drive(t0,l5,l0,level156,level4,level160)
|
|
STEP 2.0: unload(p12,t0,l0) unload(p3,t0,l0)
|
|
STEP 2.1: drive(t0,l0,l4,level142,level14,level156)
|
|
STEP 3.0: load(p5,t0,l4)
|
|
STEP 3.1: drive(t0,l4,l9,level139,level3,level142)
|
|
STEP 4.0: unload(p1,t0,l9) unload(p5,t0,l9)
|
|
STEP 4.1: drive(t0,l9,l4,level136,level3,level139)
|
|
STEP 5: drive(t0,l4,l12,level115,level21,level136)
|
|
STEP 6.0: load(p0,t0,l12) load(p2,t0,l12)
|
|
STEP 6.1: drive(t0,l12,l3,level109,level6,level115)
|
|
STEP 7.0: load(p10,t0,l3) load(p4,t0,l3) unload(p0,t0,l3)
|
|
STEP 7.1: drive(t0,l3,l6,level93,level16,level109)
|
|
STEP 8: drive(t0,l6,l11,level71,level22,level93)
|
|
STEP 9: drive(t0,l11,l1,level70,level1,level71)
|
|
STEP 10.0: unload(p11,t0,l1) unload(p6,t0,l1) unload(p7,t0,l1)
|
|
STEP 10.1: drive(t0,l1,l2,level60,level10,level70)
|
|
STEP 11.0: load(p8,t0,l2)
|
|
STEP 11.1: drive(t0,l2,l4,level46,level14,level60)
|
|
STEP 12.0: unload(p4,t0,l4)
|
|
STEP 12.1: drive(t0,l4,l0,level32,level14,level46)
|
|
STEP 13.0: unload(p2,t0,l0) unload(p8,t0,l0)
|
|
STEP 13.1: drive(t0,l0,l7,level31,level1,level32)
|
|
STEP 14.0: load(p9,t0,l7) unload(p10,t0,l7)
|
|
STEP 14.1: drive(t0,l7,l8,level13,level18,level31)
|
|
STEP 15: unload(p9,t0,l8)
|
|
41 actions in the plan.
|
|
Cost of the plan is 41.
|
|
total time 105.04 preprocess 104.18
|
|
total size 1.021 GB
|
|
max. learned clause length 30425
|
|
t val conflicts decisions
|
|
0 0 0 0
|
|
5 0 0 0
|
|
10 0 360 460
|
|
15 -1 301 543
|
|
20 -1 240 669
|
|
25 1 133 375
|
|
|