1
0
tplp-planning-benchmark/m-mp/ipc-2011_peg-solitaire-sequential-satisficing_1.out

85 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-2011/domains/peg-solitaire-sequential-satisficing/domain.pddl file:/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/peg-solitaire-sequential-satisficing/instances/instance-1.pddlignoring --stats
ignoring --verbose
-m 8192
Domain: pegsolitaire-sequential
Problem: pegsolitaire-sequential-030
Parser: 185 ground actions and 176 state variables
Invariants: 0 1 2 3 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 (7 decisions 7 conflicts)
Horizon 10: 2870 variables
Horizon 15: 4255 variables
Horizon 20: 5640 variables
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
10 UNSAT (991 decisions 867 conflicts)
Horizon 85: 23645 variables
Horizon 90: 25030 variables
Horizon 95: 26415 variables
Horizon 100: 27800 variables
Horizon 105: 29185 variables
Horizon 110: 30570 variables
GC: 5.16 MB
SAT (2691 decisions 2034 conflicts)
PLAN FOUND: 30 steps
STEP 0: jump-new-move(pos-3-4,pos-2-4,pos-1-4)
STEP 1: end-move(pos-1-4)
STEP 2: jump-new-move(pos-1-3,pos-2-3,pos-3-3)
STEP 3: end-move(pos-3-3)
STEP 4: jump-new-move(pos-4-3,pos-4-4,pos-4-5)
STEP 5: end-move(pos-4-5)
STEP 6: jump-new-move(pos-3-2,pos-2-2,pos-1-2)
STEP 7: end-move(pos-1-2)
STEP 8: jump-new-move(pos-3-0,pos-3-1,pos-3-2)
STEP 9: end-move(pos-3-2)
STEP 10: jump-new-move(pos-4-2,pos-3-2,pos-2-2)
STEP 11: jump-continue-move(pos-2-2,pos-1-2,pos-0-2)
STEP 12: jump-continue-move(pos-0-2,pos-0-3,pos-0-4)
STEP 13: jump-continue-move(pos-0-4,pos-1-4,pos-2-4)
STEP 14: end-move(pos-2-4)
STEP 15: jump-new-move(pos-3-6,pos-3-5,pos-3-4)
STEP 16: end-move(pos-3-4)
STEP 17: jump-new-move(pos-2-4,pos-3-4,pos-4-4)
STEP 18: end-move(pos-4-4)
STEP 19: jump-new-move(pos-6-3,pos-5-3,pos-4-3)
STEP 20: end-move(pos-4-3)
STEP 21: jump-new-move(pos-3-3,pos-4-3,pos-5-3)
STEP 22: end-move(pos-5-3)
STEP 23: jump-new-move(pos-4-5,pos-4-4,pos-4-3)
STEP 24: end-move(pos-4-3)
STEP 25: jump-new-move(pos-5-3,pos-4-3,pos-3-3)
26 actions in the plan.
Cost of the plan is 12.
total time 1.94 preprocess 0.01
total size 1.959 GB
max. learned clause length 3108
t val conflicts decisions
0 0 0 0
5 0 7 7
10 0 867 991
15 -1 2704 3245
20 -1 2465 3061
25 -1 2227 2862
30 1 2034 2691