187 lines
4.3 KiB
Plaintext
187 lines
4.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-30.pddlignoring --stats
|
|
ignoring --verbose
|
|
|
|
Domain: blocks
|
|
Problem: blocks-14-1
|
|
Parser: 420 ground actions and 239 state variables
|
|
Invariants: 0 1 2 3 4 5 0.03 secs
|
|
Goal: conjunctive
|
|
Simplified: 420 ground actions and 239 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 124 MB)
|
|
Horizon 5: 3534 variables
|
|
5 UNSAT (0 decisions 0 conflicts)
|
|
Horizon 7: 4852 variables
|
|
7 UNSAT (0 decisions 0 conflicts)
|
|
Horizon 10: 6829 variables
|
|
10 UNSAT (0 decisions 0 conflicts)
|
|
Horizon 14: 9465 variables
|
|
14 UNSAT (0 decisions 0 conflicts)
|
|
Horizon 20: 13419 variables
|
|
Allocated 32 MB (total 540 MB)
|
|
20 UNSAT (42 decisions 39 conflicts)
|
|
Horizon 28: 18691 variables
|
|
Horizon 40: 26599 variables
|
|
Horizon 56: 37143 variables
|
|
Horizon 80: 52959 variables
|
|
Horizon 113: 74706 variables
|
|
Horizon 160: 105679 variables
|
|
Horizon 226: 149173 variables
|
|
Horizon 320: 211119 variables
|
|
SAT (509 decisions 161 conflicts)
|
|
PLAN FOUND: 160 steps
|
|
STEP 0: pick-up(n)
|
|
STEP 1: stack(n,c)
|
|
STEP 2: unstack(i,d)
|
|
STEP 3: stack(i,g)
|
|
STEP 4: unstack(d,l)
|
|
STEP 5: put-down(d)
|
|
STEP 6: unstack(l,m)
|
|
STEP 7: stack(l,n)
|
|
STEP 8: unstack(h,f)
|
|
STEP 9: stack(h,f)
|
|
STEP 10: unstack(l,n)
|
|
STEP 11: stack(l,n)
|
|
STEP 12: unstack(l,n)
|
|
STEP 13: stack(l,n)
|
|
STEP 14: unstack(h,f)
|
|
STEP 15: stack(h,f)
|
|
STEP 16: unstack(l,n)
|
|
STEP 17: stack(l,n)
|
|
STEP 18: unstack(l,n)
|
|
STEP 19: stack(l,h)
|
|
STEP 20: unstack(n,c)
|
|
STEP 21: put-down(n)
|
|
STEP 22: unstack(c,e)
|
|
STEP 23: put-down(c)
|
|
STEP 24: pick-up(n)
|
|
STEP 25: stack(n,c)
|
|
STEP 26: unstack(l,h)
|
|
STEP 27: stack(l,n)
|
|
STEP 28: pick-up(e)
|
|
STEP 29: stack(e,l)
|
|
STEP 30: unstack(i,g)
|
|
STEP 31: stack(i,e)
|
|
STEP 32: unstack(h,f)
|
|
STEP 33: stack(h,d)
|
|
STEP 34: unstack(f,a)
|
|
STEP 35: stack(f,g)
|
|
STEP 36: unstack(a,k)
|
|
STEP 37: stack(a,i)
|
|
STEP 38: unstack(k,b)
|
|
STEP 39: stack(k,f)
|
|
STEP 40: unstack(h,d)
|
|
STEP 41: put-down(h)
|
|
STEP 42: pick-up(d)
|
|
STEP 43: stack(d,b)
|
|
STEP 44: pick-up(m)
|
|
STEP 45: stack(m,d)
|
|
STEP 46: unstack(k,f)
|
|
STEP 47: stack(k,f)
|
|
STEP 48: pick-up(h)
|
|
STEP 49: stack(h,m)
|
|
STEP 50: unstack(h,m)
|
|
STEP 51: put-down(h)
|
|
STEP 52: unstack(m,d)
|
|
STEP 53: stack(m,k)
|
|
STEP 54: pick-up(h)
|
|
STEP 55: stack(h,d)
|
|
STEP 56: unstack(m,k)
|
|
STEP 57: put-down(m)
|
|
STEP 58: unstack(k,f)
|
|
STEP 59: put-down(k)
|
|
STEP 60: unstack(h,d)
|
|
STEP 61: stack(h,f)
|
|
STEP 62: pick-up(m)
|
|
STEP 63: stack(m,k)
|
|
STEP 64: unstack(h,f)
|
|
STEP 65: stack(h,m)
|
|
STEP 66: unstack(f,g)
|
|
STEP 67: stack(f,g)
|
|
STEP 68: unstack(f,g)
|
|
STEP 69: stack(f,d)
|
|
STEP 70: unstack(g,j)
|
|
STEP 71: stack(g,a)
|
|
STEP 72: unstack(f,d)
|
|
STEP 73: stack(f,g)
|
|
STEP 74: unstack(d,b)
|
|
STEP 75: put-down(d)
|
|
STEP 76: pick-up(b)
|
|
STEP 77: stack(b,h)
|
|
STEP 78: pick-up(d)
|
|
STEP 79: put-down(d)
|
|
STEP 80: unstack(b,h)
|
|
STEP 81: stack(b,f)
|
|
STEP 82: pick-up(d)
|
|
STEP 83: stack(d,b)
|
|
STEP 84: pick-up(j)
|
|
STEP 85: stack(j,d)
|
|
STEP 86: unstack(h,m)
|
|
STEP 87: stack(h,j)
|
|
STEP 88: unstack(m,k)
|
|
STEP 89: put-down(m)
|
|
STEP 90: pick-up(k)
|
|
STEP 91: stack(k,m)
|
|
STEP 92: unstack(h,j)
|
|
STEP 93: put-down(h)
|
|
STEP 94: unstack(j,d)
|
|
STEP 95: stack(j,d)
|
|
STEP 96: unstack(k,m)
|
|
STEP 97: put-down(k)
|
|
STEP 98: unstack(j,d)
|
|
STEP 99: put-down(j)
|
|
STEP 100: pick-up(h)
|
|
STEP 101: stack(h,d)
|
|
STEP 102: pick-up(m)
|
|
STEP 103: stack(m,j)
|
|
STEP 104: pick-up(k)
|
|
STEP 105: stack(k,h)
|
|
STEP 106: unstack(m,j)
|
|
STEP 107: stack(m,j)
|
|
STEP 108: unstack(k,h)
|
|
STEP 109: stack(k,m)
|
|
STEP 110: unstack(h,d)
|
|
STEP 111: put-down(h)
|
|
STEP 112: unstack(d,b)
|
|
STEP 113: put-down(d)
|
|
STEP 114: unstack(b,f)
|
|
STEP 115: stack(b,h)
|
|
STEP 116: unstack(k,m)
|
|
STEP 117: stack(k,f)
|
|
STEP 118: unstack(m,j)
|
|
STEP 119: stack(m,k)
|
|
STEP 120: pick-up(j)
|
|
STEP 121: put-down(j)
|
|
STEP 122: pick-up(d)
|
|
STEP 123: put-down(d)
|
|
STEP 124: unstack(b,h)
|
|
STEP 125: stack(b,d)
|
|
STEP 126: pick-up(h)
|
|
STEP 127: stack(h,m)
|
|
STEP 128: unstack(b,d)
|
|
STEP 129: stack(b,h)
|
|
STEP 130: pick-up(d)
|
|
STEP 131: stack(d,b)
|
|
STEP 132: pick-up(j)
|
|
STEP 133: stack(j,d)
|
|
134 actions in the plan.
|
|
total time 0.38 preprocess 0.05
|
|
total size 1.239 GB
|
|
max. learned clause length 1345
|
|
t val conflicts decisions
|
|
5 0 0 0
|
|
7 0 0 0
|
|
10 0 0 0
|
|
14 0 0 0
|
|
20 0 39 42
|
|
28 -1 484 774
|
|
40 -1 421 784
|
|
56 -1 360 776
|
|
80 -1 300 744
|
|
113 -1 240 599
|
|
160 1 161 509
|
|
|