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

215 lines
5.2 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-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.05 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.02 secs (max SCC size 1)
Plan type: E-step
Allocated 32 MB permanent (total 126 MB)
Horizon 5: 5106 variables
5 UNSAT (0 decisions 0 conflicts)
Horizon 7: 7012 variables
7 UNSAT (0 decisions 0 conflicts)
Horizon 10: 9871 variables
10 UNSAT (0 decisions 0 conflicts)
Horizon 14: 13683 variables
14 UNSAT (0 decisions 0 conflicts)
Horizon 20: 19401 variables
Allocated 32 MB (total 543 MB)
20 UNSAT (1 decisions 1 conflicts)
Horizon 28: 27025 variables
Horizon 40: 38461 variables
Horizon 56: 53709 variables
28 UNSAT (168 decisions 129 conflicts)
Horizon 80: 76581 variables
Horizon 113: 108030 variables
Horizon 160: 152821 variables
Horizon 226: 215719 variables
Allocated 32 MB permanent (total 1244 MB)
Horizon 320: 305301 variables
Horizon 452: 431097 variables
Allocated 32 MB permanent (total 1490 MB)
Horizon 640: 610261 variables
Allocated 32 MB permanent (total 1649 MB)
Horizon 905: 862806 variables
Allocated 32 MB permanent (total 1830 MB)
Allocated 32 MB permanent (total 1862 MB)
Horizon 1280: 1220181 variables
Allocated 32 MB permanent (total 2072 MB)
Allocated 32 MB permanent (total 2104 MB)
Horizon 1810: 1725271 variables
Allocated 32 MB permanent (total 2357 MB)
Allocated 32 MB permanent (total 2389 MB)
Allocated 32 MB permanent (total 2421 MB)
Horizon 2560: 2440021 variables
SAT (3527 decisions 1217 conflicts)
PLAN FOUND: 226 steps
STEP 0: unstack(l,f)
STEP 1: stack(l,h)
STEP 2: unstack(f,e)
STEP 3: put-down(f)
STEP 4: unstack(g,d)
STEP 5: put-down(g)
STEP 6: pick-up(f)
STEP 7: stack(f,d)
STEP 8: unstack(e,k)
STEP 9: stack(e,l)
STEP 10: pick-up(k)
STEP 11: stack(k,f)
STEP 12: unstack(q,a)
STEP 13: stack(q,p)
STEP 14: unstack(a,j)
STEP 15: stack(a,q)
STEP 16: unstack(j,i)
STEP 17: stack(j,e)
STEP 18: unstack(i,b)
STEP 19: stack(i,k)
STEP 20: unstack(b,m)
STEP 21: stack(b,i)
STEP 22: pick-up(g)
STEP 23: stack(g,b)
STEP 24: unstack(a,q)
STEP 25: stack(a,g)
STEP 26: unstack(q,p)
STEP 27: stack(q,a)
STEP 28: pick-up(p)
STEP 29: put-down(p)
STEP 30: unstack(q,a)
STEP 31: stack(q,a)
STEP 32: pick-up(p)
STEP 33: put-down(p)
STEP 34: pick-up(p)
STEP 35: put-down(p)
STEP 36: pick-up(m)
STEP 37: stack(m,q)
STEP 38: pick-up(p)
STEP 39: put-down(p)
STEP 40: unstack(m,q)
STEP 41: stack(m,p)
STEP 42: unstack(q,a)
STEP 43: stack(q,j)
STEP 44: unstack(m,p)
STEP 45: stack(m,q)
STEP 46: pick-up(p)
STEP 47: stack(p,a)
STEP 48: unstack(m,q)
STEP 49: stack(m,p)
STEP 50: unstack(q,j)
STEP 51: put-down(q)
STEP 52: unstack(j,e)
STEP 53: put-down(j)
STEP 54: unstack(e,l)
STEP 55: stack(e,m)
STEP 56: unstack(e,m)
STEP 57: stack(e,l)
STEP 58: unstack(m,p)
STEP 59: stack(m,q)
STEP 60: unstack(p,a)
STEP 61: put-down(p)
STEP 62: unstack(a,g)
STEP 63: stack(a,g)
STEP 64: pick-up(p)
STEP 65: stack(p,a)
STEP 66: unstack(m,q)
STEP 67: stack(m,p)
STEP 68: unstack(e,l)
STEP 69: stack(e,m)
STEP 70: unstack(e,m)
STEP 71: stack(e,m)
STEP 72: unstack(e,m)
STEP 73: stack(e,l)
STEP 74: unstack(m,p)
STEP 75: stack(m,q)
STEP 76: unstack(p,a)
STEP 77: put-down(p)
STEP 78: unstack(a,g)
STEP 79: stack(a,p)
STEP 80: unstack(g,b)
STEP 81: put-down(g)
STEP 82: unstack(b,i)
STEP 83: stack(b,g)
STEP 84: unstack(i,k)
STEP 85: stack(i,b)
STEP 86: unstack(k,f)
STEP 87: stack(k,a)
STEP 88: unstack(f,d)
STEP 89: stack(f,j)
STEP 90: unstack(d,c)
STEP 91: stack(d,k)
STEP 92: unstack(c,o)
STEP 93: stack(c,e)
STEP 94: unstack(f,j)
STEP 95: stack(f,d)
STEP 96: unstack(f,d)
STEP 97: stack(f,d)
STEP 98: unstack(f,d)
STEP 99: stack(f,j)
STEP 100: unstack(d,k)
STEP 101: put-down(d)
STEP 102: unstack(f,j)
STEP 103: stack(f,d)
STEP 104: unstack(k,a)
STEP 105: stack(k,f)
STEP 106: unstack(i,b)
STEP 107: stack(i,k)
STEP 108: unstack(b,g)
STEP 109: stack(b,i)
STEP 110: pick-up(g)
STEP 111: stack(g,b)
STEP 112: unstack(a,p)
STEP 113: stack(a,g)
STEP 114: pick-up(p)
STEP 115: stack(p,a)
STEP 116: unstack(m,q)
STEP 117: stack(m,p)
STEP 118: unstack(c,e)
STEP 119: stack(c,e)
STEP 120: unstack(c,e)
STEP 121: stack(c,e)
STEP 122: unstack(c,e)
STEP 123: stack(c,j)
STEP 124: unstack(e,l)
STEP 125: stack(e,m)
STEP 126: unstack(c,j)
STEP 127: stack(c,e)
STEP 128: unstack(l,h)
STEP 129: stack(l,o)
STEP 130: unstack(h,n)
STEP 131: stack(h,c)
STEP 132: pick-up(j)
STEP 133: stack(j,h)
STEP 134: unstack(l,o)
STEP 135: stack(l,n)
STEP 136: pick-up(o)
STEP 137: stack(o,j)
STEP 138: unstack(l,n)
STEP 139: stack(l,o)
STEP 140: pick-up(n)
STEP 141: stack(n,l)
STEP 142: pick-up(q)
STEP 143: stack(q,n)
144 actions in the plan.
total time 7.44 preprocess 0.07
total size 2.465 GB
max. learned clause length 3449
t val conflicts decisions
5 0 0 0
7 0 0 0
10 0 0 0
14 0 0 0
20 0 1 1
28 0 129 168
40 -1 1565 2512
56 -1 1503 2868
80 -1 1442 3591
113 -1 1381 3673
160 -1 1321 3797
226 1 1217 3527