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

Domain: blocks
Problem: blocks-13-1
Parser: 364 ground actions and 209 state variables
Invariants: 0 1 2 3 4 5  0.02 secs
Goal: conjunctive
Simplified: 364 ground actions and 209 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 124 MB)
Horizon 5: 3074 variables
5 UNSAT (0 decisions 0 conflicts)
Horizon 7: 4220 variables
7 UNSAT (0 decisions 0 conflicts)
Horizon 10: 5939 variables
10 UNSAT (0 decisions 0 conflicts)
Horizon 14: 8231 variables
14 UNSAT (0 decisions 0 conflicts)
Horizon 20: 11669 variables
20 UNSAT (0 decisions 0 conflicts)
Horizon 28: 16253 variables
				Allocated 32 MB (total 617 MB)
28 UNSAT (28 decisions 27 conflicts)
Horizon 40: 23129 variables
Horizon 56: 32297 variables
Horizon 80: 46049 variables
Horizon 113: 64958 variables
SAT (154 decisions 53 conflicts)
PLAN FOUND: 113 steps
STEP 0: unstack(b,k)
STEP 1: put-down(b)
STEP 2: unstack(j,e)
STEP 3: put-down(j)
STEP 4: unstack(e,d)
STEP 5: stack(e,b)
STEP 6: unstack(d,c)
STEP 7: put-down(d)
STEP 8: unstack(c,a)
STEP 9: stack(c,e)
STEP 10: unstack(a,l)
STEP 11: put-down(a)
STEP 12: unstack(l,h)
STEP 13: stack(l,j)
STEP 14: unstack(h,g)
STEP 15: put-down(h)
STEP 16: unstack(g,m)
STEP 17: stack(g,h)
STEP 18: pick-up(k)
STEP 19: stack(k,g)
STEP 20: unstack(m,i)
STEP 21: put-down(m)
STEP 22: unstack(i,f)
STEP 23: stack(i,f)
STEP 24: unstack(l,j)
STEP 25: stack(l,m)
STEP 26: unstack(i,f)
STEP 27: stack(i,d)
STEP 28: unstack(c,e)
STEP 29: stack(c,j)
STEP 30: unstack(i,d)
STEP 31: stack(i,d)
STEP 32: unstack(e,b)
STEP 33: stack(e,l)
STEP 34: unstack(i,d)
STEP 35: stack(i,b)
STEP 36: pick-up(d)
STEP 37: stack(d,a)
STEP 38: unstack(c,j)
STEP 39: stack(c,e)
STEP 40: unstack(k,g)
STEP 41: put-down(k)
STEP 42: unstack(g,h)
STEP 43: put-down(g)
STEP 44: pick-up(h)
STEP 45: stack(h,i)
STEP 46: pick-up(g)
STEP 47: stack(g,h)
STEP 48: pick-up(k)
STEP 49: stack(k,g)
STEP 50: pick-up(f)
STEP 51: stack(f,k)
STEP 52: pick-up(j)
STEP 53: stack(j,f)
STEP 54: unstack(c,e)
STEP 55: stack(c,j)
STEP 56: unstack(d,a)
STEP 57: stack(d,c)
STEP 58: pick-up(a)
STEP 59: stack(a,e)
STEP 60: unstack(a,e)
STEP 61: put-down(a)
STEP 62: unstack(e,l)
STEP 63: put-down(e)
STEP 64: unstack(l,m)
STEP 65: stack(l,m)
STEP 66: unstack(d,c)
STEP 67: stack(d,a)
STEP 68: unstack(l,m)
STEP 69: stack(l,e)
STEP 70: pick-up(m)
STEP 71: stack(m,c)
STEP 72: unstack(l,e)
STEP 73: stack(l,m)
STEP 74: pick-up(e)
STEP 75: stack(e,l)
STEP 76: unstack(d,a)
STEP 77: put-down(d)
STEP 78: pick-up(a)
STEP 79: stack(a,e)
STEP 80: pick-up(d)
STEP 81: stack(d,a)
82 actions in the plan.
total time 0.12 preprocess 0.03 
total size 0.983 GB
max. learned clause length 703
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 27 28
40 -1 241 532
56 -1 181 356
80 -1 120 262
113 1 53 154