Madagascar 0.99999 25/02/2015 09:46:27 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-42.pddlignoring --stats
ignoring --verbose

Domain: blocks
Problem: blocks-20-1
Parser: 840 ground actions and 461 state variables
Invariants: 0 1 2 3 4 5 6 7 8 9 10 11  0.11 secs
Goal: conjunctive
Simplified: 840 ground actions and 461 state variables
Actions: STRIPS
Disabling graph %: 10 20 30 40 50 60 70 80 90 100 0.05 secs (max SCC size 1)
Plan type: E-step
				Allocated 32 MB permanent (total 128 MB)
Horizon 0: 461 variables
0 UNSAT (0 decisions 0 conflicts)
Horizon 5: 6966 variables
5 UNSAT (0 decisions 0 conflicts)
Horizon 10: 13471 variables
10 UNSAT (0 decisions 0 conflicts)
Horizon 15: 19976 variables
15 UNSAT (0 decisions 0 conflicts)
Horizon 20: 26481 variables
20 UNSAT (0 decisions 0 conflicts)
Horizon 25: 32986 variables
25 UNSAT (0 decisions 0 conflicts)
Horizon 30: 39491 variables
30 UNSAT (0 decisions 0 conflicts)
Horizon 35: 45996 variables
35 UNSAT (0 decisions 0 conflicts)
Horizon 40: 52501 variables
				Allocated 32 MB (total 861 MB)
40 UNSAT (21 decisions 21 conflicts)
Horizon 45: 59006 variables
45 UNSAT (59 decisions 53 conflicts)
Horizon 50: 65511 variables
Horizon 55: 72016 variables
50 UNSAT (132 decisions 115 conflicts)
Horizon 60: 78521 variables
Horizon 65: 85026 variables
Horizon 70: 91531 variables
				Allocated 32 MB permanent (total 1460 MB)
Horizon 75: 98036 variables
Horizon 80: 104541 variables
Horizon 85: 111046 variables
55 UNSAT (879 decisions 422 conflicts)
Horizon 90: 117551 variables
Horizon 95: 124056 variables
Horizon 100: 130561 variables
Horizon 105: 137066 variables
				Allocated 32 MB permanent (total 2078 MB)
Horizon 110: 143571 variables
Horizon 115: 150076 variables
SAT (222 decisions 118 conflicts)
PLAN FOUND: 110 steps
STEP 0: unstack(a,h)
STEP 1: put-down(a)
STEP 2: unstack(h,k)
STEP 3: put-down(h)
STEP 4: unstack(k,q)
STEP 5: stack(k,h)
STEP 6: unstack(q,t)
STEP 7: put-down(q)
STEP 8: unstack(t,e)
STEP 9: put-down(t)
STEP 10: unstack(e,i)
STEP 11: put-down(e)
STEP 12: unstack(i,b)
STEP 13: stack(i,a)
STEP 14: unstack(b,p)
STEP 15: stack(b,g)
STEP 16: unstack(p,l)
STEP 17: put-down(p)
STEP 18: unstack(l,d)
STEP 19: put-down(l)
STEP 20: unstack(d,o)
STEP 21: stack(d,k)
STEP 22: unstack(o,j)
STEP 23: stack(o,l)
STEP 24: unstack(j,s)
STEP 25: put-down(j)
STEP 26: unstack(i,a)
STEP 27: stack(i,a)
STEP 28: pick-up(p)
STEP 29: stack(p,j)
STEP 30: unstack(b,g)
STEP 31: stack(b,o)
STEP 32: pick-up(q)
STEP 33: stack(q,i)
STEP 34: unstack(s,c)
STEP 35: put-down(s)
STEP 36: pick-up(t)
STEP 37: stack(t,g)
STEP 38: unstack(b,o)
STEP 39: stack(b,t)
STEP 40: unstack(d,k)
STEP 41: stack(d,k)
STEP 42: unstack(c,f)
STEP 43: stack(c,p)
STEP 44: unstack(f,r)
STEP 45: stack(f,o)
STEP 46: unstack(r,n)
STEP 47: stack(r,e)
STEP 48: unstack(b,t)
STEP 49: stack(b,r)
STEP 50: unstack(f,o)
STEP 51: stack(f,b)
STEP 52: unstack(t,g)
STEP 53: stack(t,c)
STEP 54: unstack(g,m)
STEP 55: put-down(g)
STEP 56: pick-up(m)
STEP 57: stack(m,f)
STEP 58: pick-up(g)
STEP 59: stack(g,m)
STEP 60: unstack(t,c)
STEP 61: stack(t,g)
STEP 62: pick-up(s)
STEP 63: put-down(s)
STEP 64: unstack(o,l)
STEP 65: stack(o,s)
STEP 66: unstack(q,i)
STEP 67: stack(q,i)
STEP 68: unstack(q,i)
STEP 69: stack(q,i)
STEP 70: pick-up(l)
STEP 71: stack(l,o)
STEP 72: unstack(c,p)
STEP 73: stack(c,n)
STEP 74: unstack(p,j)
STEP 75: put-down(p)
STEP 76: pick-up(j)
STEP 77: stack(j,t)
STEP 78: unstack(l,o)
STEP 79: stack(l,j)
STEP 80: pick-up(p)
STEP 81: stack(p,l)
STEP 82: unstack(d,k)
STEP 83: stack(d,o)
STEP 84: unstack(k,h)
STEP 85: stack(k,p)
STEP 86: unstack(c,n)
STEP 87: stack(c,k)
STEP 88: unstack(d,o)
STEP 89: stack(d,c)
STEP 90: unstack(o,s)
STEP 91: stack(o,h)
STEP 92: pick-up(s)
STEP 93: stack(s,d)
STEP 94: unstack(o,h)
STEP 95: stack(o,s)
STEP 96: unstack(q,i)
STEP 97: stack(q,h)
STEP 98: unstack(i,a)
STEP 99: stack(i,o)
STEP 100: unstack(q,h)
STEP 101: stack(q,i)
STEP 102: pick-up(a)
STEP 103: stack(a,q)
STEP 104: pick-up(n)
STEP 105: stack(n,a)
STEP 106: pick-up(h)
STEP 107: stack(h,n)
108 actions in the plan.
total time 1.32 preprocess 0.17 
total size 2.183 GB
max. learned clause length 4895
t val conflicts decisions
0 0 0 0
5 0 0 0
10 0 0 0
15 0 0 0
20 0 0 0
25 0 0 0
30 0 0 0
35 0 0 0
40 0 21 21
45 0 53 59
50 0 115 132
55 0 422 879
60 -1 724 1694
65 -1 663 1473
70 -1 600 1195
75 -1 540 1370
80 -1 480 994
85 -1 420 927
90 -1 360 751
95 -1 300 642
100 -1 240 463
105 -1 180 290
110 1 118 222