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-22.pddlignoring --stats
ignoring --verbose
Domain: blocks
Problem: blocks-11-0
Parser: 264 ground actions and 155 state variables
Invariants: 0 1 2 3 4 5 0.01 secs
Goal: conjunctive
Simplified: 264 ground actions and 155 state variables
Actions: STRIPS
Disabling graph %: 10 20 30 40 50 60 70 80 90 100 0.00 secs (max SCC size 1)
Plan type: E-step
Allocated 32 MB permanent (total 123 MB)
Horizon 5: 2250 variables
5 UNSAT (0 decisions 0 conflicts)
Horizon 7: 3088 variables
7 UNSAT (0 decisions 0 conflicts)
Horizon 10: 4345 variables
10 UNSAT (0 decisions 0 conflicts)
Horizon 14: 6021 variables
14 UNSAT (0 decisions 0 conflicts)
Horizon 20: 8535 variables
Allocated 32 MB (total 538 MB)
Horizon 28: 11887 variables
20 UNSAT (110 decisions 86 conflicts)
Horizon 40: 16915 variables
Horizon 56: 23619 variables
Horizon 80: 33675 variables
SAT (105 decisions 40 conflicts)
PLAN FOUND: 80 steps
STEP 0: unstack(b,g)
STEP 1: stack(b,c)
STEP 2: unstack(g,h)
STEP 3: stack(g,h)
STEP 4: unstack(b,c)
STEP 5: stack(b,j)
STEP 6: unstack(g,h)
STEP 7: stack(g,c)
STEP 8: unstack(g,c)
STEP 9: stack(g,c)
STEP 10: unstack(g,c)
STEP 11: stack(g,c)
STEP 12: unstack(g,c)
STEP 13: stack(g,c)
STEP 14: unstack(g,c)
STEP 15: stack(g,b)
STEP 16: unstack(c,e)
STEP 17: stack(c,h)
STEP 18: unstack(g,b)
STEP 19: stack(g,c)
STEP 20: pick-up(e)
STEP 21: stack(e,g)
STEP 22: unstack(e,g)
STEP 23: put-down(e)
STEP 24: unstack(g,c)
STEP 25: stack(g,b)
STEP 26: unstack(c,h)
STEP 27: stack(c,h)
STEP 28: unstack(g,b)
STEP 29: stack(g,c)
STEP 30: pick-up(e)
STEP 31: stack(e,g)
STEP 32: unstack(e,g)
STEP 33: stack(e,g)
STEP 34: unstack(e,g)
STEP 35: put-down(e)
STEP 36: unstack(g,c)
STEP 37: stack(g,c)
STEP 38: pick-up(e)
STEP 39: stack(e,g)
STEP 40: unstack(e,g)
STEP 41: stack(e,g)
STEP 42: unstack(e,g)
STEP 43: stack(e,g)
STEP 44: unstack(e,g)
STEP 45: put-down(e)
STEP 46: unstack(g,c)
STEP 47: stack(g,b)
STEP 48: unstack(c,h)
STEP 49: put-down(c)
STEP 50: unstack(g,b)
STEP 51: stack(g,c)
STEP 52: pick-up(e)
STEP 53: stack(e,g)
STEP 54: unstack(h,k)
STEP 55: stack(h,b)
STEP 56: unstack(k,a)
STEP 57: put-down(k)
STEP 58: unstack(a,f)
STEP 59: stack(a,h)
STEP 60: unstack(f,i)
STEP 61: stack(f,e)
STEP 62: pick-up(i)
STEP 63: stack(i,f)
STEP 64: pick-up(k)
STEP 65: stack(k,i)
STEP 66: unstack(a,h)
STEP 67: put-down(a)
STEP 68: unstack(h,b)
STEP 69: stack(h,k)
STEP 70: unstack(b,j)
STEP 71: stack(b,h)
STEP 72: unstack(j,d)
STEP 73: stack(j,a)
STEP 74: pick-up(d)
STEP 75: stack(d,b)
STEP 76: unstack(j,a)
STEP 77: stack(j,d)
STEP 78: pick-up(a)
STEP 79: stack(a,j)
80 actions in the plan.
total time 0.10 preprocess 0.02
total size 0.902 GB
max. learned clause length 838
t val conflicts decisions
5 0 0 0
7 0 0 0
10 0 0 0
14 0 0 0
20 0 86 110
28 -1 241 368
40 -1 180 356
56 -1 120 225
80 1 40 105