1
0
Fork 0
tplp-planning-benchmark/m-mpc/ipc-2000_blocks-strips-type...

220 lines
5.3 KiB
Plaintext

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-52.pddlignoring --stats
ignoring --verbose
Domain: blocks
Problem: blocks-25-1
Parser: 1300 ground actions and 701 state variables
Invariants: 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 0.22 secs
Goal: conjunctive
Simplified: 1300 ground actions and 701 state variables
Actions: STRIPS
Disabling graph %: 10 20 30 40 50 60 70 80 90 100 0.10 secs (max SCC size 1)
Plan type: E-step
Allocated 32 MB permanent (total 132 MB)
Horizon 5: 10706 variables
5 UNSAT (0 decisions 0 conflicts)
Horizon 7: 14708 variables
7 UNSAT (0 decisions 0 conflicts)
Horizon 10: 20711 variables
10 UNSAT (0 decisions 0 conflicts)
Horizon 14: 28715 variables
14 UNSAT (0 decisions 0 conflicts)
Horizon 20: 40721 variables
20 UNSAT (0 decisions 0 conflicts)
Horizon 28: 56729 variables
28 UNSAT (0 decisions 0 conflicts)
Horizon 40: 80741 variables
Allocated 32 MB (total 714 MB)
40 UNSAT (2 decisions 2 conflicts)
Horizon 56: 112757 variables
Horizon 80: 160781 variables
Horizon 113: 226814 variables
Allocated 32 MB permanent (total 1100 MB)
Horizon 160: 320861 variables
Horizon 226: 452927 variables
Allocated 32 MB permanent (total 1350 MB)
Horizon 320: 641021 variables
Allocated 32 MB permanent (total 1511 MB)
Horizon 452: 905153 variables
Allocated 32 MB permanent (total 1696 MB)
Allocated 32 MB permanent (total 1728 MB)
Horizon 640: 1281341 variables
Allocated 32 MB permanent (total 1943 MB)
Allocated 32 MB permanent (total 1975 MB)
Allocated 32 MB permanent (total 2007 MB)
Horizon 905: 1811606 variables
Allocated 32 MB permanent (total 2267 MB)
Allocated 32 MB permanent (total 2299 MB)
Allocated 32 MB permanent (total 2331 MB)
Horizon 1280: 2561981 variables
SAT (906 decisions 285 conflicts)
PLAN FOUND: 320 steps
STEP 0: unstack(k,f)
STEP 1: put-down(k)
STEP 2: unstack(f,b)
STEP 3: stack(f,s)
STEP 4: unstack(b,y)
STEP 5: put-down(b)
STEP 6: unstack(y,l)
STEP 7: put-down(y)
STEP 8: pick-up(k)
STEP 9: stack(k,f)
STEP 10: unstack(l,w)
STEP 11: put-down(l)
STEP 12: unstack(k,f)
STEP 13: put-down(k)
STEP 14: unstack(f,s)
STEP 15: stack(f,w)
STEP 16: pick-up(k)
STEP 17: stack(k,f)
STEP 18: unstack(k,f)
STEP 19: put-down(k)
STEP 20: unstack(f,w)
STEP 21: stack(f,u)
STEP 22: unstack(w,d)
STEP 23: stack(w,k)
STEP 24: unstack(d,t)
STEP 25: stack(d,y)
STEP 26: unstack(t,c)
STEP 27: stack(t,s)
STEP 28: unstack(f,u)
STEP 29: stack(f,w)
STEP 30: unstack(f,w)
STEP 31: stack(f,w)
STEP 32: unstack(f,w)
STEP 33: stack(f,w)
STEP 34: unstack(f,w)
STEP 35: stack(f,w)
STEP 36: unstack(f,w)
STEP 37: stack(f,u)
STEP 38: unstack(w,k)
STEP 39: stack(w,k)
STEP 40: unstack(f,u)
STEP 41: stack(f,w)
STEP 42: unstack(f,w)
STEP 43: stack(f,u)
STEP 44: unstack(w,k)
STEP 45: put-down(w)
STEP 46: unstack(f,u)
STEP 47: stack(f,w)
STEP 48: pick-up(k)
STEP 49: stack(k,f)
STEP 50: unstack(c,i)
STEP 51: stack(c,u)
STEP 52: unstack(i,r)
STEP 53: stack(i,d)
STEP 54: unstack(r,p)
STEP 55: stack(r,l)
STEP 56: unstack(p,n)
STEP 57: put-down(p)
STEP 58: unstack(n,h)
STEP 59: stack(n,k)
STEP 60: unstack(h,o)
STEP 61: stack(h,b)
STEP 62: unstack(o,x)
STEP 63: stack(o,r)
STEP 64: unstack(x,e)
STEP 65: stack(x,t)
STEP 66: unstack(n,k)
STEP 67: stack(n,p)
STEP 68: unstack(x,t)
STEP 69: stack(x,k)
STEP 70: unstack(t,s)
STEP 71: stack(t,n)
STEP 72: unstack(s,q)
STEP 73: stack(s,x)
STEP 74: unstack(e,j)
STEP 75: stack(e,t)
STEP 76: unstack(j,m)
STEP 77: stack(j,s)
STEP 78: unstack(e,t)
STEP 79: stack(e,j)
STEP 80: unstack(m,v)
STEP 81: stack(m,t)
STEP 82: pick-up(v)
STEP 83: stack(v,e)
STEP 84: unstack(h,b)
STEP 85: stack(h,i)
STEP 86: pick-up(b)
STEP 87: stack(b,v)
STEP 88: unstack(c,u)
STEP 89: stack(c,m)
STEP 90: unstack(u,g)
STEP 91: put-down(u)
STEP 92: pick-up(g)
STEP 93: stack(g,b)
STEP 94: unstack(h,i)
STEP 95: stack(h,g)
STEP 96: unstack(i,d)
STEP 97: stack(i,q)
STEP 98: unstack(c,m)
STEP 99: stack(c,u)
STEP 100: unstack(m,t)
STEP 101: stack(m,h)
STEP 102: unstack(c,u)
STEP 103: stack(c,m)
STEP 104: unstack(i,q)
STEP 105: stack(i,d)
STEP 106: unstack(q,a)
STEP 107: stack(q,c)
STEP 108: unstack(i,d)
STEP 109: stack(i,q)
STEP 110: unstack(d,y)
STEP 111: stack(d,i)
STEP 112: unstack(o,r)
STEP 113: stack(o,d)
STEP 114: pick-up(a)
STEP 115: stack(a,o)
STEP 116: pick-up(u)
STEP 117: stack(u,a)
STEP 118: unstack(r,l)
STEP 119: stack(r,t)
STEP 120: pick-up(l)
STEP 121: stack(l,u)
STEP 122: unstack(r,t)
STEP 123: put-down(r)
STEP 124: unstack(t,n)
STEP 125: stack(t,r)
STEP 126: unstack(n,p)
STEP 127: stack(n,l)
STEP 128: pick-up(p)
STEP 129: put-down(p)
STEP 130: pick-up(y)
STEP 131: stack(y,t)
STEP 132: pick-up(p)
STEP 133: stack(p,y)
STEP 134: unstack(p,y)
STEP 135: put-down(p)
STEP 136: unstack(y,t)
STEP 137: put-down(y)
STEP 138: unstack(t,r)
STEP 139: stack(t,p)
STEP 140: pick-up(r)
STEP 141: stack(r,n)
STEP 142: unstack(t,p)
STEP 143: stack(t,r)
STEP 144: pick-up(y)
STEP 145: stack(y,t)
STEP 146: pick-up(p)
STEP 147: stack(p,y)
148 actions in the plan.
total time 3.70 preprocess 0.34
total size 2.382 GB
max. learned clause length 5309
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 0 0
40 0 2 2
56 -1 605 1041
80 -1 541 1233
113 -1 480 1029
160 -1 420 991
226 -1 360 721
320 1 285 906