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-7.pddlignoring --stats
ignoring --verbose
 -m 8192
Domain: transport-strips
Problem: transport-l12-t1-p12---int100n150-m25---int100c150---s1---e0
Parser: 8986 ground actions and 32879 state variables
Invariants: 0 1 2 3 4 5 6 7 8 9  1.53 secs
Goal: conjunctive
Simplified: 8708 ground actions and 420 state variables
Actions: STRIPS
Disabling graph %: 10 20 30 40 50 60 70 80 90 100 0.97 secs (max SCC size 1)
Plan type: E-step
				Allocated 32 MB permanent (total 235 MB)
Horizon 0: 420 variables
0 UNSAT (0 decisions 0 conflicts)
Horizon 5: 46060 variables
5 UNSAT (0 decisions 0 conflicts)
Horizon 10: 91700 variables
				Allocated 32 MB (total 512 MB)
Horizon 15: 137340 variables
Horizon 20: 182980 variables
Horizon 25: 228620 variables
Horizon 30: 274260 variables
Horizon 35: 319900 variables
SAT (334 decisions 126 conflicts)
PLAN FOUND: 25 steps
STEP 0.0: load(p10,t0,l4)
STEP 0.1: drive(t0,l4,l2,level246,level7,level253)
STEP 1: drive(t0,l2,l9,level228,level18,level246)
STEP 2.0: load(p11,t0,l9) load(p5,t0,l9)
STEP 2.1: drive(t0,l9,l1,level220,level8,level228)
STEP 3.0: load(p2,t0,l1) load(p6,t0,l1)
STEP 3.1: drive(t0,l1,l9,level212,level8,level220)
STEP 4.0: unload(p2,t0,l9) unload(p6,t0,l9)
STEP 4.1: drive(t0,l9,l2,level194,level18,level212)
STEP 5: drive(t0,l2,l11,level189,level5,level194)
STEP 6.0: load(p4,t0,l11) load(p7,t0,l11) load(p8,t0,l11)
STEP 6.1: drive(t0,l11,l2,level184,level5,level189)
STEP 7: drive(t0,l2,l8,level168,level16,level184)
STEP 8.0: load(p0,t0,l8) load(p1,t0,l8)
STEP 8.1: drive(t0,l8,l2,level152,level16,level168)
STEP 9.0: unload(p1,t0,l2)
STEP 9.1: drive(t0,l2,l9,level134,level18,level152)
STEP 10.0: unload(p7,t0,l9) unload(p8,t0,l9)
STEP 10.1: drive(t0,l9,l1,level126,level8,level134)
STEP 11.0: unload(p0,t0,l1)
STEP 11.1: drive(t0,l1,l9,level118,level8,level126)
STEP 12: drive(t0,l9,l6,level105,level13,level118)
STEP 13.0: unload(p11,t0,l6)
STEP 13.1: drive(t0,l6,l2,level82,level23,level105)
STEP 14: drive(t0,l2,l7,level72,level10,level82)
STEP 15.0: load(p9,t0,l7)
STEP 15.1: drive(t0,l7,l5,level61,level11,level72)
STEP 16.0: load(p3,t0,l5) unload(p10,t0,l5)
STEP 16.1: drive(t0,l5,l7,level50,level11,level61)
STEP 17: drive(t0,l7,l10,level45,level5,level50)
STEP 18: drive(t0,l10,l4,level33,level12,level45)
STEP 19.0: unload(p3,t0,l4) unload(p4,t0,l4)
STEP 19.1: drive(t0,l4,l2,level26,level7,level33)
STEP 20: drive(t0,l2,l10,level22,level4,level26)
STEP 21: drive(t0,l10,l7,level17,level5,level22)
STEP 22: drive(t0,l7,l0,level6,level11,level17)
STEP 23: drive(t0,l0,l3,level4,level2,level6)
STEP 24: unload(p5,t0,l3) unload(p9,t0,l3)
48 actions in the plan.
Cost of the plan is 48.
total time 432.36 preprocess 430.95 
total size 1.153 GB
max. learned clause length 31392
t val conflicts decisions
0 0 0 0
5 0 0 0
10 -1 360 413
15 -1 301 369
20 -1 241 426
25 1 126 334