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

157 lines
3.7 KiB
Plaintext

Madagascar 0.99999 25/02/2015 09:46:27 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.04 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 0: 271 variables
0 UNSAT (0 decisions 0 conflicts)
Horizon 5: 4026 variables
5 UNSAT (0 decisions 0 conflicts)
Horizon 10: 7781 variables
10 UNSAT (0 decisions 0 conflicts)
Horizon 15: 11536 variables
15 UNSAT (0 decisions 0 conflicts)
Horizon 20: 15291 variables
Allocated 32 MB (total 541 MB)
20 UNSAT (3 decisions 3 conflicts)
Horizon 25: 19046 variables
25 UNSAT (67 decisions 45 conflicts)
Horizon 30: 22801 variables
Horizon 35: 26556 variables
Horizon 40: 30311 variables
Horizon 45: 34066 variables
Horizon 50: 37821 variables
Horizon 55: 41576 variables
Horizon 60: 45331 variables
Horizon 65: 49086 variables
Horizon 70: 52841 variables
Horizon 75: 56596 variables
Horizon 80: 60351 variables
Horizon 85: 64106 variables
Horizon 90: 67861 variables
Horizon 95: 71616 variables
Allocated 32 MB permanent (total 1839 MB)
Horizon 100: 75371 variables
Horizon 105: 79126 variables
Horizon 110: 82881 variables
Horizon 115: 86636 variables
Horizon 120: 90391 variables
Horizon 125: 94146 variables
30 UNSAT (2698 decisions 1792 conflicts)
Horizon 130: 97901 variables
GC: 19.00 MB
Allocated 32 MB (total 2360 MB)
GC: 22.19 MB
SAT (1840 decisions 787 conflicts)
PLAN FOUND: 130 steps
STEP 0: unstack(e,j)
STEP 1: stack(e,b)
STEP 2: unstack(j,d)
STEP 3: stack(j,m)
STEP 4: unstack(d,l)
STEP 5: put-down(d)
STEP 6: unstack(l,c)
STEP 7: stack(l,j)
STEP 8: unstack(i,h)
STEP 9: stack(i,c)
STEP 10: unstack(i,c)
STEP 11: stack(i,e)
STEP 12: unstack(c,g)
STEP 13: put-down(c)
STEP 14: unstack(i,e)
STEP 15: stack(i,c)
STEP 16: unstack(f,k)
STEP 17: stack(f,d)
STEP 18: pick-up(k)
STEP 19: stack(k,h)
STEP 20: unstack(e,b)
STEP 21: stack(e,b)
STEP 22: unstack(f,d)
STEP 23: stack(f,e)
STEP 24: unstack(l,j)
STEP 25: stack(l,g)
STEP 26: unstack(j,m)
STEP 27: stack(j,d)
STEP 28: unstack(m,n)
STEP 29: stack(m,j)
STEP 30: pick-up(n)
STEP 31: stack(n,i)
STEP 32: unstack(l,g)
STEP 33: stack(l,g)
STEP 34: unstack(m,j)
STEP 35: stack(m,l)
STEP 36: unstack(j,d)
STEP 37: stack(j,m)
STEP 38: pick-up(d)
STEP 39: stack(d,n)
STEP 40: unstack(j,m)
STEP 41: stack(j,d)
STEP 42: unstack(m,l)
STEP 43: put-down(m)
STEP 44: unstack(l,g)
STEP 45: stack(l,j)
STEP 46: unstack(f,e)
STEP 47: stack(f,k)
STEP 48: unstack(e,b)
STEP 49: stack(e,g)
STEP 50: unstack(b,a)
STEP 51: stack(b,l)
STEP 52: unstack(a,o)
STEP 53: stack(a,b)
STEP 54: unstack(e,g)
STEP 55: stack(e,a)
STEP 56: unstack(f,k)
STEP 57: stack(f,e)
STEP 58: pick-up(m)
STEP 59: stack(m,f)
STEP 60: unstack(k,h)
STEP 61: stack(k,m)
STEP 62: pick-up(h)
STEP 63: stack(h,k)
STEP 64: pick-up(o)
STEP 65: stack(o,h)
STEP 66: pick-up(g)
STEP 67: stack(g,o)
68 actions in the plan.
total time 7.56 preprocess 0.06
total size 2.379 GB
max. learned clause length 4132
t val conflicts decisions
0 0 0 0
5 0 0 0
10 0 0 0
15 0 0 0
20 0 3 3
25 0 45 67
30 0 1792 2698
35 -1 5608 9000
40 -1 5126 8494
45 -1 4577 7737
50 -1 4154 7399
55 -1 3725 6706
60 -1 3364 6354
65 -1 3003 5912
70 -1 2702 5351
75 -1 2463 5092
80 -1 2221 4615
85 -1 1980 4038
90 -1 1801 3984
95 -1 1623 3694
100 -1 1500 3393
105 -1 1320 2882
110 -1 1200 2647
115 -1 1080 2486
120 -1 1021 2225
125 -1 900 2179
130 1 787 1840