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

112 lines
2.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-20.pddlignoring --stats
ignoring --verbose
Domain: blocks
Problem: blocks-10-1
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 0: 131 variables
0 UNSAT (0 decisions 0 conflicts)
Horizon 5: 1886 variables
5 UNSAT (0 decisions 0 conflicts)
Horizon 10: 3641 variables
10 UNSAT (0 decisions 0 conflicts)
Horizon 15: 5396 variables
15 UNSAT (0 decisions 0 conflicts)
Horizon 20: 7151 variables
Allocated 32 MB (total 537 MB)
20 UNSAT (20 decisions 13 conflicts)
Horizon 25: 8906 variables
Horizon 30: 10661 variables
Horizon 35: 12416 variables
Horizon 40: 14171 variables
Horizon 45: 15926 variables
Horizon 50: 17681 variables
Horizon 55: 19436 variables
25 UNSAT (648 decisions 413 conflicts)
Horizon 60: 21191 variables
Horizon 65: 22946 variables
Horizon 70: 24701 variables
Horizon 75: 26456 variables
Horizon 80: 28211 variables
SAT (654 decisions 268 conflicts)
PLAN FOUND: 60 steps
STEP 0: unstack(c,g)
STEP 1: stack(c,f)
STEP 2: unstack(g,e)
STEP 3: stack(g,c)
STEP 4: unstack(e,i)
STEP 5: put-down(e)
STEP 6: unstack(i,j)
STEP 7: stack(i,e)
STEP 8: unstack(g,c)
STEP 9: stack(g,j)
STEP 10: unstack(g,j)
STEP 11: stack(g,j)
STEP 12: unstack(c,f)
STEP 13: put-down(c)
STEP 14: unstack(f,d)
STEP 15: stack(f,c)
STEP 16: unstack(d,h)
STEP 17: stack(d,i)
STEP 18: pick-up(h)
STEP 19: stack(h,g)
STEP 20: unstack(d,i)
STEP 21: put-down(d)
STEP 22: unstack(i,e)
STEP 23: stack(i,f)
STEP 24: pick-up(e)
STEP 25: stack(e,h)
STEP 26: unstack(e,h)
STEP 27: stack(e,d)
STEP 28: unstack(h,g)
STEP 29: put-down(h)
STEP 30: unstack(g,j)
STEP 31: stack(g,i)
STEP 32: unstack(j,a)
STEP 33: put-down(j)
STEP 34: unstack(g,i)
STEP 35: stack(g,j)
STEP 36: pick-up(h)
STEP 37: stack(h,g)
STEP 38: unstack(e,d)
STEP 39: stack(e,h)
STEP 40: unstack(a,b)
STEP 41: stack(a,e)
STEP 42: unstack(i,f)
STEP 43: stack(i,a)
STEP 44: unstack(f,c)
STEP 45: stack(f,i)
STEP 46: pick-up(d)
STEP 47: stack(d,f)
STEP 48: pick-up(b)
STEP 49: stack(b,d)
STEP 50: pick-up(c)
STEP 51: stack(c,b)
52 actions in the plan.
total time 0.30 preprocess 0.02
total size 1.505 GB
max. learned clause length 1548
t val conflicts decisions
0 0 0 0
5 0 0 0
10 0 0 0
15 0 0 0
20 0 13 20
25 0 413 648
30 -1 664 1207
35 -1 604 1125
40 -1 540 1072
45 -1 480 1040
50 -1 421 970
55 -1 361 913
60 1 268 654