patrick/tplp-planning-benchmark
1
0
Fork 0
Code Issues Releases Activity

Add benchmark result [m-mp | ipc-2011 | peg-solitaire-sequential-satisficing | 11]

Browse Source
This commit is contained in:
Potassco Bot
2017-12-03 10:50:08 +01:00
parent 1689375141
commit cdb002f45d
3 changed files with 122 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

73
m-mp/ipc-2011_peg-solitaire-sequential-satisficing_11.out Normal file
View File

@@ -0,0 +1,73 @@
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-11.pddlignoring --stats
ignoring --verbose
-m 8192
Domain: pegsolitaire-sequential
Problem: pegsolitaire-sequential-080
Parser: 185 ground actions and 176 state variables
Invariants: 0 1 2 3 0.00 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.01 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 (6 decisions 6 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
SAT (315 decisions 209 conflicts)
PLAN FOUND: 35 steps
STEP 0: jump-new-move(pos-0-4,pos-1-4,pos-2-4)
STEP 1: jump-continue-move(pos-2-4,pos-3-4,pos-4-4)
STEP 2: end-move(pos-4-4)
STEP 3: jump-new-move(pos-2-6,pos-2-5,pos-2-4)
STEP 4: end-move(pos-2-4)
STEP 5: jump-new-move(pos-2-1,pos-2-2,pos-2-3)
STEP 6: end-move(pos-2-3)
STEP 7: jump-new-move(pos-4-5,pos-4-4,pos-4-3)
STEP 8: end-move(pos-4-3)
STEP 9: jump-new-move(pos-4-2,pos-4-3,pos-4-4)
STEP 10: end-move(pos-4-4)
STEP 11: jump-new-move(pos-2-3,pos-3-3,pos-4-3)
STEP 12: jump-continue-move(pos-4-3,pos-4-4,pos-4-5)
STEP 13: end-move(pos-4-5)
STEP 14: jump-new-move(pos-4-6,pos-4-5,pos-4-4)
STEP 15: end-move(pos-4-4)
STEP 16: jump-new-move(pos-0-3,pos-1-3,pos-2-3)
STEP 17: end-move(pos-2-3)
STEP 18: jump-new-move(pos-2-4,pos-2-3,pos-2-2)
STEP 19: jump-continue-move(pos-2-2,pos-3-2,pos-4-2)
STEP 20: end-move(pos-4-2)
STEP 21: jump-new-move(pos-4-1,pos-4-2,pos-4-3)
STEP 22: end-move(pos-4-3)
STEP 23: jump-new-move(pos-4-4,pos-4-3,pos-4-2)
STEP 24: end-move(pos-4-2)
STEP 25: jump-new-move(pos-5-2,pos-4-2,pos-3-2)
STEP 26: end-move(pos-3-2)
STEP 27: jump-new-move(pos-3-1,pos-3-2,pos-3-3)
28 actions in the plan.
Cost of the plan is 13.
total time 0.16 preprocess 0.01
total size 1.049 GB
max. learned clause length 1128
t val conflicts decisions
0 0 0 0
5 0 6 6
10 -1 542 578
15 -1 481 574
20 -1 422 534
25 -1 362 486
30 -1 300 381
35 1 209 315