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

103 lines
2.6 KiB
Plaintext

Madagascar 0.99999 25/02/2015 09:03:18 amd64 1-core
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-31.pddlignoring --stats
ignoring --verbose
Domain: blocks
Problem: blocks-15-0
Parser: 480 ground actions and 271 state variables
Invariants: 0 1 2 3 4 5 0.04 secs
Goal: conjunctive
Simplified: 480 ground actions and 271 state variables
Actions: STRIPS
Disabling graph %: 10 20 30 40 50 60 70 80 90 100 0.02 secs (max SCC size 1)
Plan type: E-step
Heuristic: VSIDS
Allocated 32 MB permanent (total 125 MB)
Horizon 0: 271 variables
0 UNSAT (0 decisions 0 conflicts)
Horizon 5: 4026 variables
5 UNSAT (0 decisions 0 conflicts)
Horizon 10: 7781 variables
10 UNSAT (0 decisions 0 conflicts)
Horizon 15: 11536 variables
15 UNSAT (0 decisions 0 conflicts)
Horizon 20: 15291 variables
Allocated 32 MB (total 541 MB)
20 UNSAT (1 decisions 1 conflicts)
Horizon 25: 19046 variables
25 UNSAT (38 decisions 32 conflicts)
Horizon 30: 22801 variables
Horizon 35: 26556 variables
Horizon 40: 30311 variables
Horizon 45: 34066 variables
30 UNSAT (434 decisions 243 conflicts)
Horizon 50: 37821 variables
Horizon 55: 41576 variables
Horizon 60: 45331 variables
35 UNSAT (2258 decisions 347 conflicts)
Horizon 65: 49086 variables
Horizon 70: 52841 variables
Horizon 75: 56596 variables
SAT (368 decisions 147 conflicts)
PLAN FOUND: 65 steps
STEP 0: unstack(e,j)
STEP 1: put-down(e)
STEP 2: unstack(j,d)
STEP 3: put-down(j)
STEP 5: unstack(d,l)
STEP 6: put-down(d)
STEP 11: unstack(l,c)
STEP 12: put-down(l)
STEP 13: unstack(c,g)
STEP 14: put-down(c)
STEP 19: unstack(i,h)
STEP 20: stack(i,c)
STEP 22: unstack(m,n)
STEP 23: stack(m,g)
STEP 25: pick-up(n)
STEP 26: stack(n,i)
STEP 27: pick-up(d)
STEP 28: stack(d,n)
STEP 31: pick-up(j)
STEP 32: stack(j,d)
STEP 36: pick-up(l)
STEP 37: stack(l,j)
STEP 38: unstack(b,a)
STEP 39: stack(b,l)
STEP 40: unstack(a,o)
STEP 41: stack(a,b)
STEP 42: pick-up(e)
STEP 43: stack(e,a)
STEP 44: unstack(f,k)
STEP 45: stack(f,e)
STEP 46: unstack(m,g)
STEP 47: stack(m,f)
STEP 48: pick-up(k)
STEP 50: stack(k,m)
STEP 51: pick-up(h)
STEP 52: stack(h,k)
STEP 53: pick-up(o)
STEP 54: stack(o,h)
STEP 62: pick-up(g)
STEP 63: stack(g,o)
40 actions in the plan.
total time 0.61 preprocess 0.06
total size 1.450 GB
max. learned clause length 5784
t val conflicts decisions
0 0 0 0
5 0 0 0
10 0 0 0
15 0 0 0
20 0 1 1
25 0 32 38
30 0 243 434
35 0 347 2258
40 -1 510 4111
45 -1 436 4956
50 -1 368 6600
55 -1 301 4933
60 -1 256 1826
65 1 147 368