Add benchmark result [m-mp | ipc-2006 | trucks-propositional-strips | 6]

m-mp/ipc-2006_trucks-propositional-strips_6.out

@@ -0,0 +1,65 @@
+Madagascar 0.99999 25/02/2015 09:46:27 amd64 1-core (no VSIDS)
+Options: file:/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/trucks-propositional-strips/domains/domain-6.pddl file:/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/trucks-propositional-strips/instances/instance-6.pddlignoring --stats
+ignoring --verbose
+ -m 8192
+Domain: grounded-trucks
+Problem: grounded-truck-6
+Parser: 2040 ground actions and 371 state variables
+Invariants: 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14  0.08 secs
+Goal: conjunctive
+Simplified: 2036 ground actions and 370 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 133 MB)
+Horizon 0: 370 variables
+0 UNSAT (0 decisions 0 conflicts)
+Horizon 5: 12400 variables
+				Allocated 32 MB (total 319 MB)
+5 UNSAT (19 decisions 15 conflicts)
+Horizon 10: 24430 variables
+Horizon 15: 36460 variables
+Horizon 20: 48490 variables
+SAT (43 decisions 10 conflicts)
+PLAN FOUND: 20 steps
+STEP 0: drive_truck1_l1_l3_t0_t1()
+STEP 1.0: load_package8_truck1_a2_l3()
+STEP 1.1: drive_truck1_l3_l1_t1_t2()
+STEP 2.0: unload_package8_truck1_a2_l1()
+STEP 2.1: drive_truck1_l1_l3_t2_t3()
+STEP 3.0: deliver_package8_l1_t3_t12() load_package7_truck1_a2_l3()
+STEP 3.1: drive_truck1_l3_l2_t3_t4()
+STEP 4: unload_package7_truck1_a2_l2()
+STEP 5.0: deliver_package7_l2_t4_t12() load_package6_truck1_a2_l2()
+STEP 5.1: drive_truck1_l2_l3_t4_t5()
+STEP 6.0: unload_package6_truck1_a2_l3()
+STEP 6.1: load_package4_truck1_a1_l3()
+STEP 6.2: drive_truck1_l3_l1_t5_t6()
+STEP 7.0: deliver_package6_l3_t6_t12() unload_package4_truck1_a1_l1()
+STEP 7.1: drive_truck1_l1_l2_t6_t7()
+STEP 8.0: deliver_package4_l1_t7_t12() load_package5_truck1_a2_l2()
+STEP 8.1: drive_truck1_l2_l3_t7_t8()
+STEP 9.0: unload_package5_truck1_a2_l3()
+STEP 9.1: load_package3_truck1_a1_l3()
+STEP 9.2: drive_truck1_l3_l2_t8_t9()
+STEP 10.0: deliver_package5_l3_t9_t9()
+STEP 10.1: drive_truck1_l2_l1_t9_t10()
+STEP 11: unload_package3_truck1_a1_l1()
+STEP 12.0: deliver_package3_l1_t10_t11() load_package1_truck1_a2_l1()
+STEP 12.1: load_package2_truck1_a1_l1()
+STEP 12.2: drive_truck1_l1_l2_t10_t11()
+STEP 13: unload_package2_truck1_a1_l2()
+STEP 14.0: deliver_package2_l2_t11_t12() unload_package1_truck1_a2_l2()
+STEP 14.1: drive_truck1_l2_l1_t11_t12()
+STEP 15: deliver_package1_l2_t12_t12()
+36 actions in the plan.
+total time 0.22 preprocess 0.12 
+total size 639.000 MB
+max. learned clause length 3814
+t val conflicts decisions
+0 0 0 0
+5 0 15 19
+10 -1 181 254
+15 -1 120 200
+20 1 10 43
+