Add benchmark result [m-mp | ipc-2011 | no-mystery-sequential-satisficing | 12]

m-mp/ipc-2011_no-mystery-sequential-satisficing_12.out

@@ -0,0 +1,46 @@
+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/no-mystery-sequential-satisficing/domain.pddl file:/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-sequential-satisficing/instances/instance-12.pddlignoring --stats
+ignoring --verbose
+ -m 8192
+Domain: transport-strips
+Problem: transport-l7-t1-p7---int100n150-m25---int100c110---s1---e0
+Parser: 1312 ground actions and 2877 state variables
+Invariants: 0 1 2 3 4 5 6  0.03 secs
+Goal: conjunctive
+Simplified: 1100 ground actions and 130 state variables
+Actions: STRIPS
+Disabling graph %: 10 20 30 40 50 60 70 80 90 100 0.00 secs (max SCC size 1)
+Plan type: E-step
+				Allocated 32 MB permanent (total 128 MB)
+Horizon 0: 130 variables
+0 UNSAT (0 decisions 0 conflicts)
+Horizon 5: 6280 variables
+				Allocated 32 MB (total 314 MB)
+5 UNSAT (3 decisions 3 conflicts)
+Horizon 10: 12430 variables
+Horizon 15: 18580 variables
+SAT (153 decisions 95 conflicts)
+PLAN FOUND: 10 steps
+STEP 0.0: load(p5,t0,l5)
+STEP 0.1: drive(t0,l5,l4,level60,level12,level72)
+STEP 1.0: load(p2,t0,l4) load(p6,t0,l4)
+STEP 1.1: drive(t0,l4,l3,level52,level8,level60)
+STEP 2.0: load(p0,t0,l3) load(p1,t0,l3)
+STEP 2.1: drive(t0,l3,l1,level40,level12,level52)
+STEP 3: drive(t0,l1,l2,level37,level3,level40)
+STEP 4.0: load(p3,t0,l2) unload(p0,t0,l2) unload(p1,t0,l2)
+STEP 4.1: drive(t0,l2,l5,level24,level13,level37)
+STEP 5: drive(t0,l5,l0,level18,level6,level24)
+STEP 6.0: load(p4,t0,l0) unload(p2,t0,l0) unload(p3,t0,l0) unload(p5,t0,l0) unload(p6,t0,l0)
+STEP 6.1: drive(t0,l0,l3,level0,level18,level18)
+STEP 7: unload(p4,t0,l3)
+21 actions in the plan.
+Cost of the plan is 21.
+total time 1.34 preprocess 1.30 
+total size 551.000 MB
+max. learned clause length 1862
+t val conflicts decisions
+0 0 0 0
+5 0 3 3
+10 1 95 153
+