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

115 lines
2.8 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-23.pddlignoring --stats
ignoring --verbose
Domain: blocks
Problem: blocks-11-1
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.01 secs (max SCC size 1)
Plan type: E-step
Allocated 32 MB permanent (total 123 MB)
Horizon 0: 155 variables
0 UNSAT (0 decisions 0 conflicts)
Horizon 5: 2250 variables
5 UNSAT (0 decisions 0 conflicts)
Horizon 10: 4345 variables
10 UNSAT (0 decisions 0 conflicts)
Horizon 15: 6440 variables
Allocated 32 MB (total 461 MB)
15 UNSAT (7 decisions 7 conflicts)
Horizon 20: 8535 variables
Horizon 25: 10630 variables
20 UNSAT (171 decisions 119 conflicts)
Horizon 30: 12725 variables
Horizon 35: 14820 variables
Horizon 40: 16915 variables
Horizon 45: 19010 variables
Horizon 50: 21105 variables
Horizon 55: 23200 variables
Horizon 60: 25295 variables
SAT (78 decisions 36 conflicts)
PLAN FOUND: 60 steps
STEP 0: unstack(d,c)
STEP 1: put-down(d)
STEP 2: unstack(g,b)
STEP 3: stack(g,j)
STEP 4: unstack(g,j)
STEP 5: stack(g,j)
STEP 6: unstack(c,h)
STEP 7: put-down(c)
STEP 8: unstack(f,e)
STEP 9: stack(f,g)
STEP 10: unstack(b,a)
STEP 11: stack(b,d)
STEP 12: pick-up(h)
STEP 13: stack(h,a)
STEP 14: unstack(f,g)
STEP 15: put-down(f)
STEP 16: unstack(e,k)
STEP 17: put-down(e)
STEP 18: unstack(g,j)
STEP 19: stack(g,h)
STEP 20: pick-up(c)
STEP 21: stack(c,f)
STEP 22: unstack(c,f)
STEP 23: stack(c,b)
STEP 24: unstack(j,i)
STEP 25: stack(j,k)
STEP 26: pick-up(i)
STEP 27: stack(i,e)
STEP 28: unstack(g,h)
STEP 29: stack(g,i)
STEP 30: pick-up(f)
STEP 31: stack(f,g)
STEP 32: unstack(c,b)
STEP 33: stack(c,f)
STEP 34: unstack(h,a)
STEP 35: stack(h,b)
STEP 36: pick-up(a)
STEP 37: stack(a,c)
STEP 38: unstack(h,b)
STEP 39: stack(h,a)
STEP 40: unstack(j,k)
STEP 41: stack(j,k)
STEP 42: unstack(j,k)
STEP 43: stack(j,k)
STEP 44: unstack(b,d)
STEP 45: put-down(b)
STEP 46: pick-up(d)
STEP 47: stack(d,j)
STEP 48: unstack(d,j)
STEP 49: put-down(d)
STEP 50: unstack(j,k)
STEP 51: stack(j,b)
STEP 52: pick-up(k)
STEP 53: stack(k,h)
STEP 54: unstack(j,b)
STEP 55: stack(j,k)
STEP 56: pick-up(d)
STEP 57: stack(d,j)
STEP 58: pick-up(b)
STEP 59: stack(b,d)
60 actions in the plan.
total time 0.22 preprocess 0.02
total size 1.203 GB
max. learned clause length 1017
t val conflicts decisions
0 0 0 0
5 0 0 0
10 0 0 0
15 0 7 7
20 0 119 171
25 -1 481 795
30 -1 421 726
35 -1 361 670
40 -1 300 542
45 -1 240 516
50 -1 181 392
55 -1 120 329
60 1 36 78