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-6.pddlignoring --stats
ignoring --verbose
 -m 8192
Domain: transport-strips
Problem: transport-l11-t1-p11---int100n150-m25---int100c150---s1---e0
Parser: 7082 ground actions and 26084 state variables
Invariants: 0 1 2 3 4 5 6 7 8  0.91 secs
Goal: conjunctive
Simplified: 6883 ground actions and 369 state variables
Actions: STRIPS
Disabling graph %: 10 20 30 40 50 60 70 80 90 100 0.58 secs (max SCC size 1)
Plan type: E-step
				Allocated 32 MB permanent (total 205 MB)
Horizon 0: 369 variables
0 UNSAT (0 decisions 0 conflicts)
Horizon 5: 36629 variables
5 UNSAT (0 decisions 0 conflicts)
Horizon 10: 72889 variables
				Allocated 32 MB (total 479 MB)
Horizon 15: 109149 variables
Horizon 20: 145409 variables
Horizon 25: 181669 variables
Horizon 30: 217929 variables
Horizon 35: 254189 variables
Horizon 40: 290449 variables
Horizon 45: 326709 variables
				Allocated 32 MB permanent (total 1233 MB)
Horizon 50: 362969 variables
10 UNSAT (586 decisions 507 conflicts)
SAT (769 decisions 397 conflicts)
PLAN FOUND: 20 steps
STEP 0: drive(t0,l1,l2,level215,level10,level225)
STEP 1.0: load(p2,t0,l2)
STEP 1.1: drive(t0,l2,l4,level207,level8,level215)
STEP 2.0: load(p0,t0,l4)
STEP 2.1: drive(t0,l4,l9,level192,level15,level207)
STEP 3.0: load(p5,t0,l9) load(p6,t0,l9) unload(p0,t0,l9)
STEP 3.1: drive(t0,l9,l10,level173,level19,level192)
STEP 4.0: unload(p2,t0,l10)
STEP 4.1: drive(t0,l10,l8,level171,level2,level173)
STEP 5.0: load(p10,t0,l8) load(p9,t0,l8) unload(p5,t0,l8)
STEP 5.1: drive(t0,l8,l10,level169,level2,level171)
STEP 6: drive(t0,l10,l0,level151,level18,level169)
STEP 7: drive(t0,l0,l4,level145,level6,level151)
STEP 8.0: unload(p6,t0,l4)
STEP 8.1: drive(t0,l4,l7,level144,level1,level145)
STEP 9.0: unload(p10,t0,l7)
STEP 9.1: drive(t0,l7,l3,level142,level2,level144)
STEP 10.0: load(p1,t0,l3) load(p3,t0,l3) unload(p9,t0,l3)
STEP 10.1: drive(t0,l3,l7,level140,level2,level142)
STEP 11.0: unload(p3,t0,l7)
STEP 11.1: drive(t0,l7,l4,level139,level1,level140)
STEP 12: drive(t0,l4,l2,level131,level8,level139)
STEP 13: drive(t0,l2,l5,level109,level22,level131)
STEP 14.0: load(p7,t0,l5) load(p8,t0,l5)
STEP 14.1: drive(t0,l5,l2,level87,level22,level109)
STEP 15: drive(t0,l2,l6,level68,level19,level87)
STEP 16.0: load(p4,t0,l6)
STEP 16.1: drive(t0,l6,l9,level55,level13,level68)
STEP 17.0: unload(p1,t0,l9) unload(p7,t0,l9) unload(p8,t0,l9)
STEP 17.1: drive(t0,l9,l10,level36,level19,level55)
STEP 18: drive(t0,l10,l8,level34,level2,level36)
STEP 19: unload(p4,t0,l8)
41 actions in the plan.
Cost of the plan is 41.
total time 231.23 preprocess 229.35 
total size 1.381 GB
max. learned clause length 36616
t val conflicts decisions
0 0 0 0
5 0 0 0
10 0 507 586
15 -1 481 716
20 1 397 769