Madagascar 0.99999 25/02/2015 09:45:59 amd64 1-core (no VSIDS)
Options: file:/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/domain.pddl file:/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/instances/instance-34.pddlignoring --stats
ignoring --verbose

Domain: blocks
Problem: blocks-16-2
Parser: 544 ground actions and 305 state variables
Invariants: 0 1 2 3 4 5  0.05 secs
Goal: conjunctive
Simplified: 544 ground actions and 305 state variables
Actions: STRIPS
Disabling graph %: 10 20 30 40 50 60 70 80 90 100 0.01 secs (max SCC size 1)
Plan type: E-step
				Allocated 32 MB permanent (total 125 MB)
Horizon 5: 4550 variables
5 UNSAT (0 decisions 0 conflicts)
Horizon 7: 6248 variables
7 UNSAT (0 decisions 0 conflicts)
Horizon 10: 8795 variables
10 UNSAT (0 decisions 0 conflicts)
Horizon 14: 12191 variables
14 UNSAT (0 decisions 0 conflicts)
Horizon 20: 17285 variables
20 UNSAT (0 decisions 0 conflicts)
Horizon 28: 24077 variables
				Allocated 32 MB (total 620 MB)
28 UNSAT (15 decisions 14 conflicts)
Horizon 40: 34265 variables
Horizon 56: 47849 variables
Horizon 80: 68225 variables
Horizon 113: 96242 variables
Horizon 160: 136145 variables
SAT (317 decisions 145 conflicts)
PLAN FOUND: 80 steps
STEP 0: unstack(l,o)
STEP 1: put-down(l)
STEP 2: unstack(e,f)
STEP 3: put-down(e)
STEP 4: unstack(f,h)
STEP 5: put-down(f)
STEP 6: unstack(h,b)
STEP 7: stack(h,f)
STEP 8: unstack(b,c)
STEP 9: stack(b,e)
STEP 10: unstack(c,m)
STEP 11: stack(c,l)
STEP 12: unstack(m,d)
STEP 13: stack(m,b)
STEP 14: unstack(d,a)
STEP 15: put-down(d)
STEP 16: unstack(a,p)
STEP 17: stack(a,m)
STEP 18: unstack(p,n)
STEP 19: stack(p,o)
STEP 20: unstack(a,m)
STEP 21: stack(a,p)
STEP 22: unstack(n,g)
STEP 23: stack(n,a)
STEP 24: unstack(m,b)
STEP 25: stack(m,n)
STEP 26: unstack(c,l)
STEP 27: stack(c,b)
STEP 28: pick-up(l)
STEP 29: stack(l,m)
STEP 30: unstack(c,b)
STEP 31: stack(c,l)
STEP 32: unstack(b,e)
STEP 33: stack(b,c)
STEP 34: pick-up(e)
STEP 35: stack(e,d)
STEP 36: unstack(b,c)
STEP 37: stack(b,c)
STEP 38: unstack(e,d)
STEP 39: stack(e,d)
STEP 40: unstack(b,c)
STEP 41: stack(b,c)
STEP 42: unstack(e,d)
STEP 43: stack(e,g)
STEP 44: unstack(b,c)
STEP 45: stack(b,d)
STEP 46: unstack(e,g)
STEP 47: stack(e,c)
STEP 48: unstack(g,i)
STEP 49: stack(g,e)
STEP 50: unstack(b,d)
STEP 51: put-down(b)
STEP 52: unstack(i,k)
STEP 53: stack(i,d)
STEP 54: unstack(k,j)
STEP 55: stack(k,h)
STEP 56: pick-up(j)
STEP 57: stack(j,g)
STEP 58: unstack(k,h)
STEP 59: stack(k,j)
STEP 60: pick-up(b)
STEP 61: stack(b,k)
STEP 62: unstack(h,f)
STEP 63: put-down(h)
STEP 64: pick-up(f)
STEP 65: stack(f,b)
STEP 66: pick-up(h)
STEP 67: stack(h,f)
STEP 68: unstack(i,d)
STEP 69: put-down(i)
STEP 70: pick-up(d)
STEP 71: stack(d,h)
STEP 72: pick-up(i)
STEP 73: stack(i,d)
74 actions in the plan.
total time 0.21 preprocess 0.07 
total size 1.075 GB
max. learned clause length 1212
t val conflicts decisions
5 0 0 0
7 0 0 0
10 0 0 0
14 0 0 0
20 0 0 0
28 0 14 15
40 -1 300 726
56 -1 240 705
80 1 145 317