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

131 lines
3.1 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-28.pddlignoring --stats
ignoring --verbose
Domain: blocks
Problem: blocks-13-1
Parser: 364 ground actions and 209 state variables
Invariants: 0 1 2 3 4 5 0.03 secs
Goal: conjunctive
Simplified: 364 ground actions and 209 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 124 MB)
Horizon 0: 209 variables
0 UNSAT (0 decisions 0 conflicts)
Horizon 5: 3074 variables
5 UNSAT (0 decisions 0 conflicts)
Horizon 10: 5939 variables
10 UNSAT (0 decisions 0 conflicts)
Horizon 15: 8804 variables
15 UNSAT (0 decisions 0 conflicts)
Horizon 20: 11669 variables
20 UNSAT (0 decisions 0 conflicts)
Horizon 25: 14534 variables
Allocated 32 MB (total 617 MB)
25 UNSAT (10 decisions 9 conflicts)
Horizon 30: 17399 variables
30 UNSAT (67 decisions 57 conflicts)
Horizon 35: 20264 variables
Horizon 40: 23129 variables
35 UNSAT (156 decisions 92 conflicts)
Horizon 45: 25994 variables
Horizon 50: 28859 variables
Horizon 55: 31724 variables
Horizon 60: 34589 variables
Horizon 65: 37454 variables
Horizon 70: 40319 variables
Horizon 75: 43184 variables
Horizon 80: 46049 variables
Horizon 85: 48914 variables
SAT (241 decisions 111 conflicts)
PLAN FOUND: 80 steps
STEP 0: unstack(b,k)
STEP 1: put-down(b)
STEP 2: pick-up(k)
STEP 3: put-down(k)
STEP 4: unstack(j,e)
STEP 5: put-down(j)
STEP 6: unstack(e,d)
STEP 7: put-down(e)
STEP 8: unstack(d,c)
STEP 9: stack(d,e)
STEP 10: unstack(c,a)
STEP 11: stack(c,j)
STEP 12: pick-up(k)
STEP 13: put-down(k)
STEP 14: unstack(a,l)
STEP 15: put-down(a)
STEP 16: unstack(l,h)
STEP 17: stack(l,d)
STEP 18: unstack(h,g)
STEP 19: stack(h,a)
STEP 20: pick-up(k)
STEP 21: stack(k,g)
STEP 22: unstack(k,g)
STEP 23: put-down(k)
STEP 24: unstack(g,m)
STEP 25: put-down(g)
STEP 26: unstack(h,a)
STEP 27: put-down(h)
STEP 28: unstack(m,i)
STEP 29: stack(m,c)
STEP 30: unstack(i,f)
STEP 31: stack(i,b)
STEP 32: pick-up(h)
STEP 33: stack(h,i)
STEP 34: pick-up(g)
STEP 35: stack(g,h)
STEP 36: pick-up(k)
STEP 37: stack(k,g)
STEP 38: pick-up(f)
STEP 39: stack(f,k)
STEP 40: unstack(l,d)
STEP 41: stack(l,a)
STEP 42: unstack(m,c)
STEP 43: put-down(m)
STEP 44: unstack(c,j)
STEP 45: put-down(c)
STEP 46: pick-up(j)
STEP 47: stack(j,f)
STEP 48: pick-up(c)
STEP 49: stack(c,j)
STEP 50: pick-up(m)
STEP 51: stack(m,c)
STEP 52: unstack(l,a)
STEP 53: stack(l,m)
STEP 54: unstack(d,e)
STEP 55: stack(d,a)
STEP 56: pick-up(e)
STEP 57: stack(e,l)
STEP 58: unstack(d,a)
STEP 59: put-down(d)
STEP 60: pick-up(a)
STEP 61: stack(a,e)
STEP 62: pick-up(d)
STEP 63: stack(d,a)
64 actions in the plan.
total time 0.40 preprocess 0.04
total size 1.593 GB
max. learned clause length 1965
t val conflicts decisions
0 0 0 0
5 0 0 0
10 0 0 0
15 0 0 0
20 0 0 0
25 0 9 10
30 0 57 67
35 0 92 156
40 -1 604 1468
45 -1 541 1203
50 -1 480 1061
55 -1 420 1036
60 -1 361 821
65 -1 301 643
70 -1 241 541
75 -1 180 373
80 1 111 241