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

m-mp/ipc-2011_peg-solitaire-sequential-satisficing_12.out

@@ -0,0 +1,72 @@
+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-12.pddlignoring --stats
+ignoring --verbose
+ -m 8192
+Domain: pegsolitaire-sequential
+Problem: pegsolitaire-sequential-047
+Parser: 185 ground actions and 176 state variables
+Invariants: 0 1 2  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.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 (5 decisions 5 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
+SAT (172 decisions 130 conflicts)
+PLAN FOUND: 30 steps
+STEP 0: jump-new-move(pos-0-4,pos-0-3,pos-0-2)
+STEP 1: end-move(pos-0-2)
+STEP 2: jump-new-move(pos-1-4,pos-2-4,pos-3-4)
+STEP 3: end-move(pos-3-4)
+STEP 4: jump-new-move(pos-3-3,pos-3-4,pos-3-5)
+STEP 5: end-move(pos-3-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-0-2,pos-1-2,pos-2-2)
+STEP 9: jump-continue-move(pos-2-2,pos-2-3,pos-2-4)
+STEP 10: end-move(pos-2-4)
+STEP 11: jump-new-move(pos-6-4,pos-6-3,pos-6-2)
+STEP 12: end-move(pos-6-2)
+STEP 13: jump-new-move(pos-5-4,pos-5-3,pos-5-2)
+STEP 14: end-move(pos-5-2)
+STEP 15: jump-new-move(pos-6-2,pos-5-2,pos-4-2)
+STEP 16: end-move(pos-4-2)
+STEP 17: jump-new-move(pos-2-5,pos-2-4,pos-2-3)
+STEP 18: end-move(pos-2-3)
+STEP 19: jump-new-move(pos-3-0,pos-3-1,pos-3-2)
+STEP 20: jump-continue-move(pos-3-2,pos-4-2,pos-5-2)
+STEP 21: end-move(pos-5-2)
+STEP 22: jump-new-move(pos-4-4,pos-4-3,pos-4-2)
+STEP 23: end-move(pos-4-2)
+STEP 24: jump-new-move(pos-1-3,pos-2-3,pos-3-3)
+STEP 25: end-move(pos-3-3)
+STEP 26: jump-new-move(pos-5-2,pos-4-2,pos-3-2)
+STEP 27: jump-continue-move(pos-3-2,pos-3-3,pos-3-4)
+STEP 28: end-move(pos-3-4)
+STEP 29: jump-new-move(pos-3-5,pos-3-4,pos-3-3)
+30 actions in the plan.
+Cost of the plan is 14.
+total time 0.07 preprocess 0.00 
+total size 0.898 GB
+max. learned clause length 945
+t val conflicts decisions
+0 0 0 0
+5 0 5 5
+10 -1 422 461
+15 -1 360 417
+20 -1 300 383
+25 -1 240 318
+30 1 130 172
+