668.81/291.69 WORST_CASE(Omega(n^1), ?) 669.01/291.70 proof of /export/starexec/sandbox/benchmark/theBenchmark.koat 669.01/291.70 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 669.01/291.70 669.01/291.70 669.01/291.70 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(n^1, INF). 669.01/291.70 669.01/291.70 (0) CpxIntTrs 669.01/291.70 (1) Loat Proof [FINISHED, 82.1 s] 669.01/291.70 (2) BOUNDS(n^1, INF) 669.01/291.70 669.01/291.70 669.01/291.70 ---------------------------------------- 669.01/291.70 669.01/291.70 (0) 669.01/291.70 Obligation: 669.01/291.70 Complexity Int TRS consisting of the following rules: 669.01/291.70 eval_sipmamergesort2_start(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb0_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_bb0_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_0(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_0(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_1(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_1(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_2(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_2(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_3(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_3(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_4(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_4(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_5(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_5(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_6(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_6(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_7(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_7(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_8(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_8(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_9(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_9(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_10(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_10(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_11(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_11(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_12(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_12(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_13(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_13(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_14(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_14(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_15(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_15(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_16(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_16(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_17(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_17(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_18(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_18(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_19(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_19(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_20(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_20(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_21(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_21(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_22(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_22(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb1_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, 1, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_bb1_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb2_in(v_104, v_5, v_51, v_58, v_i_8, v_n, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_bb2_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb3_in(v_104, v_m_0 - 2 * v_p_0, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_p_0, v_q_3, v_q_5, v_q_7, v_p_0, v_r_3, v_r_5, v_r_7, v_up_0)) :|: v_m_0 >= v_p_0 && v_m_0 - v_p_0 >= v_p_0 669.01/291.70 eval_sipmamergesort2_bb2_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb3_in(v_104, 0, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_p_0, v_q_3, v_q_5, v_q_7, v_m_0 - v_p_0, v_r_3, v_r_5, v_r_7, v_up_0)) :|: v_m_0 >= v_p_0 && v_m_0 - v_p_0 < v_p_0 669.01/291.70 eval_sipmamergesort2_bb2_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb3_in(v_104, -(v_p_0), v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_m_0, v_q_3, v_q_5, v_q_7, v_p_0, v_r_3, v_r_5, v_r_7, v_up_0)) :|: v_m_0 < v_p_0 && 0 >= v_p_0 669.01/291.70 eval_sipmamergesort2_bb2_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb3_in(v_104, 0, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_m_0, v_q_3, v_q_5, v_q_7, 0, v_r_3, v_r_5, v_r_7, v_up_0)) :|: v_m_0 < v_p_0 && 0 < v_p_0 669.01/291.70 eval_sipmamergesort2_bb3_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb4_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: v_q_1 > 0 && v_r_1 > 0 669.01/291.70 eval_sipmamergesort2_bb3_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb7_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_1, v_r_5, v_r_7, v_up_0)) :|: v_q_1 <= 0 669.01/291.70 eval_sipmamergesort2_bb3_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb7_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_1, v_r_5, v_r_7, v_up_0)) :|: v_r_1 <= 0 669.01/291.70 eval_sipmamergesort2_bb4_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb5_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: nondef_0 < nondef_1 669.01/291.70 eval_sipmamergesort2_bb4_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb6_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: nondef_0 >= nondef_1 669.01/291.70 eval_sipmamergesort2_bb5_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb3_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1 - 1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_bb6_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb3_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1 - 1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_bb7_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb8_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: v_r_3 > 0 669.01/291.70 eval_sipmamergesort2_bb7_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb9_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_1, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: v_r_3 <= 0 669.01/291.70 eval_sipmamergesort2_bb8_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb7_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3 - 1, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_bb9_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb10_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: v_q_3 > 0 669.01/291.70 eval_sipmamergesort2_bb9_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb11_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: v_q_3 <= 0 669.01/291.70 eval_sipmamergesort2_bb10_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb9_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3 - 1, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_bb11_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_69(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_69(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_70(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_70(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_71(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_71(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_72(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_72(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_73(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_73(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb2_in(v_104, v_5, v_51, v_58, v_i_8, v_5, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: v_5 > 0 669.01/291.70 eval_sipmamergesort2_73(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb12_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: v_5 <= 0 669.01/291.70 eval_sipmamergesort2_bb12_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_74(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_74(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_75(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_75(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_76(v_104, v_5, 2 * v_p_0, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_76(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_77(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_77(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb25_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, 0)) :|: v_51 >= v_n 669.01/291.70 eval_sipmamergesort2_77(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb13_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: v_51 < v_n 669.01/291.70 eval_sipmamergesort2_bb13_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_78(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_78(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_79(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_79(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_80(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_80(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_81(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_81(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_82(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_82(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_83(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_83(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_84(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_84(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_85(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_85(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_86(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_86(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_87(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_87(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_88(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_88(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_89(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_89(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_90(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_90(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_91(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_91(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_92(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_92(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_93(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_93(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_94(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_94(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_95(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_95(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_96(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_96(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_97(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_97(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_98(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_98(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb14_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_n, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_bb14_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb15_in(v_104, v_5, v_51, v_m_1 - 2 * v_51, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_51, v_q_7, v_r_1, v_r_3, v_51, v_r_7, v_up_0)) :|: v_m_1 >= v_51 && v_m_1 - v_51 >= v_51 669.01/291.70 eval_sipmamergesort2_bb14_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb15_in(v_104, v_5, v_51, 0, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_51, v_q_7, v_r_1, v_r_3, v_m_1 - v_51, v_r_7, v_up_0)) :|: v_m_1 >= v_51 && v_m_1 - v_51 < v_51 669.01/291.70 eval_sipmamergesort2_bb14_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb15_in(v_104, v_5, v_51, -(v_51), v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_m_1, v_q_7, v_r_1, v_r_3, v_51, v_r_7, v_up_0)) :|: v_m_1 < v_51 && 0 >= v_51 669.01/291.70 eval_sipmamergesort2_bb14_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb15_in(v_104, v_5, v_51, 0, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_m_1, v_q_7, v_r_1, v_r_3, 0, v_r_7, v_up_0)) :|: v_m_1 < v_51 && 0 < v_51 669.01/291.70 eval_sipmamergesort2_bb15_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb16_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: v_q_5 > 0 && v_r_5 > 0 669.01/291.70 eval_sipmamergesort2_bb15_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb19_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_5, v_up_0)) :|: v_q_5 <= 0 669.01/291.70 eval_sipmamergesort2_bb15_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb19_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_5, v_up_0)) :|: v_r_5 <= 0 669.01/291.70 eval_sipmamergesort2_bb16_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb17_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: nondef_6 < nondef_7 669.01/291.70 eval_sipmamergesort2_bb16_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb18_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: nondef_6 >= nondef_7 669.01/291.70 eval_sipmamergesort2_bb17_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb15_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5 - 1, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_bb18_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb15_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5 - 1, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_bb19_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb20_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: v_r_7 > 0 669.01/291.70 eval_sipmamergesort2_bb19_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb21_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_5, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: v_r_7 <= 0 669.01/291.70 eval_sipmamergesort2_bb20_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb19_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7 - 1, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_bb21_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb22_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: v_q_7 > 0 669.01/291.70 eval_sipmamergesort2_bb21_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb23_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: v_q_7 <= 0 669.01/291.70 eval_sipmamergesort2_bb22_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb21_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7 - 1, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_bb23_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_142(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_142(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_143(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_143(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_144(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_144(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_145(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_145(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_146(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_146(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb14_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_58, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: v_58 > 0 669.01/291.70 eval_sipmamergesort2_146(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb24_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: v_58 <= 0 669.01/291.70 eval_sipmamergesort2_bb24_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_147(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_147(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_148(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_148(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_149(2 * v_51, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_149(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_150(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_150(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb1_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_104, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: v_104 < v_n 669.01/291.70 eval_sipmamergesort2_150(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb25_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, 1)) :|: v_104 >= v_n 669.01/291.70 eval_sipmamergesort2_bb25_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb26_in(v_104, v_5, v_51, v_58, 1, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: v_up_0 >= 0 && v_up_0 <= 0 669.01/291.70 eval_sipmamergesort2_bb25_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb28_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: v_up_0 < 0 669.01/291.70 eval_sipmamergesort2_bb25_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb28_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: v_up_0 > 0 669.01/291.70 eval_sipmamergesort2_bb26_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb27_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: v_i_8 <= v_n 669.01/291.70 eval_sipmamergesort2_bb26_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb28_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: v_i_8 > v_n 669.01/291.70 eval_sipmamergesort2_bb27_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_bb26_in(v_104, v_5, v_51, v_58, v_i_8 + 1, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 eval_sipmamergesort2_bb28_in(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0) -> Com_1(eval_sipmamergesort2_stop(v_104, v_5, v_51, v_58, v_i_8, v_m_0, v_m_1, v_n, v_p_0, v_q_1, v_q_3, v_q_5, v_q_7, v_r_1, v_r_3, v_r_5, v_r_7, v_up_0)) :|: TRUE 669.01/291.70 669.01/291.70 The start-symbols are:[eval_sipmamergesort2_start_18] 669.01/291.70 669.01/291.70 669.01/291.70 ---------------------------------------- 669.01/291.70 669.01/291.70 (1) Loat Proof (FINISHED) 669.01/291.70 669.01/291.70 669.01/291.70 ### Pre-processing the ITS problem ### 669.01/291.70 669.01/291.70 669.01/291.70 669.01/291.70 Initial linear ITS problem 669.01/291.70 669.01/291.70 Start location: evalsipmamergesort2start 669.01/291.70 669.01/291.70 0: evalsipmamergesort2start -> evalsipmamergesort2bb0in : [], cost: 1 669.01/291.70 669.01/291.70 1: evalsipmamergesort2bb0in -> evalsipmamergesort20 : [], cost: 1 669.01/291.70 669.01/291.70 2: evalsipmamergesort20 -> evalsipmamergesort21 : [], cost: 1 669.01/291.70 669.01/291.70 3: evalsipmamergesort21 -> evalsipmamergesort22 : [], cost: 1 669.01/291.70 669.01/291.70 4: evalsipmamergesort22 -> evalsipmamergesort23 : [], cost: 1 669.01/291.70 669.01/291.70 5: evalsipmamergesort23 -> evalsipmamergesort24 : [], cost: 1 669.01/291.70 669.01/291.70 6: evalsipmamergesort24 -> evalsipmamergesort25 : [], cost: 1 669.01/291.70 669.01/291.70 7: evalsipmamergesort25 -> evalsipmamergesort26 : [], cost: 1 669.01/291.70 669.01/291.70 8: evalsipmamergesort26 -> evalsipmamergesort27 : [], cost: 1 669.01/291.70 669.01/291.70 9: evalsipmamergesort27 -> evalsipmamergesort28 : [], cost: 1 669.01/291.70 669.01/291.70 10: evalsipmamergesort28 -> evalsipmamergesort29 : [], cost: 1 669.01/291.70 669.01/291.70 11: evalsipmamergesort29 -> evalsipmamergesort210 : [], cost: 1 669.01/291.70 669.01/291.70 12: evalsipmamergesort210 -> evalsipmamergesort211 : [], cost: 1 669.01/291.70 669.01/291.70 13: evalsipmamergesort211 -> evalsipmamergesort212 : [], cost: 1 669.01/291.70 669.01/291.70 14: evalsipmamergesort212 -> evalsipmamergesort213 : [], cost: 1 669.01/291.70 669.01/291.70 15: evalsipmamergesort213 -> evalsipmamergesort214 : [], cost: 1 669.01/291.70 669.01/291.70 16: evalsipmamergesort214 -> evalsipmamergesort215 : [], cost: 1 669.01/291.70 669.01/291.70 17: evalsipmamergesort215 -> evalsipmamergesort216 : [], cost: 1 669.01/291.70 669.01/291.70 18: evalsipmamergesort216 -> evalsipmamergesort217 : [], cost: 1 669.01/291.70 669.01/291.70 19: evalsipmamergesort217 -> evalsipmamergesort218 : [], cost: 1 669.01/291.70 669.01/291.70 20: evalsipmamergesort218 -> evalsipmamergesort219 : [], cost: 1 669.01/291.70 669.01/291.70 21: evalsipmamergesort219 -> evalsipmamergesort220 : [], cost: 1 669.01/291.70 669.01/291.70 22: evalsipmamergesort220 -> evalsipmamergesort221 : [], cost: 1 669.01/291.70 669.01/291.70 23: evalsipmamergesort221 -> evalsipmamergesort222 : [], cost: 1 669.01/291.70 669.01/291.70 24: evalsipmamergesort222 -> evalsipmamergesort2bb1in : A'=1, [], cost: 1 669.01/291.70 669.01/291.70 25: evalsipmamergesort2bb1in -> evalsipmamergesort2bb2in : B'=C, [], cost: 1 669.01/291.70 669.01/291.70 26: evalsipmamergesort2bb2in -> evalsipmamergesort2bb3in : D'=-2*A+B, E'=A, F'=A, [ B>=A && B>=2*A ], cost: 1 669.01/291.70 669.01/291.70 27: evalsipmamergesort2bb2in -> evalsipmamergesort2bb3in : D'=0, E'=A, F'=-A+B, [ B>=A && 2*A>=1+B ], cost: 1 669.01/291.70 669.01/291.70 28: evalsipmamergesort2bb2in -> evalsipmamergesort2bb3in : D'=-A, E'=B, F'=A, [ A>=1+B && 0>=A ], cost: 1 669.01/291.70 669.01/291.70 29: evalsipmamergesort2bb2in -> evalsipmamergesort2bb3in : D'=0, E'=B, F'=0, [ A>=1+B && A>=1 ], cost: 1 669.01/291.70 669.01/291.70 30: evalsipmamergesort2bb3in -> evalsipmamergesort2bb4in : [ E>=1 && F>=1 ], cost: 1 669.01/291.70 669.01/291.70 31: evalsipmamergesort2bb3in -> evalsipmamergesort2bb7in : G'=F, [ 0>=E ], cost: 1 669.01/291.70 669.01/291.70 32: evalsipmamergesort2bb3in -> evalsipmamergesort2bb7in : G'=F, [ 0>=F ], cost: 1 669.01/291.70 669.01/291.70 33: evalsipmamergesort2bb4in -> evalsipmamergesort2bb5in : [ free>=1+free_1 ], cost: 1 669.01/291.70 669.01/291.70 34: evalsipmamergesort2bb4in -> evalsipmamergesort2bb6in : [ free_3>=free_2 ], cost: 1 669.01/291.70 669.01/291.70 35: evalsipmamergesort2bb5in -> evalsipmamergesort2bb3in : E'=-1+E, [], cost: 1 669.01/291.70 669.01/291.70 36: evalsipmamergesort2bb6in -> evalsipmamergesort2bb3in : F'=-1+F, [], cost: 1 669.01/291.70 669.01/291.70 37: evalsipmamergesort2bb7in -> evalsipmamergesort2bb8in : [ G>=1 ], cost: 1 669.01/291.70 669.01/291.70 38: evalsipmamergesort2bb7in -> evalsipmamergesort2bb9in : H'=E, [ 0>=G ], cost: 1 669.01/291.70 669.01/291.70 39: evalsipmamergesort2bb8in -> evalsipmamergesort2bb7in : G'=-1+G, [], cost: 1 669.01/291.70 669.01/291.70 40: evalsipmamergesort2bb9in -> evalsipmamergesort2bb10in : [ H>=1 ], cost: 1 669.01/291.70 669.01/291.70 41: evalsipmamergesort2bb9in -> evalsipmamergesort2bb11in : [ 0>=H ], cost: 1 669.01/291.70 669.01/291.70 42: evalsipmamergesort2bb10in -> evalsipmamergesort2bb9in : H'=-1+H, [], cost: 1 669.01/291.70 669.01/291.70 43: evalsipmamergesort2bb11in -> evalsipmamergesort269 : [], cost: 1 669.01/291.70 669.01/291.70 44: evalsipmamergesort269 -> evalsipmamergesort270 : [], cost: 1 669.01/291.70 669.01/291.70 45: evalsipmamergesort270 -> evalsipmamergesort271 : [], cost: 1 669.01/291.70 669.01/291.70 46: evalsipmamergesort271 -> evalsipmamergesort272 : [], cost: 1 669.01/291.70 669.01/291.70 47: evalsipmamergesort272 -> evalsipmamergesort273 : [], cost: 1 669.01/291.70 669.01/291.70 48: evalsipmamergesort273 -> evalsipmamergesort2bb2in : B'=D, [ D>=1 ], cost: 1 669.01/291.70 669.01/291.70 49: evalsipmamergesort273 -> evalsipmamergesort2bb12in : [ 0>=D ], cost: 1 669.01/291.70 669.01/291.70 50: evalsipmamergesort2bb12in -> evalsipmamergesort274 : [], cost: 1 669.01/291.70 669.01/291.70 51: evalsipmamergesort274 -> evalsipmamergesort275 : [], cost: 1 669.01/291.70 669.01/291.70 52: evalsipmamergesort275 -> evalsipmamergesort276 : Q'=2*A, [], cost: 1 669.01/291.70 669.01/291.70 53: evalsipmamergesort276 -> evalsipmamergesort277 : [], cost: 1 669.01/291.70 669.01/291.70 54: evalsipmamergesort277 -> evalsipmamergesort2bb25in : J'=0, [ Q>=C ], cost: 1 669.01/291.70 669.01/291.70 55: evalsipmamergesort277 -> evalsipmamergesort2bb13in : [ C>=1+Q ], cost: 1 669.01/291.70 669.01/291.70 56: evalsipmamergesort2bb13in -> evalsipmamergesort278 : [], cost: 1 669.01/291.70 669.01/291.70 57: evalsipmamergesort278 -> evalsipmamergesort279 : [], cost: 1 669.01/291.70 669.01/291.70 58: evalsipmamergesort279 -> evalsipmamergesort280 : [], cost: 1 669.01/291.70 669.01/291.70 59: evalsipmamergesort280 -> evalsipmamergesort281 : [], cost: 1 669.01/291.70 669.01/291.70 60: evalsipmamergesort281 -> evalsipmamergesort282 : [], cost: 1 669.01/291.70 669.01/291.70 61: evalsipmamergesort282 -> evalsipmamergesort283 : [], cost: 1 669.01/291.70 669.01/291.70 62: evalsipmamergesort283 -> evalsipmamergesort284 : [], cost: 1 669.01/291.70 669.01/291.70 63: evalsipmamergesort284 -> evalsipmamergesort285 : [], cost: 1 669.01/291.70 669.01/291.70 64: evalsipmamergesort285 -> evalsipmamergesort286 : [], cost: 1 669.01/291.70 669.01/291.70 65: evalsipmamergesort286 -> evalsipmamergesort287 : [], cost: 1 669.01/291.70 669.01/291.70 66: evalsipmamergesort287 -> evalsipmamergesort288 : [], cost: 1 669.01/291.70 669.01/291.70 67: evalsipmamergesort288 -> evalsipmamergesort289 : [], cost: 1 669.01/291.70 669.01/291.70 68: evalsipmamergesort289 -> evalsipmamergesort290 : [], cost: 1 669.01/291.70 669.01/291.70 69: evalsipmamergesort290 -> evalsipmamergesort291 : [], cost: 1 669.01/291.70 669.01/291.70 70: evalsipmamergesort291 -> evalsipmamergesort292 : [], cost: 1 669.01/291.70 669.01/291.70 71: evalsipmamergesort292 -> evalsipmamergesort293 : [], cost: 1 669.01/291.70 669.01/291.70 72: evalsipmamergesort293 -> evalsipmamergesort294 : [], cost: 1 669.01/291.70 669.01/291.70 73: evalsipmamergesort294 -> evalsipmamergesort295 : [], cost: 1 669.01/291.70 669.01/291.70 74: evalsipmamergesort295 -> evalsipmamergesort296 : [], cost: 1 669.01/291.70 669.01/291.70 75: evalsipmamergesort296 -> evalsipmamergesort297 : [], cost: 1 669.01/291.70 669.01/291.70 76: evalsipmamergesort297 -> evalsipmamergesort298 : [], cost: 1 669.01/291.70 669.01/291.70 77: evalsipmamergesort298 -> evalsipmamergesort2bb14in : K'=C, [], cost: 1 669.01/291.70 669.01/291.70 78: evalsipmamergesort2bb14in -> evalsipmamergesort2bb15in : L'=-2*Q+K, M'=Q, N'=Q, [ K>=Q && K>=2*Q ], cost: 1 669.01/291.70 669.01/291.70 79: evalsipmamergesort2bb14in -> evalsipmamergesort2bb15in : L'=0, M'=Q, N'=-Q+K, [ K>=Q && 2*Q>=1+K ], cost: 1 669.01/291.70 669.01/291.70 80: evalsipmamergesort2bb14in -> evalsipmamergesort2bb15in : L'=-Q, M'=K, N'=Q, [ Q>=1+K && 0>=Q ], cost: 1 669.01/291.70 669.01/291.70 81: evalsipmamergesort2bb14in -> evalsipmamergesort2bb15in : L'=0, M'=K, N'=0, [ Q>=1+K && Q>=1 ], cost: 1 669.01/291.70 669.01/291.70 82: evalsipmamergesort2bb15in -> evalsipmamergesort2bb16in : [ M>=1 && N>=1 ], cost: 1 669.01/291.70 669.01/291.70 83: evalsipmamergesort2bb15in -> evalsipmamergesort2bb19in : O'=N, [ 0>=M ], cost: 1 669.01/291.70 669.01/291.70 84: evalsipmamergesort2bb15in -> evalsipmamergesort2bb19in : O'=N, [ 0>=N ], cost: 1 669.01/291.70 669.01/291.70 85: evalsipmamergesort2bb16in -> evalsipmamergesort2bb17in : [ free_4>=1+free_5 ], cost: 1 669.01/291.70 669.01/291.70 86: evalsipmamergesort2bb16in -> evalsipmamergesort2bb18in : [ free_7>=free_6 ], cost: 1 669.01/291.70 669.01/291.70 87: evalsipmamergesort2bb17in -> evalsipmamergesort2bb15in : M'=-1+M, [], cost: 1 669.01/291.70 669.01/291.70 88: evalsipmamergesort2bb18in -> evalsipmamergesort2bb15in : N'=-1+N, [], cost: 1 669.01/291.70 669.01/291.70 89: evalsipmamergesort2bb19in -> evalsipmamergesort2bb20in : [ O>=1 ], cost: 1 669.01/291.70 669.01/291.70 90: evalsipmamergesort2bb19in -> evalsipmamergesort2bb21in : P'=M, [ 0>=O ], cost: 1 669.01/291.70 669.01/291.70 91: evalsipmamergesort2bb20in -> evalsipmamergesort2bb19in : O'=-1+O, [], cost: 1 669.01/291.70 669.01/291.70 92: evalsipmamergesort2bb21in -> evalsipmamergesort2bb22in : [ P>=1 ], cost: 1 669.01/291.70 669.01/291.70 93: evalsipmamergesort2bb21in -> evalsipmamergesort2bb23in : [ 0>=P ], cost: 1 669.01/291.70 669.01/291.70 94: evalsipmamergesort2bb22in -> evalsipmamergesort2bb21in : P'=-1+P, [], cost: 1 669.01/291.70 669.01/291.70 95: evalsipmamergesort2bb23in -> evalsipmamergesort2142 : [], cost: 1 669.01/291.70 669.01/291.70 96: evalsipmamergesort2142 -> evalsipmamergesort2143 : [], cost: 1 669.01/291.70 669.01/291.70 97: evalsipmamergesort2143 -> evalsipmamergesort2144 : [], cost: 1 669.01/291.70 669.01/291.70 98: evalsipmamergesort2144 -> evalsipmamergesort2145 : [], cost: 1 669.01/291.70 669.01/291.70 99: evalsipmamergesort2145 -> evalsipmamergesort2146 : [], cost: 1 669.01/291.70 669.01/291.70 100: evalsipmamergesort2146 -> evalsipmamergesort2bb14in : K'=L, [ L>=1 ], cost: 1 669.01/291.70 669.01/291.70 101: evalsipmamergesort2146 -> evalsipmamergesort2bb24in : [ 0>=L ], cost: 1 669.01/291.70 669.01/291.70 102: evalsipmamergesort2bb24in -> evalsipmamergesort2147 : [], cost: 1 669.01/291.70 669.01/291.70 103: evalsipmamergesort2147 -> evalsipmamergesort2148 : [], cost: 1 669.01/291.70 669.01/291.70 104: evalsipmamergesort2148 -> evalsipmamergesort2149 : Q_1'=2*Q, [], cost: 1 669.01/291.70 669.01/291.70 105: evalsipmamergesort2149 -> evalsipmamergesort2150 : [], cost: 1 669.01/291.70 669.01/291.70 106: evalsipmamergesort2150 -> evalsipmamergesort2bb1in : A'=Q_1, [ C>=1+Q_1 ], cost: 1 669.01/291.70 669.01/291.70 107: evalsipmamergesort2150 -> evalsipmamergesort2bb25in : J'=1, [ Q_1>=C ], cost: 1 669.01/291.70 669.01/291.70 108: evalsipmamergesort2bb25in -> evalsipmamergesort2bb26in : R'=1, [ J==0 ], cost: 1 669.01/291.70 669.01/291.70 109: evalsipmamergesort2bb25in -> evalsipmamergesort2bb28in : [ 0>=1+J ], cost: 1 669.01/291.70 669.01/291.70 110: evalsipmamergesort2bb25in -> evalsipmamergesort2bb28in : [ J>=1 ], cost: 1 669.01/291.70 669.01/291.70 111: evalsipmamergesort2bb26in -> evalsipmamergesort2bb27in : [ C>=R ], cost: 1 669.01/291.70 669.01/291.70 112: evalsipmamergesort2bb26in -> evalsipmamergesort2bb28in : [ R>=1+C ], cost: 1 669.01/291.70 669.01/291.70 113: evalsipmamergesort2bb27in -> evalsipmamergesort2bb26in : R'=1+R, [], cost: 1 669.01/291.70 669.01/291.70 114: evalsipmamergesort2bb28in -> evalsipmamergesort2stop : [], cost: 1 669.01/291.70 669.01/291.70 669.01/291.70 669.01/291.70 Removed unreachable and leaf rules: 669.01/291.70 669.01/291.70 Start location: evalsipmamergesort2start 669.01/291.70 669.01/291.70 0: evalsipmamergesort2start -> evalsipmamergesort2bb0in : [], cost: 1 669.01/291.70 669.01/291.70 1: evalsipmamergesort2bb0in -> evalsipmamergesort20 : [], cost: 1 669.01/291.70 669.01/291.70 2: evalsipmamergesort20 -> evalsipmamergesort21 : [], cost: 1 669.01/291.70 669.01/291.70 3: evalsipmamergesort21 -> evalsipmamergesort22 : [], cost: 1 669.01/291.70 669.01/291.70 4: evalsipmamergesort22 -> evalsipmamergesort23 : [], cost: 1 669.01/291.70 669.01/291.70 5: evalsipmamergesort23 -> evalsipmamergesort24 : [], cost: 1 669.01/291.70 669.01/291.70 6: evalsipmamergesort24 -> evalsipmamergesort25 : [], cost: 1 669.01/291.70 669.01/291.70 7: evalsipmamergesort25 -> evalsipmamergesort26 : [], cost: 1 669.01/291.70 669.01/291.70 8: evalsipmamergesort26 -> evalsipmamergesort27 : [], cost: 1 669.01/291.70 669.01/291.70 9: evalsipmamergesort27 -> evalsipmamergesort28 : [], cost: 1 669.01/291.70 669.01/291.70 10: evalsipmamergesort28 -> evalsipmamergesort29 : [], cost: 1 669.01/291.70 669.01/291.70 11: evalsipmamergesort29 -> evalsipmamergesort210 : [], cost: 1 669.01/291.70 669.01/291.70 12: evalsipmamergesort210 -> evalsipmamergesort211 : [], cost: 1 669.01/291.70 669.01/291.70 13: evalsipmamergesort211 -> evalsipmamergesort212 : [], cost: 1 669.01/291.70 669.01/291.70 14: evalsipmamergesort212 -> evalsipmamergesort213 : [], cost: 1 669.01/291.70 669.01/291.70 15: evalsipmamergesort213 -> evalsipmamergesort214 : [], cost: 1 669.01/291.70 669.01/291.70 16: evalsipmamergesort214 -> evalsipmamergesort215 : [], cost: 1 669.01/291.70 669.01/291.70 17: evalsipmamergesort215 -> evalsipmamergesort216 : [], cost: 1 669.01/291.70 669.01/291.70 18: evalsipmamergesort216 -> evalsipmamergesort217 : [], cost: 1 669.01/291.70 669.01/291.70 19: evalsipmamergesort217 -> evalsipmamergesort218 : [], cost: 1 669.01/291.70 669.01/291.70 20: evalsipmamergesort218 -> evalsipmamergesort219 : [], cost: 1 669.01/291.70 669.01/291.70 21: evalsipmamergesort219 -> evalsipmamergesort220 : [], cost: 1 669.01/291.70 669.01/291.70 22: evalsipmamergesort220 -> evalsipmamergesort221 : [], cost: 1 669.01/291.70 669.01/291.70 23: evalsipmamergesort221 -> evalsipmamergesort222 : [], cost: 1 669.01/291.70 669.01/291.70 24: evalsipmamergesort222 -> evalsipmamergesort2bb1in : A'=1, [], cost: 1 669.01/291.70 669.01/291.70 25: evalsipmamergesort2bb1in -> evalsipmamergesort2bb2in : B'=C, [], cost: 1 669.01/291.70 669.01/291.70 26: evalsipmamergesort2bb2in -> evalsipmamergesort2bb3in : D'=-2*A+B, E'=A, F'=A, [ B>=A && B>=2*A ], cost: 1 669.01/291.70 669.01/291.70 27: evalsipmamergesort2bb2in -> evalsipmamergesort2bb3in : D'=0, E'=A, F'=-A+B, [ B>=A && 2*A>=1+B ], cost: 1 669.01/291.70 669.01/291.70 28: evalsipmamergesort2bb2in -> evalsipmamergesort2bb3in : D'=-A, E'=B, F'=A, [ A>=1+B && 0>=A ], cost: 1 669.01/291.70 669.01/291.70 29: evalsipmamergesort2bb2in -> evalsipmamergesort2bb3in : D'=0, E'=B, F'=0, [ A>=1+B && A>=1 ], cost: 1 669.01/291.70 669.01/291.70 30: evalsipmamergesort2bb3in -> evalsipmamergesort2bb4in : [ E>=1 && F>=1 ], cost: 1 669.01/291.70 669.01/291.70 31: evalsipmamergesort2bb3in -> evalsipmamergesort2bb7in : G'=F, [ 0>=E ], cost: 1 669.01/291.70 669.01/291.70 32: evalsipmamergesort2bb3in -> evalsipmamergesort2bb7in : G'=F, [ 0>=F ], cost: 1 669.01/291.70 669.01/291.70 33: evalsipmamergesort2bb4in -> evalsipmamergesort2bb5in : [ free>=1+free_1 ], cost: 1 669.01/291.71 669.01/291.71 34: evalsipmamergesort2bb4in -> evalsipmamergesort2bb6in : [ free_3>=free_2 ], cost: 1 669.01/291.71 669.01/291.71 35: evalsipmamergesort2bb5in -> evalsipmamergesort2bb3in : E'=-1+E, [], cost: 1 669.01/291.71 669.01/291.71 36: evalsipmamergesort2bb6in -> evalsipmamergesort2bb3in : F'=-1+F, [], cost: 1 669.01/291.71 669.01/291.71 37: evalsipmamergesort2bb7in -> evalsipmamergesort2bb8in : [ G>=1 ], cost: 1 669.01/291.71 669.01/291.71 38: evalsipmamergesort2bb7in -> evalsipmamergesort2bb9in : H'=E, [ 0>=G ], cost: 1 669.01/291.71 669.01/291.71 39: evalsipmamergesort2bb8in -> evalsipmamergesort2bb7in : G'=-1+G, [], cost: 1 669.01/291.71 669.01/291.71 40: evalsipmamergesort2bb9in -> evalsipmamergesort2bb10in : [ H>=1 ], cost: 1 669.01/291.71 669.01/291.71 41: evalsipmamergesort2bb9in -> evalsipmamergesort2bb11in : [ 0>=H ], cost: 1 669.01/291.71 669.01/291.71 42: evalsipmamergesort2bb10in -> evalsipmamergesort2bb9in : H'=-1+H, [], cost: 1 669.01/291.71 669.01/291.71 43: evalsipmamergesort2bb11in -> evalsipmamergesort269 : [], cost: 1 669.01/291.71 669.01/291.71 44: evalsipmamergesort269 -> evalsipmamergesort270 : [], cost: 1 669.01/291.71 669.01/291.71 45: evalsipmamergesort270 -> evalsipmamergesort271 : [], cost: 1 669.01/291.71 669.01/291.71 46: evalsipmamergesort271 -> evalsipmamergesort272 : [], cost: 1 669.01/291.71 669.01/291.71 47: evalsipmamergesort272 -> evalsipmamergesort273 : [], cost: 1 669.01/291.71 669.01/291.71 48: evalsipmamergesort273 -> evalsipmamergesort2bb2in : B'=D, [ D>=1 ], cost: 1 669.01/291.71 669.01/291.71 49: evalsipmamergesort273 -> evalsipmamergesort2bb12in : [ 0>=D ], cost: 1 669.01/291.71 669.01/291.71 50: evalsipmamergesort2bb12in -> evalsipmamergesort274 : [], cost: 1 669.01/291.71 669.01/291.71 51: evalsipmamergesort274 -> evalsipmamergesort275 : [], cost: 1 669.01/291.71 669.01/291.71 52: evalsipmamergesort275 -> evalsipmamergesort276 : Q'=2*A, [], cost: 1 669.01/291.71 669.01/291.71 53: evalsipmamergesort276 -> evalsipmamergesort277 : [], cost: 1 669.01/291.71 669.01/291.71 54: evalsipmamergesort277 -> evalsipmamergesort2bb25in : J'=0, [ Q>=C ], cost: 1 669.01/291.71 669.01/291.71 55: evalsipmamergesort277 -> evalsipmamergesort2bb13in : [ C>=1+Q ], cost: 1 669.01/291.71 669.01/291.71 56: evalsipmamergesort2bb13in -> evalsipmamergesort278 : [], cost: 1 669.01/291.71 669.01/291.71 57: evalsipmamergesort278 -> evalsipmamergesort279 : [], cost: 1 669.01/291.71 669.01/291.71 58: evalsipmamergesort279 -> evalsipmamergesort280 : [], cost: 1 669.01/291.71 669.01/291.71 59: evalsipmamergesort280 -> evalsipmamergesort281 : [], cost: 1 669.01/291.71 669.01/291.71 60: evalsipmamergesort281 -> evalsipmamergesort282 : [], cost: 1 669.01/291.71 669.01/291.71 61: evalsipmamergesort282 -> evalsipmamergesort283 : [], cost: 1 669.01/291.71 669.01/291.71 62: evalsipmamergesort283 -> evalsipmamergesort284 : [], cost: 1 669.01/291.71 669.01/291.71 63: evalsipmamergesort284 -> evalsipmamergesort285 : [], cost: 1 669.01/291.71 669.01/291.71 64: evalsipmamergesort285 -> evalsipmamergesort286 : [], cost: 1 669.01/291.71 669.01/291.71 65: evalsipmamergesort286 -> evalsipmamergesort287 : [], cost: 1 669.01/291.71 669.01/291.71 66: evalsipmamergesort287 -> evalsipmamergesort288 : [], cost: 1 669.01/291.71 669.01/291.71 67: evalsipmamergesort288 -> evalsipmamergesort289 : [], cost: 1 669.01/291.71 669.01/291.71 68: evalsipmamergesort289 -> evalsipmamergesort290 : [], cost: 1 669.01/291.71 669.01/291.71 69: evalsipmamergesort290 -> evalsipmamergesort291 : [], cost: 1 669.01/291.71 669.01/291.71 70: evalsipmamergesort291 -> evalsipmamergesort292 : [], cost: 1 669.01/291.71 669.01/291.71 71: evalsipmamergesort292 -> evalsipmamergesort293 : [], cost: 1 669.01/291.71 669.01/291.71 72: evalsipmamergesort293 -> evalsipmamergesort294 : [], cost: 1 669.01/291.71 669.01/291.71 73: evalsipmamergesort294 -> evalsipmamergesort295 : [], cost: 1 669.01/291.71 669.01/291.71 74: evalsipmamergesort295 -> evalsipmamergesort296 : [], cost: 1 669.01/291.71 669.01/291.71 75: evalsipmamergesort296 -> evalsipmamergesort297 : [], cost: 1 669.01/291.71 669.01/291.71 76: evalsipmamergesort297 -> evalsipmamergesort298 : [], cost: 1 669.01/291.71 669.01/291.71 77: evalsipmamergesort298 -> evalsipmamergesort2bb14in : K'=C, [], cost: 1 669.01/291.71 669.01/291.71 78: evalsipmamergesort2bb14in -> evalsipmamergesort2bb15in : L'=-2*Q+K, M'=Q, N'=Q, [ K>=Q && K>=2*Q ], cost: 1 669.01/291.71 669.01/291.71 79: evalsipmamergesort2bb14in -> evalsipmamergesort2bb15in : L'=0, M'=Q, N'=-Q+K, [ K>=Q && 2*Q>=1+K ], cost: 1 669.01/291.71 669.01/291.71 80: evalsipmamergesort2bb14in -> evalsipmamergesort2bb15in : L'=-Q, M'=K, N'=Q, [ Q>=1+K && 0>=Q ], cost: 1 669.01/291.71 669.01/291.71 81: evalsipmamergesort2bb14in -> evalsipmamergesort2bb15in : L'=0, M'=K, N'=0, [ Q>=1+K && Q>=1 ], cost: 1 669.01/291.71 669.01/291.71 82: evalsipmamergesort2bb15in -> evalsipmamergesort2bb16in : [ M>=1 && N>=1 ], cost: 1 669.01/291.71 669.01/291.71 83: evalsipmamergesort2bb15in -> evalsipmamergesort2bb19in : O'=N, [ 0>=M ], cost: 1 669.01/291.71 669.01/291.71 84: evalsipmamergesort2bb15in -> evalsipmamergesort2bb19in : O'=N, [ 0>=N ], cost: 1 669.01/291.71 669.01/291.71 85: evalsipmamergesort2bb16in -> evalsipmamergesort2bb17in : [ free_4>=1+free_5 ], cost: 1 669.01/291.71 669.01/291.71 86: evalsipmamergesort2bb16in -> evalsipmamergesort2bb18in : [ free_7>=free_6 ], cost: 1 669.01/291.71 669.01/291.71 87: evalsipmamergesort2bb17in -> evalsipmamergesort2bb15in : M'=-1+M, [], cost: 1 669.01/291.71 669.01/291.71 88: evalsipmamergesort2bb18in -> evalsipmamergesort2bb15in : N'=-1+N, [], cost: 1 669.01/291.71 669.01/291.71 89: evalsipmamergesort2bb19in -> evalsipmamergesort2bb20in : [ O>=1 ], cost: 1 669.01/291.71 669.01/291.71 90: evalsipmamergesort2bb19in -> evalsipmamergesort2bb21in : P'=M, [ 0>=O ], cost: 1 669.01/291.71 669.01/291.71 91: evalsipmamergesort2bb20in -> evalsipmamergesort2bb19in : O'=-1+O, [], cost: 1 669.01/291.71 669.01/291.71 92: evalsipmamergesort2bb21in -> evalsipmamergesort2bb22in : [ P>=1 ], cost: 1 669.01/291.71 669.01/291.71 93: evalsipmamergesort2bb21in -> evalsipmamergesort2bb23in : [ 0>=P ], cost: 1 669.01/291.71 669.01/291.71 94: evalsipmamergesort2bb22in -> evalsipmamergesort2bb21in : P'=-1+P, [], cost: 1 669.01/291.71 669.01/291.71 95: evalsipmamergesort2bb23in -> evalsipmamergesort2142 : [], cost: 1 669.01/291.71 669.01/291.71 96: evalsipmamergesort2142 -> evalsipmamergesort2143 : [], cost: 1 669.01/291.71 669.01/291.71 97: evalsipmamergesort2143 -> evalsipmamergesort2144 : [], cost: 1 669.01/291.71 669.01/291.71 98: evalsipmamergesort2144 -> evalsipmamergesort2145 : [], cost: 1 669.01/291.71 669.01/291.71 99: evalsipmamergesort2145 -> evalsipmamergesort2146 : [], cost: 1 669.01/291.71 669.01/291.71 100: evalsipmamergesort2146 -> evalsipmamergesort2bb14in : K'=L, [ L>=1 ], cost: 1 669.01/291.71 669.01/291.71 101: evalsipmamergesort2146 -> evalsipmamergesort2bb24in : [ 0>=L ], cost: 1 669.01/291.71 669.01/291.71 102: evalsipmamergesort2bb24in -> evalsipmamergesort2147 : [], cost: 1 669.01/291.71 669.01/291.71 103: evalsipmamergesort2147 -> evalsipmamergesort2148 : [], cost: 1 669.01/291.71 669.01/291.71 104: evalsipmamergesort2148 -> evalsipmamergesort2149 : Q_1'=2*Q, [], cost: 1 669.01/291.71 669.01/291.71 105: evalsipmamergesort2149 -> evalsipmamergesort2150 : [], cost: 1 669.01/291.71 669.01/291.71 106: evalsipmamergesort2150 -> evalsipmamergesort2bb1in : A'=Q_1, [ C>=1+Q_1 ], cost: 1 669.01/291.71 669.01/291.71 107: evalsipmamergesort2150 -> evalsipmamergesort2bb25in : J'=1, [ Q_1>=C ], cost: 1 669.01/291.71 669.01/291.71 108: evalsipmamergesort2bb25in -> evalsipmamergesort2bb26in : R'=1, [ J==0 ], cost: 1 669.01/291.71 669.01/291.71 111: evalsipmamergesort2bb26in -> evalsipmamergesort2bb27in : [ C>=R ], cost: 1 669.01/291.71 669.01/291.71 113: evalsipmamergesort2bb27in -> evalsipmamergesort2bb26in : R'=1+R, [], cost: 1 669.01/291.71 669.01/291.71 669.01/291.71 669.01/291.71 Simplified all rules, resulting in: 669.01/291.71 669.01/291.71 Start location: evalsipmamergesort2start 669.01/291.71 669.01/291.71 0: evalsipmamergesort2start -> evalsipmamergesort2bb0in : [], cost: 1 669.01/291.71 669.01/291.71 1: evalsipmamergesort2bb0in -> evalsipmamergesort20 : [], cost: 1 669.01/291.71 669.01/291.71 2: evalsipmamergesort20 -> evalsipmamergesort21 : [], cost: 1 669.01/291.71 669.01/291.71 3: evalsipmamergesort21 -> evalsipmamergesort22 : [], cost: 1 669.01/291.71 669.01/291.71 4: evalsipmamergesort22 -> evalsipmamergesort23 : [], cost: 1 669.01/291.71 669.01/291.71 5: evalsipmamergesort23 -> evalsipmamergesort24 : [], cost: 1 669.01/291.71 669.01/291.71 6: evalsipmamergesort24 -> evalsipmamergesort25 : [], cost: 1 669.01/291.71 669.01/291.71 7: evalsipmamergesort25 -> evalsipmamergesort26 : [], cost: 1 669.01/291.71 669.01/291.71 8: evalsipmamergesort26 -> evalsipmamergesort27 : [], cost: 1 669.01/291.71 669.01/291.71 9: evalsipmamergesort27 -> evalsipmamergesort28 : [], cost: 1 669.01/291.71 669.01/291.71 10: evalsipmamergesort28 -> evalsipmamergesort29 : [], cost: 1 669.01/291.71 669.01/291.71 11: evalsipmamergesort29 -> evalsipmamergesort210 : [], cost: 1 669.01/291.71 669.01/291.71 12: evalsipmamergesort210 -> evalsipmamergesort211 : [], cost: 1 669.01/291.71 669.01/291.71 13: evalsipmamergesort211 -> evalsipmamergesort212 : [], cost: 1 669.01/291.71 669.01/291.71 14: evalsipmamergesort212 -> evalsipmamergesort213 : [], cost: 1 669.01/291.71 669.01/291.71 15: evalsipmamergesort213 -> evalsipmamergesort214 : [], cost: 1 669.01/291.71 669.01/291.71 16: evalsipmamergesort214 -> evalsipmamergesort215 : [], cost: 1 669.01/291.71 669.01/291.71 17: evalsipmamergesort215 -> evalsipmamergesort216 : [], cost: 1 669.01/291.71 669.01/291.71 18: evalsipmamergesort216 -> evalsipmamergesort217 : [], cost: 1 669.01/291.71 669.01/291.71 19: evalsipmamergesort217 -> evalsipmamergesort218 : [], cost: 1 669.01/291.71 669.01/291.71 20: evalsipmamergesort218 -> evalsipmamergesort219 : [], cost: 1 669.01/291.71 669.01/291.71 21: evalsipmamergesort219 -> evalsipmamergesort220 : [], cost: 1 669.01/291.71 669.01/291.71 22: evalsipmamergesort220 -> evalsipmamergesort221 : [], cost: 1 669.01/291.71 669.01/291.71 23: evalsipmamergesort221 -> evalsipmamergesort222 : [], cost: 1 669.01/291.71 669.01/291.71 24: evalsipmamergesort222 -> evalsipmamergesort2bb1in : A'=1, [], cost: 1 669.01/291.71 669.01/291.71 25: evalsipmamergesort2bb1in -> evalsipmamergesort2bb2in : B'=C, [], cost: 1 669.01/291.71 669.01/291.71 26: evalsipmamergesort2bb2in -> evalsipmamergesort2bb3in : D'=-2*A+B, E'=A, F'=A, [ B>=A && B>=2*A ], cost: 1 669.01/291.71 669.01/291.71 27: evalsipmamergesort2bb2in -> evalsipmamergesort2bb3in : D'=0, E'=A, F'=-A+B, [ B>=A && 2*A>=1+B ], cost: 1 669.01/291.71 669.01/291.71 28: evalsipmamergesort2bb2in -> evalsipmamergesort2bb3in : D'=-A, E'=B, F'=A, [ A>=1+B && 0>=A ], cost: 1 669.01/291.71 669.01/291.71 29: evalsipmamergesort2bb2in -> evalsipmamergesort2bb3in : D'=0, E'=B, F'=0, [ A>=1+B && A>=1 ], cost: 1 669.01/291.71 669.01/291.71 30: evalsipmamergesort2bb3in -> evalsipmamergesort2bb4in : [ E>=1 && F>=1 ], cost: 1 669.01/291.71 669.01/291.71 31: evalsipmamergesort2bb3in -> evalsipmamergesort2bb7in : G'=F, [ 0>=E ], cost: 1 669.01/291.71 669.01/291.71 32: evalsipmamergesort2bb3in -> evalsipmamergesort2bb7in : G'=F, [ 0>=F ], cost: 1 669.01/291.71 669.01/291.71 33: evalsipmamergesort2bb4in -> evalsipmamergesort2bb5in : [], cost: 1 669.01/291.71 669.01/291.71 34: evalsipmamergesort2bb4in -> evalsipmamergesort2bb6in : [], cost: 1 669.01/291.71 669.01/291.71 35: evalsipmamergesort2bb5in -> evalsipmamergesort2bb3in : E'=-1+E, [], cost: 1 669.01/291.71 669.01/291.71 36: evalsipmamergesort2bb6in -> evalsipmamergesort2bb3in : F'=-1+F, [], cost: 1 669.01/291.71 669.01/291.71 37: evalsipmamergesort2bb7in -> evalsipmamergesort2bb8in : [ G>=1 ], cost: 1 669.01/291.71 669.01/291.71 38: evalsipmamergesort2bb7in -> evalsipmamergesort2bb9in : H'=E, [ 0>=G ], cost: 1 669.01/291.71 669.01/291.71 39: evalsipmamergesort2bb8in -> evalsipmamergesort2bb7in : G'=-1+G, [], cost: 1 669.01/291.71 669.01/291.71 40: evalsipmamergesort2bb9in -> evalsipmamergesort2bb10in : [ H>=1 ], cost: 1 669.01/291.71 669.01/291.71 41: evalsipmamergesort2bb9in -> evalsipmamergesort2bb11in : [ 0>=H ], cost: 1 669.01/291.71 669.01/291.71 42: evalsipmamergesort2bb10in -> evalsipmamergesort2bb9in : H'=-1+H, [], cost: 1 669.01/291.71 669.01/291.71 43: evalsipmamergesort2bb11in -> evalsipmamergesort269 : [], cost: 1 669.01/291.71 669.01/291.71 44: evalsipmamergesort269 -> evalsipmamergesort270 : [], cost: 1 669.01/291.71 669.01/291.71 45: evalsipmamergesort270 -> evalsipmamergesort271 : [], cost: 1 669.01/291.71 669.01/291.71 46: evalsipmamergesort271 -> evalsipmamergesort272 : [], cost: 1 669.01/291.71 669.01/291.71 47: evalsipmamergesort272 -> evalsipmamergesort273 : [], cost: 1 669.01/291.71 669.01/291.71 48: evalsipmamergesort273 -> evalsipmamergesort2bb2in : B'=D, [ D>=1 ], cost: 1 669.01/291.71 669.01/291.71 49: evalsipmamergesort273 -> evalsipmamergesort2bb12in : [ 0>=D ], cost: 1 669.01/291.71 669.01/291.71 50: evalsipmamergesort2bb12in -> evalsipmamergesort274 : [], cost: 1 669.01/291.71 669.01/291.71 51: evalsipmamergesort274 -> evalsipmamergesort275 : [], cost: 1 669.01/291.71 669.01/291.71 52: evalsipmamergesort275 -> evalsipmamergesort276 : Q'=2*A, [], cost: 1 669.01/291.71 669.01/291.71 53: evalsipmamergesort276 -> evalsipmamergesort277 : [], cost: 1 669.01/291.71 669.01/291.71 54: evalsipmamergesort277 -> evalsipmamergesort2bb25in : J'=0, [ Q>=C ], cost: 1 669.01/291.71 669.01/291.71 55: evalsipmamergesort277 -> evalsipmamergesort2bb13in : [ C>=1+Q ], cost: 1 669.01/291.71 669.01/291.71 56: evalsipmamergesort2bb13in -> evalsipmamergesort278 : [], cost: 1 669.01/291.71 669.01/291.71 57: evalsipmamergesort278 -> evalsipmamergesort279 : [], cost: 1 669.01/291.71 669.01/291.71 58: evalsipmamergesort279 -> evalsipmamergesort280 : [], cost: 1 669.01/291.71 669.01/291.71 59: evalsipmamergesort280 -> evalsipmamergesort281 : [], cost: 1 669.01/291.71 669.01/291.71 60: evalsipmamergesort281 -> evalsipmamergesort282 : [], cost: 1 669.01/291.71 669.01/291.71 61: evalsipmamergesort282 -> evalsipmamergesort283 : [], cost: 1 669.01/291.71 669.01/291.71 62: evalsipmamergesort283 -> evalsipmamergesort284 : [], cost: 1 669.01/291.71 669.01/291.71 63: evalsipmamergesort284 -> evalsipmamergesort285 : [], cost: 1 669.01/291.71 669.01/291.71 64: evalsipmamergesort285 -> evalsipmamergesort286 : [], cost: 1 669.01/291.71 669.01/291.71 65: evalsipmamergesort286 -> evalsipmamergesort287 : [], cost: 1 669.01/291.71 669.01/291.71 66: evalsipmamergesort287 -> evalsipmamergesort288 : [], cost: 1 669.01/291.71 669.01/291.71 67: evalsipmamergesort288 -> evalsipmamergesort289 : [], cost: 1 669.01/291.71 669.01/291.71 68: evalsipmamergesort289 -> evalsipmamergesort290 : [], cost: 1 669.01/291.71 669.01/291.71 69: evalsipmamergesort290 -> evalsipmamergesort291 : [], cost: 1 669.01/291.71 669.01/291.71 70: evalsipmamergesort291 -> evalsipmamergesort292 : [], cost: 1 669.01/291.71 669.01/291.71 71: evalsipmamergesort292 -> evalsipmamergesort293 : [], cost: 1 669.01/291.71 669.01/291.71 72: evalsipmamergesort293 -> evalsipmamergesort294 : [], cost: 1 669.01/291.71 669.01/291.71 73: evalsipmamergesort294 -> evalsipmamergesort295 : [], cost: 1 669.01/291.71 669.01/291.71 74: evalsipmamergesort295 -> evalsipmamergesort296 : [], cost: 1 669.01/291.71 669.01/291.71 75: evalsipmamergesort296 -> evalsipmamergesort297 : [], cost: 1 669.01/291.71 669.01/291.71 76: evalsipmamergesort297 -> evalsipmamergesort298 : [], cost: 1 669.01/291.71 669.01/291.71 77: evalsipmamergesort298 -> evalsipmamergesort2bb14in : K'=C, [], cost: 1 669.01/291.71 669.01/291.71 78: evalsipmamergesort2bb14in -> evalsipmamergesort2bb15in : L'=-2*Q+K, M'=Q, N'=Q, [ K>=Q && K>=2*Q ], cost: 1 669.01/291.71 669.01/291.71 79: evalsipmamergesort2bb14in -> evalsipmamergesort2bb15in : L'=0, M'=Q, N'=-Q+K, [ K>=Q && 2*Q>=1+K ], cost: 1 669.01/291.71 669.01/291.71 80: evalsipmamergesort2bb14in -> evalsipmamergesort2bb15in : L'=-Q, M'=K, N'=Q, [ Q>=1+K && 0>=Q ], cost: 1 669.01/291.71 669.01/291.71 81: evalsipmamergesort2bb14in -> evalsipmamergesort2bb15in : L'=0, M'=K, N'=0, [ Q>=1+K && Q>=1 ], cost: 1 669.01/291.71 669.01/291.71 82: evalsipmamergesort2bb15in -> evalsipmamergesort2bb16in : [ M>=1 && N>=1 ], cost: 1 669.01/291.71 669.01/291.71 83: evalsipmamergesort2bb15in -> evalsipmamergesort2bb19in : O'=N, [ 0>=M ], cost: 1 669.01/291.71 669.01/291.71 84: evalsipmamergesort2bb15in -> evalsipmamergesort2bb19in : O'=N, [ 0>=N ], cost: 1 669.01/291.71 669.01/291.71 85: evalsipmamergesort2bb16in -> evalsipmamergesort2bb17in : [], cost: 1 669.01/291.71 669.01/291.71 86: evalsipmamergesort2bb16in -> evalsipmamergesort2bb18in : [], cost: 1 669.01/291.71 669.01/291.71 87: evalsipmamergesort2bb17in -> evalsipmamergesort2bb15in : M'=-1+M, [], cost: 1 669.01/291.71 669.01/291.71 88: evalsipmamergesort2bb18in -> evalsipmamergesort2bb15in : N'=-1+N, [], cost: 1 669.01/291.71 669.01/291.71 89: evalsipmamergesort2bb19in -> evalsipmamergesort2bb20in : [ O>=1 ], cost: 1 669.01/291.71 669.01/291.71 90: evalsipmamergesort2bb19in -> evalsipmamergesort2bb21in : P'=M, [ 0>=O ], cost: 1 669.01/291.71 669.01/291.71 91: evalsipmamergesort2bb20in -> evalsipmamergesort2bb19in : O'=-1+O, [], cost: 1 669.01/291.71 669.01/291.71 92: evalsipmamergesort2bb21in -> evalsipmamergesort2bb22in : [ P>=1 ], cost: 1 669.01/291.71 669.01/291.71 93: evalsipmamergesort2bb21in -> evalsipmamergesort2bb23in : [ 0>=P ], cost: 1 669.01/291.71 669.01/291.71 94: evalsipmamergesort2bb22in -> evalsipmamergesort2bb21in : P'=-1+P, [], cost: 1 669.01/291.71 669.01/291.71 95: evalsipmamergesort2bb23in -> evalsipmamergesort2142 : [], cost: 1 669.01/291.71 669.01/291.71 96: evalsipmamergesort2142 -> evalsipmamergesort2143 : [], cost: 1 669.01/291.71 669.01/291.71 97: evalsipmamergesort2143 -> evalsipmamergesort2144 : [], cost: 1 669.01/291.71 669.01/291.71 98: evalsipmamergesort2144 -> evalsipmamergesort2145 : [], cost: 1 669.01/291.71 669.01/291.71 99: evalsipmamergesort2145 -> evalsipmamergesort2146 : [], cost: 1 669.01/291.71 669.01/291.71 100: evalsipmamergesort2146 -> evalsipmamergesort2bb14in : K'=L, [ L>=1 ], cost: 1 669.01/291.71 669.01/291.71 101: evalsipmamergesort2146 -> evalsipmamergesort2bb24in : [ 0>=L ], cost: 1 669.01/291.71 669.01/291.71 102: evalsipmamergesort2bb24in -> evalsipmamergesort2147 : [], cost: 1 669.01/291.71 669.01/291.71 103: evalsipmamergesort2147 -> evalsipmamergesort2148 : [], cost: 1 669.01/291.71 669.01/291.71 104: evalsipmamergesort2148 -> evalsipmamergesort2149 : Q_1'=2*Q, [], cost: 1 669.01/291.71 669.01/291.71 105: evalsipmamergesort2149 -> evalsipmamergesort2150 : [], cost: 1 669.01/291.71 669.01/291.71 106: evalsipmamergesort2150 -> evalsipmamergesort2bb1in : A'=Q_1, [ C>=1+Q_1 ], cost: 1 669.01/291.71 669.01/291.71 107: evalsipmamergesort2150 -> evalsipmamergesort2bb25in : J'=1, [ Q_1>=C ], cost: 1 669.01/291.71 669.01/291.71 108: evalsipmamergesort2bb25in -> evalsipmamergesort2bb26in : R'=1, [ J==0 ], cost: 1 669.01/291.71 669.01/291.71 111: evalsipmamergesort2bb26in -> evalsipmamergesort2bb27in : [ C>=R ], cost: 1 669.01/291.71 669.01/291.71 113: evalsipmamergesort2bb27in -> evalsipmamergesort2bb26in : R'=1+R, [], cost: 1 669.01/291.71 669.01/291.71 669.01/291.71 669.01/291.71 ### Simplification by acceleration and chaining ### 669.01/291.71 669.01/291.71 669.01/291.71 669.01/291.71 Eliminated locations (on linear paths): 669.01/291.71 669.01/291.71 Start location: evalsipmamergesort2start 669.01/291.71 669.01/291.71 138: evalsipmamergesort2start -> evalsipmamergesort2bb1in : A'=1, [], cost: 25 669.01/291.71 669.01/291.71 25: evalsipmamergesort2bb1in -> evalsipmamergesort2bb2in : B'=C, [], cost: 1 669.01/291.71 669.01/291.71 26: evalsipmamergesort2bb2in -> evalsipmamergesort2bb3in : D'=-2*A+B, E'=A, F'=A, [ B>=A && B>=2*A ], cost: 1 669.01/291.71 669.01/291.71 27: evalsipmamergesort2bb2in -> evalsipmamergesort2bb3in : D'=0, E'=A, F'=-A+B, [ B>=A && 2*A>=1+B ], cost: 1 669.01/291.71 669.01/291.71 28: evalsipmamergesort2bb2in -> evalsipmamergesort2bb3in : D'=-A, E'=B, F'=A, [ A>=1+B && 0>=A ], cost: 1 669.01/291.71 669.01/291.71 29: evalsipmamergesort2bb2in -> evalsipmamergesort2bb3in : D'=0, E'=B, F'=0, [ A>=1+B && A>=1 ], cost: 1 669.01/291.71 669.01/291.71 30: evalsipmamergesort2bb3in -> evalsipmamergesort2bb4in : [ E>=1 && F>=1 ], cost: 1 669.01/291.71 669.01/291.71 31: evalsipmamergesort2bb3in -> evalsipmamergesort2bb7in : G'=F, [ 0>=E ], cost: 1 669.01/291.71 669.01/291.71 32: evalsipmamergesort2bb3in -> evalsipmamergesort2bb7in : G'=F, [ 0>=F ], cost: 1 669.01/291.71 669.01/291.71 139: evalsipmamergesort2bb4in -> evalsipmamergesort2bb3in : E'=-1+E, [], cost: 2 669.01/291.71 669.01/291.71 140: evalsipmamergesort2bb4in -> evalsipmamergesort2bb3in : F'=-1+F, [], cost: 2 669.01/291.71 669.01/291.71 38: evalsipmamergesort2bb7in -> evalsipmamergesort2bb9in : H'=E, [ 0>=G ], cost: 1 669.01/291.71 669.01/291.71 141: evalsipmamergesort2bb7in -> evalsipmamergesort2bb7in : G'=-1+G, [ G>=1 ], cost: 2 669.01/291.71 669.01/291.71 142: evalsipmamergesort2bb9in -> evalsipmamergesort2bb9in : H'=-1+H, [ H>=1 ], cost: 2 669.01/291.71 669.01/291.71 147: evalsipmamergesort2bb9in -> evalsipmamergesort273 : [ 0>=H ], cost: 6 669.01/291.71 669.01/291.71 48: evalsipmamergesort273 -> evalsipmamergesort2bb2in : B'=D, [ D>=1 ], cost: 1 669.01/291.71 669.01/291.71 151: evalsipmamergesort273 -> evalsipmamergesort277 : Q'=2*A, [ 0>=D ], cost: 5 669.01/291.71 669.01/291.71 54: evalsipmamergesort277 -> evalsipmamergesort2bb25in : J'=0, [ Q>=C ], cost: 1 669.01/291.71 669.01/291.71 173: evalsipmamergesort277 -> evalsipmamergesort2bb14in : K'=C, [ C>=1+Q ], cost: 23 669.01/291.71 669.01/291.71 78: evalsipmamergesort2bb14in -> evalsipmamergesort2bb15in : L'=-2*Q+K, M'=Q, N'=Q, [ K>=Q && K>=2*Q ], cost: 1 669.01/291.71 669.01/291.71 79: evalsipmamergesort2bb14in -> evalsipmamergesort2bb15in : L'=0, M'=Q, N'=-Q+K, [ K>=Q && 2*Q>=1+K ], cost: 1 669.01/291.71 669.01/291.71 80: evalsipmamergesort2bb14in -> evalsipmamergesort2bb15in : L'=-Q, M'=K, N'=Q, [ Q>=1+K && 0>=Q ], cost: 1 669.01/291.71 669.01/291.71 81: evalsipmamergesort2bb14in -> evalsipmamergesort2bb15in : L'=0, M'=K, N'=0, [ Q>=1+K && Q>=1 ], cost: 1 669.01/291.71 669.01/291.71 82: evalsipmamergesort2bb15in -> evalsipmamergesort2bb16in : [ M>=1 && N>=1 ], cost: 1 669.01/291.71 669.01/291.71 83: evalsipmamergesort2bb15in -> evalsipmamergesort2bb19in : O'=N, [ 0>=M ], cost: 1 669.01/291.71 669.01/291.71 84: evalsipmamergesort2bb15in -> evalsipmamergesort2bb19in : O'=N, [ 0>=N ], cost: 1 669.01/291.71 669.01/291.71 174: evalsipmamergesort2bb16in -> evalsipmamergesort2bb15in : M'=-1+M, [], cost: 2 669.01/291.71 669.01/291.71 175: evalsipmamergesort2bb16in -> evalsipmamergesort2bb15in : N'=-1+N, [], cost: 2 669.01/291.71 669.01/291.71 90: evalsipmamergesort2bb19in -> evalsipmamergesort2bb21in : P'=M, [ 0>=O ], cost: 1 669.01/291.71 669.01/291.71 176: evalsipmamergesort2bb19in -> evalsipmamergesort2bb19in : O'=-1+O, [ O>=1 ], cost: 2 669.01/291.71 669.01/291.71 177: evalsipmamergesort2bb21in -> evalsipmamergesort2bb21in : P'=-1+P, [ P>=1 ], cost: 2 669.01/291.71 669.01/291.71 182: evalsipmamergesort2bb21in -> evalsipmamergesort2146 : [ 0>=P ], cost: 6 669.01/291.71 669.01/291.71 100: evalsipmamergesort2146 -> evalsipmamergesort2bb14in : K'=L, [ L>=1 ], cost: 1 669.01/291.71 669.01/291.71 186: evalsipmamergesort2146 -> evalsipmamergesort2150 : Q_1'=2*Q, [ 0>=L ], cost: 5 669.01/291.71 669.01/291.71 106: evalsipmamergesort2150 -> evalsipmamergesort2bb1in : A'=Q_1, [ C>=1+Q_1 ], cost: 1 669.01/291.71 669.01/291.71 107: evalsipmamergesort2150 -> evalsipmamergesort2bb25in : J'=1, [ Q_1>=C ], cost: 1 669.01/291.71 669.01/291.71 108: evalsipmamergesort2bb25in -> evalsipmamergesort2bb26in : R'=1, [ J==0 ], cost: 1 669.01/291.71 669.01/291.71 187: evalsipmamergesort2bb26in -> evalsipmamergesort2bb26in : R'=1+R, [ C>=R ], cost: 2 669.01/291.71 669.01/291.71 669.01/291.71 669.01/291.71 Accelerating simple loops of location 31. 669.01/291.71 669.01/291.71 Accelerating the following rules: 669.01/291.71 669.01/291.71 141: evalsipmamergesort2bb7in -> evalsipmamergesort2bb7in : G'=-1+G, [ G>=1 ], cost: 2 669.01/291.71 669.01/291.71 669.01/291.71 669.01/291.71 Accelerated rule 141 with metering function G, yielding the new rule 188. 669.01/291.71 669.01/291.71 Removing the simple loops: 141. 669.01/291.71 669.01/291.71 669.01/291.71 669.01/291.71 Accelerating simple loops of location 33. 669.01/291.71 669.01/291.71 Accelerating the following rules: 669.01/291.71 669.01/291.71 142: evalsipmamergesort2bb9in -> evalsipmamergesort2bb9in : H'=-1+H, [ H>=1 ], cost: 2 669.01/291.71 669.01/291.71 669.01/291.71 669.01/291.71 Accelerated rule 142 with metering function H, yielding the new rule 189. 669.01/291.71 669.01/291.71 Removing the simple loops: 142. 669.01/291.71 669.01/291.71 669.01/291.71 669.01/291.71 Accelerating simple loops of location 73. 669.01/291.71 669.01/291.71 Accelerating the following rules: 669.01/291.71 669.01/291.71 176: evalsipmamergesort2bb19in -> evalsipmamergesort2bb19in : O'=-1+O, [ O>=1 ], cost: 2 669.01/291.71 669.01/291.71 669.01/291.71 669.01/291.71 Accelerated rule 176 with metering function O, yielding the new rule 190. 669.01/291.71 669.01/291.71 Removing the simple loops: 176. 669.01/291.71 669.01/291.71 669.01/291.71 669.01/291.71 Accelerating simple loops of location 75. 669.01/291.71 669.01/291.71 Accelerating the following rules: 669.01/291.71 669.01/291.71 177: evalsipmamergesort2bb21in -> evalsipmamergesort2bb21in : P'=-1+P, [ P>=1 ], cost: 2 669.01/291.71 669.01/291.71 669.01/291.71 669.01/291.71 Accelerated rule 177 with metering function P, yielding the new rule 191. 669.01/291.71 669.01/291.71 Removing the simple loops: 177. 669.01/291.71 669.01/291.71 669.01/291.71 669.01/291.71 Accelerating simple loops of location 89. 669.01/291.71 669.01/291.71 Accelerating the following rules: 669.01/291.71 669.01/291.71 187: evalsipmamergesort2bb26in -> evalsipmamergesort2bb26in : R'=1+R, [ C>=R ], cost: 2 669.01/291.71 669.01/291.71 669.01/291.71 669.01/291.71 Accelerated rule 187 with metering function 1+C-R, yielding the new rule 192. 669.01/291.71 669.01/291.71 Removing the simple loops: 187. 669.01/291.71 669.01/291.71 669.01/291.71 669.01/291.71 Accelerated all simple loops using metering functions (where possible): 669.01/291.71 669.01/291.71 Start location: evalsipmamergesort2start 669.01/291.71 669.01/291.71 138: evalsipmamergesort2start -> evalsipmamergesort2bb1in : A'=1, [], cost: 25 669.01/291.71 669.01/291.71 25: evalsipmamergesort2bb1in -> evalsipmamergesort2bb2in : B'=C, [], cost: 1 669.01/291.71 669.01/291.71 26: evalsipmamergesort2bb2in -> evalsipmamergesort2bb3in : D'=-2*A+B, E'=A, F'=A, [ B>=A && B>=2*A ], cost: 1 669.01/291.71 669.01/291.71 27: evalsipmamergesort2bb2in -> evalsipmamergesort2bb3in : D'=0, E'=A, F'=-A+B, [ B>=A && 2*A>=1+B ], cost: 1 669.01/291.71 669.01/291.71 28: evalsipmamergesort2bb2in -> evalsipmamergesort2bb3in : D'=-A, E'=B, F'=A, [ A>=1+B && 0>=A ], cost: 1 669.01/291.71 669.01/291.71 29: evalsipmamergesort2bb2in -> evalsipmamergesort2bb3in : D'=0, E'=B, F'=0, [ A>=1+B && A>=1 ], cost: 1 669.01/291.71 669.01/291.71 30: evalsipmamergesort2bb3in -> evalsipmamergesort2bb4in : [ E>=1 && F>=1 ], cost: 1 669.01/291.71 669.01/291.71 31: evalsipmamergesort2bb3in -> evalsipmamergesort2bb7in : G'=F, [ 0>=E ], cost: 1 669.01/291.71 669.01/291.71 32: evalsipmamergesort2bb3in -> evalsipmamergesort2bb7in : G'=F, [ 0>=F ], cost: 1 669.01/291.71 669.01/291.71 139: evalsipmamergesort2bb4in -> evalsipmamergesort2bb3in : E'=-1+E, [], cost: 2 669.01/291.71 669.01/291.71 140: evalsipmamergesort2bb4in -> evalsipmamergesort2bb3in : F'=-1+F, [], cost: 2 669.01/291.71 669.01/291.71 38: evalsipmamergesort2bb7in -> evalsipmamergesort2bb9in : H'=E, [ 0>=G ], cost: 1 669.01/291.71 669.01/291.71 188: evalsipmamergesort2bb7in -> evalsipmamergesort2bb7in : G'=0, [ G>=1 ], cost: 2*G 669.01/291.71 669.01/291.71 147: evalsipmamergesort2bb9in -> evalsipmamergesort273 : [ 0>=H ], cost: 6 669.01/291.71 669.01/291.71 189: evalsipmamergesort2bb9in -> evalsipmamergesort2bb9in : H'=0, [ H>=1 ], cost: 2*H 669.01/291.71 669.01/291.71 48: evalsipmamergesort273 -> evalsipmamergesort2bb2in : B'=D, [ D>=1 ], cost: 1 669.01/291.71 669.01/291.71 151: evalsipmamergesort273 -> evalsipmamergesort277 : Q'=2*A, [ 0>=D ], cost: 5 669.01/291.71 669.01/291.71 54: evalsipmamergesort277 -> evalsipmamergesort2bb25in : J'=0, [ Q>=C ], cost: 1 669.01/291.71 669.01/291.71 173: evalsipmamergesort277 -> evalsipmamergesort2bb14in : K'=C, [ C>=1+Q ], cost: 23 669.01/291.71 669.01/291.71 78: evalsipmamergesort2bb14in -> evalsipmamergesort2bb15in : L'=-2*Q+K, M'=Q, N'=Q, [ K>=Q && K>=2*Q ], cost: 1 669.01/291.71 669.01/291.71 79: evalsipmamergesort2bb14in -> evalsipmamergesort2bb15in : L'=0, M'=Q, N'=-Q+K, [ K>=Q && 2*Q>=1+K ], cost: 1 669.01/291.71 669.01/291.71 80: evalsipmamergesort2bb14in -> evalsipmamergesort2bb15in : L'=-Q, M'=K, N'=Q, [ Q>=1+K && 0>=Q ], cost: 1 669.01/291.71 669.01/291.71 81: evalsipmamergesort2bb14in -> evalsipmamergesort2bb15in : L'=0, M'=K, N'=0, [ Q>=1+K && Q>=1 ], cost: 1 669.01/291.71 669.01/291.71 82: evalsipmamergesort2bb15in -> evalsipmamergesort2bb16in : [ M>=1 && N>=1 ], cost: 1 669.01/291.71 669.01/291.71 83: evalsipmamergesort2bb15in -> evalsipmamergesort2bb19in : O'=N, [ 0>=M ], cost: 1 669.01/291.71 669.01/291.71 84: evalsipmamergesort2bb15in -> evalsipmamergesort2bb19in : O'=N, [ 0>=N ], cost: 1 669.01/291.71 669.01/291.71 174: evalsipmamergesort2bb16in -> evalsipmamergesort2bb15in : M'=-1+M, [], cost: 2 669.01/291.71 669.01/291.71 175: evalsipmamergesort2bb16in -> evalsipmamergesort2bb15in : N'=-1+N, [], cost: 2 669.01/291.71 669.01/291.71 90: evalsipmamergesort2bb19in -> evalsipmamergesort2bb21in : P'=M, [ 0>=O ], cost: 1 669.01/291.71 669.01/291.71 190: evalsipmamergesort2bb19in -> evalsipmamergesort2bb19in : O'=0, [ O>=1 ], cost: 2*O 669.01/291.71 669.01/291.71 182: evalsipmamergesort2bb21in -> evalsipmamergesort2146 : [ 0>=P ], cost: 6 669.01/291.71 669.01/291.71 191: evalsipmamergesort2bb21in -> evalsipmamergesort2bb21in : P'=0, [ P>=1 ], cost: 2*P 669.01/291.71 669.01/291.71 100: evalsipmamergesort2146 -> evalsipmamergesort2bb14in : K'=L, [ L>=1 ], cost: 1 669.01/291.71 669.01/291.71 186: evalsipmamergesort2146 -> evalsipmamergesort2150 : Q_1'=2*Q, [ 0>=L ], cost: 5 669.01/291.71 669.01/291.71 106: evalsipmamergesort2150 -> evalsipmamergesort2bb1in : A'=Q_1, [ C>=1+Q_1 ], cost: 1 669.01/291.71 669.01/291.71 107: evalsipmamergesort2150 -> evalsipmamergesort2bb25in : J'=1, [ Q_1>=C ], cost: 1 669.01/291.71 669.01/291.71 108: evalsipmamergesort2bb25in -> evalsipmamergesort2bb26in : R'=1, [ J==0 ], cost: 1 669.01/291.71 669.01/291.71 192: evalsipmamergesort2bb26in -> evalsipmamergesort2bb26in : R'=1+C, [ C>=R ], cost: 2+2*C-2*R 669.01/291.71 669.01/291.71 669.01/291.71 669.01/291.71 Chained accelerated rules (with incoming rules): 669.01/291.71 669.01/291.71 Start location: evalsipmamergesort2start 669.01/291.71 669.01/291.71 138: evalsipmamergesort2start -> evalsipmamergesort2bb1in : A'=1, [], cost: 25 669.01/291.71 669.01/291.71 25: evalsipmamergesort2bb1in -> evalsipmamergesort2bb2in : B'=C, [], cost: 1 669.01/291.71 669.01/291.71 26: evalsipmamergesort2bb2in -> evalsipmamergesort2bb3in : D'=-2*A+B, E'=A, F'=A, [ B>=A && B>=2*A ], cost: 1 669.01/291.71 669.01/291.71 27: evalsipmamergesort2bb2in -> evalsipmamergesort2bb3in : D'=0, E'=A, F'=-A+B, [ B>=A && 2*A>=1+B ], cost: 1 669.01/291.71 669.01/291.71 28: evalsipmamergesort2bb2in -> evalsipmamergesort2bb3in : D'=-A, E'=B, F'=A, [ A>=1+B && 0>=A ], cost: 1 669.01/291.71 669.01/291.71 29: evalsipmamergesort2bb2in -> evalsipmamergesort2bb3in : D'=0, E'=B, F'=0, [ A>=1+B && A>=1 ], cost: 1 669.01/291.71 669.01/291.71 30: evalsipmamergesort2bb3in -> evalsipmamergesort2bb4in : [ E>=1 && F>=1 ], cost: 1 669.01/291.71 669.01/291.71 31: evalsipmamergesort2bb3in -> evalsipmamergesort2bb7in : G'=F, [ 0>=E ], cost: 1 669.01/291.71 669.01/291.71 32: evalsipmamergesort2bb3in -> evalsipmamergesort2bb7in : G'=F, [ 0>=F ], cost: 1 669.01/291.71 669.01/291.71 193: evalsipmamergesort2bb3in -> evalsipmamergesort2bb7in : G'=0, [ 0>=E && F>=1 ], cost: 1+2*F 669.01/291.71 669.01/291.71 139: evalsipmamergesort2bb4in -> evalsipmamergesort2bb3in : E'=-1+E, [], cost: 2 669.01/291.71 669.01/291.71 140: evalsipmamergesort2bb4in -> evalsipmamergesort2bb3in : F'=-1+F, [], cost: 2 669.01/291.71 669.01/291.71 38: evalsipmamergesort2bb7in -> evalsipmamergesort2bb9in : H'=E, [ 0>=G ], cost: 1 669.01/291.71 669.01/291.71 194: evalsipmamergesort2bb7in -> evalsipmamergesort2bb9in : H'=0, [ 0>=G && E>=1 ], cost: 1+2*E 669.01/291.71 669.01/291.71 147: evalsipmamergesort2bb9in -> evalsipmamergesort273 : [ 0>=H ], cost: 6 669.01/291.71 669.01/291.71 48: evalsipmamergesort273 -> evalsipmamergesort2bb2in : B'=D, [ D>=1 ], cost: 1 669.01/291.71 669.01/291.71 151: evalsipmamergesort273 -> evalsipmamergesort277 : Q'=2*A, [ 0>=D ], cost: 5 669.01/291.71 669.01/291.71 54: evalsipmamergesort277 -> evalsipmamergesort2bb25in : J'=0, [ Q>=C ], cost: 1 669.01/291.71 669.01/291.71 173: evalsipmamergesort277 -> evalsipmamergesort2bb14in : K'=C, [ C>=1+Q ], cost: 23 669.01/291.71 669.01/291.71 78: evalsipmamergesort2bb14in -> evalsipmamergesort2bb15in : L'=-2*Q+K, M'=Q, N'=Q, [ K>=Q && K>=2*Q ], cost: 1 669.01/291.71 669.01/291.71 79: evalsipmamergesort2bb14in -> evalsipmamergesort2bb15in : L'=0, M'=Q, N'=-Q+K, [ K>=Q && 2*Q>=1+K ], cost: 1 669.01/291.71 669.01/291.71 80: evalsipmamergesort2bb14in -> evalsipmamergesort2bb15in : L'=-Q, M'=K, N'=Q, [ Q>=1+K && 0>=Q ], cost: 1 669.01/291.71 669.01/291.71 81: evalsipmamergesort2bb14in -> evalsipmamergesort2bb15in : L'=0, M'=K, N'=0, [ Q>=1+K && Q>=1 ], cost: 1 669.01/291.71 669.01/291.71 82: evalsipmamergesort2bb15in -> evalsipmamergesort2bb16in : [ M>=1 && N>=1 ], cost: 1 669.01/291.71 669.01/291.71 83: evalsipmamergesort2bb15in -> evalsipmamergesort2bb19in : O'=N, [ 0>=M ], cost: 1 669.01/291.71 669.01/291.71 84: evalsipmamergesort2bb15in -> evalsipmamergesort2bb19in : O'=N, [ 0>=N ], cost: 1 669.01/291.71 669.01/291.71 195: evalsipmamergesort2bb15in -> evalsipmamergesort2bb19in : O'=0, [ 0>=M && N>=1 ], cost: 1+2*N 669.01/291.71 669.01/291.71 174: evalsipmamergesort2bb16in -> evalsipmamergesort2bb15in : M'=-1+M, [], cost: 2 669.01/291.71 669.01/291.71 175: evalsipmamergesort2bb16in -> evalsipmamergesort2bb15in : N'=-1+N, [], cost: 2 669.01/291.71 669.01/291.71 90: evalsipmamergesort2bb19in -> evalsipmamergesort2bb21in : P'=M, [ 0>=O ], cost: 1 669.01/291.71 669.01/291.71 196: evalsipmamergesort2bb19in -> evalsipmamergesort2bb21in : P'=0, [ 0>=O && M>=1 ], cost: 1+2*M 669.01/291.71 669.01/291.71 182: evalsipmamergesort2bb21in -> evalsipmamergesort2146 : [ 0>=P ], cost: 6 669.01/291.71 669.01/291.71 100: evalsipmamergesort2146 -> evalsipmamergesort2bb14in : K'=L, [ L>=1 ], cost: 1 669.01/291.71 669.01/291.71 186: evalsipmamergesort2146 -> evalsipmamergesort2150 : Q_1'=2*Q, [ 0>=L ], cost: 5 669.01/291.71 669.01/291.71 106: evalsipmamergesort2150 -> evalsipmamergesort2bb1in : A'=Q_1, [ C>=1+Q_1 ], cost: 1 669.01/291.71 669.01/291.71 107: evalsipmamergesort2150 -> evalsipmamergesort2bb25in : J'=1, [ Q_1>=C ], cost: 1 669.01/291.71 669.01/291.71 108: evalsipmamergesort2bb25in -> evalsipmamergesort2bb26in : R'=1, [ J==0 ], cost: 1 669.01/291.71 669.01/291.71 197: evalsipmamergesort2bb25in -> evalsipmamergesort2bb26in : R'=1+C, [ J==0 && C>=1 ], cost: 1+2*C 669.01/291.71 669.01/291.71 669.01/291.71 669.01/291.71 Removed unreachable locations (and leaf rules with constant cost): 669.01/291.71 669.01/291.71 Start location: evalsipmamergesort2start 669.01/291.71 669.01/291.71 138: evalsipmamergesort2start -> evalsipmamergesort2bb1in : A'=1, [], cost: 25 669.01/291.71 669.01/291.71 25: evalsipmamergesort2bb1in -> evalsipmamergesort2bb2in : B'=C, [], cost: 1 669.01/291.71 669.01/291.71 26: evalsipmamergesort2bb2in -> evalsipmamergesort2bb3in : D'=-2*A+B, E'=A, F'=A, [ B>=A && B>=2*A ], cost: 1 669.01/291.71 669.01/291.71 27: evalsipmamergesort2bb2in -> evalsipmamergesort2bb3in : D'=0, E'=A, F'=-A+B, [ B>=A && 2*A>=1+B ], cost: 1 669.01/291.71 669.01/291.71 28: evalsipmamergesort2bb2in -> evalsipmamergesort2bb3in : D'=-A, E'=B, F'=A, [ A>=1+B && 0>=A ], cost: 1 669.01/291.71 669.01/291.71 29: evalsipmamergesort2bb2in -> evalsipmamergesort2bb3in : D'=0, E'=B, F'=0, [ A>=1+B && A>=1 ], cost: 1 669.01/291.71 669.01/291.71 30: evalsipmamergesort2bb3in -> evalsipmamergesort2bb4in : [ E>=1 && F>=1 ], cost: 1 669.01/291.71 669.01/291.71 31: evalsipmamergesort2bb3in -> evalsipmamergesort2bb7in : G'=F, [ 0>=E ], cost: 1 669.01/291.71 669.01/291.71 32: evalsipmamergesort2bb3in -> evalsipmamergesort2bb7in : G'=F, [ 0>=F ], cost: 1 669.01/291.71 669.01/291.71 193: evalsipmamergesort2bb3in -> evalsipmamergesort2bb7in : G'=0, [ 0>=E && F>=1 ], cost: 1+2*F 669.01/291.71 669.01/291.71 139: evalsipmamergesort2bb4in -> evalsipmamergesort2bb3in : E'=-1+E, [], cost: 2 669.01/291.71 669.01/291.71 140: evalsipmamergesort2bb4in -> evalsipmamergesort2bb3in : F'=-1+F, [], cost: 2 669.01/291.71 669.01/291.71 38: evalsipmamergesort2bb7in -> evalsipmamergesort2bb9in : H'=E, [ 0>=G ], cost: 1 669.01/291.71 669.01/291.71 194: evalsipmamergesort2bb7in -> evalsipmamergesort2bb9in : H'=0, [ 0>=G && E>=1 ], cost: 1+2*E 669.01/291.71 669.01/291.71 147: evalsipmamergesort2bb9in -> evalsipmamergesort273 : [ 0>=H ], cost: 6 669.01/291.71 669.01/291.71 48: evalsipmamergesort273 -> evalsipmamergesort2bb2in : B'=D, [ D>=1 ], cost: 1 669.01/291.71 669.01/291.71 151: evalsipmamergesort273 -> evalsipmamergesort277 : Q'=2*A, [ 0>=D ], cost: 5 669.01/291.71 669.01/291.71 54: evalsipmamergesort277 -> evalsipmamergesort2bb25in : J'=0, [ Q>=C ], cost: 1 669.01/291.71 669.01/291.71 173: evalsipmamergesort277 -> evalsipmamergesort2bb14in : K'=C, [ C>=1+Q ], cost: 23 669.01/291.71 669.01/291.71 78: evalsipmamergesort2bb14in -> evalsipmamergesort2bb15in : L'=-2*Q+K, M'=Q, N'=Q, [ K>=Q && K>=2*Q ], cost: 1 669.01/291.71 669.01/291.71 79: evalsipmamergesort2bb14in -> evalsipmamergesort2bb15in : L'=0, M'=Q, N'=-Q+K, [ K>=Q && 2*Q>=1+K ], cost: 1 669.01/291.71 669.01/291.71 80: evalsipmamergesort2bb14in -> evalsipmamergesort2bb15in : L'=-Q, M'=K, N'=Q, [ Q>=1+K && 0>=Q ], cost: 1 669.01/291.71 669.01/291.71 81: evalsipmamergesort2bb14in -> evalsipmamergesort2bb15in : L'=0, M'=K, N'=0, [ Q>=1+K && Q>=1 ], cost: 1 669.01/291.71 669.01/291.71 82: evalsipmamergesort2bb15in -> evalsipmamergesort2bb16in : [ M>=1 && N>=1 ], cost: 1 669.01/291.71 669.01/291.71 83: evalsipmamergesort2bb15in -> evalsipmamergesort2bb19in : O'=N, [ 0>=M ], cost: 1 669.01/291.71 669.01/291.71 84: evalsipmamergesort2bb15in -> evalsipmamergesort2bb19in : O'=N, [ 0>=N ], cost: 1 669.01/291.71 669.01/291.71 195: evalsipmamergesort2bb15in -> evalsipmamergesort2bb19in : O'=0, [ 0>=M && N>=1 ], cost: 1+2*N 669.01/291.71 669.01/291.71 174: evalsipmamergesort2bb16in -> evalsipmamergesort2bb15in : M'=-1+M, [], cost: 2 669.01/291.71 669.01/291.71 175: evalsipmamergesort2bb16in -> evalsipmamergesort2bb15in : N'=-1+N, [], cost: 2 669.01/291.71 669.01/291.71 90: evalsipmamergesort2bb19in -> evalsipmamergesort2bb21in : P'=M, [ 0>=O ], cost: 1 669.01/291.71 669.01/291.71 196: evalsipmamergesort2bb19in -> evalsipmamergesort2bb21in : P'=0, [ 0>=O && M>=1 ], cost: 1+2*M 669.01/291.71 669.01/291.71 182: evalsipmamergesort2bb21in -> evalsipmamergesort2146 : [ 0>=P ], cost: 6 669.01/291.71 669.01/291.71 100: evalsipmamergesort2146 -> evalsipmamergesort2bb14in : K'=L, [ L>=1 ], cost: 1 669.01/291.71 669.01/291.71 186: evalsipmamergesort2146 -> evalsipmamergesort2150 : Q_1'=2*Q, [ 0>=L ], cost: 5 669.01/291.71 669.01/291.71 106: evalsipmamergesort2150 -> evalsipmamergesort2bb1in : A'=Q_1, [ C>=1+Q_1 ], cost: 1 669.01/291.71 669.01/291.71 107: evalsipmamergesort2150 -> evalsipmamergesort2bb25in : J'=1, [ Q_1>=C ], cost: 1 669.01/291.71 669.01/291.71 197: evalsipmamergesort2bb25in -> evalsipmamergesort2bb26in : R'=1+C, [ J==0 && C>=1 ], cost: 1+2*C 669.01/291.71 669.01/291.71 669.01/291.71 669.01/291.71 Eliminated locations (on tree-shaped paths): 669.01/291.71 669.01/291.71 Start location: evalsipmamergesort2start 669.01/291.71 669.01/291.71 138: evalsipmamergesort2start -> evalsipmamergesort2bb1in : A'=1, [], cost: 25 669.01/291.71 669.01/291.71 25: evalsipmamergesort2bb1in -> evalsipmamergesort2bb2in : B'=C, [], cost: 1 669.01/291.71 669.01/291.71 26: evalsipmamergesort2bb2in -> evalsipmamergesort2bb3in : D'=-2*A+B, E'=A, F'=A, [ B>=A && B>=2*A ], cost: 1 669.01/291.71 669.01/291.71 27: evalsipmamergesort2bb2in -> evalsipmamergesort2bb3in : D'=0, E'=A, F'=-A+B, [ B>=A && 2*A>=1+B ], cost: 1 669.01/291.71 669.01/291.71 28: evalsipmamergesort2bb2in -> evalsipmamergesort2bb3in : D'=-A, E'=B, F'=A, [ A>=1+B && 0>=A ], cost: 1 669.01/291.71 669.01/291.71 29: evalsipmamergesort2bb2in -> evalsipmamergesort2bb3in : D'=0, E'=B, F'=0, [ A>=1+B && A>=1 ], cost: 1 669.01/291.71 669.01/291.71 198: evalsipmamergesort2bb3in -> evalsipmamergesort2bb3in : E'=-1+E, [ E>=1 && F>=1 ], cost: 3 669.01/291.71 669.01/291.71 199: evalsipmamergesort2bb3in -> evalsipmamergesort2bb3in : F'=-1+F, [ E>=1 && F>=1 ], cost: 3 669.01/291.71 669.01/291.71 200: evalsipmamergesort2bb3in -> evalsipmamergesort2bb9in : G'=F, H'=E, [ 0>=E && 0>=F ], cost: 2 669.01/291.71 669.01/291.71 201: evalsipmamergesort2bb3in -> evalsipmamergesort2bb9in : G'=F, H'=E, [ 0>=F ], cost: 2 669.01/291.71 669.01/291.71 202: evalsipmamergesort2bb3in -> evalsipmamergesort2bb9in : G'=F, H'=0, [ 0>=F && E>=1 ], cost: 2+2*E 669.01/291.71 669.01/291.71 203: evalsipmamergesort2bb3in -> evalsipmamergesort2bb9in : G'=0, H'=E, [ 0>=E && F>=1 ], cost: 2+2*F 669.01/291.71 669.01/291.71 204: evalsipmamergesort2bb3in -> [98] : [ 0>=E && F>=1 ], cost: 1+2*F 669.01/291.71 669.01/291.71 205: evalsipmamergesort2bb9in -> evalsipmamergesort2bb2in : B'=D, [ 0>=H && D>=1 ], cost: 7 669.01/291.71 669.01/291.71 206: evalsipmamergesort2bb9in -> evalsipmamergesort277 : Q'=2*A, [ 0>=H && 0>=D ], cost: 11 669.01/291.71 669.01/291.71 54: evalsipmamergesort277 -> evalsipmamergesort2bb25in : J'=0, [ Q>=C ], cost: 1 669.01/291.71 669.01/291.71 173: evalsipmamergesort277 -> evalsipmamergesort2bb14in : K'=C, [ C>=1+Q ], cost: 23 669.01/291.71 669.01/291.71 78: evalsipmamergesort2bb14in -> evalsipmamergesort2bb15in : L'=-2*Q+K, M'=Q, N'=Q, [ K>=Q && K>=2*Q ], cost: 1 669.01/291.71 669.01/291.71 79: evalsipmamergesort2bb14in -> evalsipmamergesort2bb15in : L'=0, M'=Q, N'=-Q+K, [ K>=Q && 2*Q>=1+K ], cost: 1 669.01/291.71 669.01/291.71 80: evalsipmamergesort2bb14in -> evalsipmamergesort2bb15in : L'=-Q, M'=K, N'=Q, [ Q>=1+K && 0>=Q ], cost: 1 669.01/291.71 669.01/291.71 81: evalsipmamergesort2bb14in -> evalsipmamergesort2bb15in : L'=0, M'=K, N'=0, [ Q>=1+K && Q>=1 ], cost: 1 669.01/291.71 669.01/291.71 207: evalsipmamergesort2bb15in -> evalsipmamergesort2bb15in : M'=-1+M, [ M>=1 && N>=1 ], cost: 3 669.01/291.71 669.01/291.71 208: evalsipmamergesort2bb15in -> evalsipmamergesort2bb15in : N'=-1+N, [ M>=1 && N>=1 ], cost: 3 669.01/291.71 669.01/291.71 209: evalsipmamergesort2bb15in -> evalsipmamergesort2bb21in : O'=N, P'=M, [ 0>=M && 0>=N ], cost: 2 669.01/291.71 669.01/291.71 210: evalsipmamergesort2bb15in -> evalsipmamergesort2bb21in : O'=N, P'=M, [ 0>=N ], cost: 2 669.01/291.71 669.01/291.71 211: evalsipmamergesort2bb15in -> evalsipmamergesort2bb21in : O'=N, P'=0, [ 0>=N && M>=1 ], cost: 2+2*M 669.01/291.71 669.01/291.71 212: evalsipmamergesort2bb15in -> evalsipmamergesort2bb21in : O'=0, P'=M, [ 0>=M && N>=1 ], cost: 2+2*N 669.01/291.71 669.01/291.71 213: evalsipmamergesort2bb15in -> [99] : [ 0>=M && N>=1 ], cost: 1+2*N 669.01/291.71 669.01/291.71 214: evalsipmamergesort2bb21in -> evalsipmamergesort2bb14in : K'=L, [ 0>=P && L>=1 ], cost: 7 669.01/291.71 669.01/291.71 215: evalsipmamergesort2bb21in -> evalsipmamergesort2150 : Q_1'=2*Q, [ 0>=P && 0>=L ], cost: 11 669.01/291.71 669.01/291.71 106: evalsipmamergesort2150 -> evalsipmamergesort2bb1in : A'=Q_1, [ C>=1+Q_1 ], cost: 1 669.01/291.71 669.01/291.71 107: evalsipmamergesort2150 -> evalsipmamergesort2bb25in : J'=1, [ Q_1>=C ], cost: 1 669.01/291.71 669.01/291.71 197: evalsipmamergesort2bb25in -> evalsipmamergesort2bb26in : R'=1+C, [ J==0 && C>=1 ], cost: 1+2*C 669.01/291.71 669.01/291.71 669.01/291.71 669.01/291.71 Accelerating simple loops of location 27. 669.01/291.71 669.01/291.71 Accelerating the following rules: 669.01/291.71 669.01/291.71 198: evalsipmamergesort2bb3in -> evalsipmamergesort2bb3in : E'=-1+E, [ E>=1 && F>=1 ], cost: 3 669.01/291.71 669.01/291.71 199: evalsipmamergesort2bb3in -> evalsipmamergesort2bb3in : F'=-1+F, [ E>=1 && F>=1 ], cost: 3 669.01/291.71 669.01/291.71 669.01/291.71 669.01/291.71 Accelerated rule 198 with metering function E, yielding the new rule 216. 669.01/291.71 669.01/291.71 Accelerated rule 199 with metering function F, yielding the new rule 217. 669.01/291.71 669.01/291.71 Removing the simple loops: 198 199. 669.01/291.71 669.01/291.71 669.01/291.71 669.01/291.71 Accelerating simple loops of location 69. 669.01/291.71 669.01/291.71 Accelerating the following rules: 669.01/291.71 669.01/291.71 207: evalsipmamergesort2bb15in -> evalsipmamergesort2bb15in : M'=-1+M, [ M>=1 && N>=1 ], cost: 3 669.01/291.71 669.01/291.71 208: evalsipmamergesort2bb15in -> evalsipmamergesort2bb15in : N'=-1+N, [ M>=1 && N>=1 ], cost: 3 669.01/291.71 669.01/291.71 669.01/291.71 669.01/291.71 Accelerated rule 207 with metering function M, yielding the new rule 218. 669.01/291.71 669.01/291.71 Accelerated rule 208 with metering function N, yielding the new rule 219. 669.01/291.71 669.01/291.71 Removing the simple loops: 207 208. 669.01/291.71 669.01/291.71 669.01/291.71 669.01/291.71 Accelerated all simple loops using metering functions (where possible): 669.01/291.71 669.01/291.71 Start location: evalsipmamergesort2start 669.01/291.71 669.01/291.71 138: evalsipmamergesort2start -> evalsipmamergesort2bb1in : A'=1, [], cost: 25 669.01/291.71 669.01/291.71 25: evalsipmamergesort2bb1in -> evalsipmamergesort2bb2in : B'=C, [], cost: 1 669.01/291.71 669.01/291.71 26: evalsipmamergesort2bb2in -> evalsipmamergesort2bb3in : D'=-2*A+B, E'=A, F'=A, [ B>=A && B>=2*A ], cost: 1 669.01/291.71 669.01/291.71 27: evalsipmamergesort2bb2in -> evalsipmamergesort2bb3in : D'=0, E'=A, F'=-A+B, [ B>=A && 2*A>=1+B ], cost: 1 669.01/291.71 669.01/291.71 28: evalsipmamergesort2bb2in -> evalsipmamergesort2bb3in : D'=-A, E'=B, F'=A, [ A>=1+B && 0>=A ], cost: 1 669.01/291.71 669.01/291.71 29: evalsipmamergesort2bb2in -> evalsipmamergesort2bb3in : D'=0, E'=B, F'=0, [ A>=1+B && A>=1 ], cost: 1 669.01/291.71 669.01/291.71 200: evalsipmamergesort2bb3in -> evalsipmamergesort2bb9in : G'=F, H'=E, [ 0>=E && 0>=F ], cost: 2 669.01/291.71 669.01/291.71 201: evalsipmamergesort2bb3in -> evalsipmamergesort2bb9in : G'=F, H'=E, [ 0>=F ], cost: 2 669.01/291.71 669.01/291.71 202: evalsipmamergesort2bb3in -> evalsipmamergesort2bb9in : G'=F, H'=0, [ 0>=F && E>=1 ], cost: 2+2*E 669.01/291.71 669.01/291.71 203: evalsipmamergesort2bb3in -> evalsipmamergesort2bb9in : G'=0, H'=E, [ 0>=E && F>=1 ], cost: 2+2*F 669.01/291.71 669.01/291.71 204: evalsipmamergesort2bb3in -> [98] : [ 0>=E && F>=1 ], cost: 1+2*F 669.01/291.71 669.01/291.71 216: evalsipmamergesort2bb3in -> evalsipmamergesort2bb3in : E'=0, [ E>=1 && F>=1 ], cost: 3*E 669.01/291.71 669.01/291.71 217: evalsipmamergesort2bb3in -> evalsipmamergesort2bb3in : F'=0, [ E>=1 && F>=1 ], cost: 3*F 669.01/291.71 669.01/291.71 205: evalsipmamergesort2bb9in -> evalsipmamergesort2bb2in : B'=D, [ 0>=H && D>=1 ], cost: 7 669.01/291.71 669.01/291.71 206: evalsipmamergesort2bb9in -> evalsipmamergesort277 : Q'=2*A, [ 0>=H && 0>=D ], cost: 11 669.01/291.71 669.01/291.71 54: evalsipmamergesort277 -> evalsipmamergesort2bb25in : J'=0, [ Q>=C ], cost: 1 669.01/291.71 669.01/291.71 173: evalsipmamergesort277 -> evalsipmamergesort2bb14in : K'=C, [ C>=1+Q ], cost: 23 669.01/291.71 669.01/291.71 78: evalsipmamergesort2bb14in -> evalsipmamergesort2bb15in : L'=-2*Q+K, M'=Q, N'=Q, [ K>=Q && K>=2*Q ], cost: 1 669.01/291.71 669.01/291.71 79: evalsipmamergesort2bb14in -> evalsipmamergesort2bb15in : L'=0, M'=Q, N'=-Q+K, [ K>=Q && 2*Q>=1+K ], cost: 1 669.01/291.71 669.01/291.71 80: evalsipmamergesort2bb14in -> evalsipmamergesort2bb15in : L'=-Q, M'=K, N'=Q, [ Q>=1+K && 0>=Q ], cost: 1 669.01/291.71 669.01/291.71 81: evalsipmamergesort2bb14in -> evalsipmamergesort2bb15in : L'=0, M'=K, N'=0, [ Q>=1+K && Q>=1 ], cost: 1 669.01/291.71 669.01/291.71 209: evalsipmamergesort2bb15in -> evalsipmamergesort2bb21in : O'=N, P'=M, [ 0>=M && 0>=N ], cost: 2 669.01/291.71 669.01/291.71 210: evalsipmamergesort2bb15in -> evalsipmamergesort2bb21in : O'=N, P'=M, [ 0>=N ], cost: 2 669.01/291.71 669.01/291.71 211: evalsipmamergesort2bb15in -> evalsipmamergesort2bb21in : O'=N, P'=0, [ 0>=N && M>=1 ], cost: 2+2*M 669.01/291.71 669.01/291.71 212: evalsipmamergesort2bb15in -> evalsipmamergesort2bb21in : O'=0, P'=M, [ 0>=M && N>=1 ], cost: 2+2*N 669.01/291.71 669.01/291.71 213: evalsipmamergesort2bb15in -> [99] : [ 0>=M && N>=1 ], cost: 1+2*N 669.01/291.71 669.01/291.71 218: evalsipmamergesort2bb15in -> evalsipmamergesort2bb15in : M'=0, [ M>=1 && N>=1 ], cost: 3*M 669.01/291.71 669.01/291.71 219: evalsipmamergesort2bb15in -> evalsipmamergesort2bb15in : N'=0, [ M>=1 && N>=1 ], cost: 3*N 669.01/291.71 669.01/291.71 214: evalsipmamergesort2bb21in -> evalsipmamergesort2bb14in : K'=L, [ 0>=P && L>=1 ], cost: 7 669.01/291.71 669.01/291.71 215: evalsipmamergesort2bb21in -> evalsipmamergesort2150 : Q_1'=2*Q, [ 0>=P && 0>=L ], cost: 11 669.01/291.71 669.01/291.71 106: evalsipmamergesort2150 -> evalsipmamergesort2bb1in : A'=Q_1, [ C>=1+Q_1 ], cost: 1 669.01/291.71 669.01/291.71 107: evalsipmamergesort2150 -> evalsipmamergesort2bb25in : J'=1, [ Q_1>=C ], cost: 1 669.01/291.71 669.01/291.71 197: evalsipmamergesort2bb25in -> evalsipmamergesort2bb26in : R'=1+C, [ J==0 && C>=1 ], cost: 1+2*C 669.01/291.71 669.01/291.71 669.01/291.71 669.01/291.71 Chained accelerated rules (with incoming rules): 669.01/291.71 669.01/291.71 Start location: evalsipmamergesort2start 669.01/291.71 669.01/291.71 138: evalsipmamergesort2start -> evalsipmamergesort2bb1in : A'=1, [], cost: 25 669.01/291.71 669.01/291.71 25: evalsipmamergesort2bb1in -> evalsipmamergesort2bb2in : B'=C, [], cost: 1 669.01/291.71 669.01/291.71 26: evalsipmamergesort2bb2in -> evalsipmamergesort2bb3in : D'=-2*A+B, E'=A, F'=A, [ B>=A && B>=2*A ], cost: 1 669.01/291.71 669.01/291.71 27: evalsipmamergesort2bb2in -> evalsipmamergesort2bb3in : D'=0, E'=A, F'=-A+B, [ B>=A && 2*A>=1+B ], cost: 1 669.01/291.71 669.01/291.71 28: evalsipmamergesort2bb2in -> evalsipmamergesort2bb3in : D'=-A, E'=B, F'=A, [ A>=1+B && 0>=A ], cost: 1 669.01/291.71 669.01/291.71 29: evalsipmamergesort2bb2in -> evalsipmamergesort2bb3in : D'=0, E'=B, F'=0, [ A>=1+B && A>=1 ], cost: 1 669.01/291.71 669.01/291.71 220: evalsipmamergesort2bb2in -> evalsipmamergesort2bb3in : D'=-2*A+B, E'=0, F'=A, [ B>=A && B>=2*A && A>=1 ], cost: 1+3*A 669.01/291.71 669.01/291.71 221: evalsipmamergesort2bb2in -> evalsipmamergesort2bb3in : D'=0, E'=0, F'=-A+B, [ 2*A>=1+B && A>=1 && -A+B>=1 ], cost: 1+3*A 669.01/291.71 669.01/291.71 222: evalsipmamergesort2bb2in -> evalsipmamergesort2bb3in : D'=-2*A+B, E'=A, F'=0, [ B>=A && B>=2*A && A>=1 ], cost: 1+3*A 669.01/291.71 669.01/291.71 223: evalsipmamergesort2bb2in -> evalsipmamergesort2bb3in : D'=0, E'=A, F'=0, [ 2*A>=1+B && A>=1 && -A+B>=1 ], cost: 1-3*A+3*B 669.01/291.71 669.01/291.71 200: evalsipmamergesort2bb3in -> evalsipmamergesort2bb9in : G'=F, H'=E, [ 0>=E && 0>=F ], cost: 2 669.01/291.71 669.01/291.71 201: evalsipmamergesort2bb3in -> evalsipmamergesort2bb9in : G'=F, H'=E, [ 0>=F ], cost: 2 669.01/291.71 669.01/291.71 202: evalsipmamergesort2bb3in -> evalsipmamergesort2bb9in : G'=F, H'=0, [ 0>=F && E>=1 ], cost: 2+2*E 669.01/291.71 669.01/291.71 203: evalsipmamergesort2bb3in -> evalsipmamergesort2bb9in : G'=0, H'=E, [ 0>=E && F>=1 ], cost: 2+2*F 669.01/291.71 669.01/291.71 204: evalsipmamergesort2bb3in -> [98] : [ 0>=E && F>=1 ], cost: 1+2*F 669.01/291.71 669.01/291.71 205: evalsipmamergesort2bb9in -> evalsipmamergesort2bb2in : B'=D, [ 0>=H && D>=1 ], cost: 7 669.01/291.71 669.01/291.71 206: evalsipmamergesort2bb9in -> evalsipmamergesort277 : Q'=2*A, [ 0>=H && 0>=D ], cost: 11 669.01/291.71 669.01/291.71 54: evalsipmamergesort277 -> evalsipmamergesort2bb25in : J'=0, [ Q>=C ], cost: 1 669.01/291.71 669.01/291.71 173: evalsipmamergesort277 -> evalsipmamergesort2bb14in : K'=C, [ C>=1+Q ], cost: 23 669.01/291.71 669.01/291.71 78: evalsipmamergesort2bb14in -> evalsipmamergesort2bb15in : L'=-2*Q+K, M'=Q, N'=Q, [ K>=Q && K>=2*Q ], cost: 1 669.01/291.71 669.01/291.71 79: evalsipmamergesort2bb14in -> evalsipmamergesort2bb15in : L'=0, M'=Q, N'=-Q+K, [ K>=Q && 2*Q>=1+K ], cost: 1 669.01/291.71 669.01/291.71 80: evalsipmamergesort2bb14in -> evalsipmamergesort2bb15in : L'=-Q, M'=K, N'=Q, [ Q>=1+K && 0>=Q ], cost: 1 669.01/291.71 669.01/291.71 81: evalsipmamergesort2bb14in -> evalsipmamergesort2bb15in : L'=0, M'=K, N'=0, [ Q>=1+K && Q>=1 ], cost: 1 669.01/291.71 669.01/291.71 224: evalsipmamergesort2bb14in -> evalsipmamergesort2bb15in : L'=-2*Q+K, M'=0, N'=Q, [ K>=Q && K>=2*Q && Q>=1 ], cost: 1+3*Q 669.01/291.71 669.01/291.71 225: evalsipmamergesort2bb14in -> evalsipmamergesort2bb15in : L'=0, M'=0, N'=-Q+K, [ 2*Q>=1+K && Q>=1 && -Q+K>=1 ], cost: 1+3*Q 669.01/291.71 669.01/291.71 226: evalsipmamergesort2bb14in -> evalsipmamergesort2bb15in : L'=-2*Q+K, M'=Q, N'=0, [ K>=Q && K>=2*Q && Q>=1 ], cost: 1+3*Q 669.01/291.71 669.01/291.71 227: evalsipmamergesort2bb14in -> evalsipmamergesort2bb15in : L'=0, M'=Q, N'=0, [ 2*Q>=1+K && Q>=1 && -Q+K>=1 ], cost: 1-3*Q+3*K 669.01/291.71 669.01/291.71 209: evalsipmamergesort2bb15in -> evalsipmamergesort2bb21in : O'=N, P'=M, [ 0>=M && 0>=N ], cost: 2 669.01/291.71 669.01/291.71 210: evalsipmamergesort2bb15in -> evalsipmamergesort2bb21in : O'=N, P'=M, [ 0>=N ], cost: 2 669.01/291.71 669.01/291.71 211: evalsipmamergesort2bb15in -> evalsipmamergesort2bb21in : O'=N, P'=0, [ 0>=N && M>=1 ], cost: 2+2*M 669.01/291.71 669.01/291.71 212: evalsipmamergesort2bb15in -> evalsipmamergesort2bb21in : O'=0, P'=M, [ 0>=M && N>=1 ], cost: 2+2*N 669.01/291.71 669.01/291.71 213: evalsipmamergesort2bb15in -> [99] : [ 0>=M && N>=1 ], cost: 1+2*N 669.01/291.71 669.01/291.71 214: evalsipmamergesort2bb21in -> evalsipmamergesort2bb14in : K'=L, [ 0>=P && L>=1 ], cost: 7 669.01/291.71 669.01/291.71 215: evalsipmamergesort2bb21in -> evalsipmamergesort2150 : Q_1'=2*Q, [ 0>=P && 0>=L ], cost: 11 669.01/291.71 669.01/291.71 106: evalsipmamergesort2150 -> evalsipmamergesort2bb1in : A'=Q_1, [ C>=1+Q_1 ], cost: 1 669.01/291.71 669.01/291.71 107: evalsipmamergesort2150 -> evalsipmamergesort2bb25in : J'=1, [ Q_1>=C ], cost: 1 669.01/291.71 669.01/291.71 197: evalsipmamergesort2bb25in -> evalsipmamergesort2bb26in : R'=1+C, [ J==0 && C>=1 ], cost: 1+2*C 669.01/291.71 669.01/291.71 669.01/291.71 669.01/291.71 Eliminated locations (on tree-shaped paths): 669.01/291.71 669.01/291.71 Start location: evalsipmamergesort2start 669.01/291.71 669.01/291.71 138: evalsipmamergesort2start -> evalsipmamergesort2bb1in : A'=1, [], cost: 25 669.01/291.71 669.01/291.71 25: evalsipmamergesort2bb1in -> evalsipmamergesort2bb2in : B'=C, [], cost: 1 669.01/291.71 669.01/291.71 228: evalsipmamergesort2bb2in -> evalsipmamergesort2bb9in : D'=-2*A+B, E'=A, F'=A, G'=A, H'=A, [ B>=A && B>=2*A && 0>=A ], cost: 3 669.01/291.71 669.01/291.71 229: evalsipmamergesort2bb2in -> evalsipmamergesort2bb9in : D'=-2*A+B, E'=A, F'=A, G'=A, H'=A, [ B>=A && B>=2*A && 0>=A ], cost: 3 669.01/291.71 669.01/291.71 230: evalsipmamergesort2bb2in -> evalsipmamergesort2bb9in : D'=0, E'=A, F'=-A+B, G'=-A+B, H'=A, [ B>=A && 2*A>=1+B && 0>=-A+B ], cost: 3 669.01/291.71 669.01/291.71 231: evalsipmamergesort2bb2in -> evalsipmamergesort2bb9in : D'=0, E'=A, F'=-A+B, G'=-A+B, H'=0, [ B>=A && 2*A>=1+B && 0>=-A+B && A>=1 ], cost: 3+2*A 669.01/291.71 669.01/291.71 232: evalsipmamergesort2bb2in -> evalsipmamergesort2bb9in : D'=-A, E'=B, F'=A, G'=A, H'=B, [ A>=1+B && 0>=A && 0>=B ], cost: 3 669.01/291.71 669.01/291.71 233: evalsipmamergesort2bb2in -> evalsipmamergesort2bb9in : D'=-A, E'=B, F'=A, G'=A, H'=B, [ A>=1+B && 0>=A ], cost: 3 669.01/291.71 669.01/291.71 234: evalsipmamergesort2bb2in -> evalsipmamergesort2bb9in : D'=0, E'=B, F'=0, G'=0, H'=B, [ A>=1+B && A>=1 && 0>=B ], cost: 3 669.01/291.71 669.01/291.71 235: evalsipmamergesort2bb2in -> evalsipmamergesort2bb9in : D'=0, E'=B, F'=0, G'=0, H'=B, [ A>=1+B && A>=1 ], cost: 3 669.01/291.71 669.01/291.71 236: evalsipmamergesort2bb2in -> evalsipmamergesort2bb9in : D'=0, E'=B, F'=0, G'=0, H'=0, [ A>=1+B && A>=1 && B>=1 ], cost: 3+2*B 669.01/291.71 669.01/291.71 237: evalsipmamergesort2bb2in -> evalsipmamergesort2bb9in : D'=-2*A+B, E'=0, F'=A, G'=0, H'=0, [ B>=A && B>=2*A && A>=1 ], cost: 3+5*A 669.01/291.71 669.01/291.71 238: evalsipmamergesort2bb2in -> [98] : D'=-2*A+B, E'=0, F'=A, [ B>=A && B>=2*A && A>=1 ], cost: 2+5*A 669.01/291.71 669.01/291.71 239: evalsipmamergesort2bb2in -> evalsipmamergesort2bb9in : D'=0, E'=0, F'=-A+B, G'=0, H'=0, [ 2*A>=1+B && A>=1 && -A+B>=1 ], cost: 3+A+2*B 669.01/291.71 669.01/291.71 240: evalsipmamergesort2bb2in -> [98] : D'=0, E'=0, F'=-A+B, [ 2*A>=1+B && A>=1 && -A+B>=1 ], cost: 2+A+2*B 669.01/291.71 669.01/291.71 241: evalsipmamergesort2bb2in -> evalsipmamergesort2bb9in : D'=-2*A+B, E'=A, F'=0, G'=0, H'=A, [ B>=A && B>=2*A && A>=1 ], cost: 3+3*A 669.01/291.71 669.01/291.71 242: evalsipmamergesort2bb2in -> evalsipmamergesort2bb9in : D'=-2*A+B, E'=A, F'=0, G'=0, H'=0, [ B>=A && B>=2*A && A>=1 ], cost: 3+5*A 669.01/291.71 669.01/291.71 243: evalsipmamergesort2bb2in -> evalsipmamergesort2bb9in : D'=0, E'=A, F'=0, G'=0, H'=A, [ 2*A>=1+B && A>=1 && -A+B>=1 ], cost: 3-3*A+3*B 669.01/291.71 669.01/291.71 244: evalsipmamergesort2bb2in -> evalsipmamergesort2bb9in : D'=0, E'=A, F'=0, G'=0, H'=0, [ 2*A>=1+B && A>=1 && -A+B>=1 ], cost: 3-A+3*B 669.01/291.71 669.01/291.71 245: evalsipmamergesort2bb2in -> [102] : [ B>=A && B>=2*A && A>=1 ], cost: 1+3*A 669.01/291.71 669.01/291.71 246: evalsipmamergesort2bb2in -> [102] : [ 2*A>=1+B && A>=1 && -A+B>=1 ], cost: 1+3*A 669.01/291.71 669.01/291.71 247: evalsipmamergesort2bb2in -> [102] : [ B>=A && B>=2*A && A>=1 ], cost: 1+3*A 669.01/291.71 669.01/291.71 248: evalsipmamergesort2bb2in -> [102] : [ 2*A>=1+B && A>=1 && -A+B>=1 ], cost: 1-3*A+3*B 669.01/291.71 669.01/291.71 205: evalsipmamergesort2bb9in -> evalsipmamergesort2bb2in : B'=D, [ 0>=H && D>=1 ], cost: 7 669.01/291.71 669.01/291.71 249: evalsipmamergesort2bb9in -> evalsipmamergesort2bb25in : Q'=2*A, J'=0, [ 0>=H && 0>=D && 2*A>=C ], cost: 12 669.01/291.71 669.01/291.71 250: evalsipmamergesort2bb9in -> evalsipmamergesort2bb14in : Q'=2*A, K'=C, [ 0>=H && 0>=D && C>=1+2*A ], cost: 34 669.01/291.71 669.01/291.71 251: evalsipmamergesort2bb14in -> evalsipmamergesort2bb21in : L'=-2*Q+K, M'=Q, N'=Q, O'=Q, P'=Q, [ K>=Q && K>=2*Q && 0>=Q ], cost: 3 669.01/291.71 669.01/291.71 252: evalsipmamergesort2bb14in -> evalsipmamergesort2bb21in : L'=-2*Q+K, M'=Q, N'=Q, O'=Q, P'=Q, [ K>=Q && K>=2*Q && 0>=Q ], cost: 3 669.01/291.71 669.01/291.71 253: evalsipmamergesort2bb14in -> evalsipmamergesort2bb21in : L'=0, M'=Q, N'=-Q+K, O'=-Q+K, P'=Q, [ K>=Q && 2*Q>=1+K && 0>=-Q+K ], cost: 3 669.01/291.71 669.01/291.71 254: evalsipmamergesort2bb14in -> evalsipmamergesort2bb21in : L'=0, M'=Q, N'=-Q+K, O'=-Q+K, P'=0, [ K>=Q && 2*Q>=1+K && 0>=-Q+K && Q>=1 ], cost: 3+2*Q 669.01/291.71 669.01/291.71 255: evalsipmamergesort2bb14in -> evalsipmamergesort2bb21in : L'=-Q, M'=K, N'=Q, O'=Q, P'=K, [ Q>=1+K && 0>=Q && 0>=K ], cost: 3 669.01/291.71 669.01/291.71 256: evalsipmamergesort2bb14in -> evalsipmamergesort2bb21in : L'=-Q, M'=K, N'=Q, O'=Q, P'=K, [ Q>=1+K && 0>=Q ], cost: 3 669.01/291.71 669.01/291.71 257: evalsipmamergesort2bb14in -> evalsipmamergesort2bb21in : L'=0, M'=K, N'=0, O'=0, P'=K, [ Q>=1+K && Q>=1 && 0>=K ], cost: 3 669.01/291.71 669.01/291.71 258: evalsipmamergesort2bb14in -> evalsipmamergesort2bb21in : L'=0, M'=K, N'=0, O'=0, P'=K, [ Q>=1+K && Q>=1 ], cost: 3 669.01/291.71 669.01/291.71 259: evalsipmamergesort2bb14in -> evalsipmamergesort2bb21in : L'=0, M'=K, N'=0, O'=0, P'=0, [ Q>=1+K && Q>=1 && K>=1 ], cost: 3+2*K 669.01/291.71 669.01/291.71 260: evalsipmamergesort2bb14in -> evalsipmamergesort2bb21in : L'=-2*Q+K, M'=0, N'=Q, O'=0, P'=0, [ K>=Q && K>=2*Q && Q>=1 ], cost: 3+5*Q 669.01/291.71 669.01/291.71 261: evalsipmamergesort2bb14in -> [99] : L'=-2*Q+K, M'=0, N'=Q, [ K>=Q && K>=2*Q && Q>=1 ], cost: 2+5*Q 669.01/291.71 669.01/291.71 262: evalsipmamergesort2bb14in -> evalsipmamergesort2bb21in : L'=0, M'=0, N'=-Q+K, O'=0, P'=0, [ 2*Q>=1+K && Q>=1 && -Q+K>=1 ], cost: 3+Q+2*K 669.01/291.71 669.01/291.71 263: evalsipmamergesort2bb14in -> [99] : L'=0, M'=0, N'=-Q+K, [ 2*Q>=1+K && Q>=1 && -Q+K>=1 ], cost: 2+Q+2*K 669.01/291.71 669.01/291.71 264: evalsipmamergesort2bb14in -> evalsipmamergesort2bb21in : L'=-2*Q+K, M'=Q, N'=0, O'=0, P'=Q, [ K>=Q && K>=2*Q && Q>=1 ], cost: 3+3*Q 669.01/291.71 669.01/291.71 265: evalsipmamergesort2bb14in -> evalsipmamergesort2bb21in : L'=-2*Q+K, M'=Q, N'=0, O'=0, P'=0, [ K>=Q && K>=2*Q && Q>=1 ], cost: 3+5*Q 669.01/291.71 669.01/291.71 266: evalsipmamergesort2bb14in -> evalsipmamergesort2bb21in : L'=0, M'=Q, N'=0, O'=0, P'=Q, [ 2*Q>=1+K && Q>=1 && -Q+K>=1 ], cost: 3-3*Q+3*K 669.01/291.71 669.01/291.71 267: evalsipmamergesort2bb14in -> evalsipmamergesort2bb21in : L'=0, M'=Q, N'=0, O'=0, P'=0, [ 2*Q>=1+K && Q>=1 && -Q+K>=1 ], cost: 3-Q+3*K 669.01/291.71 669.01/291.71 268: evalsipmamergesort2bb14in -> [103] : [ K>=Q && K>=2*Q && Q>=1 ], cost: 1+3*Q 669.01/291.71 669.01/291.71 269: evalsipmamergesort2bb14in -> [103] : [ 2*Q>=1+K && Q>=1 && -Q+K>=1 ], cost: 1+3*Q 669.01/291.71 669.01/291.71 270: evalsipmamergesort2bb14in -> [103] : [ K>=Q && K>=2*Q && Q>=1 ], cost: 1+3*Q 669.01/291.71 669.01/291.71 271: evalsipmamergesort2bb14in -> [103] : [ 2*Q>=1+K && Q>=1 && -Q+K>=1 ], cost: 1-3*Q+3*K 669.01/291.71 669.01/291.71 214: evalsipmamergesort2bb21in -> evalsipmamergesort2bb14in : K'=L, [ 0>=P && L>=1 ], cost: 7 669.01/291.71 669.01/291.71 272: evalsipmamergesort2bb21in -> evalsipmamergesort2bb1in : A'=2*Q, Q_1'=2*Q, [ 0>=P && 0>=L && C>=1+2*Q ], cost: 12 669.01/291.71 669.01/291.71 273: evalsipmamergesort2bb21in -> evalsipmamergesort2bb25in : J'=1, Q_1'=2*Q, [ 0>=P && 0>=L && 2*Q>=C ], cost: 12 669.01/291.71 669.01/291.71 197: evalsipmamergesort2bb25in -> evalsipmamergesort2bb26in : R'=1+C, [ J==0 && C>=1 ], cost: 1+2*C 669.01/291.71 669.01/291.71 669.01/291.71 669.01/291.71 Applied pruning (of leafs and parallel rules): 669.01/291.71 669.01/291.71 Start location: evalsipmamergesort2start 669.01/291.71 669.01/291.71 138: evalsipmamergesort2start -> evalsipmamergesort2bb1in : A'=1, [], cost: 25 669.01/291.71 669.01/291.71 25: evalsipmamergesort2bb1in -> evalsipmamergesort2bb2in : B'=C, [], cost: 1 669.01/291.71 669.01/291.71 236: evalsipmamergesort2bb2in -> evalsipmamergesort2bb9in : D'=0, E'=B, F'=0, G'=0, H'=0, [ A>=1+B && A>=1 && B>=1 ], cost: 3+2*B 669.01/291.71 669.01/291.71 237: evalsipmamergesort2bb2in -> evalsipmamergesort2bb9in : D'=-2*A+B, E'=0, F'=A, G'=0, H'=0, [ B>=A && B>=2*A && A>=1 ], cost: 3+5*A 669.01/291.71 669.01/291.71 238: evalsipmamergesort2bb2in -> [98] : D'=-2*A+B, E'=0, F'=A, [ B>=A && B>=2*A && A>=1 ], cost: 2+5*A 669.01/291.71 669.01/291.71 240: evalsipmamergesort2bb2in -> [98] : D'=0, E'=0, F'=-A+B, [ 2*A>=1+B && A>=1 && -A+B>=1 ], cost: 2+A+2*B 669.01/291.71 669.01/291.71 242: evalsipmamergesort2bb2in -> evalsipmamergesort2bb9in : D'=-2*A+B, E'=A, F'=0, G'=0, H'=0, [ B>=A && B>=2*A && A>=1 ], cost: 3+5*A 669.01/291.71 669.01/291.71 243: evalsipmamergesort2bb2in -> evalsipmamergesort2bb9in : D'=0, E'=A, F'=0, G'=0, H'=A, [ 2*A>=1+B && A>=1 && -A+B>=1 ], cost: 3-3*A+3*B 669.01/291.71 669.01/291.71 244: evalsipmamergesort2bb2in -> evalsipmamergesort2bb9in : D'=0, E'=A, F'=0, G'=0, H'=0, [ 2*A>=1+B && A>=1 && -A+B>=1 ], cost: 3-A+3*B 669.01/291.71 669.01/291.71 246: evalsipmamergesort2bb2in -> [102] : [ 2*A>=1+B && A>=1 && -A+B>=1 ], cost: 1+3*A 669.01/291.71 669.01/291.71 247: evalsipmamergesort2bb2in -> [102] : [ B>=A && B>=2*A && A>=1 ], cost: 1+3*A 669.01/291.71 669.01/291.71 248: evalsipmamergesort2bb2in -> [102] : [ 2*A>=1+B && A>=1 && -A+B>=1 ], cost: 1-3*A+3*B 669.01/291.71 669.01/291.71 205: evalsipmamergesort2bb9in -> evalsipmamergesort2bb2in : B'=D, [ 0>=H && D>=1 ], cost: 7 669.01/291.71 669.01/291.71 249: evalsipmamergesort2bb9in -> evalsipmamergesort2bb25in : Q'=2*A, J'=0, [ 0>=H && 0>=D && 2*A>=C ], cost: 12 669.01/291.71 669.01/291.71 250: evalsipmamergesort2bb9in -> evalsipmamergesort2bb14in : Q'=2*A, K'=C, [ 0>=H && 0>=D && C>=1+2*A ], cost: 34 669.01/291.71 669.01/291.71 259: evalsipmamergesort2bb14in -> evalsipmamergesort2bb21in : L'=0, M'=K, N'=0, O'=0, P'=0, [ Q>=1+K && Q>=1 && K>=1 ], cost: 3+2*K 669.01/291.71 669.01/291.71 260: evalsipmamergesort2bb14in -> evalsipmamergesort2bb21in : L'=-2*Q+K, M'=0, N'=Q, O'=0, P'=0, [ K>=Q && K>=2*Q && Q>=1 ], cost: 3+5*Q 669.01/291.71 669.01/291.71 261: evalsipmamergesort2bb14in -> [99] : L'=-2*Q+K, M'=0, N'=Q, [ K>=Q && K>=2*Q && Q>=1 ], cost: 2+5*Q 669.01/291.71 669.01/291.71 263: evalsipmamergesort2bb14in -> [99] : L'=0, M'=0, N'=-Q+K, [ 2*Q>=1+K && Q>=1 && -Q+K>=1 ], cost: 2+Q+2*K 669.01/291.71 669.01/291.71 265: evalsipmamergesort2bb14in -> evalsipmamergesort2bb21in : L'=-2*Q+K, M'=Q, N'=0, O'=0, P'=0, [ K>=Q && K>=2*Q && Q>=1 ], cost: 3+5*Q 669.01/291.71 669.01/291.71 266: evalsipmamergesort2bb14in -> evalsipmamergesort2bb21in : L'=0, M'=Q, N'=0, O'=0, P'=Q, [ 2*Q>=1+K && Q>=1 && -Q+K>=1 ], cost: 3-3*Q+3*K 669.01/291.71 669.01/291.71 267: evalsipmamergesort2bb14in -> evalsipmamergesort2bb21in : L'=0, M'=Q, N'=0, O'=0, P'=0, [ 2*Q>=1+K && Q>=1 && -Q+K>=1 ], cost: 3-Q+3*K 669.01/291.71 669.01/291.71 269: evalsipmamergesort2bb14in -> [103] : [ 2*Q>=1+K && Q>=1 && -Q+K>=1 ], cost: 1+3*Q 669.01/291.71 669.01/291.71 270: evalsipmamergesort2bb14in -> [103] : [ K>=Q && K>=2*Q && Q>=1 ], cost: 1+3*Q 669.01/291.71 669.01/291.71 271: evalsipmamergesort2bb14in -> [103] : [ 2*Q>=1+K && Q>=1 && -Q+K>=1 ], cost: 1-3*Q+3*K 669.01/291.71 669.01/291.71 214: evalsipmamergesort2bb21in -> evalsipmamergesort2bb14in : K'=L, [ 0>=P && L>=1 ], cost: 7 669.01/291.71 669.01/291.71 272: evalsipmamergesort2bb21in -> evalsipmamergesort2bb1in : A'=2*Q, Q_1'=2*Q, [ 0>=P && 0>=L && C>=1+2*Q ], cost: 12 669.01/291.71 669.01/291.71 273: evalsipmamergesort2bb21in -> evalsipmamergesort2bb25in : J'=1, Q_1'=2*Q, [ 0>=P && 0>=L && 2*Q>=C ], cost: 12 669.01/291.71 669.01/291.71 197: evalsipmamergesort2bb25in -> evalsipmamergesort2bb26in : R'=1+C, [ J==0 && C>=1 ], cost: 1+2*C 669.01/291.71 669.01/291.71 669.01/291.71 669.01/291.71 Eliminated locations (on tree-shaped paths): 669.01/291.71 669.01/291.71 Start location: evalsipmamergesort2start 669.01/291.71 669.01/291.71 138: evalsipmamergesort2start -> evalsipmamergesort2bb1in : A'=1, [], cost: 25 669.01/291.71 669.01/291.71 25: evalsipmamergesort2bb1in -> evalsipmamergesort2bb2in : B'=C, [], cost: 1 669.01/291.71 669.01/291.71 238: evalsipmamergesort2bb2in -> [98] : D'=-2*A+B, E'=0, F'=A, [ B>=A && B>=2*A && A>=1 ], cost: 2+5*A 669.01/291.71 669.01/291.71 240: evalsipmamergesort2bb2in -> [98] : D'=0, E'=0, F'=-A+B, [ 2*A>=1+B && A>=1 && -A+B>=1 ], cost: 2+A+2*B 669.01/291.71 669.01/291.71 246: evalsipmamergesort2bb2in -> [102] : [ 2*A>=1+B && A>=1 && -A+B>=1 ], cost: 1+3*A 669.01/291.71 669.01/291.71 247: evalsipmamergesort2bb2in -> [102] : [ B>=A && B>=2*A && A>=1 ], cost: 1+3*A 669.01/291.71 669.01/291.71 248: evalsipmamergesort2bb2in -> [102] : [ 2*A>=1+B && A>=1 && -A+B>=1 ], cost: 1-3*A+3*B 669.01/291.71 669.01/291.71 274: evalsipmamergesort2bb2in -> evalsipmamergesort2bb25in : D'=0, E'=B, F'=0, G'=0, H'=0, Q'=2*A, J'=0, [ A>=1+B && A>=1 && B>=1 && 2*A>=C ], cost: 15+2*B 669.01/291.71 669.01/291.71 275: evalsipmamergesort2bb2in -> evalsipmamergesort2bb14in : D'=0, E'=B, F'=0, G'=0, H'=0, Q'=2*A, K'=C, [ A>=1+B && A>=1 && B>=1 && C>=1+2*A ], cost: 37+2*B 669.01/291.71 669.01/291.71 276: evalsipmamergesort2bb2in -> evalsipmamergesort2bb2in : B'=-2*A+B, D'=-2*A+B, E'=0, F'=A, G'=0, H'=0, [ B>=A && A>=1 && -2*A+B>=1 ], cost: 10+5*A 669.01/291.71 669.01/291.71 277: evalsipmamergesort2bb2in -> evalsipmamergesort2bb25in : D'=-2*A+B, E'=0, F'=A, G'=0, H'=0, Q'=2*A, J'=0, [ B>=A && B>=2*A && A>=1 && 0>=-2*A+B && 2*A>=C ], cost: 15+5*A 669.01/291.71 669.01/291.71 278: evalsipmamergesort2bb2in -> evalsipmamergesort2bb14in : D'=-2*A+B, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C, [ B>=A && B>=2*A && A>=1 && 0>=-2*A+B && C>=1+2*A ], cost: 37+5*A 669.01/291.71 669.01/291.71 279: evalsipmamergesort2bb2in -> evalsipmamergesort2bb2in : B'=-2*A+B, D'=-2*A+B, E'=A, F'=0, G'=0, H'=0, [ B>=A && A>=1 && -2*A+B>=1 ], cost: 10+5*A 669.01/291.71 669.01/291.71 280: evalsipmamergesort2bb2in -> evalsipmamergesort2bb25in : D'=-2*A+B, E'=A, F'=0, G'=0, H'=0, Q'=2*A, J'=0, [ B>=A && B>=2*A && A>=1 && 0>=-2*A+B && 2*A>=C ], cost: 15+5*A 669.01/291.71 669.01/291.71 281: evalsipmamergesort2bb2in -> evalsipmamergesort2bb14in : D'=-2*A+B, E'=A, F'=0, G'=0, H'=0, Q'=2*A, K'=C, [ B>=A && B>=2*A && A>=1 && 0>=-2*A+B && C>=1+2*A ], cost: 37+5*A 669.01/291.71 669.01/291.71 282: evalsipmamergesort2bb2in -> evalsipmamergesort2bb25in : D'=0, E'=A, F'=0, G'=0, H'=0, Q'=2*A, J'=0, [ 2*A>=1+B && A>=1 && -A+B>=1 && 2*A>=C ], cost: 15-A+3*B 669.01/291.71 669.01/291.71 283: evalsipmamergesort2bb2in -> evalsipmamergesort2bb14in : D'=0, E'=A, F'=0, G'=0, H'=0, Q'=2*A, K'=C, [ 2*A>=1+B && A>=1 && -A+B>=1 && C>=1+2*A ], cost: 37-A+3*B 669.01/291.71 669.01/291.71 284: evalsipmamergesort2bb2in -> [104] : [ A>=1+B && A>=1 && B>=1 ], cost: 3+2*B 669.01/291.71 669.01/291.71 285: evalsipmamergesort2bb2in -> [104] : [ 2*A>=1+B && A>=1 && -A+B>=1 ], cost: 3-3*A+3*B 669.01/291.71 669.01/291.71 286: evalsipmamergesort2bb2in -> [104] : [ 2*A>=1+B && A>=1 && -A+B>=1 ], cost: 3-A+3*B 669.01/291.71 669.01/291.71 261: evalsipmamergesort2bb14in -> [99] : L'=-2*Q+K, M'=0, N'=Q, [ K>=Q && K>=2*Q && Q>=1 ], cost: 2+5*Q 669.01/291.71 669.01/291.71 263: evalsipmamergesort2bb14in -> [99] : L'=0, M'=0, N'=-Q+K, [ 2*Q>=1+K && Q>=1 && -Q+K>=1 ], cost: 2+Q+2*K 669.01/291.71 669.01/291.71 269: evalsipmamergesort2bb14in -> [103] : [ 2*Q>=1+K && Q>=1 && -Q+K>=1 ], cost: 1+3*Q 669.01/291.71 669.01/291.71 270: evalsipmamergesort2bb14in -> [103] : [ K>=Q && K>=2*Q && Q>=1 ], cost: 1+3*Q 669.01/291.71 669.01/291.71 271: evalsipmamergesort2bb14in -> [103] : [ 2*Q>=1+K && Q>=1 && -Q+K>=1 ], cost: 1-3*Q+3*K 669.01/291.71 669.01/291.71 287: evalsipmamergesort2bb14in -> evalsipmamergesort2bb1in : A'=2*Q, L'=0, M'=K, N'=0, O'=0, P'=0, Q_1'=2*Q, [ Q>=1+K && Q>=1 && K>=1 && C>=1+2*Q ], cost: 15+2*K 669.01/291.71 669.01/291.71 288: evalsipmamergesort2bb14in -> evalsipmamergesort2bb25in : J'=1, L'=0, M'=K, N'=0, O'=0, P'=0, Q_1'=2*Q, [ Q>=1+K && Q>=1 && K>=1 && 2*Q>=C ], cost: 15+2*K 669.01/291.71 669.01/291.71 289: evalsipmamergesort2bb14in -> evalsipmamergesort2bb14in : K'=-2*Q+K, L'=-2*Q+K, M'=0, N'=Q, O'=0, P'=0, [ K>=Q && Q>=1 && -2*Q+K>=1 ], cost: 10+5*Q 669.01/291.71 669.01/291.71 290: evalsipmamergesort2bb14in -> evalsipmamergesort2bb1in : A'=2*Q, L'=-2*Q+K, M'=0, N'=Q, O'=0, P'=0, Q_1'=2*Q, [ K>=Q && K>=2*Q && Q>=1 && 0>=-2*Q+K && C>=1+2*Q ], cost: 15+5*Q 669.01/291.71 669.01/291.71 291: evalsipmamergesort2bb14in -> evalsipmamergesort2bb25in : J'=1, L'=-2*Q+K, M'=0, N'=Q, O'=0, P'=0, Q_1'=2*Q, [ K>=Q && K>=2*Q && Q>=1 && 0>=-2*Q+K && 2*Q>=C ], cost: 15+5*Q 669.01/291.71 669.01/291.71 292: evalsipmamergesort2bb14in -> evalsipmamergesort2bb14in : K'=-2*Q+K, L'=-2*Q+K, M'=Q, N'=0, O'=0, P'=0, [ K>=Q && Q>=1 && -2*Q+K>=1 ], cost: 10+5*Q 669.01/291.71 669.01/291.71 293: evalsipmamergesort2bb14in -> evalsipmamergesort2bb1in : A'=2*Q, L'=-2*Q+K, M'=Q, N'=0, O'=0, P'=0, Q_1'=2*Q, [ K>=Q && K>=2*Q && Q>=1 && 0>=-2*Q+K && C>=1+2*Q ], cost: 15+5*Q 669.01/291.71 669.01/291.71 294: evalsipmamergesort2bb14in -> evalsipmamergesort2bb25in : J'=1, L'=-2*Q+K, M'=Q, N'=0, O'=0, P'=0, Q_1'=2*Q, [ K>=Q && K>=2*Q && Q>=1 && 0>=-2*Q+K && 2*Q>=C ], cost: 15+5*Q 669.01/291.71 669.01/291.71 295: evalsipmamergesort2bb14in -> evalsipmamergesort2bb1in : A'=2*Q, L'=0, M'=Q, N'=0, O'=0, P'=0, Q_1'=2*Q, [ 2*Q>=1+K && Q>=1 && -Q+K>=1 && C>=1+2*Q ], cost: 15-Q+3*K 669.01/291.71 669.01/291.71 296: evalsipmamergesort2bb14in -> evalsipmamergesort2bb25in : J'=1, L'=0, M'=Q, N'=0, O'=0, P'=0, Q_1'=2*Q, [ 2*Q>=1+K && Q>=1 && -Q+K>=1 && 2*Q>=C ], cost: 15-Q+3*K 669.01/291.71 669.01/291.71 297: evalsipmamergesort2bb14in -> [105] : [ Q>=1+K && Q>=1 && K>=1 ], cost: 3+2*K 669.01/291.71 669.01/291.71 298: evalsipmamergesort2bb14in -> [105] : [ 2*Q>=1+K && Q>=1 && -Q+K>=1 ], cost: 3-3*Q+3*K 669.01/291.71 669.01/291.71 299: evalsipmamergesort2bb14in -> [105] : [ 2*Q>=1+K && Q>=1 && -Q+K>=1 ], cost: 3-Q+3*K 669.01/291.71 669.01/291.71 197: evalsipmamergesort2bb25in -> evalsipmamergesort2bb26in : R'=1+C, [ J==0 && C>=1 ], cost: 1+2*C 669.01/291.71 669.01/291.71 669.01/291.71 669.01/291.71 Accelerating simple loops of location 26. 669.01/291.71 669.01/291.71 Accelerating the following rules: 669.01/291.71 669.01/291.71 276: evalsipmamergesort2bb2in -> evalsipmamergesort2bb2in : B'=-2*A+B, D'=-2*A+B, E'=0, F'=A, G'=0, H'=0, [ B>=A && A>=1 && -2*A+B>=1 ], cost: 10+5*A 669.01/291.71 669.01/291.71 279: evalsipmamergesort2bb2in -> evalsipmamergesort2bb2in : B'=-2*A+B, D'=-2*A+B, E'=A, F'=0, G'=0, H'=0, [ B>=A && A>=1 && -2*A+B>=1 ], cost: 10+5*A 669.01/291.71 669.01/291.71 669.01/291.71 669.01/291.71 Accelerated rule 276 with backward acceleration, yielding the new rule 300. 669.01/291.71 669.01/291.71 Accelerated rule 279 with backward acceleration, yielding the new rule 301. 669.01/291.71 669.01/291.71 Removing the simple loops: 276 279. 669.01/291.71 669.01/291.71 669.01/291.71 669.01/291.71 Accelerating simple loops of location 68. 669.01/291.71 669.01/291.71 Accelerating the following rules: 669.01/291.71 669.01/291.71 289: evalsipmamergesort2bb14in -> evalsipmamergesort2bb14in : K'=-2*Q+K, L'=-2*Q+K, M'=0, N'=Q, O'=0, P'=0, [ K>=Q && Q>=1 && -2*Q+K>=1 ], cost: 10+5*Q 669.01/291.71 669.01/291.71 292: evalsipmamergesort2bb14in -> evalsipmamergesort2bb14in : K'=-2*Q+K, L'=-2*Q+K, M'=Q, N'=0, O'=0, P'=0, [ K>=Q && Q>=1 && -2*Q+K>=1 ], cost: 10+5*Q 669.01/291.71 669.01/291.71 669.01/291.71 669.01/291.71 Accelerated rule 289 with backward acceleration, yielding the new rule 302. 669.01/291.71 669.01/291.71 Accelerated rule 292 with backward acceleration, yielding the new rule 303. 669.01/291.71 669.01/291.71 Removing the simple loops: 289 292. 669.01/291.71 669.01/291.71 669.01/291.71 669.01/291.71 Accelerated all simple loops using metering functions (where possible): 669.01/291.71 669.01/291.71 Start location: evalsipmamergesort2start 669.01/291.71 669.01/291.71 138: evalsipmamergesort2start -> evalsipmamergesort2bb1in : A'=1, [], cost: 25 669.01/291.71 669.01/291.71 25: evalsipmamergesort2bb1in -> evalsipmamergesort2bb2in : B'=C, [], cost: 1 669.01/291.71 669.01/291.71 238: evalsipmamergesort2bb2in -> [98] : D'=-2*A+B, E'=0, F'=A, [ B>=A && B>=2*A && A>=1 ], cost: 2+5*A 669.01/291.71 669.01/291.71 240: evalsipmamergesort2bb2in -> [98] : D'=0, E'=0, F'=-A+B, [ 2*A>=1+B && A>=1 && -A+B>=1 ], cost: 2+A+2*B 669.01/291.71 669.01/291.71 246: evalsipmamergesort2bb2in -> [102] : [ 2*A>=1+B && A>=1 && -A+B>=1 ], cost: 1+3*A 669.01/291.71 669.01/291.71 247: evalsipmamergesort2bb2in -> [102] : [ B>=A && B>=2*A && A>=1 ], cost: 1+3*A 669.01/291.71 669.01/291.71 248: evalsipmamergesort2bb2in -> [102] : [ 2*A>=1+B && A>=1 && -A+B>=1 ], cost: 1-3*A+3*B 669.01/291.71 669.01/291.71 274: evalsipmamergesort2bb2in -> evalsipmamergesort2bb25in : D'=0, E'=B, F'=0, G'=0, H'=0, Q'=2*A, J'=0, [ A>=1+B && A>=1 && B>=1 && 2*A>=C ], cost: 15+2*B 669.01/291.71 669.01/291.71 275: evalsipmamergesort2bb2in -> evalsipmamergesort2bb14in : D'=0, E'=B, F'=0, G'=0, H'=0, Q'=2*A, K'=C, [ A>=1+B && A>=1 && B>=1 && C>=1+2*A ], cost: 37+2*B 669.01/291.71 669.01/291.71 277: evalsipmamergesort2bb2in -> evalsipmamergesort2bb25in : D'=-2*A+B, E'=0, F'=A, G'=0, H'=0, Q'=2*A, J'=0, [ B>=A && B>=2*A && A>=1 && 0>=-2*A+B && 2*A>=C ], cost: 15+5*A 669.01/291.71 669.01/291.71 278: evalsipmamergesort2bb2in -> evalsipmamergesort2bb14in : D'=-2*A+B, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C, [ B>=A && B>=2*A && A>=1 && 0>=-2*A+B && C>=1+2*A ], cost: 37+5*A 669.01/291.71 669.01/291.71 280: evalsipmamergesort2bb2in -> evalsipmamergesort2bb25in : D'=-2*A+B, E'=A, F'=0, G'=0, H'=0, Q'=2*A, J'=0, [ B>=A && B>=2*A && A>=1 && 0>=-2*A+B && 2*A>=C ], cost: 15+5*A 669.01/291.71 669.01/291.71 281: evalsipmamergesort2bb2in -> evalsipmamergesort2bb14in : D'=-2*A+B, E'=A, F'=0, G'=0, H'=0, Q'=2*A, K'=C, [ B>=A && B>=2*A && A>=1 && 0>=-2*A+B && C>=1+2*A ], cost: 37+5*A 669.01/291.71 669.01/291.71 282: evalsipmamergesort2bb2in -> evalsipmamergesort2bb25in : D'=0, E'=A, F'=0, G'=0, H'=0, Q'=2*A, J'=0, [ 2*A>=1+B && A>=1 && -A+B>=1 && 2*A>=C ], cost: 15-A+3*B 669.01/291.71 669.01/291.71 283: evalsipmamergesort2bb2in -> evalsipmamergesort2bb14in : D'=0, E'=A, F'=0, G'=0, H'=0, Q'=2*A, K'=C, [ 2*A>=1+B && A>=1 && -A+B>=1 && C>=1+2*A ], cost: 37-A+3*B 669.01/291.71 669.01/291.71 284: evalsipmamergesort2bb2in -> [104] : [ A>=1+B && A>=1 && B>=1 ], cost: 3+2*B 669.01/291.71 669.01/291.71 285: evalsipmamergesort2bb2in -> [104] : [ 2*A>=1+B && A>=1 && -A+B>=1 ], cost: 3-3*A+3*B 669.01/291.71 669.01/291.71 286: evalsipmamergesort2bb2in -> [104] : [ 2*A>=1+B && A>=1 && -A+B>=1 ], cost: 3-A+3*B 669.01/291.71 669.01/291.71 300: evalsipmamergesort2bb2in -> evalsipmamergesort2bb2in : B'=B-2*k*A, D'=B-2*k*A, E'=0, F'=A, G'=0, H'=0, [ B>=A && A>=1 && -2*A+B>=1 && k>0 && -2*A*(-1+k)+B>=A && -2*A-2*A*(-1+k)+B>=1 ], cost: 10*k+5*k*A 669.01/291.71 669.01/291.71 301: evalsipmamergesort2bb2in -> evalsipmamergesort2bb2in : B'=-2*k_1*A+B, D'=-2*k_1*A+B, E'=A, F'=0, G'=0, H'=0, [ B>=A && A>=1 && -2*A+B>=1 && k_1>0 && -2*(-1+k_1)*A+B>=A && -2*A-2*(-1+k_1)*A+B>=1 ], cost: 10*k_1+5*k_1*A 669.01/291.71 669.01/291.71 261: evalsipmamergesort2bb14in -> [99] : L'=-2*Q+K, M'=0, N'=Q, [ K>=Q && K>=2*Q && Q>=1 ], cost: 2+5*Q 669.01/291.71 669.01/291.71 263: evalsipmamergesort2bb14in -> [99] : L'=0, M'=0, N'=-Q+K, [ 2*Q>=1+K && Q>=1 && -Q+K>=1 ], cost: 2+Q+2*K 669.01/291.71 669.01/291.71 269: evalsipmamergesort2bb14in -> [103] : [ 2*Q>=1+K && Q>=1 && -Q+K>=1 ], cost: 1+3*Q 669.01/291.71 669.01/291.71 270: evalsipmamergesort2bb14in -> [103] : [ K>=Q && K>=2*Q && Q>=1 ], cost: 1+3*Q 669.01/291.71 669.01/291.71 271: evalsipmamergesort2bb14in -> [103] : [ 2*Q>=1+K && Q>=1 && -Q+K>=1 ], cost: 1-3*Q+3*K 669.01/291.71 669.01/291.71 287: evalsipmamergesort2bb14in -> evalsipmamergesort2bb1in : A'=2*Q, L'=0, M'=K, N'=0, O'=0, P'=0, Q_1'=2*Q, [ Q>=1+K && Q>=1 && K>=1 && C>=1+2*Q ], cost: 15+2*K 669.01/291.71 669.01/291.71 288: evalsipmamergesort2bb14in -> evalsipmamergesort2bb25in : J'=1, L'=0, M'=K, N'=0, O'=0, P'=0, Q_1'=2*Q, [ Q>=1+K && Q>=1 && K>=1 && 2*Q>=C ], cost: 15+2*K 669.01/291.71 669.01/291.71 290: evalsipmamergesort2bb14in -> evalsipmamergesort2bb1in : A'=2*Q, L'=-2*Q+K, M'=0, N'=Q, O'=0, P'=0, Q_1'=2*Q, [ K>=Q && K>=2*Q && Q>=1 && 0>=-2*Q+K && C>=1+2*Q ], cost: 15+5*Q 669.01/291.71 669.01/291.71 291: evalsipmamergesort2bb14in -> evalsipmamergesort2bb25in : J'=1, L'=-2*Q+K, M'=0, N'=Q, O'=0, P'=0, Q_1'=2*Q, [ K>=Q && K>=2*Q && Q>=1 && 0>=-2*Q+K && 2*Q>=C ], cost: 15+5*Q 669.01/291.71 669.01/291.71 293: evalsipmamergesort2bb14in -> evalsipmamergesort2bb1in : A'=2*Q, L'=-2*Q+K, M'=Q, N'=0, O'=0, P'=0, Q_1'=2*Q, [ K>=Q && K>=2*Q && Q>=1 && 0>=-2*Q+K && C>=1+2*Q ], cost: 15+5*Q 669.01/291.71 669.01/291.71 294: evalsipmamergesort2bb14in -> evalsipmamergesort2bb25in : J'=1, L'=-2*Q+K, M'=Q, N'=0, O'=0, P'=0, Q_1'=2*Q, [ K>=Q && K>=2*Q && Q>=1 && 0>=-2*Q+K && 2*Q>=C ], cost: 15+5*Q 669.01/291.71 669.01/291.71 295: evalsipmamergesort2bb14in -> evalsipmamergesort2bb1in : A'=2*Q, L'=0, M'=Q, N'=0, O'=0, P'=0, Q_1'=2*Q, [ 2*Q>=1+K && Q>=1 && -Q+K>=1 && C>=1+2*Q ], cost: 15-Q+3*K 669.01/291.71 669.01/291.71 296: evalsipmamergesort2bb14in -> evalsipmamergesort2bb25in : J'=1, L'=0, M'=Q, N'=0, O'=0, P'=0, Q_1'=2*Q, [ 2*Q>=1+K && Q>=1 && -Q+K>=1 && 2*Q>=C ], cost: 15-Q+3*K 669.01/291.71 669.01/291.71 297: evalsipmamergesort2bb14in -> [105] : [ Q>=1+K && Q>=1 && K>=1 ], cost: 3+2*K 669.01/291.71 669.01/291.71 298: evalsipmamergesort2bb14in -> [105] : [ 2*Q>=1+K && Q>=1 && -Q+K>=1 ], cost: 3-3*Q+3*K 669.01/291.71 669.01/291.71 299: evalsipmamergesort2bb14in -> [105] : [ 2*Q>=1+K && Q>=1 && -Q+K>=1 ], cost: 3-Q+3*K 669.01/291.71 669.01/291.71 302: evalsipmamergesort2bb14in -> evalsipmamergesort2bb14in : K'=K-2*Q*k_2, L'=K-2*Q*k_2, M'=0, N'=Q, O'=0, P'=0, [ K>=Q && Q>=1 && -2*Q+K>=1 && k_2>0 && -2*Q*(-1+k_2)+K>=Q && -2*Q-2*Q*(-1+k_2)+K>=1 ], cost: 5*Q*k_2+10*k_2 669.01/291.71 669.01/291.71 303: evalsipmamergesort2bb14in -> evalsipmamergesort2bb14in : K'=-2*Q*k_3+K, L'=-2*Q*k_3+K, M'=Q, N'=0, O'=0, P'=0, [ K>=Q && Q>=1 && -2*Q+K>=1 && k_3>0 && K-2*(-1+k_3)*Q>=Q && -2*Q+K-2*(-1+k_3)*Q>=1 ], cost: 5*Q*k_3+10*k_3 669.01/291.71 669.01/291.71 197: evalsipmamergesort2bb25in -> evalsipmamergesort2bb26in : R'=1+C, [ J==0 && C>=1 ], cost: 1+2*C 669.01/291.71 669.01/291.71 669.01/291.71 669.01/291.71 Chained accelerated rules (with incoming rules): 669.01/291.71 669.01/291.71 Start location: evalsipmamergesort2start 669.01/291.71 669.01/291.71 138: evalsipmamergesort2start -> evalsipmamergesort2bb1in : A'=1, [], cost: 25 669.01/291.71 669.01/291.71 25: evalsipmamergesort2bb1in -> evalsipmamergesort2bb2in : B'=C, [], cost: 1 669.01/291.71 669.01/291.71 304: evalsipmamergesort2bb1in -> evalsipmamergesort2bb2in : B'=C-2*k*A, D'=C-2*k*A, E'=0, F'=A, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 ], cost: 1+10*k+5*k*A 669.01/291.71 669.01/291.71 305: evalsipmamergesort2bb1in -> evalsipmamergesort2bb2in : B'=C-2*k_1*A, D'=C-2*k_1*A, E'=A, F'=0, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 ], cost: 1+10*k_1+5*k_1*A 669.01/291.71 669.01/291.71 238: evalsipmamergesort2bb2in -> [98] : D'=-2*A+B, E'=0, F'=A, [ B>=A && B>=2*A && A>=1 ], cost: 2+5*A 669.01/291.71 669.01/291.71 240: evalsipmamergesort2bb2in -> [98] : D'=0, E'=0, F'=-A+B, [ 2*A>=1+B && A>=1 && -A+B>=1 ], cost: 2+A+2*B 669.01/291.71 669.01/291.71 246: evalsipmamergesort2bb2in -> [102] : [ 2*A>=1+B && A>=1 && -A+B>=1 ], cost: 1+3*A 669.01/291.71 669.01/291.71 247: evalsipmamergesort2bb2in -> [102] : [ B>=A && B>=2*A && A>=1 ], cost: 1+3*A 669.01/291.71 669.01/291.71 248: evalsipmamergesort2bb2in -> [102] : [ 2*A>=1+B && A>=1 && -A+B>=1 ], cost: 1-3*A+3*B 669.01/291.71 669.01/291.71 274: evalsipmamergesort2bb2in -> evalsipmamergesort2bb25in : D'=0, E'=B, F'=0, G'=0, H'=0, Q'=2*A, J'=0, [ A>=1+B && A>=1 && B>=1 && 2*A>=C ], cost: 15+2*B 669.01/291.71 669.01/291.71 275: evalsipmamergesort2bb2in -> evalsipmamergesort2bb14in : D'=0, E'=B, F'=0, G'=0, H'=0, Q'=2*A, K'=C, [ A>=1+B && A>=1 && B>=1 && C>=1+2*A ], cost: 37+2*B 669.01/291.71 669.01/291.71 277: evalsipmamergesort2bb2in -> evalsipmamergesort2bb25in : D'=-2*A+B, E'=0, F'=A, G'=0, H'=0, Q'=2*A, J'=0, [ B>=A && B>=2*A && A>=1 && 0>=-2*A+B && 2*A>=C ], cost: 15+5*A 669.01/291.71 669.01/291.71 278: evalsipmamergesort2bb2in -> evalsipmamergesort2bb14in : D'=-2*A+B, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C, [ B>=A && B>=2*A && A>=1 && 0>=-2*A+B && C>=1+2*A ], cost: 37+5*A 669.01/291.71 669.01/291.71 280: evalsipmamergesort2bb2in -> evalsipmamergesort2bb25in : D'=-2*A+B, E'=A, F'=0, G'=0, H'=0, Q'=2*A, J'=0, [ B>=A && B>=2*A && A>=1 && 0>=-2*A+B && 2*A>=C ], cost: 15+5*A 669.01/291.71 669.01/291.71 281: evalsipmamergesort2bb2in -> evalsipmamergesort2bb14in : D'=-2*A+B, E'=A, F'=0, G'=0, H'=0, Q'=2*A, K'=C, [ B>=A && B>=2*A && A>=1 && 0>=-2*A+B && C>=1+2*A ], cost: 37+5*A 669.01/291.71 669.01/291.71 282: evalsipmamergesort2bb2in -> evalsipmamergesort2bb25in : D'=0, E'=A, F'=0, G'=0, H'=0, Q'=2*A, J'=0, [ 2*A>=1+B && A>=1 && -A+B>=1 && 2*A>=C ], cost: 15-A+3*B 669.01/291.71 669.01/291.71 283: evalsipmamergesort2bb2in -> evalsipmamergesort2bb14in : D'=0, E'=A, F'=0, G'=0, H'=0, Q'=2*A, K'=C, [ 2*A>=1+B && A>=1 && -A+B>=1 && C>=1+2*A ], cost: 37-A+3*B 669.01/291.71 669.01/291.71 284: evalsipmamergesort2bb2in -> [104] : [ A>=1+B && A>=1 && B>=1 ], cost: 3+2*B 669.01/291.71 669.01/291.71 285: evalsipmamergesort2bb2in -> [104] : [ 2*A>=1+B && A>=1 && -A+B>=1 ], cost: 3-3*A+3*B 669.01/291.71 669.01/291.71 286: evalsipmamergesort2bb2in -> [104] : [ 2*A>=1+B && A>=1 && -A+B>=1 ], cost: 3-A+3*B 669.01/291.71 669.01/291.71 306: evalsipmamergesort2bb2in -> evalsipmamergesort2bb14in : D'=0, E'=B, F'=0, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ A>=1+B && A>=1 && B>=1 && C>=1+2*A && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 ], cost: 37+10*k_2+10*A*k_2+2*B 669.01/291.71 669.01/291.71 307: evalsipmamergesort2bb2in -> evalsipmamergesort2bb14in : D'=-2*A+B, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ B>=A && 2*A-B==0 && A>=1 && C>=1+2*A && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 ], cost: 37+5*A+10*k_2+10*A*k_2 669.01/291.71 669.01/291.71 308: evalsipmamergesort2bb2in -> evalsipmamergesort2bb14in : D'=-2*A+B, E'=A, F'=0, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ B>=A && 2*A-B==0 && A>=1 && C>=1+2*A && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 ], cost: 37+5*A+10*k_2+10*A*k_2 669.01/291.71 669.01/291.71 309: evalsipmamergesort2bb2in -> evalsipmamergesort2bb14in : D'=0, E'=A, F'=0, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ 2*A>=1+B && A>=1 && -A+B>=1 && C>=1+2*A && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 ], cost: 37-A+10*k_2+10*A*k_2+3*B 669.01/291.71 669.01/291.71 310: evalsipmamergesort2bb2in -> evalsipmamergesort2bb14in : D'=0, E'=B, F'=0, G'=0, H'=0, Q'=2*A, K'=-4*A*k_3+C, L'=-4*A*k_3+C, M'=2*A, N'=0, O'=0, P'=0, [ A>=1+B && A>=1 && B>=1 && C>=1+2*A && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 ], cost: 37+10*A*k_3+10*k_3+2*B 669.01/291.71 669.01/291.71 311: evalsipmamergesort2bb2in -> evalsipmamergesort2bb14in : D'=-2*A+B, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=-4*A*k_3+C, L'=-4*A*k_3+C, M'=2*A, N'=0, O'=0, P'=0, [ B>=A && 2*A-B==0 && A>=1 && C>=1+2*A && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 ], cost: 37+10*A*k_3+5*A+10*k_3 669.01/291.71 669.01/291.71 312: evalsipmamergesort2bb2in -> evalsipmamergesort2bb14in : D'=-2*A+B, E'=A, F'=0, G'=0, H'=0, Q'=2*A, K'=-4*A*k_3+C, L'=-4*A*k_3+C, M'=2*A, N'=0, O'=0, P'=0, [ B>=A && 2*A-B==0 && A>=1 && C>=1+2*A && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 ], cost: 37+10*A*k_3+5*A+10*k_3 669.01/291.71 669.01/291.71 313: evalsipmamergesort2bb2in -> evalsipmamergesort2bb14in : D'=0, E'=A, F'=0, G'=0, H'=0, Q'=2*A, K'=-4*A*k_3+C, L'=-4*A*k_3+C, M'=2*A, N'=0, O'=0, P'=0, [ 2*A>=1+B && A>=1 && -A+B>=1 && C>=1+2*A && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 ], cost: 37+10*A*k_3-A+10*k_3+3*B 669.01/291.71 669.01/291.71 261: evalsipmamergesort2bb14in -> [99] : L'=-2*Q+K, M'=0, N'=Q, [ K>=Q && K>=2*Q && Q>=1 ], cost: 2+5*Q 669.01/291.71 669.01/291.71 263: evalsipmamergesort2bb14in -> [99] : L'=0, M'=0, N'=-Q+K, [ 2*Q>=1+K && Q>=1 && -Q+K>=1 ], cost: 2+Q+2*K 669.01/291.71 669.01/291.71 269: evalsipmamergesort2bb14in -> [103] : [ 2*Q>=1+K && Q>=1 && -Q+K>=1 ], cost: 1+3*Q 669.01/291.71 669.01/291.71 270: evalsipmamergesort2bb14in -> [103] : [ K>=Q && K>=2*Q && Q>=1 ], cost: 1+3*Q 669.01/291.71 669.01/291.71 271: evalsipmamergesort2bb14in -> [103] : [ 2*Q>=1+K && Q>=1 && -Q+K>=1 ], cost: 1-3*Q+3*K 669.01/291.71 669.01/291.71 287: evalsipmamergesort2bb14in -> evalsipmamergesort2bb1in : A'=2*Q, L'=0, M'=K, N'=0, O'=0, P'=0, Q_1'=2*Q, [ Q>=1+K && Q>=1 && K>=1 && C>=1+2*Q ], cost: 15+2*K 669.01/291.71 669.01/291.71 288: evalsipmamergesort2bb14in -> evalsipmamergesort2bb25in : J'=1, L'=0, M'=K, N'=0, O'=0, P'=0, Q_1'=2*Q, [ Q>=1+K && Q>=1 && K>=1 && 2*Q>=C ], cost: 15+2*K 669.01/291.71 669.01/291.71 290: evalsipmamergesort2bb14in -> evalsipmamergesort2bb1in : A'=2*Q, L'=-2*Q+K, M'=0, N'=Q, O'=0, P'=0, Q_1'=2*Q, [ K>=Q && K>=2*Q && Q>=1 && 0>=-2*Q+K && C>=1+2*Q ], cost: 15+5*Q 669.01/291.71 669.01/291.71 291: evalsipmamergesort2bb14in -> evalsipmamergesort2bb25in : J'=1, L'=-2*Q+K, M'=0, N'=Q, O'=0, P'=0, Q_1'=2*Q, [ K>=Q && K>=2*Q && Q>=1 && 0>=-2*Q+K && 2*Q>=C ], cost: 15+5*Q 669.01/291.71 669.01/291.71 293: evalsipmamergesort2bb14in -> evalsipmamergesort2bb1in : A'=2*Q, L'=-2*Q+K, M'=Q, N'=0, O'=0, P'=0, Q_1'=2*Q, [ K>=Q && K>=2*Q && Q>=1 && 0>=-2*Q+K && C>=1+2*Q ], cost: 15+5*Q 669.01/291.71 669.01/291.71 294: evalsipmamergesort2bb14in -> evalsipmamergesort2bb25in : J'=1, L'=-2*Q+K, M'=Q, N'=0, O'=0, P'=0, Q_1'=2*Q, [ K>=Q && K>=2*Q && Q>=1 && 0>=-2*Q+K && 2*Q>=C ], cost: 15+5*Q 669.01/291.71 669.01/291.71 295: evalsipmamergesort2bb14in -> evalsipmamergesort2bb1in : A'=2*Q, L'=0, M'=Q, N'=0, O'=0, P'=0, Q_1'=2*Q, [ 2*Q>=1+K && Q>=1 && -Q+K>=1 && C>=1+2*Q ], cost: 15-Q+3*K 669.01/291.71 669.01/291.71 296: evalsipmamergesort2bb14in -> evalsipmamergesort2bb25in : J'=1, L'=0, M'=Q, N'=0, O'=0, P'=0, Q_1'=2*Q, [ 2*Q>=1+K && Q>=1 && -Q+K>=1 && 2*Q>=C ], cost: 15-Q+3*K 669.01/291.71 669.01/291.71 297: evalsipmamergesort2bb14in -> [105] : [ Q>=1+K && Q>=1 && K>=1 ], cost: 3+2*K 669.01/291.71 669.01/291.71 298: evalsipmamergesort2bb14in -> [105] : [ 2*Q>=1+K && Q>=1 && -Q+K>=1 ], cost: 3-3*Q+3*K 669.01/291.71 669.01/291.71 299: evalsipmamergesort2bb14in -> [105] : [ 2*Q>=1+K && Q>=1 && -Q+K>=1 ], cost: 3-Q+3*K 669.01/291.71 669.01/291.71 197: evalsipmamergesort2bb25in -> evalsipmamergesort2bb26in : R'=1+C, [ J==0 && C>=1 ], cost: 1+2*C 669.01/291.71 669.01/291.71 669.01/291.71 669.01/291.71 Eliminated locations (on tree-shaped paths): 669.01/291.71 669.01/291.71 Start location: evalsipmamergesort2start 669.01/291.71 669.01/291.71 138: evalsipmamergesort2start -> evalsipmamergesort2bb1in : A'=1, [], cost: 25 669.01/291.71 669.01/291.71 314: evalsipmamergesort2bb1in -> [98] : B'=C, D'=C-2*A, E'=0, F'=A, [ C>=A && C>=2*A && A>=1 ], cost: 3+5*A 669.01/291.71 669.01/291.71 315: evalsipmamergesort2bb1in -> [98] : B'=C, D'=0, E'=0, F'=C-A, [ 2*A>=1+C && A>=1 && C-A>=1 ], cost: 3+2*C+A 669.01/291.71 669.01/291.71 316: evalsipmamergesort2bb1in -> [102] : B'=C, [ 2*A>=1+C && A>=1 && C-A>=1 ], cost: 2+3*A 669.01/291.71 669.01/291.71 317: evalsipmamergesort2bb1in -> [102] : B'=C, [ C>=A && C>=2*A && A>=1 ], cost: 2+3*A 669.01/291.71 669.01/291.71 318: evalsipmamergesort2bb1in -> [102] : B'=C, [ 2*A>=1+C && A>=1 && C-A>=1 ], cost: 2+3*C-3*A 669.01/291.71 669.01/291.71 319: evalsipmamergesort2bb1in -> evalsipmamergesort2bb25in : B'=C, D'=0, E'=C, F'=0, G'=0, H'=0, Q'=2*A, J'=0, [ A>=1+C && A>=1 && C>=1 && 2*A>=C ], cost: 16+2*C 669.01/291.71 669.01/291.71 320: evalsipmamergesort2bb1in -> evalsipmamergesort2bb25in : B'=C, D'=C-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, J'=0, [ C>=A && C>=2*A && A>=1 && 0>=C-2*A ], cost: 16+5*A 669.01/291.71 669.01/291.71 321: evalsipmamergesort2bb1in -> evalsipmamergesort2bb25in : B'=C, D'=C-2*A, E'=A, F'=0, G'=0, H'=0, Q'=2*A, J'=0, [ C>=A && C>=2*A && A>=1 && 0>=C-2*A ], cost: 16+5*A 669.01/291.71 669.01/291.71 322: evalsipmamergesort2bb1in -> evalsipmamergesort2bb25in : B'=C, D'=0, E'=A, F'=0, G'=0, H'=0, Q'=2*A, J'=0, [ 2*A>=1+C && A>=1 && C-A>=1 ], cost: 16+3*C-A 669.01/291.71 669.01/291.71 323: evalsipmamergesort2bb1in -> [104] : B'=C, [ A>=1+C && A>=1 && C>=1 ], cost: 4+2*C 669.01/291.71 669.01/291.71 324: evalsipmamergesort2bb1in -> [104] : B'=C, [ 2*A>=1+C && A>=1 && C-A>=1 ], cost: 4+3*C-3*A 669.01/291.71 669.01/291.71 325: evalsipmamergesort2bb1in -> [104] : B'=C, [ 2*A>=1+C && A>=1 && C-A>=1 ], cost: 4+3*C-A 669.01/291.71 669.01/291.71 326: evalsipmamergesort2bb1in -> [98] : B'=C-2*k*A, D'=C-2*A-2*k*A, E'=0, F'=A, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && C-2*k*A>=2*A ], cost: 3+10*k+5*A+5*k*A 669.01/291.71 669.01/291.71 327: evalsipmamergesort2bb1in -> [98] : B'=C-2*k*A, D'=0, E'=0, F'=C-A-2*k*A, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && 2*A>=1+C-2*k*A && C-A-2*k*A>=1 ], cost: 3+10*k+2*C+A+k*A 669.01/291.71 669.01/291.71 328: evalsipmamergesort2bb1in -> [102] : B'=C-2*k*A, D'=C-2*k*A, E'=0, F'=A, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && 2*A>=1+C-2*k*A && C-A-2*k*A>=1 ], cost: 2+10*k+3*A+5*k*A 669.01/291.71 669.01/291.71 329: evalsipmamergesort2bb1in -> [102] : B'=C-2*k*A, D'=C-2*k*A, E'=0, F'=A, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && C-2*k*A>=2*A ], cost: 2+10*k+3*A+5*k*A 669.01/291.71 669.01/291.71 330: evalsipmamergesort2bb1in -> [102] : B'=C-2*k*A, D'=C-2*k*A, E'=0, F'=A, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && 2*A>=1+C-2*k*A && C-A-2*k*A>=1 ], cost: 2+10*k+3*C-3*A-k*A 669.01/291.71 669.01/291.71 331: evalsipmamergesort2bb1in -> evalsipmamergesort2bb14in : B'=C-2*k*A, D'=0, E'=C-2*k*A, F'=0, G'=0, H'=0, Q'=2*A, K'=C, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && A>=1+C-2*k*A ], cost: 38+10*k+2*C+k*A 669.01/291.71 669.01/291.71 332: evalsipmamergesort2bb1in -> evalsipmamergesort2bb14in : B'=C-2*k*A, D'=C-2*A-2*k*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && C-2*k*A>=2*A && 0>=C-2*A-2*k*A ], cost: 38+10*k+5*A+5*k*A 669.01/291.71 669.01/291.71 333: evalsipmamergesort2bb1in -> evalsipmamergesort2bb14in : B'=C-2*k*A, D'=C-2*A-2*k*A, E'=A, F'=0, G'=0, H'=0, Q'=2*A, K'=C, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && C-2*k*A>=2*A && 0>=C-2*A-2*k*A ], cost: 38+10*k+5*A+5*k*A 669.01/291.71 669.01/291.71 334: evalsipmamergesort2bb1in -> evalsipmamergesort2bb14in : B'=C-2*k*A, D'=0, E'=A, F'=0, G'=0, H'=0, Q'=2*A, K'=C, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && 2*A>=1+C-2*k*A && C-A-2*k*A>=1 ], cost: 38+10*k+3*C-A-k*A 669.01/291.71 669.01/291.71 335: evalsipmamergesort2bb1in -> [104] : B'=C-2*k*A, D'=C-2*k*A, E'=0, F'=A, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && A>=1+C-2*k*A ], cost: 4+10*k+2*C+k*A 669.01/291.71 669.01/291.71 336: evalsipmamergesort2bb1in -> [104] : B'=C-2*k*A, D'=C-2*k*A, E'=0, F'=A, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && 2*A>=1+C-2*k*A && C-A-2*k*A>=1 ], cost: 4+10*k+3*C-3*A-k*A 669.01/291.71 669.01/291.71 337: evalsipmamergesort2bb1in -> [104] : B'=C-2*k*A, D'=C-2*k*A, E'=0, F'=A, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && 2*A>=1+C-2*k*A && C-A-2*k*A>=1 ], cost: 4+10*k+3*C-A-k*A 669.01/291.71 669.01/291.71 338: evalsipmamergesort2bb1in -> evalsipmamergesort2bb14in : B'=C-2*k*A, D'=0, E'=C-2*k*A, F'=0, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && A>=1+C-2*k*A && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 ], cost: 38+10*k+2*C+10*k_2+10*A*k_2+k*A 669.01/291.71 669.01/291.71 339: evalsipmamergesort2bb1in -> evalsipmamergesort2bb14in : B'=C-2*k*A, D'=C-2*A-2*k*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && -C+2*A+2*k*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 ], cost: 38+10*k+5*A+10*k_2+10*A*k_2+5*k*A 669.01/291.71 669.01/291.71 340: evalsipmamergesort2bb1in -> evalsipmamergesort2bb14in : B'=C-2*k*A, D'=C-2*A-2*k*A, E'=A, F'=0, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && -C+2*A+2*k*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 ], cost: 38+10*k+5*A+10*k_2+10*A*k_2+5*k*A 669.01/291.71 669.01/291.71 341: evalsipmamergesort2bb1in -> evalsipmamergesort2bb14in : B'=C-2*k*A, D'=0, E'=A, F'=0, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && 2*A>=1+C-2*k*A && C-A-2*k*A>=1 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 ], cost: 38+10*k+3*C-A+10*k_2+10*A*k_2-k*A 669.01/291.71 669.01/291.71 342: evalsipmamergesort2bb1in -> evalsipmamergesort2bb14in : B'=C-2*k*A, D'=0, E'=C-2*k*A, F'=0, G'=0, H'=0, Q'=2*A, K'=-4*A*k_3+C, L'=-4*A*k_3+C, M'=2*A, N'=0, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && A>=1+C-2*k*A && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 ], cost: 38+10*A*k_3+10*k+2*C+10*k_3+k*A 669.01/291.71 669.01/291.71 343: evalsipmamergesort2bb1in -> evalsipmamergesort2bb14in : B'=C-2*k*A, D'=C-2*A-2*k*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=-4*A*k_3+C, L'=-4*A*k_3+C, M'=2*A, N'=0, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && -C+2*A+2*k*A==0 && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 ], cost: 38+10*A*k_3+10*k+5*A+10*k_3+5*k*A 669.01/291.71 669.01/291.71 344: evalsipmamergesort2bb1in -> evalsipmamergesort2bb14in : B'=C-2*k*A, D'=C-2*A-2*k*A, E'=A, F'=0, G'=0, H'=0, Q'=2*A, K'=-4*A*k_3+C, L'=-4*A*k_3+C, M'=2*A, N'=0, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && -C+2*A+2*k*A==0 && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 ], cost: 38+10*A*k_3+10*k+5*A+10*k_3+5*k*A 669.01/291.71 669.01/291.71 345: evalsipmamergesort2bb1in -> evalsipmamergesort2bb14in : B'=C-2*k*A, D'=0, E'=A, F'=0, G'=0, H'=0, Q'=2*A, K'=-4*A*k_3+C, L'=-4*A*k_3+C, M'=2*A, N'=0, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && 2*A>=1+C-2*k*A && C-A-2*k*A>=1 && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 ], cost: 38+10*A*k_3+10*k+3*C-A+10*k_3-k*A 669.01/291.71 669.01/291.71 346: evalsipmamergesort2bb1in -> [98] : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && C-2*k_1*A>=2*A ], cost: 3+10*k_1+5*k_1*A+5*A 669.01/291.71 669.01/291.71 347: evalsipmamergesort2bb1in -> [98] : B'=C-2*k_1*A, D'=0, E'=0, F'=C-2*k_1*A-A, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && 2*A>=1+C-2*k_1*A && C-2*k_1*A-A>=1 ], cost: 3+10*k_1+2*C+k_1*A+A 669.01/291.71 669.01/291.71 348: evalsipmamergesort2bb1in -> [102] : B'=C-2*k_1*A, D'=C-2*k_1*A, E'=A, F'=0, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && 2*A>=1+C-2*k_1*A && C-2*k_1*A-A>=1 ], cost: 2+10*k_1+5*k_1*A+3*A 669.01/291.71 669.01/291.71 349: evalsipmamergesort2bb1in -> [102] : B'=C-2*k_1*A, D'=C-2*k_1*A, E'=A, F'=0, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && C-2*k_1*A>=2*A ], cost: 2+10*k_1+5*k_1*A+3*A 669.01/291.71 669.01/291.71 350: evalsipmamergesort2bb1in -> [102] : B'=C-2*k_1*A, D'=C-2*k_1*A, E'=A, F'=0, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && 2*A>=1+C-2*k_1*A && C-2*k_1*A-A>=1 ], cost: 2+10*k_1+3*C-k_1*A-3*A 669.01/291.71 669.01/291.71 351: evalsipmamergesort2bb1in -> evalsipmamergesort2bb14in : B'=C-2*k_1*A, D'=0, E'=C-2*k_1*A, F'=0, G'=0, H'=0, Q'=2*A, K'=C, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && A>=1+C-2*k_1*A ], cost: 38+10*k_1+2*C+k_1*A 669.01/291.71 669.01/291.71 352: evalsipmamergesort2bb1in -> evalsipmamergesort2bb14in : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && C-2*k_1*A>=2*A && 0>=C-2*k_1*A-2*A ], cost: 38+10*k_1+5*k_1*A+5*A 669.01/291.71 669.01/291.71 353: evalsipmamergesort2bb1in -> evalsipmamergesort2bb14in : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=A, F'=0, G'=0, H'=0, Q'=2*A, K'=C, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && C-2*k_1*A>=2*A && 0>=C-2*k_1*A-2*A ], cost: 38+10*k_1+5*k_1*A+5*A 669.01/291.71 669.01/291.71 354: evalsipmamergesort2bb1in -> evalsipmamergesort2bb14in : B'=C-2*k_1*A, D'=0, E'=A, F'=0, G'=0, H'=0, Q'=2*A, K'=C, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && 2*A>=1+C-2*k_1*A && C-2*k_1*A-A>=1 ], cost: 38+10*k_1+3*C-k_1*A-A 669.01/291.71 669.01/291.71 355: evalsipmamergesort2bb1in -> [104] : B'=C-2*k_1*A, D'=C-2*k_1*A, E'=A, F'=0, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && A>=1+C-2*k_1*A ], cost: 4+10*k_1+2*C+k_1*A 669.01/291.71 669.01/291.71 356: evalsipmamergesort2bb1in -> [104] : B'=C-2*k_1*A, D'=C-2*k_1*A, E'=A, F'=0, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && 2*A>=1+C-2*k_1*A && C-2*k_1*A-A>=1 ], cost: 4+10*k_1+3*C-k_1*A-3*A 669.01/291.71 669.01/291.71 357: evalsipmamergesort2bb1in -> [104] : B'=C-2*k_1*A, D'=C-2*k_1*A, E'=A, F'=0, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && 2*A>=1+C-2*k_1*A && C-2*k_1*A-A>=1 ], cost: 4+10*k_1+3*C-k_1*A-A 669.01/291.71 669.01/291.71 358: evalsipmamergesort2bb1in -> evalsipmamergesort2bb14in : B'=C-2*k_1*A, D'=0, E'=C-2*k_1*A, F'=0, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && A>=1+C-2*k_1*A && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 ], cost: 38+10*k_1+2*C+k_1*A+10*k_2+10*A*k_2 669.01/291.71 669.01/291.71 359: evalsipmamergesort2bb1in -> evalsipmamergesort2bb14in : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 ], cost: 38+10*k_1+5*k_1*A+5*A+10*k_2+10*A*k_2 669.01/291.71 669.01/291.71 360: evalsipmamergesort2bb1in -> evalsipmamergesort2bb14in : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=A, F'=0, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 ], cost: 38+10*k_1+5*k_1*A+5*A+10*k_2+10*A*k_2 669.01/291.71 669.01/291.71 361: evalsipmamergesort2bb1in -> evalsipmamergesort2bb14in : B'=C-2*k_1*A, D'=0, E'=A, F'=0, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && 2*A>=1+C-2*k_1*A && C-2*k_1*A-A>=1 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 ], cost: 38+10*k_1+3*C-k_1*A-A+10*k_2+10*A*k_2 669.01/291.71 669.01/291.71 362: evalsipmamergesort2bb1in -> evalsipmamergesort2bb14in : B'=C-2*k_1*A, D'=0, E'=C-2*k_1*A, F'=0, G'=0, H'=0, Q'=2*A, K'=-4*A*k_3+C, L'=-4*A*k_3+C, M'=2*A, N'=0, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && A>=1+C-2*k_1*A && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 ], cost: 38+10*k_1+10*A*k_3+2*C+k_1*A+10*k_3 669.01/291.71 669.01/291.71 363: evalsipmamergesort2bb1in -> evalsipmamergesort2bb14in : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=-4*A*k_3+C, L'=-4*A*k_3+C, M'=2*A, N'=0, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 ], cost: 38+10*k_1+10*A*k_3+5*k_1*A+5*A+10*k_3 669.01/291.71 669.01/291.71 364: evalsipmamergesort2bb1in -> evalsipmamergesort2bb14in : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=A, F'=0, G'=0, H'=0, Q'=2*A, K'=-4*A*k_3+C, L'=-4*A*k_3+C, M'=2*A, N'=0, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 ], cost: 38+10*k_1+10*A*k_3+5*k_1*A+5*A+10*k_3 669.01/291.71 669.01/291.71 365: evalsipmamergesort2bb1in -> evalsipmamergesort2bb14in : B'=C-2*k_1*A, D'=0, E'=A, F'=0, G'=0, H'=0, Q'=2*A, K'=-4*A*k_3+C, L'=-4*A*k_3+C, M'=2*A, N'=0, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && 2*A>=1+C-2*k_1*A && C-2*k_1*A-A>=1 && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 ], cost: 38+10*k_1+10*A*k_3+3*C-k_1*A-A+10*k_3 669.01/291.71 669.01/291.71 366: evalsipmamergesort2bb1in -> [108] : [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 ], cost: 1+10*k+5*k*A 669.01/291.71 669.01/291.71 367: evalsipmamergesort2bb1in -> [108] : [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 ], cost: 1+10*k_1+5*k_1*A 669.01/291.71 669.01/291.71 261: evalsipmamergesort2bb14in -> [99] : L'=-2*Q+K, M'=0, N'=Q, [ K>=Q && K>=2*Q && Q>=1 ], cost: 2+5*Q 669.01/291.71 669.01/291.71 263: evalsipmamergesort2bb14in -> [99] : L'=0, M'=0, N'=-Q+K, [ 2*Q>=1+K && Q>=1 && -Q+K>=1 ], cost: 2+Q+2*K 669.01/291.71 669.01/291.71 269: evalsipmamergesort2bb14in -> [103] : [ 2*Q>=1+K && Q>=1 && -Q+K>=1 ], cost: 1+3*Q 669.01/291.71 669.01/291.71 270: evalsipmamergesort2bb14in -> [103] : [ K>=Q && K>=2*Q && Q>=1 ], cost: 1+3*Q 669.01/291.71 669.01/291.71 271: evalsipmamergesort2bb14in -> [103] : [ 2*Q>=1+K && Q>=1 && -Q+K>=1 ], cost: 1-3*Q+3*K 669.01/291.71 669.01/291.71 287: evalsipmamergesort2bb14in -> evalsipmamergesort2bb1in : A'=2*Q, L'=0, M'=K, N'=0, O'=0, P'=0, Q_1'=2*Q, [ Q>=1+K && Q>=1 && K>=1 && C>=1+2*Q ], cost: 15+2*K 669.01/291.71 669.01/291.71 288: evalsipmamergesort2bb14in -> evalsipmamergesort2bb25in : J'=1, L'=0, M'=K, N'=0, O'=0, P'=0, Q_1'=2*Q, [ Q>=1+K && Q>=1 && K>=1 && 2*Q>=C ], cost: 15+2*K 669.01/291.71 669.01/291.71 290: evalsipmamergesort2bb14in -> evalsipmamergesort2bb1in : A'=2*Q, L'=-2*Q+K, M'=0, N'=Q, O'=0, P'=0, Q_1'=2*Q, [ K>=Q && K>=2*Q && Q>=1 && 0>=-2*Q+K && C>=1+2*Q ], cost: 15+5*Q 669.01/291.71 669.01/291.71 291: evalsipmamergesort2bb14in -> evalsipmamergesort2bb25in : J'=1, L'=-2*Q+K, M'=0, N'=Q, O'=0, P'=0, Q_1'=2*Q, [ K>=Q && K>=2*Q && Q>=1 && 0>=-2*Q+K && 2*Q>=C ], cost: 15+5*Q 669.01/291.71 669.01/291.71 293: evalsipmamergesort2bb14in -> evalsipmamergesort2bb1in : A'=2*Q, L'=-2*Q+K, M'=Q, N'=0, O'=0, P'=0, Q_1'=2*Q, [ K>=Q && K>=2*Q && Q>=1 && 0>=-2*Q+K && C>=1+2*Q ], cost: 15+5*Q 669.01/291.71 669.01/291.71 294: evalsipmamergesort2bb14in -> evalsipmamergesort2bb25in : J'=1, L'=-2*Q+K, M'=Q, N'=0, O'=0, P'=0, Q_1'=2*Q, [ K>=Q && K>=2*Q && Q>=1 && 0>=-2*Q+K && 2*Q>=C ], cost: 15+5*Q 669.01/291.71 669.01/291.71 295: evalsipmamergesort2bb14in -> evalsipmamergesort2bb1in : A'=2*Q, L'=0, M'=Q, N'=0, O'=0, P'=0, Q_1'=2*Q, [ 2*Q>=1+K && Q>=1 && -Q+K>=1 && C>=1+2*Q ], cost: 15-Q+3*K 669.01/291.71 669.01/291.71 296: evalsipmamergesort2bb14in -> evalsipmamergesort2bb25in : J'=1, L'=0, M'=Q, N'=0, O'=0, P'=0, Q_1'=2*Q, [ 2*Q>=1+K && Q>=1 && -Q+K>=1 && 2*Q>=C ], cost: 15-Q+3*K 669.01/291.71 669.01/291.71 297: evalsipmamergesort2bb14in -> [105] : [ Q>=1+K && Q>=1 && K>=1 ], cost: 3+2*K 669.01/291.71 669.01/291.71 298: evalsipmamergesort2bb14in -> [105] : [ 2*Q>=1+K && Q>=1 && -Q+K>=1 ], cost: 3-3*Q+3*K 669.01/291.71 669.01/291.71 299: evalsipmamergesort2bb14in -> [105] : [ 2*Q>=1+K && Q>=1 && -Q+K>=1 ], cost: 3-Q+3*K 669.01/291.71 669.01/291.71 197: evalsipmamergesort2bb25in -> evalsipmamergesort2bb26in : R'=1+C, [ J==0 && C>=1 ], cost: 1+2*C 669.01/291.71 669.01/291.71 669.01/291.71 669.01/291.71 Applied pruning (of leafs and parallel rules): 669.01/291.71 669.01/291.71 Start location: evalsipmamergesort2start 669.01/291.71 669.01/291.71 138: evalsipmamergesort2start -> evalsipmamergesort2bb1in : A'=1, [], cost: 25 669.01/291.71 669.01/291.71 314: evalsipmamergesort2bb1in -> [98] : B'=C, D'=C-2*A, E'=0, F'=A, [ C>=A && C>=2*A && A>=1 ], cost: 3+5*A 669.01/291.71 669.01/291.71 315: evalsipmamergesort2bb1in -> [98] : B'=C, D'=0, E'=0, F'=C-A, [ 2*A>=1+C && A>=1 && C-A>=1 ], cost: 3+2*C+A 669.01/291.71 669.01/291.71 316: evalsipmamergesort2bb1in -> [102] : B'=C, [ 2*A>=1+C && A>=1 && C-A>=1 ], cost: 2+3*A 669.01/291.71 669.01/291.71 317: evalsipmamergesort2bb1in -> [102] : B'=C, [ C>=A && C>=2*A && A>=1 ], cost: 2+3*A 669.01/291.71 669.01/291.71 318: evalsipmamergesort2bb1in -> [102] : B'=C, [ 2*A>=1+C && A>=1 && C-A>=1 ], cost: 2+3*C-3*A 669.01/291.71 669.01/291.71 319: evalsipmamergesort2bb1in -> evalsipmamergesort2bb25in : B'=C, D'=0, E'=C, F'=0, G'=0, H'=0, Q'=2*A, J'=0, [ A>=1+C && A>=1 && C>=1 && 2*A>=C ], cost: 16+2*C 669.01/291.71 669.01/291.71 320: evalsipmamergesort2bb1in -> evalsipmamergesort2bb25in : B'=C, D'=C-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, J'=0, [ C>=A && C>=2*A && A>=1 && 0>=C-2*A ], cost: 16+5*A 669.01/291.71 669.01/291.71 321: evalsipmamergesort2bb1in -> evalsipmamergesort2bb25in : B'=C, D'=C-2*A, E'=A, F'=0, G'=0, H'=0, Q'=2*A, J'=0, [ C>=A && C>=2*A && A>=1 && 0>=C-2*A ], cost: 16+5*A 669.01/291.71 669.01/291.71 322: evalsipmamergesort2bb1in -> evalsipmamergesort2bb25in : B'=C, D'=0, E'=A, F'=0, G'=0, H'=0, Q'=2*A, J'=0, [ 2*A>=1+C && A>=1 && C-A>=1 ], cost: 16+3*C-A 669.01/291.71 669.01/291.71 323: evalsipmamergesort2bb1in -> [104] : B'=C, [ A>=1+C && A>=1 && C>=1 ], cost: 4+2*C 669.01/291.71 669.01/291.71 324: evalsipmamergesort2bb1in -> [104] : B'=C, [ 2*A>=1+C && A>=1 && C-A>=1 ], cost: 4+3*C-3*A 669.01/291.71 669.01/291.71 325: evalsipmamergesort2bb1in -> [104] : B'=C, [ 2*A>=1+C && A>=1 && C-A>=1 ], cost: 4+3*C-A 669.01/291.71 669.01/291.71 326: evalsipmamergesort2bb1in -> [98] : B'=C-2*k*A, D'=C-2*A-2*k*A, E'=0, F'=A, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && C-2*k*A>=2*A ], cost: 3+10*k+5*A+5*k*A 669.01/291.71 669.01/291.71 327: evalsipmamergesort2bb1in -> [98] : B'=C-2*k*A, D'=0, E'=0, F'=C-A-2*k*A, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && 2*A>=1+C-2*k*A && C-A-2*k*A>=1 ], cost: 3+10*k+2*C+A+k*A 669.01/291.71 669.01/291.71 328: evalsipmamergesort2bb1in -> [102] : B'=C-2*k*A, D'=C-2*k*A, E'=0, F'=A, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && 2*A>=1+C-2*k*A && C-A-2*k*A>=1 ], cost: 2+10*k+3*A+5*k*A 669.01/291.71 669.01/291.71 335: evalsipmamergesort2bb1in -> [104] : B'=C-2*k*A, D'=C-2*k*A, E'=0, F'=A, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && A>=1+C-2*k*A ], cost: 4+10*k+2*C+k*A 669.01/291.71 669.01/291.71 339: evalsipmamergesort2bb1in -> evalsipmamergesort2bb14in : B'=C-2*k*A, D'=C-2*A-2*k*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && -C+2*A+2*k*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 ], cost: 38+10*k+5*A+10*k_2+10*A*k_2+5*k*A 669.01/291.71 669.01/291.71 346: evalsipmamergesort2bb1in -> [98] : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && C-2*k_1*A>=2*A ], cost: 3+10*k_1+5*k_1*A+5*A 669.01/291.71 669.01/291.71 349: evalsipmamergesort2bb1in -> [102] : B'=C-2*k_1*A, D'=C-2*k_1*A, E'=A, F'=0, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && C-2*k_1*A>=2*A ], cost: 2+10*k_1+5*k_1*A+3*A 669.01/291.71 669.01/291.71 355: evalsipmamergesort2bb1in -> [104] : B'=C-2*k_1*A, D'=C-2*k_1*A, E'=A, F'=0, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && A>=1+C-2*k_1*A ], cost: 4+10*k_1+2*C+k_1*A 669.01/291.71 669.01/291.71 359: evalsipmamergesort2bb1in -> evalsipmamergesort2bb14in : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 ], cost: 38+10*k_1+5*k_1*A+5*A+10*k_2+10*A*k_2 669.01/291.71 669.01/291.71 361: evalsipmamergesort2bb1in -> evalsipmamergesort2bb14in : B'=C-2*k_1*A, D'=0, E'=A, F'=0, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && 2*A>=1+C-2*k_1*A && C-2*k_1*A-A>=1 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 ], cost: 38+10*k_1+3*C-k_1*A-A+10*k_2+10*A*k_2 669.01/291.71 669.01/291.71 362: evalsipmamergesort2bb1in -> evalsipmamergesort2bb14in : B'=C-2*k_1*A, D'=0, E'=C-2*k_1*A, F'=0, G'=0, H'=0, Q'=2*A, K'=-4*A*k_3+C, L'=-4*A*k_3+C, M'=2*A, N'=0, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && A>=1+C-2*k_1*A && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 ], cost: 38+10*k_1+10*A*k_3+2*C+k_1*A+10*k_3 669.01/291.71 669.01/291.71 363: evalsipmamergesort2bb1in -> evalsipmamergesort2bb14in : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=-4*A*k_3+C, L'=-4*A*k_3+C, M'=2*A, N'=0, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 ], cost: 38+10*k_1+10*A*k_3+5*k_1*A+5*A+10*k_3 669.01/291.71 669.01/291.71 366: evalsipmamergesort2bb1in -> [108] : [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 ], cost: 1+10*k+5*k*A 669.01/291.71 669.01/291.71 367: evalsipmamergesort2bb1in -> [108] : [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 ], cost: 1+10*k_1+5*k_1*A 669.01/291.71 669.01/291.71 261: evalsipmamergesort2bb14in -> [99] : L'=-2*Q+K, M'=0, N'=Q, [ K>=Q && K>=2*Q && Q>=1 ], cost: 2+5*Q 669.01/291.71 669.01/291.71 263: evalsipmamergesort2bb14in -> [99] : L'=0, M'=0, N'=-Q+K, [ 2*Q>=1+K && Q>=1 && -Q+K>=1 ], cost: 2+Q+2*K 669.01/291.71 669.01/291.71 269: evalsipmamergesort2bb14in -> [103] : [ 2*Q>=1+K && Q>=1 && -Q+K>=1 ], cost: 1+3*Q 669.01/291.71 669.01/291.71 270: evalsipmamergesort2bb14in -> [103] : [ K>=Q && K>=2*Q && Q>=1 ], cost: 1+3*Q 669.01/291.71 669.01/291.71 271: evalsipmamergesort2bb14in -> [103] : [ 2*Q>=1+K && Q>=1 && -Q+K>=1 ], cost: 1-3*Q+3*K 669.01/291.71 669.01/291.71 287: evalsipmamergesort2bb14in -> evalsipmamergesort2bb1in : A'=2*Q, L'=0, M'=K, N'=0, O'=0, P'=0, Q_1'=2*Q, [ Q>=1+K && Q>=1 && K>=1 && C>=1+2*Q ], cost: 15+2*K 669.01/291.71 669.01/291.71 288: evalsipmamergesort2bb14in -> evalsipmamergesort2bb25in : J'=1, L'=0, M'=K, N'=0, O'=0, P'=0, Q_1'=2*Q, [ Q>=1+K && Q>=1 && K>=1 && 2*Q>=C ], cost: 15+2*K 669.01/291.71 669.01/291.71 290: evalsipmamergesort2bb14in -> evalsipmamergesort2bb1in : A'=2*Q, L'=-2*Q+K, M'=0, N'=Q, O'=0, P'=0, Q_1'=2*Q, [ K>=Q && K>=2*Q && Q>=1 && 0>=-2*Q+K && C>=1+2*Q ], cost: 15+5*Q 669.01/291.71 669.01/291.71 291: evalsipmamergesort2bb14in -> evalsipmamergesort2bb25in : J'=1, L'=-2*Q+K, M'=0, N'=Q, O'=0, P'=0, Q_1'=2*Q, [ K>=Q && K>=2*Q && Q>=1 && 0>=-2*Q+K && 2*Q>=C ], cost: 15+5*Q 669.01/291.71 669.01/291.71 293: evalsipmamergesort2bb14in -> evalsipmamergesort2bb1in : A'=2*Q, L'=-2*Q+K, M'=Q, N'=0, O'=0, P'=0, Q_1'=2*Q, [ K>=Q && K>=2*Q && Q>=1 && 0>=-2*Q+K && C>=1+2*Q ], cost: 15+5*Q 669.01/291.71 669.01/291.71 294: evalsipmamergesort2bb14in -> evalsipmamergesort2bb25in : J'=1, L'=-2*Q+K, M'=Q, N'=0, O'=0, P'=0, Q_1'=2*Q, [ K>=Q && K>=2*Q && Q>=1 && 0>=-2*Q+K && 2*Q>=C ], cost: 15+5*Q 669.01/291.71 669.01/291.71 295: evalsipmamergesort2bb14in -> evalsipmamergesort2bb1in : A'=2*Q, L'=0, M'=Q, N'=0, O'=0, P'=0, Q_1'=2*Q, [ 2*Q>=1+K && Q>=1 && -Q+K>=1 && C>=1+2*Q ], cost: 15-Q+3*K 669.01/291.71 669.01/291.71 296: evalsipmamergesort2bb14in -> evalsipmamergesort2bb25in : J'=1, L'=0, M'=Q, N'=0, O'=0, P'=0, Q_1'=2*Q, [ 2*Q>=1+K && Q>=1 && -Q+K>=1 && 2*Q>=C ], cost: 15-Q+3*K 669.01/291.71 669.01/291.71 297: evalsipmamergesort2bb14in -> [105] : [ Q>=1+K && Q>=1 && K>=1 ], cost: 3+2*K 669.01/291.71 669.01/291.71 298: evalsipmamergesort2bb14in -> [105] : [ 2*Q>=1+K && Q>=1 && -Q+K>=1 ], cost: 3-3*Q+3*K 669.01/291.71 669.01/291.71 299: evalsipmamergesort2bb14in -> [105] : [ 2*Q>=1+K && Q>=1 && -Q+K>=1 ], cost: 3-Q+3*K 669.01/291.71 669.01/291.71 197: evalsipmamergesort2bb25in -> evalsipmamergesort2bb26in : R'=1+C, [ J==0 && C>=1 ], cost: 1+2*C 669.01/291.71 669.01/291.71 669.01/291.71 669.01/291.71 Eliminated locations (on tree-shaped paths): 669.01/291.71 669.01/291.71 Start location: evalsipmamergesort2start 669.01/291.71 669.01/291.71 138: evalsipmamergesort2start -> evalsipmamergesort2bb1in : A'=1, [], cost: 25 669.01/291.71 669.01/291.71 314: evalsipmamergesort2bb1in -> [98] : B'=C, D'=C-2*A, E'=0, F'=A, [ C>=A && C>=2*A && A>=1 ], cost: 3+5*A 669.01/291.71 669.01/291.71 315: evalsipmamergesort2bb1in -> [98] : B'=C, D'=0, E'=0, F'=C-A, [ 2*A>=1+C && A>=1 && C-A>=1 ], cost: 3+2*C+A 669.01/291.71 669.01/291.71 316: evalsipmamergesort2bb1in -> [102] : B'=C, [ 2*A>=1+C && A>=1 && C-A>=1 ], cost: 2+3*A 669.01/291.71 669.01/291.71 317: evalsipmamergesort2bb1in -> [102] : B'=C, [ C>=A && C>=2*A && A>=1 ], cost: 2+3*A 669.01/291.71 669.01/291.71 318: evalsipmamergesort2bb1in -> [102] : B'=C, [ 2*A>=1+C && A>=1 && C-A>=1 ], cost: 2+3*C-3*A 669.01/291.71 669.01/291.71 323: evalsipmamergesort2bb1in -> [104] : B'=C, [ A>=1+C && A>=1 && C>=1 ], cost: 4+2*C 669.01/291.71 669.01/291.71 324: evalsipmamergesort2bb1in -> [104] : B'=C, [ 2*A>=1+C && A>=1 && C-A>=1 ], cost: 4+3*C-3*A 669.01/291.71 669.01/291.71 325: evalsipmamergesort2bb1in -> [104] : B'=C, [ 2*A>=1+C && A>=1 && C-A>=1 ], cost: 4+3*C-A 669.01/291.71 669.01/291.71 326: evalsipmamergesort2bb1in -> [98] : B'=C-2*k*A, D'=C-2*A-2*k*A, E'=0, F'=A, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && C-2*k*A>=2*A ], cost: 3+10*k+5*A+5*k*A 669.01/291.71 669.01/291.71 327: evalsipmamergesort2bb1in -> [98] : B'=C-2*k*A, D'=0, E'=0, F'=C-A-2*k*A, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && 2*A>=1+C-2*k*A && C-A-2*k*A>=1 ], cost: 3+10*k+2*C+A+k*A 669.01/291.71 669.01/291.71 328: evalsipmamergesort2bb1in -> [102] : B'=C-2*k*A, D'=C-2*k*A, E'=0, F'=A, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && 2*A>=1+C-2*k*A && C-A-2*k*A>=1 ], cost: 2+10*k+3*A+5*k*A 669.01/291.71 669.01/291.71 335: evalsipmamergesort2bb1in -> [104] : B'=C-2*k*A, D'=C-2*k*A, E'=0, F'=A, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && A>=1+C-2*k*A ], cost: 4+10*k+2*C+k*A 669.01/291.71 669.01/291.71 346: evalsipmamergesort2bb1in -> [98] : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && C-2*k_1*A>=2*A ], cost: 3+10*k_1+5*k_1*A+5*A 669.01/291.71 669.01/291.71 349: evalsipmamergesort2bb1in -> [102] : B'=C-2*k_1*A, D'=C-2*k_1*A, E'=A, F'=0, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && C-2*k_1*A>=2*A ], cost: 2+10*k_1+5*k_1*A+3*A 669.01/291.71 669.01/291.71 355: evalsipmamergesort2bb1in -> [104] : B'=C-2*k_1*A, D'=C-2*k_1*A, E'=A, F'=0, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && A>=1+C-2*k_1*A ], cost: 4+10*k_1+2*C+k_1*A 669.01/291.71 669.01/291.71 366: evalsipmamergesort2bb1in -> [108] : [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 ], cost: 1+10*k+5*k*A 669.01/291.71 669.01/291.71 367: evalsipmamergesort2bb1in -> [108] : [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 ], cost: 1+10*k_1+5*k_1*A 669.01/291.71 669.01/291.71 368: evalsipmamergesort2bb1in -> [99] : B'=C-2*k*A, D'=C-2*A-2*k*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && -C+2*A+2*k*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && C-4*A*k_2>=2*A && C-4*A*k_2>=4*A ], cost: 40+10*k+15*A+10*k_2+10*A*k_2+5*k*A 669.01/291.71 669.01/291.71 369: evalsipmamergesort2bb1in -> [99] : B'=C-2*k*A, D'=C-2*A-2*k*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=0, M'=0, N'=C-2*A-4*A*k_2, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && -C+2*A+2*k*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 4*A>=1+C-4*A*k_2 && C-2*A-4*A*k_2>=1 ], cost: 40+10*k+2*C+7*A+10*k_2+2*A*k_2+5*k*A 669.01/291.71 669.01/291.71 370: evalsipmamergesort2bb1in -> [103] : B'=C-2*k*A, D'=C-2*A-2*k*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && -C+2*A+2*k*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 4*A>=1+C-4*A*k_2 && C-2*A-4*A*k_2>=1 ], cost: 39+10*k+11*A+10*k_2+10*A*k_2+5*k*A 669.01/291.71 669.01/291.71 371: evalsipmamergesort2bb1in -> [103] : B'=C-2*k*A, D'=C-2*A-2*k*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && -C+2*A+2*k*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && C-4*A*k_2>=2*A && C-4*A*k_2>=4*A ], cost: 39+10*k+11*A+10*k_2+10*A*k_2+5*k*A 669.01/291.71 669.01/291.71 372: evalsipmamergesort2bb1in -> [103] : B'=C-2*k*A, D'=C-2*A-2*k*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && -C+2*A+2*k*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 4*A>=1+C-4*A*k_2 && C-2*A-4*A*k_2>=1 ], cost: 39+10*k+3*C-A+10*k_2-2*A*k_2+5*k*A 669.01/291.71 669.01/291.71 373: evalsipmamergesort2bb1in -> evalsipmamergesort2bb1in : A'=4*A, B'=C-2*k*A, D'=C-2*A-2*k*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=0, M'=C-4*A*k_2, N'=0, O'=0, P'=0, Q_1'=4*A, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && -C+2*A+2*k*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 2*A>=1+C-4*A*k_2 ], cost: 53+10*k+2*C+5*A+10*k_2+2*A*k_2+5*k*A 669.01/291.71 669.01/291.71 374: evalsipmamergesort2bb1in -> evalsipmamergesort2bb1in : A'=4*A, B'=C-2*k*A, D'=C-2*A-2*k*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, Q_1'=4*A, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && -C+2*A+2*k*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && C-4*A*k_2>=2*A && C-4*A*k_2>=4*A && 0>=C-4*A-4*A*k_2 ], cost: 53+10*k+15*A+10*k_2+10*A*k_2+5*k*A 669.01/291.71 669.01/291.71 375: evalsipmamergesort2bb1in -> evalsipmamergesort2bb1in : A'=4*A, B'=C-2*k*A, D'=C-2*A-2*k*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A-4*A*k_2, M'=2*A, N'=0, O'=0, P'=0, Q_1'=4*A, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && -C+2*A+2*k*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && C-4*A*k_2>=2*A && C-4*A*k_2>=4*A && 0>=C-4*A-4*A*k_2 ], cost: 53+10*k+15*A+10*k_2+10*A*k_2+5*k*A 669.01/291.71 669.01/291.71 376: evalsipmamergesort2bb1in -> evalsipmamergesort2bb1in : A'=4*A, B'=C-2*k*A, D'=C-2*A-2*k*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=0, M'=2*A, N'=0, O'=0, P'=0, Q_1'=4*A, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && -C+2*A+2*k*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 4*A>=1+C-4*A*k_2 && C-2*A-4*A*k_2>=1 ], cost: 53+10*k+3*C+3*A+10*k_2-2*A*k_2+5*k*A 669.01/291.71 669.01/291.71 377: evalsipmamergesort2bb1in -> [105] : B'=C-2*k*A, D'=C-2*A-2*k*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && -C+2*A+2*k*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 2*A>=1+C-4*A*k_2 ], cost: 41+10*k+2*C+5*A+10*k_2+2*A*k_2+5*k*A 669.01/291.71 669.01/291.71 378: evalsipmamergesort2bb1in -> [105] : B'=C-2*k*A, D'=C-2*A-2*k*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && -C+2*A+2*k*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 4*A>=1+C-4*A*k_2 && C-2*A-4*A*k_2>=1 ], cost: 41+10*k+3*C-A+10*k_2-2*A*k_2+5*k*A 669.01/291.71 669.01/291.71 379: evalsipmamergesort2bb1in -> [105] : B'=C-2*k*A, D'=C-2*A-2*k*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && -C+2*A+2*k*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 4*A>=1+C-4*A*k_2 && C-2*A-4*A*k_2>=1 ], cost: 41+10*k+3*C+3*A+10*k_2-2*A*k_2+5*k*A 669.01/291.71 669.01/291.71 380: evalsipmamergesort2bb1in -> [99] : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && C-4*A*k_2>=2*A && C-4*A*k_2>=4*A ], cost: 40+10*k_1+5*k_1*A+15*A+10*k_2+10*A*k_2 669.01/291.71 669.01/291.71 381: evalsipmamergesort2bb1in -> [99] : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=0, M'=0, N'=C-2*A-4*A*k_2, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 4*A>=1+C-4*A*k_2 && C-2*A-4*A*k_2>=1 ], cost: 40+10*k_1+2*C+5*k_1*A+7*A+10*k_2+2*A*k_2 669.01/291.71 669.01/291.71 382: evalsipmamergesort2bb1in -> [103] : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 4*A>=1+C-4*A*k_2 && C-2*A-4*A*k_2>=1 ], cost: 39+10*k_1+5*k_1*A+11*A+10*k_2+10*A*k_2 669.01/291.71 669.01/291.71 383: evalsipmamergesort2bb1in -> [103] : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && C-4*A*k_2>=2*A && C-4*A*k_2>=4*A ], cost: 39+10*k_1+5*k_1*A+11*A+10*k_2+10*A*k_2 669.01/291.71 669.01/291.71 384: evalsipmamergesort2bb1in -> [103] : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 4*A>=1+C-4*A*k_2 && C-2*A-4*A*k_2>=1 ], cost: 39+10*k_1+3*C+5*k_1*A-A+10*k_2-2*A*k_2 669.01/291.71 669.01/291.71 385: evalsipmamergesort2bb1in -> evalsipmamergesort2bb1in : A'=4*A, B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=0, M'=C-4*A*k_2, N'=0, O'=0, P'=0, Q_1'=4*A, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 2*A>=1+C-4*A*k_2 ], cost: 53+10*k_1+2*C+5*k_1*A+5*A+10*k_2+2*A*k_2 669.01/291.72 669.01/291.72 386: evalsipmamergesort2bb1in -> evalsipmamergesort2bb1in : A'=4*A, B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, Q_1'=4*A, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && C-4*A*k_2>=2*A && C-4*A*k_2>=4*A && 0>=C-4*A-4*A*k_2 ], cost: 53+10*k_1+5*k_1*A+15*A+10*k_2+10*A*k_2 669.01/291.72 669.01/291.72 387: evalsipmamergesort2bb1in -> evalsipmamergesort2bb1in : A'=4*A, B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A-4*A*k_2, M'=2*A, N'=0, O'=0, P'=0, Q_1'=4*A, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && C-4*A*k_2>=2*A && C-4*A*k_2>=4*A && 0>=C-4*A-4*A*k_2 ], cost: 53+10*k_1+5*k_1*A+15*A+10*k_2+10*A*k_2 669.01/291.72 669.01/291.72 388: evalsipmamergesort2bb1in -> evalsipmamergesort2bb1in : A'=4*A, B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=0, M'=2*A, N'=0, O'=0, P'=0, Q_1'=4*A, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 4*A>=1+C-4*A*k_2 && C-2*A-4*A*k_2>=1 ], cost: 53+10*k_1+3*C+5*k_1*A+3*A+10*k_2-2*A*k_2 669.01/291.72 669.01/291.72 389: evalsipmamergesort2bb1in -> [105] : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 2*A>=1+C-4*A*k_2 ], cost: 41+10*k_1+2*C+5*k_1*A+5*A+10*k_2+2*A*k_2 669.01/291.72 669.01/291.72 390: evalsipmamergesort2bb1in -> [105] : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 4*A>=1+C-4*A*k_2 && C-2*A-4*A*k_2>=1 ], cost: 41+10*k_1+3*C+5*k_1*A-A+10*k_2-2*A*k_2 669.01/291.72 669.01/291.72 391: evalsipmamergesort2bb1in -> [105] : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 4*A>=1+C-4*A*k_2 && C-2*A-4*A*k_2>=1 ], cost: 41+10*k_1+3*C+5*k_1*A+3*A+10*k_2-2*A*k_2 669.01/291.72 669.01/291.72 392: evalsipmamergesort2bb1in -> [99] : B'=C-2*k_1*A, D'=0, E'=A, F'=0, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && 2*A>=1+C-2*k_1*A && C-2*k_1*A-A>=1 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && C-4*A*k_2>=2*A && C-4*A*k_2>=4*A ], cost: 40+10*k_1+3*C-k_1*A+9*A+10*k_2+10*A*k_2 669.01/291.72 669.01/291.72 393: evalsipmamergesort2bb1in -> [99] : B'=C-2*k_1*A, D'=0, E'=A, F'=0, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=0, M'=0, N'=C-2*A-4*A*k_2, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && 2*A>=1+C-2*k_1*A && C-2*k_1*A-A>=1 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 4*A>=1+C-4*A*k_2 && C-2*A-4*A*k_2>=1 ], cost: 40+10*k_1+5*C-k_1*A+A+10*k_2+2*A*k_2 669.01/291.72 669.01/291.72 394: evalsipmamergesort2bb1in -> [103] : B'=C-2*k_1*A, D'=0, E'=A, F'=0, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && 2*A>=1+C-2*k_1*A && C-2*k_1*A-A>=1 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 4*A>=1+C-4*A*k_2 && C-2*A-4*A*k_2>=1 ], cost: 39+10*k_1+3*C-k_1*A+5*A+10*k_2+10*A*k_2 669.01/291.72 669.01/291.72 395: evalsipmamergesort2bb1in -> [103] : B'=C-2*k_1*A, D'=0, E'=A, F'=0, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && 2*A>=1+C-2*k_1*A && C-2*k_1*A-A>=1 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && C-4*A*k_2>=2*A && C-4*A*k_2>=4*A ], cost: 39+10*k_1+3*C-k_1*A+5*A+10*k_2+10*A*k_2 669.01/291.72 669.01/291.72 396: evalsipmamergesort2bb1in -> [103] : B'=C-2*k_1*A, D'=0, E'=A, F'=0, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && 2*A>=1+C-2*k_1*A && C-2*k_1*A-A>=1 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 4*A>=1+C-4*A*k_2 && C-2*A-4*A*k_2>=1 ], cost: 39+10*k_1+6*C-k_1*A-7*A+10*k_2-2*A*k_2 669.01/291.72 669.01/291.72 397: evalsipmamergesort2bb1in -> evalsipmamergesort2bb1in : A'=4*A, B'=C-2*k_1*A, D'=0, E'=A, F'=0, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=0, M'=C-4*A*k_2, N'=0, O'=0, P'=0, Q_1'=4*A, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && 2*A>=1+C-2*k_1*A && C-2*k_1*A-A>=1 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 2*A>=1+C-4*A*k_2 ], cost: 53+10*k_1+5*C-k_1*A-A+10*k_2+2*A*k_2 669.01/291.72 669.01/291.72 398: evalsipmamergesort2bb1in -> evalsipmamergesort2bb1in : A'=4*A, B'=C-2*k_1*A, D'=0, E'=A, F'=0, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, Q_1'=4*A, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && 2*A>=1+C-2*k_1*A && C-2*k_1*A-A>=1 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && C-4*A*k_2>=2*A && C-4*A*k_2>=4*A && 0>=C-4*A-4*A*k_2 ], cost: 53+10*k_1+3*C-k_1*A+9*A+10*k_2+10*A*k_2 669.01/291.72 669.01/291.72 399: evalsipmamergesort2bb1in -> evalsipmamergesort2bb1in : A'=4*A, B'=C-2*k_1*A, D'=0, E'=A, F'=0, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A-4*A*k_2, M'=2*A, N'=0, O'=0, P'=0, Q_1'=4*A, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && 2*A>=1+C-2*k_1*A && C-2*k_1*A-A>=1 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && C-4*A*k_2>=2*A && C-4*A*k_2>=4*A && 0>=C-4*A-4*A*k_2 ], cost: 53+10*k_1+3*C-k_1*A+9*A+10*k_2+10*A*k_2 669.01/291.72 669.01/291.72 400: evalsipmamergesort2bb1in -> evalsipmamergesort2bb1in : A'=4*A, B'=C-2*k_1*A, D'=0, E'=A, F'=0, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=0, M'=2*A, N'=0, O'=0, P'=0, Q_1'=4*A, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && 2*A>=1+C-2*k_1*A && C-2*k_1*A-A>=1 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 4*A>=1+C-4*A*k_2 && C-2*A-4*A*k_2>=1 ], cost: 53+10*k_1+6*C-k_1*A-3*A+10*k_2-2*A*k_2 669.01/291.72 669.01/291.72 401: evalsipmamergesort2bb1in -> [105] : B'=C-2*k_1*A, D'=0, E'=A, F'=0, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && 2*A>=1+C-2*k_1*A && C-2*k_1*A-A>=1 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 2*A>=1+C-4*A*k_2 ], cost: 41+10*k_1+5*C-k_1*A-A+10*k_2+2*A*k_2 669.01/291.72 669.01/291.72 402: evalsipmamergesort2bb1in -> [105] : B'=C-2*k_1*A, D'=0, E'=A, F'=0, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && 2*A>=1+C-2*k_1*A && C-2*k_1*A-A>=1 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 4*A>=1+C-4*A*k_2 && C-2*A-4*A*k_2>=1 ], cost: 41+10*k_1+6*C-k_1*A-7*A+10*k_2-2*A*k_2 669.01/291.72 669.01/291.72 403: evalsipmamergesort2bb1in -> [105] : B'=C-2*k_1*A, D'=0, E'=A, F'=0, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && 2*A>=1+C-2*k_1*A && C-2*k_1*A-A>=1 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 4*A>=1+C-4*A*k_2 && C-2*A-4*A*k_2>=1 ], cost: 41+10*k_1+6*C-k_1*A-3*A+10*k_2-2*A*k_2 669.01/291.72 669.01/291.72 404: evalsipmamergesort2bb1in -> [99] : B'=C-2*k_1*A, D'=0, E'=C-2*k_1*A, F'=0, G'=0, H'=0, Q'=2*A, K'=-4*A*k_3+C, L'=-4*A*k_3+C-4*A, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && A>=1+C-2*k_1*A && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 && -4*A*k_3+C>=2*A && -4*A*k_3+C>=4*A ], cost: 40+10*k_1+10*A*k_3+2*C+k_1*A+10*A+10*k_3 669.01/291.72 669.01/291.72 405: evalsipmamergesort2bb1in -> [99] : B'=C-2*k_1*A, D'=0, E'=C-2*k_1*A, F'=0, G'=0, H'=0, Q'=2*A, K'=-4*A*k_3+C, L'=0, M'=0, N'=-4*A*k_3+C-2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && A>=1+C-2*k_1*A && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 && 4*A>=1-4*A*k_3+C && -4*A*k_3+C-2*A>=1 ], cost: 40+10*k_1+2*A*k_3+4*C+k_1*A+2*A+10*k_3 669.01/291.72 669.01/291.72 406: evalsipmamergesort2bb1in -> [103] : B'=C-2*k_1*A, D'=0, E'=C-2*k_1*A, F'=0, G'=0, H'=0, Q'=2*A, K'=-4*A*k_3+C, L'=-4*A*k_3+C, M'=2*A, N'=0, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && A>=1+C-2*k_1*A && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 && 4*A>=1-4*A*k_3+C && -4*A*k_3+C-2*A>=1 ], cost: 39+10*k_1+10*A*k_3+2*C+k_1*A+6*A+10*k_3 669.01/291.72 669.01/291.72 407: evalsipmamergesort2bb1in -> [103] : B'=C-2*k_1*A, D'=0, E'=C-2*k_1*A, F'=0, G'=0, H'=0, Q'=2*A, K'=-4*A*k_3+C, L'=-4*A*k_3+C, M'=2*A, N'=0, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && A>=1+C-2*k_1*A && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 && -4*A*k_3+C>=2*A && -4*A*k_3+C>=4*A ], cost: 39+10*k_1+10*A*k_3+2*C+k_1*A+6*A+10*k_3 669.01/291.72 669.01/291.72 408: evalsipmamergesort2bb1in -> [103] : B'=C-2*k_1*A, D'=0, E'=C-2*k_1*A, F'=0, G'=0, H'=0, Q'=2*A, K'=-4*A*k_3+C, L'=-4*A*k_3+C, M'=2*A, N'=0, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && A>=1+C-2*k_1*A && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 && 4*A>=1-4*A*k_3+C && -4*A*k_3+C-2*A>=1 ], cost: 39+10*k_1-2*A*k_3+5*C+k_1*A-6*A+10*k_3 669.01/291.72 669.01/291.72 409: evalsipmamergesort2bb1in -> evalsipmamergesort2bb1in : A'=4*A, B'=C-2*k_1*A, D'=0, E'=C-2*k_1*A, F'=0, G'=0, H'=0, Q'=2*A, K'=-4*A*k_3+C, L'=0, M'=-4*A*k_3+C, N'=0, O'=0, P'=0, Q_1'=4*A, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && A>=1+C-2*k_1*A && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 && 2*A>=1-4*A*k_3+C ], cost: 53+10*k_1+2*A*k_3+4*C+k_1*A+10*k_3 669.01/291.72 669.01/291.72 410: evalsipmamergesort2bb1in -> evalsipmamergesort2bb1in : A'=4*A, B'=C-2*k_1*A, D'=0, E'=C-2*k_1*A, F'=0, G'=0, H'=0, Q'=2*A, K'=-4*A*k_3+C, L'=-4*A*k_3+C-4*A, M'=0, N'=2*A, O'=0, P'=0, Q_1'=4*A, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && A>=1+C-2*k_1*A && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 && -4*A*k_3+C>=2*A && -4*A*k_3+C>=4*A && 0>=-4*A*k_3+C-4*A ], cost: 53+10*k_1+10*A*k_3+2*C+k_1*A+10*A+10*k_3 669.01/291.72 669.01/291.72 411: evalsipmamergesort2bb1in -> evalsipmamergesort2bb1in : A'=4*A, B'=C-2*k_1*A, D'=0, E'=C-2*k_1*A, F'=0, G'=0, H'=0, Q'=2*A, K'=-4*A*k_3+C, L'=-4*A*k_3+C-4*A, M'=2*A, N'=0, O'=0, P'=0, Q_1'=4*A, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && A>=1+C-2*k_1*A && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 && -4*A*k_3+C>=2*A && -4*A*k_3+C>=4*A && 0>=-4*A*k_3+C-4*A ], cost: 53+10*k_1+10*A*k_3+2*C+k_1*A+10*A+10*k_3 669.01/291.72 669.01/291.72 412: evalsipmamergesort2bb1in -> evalsipmamergesort2bb1in : A'=4*A, B'=C-2*k_1*A, D'=0, E'=C-2*k_1*A, F'=0, G'=0, H'=0, Q'=2*A, K'=-4*A*k_3+C, L'=0, M'=2*A, N'=0, O'=0, P'=0, Q_1'=4*A, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && A>=1+C-2*k_1*A && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 && 4*A>=1-4*A*k_3+C && -4*A*k_3+C-2*A>=1 ], cost: 53+10*k_1-2*A*k_3+5*C+k_1*A-2*A+10*k_3 669.01/291.72 669.01/291.72 413: evalsipmamergesort2bb1in -> [105] : B'=C-2*k_1*A, D'=0, E'=C-2*k_1*A, F'=0, G'=0, H'=0, Q'=2*A, K'=-4*A*k_3+C, L'=-4*A*k_3+C, M'=2*A, N'=0, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && A>=1+C-2*k_1*A && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 && 2*A>=1-4*A*k_3+C ], cost: 41+10*k_1+2*A*k_3+4*C+k_1*A+10*k_3 669.01/291.72 669.01/291.72 414: evalsipmamergesort2bb1in -> [105] : B'=C-2*k_1*A, D'=0, E'=C-2*k_1*A, F'=0, G'=0, H'=0, Q'=2*A, K'=-4*A*k_3+C, L'=-4*A*k_3+C, M'=2*A, N'=0, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && A>=1+C-2*k_1*A && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 && 4*A>=1-4*A*k_3+C && -4*A*k_3+C-2*A>=1 ], cost: 41+10*k_1-2*A*k_3+5*C+k_1*A-6*A+10*k_3 669.01/291.72 669.01/291.72 415: evalsipmamergesort2bb1in -> [105] : B'=C-2*k_1*A, D'=0, E'=C-2*k_1*A, F'=0, G'=0, H'=0, Q'=2*A, K'=-4*A*k_3+C, L'=-4*A*k_3+C, M'=2*A, N'=0, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && A>=1+C-2*k_1*A && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 && 4*A>=1-4*A*k_3+C && -4*A*k_3+C-2*A>=1 ], cost: 41+10*k_1-2*A*k_3+5*C+k_1*A-2*A+10*k_3 669.01/291.72 669.01/291.72 416: evalsipmamergesort2bb1in -> [99] : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=-4*A*k_3+C, L'=-4*A*k_3+C-4*A, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 && -4*A*k_3+C>=2*A && -4*A*k_3+C>=4*A ], cost: 40+10*k_1+10*A*k_3+5*k_1*A+15*A+10*k_3 669.01/291.72 669.01/291.72 417: evalsipmamergesort2bb1in -> [99] : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=-4*A*k_3+C, L'=0, M'=0, N'=-4*A*k_3+C-2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 && 4*A>=1-4*A*k_3+C && -4*A*k_3+C-2*A>=1 ], cost: 40+10*k_1+2*A*k_3+2*C+5*k_1*A+7*A+10*k_3 669.01/291.72 669.01/291.72 418: evalsipmamergesort2bb1in -> [103] : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=-4*A*k_3+C, L'=-4*A*k_3+C, M'=2*A, N'=0, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 && 4*A>=1-4*A*k_3+C && -4*A*k_3+C-2*A>=1 ], cost: 39+10*k_1+10*A*k_3+5*k_1*A+11*A+10*k_3 669.01/291.72 669.01/291.72 419: evalsipmamergesort2bb1in -> [103] : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=-4*A*k_3+C, L'=-4*A*k_3+C, M'=2*A, N'=0, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 && -4*A*k_3+C>=2*A && -4*A*k_3+C>=4*A ], cost: 39+10*k_1+10*A*k_3+5*k_1*A+11*A+10*k_3 669.01/291.72 669.01/291.72 420: evalsipmamergesort2bb1in -> [103] : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=-4*A*k_3+C, L'=-4*A*k_3+C, M'=2*A, N'=0, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 && 4*A>=1-4*A*k_3+C && -4*A*k_3+C-2*A>=1 ], cost: 39+10*k_1-2*A*k_3+3*C+5*k_1*A-A+10*k_3 669.01/291.72 669.01/291.72 421: evalsipmamergesort2bb1in -> evalsipmamergesort2bb1in : A'=4*A, B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=-4*A*k_3+C, L'=0, M'=-4*A*k_3+C, N'=0, O'=0, P'=0, Q_1'=4*A, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 && 2*A>=1-4*A*k_3+C ], cost: 53+10*k_1+2*A*k_3+2*C+5*k_1*A+5*A+10*k_3 669.01/291.72 669.01/291.72 422: evalsipmamergesort2bb1in -> evalsipmamergesort2bb1in : A'=4*A, B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=-4*A*k_3+C, L'=-4*A*k_3+C-4*A, M'=0, N'=2*A, O'=0, P'=0, Q_1'=4*A, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 && -4*A*k_3+C>=2*A && -4*A*k_3+C>=4*A && 0>=-4*A*k_3+C-4*A ], cost: 53+10*k_1+10*A*k_3+5*k_1*A+15*A+10*k_3 669.01/291.72 669.01/291.72 423: evalsipmamergesort2bb1in -> evalsipmamergesort2bb1in : A'=4*A, B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=-4*A*k_3+C, L'=-4*A*k_3+C-4*A, M'=2*A, N'=0, O'=0, P'=0, Q_1'=4*A, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 && -4*A*k_3+C>=2*A && -4*A*k_3+C>=4*A && 0>=-4*A*k_3+C-4*A ], cost: 53+10*k_1+10*A*k_3+5*k_1*A+15*A+10*k_3 669.01/291.72 669.01/291.72 424: evalsipmamergesort2bb1in -> evalsipmamergesort2bb1in : A'=4*A, B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=-4*A*k_3+C, L'=0, M'=2*A, N'=0, O'=0, P'=0, Q_1'=4*A, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 && 4*A>=1-4*A*k_3+C && -4*A*k_3+C-2*A>=1 ], cost: 53+10*k_1-2*A*k_3+3*C+5*k_1*A+3*A+10*k_3 669.01/291.72 669.01/291.72 425: evalsipmamergesort2bb1in -> [105] : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=-4*A*k_3+C, L'=-4*A*k_3+C, M'=2*A, N'=0, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 && 2*A>=1-4*A*k_3+C ], cost: 41+10*k_1+2*A*k_3+2*C+5*k_1*A+5*A+10*k_3 669.01/291.72 669.01/291.72 426: evalsipmamergesort2bb1in -> [105] : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=-4*A*k_3+C, L'=-4*A*k_3+C, M'=2*A, N'=0, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 && 4*A>=1-4*A*k_3+C && -4*A*k_3+C-2*A>=1 ], cost: 41+10*k_1-2*A*k_3+3*C+5*k_1*A-A+10*k_3 669.01/291.72 669.01/291.72 427: evalsipmamergesort2bb1in -> [105] : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=-4*A*k_3+C, L'=-4*A*k_3+C, M'=2*A, N'=0, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 && 4*A>=1-4*A*k_3+C && -4*A*k_3+C-2*A>=1 ], cost: 41+10*k_1-2*A*k_3+3*C+5*k_1*A+3*A+10*k_3 669.01/291.72 669.01/291.72 428: evalsipmamergesort2bb1in -> [109] : [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && -C+2*A+2*k*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 ], cost: 38+10*k+5*A+10*k_2+10*A*k_2+5*k*A 669.01/291.72 669.01/291.72 429: evalsipmamergesort2bb1in -> [109] : [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 ], cost: 38+10*k_1+5*k_1*A+5*A+10*k_2+10*A*k_2 669.01/291.72 669.01/291.72 430: evalsipmamergesort2bb1in -> [109] : [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && 2*A>=1+C-2*k_1*A && C-2*k_1*A-A>=1 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 ], cost: 38+10*k_1+3*C-k_1*A-A+10*k_2+10*A*k_2 669.01/291.72 669.01/291.72 431: evalsipmamergesort2bb1in -> [109] : [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && A>=1+C-2*k_1*A && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 ], cost: 38+10*k_1+10*A*k_3+2*C+k_1*A+10*k_3 669.01/291.72 669.01/291.72 432: evalsipmamergesort2bb1in -> [109] : [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 ], cost: 38+10*k_1+10*A*k_3+5*k_1*A+5*A+10*k_3 669.01/291.72 669.01/291.72 433: evalsipmamergesort2bb1in -> evalsipmamergesort2bb26in : B'=C, D'=0, E'=C, F'=0, G'=0, H'=0, Q'=2*A, J'=0, R'=1+C, [ A>=1+C && A>=1 && C>=1 && 2*A>=C ], cost: 17+4*C 669.01/291.72 669.01/291.72 434: evalsipmamergesort2bb1in -> evalsipmamergesort2bb26in : B'=C, D'=C-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, J'=0, R'=1+C, [ C>=A && C>=2*A && A>=1 && 0>=C-2*A && C>=1 ], cost: 17+2*C+5*A 669.01/291.72 669.01/291.72 435: evalsipmamergesort2bb1in -> evalsipmamergesort2bb26in : B'=C, D'=C-2*A, E'=A, F'=0, G'=0, H'=0, Q'=2*A, J'=0, R'=1+C, [ C>=A && C>=2*A && A>=1 && 0>=C-2*A && C>=1 ], cost: 17+2*C+5*A 669.01/291.72 669.01/291.72 436: evalsipmamergesort2bb1in -> evalsipmamergesort2bb26in : B'=C, D'=0, E'=A, F'=0, G'=0, H'=0, Q'=2*A, J'=0, R'=1+C, [ 2*A>=1+C && A>=1 && C-A>=1 && C>=1 ], cost: 17+5*C-A 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 Applied pruning (of leafs and parallel rules): 669.01/291.72 669.01/291.72 Start location: evalsipmamergesort2start 669.01/291.72 669.01/291.72 138: evalsipmamergesort2start -> evalsipmamergesort2bb1in : A'=1, [], cost: 25 669.01/291.72 669.01/291.72 314: evalsipmamergesort2bb1in -> [98] : B'=C, D'=C-2*A, E'=0, F'=A, [ C>=A && C>=2*A && A>=1 ], cost: 3+5*A 669.01/291.72 669.01/291.72 315: evalsipmamergesort2bb1in -> [98] : B'=C, D'=0, E'=0, F'=C-A, [ 2*A>=1+C && A>=1 && C-A>=1 ], cost: 3+2*C+A 669.01/291.72 669.01/291.72 316: evalsipmamergesort2bb1in -> [102] : B'=C, [ 2*A>=1+C && A>=1 && C-A>=1 ], cost: 2+3*A 669.01/291.72 669.01/291.72 317: evalsipmamergesort2bb1in -> [102] : B'=C, [ C>=A && C>=2*A && A>=1 ], cost: 2+3*A 669.01/291.72 669.01/291.72 318: evalsipmamergesort2bb1in -> [102] : B'=C, [ 2*A>=1+C && A>=1 && C-A>=1 ], cost: 2+3*C-3*A 669.01/291.72 669.01/291.72 323: evalsipmamergesort2bb1in -> [104] : B'=C, [ A>=1+C && A>=1 && C>=1 ], cost: 4+2*C 669.01/291.72 669.01/291.72 324: evalsipmamergesort2bb1in -> [104] : B'=C, [ 2*A>=1+C && A>=1 && C-A>=1 ], cost: 4+3*C-3*A 669.01/291.72 669.01/291.72 325: evalsipmamergesort2bb1in -> [104] : B'=C, [ 2*A>=1+C && A>=1 && C-A>=1 ], cost: 4+3*C-A 669.01/291.72 669.01/291.72 326: evalsipmamergesort2bb1in -> [98] : B'=C-2*k*A, D'=C-2*A-2*k*A, E'=0, F'=A, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && C-2*k*A>=2*A ], cost: 3+10*k+5*A+5*k*A 669.01/291.72 669.01/291.72 327: evalsipmamergesort2bb1in -> [98] : B'=C-2*k*A, D'=0, E'=0, F'=C-A-2*k*A, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && 2*A>=1+C-2*k*A && C-A-2*k*A>=1 ], cost: 3+10*k+2*C+A+k*A 669.01/291.72 669.01/291.72 328: evalsipmamergesort2bb1in -> [102] : B'=C-2*k*A, D'=C-2*k*A, E'=0, F'=A, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && 2*A>=1+C-2*k*A && C-A-2*k*A>=1 ], cost: 2+10*k+3*A+5*k*A 669.01/291.72 669.01/291.72 335: evalsipmamergesort2bb1in -> [104] : B'=C-2*k*A, D'=C-2*k*A, E'=0, F'=A, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && A>=1+C-2*k*A ], cost: 4+10*k+2*C+k*A 669.01/291.72 669.01/291.72 346: evalsipmamergesort2bb1in -> [98] : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && C-2*k_1*A>=2*A ], cost: 3+10*k_1+5*k_1*A+5*A 669.01/291.72 669.01/291.72 349: evalsipmamergesort2bb1in -> [102] : B'=C-2*k_1*A, D'=C-2*k_1*A, E'=A, F'=0, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && C-2*k_1*A>=2*A ], cost: 2+10*k_1+5*k_1*A+3*A 669.01/291.72 669.01/291.72 355: evalsipmamergesort2bb1in -> [104] : B'=C-2*k_1*A, D'=C-2*k_1*A, E'=A, F'=0, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && A>=1+C-2*k_1*A ], cost: 4+10*k_1+2*C+k_1*A 669.01/291.72 669.01/291.72 366: evalsipmamergesort2bb1in -> [108] : [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 ], cost: 1+10*k+5*k*A 669.01/291.72 669.01/291.72 367: evalsipmamergesort2bb1in -> [108] : [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 ], cost: 1+10*k_1+5*k_1*A 669.01/291.72 669.01/291.72 369: evalsipmamergesort2bb1in -> [99] : B'=C-2*k*A, D'=C-2*A-2*k*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=0, M'=0, N'=C-2*A-4*A*k_2, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && -C+2*A+2*k*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 4*A>=1+C-4*A*k_2 && C-2*A-4*A*k_2>=1 ], cost: 40+10*k+2*C+7*A+10*k_2+2*A*k_2+5*k*A 669.01/291.72 669.01/291.72 371: evalsipmamergesort2bb1in -> [103] : B'=C-2*k*A, D'=C-2*A-2*k*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && -C+2*A+2*k*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && C-4*A*k_2>=2*A && C-4*A*k_2>=4*A ], cost: 39+10*k+11*A+10*k_2+10*A*k_2+5*k*A 669.01/291.72 669.01/291.72 374: evalsipmamergesort2bb1in -> evalsipmamergesort2bb1in : A'=4*A, B'=C-2*k*A, D'=C-2*A-2*k*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, Q_1'=4*A, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && -C+2*A+2*k*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && C-4*A*k_2>=2*A && C-4*A*k_2>=4*A && 0>=C-4*A-4*A*k_2 ], cost: 53+10*k+15*A+10*k_2+10*A*k_2+5*k*A 669.01/291.72 669.01/291.72 375: evalsipmamergesort2bb1in -> evalsipmamergesort2bb1in : A'=4*A, B'=C-2*k*A, D'=C-2*A-2*k*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A-4*A*k_2, M'=2*A, N'=0, O'=0, P'=0, Q_1'=4*A, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && -C+2*A+2*k*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && C-4*A*k_2>=2*A && C-4*A*k_2>=4*A && 0>=C-4*A-4*A*k_2 ], cost: 53+10*k+15*A+10*k_2+10*A*k_2+5*k*A 669.01/291.72 669.01/291.72 376: evalsipmamergesort2bb1in -> evalsipmamergesort2bb1in : A'=4*A, B'=C-2*k*A, D'=C-2*A-2*k*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=0, M'=2*A, N'=0, O'=0, P'=0, Q_1'=4*A, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && -C+2*A+2*k*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 4*A>=1+C-4*A*k_2 && C-2*A-4*A*k_2>=1 ], cost: 53+10*k+3*C+3*A+10*k_2-2*A*k_2+5*k*A 669.01/291.72 669.01/291.72 377: evalsipmamergesort2bb1in -> [105] : B'=C-2*k*A, D'=C-2*A-2*k*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && -C+2*A+2*k*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 2*A>=1+C-4*A*k_2 ], cost: 41+10*k+2*C+5*A+10*k_2+2*A*k_2+5*k*A 669.01/291.72 669.01/291.72 378: evalsipmamergesort2bb1in -> [105] : B'=C-2*k*A, D'=C-2*A-2*k*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && -C+2*A+2*k*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 4*A>=1+C-4*A*k_2 && C-2*A-4*A*k_2>=1 ], cost: 41+10*k+3*C-A+10*k_2-2*A*k_2+5*k*A 669.01/291.72 669.01/291.72 380: evalsipmamergesort2bb1in -> [99] : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && C-4*A*k_2>=2*A && C-4*A*k_2>=4*A ], cost: 40+10*k_1+5*k_1*A+15*A+10*k_2+10*A*k_2 669.01/291.72 669.01/291.72 381: evalsipmamergesort2bb1in -> [99] : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=0, M'=0, N'=C-2*A-4*A*k_2, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 4*A>=1+C-4*A*k_2 && C-2*A-4*A*k_2>=1 ], cost: 40+10*k_1+2*C+5*k_1*A+7*A+10*k_2+2*A*k_2 669.01/291.72 669.01/291.72 382: evalsipmamergesort2bb1in -> [103] : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 4*A>=1+C-4*A*k_2 && C-2*A-4*A*k_2>=1 ], cost: 39+10*k_1+5*k_1*A+11*A+10*k_2+10*A*k_2 669.01/291.72 669.01/291.72 383: evalsipmamergesort2bb1in -> [103] : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && C-4*A*k_2>=2*A && C-4*A*k_2>=4*A ], cost: 39+10*k_1+5*k_1*A+11*A+10*k_2+10*A*k_2 669.01/291.72 669.01/291.72 387: evalsipmamergesort2bb1in -> evalsipmamergesort2bb1in : A'=4*A, B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A-4*A*k_2, M'=2*A, N'=0, O'=0, P'=0, Q_1'=4*A, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && C-4*A*k_2>=2*A && C-4*A*k_2>=4*A && 0>=C-4*A-4*A*k_2 ], cost: 53+10*k_1+5*k_1*A+15*A+10*k_2+10*A*k_2 669.01/291.72 669.01/291.72 388: evalsipmamergesort2bb1in -> evalsipmamergesort2bb1in : A'=4*A, B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=0, M'=2*A, N'=0, O'=0, P'=0, Q_1'=4*A, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 4*A>=1+C-4*A*k_2 && C-2*A-4*A*k_2>=1 ], cost: 53+10*k_1+3*C+5*k_1*A+3*A+10*k_2-2*A*k_2 669.01/291.72 669.01/291.72 389: evalsipmamergesort2bb1in -> [105] : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 2*A>=1+C-4*A*k_2 ], cost: 41+10*k_1+2*C+5*k_1*A+5*A+10*k_2+2*A*k_2 669.01/291.72 669.01/291.72 392: evalsipmamergesort2bb1in -> [99] : B'=C-2*k_1*A, D'=0, E'=A, F'=0, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && 2*A>=1+C-2*k_1*A && C-2*k_1*A-A>=1 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && C-4*A*k_2>=2*A && C-4*A*k_2>=4*A ], cost: 40+10*k_1+3*C-k_1*A+9*A+10*k_2+10*A*k_2 669.01/291.72 669.01/291.72 396: evalsipmamergesort2bb1in -> [103] : B'=C-2*k_1*A, D'=0, E'=A, F'=0, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && 2*A>=1+C-2*k_1*A && C-2*k_1*A-A>=1 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 4*A>=1+C-4*A*k_2 && C-2*A-4*A*k_2>=1 ], cost: 39+10*k_1+6*C-k_1*A-7*A+10*k_2-2*A*k_2 669.01/291.72 669.01/291.72 402: evalsipmamergesort2bb1in -> [105] : B'=C-2*k_1*A, D'=0, E'=A, F'=0, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && 2*A>=1+C-2*k_1*A && C-2*k_1*A-A>=1 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 4*A>=1+C-4*A*k_2 && C-2*A-4*A*k_2>=1 ], cost: 41+10*k_1+6*C-k_1*A-7*A+10*k_2-2*A*k_2 669.01/291.72 669.01/291.72 403: evalsipmamergesort2bb1in -> [105] : B'=C-2*k_1*A, D'=0, E'=A, F'=0, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && 2*A>=1+C-2*k_1*A && C-2*k_1*A-A>=1 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 4*A>=1+C-4*A*k_2 && C-2*A-4*A*k_2>=1 ], cost: 41+10*k_1+6*C-k_1*A-3*A+10*k_2-2*A*k_2 669.01/291.72 669.01/291.72 416: evalsipmamergesort2bb1in -> [99] : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=-4*A*k_3+C, L'=-4*A*k_3+C-4*A, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 && -4*A*k_3+C>=2*A && -4*A*k_3+C>=4*A ], cost: 40+10*k_1+10*A*k_3+5*k_1*A+15*A+10*k_3 669.01/291.72 669.01/291.72 419: evalsipmamergesort2bb1in -> [103] : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=-4*A*k_3+C, L'=-4*A*k_3+C, M'=2*A, N'=0, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 && -4*A*k_3+C>=2*A && -4*A*k_3+C>=4*A ], cost: 39+10*k_1+10*A*k_3+5*k_1*A+11*A+10*k_3 669.01/291.72 669.01/291.72 428: evalsipmamergesort2bb1in -> [109] : [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && -C+2*A+2*k*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 ], cost: 38+10*k+5*A+10*k_2+10*A*k_2+5*k*A 669.01/291.72 669.01/291.72 429: evalsipmamergesort2bb1in -> [109] : [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 ], cost: 38+10*k_1+5*k_1*A+5*A+10*k_2+10*A*k_2 669.01/291.72 669.01/291.72 430: evalsipmamergesort2bb1in -> [109] : [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && 2*A>=1+C-2*k_1*A && C-2*k_1*A-A>=1 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 ], cost: 38+10*k_1+3*C-k_1*A-A+10*k_2+10*A*k_2 669.01/291.72 669.01/291.72 431: evalsipmamergesort2bb1in -> [109] : [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && A>=1+C-2*k_1*A && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 ], cost: 38+10*k_1+10*A*k_3+2*C+k_1*A+10*k_3 669.01/291.72 669.01/291.72 432: evalsipmamergesort2bb1in -> [109] : [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 ], cost: 38+10*k_1+10*A*k_3+5*k_1*A+5*A+10*k_3 669.01/291.72 669.01/291.72 433: evalsipmamergesort2bb1in -> evalsipmamergesort2bb26in : B'=C, D'=0, E'=C, F'=0, G'=0, H'=0, Q'=2*A, J'=0, R'=1+C, [ A>=1+C && A>=1 && C>=1 && 2*A>=C ], cost: 17+4*C 669.01/291.72 669.01/291.72 434: evalsipmamergesort2bb1in -> evalsipmamergesort2bb26in : B'=C, D'=C-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, J'=0, R'=1+C, [ C>=A && C>=2*A && A>=1 && 0>=C-2*A && C>=1 ], cost: 17+2*C+5*A 669.01/291.72 669.01/291.72 435: evalsipmamergesort2bb1in -> evalsipmamergesort2bb26in : B'=C, D'=C-2*A, E'=A, F'=0, G'=0, H'=0, Q'=2*A, J'=0, R'=1+C, [ C>=A && C>=2*A && A>=1 && 0>=C-2*A && C>=1 ], cost: 17+2*C+5*A 669.01/291.72 669.01/291.72 436: evalsipmamergesort2bb1in -> evalsipmamergesort2bb26in : B'=C, D'=0, E'=A, F'=0, G'=0, H'=0, Q'=2*A, J'=0, R'=1+C, [ 2*A>=1+C && A>=1 && C-A>=1 && C>=1 ], cost: 17+5*C-A 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 Accelerating simple loops of location 25. 669.01/291.72 669.01/291.72 Simplified some of the simple loops (and removed duplicate rules). 669.01/291.72 669.01/291.72 Accelerating the following rules: 669.01/291.72 669.01/291.72 374: evalsipmamergesort2bb1in -> evalsipmamergesort2bb1in : A'=4*A, B'=C-2*k*A, D'=C-2*A-2*k*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, Q_1'=4*A, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && -C+2*A+2*k*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && C-4*A*k_2>=2*A && -C+4*A+4*A*k_2==0 ], cost: 53+10*k+15*A+10*k_2+10*A*k_2+5*k*A 669.01/291.72 669.01/291.72 375: evalsipmamergesort2bb1in -> evalsipmamergesort2bb1in : A'=4*A, B'=C-2*k*A, D'=C-2*A-2*k*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A-4*A*k_2, M'=2*A, N'=0, O'=0, P'=0, Q_1'=4*A, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && -C+2*A+2*k*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && C-4*A*k_2>=2*A && -C+4*A+4*A*k_2==0 ], cost: 53+10*k+15*A+10*k_2+10*A*k_2+5*k*A 669.01/291.72 669.01/291.72 376: evalsipmamergesort2bb1in -> evalsipmamergesort2bb1in : A'=4*A, B'=C-2*k*A, D'=C-2*A-2*k*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=0, M'=2*A, N'=0, O'=0, P'=0, Q_1'=4*A, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && -C+2*A+2*k*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 4*A>=1+C-4*A*k_2 && C-2*A-4*A*k_2>=1 ], cost: 53+10*k+3*C+3*A+10*k_2-2*A*k_2+5*k*A 669.01/291.72 669.01/291.72 387: evalsipmamergesort2bb1in -> evalsipmamergesort2bb1in : A'=4*A, B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A-4*A*k_2, M'=2*A, N'=0, O'=0, P'=0, Q_1'=4*A, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && C-4*A*k_2>=2*A && -C+4*A+4*A*k_2==0 ], cost: 53+10*k_1+5*k_1*A+15*A+10*k_2+10*A*k_2 669.01/291.72 669.01/291.72 388: evalsipmamergesort2bb1in -> evalsipmamergesort2bb1in : A'=4*A, B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=0, M'=2*A, N'=0, O'=0, P'=0, Q_1'=4*A, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 4*A>=1+C-4*A*k_2 && C-2*A-4*A*k_2>=1 ], cost: 53+10*k_1+3*C+5*k_1*A+3*A+10*k_2-2*A*k_2 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 Found no metering function for rule 374 (rule is too complicated). 669.01/291.72 669.01/291.72 Found no metering function for rule 375 (rule is too complicated). 669.01/291.72 669.01/291.72 Found no metering function for rule 376 (rule is too complicated). 669.01/291.72 669.01/291.72 Found no metering function for rule 387 (rule is too complicated). 669.01/291.72 669.01/291.72 Found no metering function for rule 388 (rule is too complicated). 669.01/291.72 669.01/291.72 Removing the simple loops:. 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 Accelerated all simple loops using metering functions (where possible): 669.01/291.72 669.01/291.72 Start location: evalsipmamergesort2start 669.01/291.72 669.01/291.72 138: evalsipmamergesort2start -> evalsipmamergesort2bb1in : A'=1, [], cost: 25 669.01/291.72 669.01/291.72 314: evalsipmamergesort2bb1in -> [98] : B'=C, D'=C-2*A, E'=0, F'=A, [ C>=A && C>=2*A && A>=1 ], cost: 3+5*A 669.01/291.72 669.01/291.72 315: evalsipmamergesort2bb1in -> [98] : B'=C, D'=0, E'=0, F'=C-A, [ 2*A>=1+C && A>=1 && C-A>=1 ], cost: 3+2*C+A 669.01/291.72 669.01/291.72 316: evalsipmamergesort2bb1in -> [102] : B'=C, [ 2*A>=1+C && A>=1 && C-A>=1 ], cost: 2+3*A 669.01/291.72 669.01/291.72 317: evalsipmamergesort2bb1in -> [102] : B'=C, [ C>=A && C>=2*A && A>=1 ], cost: 2+3*A 669.01/291.72 669.01/291.72 318: evalsipmamergesort2bb1in -> [102] : B'=C, [ 2*A>=1+C && A>=1 && C-A>=1 ], cost: 2+3*C-3*A 669.01/291.72 669.01/291.72 323: evalsipmamergesort2bb1in -> [104] : B'=C, [ A>=1+C && A>=1 && C>=1 ], cost: 4+2*C 669.01/291.72 669.01/291.72 324: evalsipmamergesort2bb1in -> [104] : B'=C, [ 2*A>=1+C && A>=1 && C-A>=1 ], cost: 4+3*C-3*A 669.01/291.72 669.01/291.72 325: evalsipmamergesort2bb1in -> [104] : B'=C, [ 2*A>=1+C && A>=1 && C-A>=1 ], cost: 4+3*C-A 669.01/291.72 669.01/291.72 326: evalsipmamergesort2bb1in -> [98] : B'=C-2*k*A, D'=C-2*A-2*k*A, E'=0, F'=A, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && C-2*k*A>=2*A ], cost: 3+10*k+5*A+5*k*A 669.01/291.72 669.01/291.72 327: evalsipmamergesort2bb1in -> [98] : B'=C-2*k*A, D'=0, E'=0, F'=C-A-2*k*A, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && 2*A>=1+C-2*k*A && C-A-2*k*A>=1 ], cost: 3+10*k+2*C+A+k*A 669.01/291.72 669.01/291.72 328: evalsipmamergesort2bb1in -> [102] : B'=C-2*k*A, D'=C-2*k*A, E'=0, F'=A, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && 2*A>=1+C-2*k*A && C-A-2*k*A>=1 ], cost: 2+10*k+3*A+5*k*A 669.01/291.72 669.01/291.72 335: evalsipmamergesort2bb1in -> [104] : B'=C-2*k*A, D'=C-2*k*A, E'=0, F'=A, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && A>=1+C-2*k*A ], cost: 4+10*k+2*C+k*A 669.01/291.72 669.01/291.72 346: evalsipmamergesort2bb1in -> [98] : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && C-2*k_1*A>=2*A ], cost: 3+10*k_1+5*k_1*A+5*A 669.01/291.72 669.01/291.72 349: evalsipmamergesort2bb1in -> [102] : B'=C-2*k_1*A, D'=C-2*k_1*A, E'=A, F'=0, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && C-2*k_1*A>=2*A ], cost: 2+10*k_1+5*k_1*A+3*A 669.01/291.72 669.01/291.72 355: evalsipmamergesort2bb1in -> [104] : B'=C-2*k_1*A, D'=C-2*k_1*A, E'=A, F'=0, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && A>=1+C-2*k_1*A ], cost: 4+10*k_1+2*C+k_1*A 669.01/291.72 669.01/291.72 366: evalsipmamergesort2bb1in -> [108] : [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 ], cost: 1+10*k+5*k*A 669.01/291.72 669.01/291.72 367: evalsipmamergesort2bb1in -> [108] : [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 ], cost: 1+10*k_1+5*k_1*A 669.01/291.72 669.01/291.72 369: evalsipmamergesort2bb1in -> [99] : B'=C-2*k*A, D'=C-2*A-2*k*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=0, M'=0, N'=C-2*A-4*A*k_2, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && -C+2*A+2*k*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 4*A>=1+C-4*A*k_2 && C-2*A-4*A*k_2>=1 ], cost: 40+10*k+2*C+7*A+10*k_2+2*A*k_2+5*k*A 669.01/291.72 669.01/291.72 371: evalsipmamergesort2bb1in -> [103] : B'=C-2*k*A, D'=C-2*A-2*k*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && -C+2*A+2*k*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && C-4*A*k_2>=2*A && C-4*A*k_2>=4*A ], cost: 39+10*k+11*A+10*k_2+10*A*k_2+5*k*A 669.01/291.72 669.01/291.72 374: evalsipmamergesort2bb1in -> evalsipmamergesort2bb1in : A'=4*A, B'=C-2*k*A, D'=C-2*A-2*k*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, Q_1'=4*A, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && -C+2*A+2*k*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && C-4*A*k_2>=2*A && -C+4*A+4*A*k_2==0 ], cost: 53+10*k+15*A+10*k_2+10*A*k_2+5*k*A 669.01/291.72 669.01/291.72 375: evalsipmamergesort2bb1in -> evalsipmamergesort2bb1in : A'=4*A, B'=C-2*k*A, D'=C-2*A-2*k*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A-4*A*k_2, M'=2*A, N'=0, O'=0, P'=0, Q_1'=4*A, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && -C+2*A+2*k*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && C-4*A*k_2>=2*A && -C+4*A+4*A*k_2==0 ], cost: 53+10*k+15*A+10*k_2+10*A*k_2+5*k*A 669.01/291.72 669.01/291.72 376: evalsipmamergesort2bb1in -> evalsipmamergesort2bb1in : A'=4*A, B'=C-2*k*A, D'=C-2*A-2*k*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=0, M'=2*A, N'=0, O'=0, P'=0, Q_1'=4*A, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && -C+2*A+2*k*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 4*A>=1+C-4*A*k_2 && C-2*A-4*A*k_2>=1 ], cost: 53+10*k+3*C+3*A+10*k_2-2*A*k_2+5*k*A 669.01/291.72 669.01/291.72 377: evalsipmamergesort2bb1in -> [105] : B'=C-2*k*A, D'=C-2*A-2*k*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && -C+2*A+2*k*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 2*A>=1+C-4*A*k_2 ], cost: 41+10*k+2*C+5*A+10*k_2+2*A*k_2+5*k*A 669.01/291.72 669.01/291.72 378: evalsipmamergesort2bb1in -> [105] : B'=C-2*k*A, D'=C-2*A-2*k*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && -C+2*A+2*k*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 4*A>=1+C-4*A*k_2 && C-2*A-4*A*k_2>=1 ], cost: 41+10*k+3*C-A+10*k_2-2*A*k_2+5*k*A 669.01/291.72 669.01/291.72 380: evalsipmamergesort2bb1in -> [99] : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && C-4*A*k_2>=2*A && C-4*A*k_2>=4*A ], cost: 40+10*k_1+5*k_1*A+15*A+10*k_2+10*A*k_2 669.01/291.72 669.01/291.72 381: evalsipmamergesort2bb1in -> [99] : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=0, M'=0, N'=C-2*A-4*A*k_2, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 4*A>=1+C-4*A*k_2 && C-2*A-4*A*k_2>=1 ], cost: 40+10*k_1+2*C+5*k_1*A+7*A+10*k_2+2*A*k_2 669.01/291.72 669.01/291.72 382: evalsipmamergesort2bb1in -> [103] : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 4*A>=1+C-4*A*k_2 && C-2*A-4*A*k_2>=1 ], cost: 39+10*k_1+5*k_1*A+11*A+10*k_2+10*A*k_2 669.01/291.72 669.01/291.72 383: evalsipmamergesort2bb1in -> [103] : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && C-4*A*k_2>=2*A && C-4*A*k_2>=4*A ], cost: 39+10*k_1+5*k_1*A+11*A+10*k_2+10*A*k_2 669.01/291.72 669.01/291.72 387: evalsipmamergesort2bb1in -> evalsipmamergesort2bb1in : A'=4*A, B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A-4*A*k_2, M'=2*A, N'=0, O'=0, P'=0, Q_1'=4*A, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && C-4*A*k_2>=2*A && -C+4*A+4*A*k_2==0 ], cost: 53+10*k_1+5*k_1*A+15*A+10*k_2+10*A*k_2 669.01/291.72 669.01/291.72 388: evalsipmamergesort2bb1in -> evalsipmamergesort2bb1in : A'=4*A, B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=0, M'=2*A, N'=0, O'=0, P'=0, Q_1'=4*A, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 4*A>=1+C-4*A*k_2 && C-2*A-4*A*k_2>=1 ], cost: 53+10*k_1+3*C+5*k_1*A+3*A+10*k_2-2*A*k_2 669.01/291.72 669.01/291.72 389: evalsipmamergesort2bb1in -> [105] : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 2*A>=1+C-4*A*k_2 ], cost: 41+10*k_1+2*C+5*k_1*A+5*A+10*k_2+2*A*k_2 669.01/291.72 669.01/291.72 392: evalsipmamergesort2bb1in -> [99] : B'=C-2*k_1*A, D'=0, E'=A, F'=0, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && 2*A>=1+C-2*k_1*A && C-2*k_1*A-A>=1 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && C-4*A*k_2>=2*A && C-4*A*k_2>=4*A ], cost: 40+10*k_1+3*C-k_1*A+9*A+10*k_2+10*A*k_2 669.01/291.72 669.01/291.72 396: evalsipmamergesort2bb1in -> [103] : B'=C-2*k_1*A, D'=0, E'=A, F'=0, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && 2*A>=1+C-2*k_1*A && C-2*k_1*A-A>=1 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 4*A>=1+C-4*A*k_2 && C-2*A-4*A*k_2>=1 ], cost: 39+10*k_1+6*C-k_1*A-7*A+10*k_2-2*A*k_2 669.01/291.72 669.01/291.72 402: evalsipmamergesort2bb1in -> [105] : B'=C-2*k_1*A, D'=0, E'=A, F'=0, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && 2*A>=1+C-2*k_1*A && C-2*k_1*A-A>=1 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 4*A>=1+C-4*A*k_2 && C-2*A-4*A*k_2>=1 ], cost: 41+10*k_1+6*C-k_1*A-7*A+10*k_2-2*A*k_2 669.01/291.72 669.01/291.72 403: evalsipmamergesort2bb1in -> [105] : B'=C-2*k_1*A, D'=0, E'=A, F'=0, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && 2*A>=1+C-2*k_1*A && C-2*k_1*A-A>=1 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 4*A>=1+C-4*A*k_2 && C-2*A-4*A*k_2>=1 ], cost: 41+10*k_1+6*C-k_1*A-3*A+10*k_2-2*A*k_2 669.01/291.72 669.01/291.72 416: evalsipmamergesort2bb1in -> [99] : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=-4*A*k_3+C, L'=-4*A*k_3+C-4*A, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 && -4*A*k_3+C>=2*A && -4*A*k_3+C>=4*A ], cost: 40+10*k_1+10*A*k_3+5*k_1*A+15*A+10*k_3 669.01/291.72 669.01/291.72 419: evalsipmamergesort2bb1in -> [103] : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=-4*A*k_3+C, L'=-4*A*k_3+C, M'=2*A, N'=0, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 && -4*A*k_3+C>=2*A && -4*A*k_3+C>=4*A ], cost: 39+10*k_1+10*A*k_3+5*k_1*A+11*A+10*k_3 669.01/291.72 669.01/291.72 428: evalsipmamergesort2bb1in -> [109] : [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && -C+2*A+2*k*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 ], cost: 38+10*k+5*A+10*k_2+10*A*k_2+5*k*A 669.01/291.72 669.01/291.72 429: evalsipmamergesort2bb1in -> [109] : [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 ], cost: 38+10*k_1+5*k_1*A+5*A+10*k_2+10*A*k_2 669.01/291.72 669.01/291.72 430: evalsipmamergesort2bb1in -> [109] : [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && 2*A>=1+C-2*k_1*A && C-2*k_1*A-A>=1 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 ], cost: 38+10*k_1+3*C-k_1*A-A+10*k_2+10*A*k_2 669.01/291.72 669.01/291.72 431: evalsipmamergesort2bb1in -> [109] : [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && A>=1+C-2*k_1*A && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 ], cost: 38+10*k_1+10*A*k_3+2*C+k_1*A+10*k_3 669.01/291.72 669.01/291.72 432: evalsipmamergesort2bb1in -> [109] : [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 ], cost: 38+10*k_1+10*A*k_3+5*k_1*A+5*A+10*k_3 669.01/291.72 669.01/291.72 433: evalsipmamergesort2bb1in -> evalsipmamergesort2bb26in : B'=C, D'=0, E'=C, F'=0, G'=0, H'=0, Q'=2*A, J'=0, R'=1+C, [ A>=1+C && A>=1 && C>=1 && 2*A>=C ], cost: 17+4*C 669.01/291.72 669.01/291.72 434: evalsipmamergesort2bb1in -> evalsipmamergesort2bb26in : B'=C, D'=C-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, J'=0, R'=1+C, [ C>=A && C>=2*A && A>=1 && 0>=C-2*A && C>=1 ], cost: 17+2*C+5*A 669.01/291.72 669.01/291.72 435: evalsipmamergesort2bb1in -> evalsipmamergesort2bb26in : B'=C, D'=C-2*A, E'=A, F'=0, G'=0, H'=0, Q'=2*A, J'=0, R'=1+C, [ C>=A && C>=2*A && A>=1 && 0>=C-2*A && C>=1 ], cost: 17+2*C+5*A 669.01/291.72 669.01/291.72 436: evalsipmamergesort2bb1in -> evalsipmamergesort2bb26in : B'=C, D'=0, E'=A, F'=0, G'=0, H'=0, Q'=2*A, J'=0, R'=1+C, [ 2*A>=1+C && A>=1 && C-A>=1 && C>=1 ], cost: 17+5*C-A 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 Chained accelerated rules (with incoming rules): 669.01/291.72 669.01/291.72 Start location: evalsipmamergesort2start 669.01/291.72 669.01/291.72 138: evalsipmamergesort2start -> evalsipmamergesort2bb1in : A'=1, [], cost: 25 669.01/291.72 669.01/291.72 437: evalsipmamergesort2start -> evalsipmamergesort2bb1in : A'=4, B'=-2*k+C, D'=-2-2*k+C, E'=0, F'=1, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=0, N'=2, O'=0, P'=0, Q_1'=4, [ k>0 && 2+2*k-C==0 && -4+C>=1 && k_2>0 && 4-C+4*k_2==0 ], cost: 93+15*k+20*k_2 669.01/291.72 669.01/291.72 438: evalsipmamergesort2start -> evalsipmamergesort2bb1in : A'=4, B'=-2*k+C, D'=-2-2*k+C, E'=0, F'=1, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=2, N'=0, O'=0, P'=0, Q_1'=4, [ k>0 && 2+2*k-C==0 && -4+C>=1 && k_2>0 && 4-C+4*k_2==0 ], cost: 93+15*k+20*k_2 669.01/291.72 669.01/291.72 439: evalsipmamergesort2start -> evalsipmamergesort2bb1in : A'=4, B'=-2*k_1+C, D'=-2-2*k_1+C, E'=0, F'=1, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=2, N'=0, O'=0, P'=0, Q_1'=4, [ k_1>0 && 2+2*k_1-C==0 && -4+C>=1 && k_2>0 && 4-C+4*k_2==0 ], cost: 93+15*k_1+20*k_2 669.01/291.72 669.01/291.72 314: evalsipmamergesort2bb1in -> [98] : B'=C, D'=C-2*A, E'=0, F'=A, [ C>=A && C>=2*A && A>=1 ], cost: 3+5*A 669.01/291.72 669.01/291.72 315: evalsipmamergesort2bb1in -> [98] : B'=C, D'=0, E'=0, F'=C-A, [ 2*A>=1+C && A>=1 && C-A>=1 ], cost: 3+2*C+A 669.01/291.72 669.01/291.72 316: evalsipmamergesort2bb1in -> [102] : B'=C, [ 2*A>=1+C && A>=1 && C-A>=1 ], cost: 2+3*A 669.01/291.72 669.01/291.72 317: evalsipmamergesort2bb1in -> [102] : B'=C, [ C>=A && C>=2*A && A>=1 ], cost: 2+3*A 669.01/291.72 669.01/291.72 318: evalsipmamergesort2bb1in -> [102] : B'=C, [ 2*A>=1+C && A>=1 && C-A>=1 ], cost: 2+3*C-3*A 669.01/291.72 669.01/291.72 323: evalsipmamergesort2bb1in -> [104] : B'=C, [ A>=1+C && A>=1 && C>=1 ], cost: 4+2*C 669.01/291.72 669.01/291.72 324: evalsipmamergesort2bb1in -> [104] : B'=C, [ 2*A>=1+C && A>=1 && C-A>=1 ], cost: 4+3*C-3*A 669.01/291.72 669.01/291.72 325: evalsipmamergesort2bb1in -> [104] : B'=C, [ 2*A>=1+C && A>=1 && C-A>=1 ], cost: 4+3*C-A 669.01/291.72 669.01/291.72 326: evalsipmamergesort2bb1in -> [98] : B'=C-2*k*A, D'=C-2*A-2*k*A, E'=0, F'=A, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && C-2*k*A>=2*A ], cost: 3+10*k+5*A+5*k*A 669.01/291.72 669.01/291.72 327: evalsipmamergesort2bb1in -> [98] : B'=C-2*k*A, D'=0, E'=0, F'=C-A-2*k*A, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && 2*A>=1+C-2*k*A && C-A-2*k*A>=1 ], cost: 3+10*k+2*C+A+k*A 669.01/291.72 669.01/291.72 328: evalsipmamergesort2bb1in -> [102] : B'=C-2*k*A, D'=C-2*k*A, E'=0, F'=A, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && 2*A>=1+C-2*k*A && C-A-2*k*A>=1 ], cost: 2+10*k+3*A+5*k*A 669.01/291.72 669.01/291.72 335: evalsipmamergesort2bb1in -> [104] : B'=C-2*k*A, D'=C-2*k*A, E'=0, F'=A, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && A>=1+C-2*k*A ], cost: 4+10*k+2*C+k*A 669.01/291.72 669.01/291.72 346: evalsipmamergesort2bb1in -> [98] : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && C-2*k_1*A>=2*A ], cost: 3+10*k_1+5*k_1*A+5*A 669.01/291.72 669.01/291.72 349: evalsipmamergesort2bb1in -> [102] : B'=C-2*k_1*A, D'=C-2*k_1*A, E'=A, F'=0, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && C-2*k_1*A>=2*A ], cost: 2+10*k_1+5*k_1*A+3*A 669.01/291.72 669.01/291.72 355: evalsipmamergesort2bb1in -> [104] : B'=C-2*k_1*A, D'=C-2*k_1*A, E'=A, F'=0, G'=0, H'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && A>=1+C-2*k_1*A ], cost: 4+10*k_1+2*C+k_1*A 669.01/291.72 669.01/291.72 366: evalsipmamergesort2bb1in -> [108] : [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 ], cost: 1+10*k+5*k*A 669.01/291.72 669.01/291.72 367: evalsipmamergesort2bb1in -> [108] : [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 ], cost: 1+10*k_1+5*k_1*A 669.01/291.72 669.01/291.72 369: evalsipmamergesort2bb1in -> [99] : B'=C-2*k*A, D'=C-2*A-2*k*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=0, M'=0, N'=C-2*A-4*A*k_2, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && -C+2*A+2*k*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 4*A>=1+C-4*A*k_2 && C-2*A-4*A*k_2>=1 ], cost: 40+10*k+2*C+7*A+10*k_2+2*A*k_2+5*k*A 669.01/291.72 669.01/291.72 371: evalsipmamergesort2bb1in -> [103] : B'=C-2*k*A, D'=C-2*A-2*k*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && -C+2*A+2*k*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && C-4*A*k_2>=2*A && C-4*A*k_2>=4*A ], cost: 39+10*k+11*A+10*k_2+10*A*k_2+5*k*A 669.01/291.72 669.01/291.72 377: evalsipmamergesort2bb1in -> [105] : B'=C-2*k*A, D'=C-2*A-2*k*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && -C+2*A+2*k*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 2*A>=1+C-4*A*k_2 ], cost: 41+10*k+2*C+5*A+10*k_2+2*A*k_2+5*k*A 669.01/291.72 669.01/291.72 378: evalsipmamergesort2bb1in -> [105] : B'=C-2*k*A, D'=C-2*A-2*k*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && -C+2*A+2*k*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 4*A>=1+C-4*A*k_2 && C-2*A-4*A*k_2>=1 ], cost: 41+10*k+3*C-A+10*k_2-2*A*k_2+5*k*A 669.01/291.72 669.01/291.72 380: evalsipmamergesort2bb1in -> [99] : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && C-4*A*k_2>=2*A && C-4*A*k_2>=4*A ], cost: 40+10*k_1+5*k_1*A+15*A+10*k_2+10*A*k_2 669.01/291.72 669.01/291.72 381: evalsipmamergesort2bb1in -> [99] : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=0, M'=0, N'=C-2*A-4*A*k_2, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 4*A>=1+C-4*A*k_2 && C-2*A-4*A*k_2>=1 ], cost: 40+10*k_1+2*C+5*k_1*A+7*A+10*k_2+2*A*k_2 669.01/291.72 669.01/291.72 382: evalsipmamergesort2bb1in -> [103] : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 4*A>=1+C-4*A*k_2 && C-2*A-4*A*k_2>=1 ], cost: 39+10*k_1+5*k_1*A+11*A+10*k_2+10*A*k_2 669.01/291.72 669.01/291.72 383: evalsipmamergesort2bb1in -> [103] : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && C-4*A*k_2>=2*A && C-4*A*k_2>=4*A ], cost: 39+10*k_1+5*k_1*A+11*A+10*k_2+10*A*k_2 669.01/291.72 669.01/291.72 389: evalsipmamergesort2bb1in -> [105] : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 2*A>=1+C-4*A*k_2 ], cost: 41+10*k_1+2*C+5*k_1*A+5*A+10*k_2+2*A*k_2 669.01/291.72 669.01/291.72 392: evalsipmamergesort2bb1in -> [99] : B'=C-2*k_1*A, D'=0, E'=A, F'=0, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && 2*A>=1+C-2*k_1*A && C-2*k_1*A-A>=1 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && C-4*A*k_2>=2*A && C-4*A*k_2>=4*A ], cost: 40+10*k_1+3*C-k_1*A+9*A+10*k_2+10*A*k_2 669.01/291.72 669.01/291.72 396: evalsipmamergesort2bb1in -> [103] : B'=C-2*k_1*A, D'=0, E'=A, F'=0, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && 2*A>=1+C-2*k_1*A && C-2*k_1*A-A>=1 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 4*A>=1+C-4*A*k_2 && C-2*A-4*A*k_2>=1 ], cost: 39+10*k_1+6*C-k_1*A-7*A+10*k_2-2*A*k_2 669.01/291.72 669.01/291.72 402: evalsipmamergesort2bb1in -> [105] : B'=C-2*k_1*A, D'=0, E'=A, F'=0, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && 2*A>=1+C-2*k_1*A && C-2*k_1*A-A>=1 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 4*A>=1+C-4*A*k_2 && C-2*A-4*A*k_2>=1 ], cost: 41+10*k_1+6*C-k_1*A-7*A+10*k_2-2*A*k_2 669.01/291.72 669.01/291.72 403: evalsipmamergesort2bb1in -> [105] : B'=C-2*k_1*A, D'=0, E'=A, F'=0, G'=0, H'=0, Q'=2*A, K'=C-4*A*k_2, L'=C-4*A*k_2, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && 2*A>=1+C-2*k_1*A && C-2*k_1*A-A>=1 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 && 4*A>=1+C-4*A*k_2 && C-2*A-4*A*k_2>=1 ], cost: 41+10*k_1+6*C-k_1*A-3*A+10*k_2-2*A*k_2 669.01/291.72 669.01/291.72 416: evalsipmamergesort2bb1in -> [99] : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=-4*A*k_3+C, L'=-4*A*k_3+C-4*A, M'=0, N'=2*A, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 && -4*A*k_3+C>=2*A && -4*A*k_3+C>=4*A ], cost: 40+10*k_1+10*A*k_3+5*k_1*A+15*A+10*k_3 669.01/291.72 669.01/291.72 419: evalsipmamergesort2bb1in -> [103] : B'=C-2*k_1*A, D'=C-2*k_1*A-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, K'=-4*A*k_3+C, L'=-4*A*k_3+C, M'=2*A, N'=0, O'=0, P'=0, [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 && -4*A*k_3+C>=2*A && -4*A*k_3+C>=4*A ], cost: 39+10*k_1+10*A*k_3+5*k_1*A+11*A+10*k_3 669.01/291.72 669.01/291.72 428: evalsipmamergesort2bb1in -> [109] : [ C>=A && A>=1 && C-2*A>=1 && k>0 && C-2*A*(-1+k)>=A && C-2*A-2*A*(-1+k)>=1 && C-2*k*A>=A && -C+2*A+2*k*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 ], cost: 38+10*k+5*A+10*k_2+10*A*k_2+5*k*A 669.01/291.72 669.01/291.72 429: evalsipmamergesort2bb1in -> [109] : [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 ], cost: 38+10*k_1+5*k_1*A+5*A+10*k_2+10*A*k_2 669.01/291.72 669.01/291.72 430: evalsipmamergesort2bb1in -> [109] : [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && 2*A>=1+C-2*k_1*A && C-2*k_1*A-A>=1 && 2*A>=1 && C-4*A>=1 && k_2>0 && -4*(-1+k_2)*A+C>=2*A && -4*(-1+k_2)*A+C-4*A>=1 ], cost: 38+10*k_1+3*C-k_1*A-A+10*k_2+10*A*k_2 669.01/291.72 669.01/291.72 431: evalsipmamergesort2bb1in -> [109] : [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && A>=1+C-2*k_1*A && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 ], cost: 38+10*k_1+10*A*k_3+2*C+k_1*A+10*k_3 669.01/291.72 669.01/291.72 432: evalsipmamergesort2bb1in -> [109] : [ C>=A && A>=1 && C-2*A>=1 && k_1>0 && C-2*(-1+k_1)*A>=A && C-2*A-2*(-1+k_1)*A>=1 && C-2*k_1*A>=A && -C+2*k_1*A+2*A==0 && 2*A>=1 && C-4*A>=1 && k_3>0 && C-4*(-1+k_3)*A>=2*A && C-4*A-4*(-1+k_3)*A>=1 ], cost: 38+10*k_1+10*A*k_3+5*k_1*A+5*A+10*k_3 669.01/291.72 669.01/291.72 433: evalsipmamergesort2bb1in -> evalsipmamergesort2bb26in : B'=C, D'=0, E'=C, F'=0, G'=0, H'=0, Q'=2*A, J'=0, R'=1+C, [ A>=1+C && A>=1 && C>=1 && 2*A>=C ], cost: 17+4*C 669.01/291.72 669.01/291.72 434: evalsipmamergesort2bb1in -> evalsipmamergesort2bb26in : B'=C, D'=C-2*A, E'=0, F'=A, G'=0, H'=0, Q'=2*A, J'=0, R'=1+C, [ C>=A && C>=2*A && A>=1 && 0>=C-2*A && C>=1 ], cost: 17+2*C+5*A 669.01/291.72 669.01/291.72 435: evalsipmamergesort2bb1in -> evalsipmamergesort2bb26in : B'=C, D'=C-2*A, E'=A, F'=0, G'=0, H'=0, Q'=2*A, J'=0, R'=1+C, [ C>=A && C>=2*A && A>=1 && 0>=C-2*A && C>=1 ], cost: 17+2*C+5*A 669.01/291.72 669.01/291.72 436: evalsipmamergesort2bb1in -> evalsipmamergesort2bb26in : B'=C, D'=0, E'=A, F'=0, G'=0, H'=0, Q'=2*A, J'=0, R'=1+C, [ 2*A>=1+C && A>=1 && C-A>=1 && C>=1 ], cost: 17+5*C-A 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 Eliminated locations (on tree-shaped paths): 669.01/291.72 669.01/291.72 Start location: evalsipmamergesort2start 669.01/291.72 669.01/291.72 440: evalsipmamergesort2start -> [98] : A'=1, B'=C, D'=-2+C, E'=0, F'=1, [ C>=2 ], cost: 33 669.01/291.72 669.01/291.72 441: evalsipmamergesort2start -> [102] : A'=1, B'=C, [ C>=2 ], cost: 30 669.01/291.72 669.01/291.72 442: evalsipmamergesort2start -> [98] : A'=1, B'=-2*k+C, D'=-2-2*k+C, E'=0, F'=1, G'=0, H'=0, [ -2+C>=1 && k>0 && -2*k+C>=2 ], cost: 33+15*k 669.01/291.72 669.01/291.72 443: evalsipmamergesort2start -> [98] : A'=1, B'=-2*k_1+C, D'=-2-2*k_1+C, E'=0, F'=1, G'=0, H'=0, [ -2+C>=1 && k_1>0 && -2*k_1+C>=2 ], cost: 33+15*k_1 669.01/291.72 669.01/291.72 444: evalsipmamergesort2start -> [102] : A'=1, B'=-2*k_1+C, D'=-2*k_1+C, E'=1, F'=0, G'=0, H'=0, [ -2+C>=1 && k_1>0 && -2*k_1+C>=2 ], cost: 30+15*k_1 669.01/291.72 669.01/291.72 445: evalsipmamergesort2start -> [108] : A'=1, [ -2+C>=1 && k>0 && -2*k+C>=1 ], cost: 26+15*k 669.01/291.72 669.01/291.72 446: evalsipmamergesort2start -> [108] : A'=1, [ -2+C>=1 && k_1>0 && -2*k_1+C>=1 ], cost: 26+15*k_1 669.01/291.72 669.01/291.72 447: evalsipmamergesort2start -> [103] : A'=1, B'=-2*k+C, D'=-2-2*k+C, E'=0, F'=1, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=C-4*k_2, M'=0, N'=2, O'=0, P'=0, [ k>0 && 2+2*k-C==0 && -4+C>=1 && k_2>0 && C-4*k_2>=4 ], cost: 75+15*k+20*k_2 669.01/291.72 669.01/291.72 448: evalsipmamergesort2start -> [99] : A'=1, B'=-2*k_1+C, D'=-2-2*k_1+C, E'=0, F'=1, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=0, N'=2, O'=0, P'=0, [ k_1>0 && 2+2*k_1-C==0 && -4+C>=1 && k_2>0 && C-4*k_2>=4 ], cost: 80+15*k_1+20*k_2 669.01/291.72 669.01/291.72 449: evalsipmamergesort2start -> [103] : A'=1, B'=-2*k_1+C, D'=-2-2*k_1+C, E'=0, F'=1, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=C-4*k_2, M'=0, N'=2, O'=0, P'=0, [ k_1>0 && 2+2*k_1-C==0 && -4+C>=1 && k_2>0 && C-4*k_2>=4 ], cost: 75+15*k_1+20*k_2 669.01/291.72 669.01/291.72 450: evalsipmamergesort2start -> [99] : A'=1, B'=-2*k_1+C, D'=-2-2*k_1+C, E'=0, F'=1, G'=0, H'=0, Q'=2, K'=C-4*k_3, L'=-4+C-4*k_3, M'=0, N'=2, O'=0, P'=0, [ k_1>0 && 2+2*k_1-C==0 && -4+C>=1 && k_3>0 && C-4*k_3>=4 ], cost: 80+15*k_1+20*k_3 669.01/291.72 669.01/291.72 451: evalsipmamergesort2start -> [103] : A'=1, B'=-2*k_1+C, D'=-2-2*k_1+C, E'=0, F'=1, G'=0, H'=0, Q'=2, K'=C-4*k_3, L'=C-4*k_3, M'=2, N'=0, O'=0, P'=0, [ k_1>0 && 2+2*k_1-C==0 && -4+C>=1 && k_3>0 && C-4*k_3>=4 ], cost: 75+15*k_1+20*k_3 669.01/291.72 669.01/291.72 452: evalsipmamergesort2start -> [109] : A'=1, [ k>0 && 2+2*k-C==0 && -4+C>=1 && k_2>0 && C-4*k_2>=1 ], cost: 68+15*k+20*k_2 669.01/291.72 669.01/291.72 453: evalsipmamergesort2start -> [109] : A'=1, [ k_1>0 && 2+2*k_1-C==0 && -4+C>=1 && k_2>0 && C-4*k_2>=1 ], cost: 68+15*k_1+20*k_2 669.01/291.72 669.01/291.72 454: evalsipmamergesort2start -> [109] : A'=1, [ k_1>0 && 2+2*k_1-C==0 && -4+C>=1 && k_3>0 && C-4*k_3>=1 ], cost: 68+15*k_1+20*k_3 669.01/291.72 669.01/291.72 455: evalsipmamergesort2start -> evalsipmamergesort2bb26in : A'=1, B'=C, D'=-2+C, E'=0, F'=1, G'=0, H'=0, Q'=2, J'=0, R'=1+C, [ C>=2 && 0>=-2+C ], cost: 47+2*C 669.01/291.72 669.01/291.72 456: evalsipmamergesort2start -> evalsipmamergesort2bb26in : A'=1, B'=C, D'=-2+C, E'=1, F'=0, G'=0, H'=0, Q'=2, J'=0, R'=1+C, [ C>=2 && 0>=-2+C ], cost: 47+2*C 669.01/291.72 669.01/291.72 457: evalsipmamergesort2start -> [98] : A'=4, B'=C, D'=-8+C, E'=0, F'=4, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=0, N'=2, O'=0, P'=0, Q_1'=4, [ k>0 && 2+2*k-C==0 && k_2>0 && 4-C+4*k_2==0 && C>=8 ], cost: 116+15*k+20*k_2 669.01/291.72 669.01/291.72 458: evalsipmamergesort2start -> [102] : A'=4, B'=C, D'=-2-2*k+C, E'=0, F'=1, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=0, N'=2, O'=0, P'=0, Q_1'=4, [ k>0 && 2+2*k-C==0 && k_2>0 && 4-C+4*k_2==0 && C>=8 ], cost: 107+15*k+20*k_2 669.01/291.72 669.01/291.72 459: evalsipmamergesort2start -> [98] : A'=4, B'=-8*k_1+C, D'=-8-8*k_1+C, E'=0, F'=4, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=0, N'=2, O'=0, P'=0, Q_1'=4, [ k>0 && 2+2*k-C==0 && k_2>0 && 4-C+4*k_2==0 && -8+C>=1 && k_1>0 && -8*k_1+C>=8 ], cost: 116+30*k_1+15*k+20*k_2 669.01/291.72 669.01/291.72 460: evalsipmamergesort2start -> [102] : A'=4, B'=-8*k_1+C, D'=-8*k_1+C, E'=4, F'=0, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=0, N'=2, O'=0, P'=0, Q_1'=4, [ k>0 && 2+2*k-C==0 && k_2>0 && 4-C+4*k_2==0 && -8+C>=1 && k_1>0 && -8*k_1+C>=8 ], cost: 107+30*k_1+15*k+20*k_2 669.01/291.72 669.01/291.72 461: evalsipmamergesort2start -> [108] : A'=4, B'=-2*k+C, D'=-2-2*k+C, E'=0, F'=1, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=0, N'=2, O'=0, P'=0, Q_1'=4, [ k>0 && 2+2*k-C==0 && k_2>0 && 4-C+4*k_2==0 && -8+C>=1 && k_1>0 && -8*k_1+C>=1 ], cost: 94+30*k_1+15*k+20*k_2 669.01/291.72 669.01/291.72 462: evalsipmamergesort2start -> [99] : A'=4, B'=-8*k_1+C, D'=-8-8*k_1+C, E'=0, F'=4, G'=0, H'=0, Q'=8, K'=C-16*k_3, L'=-16+C-16*k_3, M'=0, N'=8, O'=0, P'=0, Q_1'=4, [ k>0 && 2+2*k-C==0 && k_2>0 && 4-C+4*k_2==0 && k_1>0 && 8+8*k_1-C==0 && -16+C>=1 && k_3>0 && C-16*k_3>=16 ], cost: 193+30*k_1+15*k+50*k_3+20*k_2 669.01/291.72 669.01/291.72 463: evalsipmamergesort2start -> [103] : A'=4, B'=-8*k_1+C, D'=-8-8*k_1+C, E'=0, F'=4, G'=0, H'=0, Q'=8, K'=C-16*k_3, L'=C-16*k_3, M'=8, N'=0, O'=0, P'=0, Q_1'=4, [ k>0 && 2+2*k-C==0 && k_2>0 && 4-C+4*k_2==0 && k_1>0 && 8+8*k_1-C==0 && -16+C>=1 && k_3>0 && C-16*k_3>=16 ], cost: 176+30*k_1+15*k+50*k_3+20*k_2 669.01/291.72 669.01/291.72 464: evalsipmamergesort2start -> [109] : A'=4, B'=-2*k+C, D'=-2-2*k+C, E'=0, F'=1, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=0, N'=2, O'=0, P'=0, Q_1'=4, [ k>0 && 2+2*k-C==0 && k_2>0 && 4-C+4*k_2==0 && k_1>0 && 8+8*k_1-C==0 && -16+C>=1 && k_3>0 && C-16*k_3>=1 ], cost: 151+30*k_1+15*k+50*k_3+20*k_2 669.01/291.72 669.01/291.72 465: evalsipmamergesort2start -> evalsipmamergesort2bb26in : A'=4, B'=C, D'=-8+C, E'=0, F'=4, G'=0, H'=0, Q'=8, J'=0, K'=C-4*k_2, L'=-4+C-4*k_2, M'=0, N'=2, O'=0, P'=0, Q_1'=4, R'=1+C, [ k>0 && 2+2*k-C==0 && k_2>0 && 4-C+4*k_2==0 && C>=8 && 0>=-8+C ], cost: 130+15*k+2*C+20*k_2 669.01/291.72 669.01/291.72 466: evalsipmamergesort2start -> evalsipmamergesort2bb26in : A'=4, B'=C, D'=-8+C, E'=4, F'=0, G'=0, H'=0, Q'=8, J'=0, K'=C-4*k_2, L'=-4+C-4*k_2, M'=0, N'=2, O'=0, P'=0, Q_1'=4, R'=1+C, [ k>0 && 2+2*k-C==0 && k_2>0 && 4-C+4*k_2==0 && C>=8 && 0>=-8+C ], cost: 130+15*k+2*C+20*k_2 669.01/291.72 669.01/291.72 467: evalsipmamergesort2start -> [98] : A'=4, B'=C, D'=-8+C, E'=0, F'=4, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=2, N'=0, O'=0, P'=0, Q_1'=4, [ k>0 && 2+2*k-C==0 && k_2>0 && 4-C+4*k_2==0 && C>=8 ], cost: 116+15*k+20*k_2 669.01/291.72 669.01/291.72 468: evalsipmamergesort2start -> [102] : A'=4, B'=C, D'=-2-2*k+C, E'=0, F'=1, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=2, N'=0, O'=0, P'=0, Q_1'=4, [ k>0 && 2+2*k-C==0 && k_2>0 && 4-C+4*k_2==0 && C>=8 ], cost: 107+15*k+20*k_2 669.01/291.72 669.01/291.72 469: evalsipmamergesort2start -> [98] : A'=4, B'=-8*k_1+C, D'=-8-8*k_1+C, E'=0, F'=4, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=2, N'=0, O'=0, P'=0, Q_1'=4, [ k>0 && 2+2*k-C==0 && k_2>0 && 4-C+4*k_2==0 && -8+C>=1 && k_1>0 && -8*k_1+C>=8 ], cost: 116+30*k_1+15*k+20*k_2 669.01/291.72 669.01/291.72 470: evalsipmamergesort2start -> [102] : A'=4, B'=-8*k_1+C, D'=-8*k_1+C, E'=4, F'=0, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=2, N'=0, O'=0, P'=0, Q_1'=4, [ k>0 && 2+2*k-C==0 && k_2>0 && 4-C+4*k_2==0 && -8+C>=1 && k_1>0 && -8*k_1+C>=8 ], cost: 107+30*k_1+15*k+20*k_2 669.01/291.72 669.01/291.72 471: evalsipmamergesort2start -> [108] : A'=4, B'=-2*k+C, D'=-2-2*k+C, E'=0, F'=1, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=2, N'=0, O'=0, P'=0, Q_1'=4, [ k>0 && 2+2*k-C==0 && k_2>0 && 4-C+4*k_2==0 && -8+C>=1 && k_1>0 && -8*k_1+C>=1 ], cost: 94+30*k_1+15*k+20*k_2 669.01/291.72 669.01/291.72 472: evalsipmamergesort2start -> [99] : A'=4, B'=-8*k_1+C, D'=-8-8*k_1+C, E'=0, F'=4, G'=0, H'=0, Q'=8, K'=C-16*k_3, L'=-16+C-16*k_3, M'=0, N'=8, O'=0, P'=0, Q_1'=4, [ k>0 && 2+2*k-C==0 && k_2>0 && 4-C+4*k_2==0 && k_1>0 && 8+8*k_1-C==0 && -16+C>=1 && k_3>0 && C-16*k_3>=16 ], cost: 193+30*k_1+15*k+50*k_3+20*k_2 669.01/291.72 669.01/291.72 473: evalsipmamergesort2start -> [103] : A'=4, B'=-8*k_1+C, D'=-8-8*k_1+C, E'=0, F'=4, G'=0, H'=0, Q'=8, K'=C-16*k_3, L'=C-16*k_3, M'=8, N'=0, O'=0, P'=0, Q_1'=4, [ k>0 && 2+2*k-C==0 && k_2>0 && 4-C+4*k_2==0 && k_1>0 && 8+8*k_1-C==0 && -16+C>=1 && k_3>0 && C-16*k_3>=16 ], cost: 176+30*k_1+15*k+50*k_3+20*k_2 669.01/291.72 669.01/291.72 474: evalsipmamergesort2start -> [109] : A'=4, B'=-2*k+C, D'=-2-2*k+C, E'=0, F'=1, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=2, N'=0, O'=0, P'=0, Q_1'=4, [ k>0 && 2+2*k-C==0 && k_2>0 && 4-C+4*k_2==0 && k_1>0 && 8+8*k_1-C==0 && -16+C>=1 && k_3>0 && C-16*k_3>=1 ], cost: 151+30*k_1+15*k+50*k_3+20*k_2 669.01/291.72 669.01/291.72 475: evalsipmamergesort2start -> evalsipmamergesort2bb26in : A'=4, B'=C, D'=-8+C, E'=0, F'=4, G'=0, H'=0, Q'=8, J'=0, K'=C-4*k_2, L'=-4+C-4*k_2, M'=2, N'=0, O'=0, P'=0, Q_1'=4, R'=1+C, [ k>0 && 2+2*k-C==0 && k_2>0 && 4-C+4*k_2==0 && C>=8 && 0>=-8+C ], cost: 130+15*k+2*C+20*k_2 669.01/291.72 669.01/291.72 476: evalsipmamergesort2start -> evalsipmamergesort2bb26in : A'=4, B'=C, D'=-8+C, E'=4, F'=0, G'=0, H'=0, Q'=8, J'=0, K'=C-4*k_2, L'=-4+C-4*k_2, M'=2, N'=0, O'=0, P'=0, Q_1'=4, R'=1+C, [ k>0 && 2+2*k-C==0 && k_2>0 && 4-C+4*k_2==0 && C>=8 && 0>=-8+C ], cost: 130+15*k+2*C+20*k_2 669.01/291.72 669.01/291.72 477: evalsipmamergesort2start -> [98] : A'=4, B'=C, D'=-8+C, E'=0, F'=4, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=2, N'=0, O'=0, P'=0, Q_1'=4, [ k_1>0 && 2+2*k_1-C==0 && k_2>0 && 4-C+4*k_2==0 && C>=8 ], cost: 116+15*k_1+20*k_2 669.01/291.72 669.01/291.72 478: evalsipmamergesort2start -> [102] : A'=4, B'=C, D'=-2-2*k_1+C, E'=0, F'=1, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=2, N'=0, O'=0, P'=0, Q_1'=4, [ k_1>0 && 2+2*k_1-C==0 && k_2>0 && 4-C+4*k_2==0 && C>=8 ], cost: 107+15*k_1+20*k_2 669.01/291.72 669.01/291.72 479: evalsipmamergesort2start -> [98] : A'=4, B'=-8*k+C, D'=-8-8*k+C, E'=0, F'=4, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=2, N'=0, O'=0, P'=0, Q_1'=4, [ k_1>0 && 2+2*k_1-C==0 && k_2>0 && 4-C+4*k_2==0 && -8+C>=1 && k>0 && -8*k+C>=8 ], cost: 116+15*k_1+30*k+20*k_2 669.01/291.72 669.01/291.72 480: evalsipmamergesort2start -> [108] : A'=4, B'=-2*k_1+C, D'=-2-2*k_1+C, E'=0, F'=1, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=2, N'=0, O'=0, P'=0, Q_1'=4, [ k_1>0 && 2+2*k_1-C==0 && k_2>0 && 4-C+4*k_2==0 && -8+C>=1 && k>0 && -8*k+C>=1 ], cost: 94+15*k_1+30*k+20*k_2 669.01/291.72 669.01/291.72 481: evalsipmamergesort2start -> evalsipmamergesort2bb26in : A'=4, B'=C, D'=-8+C, E'=0, F'=4, G'=0, H'=0, Q'=8, J'=0, K'=C-4*k_2, L'=-4+C-4*k_2, M'=2, N'=0, O'=0, P'=0, Q_1'=4, R'=1+C, [ k_1>0 && 2+2*k_1-C==0 && k_2>0 && 4-C+4*k_2==0 && C>=8 && 0>=-8+C ], cost: 130+15*k_1+2*C+20*k_2 669.01/291.72 669.01/291.72 482: evalsipmamergesort2start -> evalsipmamergesort2bb26in : A'=4, B'=C, D'=-8+C, E'=4, F'=0, G'=0, H'=0, Q'=8, J'=0, K'=C-4*k_2, L'=-4+C-4*k_2, M'=2, N'=0, O'=0, P'=0, Q_1'=4, R'=1+C, [ k_1>0 && 2+2*k_1-C==0 && k_2>0 && 4-C+4*k_2==0 && C>=8 && 0>=-8+C ], cost: 130+15*k_1+2*C+20*k_2 669.01/291.72 669.01/291.72 483: evalsipmamergesort2start -> [111] : [ k>0 && 2+2*k-C==0 && -4+C>=1 && k_2>0 && 4-C+4*k_2==0 ], cost: 93+15*k+20*k_2 669.01/291.72 669.01/291.72 484: evalsipmamergesort2start -> [111] : [ k>0 && 2+2*k-C==0 && -4+C>=1 && k_2>0 && 4-C+4*k_2==0 ], cost: 93+15*k+20*k_2 669.01/291.72 669.01/291.72 485: evalsipmamergesort2start -> [111] : [ k_1>0 && 2+2*k_1-C==0 && -4+C>=1 && k_2>0 && 4-C+4*k_2==0 ], cost: 93+15*k_1+20*k_2 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 Applied pruning (of leafs and parallel rules): 669.01/291.72 669.01/291.72 Start location: evalsipmamergesort2start 669.01/291.72 669.01/291.72 445: evalsipmamergesort2start -> [108] : A'=1, [ -2+C>=1 && k>0 && -2*k+C>=1 ], cost: 26+15*k 669.01/291.72 669.01/291.72 446: evalsipmamergesort2start -> [108] : A'=1, [ -2+C>=1 && k_1>0 && -2*k_1+C>=1 ], cost: 26+15*k_1 669.01/291.72 669.01/291.72 447: evalsipmamergesort2start -> [103] : A'=1, B'=-2*k+C, D'=-2-2*k+C, E'=0, F'=1, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=C-4*k_2, M'=0, N'=2, O'=0, P'=0, [ k>0 && 2+2*k-C==0 && -4+C>=1 && k_2>0 && C-4*k_2>=4 ], cost: 75+15*k+20*k_2 669.01/291.72 669.01/291.72 448: evalsipmamergesort2start -> [99] : A'=1, B'=-2*k_1+C, D'=-2-2*k_1+C, E'=0, F'=1, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=0, N'=2, O'=0, P'=0, [ k_1>0 && 2+2*k_1-C==0 && -4+C>=1 && k_2>0 && C-4*k_2>=4 ], cost: 80+15*k_1+20*k_2 669.01/291.72 669.01/291.72 449: evalsipmamergesort2start -> [103] : A'=1, B'=-2*k_1+C, D'=-2-2*k_1+C, E'=0, F'=1, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=C-4*k_2, M'=0, N'=2, O'=0, P'=0, [ k_1>0 && 2+2*k_1-C==0 && -4+C>=1 && k_2>0 && C-4*k_2>=4 ], cost: 75+15*k_1+20*k_2 669.01/291.72 669.01/291.72 450: evalsipmamergesort2start -> [99] : A'=1, B'=-2*k_1+C, D'=-2-2*k_1+C, E'=0, F'=1, G'=0, H'=0, Q'=2, K'=C-4*k_3, L'=-4+C-4*k_3, M'=0, N'=2, O'=0, P'=0, [ k_1>0 && 2+2*k_1-C==0 && -4+C>=1 && k_3>0 && C-4*k_3>=4 ], cost: 80+15*k_1+20*k_3 669.01/291.72 669.01/291.72 451: evalsipmamergesort2start -> [103] : A'=1, B'=-2*k_1+C, D'=-2-2*k_1+C, E'=0, F'=1, G'=0, H'=0, Q'=2, K'=C-4*k_3, L'=C-4*k_3, M'=2, N'=0, O'=0, P'=0, [ k_1>0 && 2+2*k_1-C==0 && -4+C>=1 && k_3>0 && C-4*k_3>=4 ], cost: 75+15*k_1+20*k_3 669.01/291.72 669.01/291.72 452: evalsipmamergesort2start -> [109] : A'=1, [ k>0 && 2+2*k-C==0 && -4+C>=1 && k_2>0 && C-4*k_2>=1 ], cost: 68+15*k+20*k_2 669.01/291.72 669.01/291.72 453: evalsipmamergesort2start -> [109] : A'=1, [ k_1>0 && 2+2*k_1-C==0 && -4+C>=1 && k_2>0 && C-4*k_2>=1 ], cost: 68+15*k_1+20*k_2 669.01/291.72 669.01/291.72 454: evalsipmamergesort2start -> [109] : A'=1, [ k_1>0 && 2+2*k_1-C==0 && -4+C>=1 && k_3>0 && C-4*k_3>=1 ], cost: 68+15*k_1+20*k_3 669.01/291.72 669.01/291.72 455: evalsipmamergesort2start -> evalsipmamergesort2bb26in : A'=1, B'=C, D'=-2+C, E'=0, F'=1, G'=0, H'=0, Q'=2, J'=0, R'=1+C, [ C>=2 && 0>=-2+C ], cost: 47+2*C 669.01/291.72 669.01/291.72 456: evalsipmamergesort2start -> evalsipmamergesort2bb26in : A'=1, B'=C, D'=-2+C, E'=1, F'=0, G'=0, H'=0, Q'=2, J'=0, R'=1+C, [ C>=2 && 0>=-2+C ], cost: 47+2*C 669.01/291.72 669.01/291.72 457: evalsipmamergesort2start -> [98] : A'=4, B'=C, D'=-8+C, E'=0, F'=4, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=0, N'=2, O'=0, P'=0, Q_1'=4, [ k>0 && 2+2*k-C==0 && k_2>0 && 4-C+4*k_2==0 && C>=8 ], cost: 116+15*k+20*k_2 669.01/291.72 669.01/291.72 458: evalsipmamergesort2start -> [102] : A'=4, B'=C, D'=-2-2*k+C, E'=0, F'=1, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=0, N'=2, O'=0, P'=0, Q_1'=4, [ k>0 && 2+2*k-C==0 && k_2>0 && 4-C+4*k_2==0 && C>=8 ], cost: 107+15*k+20*k_2 669.01/291.72 669.01/291.72 459: evalsipmamergesort2start -> [98] : A'=4, B'=-8*k_1+C, D'=-8-8*k_1+C, E'=0, F'=4, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=0, N'=2, O'=0, P'=0, Q_1'=4, [ k>0 && 2+2*k-C==0 && k_2>0 && 4-C+4*k_2==0 && -8+C>=1 && k_1>0 && -8*k_1+C>=8 ], cost: 116+30*k_1+15*k+20*k_2 669.01/291.72 669.01/291.72 460: evalsipmamergesort2start -> [102] : A'=4, B'=-8*k_1+C, D'=-8*k_1+C, E'=4, F'=0, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=0, N'=2, O'=0, P'=0, Q_1'=4, [ k>0 && 2+2*k-C==0 && k_2>0 && 4-C+4*k_2==0 && -8+C>=1 && k_1>0 && -8*k_1+C>=8 ], cost: 107+30*k_1+15*k+20*k_2 669.01/291.72 669.01/291.72 461: evalsipmamergesort2start -> [108] : A'=4, B'=-2*k+C, D'=-2-2*k+C, E'=0, F'=1, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=0, N'=2, O'=0, P'=0, Q_1'=4, [ k>0 && 2+2*k-C==0 && k_2>0 && 4-C+4*k_2==0 && -8+C>=1 && k_1>0 && -8*k_1+C>=1 ], cost: 94+30*k_1+15*k+20*k_2 669.01/291.72 669.01/291.72 464: evalsipmamergesort2start -> [109] : A'=4, B'=-2*k+C, D'=-2-2*k+C, E'=0, F'=1, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=0, N'=2, O'=0, P'=0, Q_1'=4, [ k>0 && 2+2*k-C==0 && k_2>0 && 4-C+4*k_2==0 && k_1>0 && 8+8*k_1-C==0 && -16+C>=1 && k_3>0 && C-16*k_3>=1 ], cost: 151+30*k_1+15*k+50*k_3+20*k_2 669.01/291.72 669.01/291.72 466: evalsipmamergesort2start -> evalsipmamergesort2bb26in : A'=4, B'=C, D'=-8+C, E'=4, F'=0, G'=0, H'=0, Q'=8, J'=0, K'=C-4*k_2, L'=-4+C-4*k_2, M'=0, N'=2, O'=0, P'=0, Q_1'=4, R'=1+C, [ k>0 && 2+2*k-C==0 && k_2>0 && 4-C+4*k_2==0 && C>=8 && 0>=-8+C ], cost: 130+15*k+2*C+20*k_2 669.01/291.72 669.01/291.72 468: evalsipmamergesort2start -> [102] : A'=4, B'=C, D'=-2-2*k+C, E'=0, F'=1, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=2, N'=0, O'=0, P'=0, Q_1'=4, [ k>0 && 2+2*k-C==0 && k_2>0 && 4-C+4*k_2==0 && C>=8 ], cost: 107+15*k+20*k_2 669.01/291.72 669.01/291.72 469: evalsipmamergesort2start -> [98] : A'=4, B'=-8*k_1+C, D'=-8-8*k_1+C, E'=0, F'=4, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=2, N'=0, O'=0, P'=0, Q_1'=4, [ k>0 && 2+2*k-C==0 && k_2>0 && 4-C+4*k_2==0 && -8+C>=1 && k_1>0 && -8*k_1+C>=8 ], cost: 116+30*k_1+15*k+20*k_2 669.01/291.72 669.01/291.72 470: evalsipmamergesort2start -> [102] : A'=4, B'=-8*k_1+C, D'=-8*k_1+C, E'=4, F'=0, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=2, N'=0, O'=0, P'=0, Q_1'=4, [ k>0 && 2+2*k-C==0 && k_2>0 && 4-C+4*k_2==0 && -8+C>=1 && k_1>0 && -8*k_1+C>=8 ], cost: 107+30*k_1+15*k+20*k_2 669.01/291.72 669.01/291.72 471: evalsipmamergesort2start -> [108] : A'=4, B'=-2*k+C, D'=-2-2*k+C, E'=0, F'=1, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=2, N'=0, O'=0, P'=0, Q_1'=4, [ k>0 && 2+2*k-C==0 && k_2>0 && 4-C+4*k_2==0 && -8+C>=1 && k_1>0 && -8*k_1+C>=1 ], cost: 94+30*k_1+15*k+20*k_2 669.01/291.72 669.01/291.72 472: evalsipmamergesort2start -> [99] : A'=4, B'=-8*k_1+C, D'=-8-8*k_1+C, E'=0, F'=4, G'=0, H'=0, Q'=8, K'=C-16*k_3, L'=-16+C-16*k_3, M'=0, N'=8, O'=0, P'=0, Q_1'=4, [ k>0 && 2+2*k-C==0 && k_2>0 && 4-C+4*k_2==0 && k_1>0 && 8+8*k_1-C==0 && -16+C>=1 && k_3>0 && C-16*k_3>=16 ], cost: 193+30*k_1+15*k+50*k_3+20*k_2 669.01/291.72 669.01/291.72 473: evalsipmamergesort2start -> [103] : A'=4, B'=-8*k_1+C, D'=-8-8*k_1+C, E'=0, F'=4, G'=0, H'=0, Q'=8, K'=C-16*k_3, L'=C-16*k_3, M'=8, N'=0, O'=0, P'=0, Q_1'=4, [ k>0 && 2+2*k-C==0 && k_2>0 && 4-C+4*k_2==0 && k_1>0 && 8+8*k_1-C==0 && -16+C>=1 && k_3>0 && C-16*k_3>=16 ], cost: 176+30*k_1+15*k+50*k_3+20*k_2 669.01/291.72 669.01/291.72 474: evalsipmamergesort2start -> [109] : A'=4, B'=-2*k+C, D'=-2-2*k+C, E'=0, F'=1, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=2, N'=0, O'=0, P'=0, Q_1'=4, [ k>0 && 2+2*k-C==0 && k_2>0 && 4-C+4*k_2==0 && k_1>0 && 8+8*k_1-C==0 && -16+C>=1 && k_3>0 && C-16*k_3>=1 ], cost: 151+30*k_1+15*k+50*k_3+20*k_2 669.01/291.72 669.01/291.72 475: evalsipmamergesort2start -> evalsipmamergesort2bb26in : A'=4, B'=C, D'=-8+C, E'=0, F'=4, G'=0, H'=0, Q'=8, J'=0, K'=C-4*k_2, L'=-4+C-4*k_2, M'=2, N'=0, O'=0, P'=0, Q_1'=4, R'=1+C, [ k>0 && 2+2*k-C==0 && k_2>0 && 4-C+4*k_2==0 && C>=8 && 0>=-8+C ], cost: 130+15*k+2*C+20*k_2 669.01/291.72 669.01/291.72 476: evalsipmamergesort2start -> evalsipmamergesort2bb26in : A'=4, B'=C, D'=-8+C, E'=4, F'=0, G'=0, H'=0, Q'=8, J'=0, K'=C-4*k_2, L'=-4+C-4*k_2, M'=2, N'=0, O'=0, P'=0, Q_1'=4, R'=1+C, [ k>0 && 2+2*k-C==0 && k_2>0 && 4-C+4*k_2==0 && C>=8 && 0>=-8+C ], cost: 130+15*k+2*C+20*k_2 669.01/291.72 669.01/291.72 477: evalsipmamergesort2start -> [98] : A'=4, B'=C, D'=-8+C, E'=0, F'=4, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=2, N'=0, O'=0, P'=0, Q_1'=4, [ k_1>0 && 2+2*k_1-C==0 && k_2>0 && 4-C+4*k_2==0 && C>=8 ], cost: 116+15*k_1+20*k_2 669.01/291.72 669.01/291.72 478: evalsipmamergesort2start -> [102] : A'=4, B'=C, D'=-2-2*k_1+C, E'=0, F'=1, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=2, N'=0, O'=0, P'=0, Q_1'=4, [ k_1>0 && 2+2*k_1-C==0 && k_2>0 && 4-C+4*k_2==0 && C>=8 ], cost: 107+15*k_1+20*k_2 669.01/291.72 669.01/291.72 479: evalsipmamergesort2start -> [98] : A'=4, B'=-8*k+C, D'=-8-8*k+C, E'=0, F'=4, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=2, N'=0, O'=0, P'=0, Q_1'=4, [ k_1>0 && 2+2*k_1-C==0 && k_2>0 && 4-C+4*k_2==0 && -8+C>=1 && k>0 && -8*k+C>=8 ], cost: 116+15*k_1+30*k+20*k_2 669.01/291.72 669.01/291.72 480: evalsipmamergesort2start -> [108] : A'=4, B'=-2*k_1+C, D'=-2-2*k_1+C, E'=0, F'=1, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=2, N'=0, O'=0, P'=0, Q_1'=4, [ k_1>0 && 2+2*k_1-C==0 && k_2>0 && 4-C+4*k_2==0 && -8+C>=1 && k>0 && -8*k+C>=1 ], cost: 94+15*k_1+30*k+20*k_2 669.01/291.72 669.01/291.72 484: evalsipmamergesort2start -> [111] : [ k>0 && 2+2*k-C==0 && -4+C>=1 && k_2>0 && 4-C+4*k_2==0 ], cost: 93+15*k+20*k_2 669.01/291.72 669.01/291.72 485: evalsipmamergesort2start -> [111] : [ k_1>0 && 2+2*k_1-C==0 && -4+C>=1 && k_2>0 && 4-C+4*k_2==0 ], cost: 93+15*k_1+20*k_2 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 ### Computing asymptotic complexity ### 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 Fully simplified ITS problem 669.01/291.72 669.01/291.72 Start location: evalsipmamergesort2start 669.01/291.72 669.01/291.72 445: evalsipmamergesort2start -> [108] : A'=1, [ -2+C>=1 && k>0 && -2*k+C>=1 ], cost: 26+15*k 669.01/291.72 669.01/291.72 446: evalsipmamergesort2start -> [108] : A'=1, [ -2+C>=1 && k_1>0 && -2*k_1+C>=1 ], cost: 26+15*k_1 669.01/291.72 669.01/291.72 447: evalsipmamergesort2start -> [103] : A'=1, B'=-2*k+C, D'=-2-2*k+C, E'=0, F'=1, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=C-4*k_2, M'=0, N'=2, O'=0, P'=0, [ k>0 && 2+2*k-C==0 && -4+C>=1 && k_2>0 && C-4*k_2>=4 ], cost: 75+15*k+20*k_2 669.01/291.72 669.01/291.72 448: evalsipmamergesort2start -> [99] : A'=1, B'=-2*k_1+C, D'=-2-2*k_1+C, E'=0, F'=1, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=0, N'=2, O'=0, P'=0, [ k_1>0 && 2+2*k_1-C==0 && -4+C>=1 && k_2>0 && C-4*k_2>=4 ], cost: 80+15*k_1+20*k_2 669.01/291.72 669.01/291.72 450: evalsipmamergesort2start -> [99] : A'=1, B'=-2*k_1+C, D'=-2-2*k_1+C, E'=0, F'=1, G'=0, H'=0, Q'=2, K'=C-4*k_3, L'=-4+C-4*k_3, M'=0, N'=2, O'=0, P'=0, [ k_1>0 && 2+2*k_1-C==0 && -4+C>=1 && k_3>0 && C-4*k_3>=4 ], cost: 80+15*k_1+20*k_3 669.01/291.72 669.01/291.72 452: evalsipmamergesort2start -> [109] : A'=1, [ k>0 && 2+2*k-C==0 && -4+C>=1 && k_2>0 && C-4*k_2>=1 ], cost: 68+15*k+20*k_2 669.01/291.72 669.01/291.72 453: evalsipmamergesort2start -> [109] : A'=1, [ k_1>0 && 2+2*k_1-C==0 && -4+C>=1 && k_2>0 && C-4*k_2>=1 ], cost: 68+15*k_1+20*k_2 669.01/291.72 669.01/291.72 454: evalsipmamergesort2start -> [109] : A'=1, [ k_1>0 && 2+2*k_1-C==0 && -4+C>=1 && k_3>0 && C-4*k_3>=1 ], cost: 68+15*k_1+20*k_3 669.01/291.72 669.01/291.72 456: evalsipmamergesort2start -> evalsipmamergesort2bb26in : A'=1, B'=C, D'=-2+C, E'=1, F'=0, G'=0, H'=0, Q'=2, J'=0, R'=1+C, [ C>=2 && 0>=-2+C ], cost: 47+2*C 669.01/291.72 669.01/291.72 457: evalsipmamergesort2start -> [98] : A'=4, B'=C, D'=-8+C, E'=0, F'=4, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=0, N'=2, O'=0, P'=0, Q_1'=4, [ k>0 && 2+2*k-C==0 && k_2>0 && 4-C+4*k_2==0 && C>=8 ], cost: 116+15*k+20*k_2 669.01/291.72 669.01/291.72 469: evalsipmamergesort2start -> [98] : A'=4, B'=-8*k_1+C, D'=-8-8*k_1+C, E'=0, F'=4, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=2, N'=0, O'=0, P'=0, Q_1'=4, [ k>0 && 2+2*k-C==0 && k_2>0 && 4-C+4*k_2==0 && -8+C>=1 && k_1>0 && -8*k_1+C>=8 ], cost: 116+30*k_1+15*k+20*k_2 669.01/291.72 669.01/291.72 471: evalsipmamergesort2start -> [108] : A'=4, B'=-2*k+C, D'=-2-2*k+C, E'=0, F'=1, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=2, N'=0, O'=0, P'=0, Q_1'=4, [ k>0 && 2+2*k-C==0 && k_2>0 && 4-C+4*k_2==0 && -8+C>=1 && k_1>0 && -8*k_1+C>=1 ], cost: 94+30*k_1+15*k+20*k_2 669.01/291.72 669.01/291.72 472: evalsipmamergesort2start -> [99] : A'=4, B'=-8*k_1+C, D'=-8-8*k_1+C, E'=0, F'=4, G'=0, H'=0, Q'=8, K'=C-16*k_3, L'=-16+C-16*k_3, M'=0, N'=8, O'=0, P'=0, Q_1'=4, [ k>0 && 2+2*k-C==0 && k_2>0 && 4-C+4*k_2==0 && k_1>0 && 8+8*k_1-C==0 && -16+C>=1 && k_3>0 && C-16*k_3>=16 ], cost: 193+30*k_1+15*k+50*k_3+20*k_2 669.01/291.72 669.01/291.72 474: evalsipmamergesort2start -> [109] : A'=4, B'=-2*k+C, D'=-2-2*k+C, E'=0, F'=1, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=2, N'=0, O'=0, P'=0, Q_1'=4, [ k>0 && 2+2*k-C==0 && k_2>0 && 4-C+4*k_2==0 && k_1>0 && 8+8*k_1-C==0 && -16+C>=1 && k_3>0 && C-16*k_3>=1 ], cost: 151+30*k_1+15*k+50*k_3+20*k_2 669.01/291.72 669.01/291.72 476: evalsipmamergesort2start -> evalsipmamergesort2bb26in : A'=4, B'=C, D'=-8+C, E'=4, F'=0, G'=0, H'=0, Q'=8, J'=0, K'=C-4*k_2, L'=-4+C-4*k_2, M'=2, N'=0, O'=0, P'=0, Q_1'=4, R'=1+C, [ k>0 && 2+2*k-C==0 && k_2>0 && 4-C+4*k_2==0 && C>=8 && 0>=-8+C ], cost: 130+15*k+2*C+20*k_2 669.01/291.72 669.01/291.72 477: evalsipmamergesort2start -> [98] : A'=4, B'=C, D'=-8+C, E'=0, F'=4, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=2, N'=0, O'=0, P'=0, Q_1'=4, [ k_1>0 && 2+2*k_1-C==0 && k_2>0 && 4-C+4*k_2==0 && C>=8 ], cost: 116+15*k_1+20*k_2 669.01/291.72 669.01/291.72 479: evalsipmamergesort2start -> [98] : A'=4, B'=-8*k+C, D'=-8-8*k+C, E'=0, F'=4, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=2, N'=0, O'=0, P'=0, Q_1'=4, [ k_1>0 && 2+2*k_1-C==0 && k_2>0 && 4-C+4*k_2==0 && -8+C>=1 && k>0 && -8*k+C>=8 ], cost: 116+15*k_1+30*k+20*k_2 669.01/291.72 669.01/291.72 480: evalsipmamergesort2start -> [108] : A'=4, B'=-2*k_1+C, D'=-2-2*k_1+C, E'=0, F'=1, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=2, N'=0, O'=0, P'=0, Q_1'=4, [ k_1>0 && 2+2*k_1-C==0 && k_2>0 && 4-C+4*k_2==0 && -8+C>=1 && k>0 && -8*k+C>=1 ], cost: 94+15*k_1+30*k+20*k_2 669.01/291.72 669.01/291.72 484: evalsipmamergesort2start -> [111] : [ k>0 && 2+2*k-C==0 && -4+C>=1 && k_2>0 && 4-C+4*k_2==0 ], cost: 93+15*k+20*k_2 669.01/291.72 669.01/291.72 485: evalsipmamergesort2start -> [111] : [ k_1>0 && 2+2*k_1-C==0 && -4+C>=1 && k_2>0 && 4-C+4*k_2==0 ], cost: 93+15*k_1+20*k_2 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 Computing asymptotic complexity for rule 445 669.01/291.72 669.01/291.72 Simplified the guard: 669.01/291.72 669.01/291.72 445: evalsipmamergesort2start -> [108] : A'=1, [ k>0 && -2*k+C>=1 ], cost: 26+15*k 669.01/291.72 669.01/291.72 Solved the limit problem by the following transformations: 669.01/291.72 669.01/291.72 Created initial limit problem: 669.01/291.72 669.01/291.72 k (+/+!), -2*k+C (+/+!), 26+15*k (+) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 removing all constraints (solved by SMT) 669.01/291.72 669.01/291.72 resulting limit problem: [solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {k==n,C==1+2*n} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 [solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 Solution: 669.01/291.72 669.01/291.72 k / n 669.01/291.72 669.01/291.72 C / 1+2*n 669.01/291.72 669.01/291.72 Resulting cost 26+15*n has complexity: Poly(n^1) 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 Found new complexity Poly(n^1). 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 Computing asymptotic complexity for rule 446 669.01/291.72 669.01/291.72 Simplified the guard: 669.01/291.72 669.01/291.72 446: evalsipmamergesort2start -> [108] : A'=1, [ k_1>0 && -2*k_1+C>=1 ], cost: 26+15*k_1 669.01/291.72 669.01/291.72 Solved the limit problem by the following transformations: 669.01/291.72 669.01/291.72 Created initial limit problem: 669.01/291.72 669.01/291.72 k_1 (+/+!), 26+15*k_1 (+), -2*k_1+C (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 removing all constraints (solved by SMT) 669.01/291.72 669.01/291.72 resulting limit problem: [solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {k_1==n,C==3*n} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 [solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 Solution: 669.01/291.72 669.01/291.72 k_1 / n 669.01/291.72 669.01/291.72 C / 3*n 669.01/291.72 669.01/291.72 Resulting cost 26+15*n has complexity: Poly(n^1) 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 Computing asymptotic complexity for rule 447 669.01/291.72 669.01/291.72 Simplified the guard: 669.01/291.72 669.01/291.72 447: evalsipmamergesort2start -> [103] : A'=1, B'=-2*k+C, D'=-2-2*k+C, E'=0, F'=1, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=C-4*k_2, M'=0, N'=2, O'=0, P'=0, [ 2+2*k-C==0 && k_2>0 && C-4*k_2>=4 ], cost: 75+15*k+20*k_2 669.01/291.72 669.01/291.72 Solved the limit problem by the following transformations: 669.01/291.72 669.01/291.72 Created initial limit problem: 669.01/291.72 669.01/291.72 75+15*k+20*k_2 (+), -1-2*k+C (+/+!), 3+2*k-C (+/+!), k_2 (+/+!), -3+C-4*k_2 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {C==2+2*k} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 75+15*k+20*k_2 (+), 1 (+/+!), -1+2*k-4*k_2 (+/+!), k_2 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {k_2==1} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 1 (+/+!), -5+2*k (+/+!), 95+15*k (+) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (B), deleting 1 (+/+!) 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 -5+2*k (+/+!), 95+15*k (+) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 removing all constraints (solved by SMT) 669.01/291.72 669.01/291.72 resulting limit problem: [solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {k==n} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 [solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 Solved the limit problem by the following transformations: 669.01/291.72 669.01/291.72 Created initial limit problem: 669.01/291.72 669.01/291.72 75+15*k+20*k_2 (+), -1-2*k+C (+/+!), 3+2*k-C (+/+!), k_2 (+/+!), -3+C-4*k_2 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {C==2+2*k} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 75+15*k+20*k_2 (+), 1 (+/+!), -1+2*k-4*k_2 (+/+!), k_2 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (B), deleting 1 (+/+!) 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 75+15*k+20*k_2 (+), -1+2*k-4*k_2 (+/+!), k_2 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 removing all constraints (solved by SMT) 669.01/291.72 669.01/291.72 resulting limit problem: [solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {k==n,k_2==1} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 [solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 Solution: 669.01/291.72 669.01/291.72 k / n 669.01/291.72 669.01/291.72 C / 2+2*n 669.01/291.72 669.01/291.72 k_2 / 1 669.01/291.72 669.01/291.72 Resulting cost 95+15*n has complexity: Poly(n^1) 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 Computing asymptotic complexity for rule 448 669.01/291.72 669.01/291.72 Simplified the guard: 669.01/291.72 669.01/291.72 448: evalsipmamergesort2start -> [99] : A'=1, B'=-2*k_1+C, D'=-2-2*k_1+C, E'=0, F'=1, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=0, N'=2, O'=0, P'=0, [ 2+2*k_1-C==0 && k_2>0 && C-4*k_2>=4 ], cost: 80+15*k_1+20*k_2 669.01/291.72 669.01/291.72 Solved the limit problem by the following transformations: 669.01/291.72 669.01/291.72 Created initial limit problem: 669.01/291.72 669.01/291.72 -1-2*k_1+C (+/+!), 3+2*k_1-C (+/+!), 80+15*k_1+20*k_2 (+), k_2 (+/+!), -3+C-4*k_2 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {C==2+2*k_1} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 1 (+/+!), -1+2*k_1-4*k_2 (+/+!), 80+15*k_1+20*k_2 (+), k_2 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {k_2==1} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 1 (+/+!), -5+2*k_1 (+/+!), 100+15*k_1 (+) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (B), deleting 1 (+/+!) 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 -5+2*k_1 (+/+!), 100+15*k_1 (+) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 removing all constraints (solved by SMT) 669.01/291.72 669.01/291.72 resulting limit problem: [solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {k_1==n} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 [solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 Solved the limit problem by the following transformations: 669.01/291.72 669.01/291.72 Created initial limit problem: 669.01/291.72 669.01/291.72 -1-2*k_1+C (+/+!), 3+2*k_1-C (+/+!), 80+15*k_1+20*k_2 (+), k_2 (+/+!), -3+C-4*k_2 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {C==2+2*k_1} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 1 (+/+!), -1+2*k_1-4*k_2 (+/+!), 80+15*k_1+20*k_2 (+), k_2 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (B), deleting 1 (+/+!) 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 -1+2*k_1-4*k_2 (+/+!), 80+15*k_1+20*k_2 (+), k_2 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 removing all constraints (solved by SMT) 669.01/291.72 669.01/291.72 resulting limit problem: [solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {k_1==n,k_2==1} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 [solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 Solution: 669.01/291.72 669.01/291.72 k_1 / n 669.01/291.72 669.01/291.72 C / 2+2*n 669.01/291.72 669.01/291.72 k_2 / 1 669.01/291.72 669.01/291.72 Resulting cost 100+15*n has complexity: Poly(n^1) 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 Computing asymptotic complexity for rule 450 669.01/291.72 669.01/291.72 Simplified the guard: 669.01/291.72 669.01/291.72 450: evalsipmamergesort2start -> [99] : A'=1, B'=-2*k_1+C, D'=-2-2*k_1+C, E'=0, F'=1, G'=0, H'=0, Q'=2, K'=C-4*k_3, L'=-4+C-4*k_3, M'=0, N'=2, O'=0, P'=0, [ 2+2*k_1-C==0 && k_3>0 && C-4*k_3>=4 ], cost: 80+15*k_1+20*k_3 669.01/291.72 669.01/291.72 Solved the limit problem by the following transformations: 669.01/291.72 669.01/291.72 Created initial limit problem: 669.01/291.72 669.01/291.72 -1-2*k_1+C (+/+!), -3+C-4*k_3 (+/+!), 80+15*k_1+20*k_3 (+), k_3 (+/+!), 3+2*k_1-C (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {C==2+2*k_1} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 -1+2*k_1-4*k_3 (+/+!), 1 (+/+!), 80+15*k_1+20*k_3 (+), k_3 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {k_3==1} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 1 (+/+!), -5+2*k_1 (+/+!), 100+15*k_1 (+) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (B), deleting 1 (+/+!) 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 -5+2*k_1 (+/+!), 100+15*k_1 (+) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 removing all constraints (solved by SMT) 669.01/291.72 669.01/291.72 resulting limit problem: [solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {k_1==n} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 [solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 Solved the limit problem by the following transformations: 669.01/291.72 669.01/291.72 Created initial limit problem: 669.01/291.72 669.01/291.72 -1-2*k_1+C (+/+!), -3+C-4*k_3 (+/+!), 80+15*k_1+20*k_3 (+), k_3 (+/+!), 3+2*k_1-C (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {C==2+2*k_1} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 -1+2*k_1-4*k_3 (+/+!), 1 (+/+!), 80+15*k_1+20*k_3 (+), k_3 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (B), deleting 1 (+/+!) 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 -1+2*k_1-4*k_3 (+/+!), 80+15*k_1+20*k_3 (+), k_3 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 removing all constraints (solved by SMT) 669.01/291.72 669.01/291.72 resulting limit problem: [solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {k_1==n,k_3==1} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 [solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 Solution: 669.01/291.72 669.01/291.72 k_1 / n 669.01/291.72 669.01/291.72 C / 2+2*n 669.01/291.72 669.01/291.72 k_3 / 1 669.01/291.72 669.01/291.72 Resulting cost 100+15*n has complexity: Poly(n^1) 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 Computing asymptotic complexity for rule 452 669.01/291.72 669.01/291.72 Simplified the guard: 669.01/291.72 669.01/291.72 452: evalsipmamergesort2start -> [109] : A'=1, [ 2+2*k-C==0 && k_2>0 && C-4*k_2>=1 ], cost: 68+15*k+20*k_2 669.01/291.72 669.01/291.72 Solved the limit problem by the following transformations: 669.01/291.72 669.01/291.72 Created initial limit problem: 669.01/291.72 669.01/291.72 -1-2*k+C (+/+!), 68+15*k+20*k_2 (+), 3+2*k-C (+/+!), C-4*k_2 (+/+!), k_2 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {C==2+2*k} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 1 (+/+!), 2+2*k-4*k_2 (+/+!), 68+15*k+20*k_2 (+), k_2 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {k_2==1} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 1 (+/+!), 88+15*k (+), -2+2*k (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (B), deleting 1 (+/+!) 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 88+15*k (+), -2+2*k (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 removing all constraints (solved by SMT) 669.01/291.72 669.01/291.72 resulting limit problem: [solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {k==n} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 [solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 Solved the limit problem by the following transformations: 669.01/291.72 669.01/291.72 Created initial limit problem: 669.01/291.72 669.01/291.72 -1-2*k+C (+/+!), 68+15*k+20*k_2 (+), 3+2*k-C (+/+!), C-4*k_2 (+/+!), k_2 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {C==2+2*k} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 1 (+/+!), 2+2*k-4*k_2 (+/+!), 68+15*k+20*k_2 (+), k_2 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (B), deleting 1 (+/+!) 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 2+2*k-4*k_2 (+/+!), 68+15*k+20*k_2 (+), k_2 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 removing all constraints (solved by SMT) 669.01/291.72 669.01/291.72 resulting limit problem: [solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {k==n,k_2==1} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 [solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 Solution: 669.01/291.72 669.01/291.72 k / n 669.01/291.72 669.01/291.72 C / 2+2*n 669.01/291.72 669.01/291.72 k_2 / 1 669.01/291.72 669.01/291.72 Resulting cost 88+15*n has complexity: Poly(n^1) 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 Computing asymptotic complexity for rule 453 669.01/291.72 669.01/291.72 Simplified the guard: 669.01/291.72 669.01/291.72 453: evalsipmamergesort2start -> [109] : A'=1, [ 2+2*k_1-C==0 && k_2>0 && C-4*k_2>=1 ], cost: 68+15*k_1+20*k_2 669.01/291.72 669.01/291.72 Solved the limit problem by the following transformations: 669.01/291.72 669.01/291.72 Created initial limit problem: 669.01/291.72 669.01/291.72 68+15*k_1+20*k_2 (+), -1-2*k_1+C (+/+!), 3+2*k_1-C (+/+!), C-4*k_2 (+/+!), k_2 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {C==2+2*k_1} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 68+15*k_1+20*k_2 (+), 1 (+/+!), 2+2*k_1-4*k_2 (+/+!), k_2 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {k_2==1} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 1 (+/+!), 88+15*k_1 (+), -2+2*k_1 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (B), deleting 1 (+/+!) 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 88+15*k_1 (+), -2+2*k_1 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 removing all constraints (solved by SMT) 669.01/291.72 669.01/291.72 resulting limit problem: [solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {k_1==n} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 [solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 Solved the limit problem by the following transformations: 669.01/291.72 669.01/291.72 Created initial limit problem: 669.01/291.72 669.01/291.72 68+15*k_1+20*k_2 (+), -1-2*k_1+C (+/+!), 3+2*k_1-C (+/+!), C-4*k_2 (+/+!), k_2 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {C==2+2*k_1} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 68+15*k_1+20*k_2 (+), 1 (+/+!), 2+2*k_1-4*k_2 (+/+!), k_2 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (B), deleting 1 (+/+!) 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 68+15*k_1+20*k_2 (+), 2+2*k_1-4*k_2 (+/+!), k_2 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 removing all constraints (solved by SMT) 669.01/291.72 669.01/291.72 resulting limit problem: [solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {k_1==n,k_2==1} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 [solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 Solution: 669.01/291.72 669.01/291.72 k_1 / n 669.01/291.72 669.01/291.72 C / 2+2*n 669.01/291.72 669.01/291.72 k_2 / 1 669.01/291.72 669.01/291.72 Resulting cost 88+15*n has complexity: Poly(n^1) 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 Computing asymptotic complexity for rule 454 669.01/291.72 669.01/291.72 Simplified the guard: 669.01/291.72 669.01/291.72 454: evalsipmamergesort2start -> [109] : A'=1, [ 2+2*k_1-C==0 && k_3>0 && C-4*k_3>=1 ], cost: 68+15*k_1+20*k_3 669.01/291.72 669.01/291.72 Solved the limit problem by the following transformations: 669.01/291.72 669.01/291.72 Created initial limit problem: 669.01/291.72 669.01/291.72 -1-2*k_1+C (+/+!), C-4*k_3 (+/+!), 68+15*k_1+20*k_3 (+), k_3 (+/+!), 3+2*k_1-C (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {C==2+2*k_1} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 1 (+/+!), 68+15*k_1+20*k_3 (+), k_3 (+/+!), 2+2*k_1-4*k_3 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {k_3==1} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 1 (+/+!), 88+15*k_1 (+), -2+2*k_1 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (B), deleting 1 (+/+!) 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 88+15*k_1 (+), -2+2*k_1 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 removing all constraints (solved by SMT) 669.01/291.72 669.01/291.72 resulting limit problem: [solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {k_1==n} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 [solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 Solved the limit problem by the following transformations: 669.01/291.72 669.01/291.72 Created initial limit problem: 669.01/291.72 669.01/291.72 -1-2*k_1+C (+/+!), C-4*k_3 (+/+!), 68+15*k_1+20*k_3 (+), k_3 (+/+!), 3+2*k_1-C (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {C==2+2*k_1} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 1 (+/+!), 68+15*k_1+20*k_3 (+), k_3 (+/+!), 2+2*k_1-4*k_3 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (B), deleting 1 (+/+!) 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 68+15*k_1+20*k_3 (+), k_3 (+/+!), 2+2*k_1-4*k_3 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 removing all constraints (solved by SMT) 669.01/291.72 669.01/291.72 resulting limit problem: [solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {k_1==2*n,k_3==n} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 [solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 Solution: 669.01/291.72 669.01/291.72 k_1 / n 669.01/291.72 669.01/291.72 C / 2+2*n 669.01/291.72 669.01/291.72 k_3 / 1 669.01/291.72 669.01/291.72 Resulting cost 88+15*n has complexity: Poly(n^1) 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 Computing asymptotic complexity for rule 457 669.01/291.72 669.01/291.72 Simplified the guard: 669.01/291.72 669.01/291.72 457: evalsipmamergesort2start -> [98] : A'=4, B'=C, D'=-8+C, E'=0, F'=4, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=0, N'=2, O'=0, P'=0, Q_1'=4, [ 2+2*k-C==0 && k_2>0 && 4-C+4*k_2==0 ], cost: 116+15*k+20*k_2 669.01/291.72 669.01/291.72 Solved the limit problem by the following transformations: 669.01/291.72 669.01/291.72 Created initial limit problem: 669.01/291.72 669.01/291.72 5-C+4*k_2 (+/+!), 116+15*k+20*k_2 (+), -1-2*k+C (+/+!), 3+2*k-C (+/+!), k_2 (+/+!), -3+C-4*k_2 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {C==2+2*k} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 3-2*k+4*k_2 (+/+!), 1 (+/+!), 116+15*k+20*k_2 (+), -1+2*k-4*k_2 (+/+!), k_2 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {C==4+4*k_2} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 3-2*k+4*k_2 (+/+!), 1 (+/+!), 116+15*k+20*k_2 (+), -1+2*k-4*k_2 (+/+!), k_2 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (B), deleting 1 (+/+!) 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 3-2*k+4*k_2 (+/+!), 116+15*k+20*k_2 (+), -1+2*k-4*k_2 (+/+!), k_2 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 removing all constraints (solved by SMT) 669.01/291.72 669.01/291.72 resulting limit problem: [solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {k==1+2*n,k_2==n} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 [solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 Solution: 669.01/291.72 669.01/291.72 k / 1+2*n 669.01/291.72 669.01/291.72 C / 4+4*n 669.01/291.72 669.01/291.72 k_2 / n 669.01/291.72 669.01/291.72 Resulting cost 131+50*n has complexity: Poly(n^1) 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 Computing asymptotic complexity for rule 469 669.01/291.72 669.01/291.72 Simplified the guard: 669.01/291.72 669.01/291.72 469: evalsipmamergesort2start -> [98] : A'=4, B'=-8*k_1+C, D'=-8-8*k_1+C, E'=0, F'=4, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=2, N'=0, O'=0, P'=0, Q_1'=4, [ 2+2*k-C==0 && 4-C+4*k_2==0 && k_1>0 && -8*k_1+C>=8 ], cost: 116+30*k_1+15*k+20*k_2 669.01/291.72 669.01/291.72 Solved the limit problem by the following transformations: 669.01/291.72 669.01/291.72 Created initial limit problem: 669.01/291.72 669.01/291.72 5-C+4*k_2 (+/+!), k_1 (+/+!), -7-8*k_1+C (+/+!), -1-2*k+C (+/+!), 116+30*k_1+15*k+20*k_2 (+), 3+2*k-C (+/+!), -3+C-4*k_2 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {C==2+2*k} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 3-2*k+4*k_2 (+/+!), -5-8*k_1+2*k (+/+!), 1 (+/+!), k_1 (+/+!), 116+30*k_1+15*k+20*k_2 (+), -1+2*k-4*k_2 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {C==4+4*k_2} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 3-2*k+4*k_2 (+/+!), -5-8*k_1+2*k (+/+!), 1 (+/+!), k_1 (+/+!), 116+30*k_1+15*k+20*k_2 (+), -1+2*k-4*k_2 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {k_1==1} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 3-2*k+4*k_2 (+/+!), 1 (+/+!), -13+2*k (+/+!), 146+15*k+20*k_2 (+), -1+2*k-4*k_2 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (B), deleting 1 (+/+!) 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 3-2*k+4*k_2 (+/+!), -13+2*k (+/+!), 146+15*k+20*k_2 (+), -1+2*k-4*k_2 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 removing all constraints (solved by SMT) 669.01/291.72 669.01/291.72 resulting limit problem: [solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {k==-1+2*n,k_2==-1+n} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 [solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 Solved the limit problem by the following transformations: 669.01/291.72 669.01/291.72 Created initial limit problem: 669.01/291.72 669.01/291.72 5-C+4*k_2 (+/+!), k_1 (+/+!), -7-8*k_1+C (+/+!), -1-2*k+C (+/+!), 116+30*k_1+15*k+20*k_2 (+), 3+2*k-C (+/+!), -3+C-4*k_2 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {C==2+2*k} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 3-2*k+4*k_2 (+/+!), -5-8*k_1+2*k (+/+!), 1 (+/+!), k_1 (+/+!), 116+30*k_1+15*k+20*k_2 (+), -1+2*k-4*k_2 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {C==4+4*k_2} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 3-2*k+4*k_2 (+/+!), -5-8*k_1+2*k (+/+!), 1 (+/+!), k_1 (+/+!), 116+30*k_1+15*k+20*k_2 (+), -1+2*k-4*k_2 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (B), deleting 1 (+/+!) 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 3-2*k+4*k_2 (+/+!), -5-8*k_1+2*k (+/+!), k_1 (+/+!), 116+30*k_1+15*k+20*k_2 (+), -1+2*k-4*k_2 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 removing all constraints (solved by SMT) 669.01/291.72 669.01/291.72 resulting limit problem: [solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {k_1==1,k==-1+2*n,k_2==-1+n} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 [solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 Solution: 669.01/291.72 669.01/291.72 k_1 / 1 669.01/291.72 669.01/291.72 k / -1+2*n 669.01/291.72 669.01/291.72 C / 4*n 669.01/291.72 669.01/291.72 k_2 / -1+n 669.01/291.72 669.01/291.72 Resulting cost 111+50*n has complexity: Poly(n^1) 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 Computing asymptotic complexity for rule 471 669.01/291.72 669.01/291.72 Simplified the guard: 669.01/291.72 669.01/291.72 471: evalsipmamergesort2start -> [108] : A'=4, B'=-2*k+C, D'=-2-2*k+C, E'=0, F'=1, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=2, N'=0, O'=0, P'=0, Q_1'=4, [ 2+2*k-C==0 && 4-C+4*k_2==0 && k_1>0 && -8*k_1+C>=1 ], cost: 94+30*k_1+15*k+20*k_2 669.01/291.72 669.01/291.72 Solved the limit problem by the following transformations: 669.01/291.72 669.01/291.72 Created initial limit problem: 669.01/291.72 669.01/291.72 -8*k_1+C (+/+!), 5-C+4*k_2 (+/+!), k_1 (+/+!), -1-2*k+C (+/+!), 94+30*k_1+15*k+20*k_2 (+), 3+2*k-C (+/+!), -3+C-4*k_2 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {C==2+2*k} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 3-2*k+4*k_2 (+/+!), 2-8*k_1+2*k (+/+!), 1 (+/+!), k_1 (+/+!), 94+30*k_1+15*k+20*k_2 (+), -1+2*k-4*k_2 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {C==4+4*k_2} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 3-2*k+4*k_2 (+/+!), 2-8*k_1+2*k (+/+!), 1 (+/+!), k_1 (+/+!), 94+30*k_1+15*k+20*k_2 (+), -1+2*k-4*k_2 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {k_1==1} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 3-2*k+4*k_2 (+/+!), -6+2*k (+/+!), 1 (+/+!), 124+15*k+20*k_2 (+), -1+2*k-4*k_2 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (B), deleting 1 (+/+!) 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 3-2*k+4*k_2 (+/+!), -6+2*k (+/+!), 124+15*k+20*k_2 (+), -1+2*k-4*k_2 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 removing all constraints (solved by SMT) 669.01/291.72 669.01/291.72 resulting limit problem: [solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {k==-1+2*n,k_2==-1+n} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 [solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 Solved the limit problem by the following transformations: 669.01/291.72 669.01/291.72 Created initial limit problem: 669.01/291.72 669.01/291.72 -8*k_1+C (+/+!), 5-C+4*k_2 (+/+!), k_1 (+/+!), -1-2*k+C (+/+!), 94+30*k_1+15*k+20*k_2 (+), 3+2*k-C (+/+!), -3+C-4*k_2 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {C==2+2*k} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 3-2*k+4*k_2 (+/+!), 2-8*k_1+2*k (+/+!), 1 (+/+!), k_1 (+/+!), 94+30*k_1+15*k+20*k_2 (+), -1+2*k-4*k_2 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {C==4+4*k_2} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 3-2*k+4*k_2 (+/+!), 2-8*k_1+2*k (+/+!), 1 (+/+!), k_1 (+/+!), 94+30*k_1+15*k+20*k_2 (+), -1+2*k-4*k_2 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (B), deleting 1 (+/+!) 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 3-2*k+4*k_2 (+/+!), 2-8*k_1+2*k (+/+!), k_1 (+/+!), 94+30*k_1+15*k+20*k_2 (+), -1+2*k-4*k_2 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 removing all constraints (solved by SMT) 669.01/291.72 669.01/291.72 resulting limit problem: [solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {k_1==1,k==-1+2*n,k_2==-1+n} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 [solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 Solution: 669.01/291.72 669.01/291.72 k_1 / 1 669.01/291.72 669.01/291.72 k / -1+2*n 669.01/291.72 669.01/291.72 C / 4*n 669.01/291.72 669.01/291.72 k_2 / -1+n 669.01/291.72 669.01/291.72 Resulting cost 89+50*n has complexity: Poly(n^1) 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 Computing asymptotic complexity for rule 472 669.01/291.72 669.01/291.72 Simplified the guard: 669.01/291.72 669.01/291.72 472: evalsipmamergesort2start -> [99] : A'=4, B'=-8*k_1+C, D'=-8-8*k_1+C, E'=0, F'=4, G'=0, H'=0, Q'=8, K'=C-16*k_3, L'=-16+C-16*k_3, M'=0, N'=8, O'=0, P'=0, Q_1'=4, [ 2+2*k-C==0 && 4-C+4*k_2==0 && 8+8*k_1-C==0 && k_3>0 && C-16*k_3>=16 ], cost: 193+30*k_1+15*k+50*k_3+20*k_2 669.01/291.72 669.01/291.72 Solved the limit problem by the following transformations: 669.01/291.72 669.01/291.72 Created initial limit problem: 669.01/291.72 669.01/291.72 5-C+4*k_2 (+/+!), -15+C-16*k_3 (+/+!), 9+8*k_1-C (+/+!), -7-8*k_1+C (+/+!), -1-2*k+C (+/+!), 193+30*k_1+15*k+50*k_3+20*k_2 (+), k_3 (+/+!), 3+2*k-C (+/+!), -3+C-4*k_2 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {C==2+2*k} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 3-2*k+4*k_2 (+/+!), -5-8*k_1+2*k (+/+!), 1 (+/+!), 7+8*k_1-2*k (+/+!), 193+30*k_1+15*k+50*k_3+20*k_2 (+), k_3 (+/+!), -13+2*k-16*k_3 (+/+!), -1+2*k-4*k_2 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {C==4+4*k_2} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 3-2*k+4*k_2 (+/+!), -5-8*k_1+2*k (+/+!), 1 (+/+!), 7+8*k_1-2*k (+/+!), 193+30*k_1+15*k+50*k_3+20*k_2 (+), k_3 (+/+!), -13+2*k-16*k_3 (+/+!), -1+2*k-4*k_2 (+/+!) [not solved] 669.01/291.72 669.01/291.72 669.01/291.72 669.01/291.72 applying transformation rule (C) using substitution {C==8+8*k_1} 669.01/291.72 669.01/291.72 resulting limit problem: 669.01/291.72 669.01/291.72 3-2*k+4*k_2 (+/+!), -5-8*k_1+2*k (+/+!), 1 (+/+!), 7+8*k_1-2*k (+/+!), 193+30*k_1+15*k+50*k_3+20*k_2 (+), k_3 (+/+!), -13+2*k-16*k_3 (+/+!), -1+2*k-4*k_2 (+/+!) [not solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 applying transformation rule (C) using substitution {k_3==1} 669.01/291.73 669.01/291.73 resulting limit problem: 669.01/291.73 669.01/291.73 3-2*k+4*k_2 (+/+!), -5-8*k_1+2*k (+/+!), 1 (+/+!), 7+8*k_1-2*k (+/+!), -29+2*k (+/+!), 243+30*k_1+15*k+20*k_2 (+), -1+2*k-4*k_2 (+/+!) [not solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 applying transformation rule (B), deleting 1 (+/+!) 669.01/291.73 669.01/291.73 resulting limit problem: 669.01/291.73 669.01/291.73 3-2*k+4*k_2 (+/+!), -5-8*k_1+2*k (+/+!), 7+8*k_1-2*k (+/+!), -29+2*k (+/+!), 243+30*k_1+15*k+20*k_2 (+), -1+2*k-4*k_2 (+/+!) [not solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 removing all constraints (solved by SMT) 669.01/291.73 669.01/291.73 resulting limit problem: [solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 applying transformation rule (C) using substitution {k_1==-1+n,k==-1+4*n,k_2==-1+2*n} 669.01/291.73 669.01/291.73 resulting limit problem: 669.01/291.73 669.01/291.73 [solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 Solved the limit problem by the following transformations: 669.01/291.73 669.01/291.73 Created initial limit problem: 669.01/291.73 669.01/291.73 5-C+4*k_2 (+/+!), -15+C-16*k_3 (+/+!), 9+8*k_1-C (+/+!), -7-8*k_1+C (+/+!), -1-2*k+C (+/+!), 193+30*k_1+15*k+50*k_3+20*k_2 (+), k_3 (+/+!), 3+2*k-C (+/+!), -3+C-4*k_2 (+/+!) [not solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 applying transformation rule (C) using substitution {C==2+2*k} 669.01/291.73 669.01/291.73 resulting limit problem: 669.01/291.73 669.01/291.73 3-2*k+4*k_2 (+/+!), -5-8*k_1+2*k (+/+!), 1 (+/+!), 7+8*k_1-2*k (+/+!), 193+30*k_1+15*k+50*k_3+20*k_2 (+), k_3 (+/+!), -13+2*k-16*k_3 (+/+!), -1+2*k-4*k_2 (+/+!) [not solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 applying transformation rule (C) using substitution {C==4+4*k_2} 669.01/291.73 669.01/291.73 resulting limit problem: 669.01/291.73 669.01/291.73 3-2*k+4*k_2 (+/+!), -5-8*k_1+2*k (+/+!), 1 (+/+!), 7+8*k_1-2*k (+/+!), 193+30*k_1+15*k+50*k_3+20*k_2 (+), k_3 (+/+!), -13+2*k-16*k_3 (+/+!), -1+2*k-4*k_2 (+/+!) [not solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 applying transformation rule (C) using substitution {C==8+8*k_1} 669.01/291.73 669.01/291.73 resulting limit problem: 669.01/291.73 669.01/291.73 3-2*k+4*k_2 (+/+!), -5-8*k_1+2*k (+/+!), 1 (+/+!), 7+8*k_1-2*k (+/+!), 193+30*k_1+15*k+50*k_3+20*k_2 (+), k_3 (+/+!), -13+2*k-16*k_3 (+/+!), -1+2*k-4*k_2 (+/+!) [not solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 applying transformation rule (B), deleting 1 (+/+!) 669.01/291.73 669.01/291.73 resulting limit problem: 669.01/291.73 669.01/291.73 3-2*k+4*k_2 (+/+!), -5-8*k_1+2*k (+/+!), 7+8*k_1-2*k (+/+!), 193+30*k_1+15*k+50*k_3+20*k_2 (+), k_3 (+/+!), -13+2*k-16*k_3 (+/+!), -1+2*k-4*k_2 (+/+!) [not solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 removing all constraints (solved by SMT) 669.01/291.73 669.01/291.73 resulting limit problem: [solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 applying transformation rule (C) using substitution {k_1==3+2*n,k==15+8*n,k_3==1+n,k_2==7+4*n} 669.01/291.73 669.01/291.73 resulting limit problem: 669.01/291.73 669.01/291.73 [solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 Solution: 669.01/291.73 669.01/291.73 k_1 / -1+n 669.01/291.73 669.01/291.73 k / -1+4*n 669.01/291.73 669.01/291.73 C / 8*n 669.01/291.73 669.01/291.73 k_3 / 1 669.01/291.73 669.01/291.73 k_2 / -1+2*n 669.01/291.73 669.01/291.73 Resulting cost 178+130*n has complexity: Poly(n^1) 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 Computing asymptotic complexity for rule 474 669.01/291.73 669.01/291.73 Simplified the guard: 669.01/291.73 669.01/291.73 474: evalsipmamergesort2start -> [109] : A'=4, B'=-2*k+C, D'=-2-2*k+C, E'=0, F'=1, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=2, N'=0, O'=0, P'=0, Q_1'=4, [ 2+2*k-C==0 && 4-C+4*k_2==0 && 8+8*k_1-C==0 && k_3>0 && C-16*k_3>=1 ], cost: 151+30*k_1+15*k+50*k_3+20*k_2 669.01/291.73 669.01/291.73 Solved the limit problem by the following transformations: 669.01/291.73 669.01/291.73 Created initial limit problem: 669.01/291.73 669.01/291.73 5-C+4*k_2 (+/+!), C-16*k_3 (+/+!), 9+8*k_1-C (+/+!), -7-8*k_1+C (+/+!), -1-2*k+C (+/+!), k_3 (+/+!), 3+2*k-C (+/+!), -3+C-4*k_2 (+/+!), 151+30*k_1+15*k+50*k_3+20*k_2 (+) [not solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 applying transformation rule (C) using substitution {C==2+2*k} 669.01/291.73 669.01/291.73 resulting limit problem: 669.01/291.73 669.01/291.73 3-2*k+4*k_2 (+/+!), -5-8*k_1+2*k (+/+!), 1 (+/+!), 7+8*k_1-2*k (+/+!), 2+2*k-16*k_3 (+/+!), k_3 (+/+!), -1+2*k-4*k_2 (+/+!), 151+30*k_1+15*k+50*k_3+20*k_2 (+) [not solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 applying transformation rule (C) using substitution {C==4+4*k_2} 669.01/291.73 669.01/291.73 resulting limit problem: 669.01/291.73 669.01/291.73 3-2*k+4*k_2 (+/+!), -5-8*k_1+2*k (+/+!), 1 (+/+!), 7+8*k_1-2*k (+/+!), 2+2*k-16*k_3 (+/+!), k_3 (+/+!), -1+2*k-4*k_2 (+/+!), 151+30*k_1+15*k+50*k_3+20*k_2 (+) [not solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 applying transformation rule (C) using substitution {C==8+8*k_1} 669.01/291.73 669.01/291.73 resulting limit problem: 669.01/291.73 669.01/291.73 3-2*k+4*k_2 (+/+!), -5-8*k_1+2*k (+/+!), 1 (+/+!), 7+8*k_1-2*k (+/+!), 2+2*k-16*k_3 (+/+!), k_3 (+/+!), -1+2*k-4*k_2 (+/+!), 151+30*k_1+15*k+50*k_3+20*k_2 (+) [not solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 applying transformation rule (C) using substitution {k_3==1} 669.01/291.73 669.01/291.73 resulting limit problem: 669.01/291.73 669.01/291.73 3-2*k+4*k_2 (+/+!), -5-8*k_1+2*k (+/+!), 1 (+/+!), 7+8*k_1-2*k (+/+!), 201+30*k_1+15*k+20*k_2 (+), -14+2*k (+/+!), -1+2*k-4*k_2 (+/+!) [not solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 applying transformation rule (B), deleting 1 (+/+!) 669.01/291.73 669.01/291.73 resulting limit problem: 669.01/291.73 669.01/291.73 3-2*k+4*k_2 (+/+!), -5-8*k_1+2*k (+/+!), 7+8*k_1-2*k (+/+!), 201+30*k_1+15*k+20*k_2 (+), -14+2*k (+/+!), -1+2*k-4*k_2 (+/+!) [not solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 removing all constraints (solved by SMT) 669.01/291.73 669.01/291.73 resulting limit problem: [solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 applying transformation rule (C) using substitution {k_1==-1+n,k==-1+4*n,k_2==-1+2*n} 669.01/291.73 669.01/291.73 resulting limit problem: 669.01/291.73 669.01/291.73 [solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 Solved the limit problem by the following transformations: 669.01/291.73 669.01/291.73 Created initial limit problem: 669.01/291.73 669.01/291.73 5-C+4*k_2 (+/+!), C-16*k_3 (+/+!), 9+8*k_1-C (+/+!), -7-8*k_1+C (+/+!), -1-2*k+C (+/+!), k_3 (+/+!), 3+2*k-C (+/+!), -3+C-4*k_2 (+/+!), 151+30*k_1+15*k+50*k_3+20*k_2 (+) [not solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 applying transformation rule (C) using substitution {C==2+2*k} 669.01/291.73 669.01/291.73 resulting limit problem: 669.01/291.73 669.01/291.73 3-2*k+4*k_2 (+/+!), -5-8*k_1+2*k (+/+!), 1 (+/+!), 7+8*k_1-2*k (+/+!), 2+2*k-16*k_3 (+/+!), k_3 (+/+!), -1+2*k-4*k_2 (+/+!), 151+30*k_1+15*k+50*k_3+20*k_2 (+) [not solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 applying transformation rule (C) using substitution {C==4+4*k_2} 669.01/291.73 669.01/291.73 resulting limit problem: 669.01/291.73 669.01/291.73 3-2*k+4*k_2 (+/+!), -5-8*k_1+2*k (+/+!), 1 (+/+!), 7+8*k_1-2*k (+/+!), 2+2*k-16*k_3 (+/+!), k_3 (+/+!), -1+2*k-4*k_2 (+/+!), 151+30*k_1+15*k+50*k_3+20*k_2 (+) [not solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 applying transformation rule (C) using substitution {C==8+8*k_1} 669.01/291.73 669.01/291.73 resulting limit problem: 669.01/291.73 669.01/291.73 3-2*k+4*k_2 (+/+!), -5-8*k_1+2*k (+/+!), 1 (+/+!), 7+8*k_1-2*k (+/+!), 2+2*k-16*k_3 (+/+!), k_3 (+/+!), -1+2*k-4*k_2 (+/+!), 151+30*k_1+15*k+50*k_3+20*k_2 (+) [not solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 applying transformation rule (B), deleting 1 (+/+!) 669.01/291.73 669.01/291.73 resulting limit problem: 669.01/291.73 669.01/291.73 3-2*k+4*k_2 (+/+!), -5-8*k_1+2*k (+/+!), 7+8*k_1-2*k (+/+!), 2+2*k-16*k_3 (+/+!), k_3 (+/+!), -1+2*k-4*k_2 (+/+!), 151+30*k_1+15*k+50*k_3+20*k_2 (+) [not solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 removing all constraints (solved by SMT) 669.01/291.73 669.01/291.73 resulting limit problem: [solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 applying transformation rule (C) using substitution {k_1==1+n,k==7+4*n,k_3==1,k_2==3+2*n} 669.01/291.73 669.01/291.73 resulting limit problem: 669.01/291.73 669.01/291.73 [solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 Solution: 669.01/291.73 669.01/291.73 k_1 / -1+n 669.01/291.73 669.01/291.73 k / -1+4*n 669.01/291.73 669.01/291.73 C / 8*n 669.01/291.73 669.01/291.73 k_3 / 1 669.01/291.73 669.01/291.73 k_2 / -1+2*n 669.01/291.73 669.01/291.73 Resulting cost 136+130*n has complexity: Poly(n^1) 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 Computing asymptotic complexity for rule 476 669.01/291.73 669.01/291.73 Simplified the guard: 669.01/291.73 669.01/291.73 476: evalsipmamergesort2start -> evalsipmamergesort2bb26in : A'=4, B'=C, D'=-8+C, E'=4, F'=0, G'=0, H'=0, Q'=8, J'=0, K'=C-4*k_2, L'=-4+C-4*k_2, M'=2, N'=0, O'=0, P'=0, Q_1'=4, R'=1+C, [ 2+2*k-C==0 && k_2>0 && 4-C+4*k_2==0 && 0>=-8+C ], cost: 130+15*k+2*C+20*k_2 669.01/291.73 669.01/291.73 Could not solve the limit problem. 669.01/291.73 669.01/291.73 Resulting cost 0 has complexity: Unknown 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 Computing asymptotic complexity for rule 477 669.01/291.73 669.01/291.73 Simplified the guard: 669.01/291.73 669.01/291.73 477: evalsipmamergesort2start -> [98] : A'=4, B'=C, D'=-8+C, E'=0, F'=4, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=2, N'=0, O'=0, P'=0, Q_1'=4, [ 2+2*k_1-C==0 && k_2>0 && 4-C+4*k_2==0 ], cost: 116+15*k_1+20*k_2 669.01/291.73 669.01/291.73 Solved the limit problem by the following transformations: 669.01/291.73 669.01/291.73 Created initial limit problem: 669.01/291.73 669.01/291.73 5-C+4*k_2 (+/+!), -1-2*k_1+C (+/+!), 116+15*k_1+20*k_2 (+), 3+2*k_1-C (+/+!), k_2 (+/+!), -3+C-4*k_2 (+/+!) [not solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 applying transformation rule (C) using substitution {C==2+2*k_1} 669.01/291.73 669.01/291.73 resulting limit problem: 669.01/291.73 669.01/291.73 1 (+/+!), 116+15*k_1+20*k_2 (+), 3-2*k_1+4*k_2 (+/+!), -1+2*k_1-4*k_2 (+/+!), k_2 (+/+!) [not solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 applying transformation rule (C) using substitution {C==4+4*k_2} 669.01/291.73 669.01/291.73 resulting limit problem: 669.01/291.73 669.01/291.73 1 (+/+!), 116+15*k_1+20*k_2 (+), 3-2*k_1+4*k_2 (+/+!), -1+2*k_1-4*k_2 (+/+!), k_2 (+/+!) [not solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 applying transformation rule (B), deleting 1 (+/+!) 669.01/291.73 669.01/291.73 resulting limit problem: 669.01/291.73 669.01/291.73 116+15*k_1+20*k_2 (+), 3-2*k_1+4*k_2 (+/+!), -1+2*k_1-4*k_2 (+/+!), k_2 (+/+!) [not solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 removing all constraints (solved by SMT) 669.01/291.73 669.01/291.73 resulting limit problem: [solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 applying transformation rule (C) using substitution {k_1==1+2*n,k_2==n} 669.01/291.73 669.01/291.73 resulting limit problem: 669.01/291.73 669.01/291.73 [solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 Solution: 669.01/291.73 669.01/291.73 k_1 / 1+2*n 669.01/291.73 669.01/291.73 C / 4+4*n 669.01/291.73 669.01/291.73 k_2 / n 669.01/291.73 669.01/291.73 Resulting cost 131+50*n has complexity: Poly(n^1) 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 Computing asymptotic complexity for rule 479 669.01/291.73 669.01/291.73 Simplified the guard: 669.01/291.73 669.01/291.73 479: evalsipmamergesort2start -> [98] : A'=4, B'=-8*k+C, D'=-8-8*k+C, E'=0, F'=4, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=2, N'=0, O'=0, P'=0, Q_1'=4, [ 2+2*k_1-C==0 && 4-C+4*k_2==0 && k>0 && -8*k+C>=8 ], cost: 116+15*k_1+30*k+20*k_2 669.01/291.73 669.01/291.73 Solved the limit problem by the following transformations: 669.01/291.73 669.01/291.73 Created initial limit problem: 669.01/291.73 669.01/291.73 5-C+4*k_2 (+/+!), -1-2*k_1+C (+/+!), -7-8*k+C (+/+!), k (+/+!), 116+15*k_1+30*k+20*k_2 (+), 3+2*k_1-C (+/+!), -3+C-4*k_2 (+/+!) [not solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 applying transformation rule (C) using substitution {C==2+2*k_1} 669.01/291.73 669.01/291.73 resulting limit problem: 669.01/291.73 669.01/291.73 1 (+/+!), k (+/+!), 3-2*k_1+4*k_2 (+/+!), 116+15*k_1+30*k+20*k_2 (+), -1+2*k_1-4*k_2 (+/+!), -5+2*k_1-8*k (+/+!) [not solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 applying transformation rule (C) using substitution {C==4+4*k_2} 669.01/291.73 669.01/291.73 resulting limit problem: 669.01/291.73 669.01/291.73 1 (+/+!), k (+/+!), 3-2*k_1+4*k_2 (+/+!), 116+15*k_1+30*k+20*k_2 (+), -1+2*k_1-4*k_2 (+/+!), -5+2*k_1-8*k (+/+!) [not solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 applying transformation rule (C) using substitution {k==1} 669.01/291.73 669.01/291.73 resulting limit problem: 669.01/291.73 669.01/291.73 1 (+/+!), 146+15*k_1+20*k_2 (+), 3-2*k_1+4*k_2 (+/+!), -1+2*k_1-4*k_2 (+/+!), -13+2*k_1 (+/+!) [not solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 applying transformation rule (B), deleting 1 (+/+!) 669.01/291.73 669.01/291.73 resulting limit problem: 669.01/291.73 669.01/291.73 146+15*k_1+20*k_2 (+), 3-2*k_1+4*k_2 (+/+!), -1+2*k_1-4*k_2 (+/+!), -13+2*k_1 (+/+!) [not solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 removing all constraints (solved by SMT) 669.01/291.73 669.01/291.73 resulting limit problem: [solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 applying transformation rule (C) using substitution {k_1==1+2*n,k_2==n} 669.01/291.73 669.01/291.73 resulting limit problem: 669.01/291.73 669.01/291.73 [solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 Solved the limit problem by the following transformations: 669.01/291.73 669.01/291.73 Created initial limit problem: 669.01/291.73 669.01/291.73 5-C+4*k_2 (+/+!), -1-2*k_1+C (+/+!), -7-8*k+C (+/+!), k (+/+!), 116+15*k_1+30*k+20*k_2 (+), 3+2*k_1-C (+/+!), -3+C-4*k_2 (+/+!) [not solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 applying transformation rule (C) using substitution {C==2+2*k_1} 669.01/291.73 669.01/291.73 resulting limit problem: 669.01/291.73 669.01/291.73 1 (+/+!), k (+/+!), 3-2*k_1+4*k_2 (+/+!), 116+15*k_1+30*k+20*k_2 (+), -1+2*k_1-4*k_2 (+/+!), -5+2*k_1-8*k (+/+!) [not solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 applying transformation rule (C) using substitution {C==4+4*k_2} 669.01/291.73 669.01/291.73 resulting limit problem: 669.01/291.73 669.01/291.73 1 (+/+!), k (+/+!), 3-2*k_1+4*k_2 (+/+!), 116+15*k_1+30*k+20*k_2 (+), -1+2*k_1-4*k_2 (+/+!), -5+2*k_1-8*k (+/+!) [not solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 applying transformation rule (B), deleting 1 (+/+!) 669.01/291.73 669.01/291.73 resulting limit problem: 669.01/291.73 669.01/291.73 k (+/+!), 3-2*k_1+4*k_2 (+/+!), 116+15*k_1+30*k+20*k_2 (+), -1+2*k_1-4*k_2 (+/+!), -5+2*k_1-8*k (+/+!) [not solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 removing all constraints (solved by SMT) 669.01/291.73 669.01/291.73 resulting limit problem: [solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 applying transformation rule (C) using substitution {k_1==-1+6*n,k==n,k_2==-1+3*n} 669.01/291.73 669.01/291.73 resulting limit problem: 669.01/291.73 669.01/291.73 [solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 Solution: 669.01/291.73 669.01/291.73 k_1 / 1+2*n 669.01/291.73 669.01/291.73 k / 1 669.01/291.73 669.01/291.73 C / 4+4*n 669.01/291.73 669.01/291.73 k_2 / n 669.01/291.73 669.01/291.73 Resulting cost 161+50*n has complexity: Poly(n^1) 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 Computing asymptotic complexity for rule 480 669.01/291.73 669.01/291.73 Simplified the guard: 669.01/291.73 669.01/291.73 480: evalsipmamergesort2start -> [108] : A'=4, B'=-2*k_1+C, D'=-2-2*k_1+C, E'=0, F'=1, G'=0, H'=0, Q'=2, K'=C-4*k_2, L'=-4+C-4*k_2, M'=2, N'=0, O'=0, P'=0, Q_1'=4, [ 2+2*k_1-C==0 && 4-C+4*k_2==0 && k>0 && -8*k+C>=1 ], cost: 94+15*k_1+30*k+20*k_2 669.01/291.73 669.01/291.73 Solved the limit problem by the following transformations: 669.01/291.73 669.01/291.73 Created initial limit problem: 669.01/291.73 669.01/291.73 5-C+4*k_2 (+/+!), -1-2*k_1+C (+/+!), k (+/+!), -8*k+C (+/+!), 94+15*k_1+30*k+20*k_2 (+), 3+2*k_1-C (+/+!), -3+C-4*k_2 (+/+!) [not solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 applying transformation rule (C) using substitution {C==2+2*k_1} 669.01/291.73 669.01/291.73 resulting limit problem: 669.01/291.73 669.01/291.73 1 (+/+!), k (+/+!), 3-2*k_1+4*k_2 (+/+!), 94+15*k_1+30*k+20*k_2 (+), -1+2*k_1-4*k_2 (+/+!), 2+2*k_1-8*k (+/+!) [not solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 applying transformation rule (C) using substitution {C==4+4*k_2} 669.01/291.73 669.01/291.73 resulting limit problem: 669.01/291.73 669.01/291.73 1 (+/+!), k (+/+!), 3-2*k_1+4*k_2 (+/+!), 94+15*k_1+30*k+20*k_2 (+), -1+2*k_1-4*k_2 (+/+!), 2+2*k_1-8*k (+/+!) [not solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 applying transformation rule (C) using substitution {k==1} 669.01/291.73 669.01/291.73 resulting limit problem: 669.01/291.73 669.01/291.73 1 (+/+!), 124+15*k_1+20*k_2 (+), 3-2*k_1+4*k_2 (+/+!), -1+2*k_1-4*k_2 (+/+!), -6+2*k_1 (+/+!) [not solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 applying transformation rule (B), deleting 1 (+/+!) 669.01/291.73 669.01/291.73 resulting limit problem: 669.01/291.73 669.01/291.73 124+15*k_1+20*k_2 (+), 3-2*k_1+4*k_2 (+/+!), -1+2*k_1-4*k_2 (+/+!), -6+2*k_1 (+/+!) [not solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 removing all constraints (solved by SMT) 669.01/291.73 669.01/291.73 resulting limit problem: [solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 applying transformation rule (C) using substitution {k_1==1+2*n,k_2==n} 669.01/291.73 669.01/291.73 resulting limit problem: 669.01/291.73 669.01/291.73 [solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 Solved the limit problem by the following transformations: 669.01/291.73 669.01/291.73 Created initial limit problem: 669.01/291.73 669.01/291.73 5-C+4*k_2 (+/+!), -1-2*k_1+C (+/+!), k (+/+!), -8*k+C (+/+!), 94+15*k_1+30*k+20*k_2 (+), 3+2*k_1-C (+/+!), -3+C-4*k_2 (+/+!) [not solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 applying transformation rule (C) using substitution {C==2+2*k_1} 669.01/291.73 669.01/291.73 resulting limit problem: 669.01/291.73 669.01/291.73 1 (+/+!), k (+/+!), 3-2*k_1+4*k_2 (+/+!), 94+15*k_1+30*k+20*k_2 (+), -1+2*k_1-4*k_2 (+/+!), 2+2*k_1-8*k (+/+!) [not solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 applying transformation rule (C) using substitution {C==4+4*k_2} 669.01/291.73 669.01/291.73 resulting limit problem: 669.01/291.73 669.01/291.73 1 (+/+!), k (+/+!), 3-2*k_1+4*k_2 (+/+!), 94+15*k_1+30*k+20*k_2 (+), -1+2*k_1-4*k_2 (+/+!), 2+2*k_1-8*k (+/+!) [not solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 applying transformation rule (B), deleting 1 (+/+!) 669.01/291.73 669.01/291.73 resulting limit problem: 669.01/291.73 669.01/291.73 k (+/+!), 3-2*k_1+4*k_2 (+/+!), 94+15*k_1+30*k+20*k_2 (+), -1+2*k_1-4*k_2 (+/+!), 2+2*k_1-8*k (+/+!) [not solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 removing all constraints (solved by SMT) 669.01/291.73 669.01/291.73 resulting limit problem: [solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 applying transformation rule (C) using substitution {k_1==-1+6*n,k==n,k_2==-1+3*n} 669.01/291.73 669.01/291.73 resulting limit problem: 669.01/291.73 669.01/291.73 [solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 Solution: 669.01/291.73 669.01/291.73 k_1 / 1+2*n 669.01/291.73 669.01/291.73 k / 1 669.01/291.73 669.01/291.73 C / 4+4*n 669.01/291.73 669.01/291.73 k_2 / n 669.01/291.73 669.01/291.73 Resulting cost 139+50*n has complexity: Poly(n^1) 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 Computing asymptotic complexity for rule 484 669.01/291.73 669.01/291.73 Simplified the guard: 669.01/291.73 669.01/291.73 484: evalsipmamergesort2start -> [111] : [ 2+2*k-C==0 && k_2>0 && 4-C+4*k_2==0 ], cost: 93+15*k+20*k_2 669.01/291.73 669.01/291.73 Solved the limit problem by the following transformations: 669.01/291.73 669.01/291.73 Created initial limit problem: 669.01/291.73 669.01/291.73 5-C+4*k_2 (+/+!), -1-2*k+C (+/+!), 93+15*k+20*k_2 (+), 3+2*k-C (+/+!), k_2 (+/+!), -3+C-4*k_2 (+/+!) [not solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 applying transformation rule (C) using substitution {C==2+2*k} 669.01/291.73 669.01/291.73 resulting limit problem: 669.01/291.73 669.01/291.73 3-2*k+4*k_2 (+/+!), 1 (+/+!), 93+15*k+20*k_2 (+), -1+2*k-4*k_2 (+/+!), k_2 (+/+!) [not solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 applying transformation rule (C) using substitution {C==4+4*k_2} 669.01/291.73 669.01/291.73 resulting limit problem: 669.01/291.73 669.01/291.73 3-2*k+4*k_2 (+/+!), 1 (+/+!), 93+15*k+20*k_2 (+), -1+2*k-4*k_2 (+/+!), k_2 (+/+!) [not solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 applying transformation rule (B), deleting 1 (+/+!) 669.01/291.73 669.01/291.73 resulting limit problem: 669.01/291.73 669.01/291.73 3-2*k+4*k_2 (+/+!), 93+15*k+20*k_2 (+), -1+2*k-4*k_2 (+/+!), k_2 (+/+!) [not solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 removing all constraints (solved by SMT) 669.01/291.73 669.01/291.73 resulting limit problem: [solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 applying transformation rule (C) using substitution {k==1+2*n,k_2==n} 669.01/291.73 669.01/291.73 resulting limit problem: 669.01/291.73 669.01/291.73 [solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 Solution: 669.01/291.73 669.01/291.73 k / 1+2*n 669.01/291.73 669.01/291.73 C / 4+4*n 669.01/291.73 669.01/291.73 k_2 / n 669.01/291.73 669.01/291.73 Resulting cost 108+50*n has complexity: Poly(n^1) 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 Computing asymptotic complexity for rule 485 669.01/291.73 669.01/291.73 Simplified the guard: 669.01/291.73 669.01/291.73 485: evalsipmamergesort2start -> [111] : [ 2+2*k_1-C==0 && k_2>0 && 4-C+4*k_2==0 ], cost: 93+15*k_1+20*k_2 669.01/291.73 669.01/291.73 Solved the limit problem by the following transformations: 669.01/291.73 669.01/291.73 Created initial limit problem: 669.01/291.73 669.01/291.73 5-C+4*k_2 (+/+!), -1-2*k_1+C (+/+!), 3+2*k_1-C (+/+!), 93+15*k_1+20*k_2 (+), k_2 (+/+!), -3+C-4*k_2 (+/+!) [not solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 applying transformation rule (C) using substitution {C==2+2*k_1} 669.01/291.73 669.01/291.73 resulting limit problem: 669.01/291.73 669.01/291.73 1 (+/+!), 3-2*k_1+4*k_2 (+/+!), -1+2*k_1-4*k_2 (+/+!), 93+15*k_1+20*k_2 (+), k_2 (+/+!) [not solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 applying transformation rule (C) using substitution {C==4+4*k_2} 669.01/291.73 669.01/291.73 resulting limit problem: 669.01/291.73 669.01/291.73 1 (+/+!), 3-2*k_1+4*k_2 (+/+!), -1+2*k_1-4*k_2 (+/+!), 93+15*k_1+20*k_2 (+), k_2 (+/+!) [not solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 applying transformation rule (B), deleting 1 (+/+!) 669.01/291.73 669.01/291.73 resulting limit problem: 669.01/291.73 669.01/291.73 3-2*k_1+4*k_2 (+/+!), -1+2*k_1-4*k_2 (+/+!), 93+15*k_1+20*k_2 (+), k_2 (+/+!) [not solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 removing all constraints (solved by SMT) 669.01/291.73 669.01/291.73 resulting limit problem: [solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 applying transformation rule (C) using substitution {k_1==1+2*n,k_2==n} 669.01/291.73 669.01/291.73 resulting limit problem: 669.01/291.73 669.01/291.73 [solved] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 Solution: 669.01/291.73 669.01/291.73 k_1 / 1+2*n 669.01/291.73 669.01/291.73 C / 4+4*n 669.01/291.73 669.01/291.73 k_2 / n 669.01/291.73 669.01/291.73 Resulting cost 108+50*n has complexity: Poly(n^1) 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 Obtained the following overall complexity (w.r.t. the length of the input n): 669.01/291.73 669.01/291.73 Complexity: Poly(n^1) 669.01/291.73 669.01/291.73 Cpx degree: 1 669.01/291.73 669.01/291.73 Solved cost: 26+15*n 669.01/291.73 669.01/291.73 Rule cost: 26+15*k 669.01/291.73 669.01/291.73 Rule guard: [ k>0 && -2*k+C>=1 ] 669.01/291.73 669.01/291.73 669.01/291.73 669.01/291.73 WORST_CASE(Omega(n^1),?) 669.01/291.73 669.01/291.73 669.01/291.73 ---------------------------------------- 669.01/291.73 669.01/291.73 (2) 669.01/291.73 BOUNDS(n^1, INF) 669.01/291.76 EOF