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

104 lines
2.5 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-27.pddlignoring --stats
ignoring --verbose
Domain: blocks
Problem: blocks-13-0
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 5: 3074 variables
5 UNSAT (0 decisions 0 conflicts)
Horizon 7: 4220 variables
7 UNSAT (0 decisions 0 conflicts)
Horizon 10: 5939 variables
10 UNSAT (0 decisions 0 conflicts)
Horizon 14: 8231 variables
14 UNSAT (0 decisions 0 conflicts)
Horizon 20: 11669 variables
20 UNSAT (0 decisions 0 conflicts)
Horizon 28: 16253 variables
Allocated 32 MB (total 617 MB)
28 UNSAT (14 decisions 11 conflicts)
Horizon 40: 23129 variables
Horizon 56: 32297 variables
Horizon 80: 46049 variables
SAT (102 decisions 27 conflicts)
PLAN FOUND: 80 steps
STEP 0: unstack(b,f)
STEP 1: stack(b,i)
STEP 2: unstack(f,d)
STEP 3: put-down(f)
STEP 4: unstack(d,c)
STEP 5: put-down(d)
STEP 6: unstack(c,j)
STEP 7: stack(c,f)
STEP 8: unstack(j,a)
STEP 9: stack(j,d)
STEP 10: unstack(a,e)
STEP 11: stack(a,b)
STEP 12: unstack(e,h)
STEP 13: stack(e,m)
STEP 14: unstack(h,l)
STEP 15: put-down(h)
STEP 16: unstack(l,k)
STEP 17: stack(l,e)
STEP 18: unstack(a,b)
STEP 19: stack(a,h)
STEP 20: unstack(b,i)
STEP 21: stack(b,k)
STEP 22: unstack(j,d)
STEP 23: stack(j,b)
STEP 24: unstack(l,e)
STEP 25: stack(l,j)
STEP 26: unstack(e,m)
STEP 27: stack(e,l)
STEP 28: unstack(a,h)
STEP 29: stack(a,m)
STEP 30: pick-up(h)
STEP 31: stack(h,e)
STEP 32: unstack(a,m)
STEP 33: stack(a,m)
STEP 34: unstack(a,m)
STEP 35: put-down(a)
STEP 36: pick-up(m)
STEP 37: stack(m,h)
STEP 38: pick-up(a)
STEP 39: stack(a,m)
STEP 40: unstack(i,g)
STEP 41: stack(i,g)
STEP 42: unstack(c,f)
STEP 43: stack(c,d)
STEP 44: pick-up(f)
STEP 45: stack(f,a)
STEP 46: unstack(c,d)
STEP 47: stack(c,i)
STEP 48: pick-up(d)
STEP 49: stack(d,f)
STEP 50: unstack(c,i)
STEP 51: stack(c,d)
STEP 52: unstack(i,g)
STEP 53: stack(i,c)
STEP 54: pick-up(g)
STEP 55: stack(g,i)
56 actions in the plan.
total time 0.12 preprocess 0.04
total size 0.905 GB
max. learned clause length 593
t val conflicts decisions
5 0 0 0
7 0 0 0
10 0 0 0
14 0 0 0
20 0 0 0
28 0 11 14
40 -1 180 431
56 -1 120 337
80 1 27 102