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

155 lines
3.6 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-41.pddlignoring --stats
ignoring --verbose
Domain: blocks
Problem: blocks-20-0
Parser: 840 ground actions and 461 state variables
Invariants: 0 1 2 3 4 5 6 7 8 9 10 11 12 0.10 secs
Goal: conjunctive
Simplified: 840 ground actions and 461 state variables
Actions: STRIPS
Disabling graph %: 10 20 30 40 50 60 70 80 90 100 0.04 secs (max SCC size 1)
Plan type: E-step
Allocated 32 MB permanent (total 128 MB)
Horizon 5: 6966 variables
5 UNSAT (0 decisions 0 conflicts)
Horizon 7: 9568 variables
7 UNSAT (0 decisions 0 conflicts)
Horizon 10: 13471 variables
10 UNSAT (0 decisions 0 conflicts)
Horizon 14: 18675 variables
14 UNSAT (0 decisions 0 conflicts)
Horizon 20: 26481 variables
20 UNSAT (0 decisions 0 conflicts)
Horizon 28: 36889 variables
Allocated 32 MB (total 625 MB)
28 UNSAT (21 decisions 20 conflicts)
Horizon 40: 52501 variables
Horizon 56: 73317 variables
Horizon 80: 104541 variables
Horizon 113: 147474 variables
Horizon 160: 208621 variables
SAT (264 decisions 85 conflicts)
PLAN FOUND: 113 steps
STEP 0: unstack(s,c)
STEP 1: stack(s,n)
STEP 2: unstack(c,m)
STEP 3: put-down(c)
STEP 4: unstack(m,q)
STEP 5: stack(m,p)
STEP 6: unstack(q,b)
STEP 7: stack(q,m)
STEP 8: unstack(b,t)
STEP 9: stack(b,q)
STEP 10: unstack(t,j)
STEP 11: stack(t,s)
STEP 12: unstack(t,s)
STEP 13: put-down(t)
STEP 14: unstack(s,n)
STEP 15: stack(s,c)
STEP 16: pick-up(t)
STEP 17: stack(t,s)
STEP 18: unstack(b,q)
STEP 19: put-down(b)
STEP 20: unstack(j,l)
STEP 21: stack(j,t)
STEP 22: unstack(q,m)
STEP 23: stack(q,b)
STEP 24: unstack(m,p)
STEP 25: stack(m,p)
STEP 26: unstack(j,t)
STEP 27: put-down(j)
STEP 28: unstack(m,p)
STEP 29: stack(m,l)
STEP 30: unstack(p,r)
STEP 31: stack(p,t)
STEP 32: unstack(q,b)
STEP 33: stack(q,m)
STEP 34: pick-up(b)
STEP 35: stack(b,p)
STEP 36: unstack(q,m)
STEP 37: stack(q,b)
STEP 38: unstack(m,l)
STEP 39: stack(m,r)
STEP 40: unstack(l,e)
STEP 41: stack(l,n)
STEP 42: unstack(e,i)
STEP 43: put-down(e)
STEP 44: unstack(i,o)
STEP 45: stack(i,q)
STEP 46: unstack(m,r)
STEP 47: stack(m,i)
STEP 48: pick-up(j)
STEP 49: stack(j,r)
STEP 50: unstack(l,n)
STEP 51: stack(l,n)
STEP 52: unstack(o,g)
STEP 53: put-down(o)
STEP 54: unstack(j,r)
STEP 55: stack(j,e)
STEP 56: unstack(l,n)
STEP 57: stack(l,o)
STEP 58: unstack(g,f)
STEP 59: stack(g,j)
STEP 60: unstack(f,a)
STEP 61: stack(f,m)
STEP 62: unstack(l,o)
STEP 63: stack(l,r)
STEP 64: pick-up(o)
STEP 65: stack(o,a)
STEP 66: unstack(g,j)
STEP 67: put-down(g)
STEP 68: unstack(j,e)
STEP 69: stack(j,f)
STEP 70: unstack(l,r)
STEP 71: stack(l,j)
STEP 72: unstack(o,a)
STEP 73: put-down(o)
STEP 74: unstack(a,d)
STEP 75: stack(a,l)
STEP 76: pick-up(o)
STEP 77: stack(o,a)
STEP 78: pick-up(n)
STEP 79: stack(n,g)
STEP 80: pick-up(e)
STEP 81: stack(e,n)
STEP 82: unstack(d,h)
STEP 83: stack(d,r)
STEP 84: pick-up(h)
STEP 85: stack(h,o)
STEP 86: unstack(e,n)
STEP 87: put-down(e)
STEP 88: unstack(n,g)
STEP 89: stack(n,d)
STEP 90: pick-up(g)
STEP 91: stack(g,h)
STEP 92: unstack(n,d)
STEP 93: stack(n,e)
STEP 94: unstack(d,r)
STEP 95: stack(d,g)
STEP 96: unstack(r,k)
STEP 97: stack(r,d)
STEP 98: unstack(n,e)
STEP 99: stack(n,r)
STEP 100: pick-up(e)
STEP 101: stack(e,n)
STEP 102: pick-up(k)
STEP 103: stack(k,e)
104 actions in the plan.
total time 0.37 preprocess 0.16
total size 1.094 GB
max. learned clause length 2707
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 20 21
40 -1 300 483
56 -1 241 502
80 -1 180 409
113 1 85 264