181 lines
4.2 KiB
Plaintext
181 lines
4.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-29.pddlignoring --stats
|
|
ignoring --verbose
|
|
|
|
Domain: blocks
|
|
Problem: blocks-14-0
|
|
Parser: 420 ground actions and 239 state variables
|
|
Invariants: 0 1 2 3 4 5 0.04 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.02 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 (13 decisions 11 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
|
|
Allocated 32 MB permanent (total 1317 MB)
|
|
Horizon 452: 298107 variables
|
|
SAT (503 decisions 103 conflicts)
|
|
PLAN FOUND: 320 steps
|
|
STEP 0: unstack(a,j)
|
|
STEP 1: stack(a,f)
|
|
STEP 2: unstack(a,f)
|
|
STEP 3: stack(a,f)
|
|
STEP 4: unstack(j,h)
|
|
STEP 5: put-down(j)
|
|
STEP 6: unstack(a,f)
|
|
STEP 7: stack(a,h)
|
|
STEP 8: unstack(a,h)
|
|
STEP 9: stack(a,h)
|
|
STEP 10: unstack(g,d)
|
|
STEP 11: put-down(g)
|
|
STEP 12: unstack(d,i)
|
|
STEP 13: stack(d,a)
|
|
STEP 14: pick-up(g)
|
|
STEP 15: put-down(g)
|
|
STEP 16: unstack(d,a)
|
|
STEP 17: put-down(d)
|
|
STEP 18: pick-up(g)
|
|
STEP 19: stack(g,d)
|
|
STEP 20: unstack(a,h)
|
|
STEP 21: stack(a,h)
|
|
STEP 22: unstack(a,h)
|
|
STEP 23: stack(a,i)
|
|
STEP 24: unstack(h,m)
|
|
STEP 25: put-down(h)
|
|
STEP 26: unstack(a,i)
|
|
STEP 27: stack(a,h)
|
|
STEP 28: unstack(m,k)
|
|
STEP 29: stack(m,a)
|
|
STEP 30: unstack(i,n)
|
|
STEP 31: put-down(i)
|
|
STEP 32: unstack(k,c)
|
|
STEP 33: stack(k,g)
|
|
STEP 34: unstack(c,l)
|
|
STEP 35: stack(c,k)
|
|
STEP 36: unstack(l,b)
|
|
STEP 37: put-down(l)
|
|
STEP 38: pick-up(n)
|
|
STEP 39: stack(n,c)
|
|
STEP 40: pick-up(j)
|
|
STEP 41: stack(j,m)
|
|
STEP 42: unstack(b,e)
|
|
STEP 43: stack(b,i)
|
|
STEP 44: pick-up(f)
|
|
STEP 45: stack(f,b)
|
|
STEP 46: unstack(n,c)
|
|
STEP 47: stack(n,f)
|
|
STEP 48: pick-up(l)
|
|
STEP 49: put-down(l)
|
|
STEP 50: unstack(c,k)
|
|
STEP 51: stack(c,e)
|
|
STEP 52: unstack(n,f)
|
|
STEP 53: stack(n,j)
|
|
STEP 54: pick-up(l)
|
|
STEP 55: stack(l,f)
|
|
STEP 56: unstack(c,e)
|
|
STEP 57: put-down(c)
|
|
STEP 58: unstack(n,j)
|
|
STEP 59: put-down(n)
|
|
STEP 60: unstack(j,m)
|
|
STEP 61: stack(j,m)
|
|
STEP 62: unstack(k,g)
|
|
STEP 63: stack(k,g)
|
|
STEP 64: pick-up(n)
|
|
STEP 65: stack(n,l)
|
|
STEP 66: pick-up(c)
|
|
STEP 67: stack(c,k)
|
|
STEP 68: unstack(n,l)
|
|
STEP 69: put-down(n)
|
|
STEP 70: unstack(j,m)
|
|
STEP 71: stack(j,n)
|
|
STEP 72: unstack(c,k)
|
|
STEP 73: put-down(c)
|
|
STEP 74: unstack(k,g)
|
|
STEP 75: stack(k,e)
|
|
STEP 76: unstack(g,d)
|
|
STEP 77: stack(g,k)
|
|
STEP 78: pick-up(d)
|
|
STEP 79: stack(d,m)
|
|
STEP 80: unstack(g,k)
|
|
STEP 81: stack(g,d)
|
|
STEP 82: unstack(k,e)
|
|
STEP 83: stack(k,g)
|
|
STEP 84: pick-up(c)
|
|
STEP 85: stack(c,k)
|
|
STEP 86: unstack(j,n)
|
|
STEP 87: stack(j,e)
|
|
STEP 88: pick-up(n)
|
|
STEP 89: stack(n,c)
|
|
STEP 90: unstack(j,e)
|
|
STEP 91: stack(j,n)
|
|
STEP 92: unstack(l,f)
|
|
STEP 93: put-down(l)
|
|
STEP 94: pick-up(e)
|
|
STEP 95: stack(e,l)
|
|
STEP 96: unstack(f,b)
|
|
STEP 97: stack(f,e)
|
|
STEP 98: unstack(b,i)
|
|
STEP 99: stack(b,j)
|
|
STEP 100: pick-up(i)
|
|
STEP 101: put-down(i)
|
|
STEP 102: unstack(f,e)
|
|
STEP 103: stack(f,b)
|
|
STEP 104: unstack(f,b)
|
|
STEP 105: stack(f,e)
|
|
STEP 106: unstack(b,j)
|
|
STEP 107: stack(b,f)
|
|
STEP 108: unstack(j,n)
|
|
STEP 109: stack(j,b)
|
|
STEP 110: pick-up(i)
|
|
STEP 111: stack(i,n)
|
|
STEP 112: unstack(j,b)
|
|
STEP 113: stack(j,i)
|
|
STEP 114: unstack(b,f)
|
|
STEP 115: stack(b,j)
|
|
STEP 116: unstack(f,e)
|
|
STEP 117: stack(f,b)
|
|
STEP 118: unstack(e,l)
|
|
STEP 119: put-down(e)
|
|
STEP 120: pick-up(l)
|
|
STEP 121: stack(l,f)
|
|
STEP 122: pick-up(e)
|
|
STEP 123: stack(e,l)
|
|
124 actions in the plan.
|
|
total time 0.50 preprocess 0.06
|
|
total size 1.362 GB
|
|
max. learned clause length 2899
|
|
t val conflicts decisions
|
|
5 0 0 0
|
|
7 0 0 0
|
|
10 0 0 0
|
|
14 0 0 0
|
|
20 0 11 13
|
|
28 -1 544 909
|
|
40 -1 480 979
|
|
56 -1 421 829
|
|
80 -1 361 820
|
|
113 -1 300 641
|
|
160 -1 240 587
|
|
226 -1 180 470
|
|
320 1 103 503
|
|
|