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

116 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-30.pddlignoring --stats
ignoring --verbose
Domain: blocks
Problem: blocks-14-1
Parser: 420 ground actions and 239 state variables
Invariants: 0 1 2 3 4 5 0.03 secs
Goal: conjunctive
Simplified: 420 ground actions and 239 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 124 MB)
Horizon 0: 239 variables
0 UNSAT (0 decisions 0 conflicts)
Horizon 5: 3534 variables
5 UNSAT (0 decisions 0 conflicts)
Horizon 10: 6829 variables
10 UNSAT (0 decisions 0 conflicts)
Horizon 15: 10124 variables
15 UNSAT (0 decisions 0 conflicts)
Horizon 20: 13419 variables
Allocated 32 MB (total 540 MB)
20 UNSAT (42 decisions 39 conflicts)
Horizon 25: 16714 variables
Horizon 30: 20009 variables
Horizon 35: 23304 variables
Horizon 40: 26599 variables
Horizon 45: 29894 variables
Horizon 50: 33189 variables
Horizon 55: 36484 variables
Horizon 60: 39779 variables
Horizon 65: 43074 variables
SAT (247 decisions 85 conflicts)
PLAN FOUND: 60 steps
STEP 0: pick-up(n)
STEP 1: stack(n,c)
STEP 2: unstack(i,d)
STEP 3: stack(i,g)
STEP 4: unstack(d,l)
STEP 5: put-down(d)
STEP 6: unstack(l,m)
STEP 7: stack(l,n)
STEP 8: unstack(l,n)
STEP 9: stack(l,n)
STEP 10: unstack(h,f)
STEP 11: stack(h,d)
STEP 12: unstack(f,a)
STEP 13: stack(f,i)
STEP 14: unstack(l,n)
STEP 15: stack(l,n)
STEP 16: unstack(l,n)
STEP 17: stack(l,n)
STEP 18: unstack(l,n)
STEP 19: stack(l,n)
STEP 20: unstack(l,n)
STEP 21: stack(l,n)
STEP 22: unstack(l,n)
STEP 23: stack(l,n)
STEP 24: unstack(l,n)
STEP 25: stack(l,h)
STEP 26: unstack(n,c)
STEP 27: stack(n,l)
STEP 28: unstack(c,e)
STEP 29: put-down(c)
STEP 30: unstack(n,l)
STEP 31: stack(n,c)
STEP 32: unstack(l,h)
STEP 33: stack(l,n)
STEP 34: pick-up(e)
STEP 35: stack(e,l)
STEP 36: unstack(a,k)
STEP 37: stack(a,h)
STEP 38: unstack(f,i)
STEP 39: stack(f,k)
STEP 40: unstack(i,g)
STEP 41: stack(i,e)
STEP 42: unstack(a,h)
STEP 43: stack(a,i)
STEP 44: unstack(g,j)
STEP 45: stack(g,a)
STEP 46: unstack(f,k)
STEP 47: stack(f,g)
STEP 48: unstack(k,b)
STEP 49: stack(k,f)
STEP 50: pick-up(m)
STEP 51: stack(m,k)
STEP 52: unstack(h,d)
STEP 53: stack(h,m)
STEP 54: pick-up(b)
STEP 55: stack(b,h)
STEP 56: pick-up(d)
STEP 57: stack(d,b)
STEP 58: pick-up(j)
STEP 59: stack(j,d)
60 actions in the plan.
total time 0.32 preprocess 0.04
total size 1.288 GB
max. learned clause length 2299
t val conflicts decisions
0 0 0 0
5 0 0 0
10 0 0 0
15 0 0 0
20 0 39 42
25 -1 545 743
30 -1 481 877
35 -1 423 861
40 -1 360 790
45 -1 300 657
50 -1 241 604
55 -1 180 355
60 1 85 247