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

Domain: blocks
Problem: blocks-18-0
Parser: 684 ground actions and 379 state variables
Invariants: 0 1 2 3 4 5 6 7 8 9  0.06 secs
Goal: conjunctive
Simplified: 684 ground actions and 379 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 126 MB)
Horizon 0: 379 variables
0 UNSAT (0 decisions 0 conflicts)
Horizon 5: 5694 variables
5 UNSAT (0 decisions 0 conflicts)
Horizon 10: 11009 variables
10 UNSAT (0 decisions 0 conflicts)
Horizon 15: 16324 variables
15 UNSAT (0 decisions 0 conflicts)
Horizon 20: 21639 variables
20 UNSAT (0 decisions 0 conflicts)
Horizon 25: 26954 variables
25 UNSAT (0 decisions 0 conflicts)
Horizon 30: 32269 variables
				Allocated 32 MB (total 700 MB)
30 UNSAT (8 decisions 8 conflicts)
Horizon 35: 37584 variables
Horizon 40: 42899 variables
35 UNSAT (107 decisions 81 conflicts)
Horizon 45: 48214 variables
Horizon 50: 53529 variables
Horizon 55: 58844 variables
Horizon 60: 64159 variables
Horizon 65: 69474 variables
Horizon 70: 74789 variables
Horizon 75: 80104 variables
Horizon 80: 85419 variables
				Allocated 32 MB permanent (total 1613 MB)
Horizon 85: 90734 variables
Horizon 90: 96049 variables
40 UNSAT (959 decisions 645 conflicts)
Horizon 95: 101364 variables
Horizon 100: 106679 variables
Horizon 105: 111994 variables
Horizon 110: 117309 variables
Horizon 115: 122624 variables
				Allocated 32 MB permanent (total 2226 MB)
Horizon 120: 127939 variables
Horizon 125: 133254 variables
Horizon 130: 138569 variables
Horizon 135: 143884 variables
SAT (883 decisions 337 conflicts)
PLAN FOUND: 110 steps
STEP 0: unstack(k,o)
STEP 1: put-down(k)
STEP 2: unstack(o,g)
STEP 3: stack(o,q)
STEP 4: unstack(b,l)
STEP 5: stack(b,l)
STEP 6: unstack(b,l)
STEP 7: stack(b,k)
STEP 8: unstack(l,m)
STEP 9: stack(l,o)
STEP 10: unstack(m,f)
STEP 11: stack(m,l)
STEP 12: unstack(f,j)
STEP 13: stack(f,b)
STEP 14: unstack(j,n)
STEP 15: stack(j,m)
STEP 16: unstack(n,i)
STEP 17: stack(n,j)
STEP 18: unstack(i,a)
STEP 19: stack(i,f)
STEP 20: unstack(a,e)
STEP 21: stack(a,i)
STEP 22: pick-up(g)
STEP 23: stack(g,e)
STEP 24: unstack(g,e)
STEP 25: stack(g,e)
STEP 26: unstack(a,i)
STEP 27: put-down(a)
STEP 28: unstack(n,j)
STEP 29: stack(n,j)
STEP 30: unstack(g,e)
STEP 31: stack(g,i)
STEP 32: unstack(e,d)
STEP 33: put-down(e)
STEP 34: unstack(d,r)
STEP 35: stack(d,a)
STEP 36: unstack(g,i)
STEP 37: stack(g,e)
STEP 38: unstack(n,j)
STEP 39: stack(n,r)
STEP 40: unstack(j,m)
STEP 41: stack(j,g)
STEP 42: unstack(m,l)
STEP 43: stack(m,i)
STEP 44: unstack(l,o)
STEP 45: stack(l,m)
STEP 46: unstack(o,q)
STEP 47: put-down(o)
STEP 48: unstack(q,p)
STEP 49: stack(q,o)
STEP 50: unstack(p,c)
STEP 51: stack(p,n)
STEP 52: unstack(j,g)
STEP 53: stack(j,q)
STEP 54: unstack(p,n)
STEP 55: stack(p,g)
STEP 56: unstack(j,q)
STEP 57: stack(j,c)
STEP 58: unstack(q,o)
STEP 59: stack(q,p)
STEP 60: pick-up(o)
STEP 61: stack(o,q)
STEP 62: unstack(d,a)
STEP 63: put-down(d)
STEP 64: pick-up(a)
STEP 65: stack(a,o)
STEP 66: pick-up(d)
STEP 67: stack(d,a)
STEP 68: unstack(j,c)
STEP 69: stack(j,n)
STEP 70: unstack(c,h)
STEP 71: stack(c,d)
STEP 72: unstack(l,m)
STEP 73: stack(l,j)
STEP 74: unstack(m,i)
STEP 75: stack(m,c)
STEP 76: unstack(i,f)
STEP 77: stack(i,l)
STEP 78: unstack(f,b)
STEP 79: stack(f,h)
STEP 80: unstack(b,k)
STEP 81: stack(b,m)
STEP 82: unstack(i,l)
STEP 83: stack(i,b)
STEP 84: unstack(l,j)
STEP 85: stack(l,i)
STEP 86: pick-up(k)
STEP 87: stack(k,l)
STEP 88: unstack(f,h)
STEP 89: stack(f,k)
STEP 90: pick-up(h)
STEP 91: stack(h,j)
STEP 92: unstack(h,j)
STEP 93: stack(h,f)
STEP 94: unstack(j,n)
STEP 95: put-down(j)
STEP 96: unstack(h,f)
STEP 97: stack(h,j)
STEP 98: unstack(n,r)
STEP 99: stack(n,h)
STEP 100: pick-up(r)
STEP 101: stack(r,f)
STEP 102: unstack(n,h)
STEP 103: stack(n,r)
STEP 104: unstack(h,j)
STEP 105: put-down(h)
STEP 106: pick-up(j)
STEP 107: stack(j,n)
STEP 108: pick-up(h)
STEP 109: stack(h,j)
110 actions in the plan.
total time 1.95 preprocess 0.09 
total size 2.495 GB
max. learned clause length 3292
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 8 8
35 0 81 107
40 0 645 959
45 -1 1148 2226
50 -1 1083 2132
55 -1 961 2059
60 -1 900 1979
65 -1 781 1700
70 -1 721 1536
75 -1 660 1498
80 -1 600 1346
85 -1 540 1248
90 -1 480 1193
95 -1 482 1145
100 -1 421 1012
105 -1 360 819
110 1 337 883

