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

192 lines
4.7 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-31.pddlignoring --stats
ignoring --verbose
Domain: blocks
Problem: blocks-15-0
Parser: 480 ground actions and 271 state variables
Invariants: 0 1 2 3 4 5 0.03 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.01 secs (max SCC size 1)
Plan type: E-step
Allocated 32 MB permanent (total 125 MB)
Horizon 5: 4026 variables
5 UNSAT (0 decisions 0 conflicts)
Horizon 7: 5528 variables
7 UNSAT (0 decisions 0 conflicts)
Horizon 10: 7781 variables
10 UNSAT (0 decisions 0 conflicts)
Horizon 14: 10785 variables
14 UNSAT (0 decisions 0 conflicts)
Horizon 20: 15291 variables
Allocated 32 MB (total 541 MB)
20 UNSAT (3 decisions 3 conflicts)
Horizon 28: 21299 variables
Horizon 40: 30311 variables
Horizon 56: 42327 variables
Horizon 80: 60351 variables
Horizon 113: 85134 variables
Horizon 160: 120431 variables
Horizon 226: 169997 variables
Allocated 32 MB permanent (total 1229 MB)
Horizon 320: 240591 variables
Horizon 452: 339723 variables
28 UNSAT (822 decisions 508 conflicts)
Allocated 32 MB permanent (total 1463 MB)
Horizon 640: 480911 variables
Allocated 32 MB permanent (total 1611 MB)
Horizon 905: 679926 variables
Allocated 32 MB permanent (total 1776 MB)
Horizon 1280: 961551 variables
Allocated 32 MB permanent (total 1965 MB)
Allocated 32 MB permanent (total 1997 MB)
Horizon 1810: 1359581 variables
Allocated 32 MB permanent (total 2219 MB)
Allocated 32 MB permanent (total 2251 MB)
Horizon 2560: 1922831 variables
SAT (2159 decisions 827 conflicts)
PLAN FOUND: 160 steps
STEP 0: unstack(e,j)
STEP 1: stack(e,b)
STEP 2: unstack(j,d)
STEP 3: stack(j,d)
STEP 4: unstack(e,b)
STEP 5: put-down(e)
STEP 6: unstack(b,a)
STEP 7: stack(b,e)
STEP 8: unstack(a,o)
STEP 9: stack(a,b)
STEP 10: unstack(j,d)
STEP 11: stack(j,i)
STEP 12: unstack(d,l)
STEP 13: put-down(d)
STEP 14: unstack(l,c)
STEP 15: stack(l,j)
STEP 16: unstack(m,n)
STEP 17: stack(m,o)
STEP 18: pick-up(d)
STEP 19: stack(d,n)
STEP 20: unstack(l,j)
STEP 21: stack(l,d)
STEP 22: unstack(j,i)
STEP 23: stack(j,m)
STEP 24: unstack(i,h)
STEP 25: stack(i,c)
STEP 26: unstack(l,d)
STEP 27: stack(l,j)
STEP 28: unstack(d,n)
STEP 29: put-down(d)
STEP 30: pick-up(n)
STEP 31: stack(n,i)
STEP 32: pick-up(d)
STEP 33: stack(d,n)
STEP 34: unstack(l,j)
STEP 35: stack(l,h)
STEP 36: unstack(j,m)
STEP 37: stack(j,d)
STEP 38: unstack(l,h)
STEP 39: stack(l,j)
STEP 40: unstack(a,b)
STEP 41: stack(a,b)
STEP 42: unstack(a,b)
STEP 43: stack(a,m)
STEP 44: unstack(b,e)
STEP 45: stack(b,l)
STEP 46: unstack(a,m)
STEP 47: stack(a,b)
STEP 48: pick-up(e)
STEP 49: stack(e,a)
STEP 50: unstack(f,k)
STEP 51: stack(f,e)
STEP 52: unstack(m,o)
STEP 53: stack(m,f)
STEP 54: pick-up(k)
STEP 55: stack(k,m)
STEP 56: pick-up(h)
STEP 57: stack(h,k)
STEP 58: pick-up(o)
STEP 59: stack(o,h)
STEP 60: unstack(o,h)
STEP 61: put-down(o)
STEP 62: unstack(h,k)
STEP 63: put-down(h)
STEP 64: unstack(k,m)
STEP 65: put-down(k)
STEP 66: unstack(m,f)
STEP 67: stack(m,o)
STEP 68: unstack(f,e)
STEP 69: stack(f,k)
STEP 70: unstack(e,a)
STEP 71: stack(e,f)
STEP 72: unstack(a,b)
STEP 73: stack(a,m)
STEP 74: unstack(b,l)
STEP 75: stack(b,e)
STEP 76: unstack(l,j)
STEP 77: stack(l,h)
STEP 78: unstack(j,d)
STEP 79: stack(j,b)
STEP 80: unstack(d,n)
STEP 81: put-down(d)
STEP 82: unstack(n,i)
STEP 83: stack(n,j)
STEP 84: unstack(i,c)
STEP 85: stack(i,l)
STEP 86: unstack(c,g)
STEP 87: put-down(c)
STEP 88: pick-up(g)
STEP 89: stack(g,n)
STEP 90: unstack(i,l)
STEP 91: stack(i,c)
STEP 92: pick-up(d)
STEP 93: put-down(d)
STEP 94: unstack(g,n)
STEP 95: stack(g,a)
STEP 96: unstack(n,j)
STEP 97: stack(n,i)
STEP 98: pick-up(d)
STEP 99: stack(d,n)
STEP 100: unstack(j,b)
STEP 101: stack(j,d)
STEP 102: unstack(l,h)
STEP 103: stack(l,j)
STEP 104: unstack(b,e)
STEP 105: stack(b,l)
STEP 106: unstack(g,a)
STEP 107: put-down(g)
STEP 108: unstack(a,m)
STEP 109: stack(a,b)
STEP 110: unstack(e,f)
STEP 111: stack(e,a)
STEP 112: unstack(f,k)
STEP 113: stack(f,e)
STEP 114: unstack(m,o)
STEP 115: stack(m,f)
STEP 116: pick-up(k)
STEP 117: stack(k,m)
STEP 118: pick-up(h)
STEP 119: stack(h,k)
STEP 120: pick-up(o)
STEP 121: stack(o,h)
STEP 122: pick-up(g)
STEP 123: stack(g,o)
124 actions in the plan.
total time 3.51 preprocess 0.05
total size 2.293 GB
max. learned clause length 1828
t val conflicts decisions
5 0 0 0
7 0 0 0
10 0 0 0
14 0 0 0
20 0 3 3
28 0 508 822
40 -1 1082 1797
56 -1 1022 1837
80 -1 960 2043
113 -1 900 2100
160 1 827 2159