1
0
Fork 0
tplp-planning-benchmark/m-mp/ipc-2011_peg-solitaire-sequ...

96 lines
2.9 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-2011/domains/peg-solitaire-sequential-satisficing/domain.pddl file:/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/peg-solitaire-sequential-satisficing/instances/instance-2.pddlignoring --stats
ignoring --verbose
-m 8192
Domain: pegsolitaire-sequential
Problem: pegsolitaire-sequential-060
Parser: 185 ground actions and 176 state variables
Invariants: 0 1 2 0.01 secs
Goal: conjunctive
Simplified: 177 ground actions and 100 state variables
Actions: STRIPS
Disabling graph %: 10 20 30 40 50 60 70 80 90 100 0.00 secs (max SCC size 4)
Plan type: E-step
Allocated 32 MB permanent (total 122 MB)
Horizon 0: 100 variables
0 UNSAT (0 decisions 0 conflicts)
Horizon 5: 1485 variables
Allocated 32 MB (total 307 MB)
5 UNSAT (1 decisions 1 conflicts)
Horizon 10: 2870 variables
Horizon 15: 4255 variables
Horizon 20: 5640 variables
10 UNSAT (165 decisions 158 conflicts)
Horizon 25: 7025 variables
Horizon 30: 8410 variables
Horizon 35: 9795 variables
Horizon 40: 11180 variables
Horizon 45: 12565 variables
Horizon 50: 13950 variables
Horizon 55: 15335 variables
Horizon 60: 16720 variables
Horizon 65: 18105 variables
Horizon 70: 19490 variables
Horizon 75: 20875 variables
Horizon 80: 22260 variables
Horizon 85: 23645 variables
Horizon 90: 25030 variables
Horizon 95: 26415 variables
Horizon 100: 27800 variables
Horizon 105: 29185 variables
Horizon 110: 30570 variables
SAT (329 decisions 189 conflicts)
PLAN FOUND: 95 steps
STEP 0: jump-new-move(pos-6-4,pos-6-3,pos-6-2)
STEP 1: end-move(pos-6-2)
STEP 2: jump-new-move(pos-2-5,pos-2-4,pos-2-3)
STEP 3: end-move(pos-2-3)
STEP 4: jump-new-move(pos-4-5,pos-3-5,pos-2-5)
STEP 5: end-move(pos-2-5)
STEP 6: jump-new-move(pos-2-6,pos-2-5,pos-2-4)
STEP 7: end-move(pos-2-4)
STEP 8: jump-new-move(pos-4-6,pos-3-6,pos-2-6)
STEP 9: end-move(pos-2-6)
STEP 10: jump-new-move(pos-2-3,pos-2-4,pos-2-5)
STEP 11: end-move(pos-2-5)
STEP 12: jump-new-move(pos-2-6,pos-2-5,pos-2-4)
STEP 13: end-move(pos-2-4)
STEP 14: jump-new-move(pos-5-4,pos-4-4,pos-3-4)
STEP 15: jump-continue-move(pos-3-4,pos-2-4,pos-1-4)
STEP 16: jump-continue-move(pos-1-4,pos-1-3,pos-1-2)
STEP 17: jump-continue-move(pos-1-2,pos-2-2,pos-3-2)
STEP 18: jump-continue-move(pos-3-2,pos-4-2,pos-5-2)
STEP 19: end-move(pos-5-2)
STEP 20: jump-new-move(pos-6-2,pos-5-2,pos-4-2)
STEP 21: end-move(pos-4-2)
STEP 22: jump-new-move(pos-4-1,pos-4-2,pos-4-3)
STEP 23: end-move(pos-4-3)
STEP 24: jump-new-move(pos-5-3,pos-4-3,pos-3-3)
25 actions in the plan.
Cost of the plan is 11.
total time 0.86 preprocess 0.01
total size 1.959 GB
max. learned clause length 3109
t val conflicts decisions
0 0 0 0
5 0 1 1
10 0 158 165
15 -1 1202 1363
20 -1 1141 1380
25 -1 1023 1280
30 -1 962 1292
35 -1 841 1165
40 -1 781 1055
45 -1 721 967
50 -1 660 865
55 -1 602 779
60 -1 541 738
65 -1 483 640
70 -1 420 563
75 -1 420 533
80 -1 363 462
85 -1 361 454
90 -1 300 418
95 1 189 329