Madagascar 0.99999 25/02/2015 09:03:18 amd64 1-core
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.07 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
Heuristic: VSIDS
				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 698 MB)
30 UNSAT (12 decisions 12 conflicts)
Horizon 35: 30020 variables
Horizon 40: 34265 variables
Horizon 45: 38510 variables
Horizon 50: 42755 variables
35 UNSAT (341 decisions 276 conflicts)
Horizon 55: 47000 variables
Horizon 60: 51245 variables
Horizon 65: 55490 variables
Horizon 70: 59735 variables
40 UNSAT (2580 decisions 426 conflicts)
Horizon 75: 63980 variables
Horizon 80: 68225 variables
Horizon 85: 72470 variables
SAT (1138 decisions 205 conflicts)
PLAN FOUND: 70 steps
STEP 0: unstack(f,l)
STEP 1: put-down(f)
STEP 3: unstack(l,m)
STEP 4: put-down(l)
STEP 5: unstack(o,g)
STEP 6: put-down(o)
STEP 7: unstack(m,j)
STEP 8: put-down(m)
STEP 11: unstack(j,p)
STEP 12: put-down(j)
STEP 13: unstack(h,e)
STEP 14: put-down(h)
STEP 15: unstack(p,n)
STEP 16: put-down(p)
STEP 18: unstack(n,i)
STEP 19: put-down(n)
STEP 20: unstack(i,b)
STEP 21: stack(i,f)
STEP 22: unstack(b,d)
STEP 23: put-down(b)
STEP 24: unstack(d,c)
STEP 25: put-down(d)
STEP 26: unstack(c,k)
STEP 27: stack(c,o)
STEP 31: pick-up(m)
STEP 32: stack(m,c)
STEP 33: pick-up(e)
STEP 34: stack(e,m)
STEP 35: pick-up(n)
STEP 36: stack(n,e)
STEP 37: unstack(k,a)
STEP 38: stack(k,p)
STEP 39: pick-up(a)
STEP 40: stack(a,n)
STEP 43: pick-up(h)
STEP 44: stack(h,a)
STEP 46: pick-up(j)
STEP 47: stack(j,h)
STEP 48: pick-up(l)
STEP 49: stack(l,j)
STEP 50: unstack(i,f)
STEP 53: stack(i,l)
STEP 54: unstack(k,p)
STEP 55: stack(k,i)
STEP 57: pick-up(g)
STEP 58: stack(g,k)
STEP 59: pick-up(f)
STEP 60: stack(f,g)
STEP 61: pick-up(p)
STEP 62: stack(p,f)
STEP 63: pick-up(b)
STEP 65: stack(b,p)
STEP 67: pick-up(d)
STEP 69: stack(d,b)
54 actions in the plan.
total time 0.77 preprocess 0.10 
total size 1.612 GB
max. learned clause length 4791
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 12 12
35 0 276 341
40 0 426 2580
45 -1 555 9177
50 -1 492 4826
55 -1 448 4562
60 -1 363 2384
65 -1 321 2419
70 1 205 1138