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

94 lines
2.4 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-22.pddlignoring --stats
ignoring --verbose
Domain: blocks
Problem: blocks-11-0
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 (1 decisions 1 conflicts)
Horizon 20: 8535 variables
Horizon 25: 10630 variables
20 UNSAT (102 decisions 82 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
Horizon 65: 27390 variables
Horizon 70: 29485 variables
Horizon 75: 31580 variables
SAT (626 decisions 305 conflicts)
PLAN FOUND: 50 steps
STEP 0: unstack(b,g)
STEP 1: stack(b,j)
STEP 2: unstack(g,h)
STEP 3: stack(g,c)
STEP 4: unstack(g,c)
STEP 5: stack(g,h)
STEP 6: unstack(c,e)
STEP 7: put-down(c)
STEP 8: unstack(g,h)
STEP 9: stack(g,c)
STEP 10: pick-up(e)
STEP 11: stack(e,g)
STEP 12: unstack(h,k)
STEP 13: stack(h,b)
STEP 14: unstack(k,a)
STEP 15: put-down(k)
STEP 16: unstack(a,f)
STEP 17: stack(a,h)
STEP 18: unstack(f,i)
STEP 19: stack(f,e)
STEP 20: pick-up(i)
STEP 21: stack(i,f)
STEP 22: pick-up(k)
STEP 23: stack(k,i)
STEP 24: unstack(a,h)
STEP 25: put-down(a)
STEP 26: unstack(h,b)
STEP 27: stack(h,k)
STEP 28: unstack(b,j)
STEP 29: stack(b,h)
STEP 30: unstack(j,d)
STEP 31: stack(j,a)
STEP 32: pick-up(d)
STEP 33: stack(d,b)
STEP 34: unstack(j,a)
STEP 35: stack(j,d)
STEP 36: pick-up(a)
STEP 37: stack(a,j)
38 actions in the plan.
total time 0.30 preprocess 0.02
total size 1.432 GB
max. learned clause length 1085
t val conflicts decisions
0 0 0 0
5 0 0 0
10 0 0 0
15 0 1 1
20 0 82 102
25 -1 663 958
30 -1 604 919
35 -1 540 868
40 -1 480 971
45 -1 420 851
50 1 305 626