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

127 lines
3.0 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-21.pddlignoring --stats
ignoring --verbose
Domain: blocks
Problem: blocks-10-2
Parser: 220 ground actions and 131 state variables
Invariants: 0 1 2 3 4 5 0.01 secs
Goal: conjunctive
Simplified: 220 ground actions and 131 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 123 MB)
Horizon 5: 1886 variables
5 UNSAT (0 decisions 0 conflicts)
Horizon 7: 2588 variables
7 UNSAT (0 decisions 0 conflicts)
Horizon 10: 3641 variables
10 UNSAT (0 decisions 0 conflicts)
Horizon 14: 5045 variables
14 UNSAT (0 decisions 0 conflicts)
Horizon 20: 7151 variables
Allocated 32 MB (total 538 MB)
20 UNSAT (12 decisions 11 conflicts)
Horizon 28: 9959 variables
Horizon 40: 14171 variables
Horizon 56: 19787 variables
Horizon 80: 28211 variables
SAT (110 decisions 50 conflicts)
PLAN FOUND: 80 steps
STEP 0: unstack(j,i)
STEP 1: stack(j,c)
STEP 2: unstack(i,h)
STEP 3: put-down(i)
STEP 4: unstack(h,f)
STEP 5: put-down(h)
STEP 6: unstack(j,c)
STEP 7: stack(j,i)
STEP 8: unstack(j,i)
STEP 9: stack(j,c)
STEP 10: unstack(f,d)
STEP 11: stack(f,j)
STEP 12: unstack(f,j)
STEP 13: stack(f,j)
STEP 14: unstack(f,j)
STEP 15: stack(f,i)
STEP 16: unstack(j,c)
STEP 17: stack(j,d)
STEP 18: unstack(f,i)
STEP 19: stack(f,j)
STEP 20: pick-up(h)
STEP 21: stack(h,c)
STEP 22: unstack(f,j)
STEP 23: stack(f,j)
STEP 24: unstack(h,c)
STEP 25: put-down(h)
STEP 26: unstack(f,j)
STEP 27: stack(f,i)
STEP 28: unstack(j,d)
STEP 29: stack(j,d)
STEP 30: unstack(f,i)
STEP 31: stack(f,j)
STEP 32: unstack(f,j)
STEP 33: stack(f,i)
STEP 34: unstack(j,d)
STEP 35: stack(j,d)
STEP 36: unstack(f,i)
STEP 37: stack(f,j)
STEP 38: pick-up(c)
STEP 39: put-down(c)
STEP 40: unstack(f,j)
STEP 41: stack(f,i)
STEP 42: unstack(j,d)
STEP 43: stack(j,c)
STEP 44: unstack(d,e)
STEP 45: put-down(d)
STEP 46: unstack(j,c)
STEP 47: stack(j,d)
STEP 48: unstack(f,i)
STEP 49: stack(f,j)
STEP 50: pick-up(i)
STEP 51: put-down(i)
STEP 52: pick-up(h)
STEP 53: stack(h,c)
STEP 54: unstack(e,g)
STEP 55: stack(e,i)
STEP 56: unstack(g,b)
STEP 57: stack(g,h)
STEP 58: unstack(b,a)
STEP 59: put-down(b)
STEP 60: pick-up(a)
STEP 61: stack(a,f)
STEP 62: unstack(g,h)
STEP 63: stack(g,b)
STEP 64: unstack(h,c)
STEP 65: stack(h,g)
STEP 66: pick-up(c)
STEP 67: stack(c,a)
STEP 68: unstack(h,g)
STEP 69: stack(h,c)
STEP 70: unstack(g,b)
STEP 71: stack(g,h)
STEP 72: unstack(e,i)
STEP 73: put-down(e)
STEP 74: pick-up(i)
STEP 75: stack(i,g)
STEP 76: pick-up(e)
STEP 77: stack(e,i)
STEP 78: pick-up(b)
STEP 79: stack(b,e)
80 actions in the plan.
total time 0.08 preprocess 0.02
total size 0.900 GB
max. learned clause length 844
t val conflicts decisions
5 0 0 0
7 0 0 0
10 0 0 0
14 0 0 0
20 0 11 12
28 -1 240 428
40 -1 181 358
56 -1 120 250
80 1 50 110