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

Domain: blocks
Problem: blocks-16-1
Parser: 544 ground actions and 305 state variables
Invariants: 0 1 2 3 4 5  0.08 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.02 secs (max SCC size 1)
Plan type: E-step
				Allocated 32 MB permanent (total 125 MB)
Horizon 0: 305 variables
0 UNSAT (0 decisions 0 conflicts)
Horizon 5: 4550 variables
5 UNSAT (0 decisions 0 conflicts)
Horizon 10: 8795 variables
10 UNSAT (0 decisions 0 conflicts)
Horizon 15: 13040 variables
15 UNSAT (0 decisions 0 conflicts)
Horizon 20: 17285 variables
20 UNSAT (0 decisions 0 conflicts)
Horizon 25: 21530 variables
25 UNSAT (0 decisions 0 conflicts)
Horizon 30: 25775 variables
				Allocated 32 MB (total 697 MB)
30 UNSAT (15 decisions 13 conflicts)
Horizon 35: 30020 variables
35 UNSAT (64 decisions 55 conflicts)
Horizon 40: 34265 variables
Horizon 45: 38510 variables
Horizon 50: 42755 variables
Horizon 55: 47000 variables
Horizon 60: 51245 variables
Horizon 65: 55490 variables
Horizon 70: 59735 variables
Horizon 75: 63980 variables
Horizon 80: 68225 variables
Horizon 85: 72470 variables
Horizon 90: 76715 variables
				Allocated 32 MB permanent (total 1764 MB)
Horizon 95: 80960 variables
Horizon 100: 85205 variables
Horizon 105: 89450 variables
Horizon 110: 93695 variables
Horizon 115: 97940 variables
Horizon 120: 102185 variables
Horizon 125: 106430 variables
Horizon 130: 110675 variables
				Allocated 32 MB permanent (total 2454 MB)
Horizon 135: 114920 variables
40 UNSAT (3857 decisions 1874 conflicts)
Horizon 140: 119165 variables
						GC: 21.33 MB
						GC: 18.00 MB
SAT (2094 decisions 752 conflicts)
PLAN FOUND: 140 steps
STEP 0: unstack(f,l)
STEP 1: stack(f,h)
STEP 2: unstack(l,m)
STEP 3: put-down(l)
STEP 4: unstack(m,j)
STEP 5: put-down(m)
STEP 6: unstack(j,p)
STEP 7: stack(j,l)
STEP 8: unstack(p,n)
STEP 9: stack(p,m)
STEP 10: unstack(n,i)
STEP 11: stack(n,j)
STEP 12: unstack(i,b)
STEP 13: put-down(i)
STEP 14: unstack(b,d)
STEP 15: stack(b,i)
STEP 16: unstack(d,c)
STEP 17: stack(d,b)
STEP 18: unstack(c,k)
STEP 19: stack(c,o)
STEP 20: unstack(p,m)
STEP 21: stack(p,d)
STEP 22: pick-up(m)
STEP 23: stack(m,c)
STEP 24: unstack(f,h)
STEP 25: stack(f,n)
STEP 26: unstack(h,e)
STEP 27: stack(h,k)
STEP 28: pick-up(e)
STEP 29: stack(e,m)
STEP 30: unstack(f,n)
STEP 31: stack(f,e)
STEP 32: unstack(n,j)
STEP 33: stack(n,j)
STEP 34: unstack(f,e)
STEP 35: stack(f,e)
STEP 36: unstack(n,j)
STEP 37: stack(n,p)
STEP 38: unstack(f,e)
STEP 39: stack(f,j)
STEP 40: unstack(n,p)
STEP 41: stack(n,e)
STEP 42: unstack(h,k)
STEP 43: stack(h,f)
STEP 44: unstack(k,a)
STEP 45: stack(k,h)
STEP 46: pick-up(a)
STEP 47: stack(a,n)
STEP 48: unstack(k,h)
STEP 49: stack(k,p)
STEP 50: unstack(h,f)
STEP 51: stack(h,a)
STEP 52: unstack(f,j)
STEP 53: put-down(f)
STEP 54: unstack(j,l)
STEP 55: stack(j,h)
STEP 56: pick-up(l)
STEP 57: stack(l,j)
STEP 58: unstack(k,p)
STEP 59: stack(k,f)
STEP 60: unstack(p,d)
STEP 61: stack(p,k)
STEP 62: unstack(d,b)
STEP 63: put-down(d)
STEP 64: unstack(b,i)
STEP 65: stack(b,p)
STEP 66: pick-up(i)
STEP 67: stack(i,l)
STEP 68: unstack(b,p)
STEP 69: stack(b,d)
STEP 70: unstack(p,k)
STEP 71: stack(p,b)
STEP 72: unstack(k,f)
STEP 73: stack(k,i)
STEP 74: unstack(k,i)
STEP 75: put-down(k)
STEP 76: unstack(i,l)
STEP 77: put-down(i)
STEP 78: unstack(l,j)
STEP 79: stack(l,p)
STEP 80: unstack(j,h)
STEP 81: stack(j,i)
STEP 82: unstack(h,a)
STEP 83: stack(h,k)
STEP 84: unstack(a,n)
STEP 85: stack(a,f)
STEP 86: unstack(n,e)
STEP 87: stack(n,j)
STEP 88: unstack(e,m)
STEP 89: stack(e,n)
STEP 90: unstack(m,c)
STEP 91: stack(m,a)
STEP 92: unstack(c,o)
STEP 93: stack(c,l)
STEP 94: unstack(o,g)
STEP 95: put-down(o)
STEP 96: unstack(c,l)
STEP 97: stack(c,o)
STEP 98: unstack(m,a)
STEP 99: stack(m,c)
STEP 100: unstack(e,n)
STEP 101: stack(e,m)
STEP 102: unstack(n,j)
STEP 103: stack(n,e)
STEP 104: unstack(a,f)
STEP 105: stack(a,n)
STEP 106: unstack(h,k)
STEP 107: stack(h,a)
STEP 108: unstack(j,i)
STEP 109: stack(j,h)
STEP 110: unstack(l,p)
STEP 111: stack(l,j)
STEP 112: pick-up(i)
STEP 113: stack(i,l)
STEP 114: pick-up(k)
STEP 115: stack(k,i)
STEP 116: pick-up(g)
STEP 117: stack(g,k)
STEP 118: pick-up(f)
STEP 119: stack(f,g)
STEP 120: unstack(p,b)
STEP 121: stack(p,f)
STEP 122: unstack(b,d)
STEP 123: stack(b,p)
STEP 124: pick-up(d)
STEP 125: stack(d,b)
126 actions in the plan.
total time 7.72 preprocess 0.10 
total size 2.552 GB
max. learned clause length 4886
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 13 15
35 0 55 64
40 0 1874 3857
45 -1 5184 10774
50 -1 4691 8808
55 -1 4273 7888
60 -1 3851 7263
65 -1 3429 6804
70 -1 3128 6244
75 -1 2822 5944
80 -1 2524 5619
85 -1 2281 5271
90 -1 2040 4415
95 -1 1862 4197
100 -1 1680 4046
105 -1 1501 3558
110 -1 1383 3318
115 -1 1260 3113
120 -1 1140 2875
125 -1 1020 2710
130 -1 900 2283
135 -1 840 2137
140 1 752 2094