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

Domain: blocks
Problem: blocks-15-1
Parser: 480 ground actions and 271 state variables
Invariants: 0 1 2 3 4 5  0.06 secs
Goal: conjunctive
Simplified: 480 ground actions and 271 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: 271 variables
0 UNSAT (0 decisions 0 conflicts)
Horizon 5: 4026 variables
5 UNSAT (0 decisions 0 conflicts)
Horizon 10: 7781 variables
10 UNSAT (0 decisions 0 conflicts)
Horizon 15: 11536 variables
15 UNSAT (0 decisions 0 conflicts)
Horizon 20: 15291 variables
20 UNSAT (0 decisions 0 conflicts)
Horizon 25: 19046 variables
25 UNSAT (0 decisions 0 conflicts)
Horizon 30: 22801 variables
				Allocated 32 MB (total 697 MB)
30 UNSAT (4 decisions 4 conflicts)
Horizon 35: 26556 variables
Horizon 40: 30311 variables
Horizon 45: 34066 variables
35 UNSAT (184 decisions 142 conflicts)
Horizon 50: 37821 variables
Horizon 55: 41576 variables
Horizon 60: 45331 variables
Horizon 65: 49086 variables
Horizon 70: 52841 variables
40 UNSAT (2092 decisions 419 conflicts)
Horizon 75: 56596 variables
Horizon 80: 60351 variables
Horizon 85: 64106 variables
45 UNSAT (3890 decisions 553 conflicts)
50 UNSAT (5703 decisions 469 conflicts)
Horizon 90: 67861 variables
SAT (14633 decisions 498 conflicts)
PLAN FOUND: 55 steps
STEP 0: unstack(g,l)
STEP 1: put-down(g)
STEP 2: unstack(l,f)
STEP 3: stack(l,o)
STEP 4: unstack(f,c)
STEP 5: put-down(f)
STEP 6: unstack(c,n)
STEP 7: put-down(c)
STEP 9: unstack(n,e)
STEP 10: stack(n,g)
STEP 11: unstack(e,h)
STEP 12: put-down(e)
STEP 13: unstack(h,d)
STEP 14: put-down(h)
STEP 15: unstack(d,a)
STEP 17: put-down(d)
STEP 18: unstack(a,k)
STEP 19: stack(a,e)
STEP 20: unstack(k,b)
STEP 21: put-down(k)
STEP 22: unstack(b,j)
STEP 23: put-down(b)
STEP 24: unstack(j,i)
STEP 25: stack(j,f)
STEP 26: unstack(l,o)
STEP 27: stack(l,h)
STEP 28: pick-up(i)
STEP 29: stack(i,l)
STEP 30: unstack(o,m)
STEP 32: stack(o,i)
STEP 33: unstack(n,g)
STEP 34: stack(n,o)
STEP 35: pick-up(c)
STEP 36: stack(c,n)
STEP 37: pick-up(b)
STEP 38: stack(b,c)
STEP 39: unstack(a,e)
STEP 40: stack(a,b)
STEP 41: pick-up(m)
STEP 42: stack(m,a)
STEP 43: pick-up(e)
STEP 44: stack(e,m)
STEP 45: unstack(j,f)
STEP 46: stack(j,e)
STEP 47: pick-up(k)
STEP 48: stack(k,j)
STEP 49: pick-up(f)
STEP 50: stack(f,k)
STEP 51: pick-up(g)
STEP 52: stack(g,f)
STEP 53: pick-up(d)
STEP 54: stack(d,g)
52 actions in the plan.
total time 0.67 preprocess 0.09 
total size 1.685 GB
max. learned clause length 4433
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 4 4
35 0 142 184
40 0 419 2092
45 0 553 3890
50 0 469 5703
55 1 498 14633