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-39.pddlignoring --stats
ignoring --verbose

Domain: blocks
Problem: blocks-19-0
Parser: 760 ground actions and 419 state variables
Invariants: 0 1 2 3 4 5 6 7 8 9 10 11 12  0.06 secs
Goal: conjunctive
Simplified: 760 ground actions and 419 state variables
Actions: STRIPS
Disabling graph %: 10 20 30 40 50 60 70 80 90 100 0.03 secs (max SCC size 1)
Plan type: E-step
				Allocated 32 MB permanent (total 127 MB)
Horizon 5: 6314 variables
5 UNSAT (0 decisions 0 conflicts)
Horizon 7: 8672 variables
7 UNSAT (0 decisions 0 conflicts)
Horizon 10: 12209 variables
10 UNSAT (0 decisions 0 conflicts)
Horizon 14: 16925 variables
14 UNSAT (0 decisions 0 conflicts)
Horizon 20: 23999 variables
20 UNSAT (0 decisions 0 conflicts)
Horizon 28: 33431 variables
28 UNSAT (0 decisions 0 conflicts)
Horizon 40: 47579 variables
				Allocated 32 MB (total 703 MB)
40 UNSAT (86 decisions 52 conflicts)
Horizon 56: 66443 variables
Horizon 80: 94739 variables
Horizon 113: 133646 variables
Horizon 160: 189059 variables
				Allocated 32 MB permanent (total 1161 MB)
Horizon 226: 266873 variables
SAT (371 decisions 133 conflicts)
PLAN FOUND: 113 steps
STEP 0: unstack(n,j)
STEP 1: stack(n,l)
STEP 2: unstack(j,k)
STEP 3: stack(j,s)
STEP 4: unstack(k,g)
STEP 5: stack(k,j)
STEP 6: unstack(g,a)
STEP 7: put-down(g)
STEP 8: unstack(a,r)
STEP 9: stack(a,r)
STEP 10: unstack(k,j)
STEP 11: stack(k,g)
STEP 12: unstack(a,r)
STEP 13: stack(a,k)
STEP 14: unstack(r,i)
STEP 15: put-down(r)
STEP 16: unstack(i,p)
STEP 17: put-down(i)
STEP 18: unstack(p,m)
STEP 19: stack(p,j)
STEP 20: unstack(m,q)
STEP 21: stack(m,n)
STEP 22: unstack(q,c)
STEP 23: stack(q,i)
STEP 24: unstack(a,k)
STEP 25: put-down(a)
STEP 26: unstack(c,d)
STEP 27: stack(c,k)
STEP 28: unstack(m,n)
STEP 29: stack(m,n)
STEP 30: unstack(p,j)
STEP 31: stack(p,a)
STEP 32: unstack(j,s)
STEP 33: stack(j,p)
STEP 34: unstack(d,h)
STEP 35: stack(d,r)
STEP 36: unstack(h,o)
STEP 37: stack(h,d)
STEP 38: unstack(o,e)
STEP 39: stack(o,j)
STEP 40: unstack(e,f)
STEP 41: stack(e,c)
STEP 42: unstack(o,j)
STEP 43: stack(o,e)
STEP 44: unstack(m,n)
STEP 45: stack(m,o)
STEP 46: pick-up(s)
STEP 47: stack(s,m)
STEP 48: unstack(f,b)
STEP 49: stack(f,s)
STEP 50: unstack(n,l)
STEP 51: stack(n,f)
STEP 52: pick-up(b)
STEP 53: stack(b,n)
STEP 54: unstack(j,p)
STEP 55: stack(j,b)
STEP 56: unstack(h,d)
STEP 57: stack(h,p)
STEP 58: unstack(d,r)
STEP 59: stack(d,j)
STEP 60: pick-up(l)
STEP 61: stack(l,r)
STEP 62: unstack(l,r)
STEP 63: stack(l,h)
STEP 64: unstack(q,i)
STEP 65: stack(q,r)
STEP 66: pick-up(i)
STEP 67: stack(i,d)
STEP 68: unstack(q,r)
STEP 69: put-down(q)
STEP 70: pick-up(r)
STEP 71: stack(r,i)
STEP 72: unstack(l,h)
STEP 73: stack(l,r)
STEP 74: unstack(h,p)
STEP 75: stack(h,q)
STEP 76: unstack(p,a)
STEP 77: put-down(p)
STEP 78: pick-up(a)
STEP 79: stack(a,l)
STEP 80: pick-up(p)
STEP 81: stack(p,a)
STEP 82: unstack(h,q)
STEP 83: put-down(h)
STEP 84: pick-up(q)
STEP 85: stack(q,p)
STEP 86: pick-up(h)
STEP 87: stack(h,q)
88 actions in the plan.
total time 0.32 preprocess 0.10 
total size 1.209 GB
max. learned clause length 1606
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 0 0
40 0 52 86
56 -1 300 782
80 -1 240 666
113 1 133 371