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-35.pddlignoring --stats ignoring --verbose Domain: blocks Problem: blocks-17-0 Parser: 612 ground actions and 341 state variables Invariants: 0 1 2 3 4 5 0.08 secs Goal: conjunctive Simplified: 612 ground actions and 341 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 Heuristic: VSIDS Allocated 32 MB permanent (total 126 MB) Horizon 0: 341 variables 0 UNSAT (0 decisions 0 conflicts) Horizon 5: 5106 variables 5 UNSAT (0 decisions 0 conflicts) Horizon 10: 9871 variables 10 UNSAT (0 decisions 0 conflicts) Horizon 15: 14636 variables 15 UNSAT (0 decisions 0 conflicts) Horizon 20: 19401 variables Allocated 32 MB (total 543 MB) 20 UNSAT (1 decisions 1 conflicts) Horizon 25: 24166 variables 25 UNSAT (36 decisions 30 conflicts) Horizon 30: 28931 variables Horizon 35: 33696 variables Horizon 40: 38461 variables Horizon 45: 43226 variables Horizon 50: 47991 variables 30 UNSAT (540 decisions 279 conflicts) Horizon 55: 52756 variables Horizon 60: 57521 variables Horizon 65: 62286 variables Horizon 70: 67051 variables 35 UNSAT (4127 decisions 494 conflicts) Horizon 75: 71816 variables Horizon 80: 76581 variables Horizon 85: 81346 variables Allocated 32 MB permanent (total 1699 MB) Horizon 90: 86111 variables Horizon 95: 90876 variables SAT (1622 decisions 264 conflicts) PLAN FOUND: 75 steps STEP 0: unstack(g,d) STEP 2: put-down(g) STEP 3: unstack(d,c) STEP 4: put-down(d) STEP 5: unstack(l,f) STEP 6: put-down(l) STEP 7: unstack(f,e) STEP 8: stack(f,e) STEP 10: unstack(f,e) STEP 11: stack(f,d) STEP 12: pick-up(g) STEP 13: stack(g,p) STEP 15: unstack(e,k) STEP 16: put-down(e) STEP 18: pick-up(k) STEP 19: stack(k,g) STEP 21: unstack(k,g) STEP 22: stack(k,f) STEP 24: unstack(q,a) STEP 25: put-down(q) STEP 26: unstack(a,j) STEP 27: stack(a,h) STEP 28: unstack(j,i) STEP 29: stack(j,g) STEP 31: unstack(i,b) STEP 34: stack(i,k) STEP 37: unstack(b,m) STEP 38: stack(b,i) STEP 39: pick-up(m) STEP 41: stack(m,a) STEP 43: unstack(j,g) STEP 44: stack(j,q) STEP 45: unstack(m,a) STEP 46: put-down(m) STEP 47: unstack(g,p) STEP 48: stack(g,b) STEP 49: unstack(a,h) STEP 50: stack(a,g) STEP 52: pick-up(p) STEP 53: stack(p,a) STEP 54: pick-up(m) STEP 55: stack(m,p) STEP 56: pick-up(e) STEP 57: stack(e,m) STEP 58: unstack(c,o) STEP 59: stack(c,e) STEP 60: unstack(h,n) STEP 61: stack(h,c) STEP 63: unstack(j,q) STEP 64: stack(j,h) STEP 65: pick-up(o) STEP 66: stack(o,j) STEP 68: pick-up(l) STEP 69: stack(l,o) STEP 71: pick-up(n) STEP 72: stack(n,l) STEP 73: pick-up(q) STEP 74: stack(q,n) 58 actions in the plan. total time 1.39 preprocess 0.11 total size 1.812 GB max. learned clause length 8006 t val conflicts decisions 0 0 0 0 5 0 0 0 10 0 0 0 15 0 0 0 20 0 1 1 25 0 30 36 30 0 279 540 35 0 494 4127 40 -1 822 11397 45 -1 708 12058 50 -1 694 9637 55 -1 584 14365 60 -1 513 4211 65 -1 426 9305 70 -1 397 5561 75 1 264 1622