/export/starexec/sandbox2/solver/bin/starexec_run_complexity /export/starexec/sandbox2/benchmark/theBenchmark.koat /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(NON_POLY, ?) proof of /export/starexec/sandbox2/benchmark/theBenchmark.koat # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(INF, INF). (0) CpxIntTrs (1) Loat Proof [FINISHED, 13.7 s] (2) BOUNDS(INF, INF) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: f0(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f1(A, B, C, D, E, F, G, H, I, J, K, L, M, N)) :|: TRUE f1(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f7(1, C, C, E, E, P, O, 0, 1, P, O, 7, M, N)) :|: 7 >= O && 7 >= P && 3 >= O && O >= 1 && P >= 1 f1(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f7(1, C, C, E, E, P, O, 0, 1, P, O, 7, M, N)) :|: 7 >= O && 7 >= P && O >= 5 && P >= 1 f1(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f7(1, C + 1, C + 1, E + 1, E + 1, P, 4, 1, 1, P, 4, 7, M, N)) :|: 7 >= P && P >= 1 f1(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f2(0, C, C, E, E, 3, P, 0, 0, 3, P, 2, M, N)) :|: 7 >= P && 3 >= P && P >= 1 f1(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f2(0, C, C, E, E, 3, P, 0, 0, 3, P, 2, M, N)) :|: 7 >= P && P >= 5 f1(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f2(0, C + 1, C + 1, E + 1, E + 1, 3, 4, 1, 0, 3, 4, 2, M, N)) :|: TRUE f2(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f7(1, C, C, E, E, P, O, H, 1, P, O, 7, M, N)) :|: 7 >= O && 7 >= P && 3 >= O && O >= 1 && P >= 1 f2(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f7(1, C, C, E, E, P, O, H, 1, P, O, 7, M, N)) :|: 7 >= O && 7 >= P && O >= 5 && P >= 1 f2(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f7(1, C + 1, C + 1, E + 1, E + 1, P, 4, 1, 1, P, 4, 7, M, N)) :|: 7 >= P && P >= 1 f2(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f3(0, C, C, E, E, P, O, H, 0, P, O, 3, M, N)) :|: 7 >= O && 7 >= P && 3 >= O && O >= 1 && P >= 1 f2(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f3(0, C, C, E, E, P, O, H, 0, P, O, 3, M, N)) :|: 7 >= O && 7 >= P && O >= 5 && P >= 1 f2(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f3(0, C + 1, C + 1, E + 1, E + 1, P, 4, 1, 0, P, 4, 3, M, N)) :|: 7 >= P && P >= 1 f3(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f6(1, C, C, E, E, P, O, H, 1, P, O, 6, M, N)) :|: 7 >= O && 7 >= P && 3 >= O && O >= 1 && P >= 1 f3(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f6(1, C, C, E, E, P, O, H, 1, P, O, 6, M, N)) :|: 7 >= O && 7 >= P && O >= 5 && P >= 1 f3(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f6(1, C + 1, C + 1, E + 1, E + 1, P, 4, 1, 1, P, 4, 6, M, N)) :|: 7 >= P && P >= 1 f6(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f4(P, C, C, E, E, O, 2, 0, P, O, 2, 4, M, N)) :|: 7 >= O && 1 >= P && P >= 0 && O >= 1 f6(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f4(P, C, C, E, E, O, 7, 1, P, O, 7, 4, M, N)) :|: 7 >= O && 1 >= P && P >= 0 && O >= 1 && H >= 1 && H <= 1 f4(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f2(0, C, C, E, E, P, O, 0, 0, P, O, 2, M, N)) :|: M >= Q + 1 && N >= R + 1 && M >= 1 && N >= 1 && 7 >= O && 7 >= P && 3 >= O && O >= 1 && P >= 1 && H >= 1 && H <= 1 f4(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f2(0, C, C, E, E, P, O, 0, 0, P, O, 2, M, N)) :|: M >= 1 && M >= E + 1 && N >= 1 && N >= C + 1 && 7 >= O && 7 >= P && O >= 5 && P >= 1 && H >= 1 && H <= 1 f4(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f2(0, C + 1, C + 1, E + 1, E + 1, P, 4, 0, 0, P, 4, 2, M, N)) :|: M >= E + 2 && N >= C + 2 && M >= 1 && N >= 1 && 7 >= P && P >= 1 f4(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f7(0, C, C, E, E, P, O, H, 0, P, O, 7, M, N)) :|: E >= M && C >= N && 7 >= O && 7 >= P && 3 >= O && O >= 1 && P >= 1 f4(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f7(0, C, C, E, E, P, O, H, 0, P, O, 7, M, N)) :|: E >= M && C >= N && 7 >= O && 7 >= P && O >= 5 && P >= 1 f4(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f7(0, C + 1, C + 1, E + 1, E + 1, P, 4, 1, 0, P, 4, 7, M, N)) :|: E + 1 >= M && C + 1 >= N && 7 >= P && P >= 1 f4(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f7(1, C, C, E, E, P, O, H, 1, P, O, 7, M, N)) :|: 7 >= O && 7 >= P && 3 >= O && O >= 1 && P >= 1 f4(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f7(1, C, C, E, E, P, O, H, 1, P, O, 7, M, N)) :|: 7 >= O && 7 >= P && O >= 5 && P >= 1 f4(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f7(1, C + 1, C + 1, E + 1, E + 1, P, 4, 1, 1, P, 4, 7, M, N)) :|: 7 >= P && P >= 1 The start-symbols are:[f0_14] ---------------------------------------- (1) Loat Proof (FINISHED) ### Pre-processing the ITS problem ### Initial linear ITS problem Start location: f0 0: f0 -> f1 : [], cost: 1 1: f1 -> f7 : A'=1, B'=C, D'=E, F'=free, G'=free_1, H'=0, Q'=1, J'=free, K'=free_1, L'=7, [ 7>=free_1 && 7>=free && 3>=free_1 && free_1>=1 && free>=1 ], cost: 1 2: f1 -> f7 : A'=1, B'=C, D'=E, F'=free_2, G'=free_3, H'=0, Q'=1, J'=free_2, K'=free_3, L'=7, [ 7>=free_3 && 7>=free_2 && free_3>=5 && free_2>=1 ], cost: 1 3: f1 -> f7 : A'=1, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=free_4, G'=4, H'=1, Q'=1, J'=free_4, K'=4, L'=7, [ 7>=free_4 && free_4>=1 ], cost: 1 4: f1 -> f2 : A'=0, B'=C, D'=E, F'=3, G'=free_5, H'=0, Q'=0, J'=3, K'=free_5, L'=2, [ 7>=free_5 && 3>=free_5 && free_5>=1 ], cost: 1 5: f1 -> f2 : A'=0, B'=C, D'=E, F'=3, G'=free_6, H'=0, Q'=0, J'=3, K'=free_6, L'=2, [ 7>=free_6 && free_6>=5 ], cost: 1 6: f1 -> f2 : A'=0, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=3, G'=4, H'=1, Q'=0, J'=3, K'=4, L'=2, [], cost: 1 7: f2 -> f7 : A'=1, B'=C, D'=E, F'=free_7, G'=free_8, Q'=1, J'=free_7, K'=free_8, L'=7, [ 7>=free_8 && 7>=free_7 && 3>=free_8 && free_8>=1 && free_7>=1 ], cost: 1 8: f2 -> f7 : A'=1, B'=C, D'=E, F'=free_9, G'=free_10, Q'=1, J'=free_9, K'=free_10, L'=7, [ 7>=free_10 && 7>=free_9 && free_10>=5 && free_9>=1 ], cost: 1 9: f2 -> f7 : A'=1, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=free_11, G'=4, H'=1, Q'=1, J'=free_11, K'=4, L'=7, [ 7>=free_11 && free_11>=1 ], cost: 1 10: f2 -> f3 : A'=0, B'=C, D'=E, F'=free_12, G'=free_13, Q'=0, J'=free_12, K'=free_13, L'=3, [ 7>=free_13 && 7>=free_12 && 3>=free_13 && free_13>=1 && free_12>=1 ], cost: 1 11: f2 -> f3 : A'=0, B'=C, D'=E, F'=free_14, G'=free_15, Q'=0, J'=free_14, K'=free_15, L'=3, [ 7>=free_15 && 7>=free_14 && free_15>=5 && free_14>=1 ], cost: 1 12: f2 -> f3 : A'=0, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=free_16, G'=4, H'=1, Q'=0, J'=free_16, K'=4, L'=3, [ 7>=free_16 && free_16>=1 ], cost: 1 13: f3 -> f6 : A'=1, B'=C, D'=E, F'=free_17, G'=free_18, Q'=1, J'=free_17, K'=free_18, L'=6, [ 7>=free_18 && 7>=free_17 && 3>=free_18 && free_18>=1 && free_17>=1 ], cost: 1 14: f3 -> f6 : A'=1, B'=C, D'=E, F'=free_19, G'=free_20, Q'=1, J'=free_19, K'=free_20, L'=6, [ 7>=free_20 && 7>=free_19 && free_20>=5 && free_19>=1 ], cost: 1 15: f3 -> f6 : A'=1, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=free_21, G'=4, H'=1, Q'=1, J'=free_21, K'=4, L'=6, [ 7>=free_21 && free_21>=1 ], cost: 1 16: f6 -> f4 : A'=free_22, B'=C, D'=E, F'=free_23, G'=2, H'=0, Q'=free_22, J'=free_23, K'=2, L'=4, [ 7>=free_23 && 1>=free_22 && free_22>=0 && free_23>=1 ], cost: 1 17: f6 -> f4 : A'=free_24, B'=C, D'=E, F'=free_25, G'=7, H'=1, Q'=free_24, J'=free_25, K'=7, L'=4, [ 7>=free_25 && 1>=free_24 && free_24>=0 && free_25>=1 && H==1 ], cost: 1 18: f4 -> f2 : A'=0, B'=C, D'=E, F'=free_26, G'=free_29, H'=0, Q'=0, J'=free_26, K'=free_29, L'=2, [ M>=1+free_27 && N>=1+free_28 && M>=1 && N>=1 && 7>=free_29 && 7>=free_26 && 3>=free_29 && free_29>=1 && free_26>=1 && H==1 ], cost: 1 19: f4 -> f2 : A'=0, B'=C, D'=E, F'=free_30, G'=free_31, H'=0, Q'=0, J'=free_30, K'=free_31, L'=2, [ M>=1 && M>=1+E && N>=1 && N>=1+C && 7>=free_31 && 7>=free_30 && free_31>=5 && free_30>=1 && H==1 ], cost: 1 20: f4 -> f2 : A'=0, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ M>=2+E && N>=2+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 ], cost: 1 21: f4 -> f7 : A'=0, B'=C, D'=E, F'=free_33, G'=free_34, Q'=0, J'=free_33, K'=free_34, L'=7, [ E>=M && C>=N && 7>=free_34 && 7>=free_33 && 3>=free_34 && free_34>=1 && free_33>=1 ], cost: 1 22: f4 -> f7 : A'=0, B'=C, D'=E, F'=free_35, G'=free_36, Q'=0, J'=free_35, K'=free_36, L'=7, [ E>=M && C>=N && 7>=free_36 && 7>=free_35 && free_36>=5 && free_35>=1 ], cost: 1 23: f4 -> f7 : A'=0, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=free_37, G'=4, H'=1, Q'=0, J'=free_37, K'=4, L'=7, [ 1+E>=M && 1+C>=N && 7>=free_37 && free_37>=1 ], cost: 1 24: f4 -> f7 : A'=1, B'=C, D'=E, F'=free_38, G'=free_39, Q'=1, J'=free_38, K'=free_39, L'=7, [ 7>=free_39 && 7>=free_38 && 3>=free_39 && free_39>=1 && free_38>=1 ], cost: 1 25: f4 -> f7 : A'=1, B'=C, D'=E, F'=free_40, G'=free_41, Q'=1, J'=free_40, K'=free_41, L'=7, [ 7>=free_41 && 7>=free_40 && free_41>=5 && free_40>=1 ], cost: 1 26: f4 -> f7 : A'=1, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=free_42, G'=4, H'=1, Q'=1, J'=free_42, K'=4, L'=7, [ 7>=free_42 && free_42>=1 ], cost: 1 Removed unreachable and leaf rules: Start location: f0 0: f0 -> f1 : [], cost: 1 4: f1 -> f2 : A'=0, B'=C, D'=E, F'=3, G'=free_5, H'=0, Q'=0, J'=3, K'=free_5, L'=2, [ 7>=free_5 && 3>=free_5 && free_5>=1 ], cost: 1 5: f1 -> f2 : A'=0, B'=C, D'=E, F'=3, G'=free_6, H'=0, Q'=0, J'=3, K'=free_6, L'=2, [ 7>=free_6 && free_6>=5 ], cost: 1 6: f1 -> f2 : A'=0, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=3, G'=4, H'=1, Q'=0, J'=3, K'=4, L'=2, [], cost: 1 10: f2 -> f3 : A'=0, B'=C, D'=E, F'=free_12, G'=free_13, Q'=0, J'=free_12, K'=free_13, L'=3, [ 7>=free_13 && 7>=free_12 && 3>=free_13 && free_13>=1 && free_12>=1 ], cost: 1 11: f2 -> f3 : A'=0, B'=C, D'=E, F'=free_14, G'=free_15, Q'=0, J'=free_14, K'=free_15, L'=3, [ 7>=free_15 && 7>=free_14 && free_15>=5 && free_14>=1 ], cost: 1 12: f2 -> f3 : A'=0, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=free_16, G'=4, H'=1, Q'=0, J'=free_16, K'=4, L'=3, [ 7>=free_16 && free_16>=1 ], cost: 1 13: f3 -> f6 : A'=1, B'=C, D'=E, F'=free_17, G'=free_18, Q'=1, J'=free_17, K'=free_18, L'=6, [ 7>=free_18 && 7>=free_17 && 3>=free_18 && free_18>=1 && free_17>=1 ], cost: 1 14: f3 -> f6 : A'=1, B'=C, D'=E, F'=free_19, G'=free_20, Q'=1, J'=free_19, K'=free_20, L'=6, [ 7>=free_20 && 7>=free_19 && free_20>=5 && free_19>=1 ], cost: 1 15: f3 -> f6 : A'=1, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=free_21, G'=4, H'=1, Q'=1, J'=free_21, K'=4, L'=6, [ 7>=free_21 && free_21>=1 ], cost: 1 16: f6 -> f4 : A'=free_22, B'=C, D'=E, F'=free_23, G'=2, H'=0, Q'=free_22, J'=free_23, K'=2, L'=4, [ 7>=free_23 && 1>=free_22 && free_22>=0 && free_23>=1 ], cost: 1 17: f6 -> f4 : A'=free_24, B'=C, D'=E, F'=free_25, G'=7, H'=1, Q'=free_24, J'=free_25, K'=7, L'=4, [ 7>=free_25 && 1>=free_24 && free_24>=0 && free_25>=1 && H==1 ], cost: 1 18: f4 -> f2 : A'=0, B'=C, D'=E, F'=free_26, G'=free_29, H'=0, Q'=0, J'=free_26, K'=free_29, L'=2, [ M>=1+free_27 && N>=1+free_28 && M>=1 && N>=1 && 7>=free_29 && 7>=free_26 && 3>=free_29 && free_29>=1 && free_26>=1 && H==1 ], cost: 1 19: f4 -> f2 : A'=0, B'=C, D'=E, F'=free_30, G'=free_31, H'=0, Q'=0, J'=free_30, K'=free_31, L'=2, [ M>=1 && M>=1+E && N>=1 && N>=1+C && 7>=free_31 && 7>=free_30 && free_31>=5 && free_30>=1 && H==1 ], cost: 1 20: f4 -> f2 : A'=0, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ M>=2+E && N>=2+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 ], cost: 1 Simplified all rules, resulting in: Start location: f0 0: f0 -> f1 : [], cost: 1 4: f1 -> f2 : A'=0, B'=C, D'=E, F'=3, G'=free_5, H'=0, Q'=0, J'=3, K'=free_5, L'=2, [ 3>=free_5 && free_5>=1 ], cost: 1 5: f1 -> f2 : A'=0, B'=C, D'=E, F'=3, G'=free_6, H'=0, Q'=0, J'=3, K'=free_6, L'=2, [ 7>=free_6 && free_6>=5 ], cost: 1 6: f1 -> f2 : A'=0, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=3, G'=4, H'=1, Q'=0, J'=3, K'=4, L'=2, [], cost: 1 10: f2 -> f3 : A'=0, B'=C, D'=E, F'=free_12, G'=free_13, Q'=0, J'=free_12, K'=free_13, L'=3, [ 7>=free_12 && 3>=free_13 && free_13>=1 && free_12>=1 ], cost: 1 11: f2 -> f3 : A'=0, B'=C, D'=E, F'=free_14, G'=free_15, Q'=0, J'=free_14, K'=free_15, L'=3, [ 7>=free_15 && 7>=free_14 && free_15>=5 && free_14>=1 ], cost: 1 12: f2 -> f3 : A'=0, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=free_16, G'=4, H'=1, Q'=0, J'=free_16, K'=4, L'=3, [ 7>=free_16 && free_16>=1 ], cost: 1 13: f3 -> f6 : A'=1, B'=C, D'=E, F'=free_17, G'=free_18, Q'=1, J'=free_17, K'=free_18, L'=6, [ 7>=free_17 && 3>=free_18 && free_18>=1 && free_17>=1 ], cost: 1 14: f3 -> f6 : A'=1, B'=C, D'=E, F'=free_19, G'=free_20, Q'=1, J'=free_19, K'=free_20, L'=6, [ 7>=free_20 && 7>=free_19 && free_20>=5 && free_19>=1 ], cost: 1 15: f3 -> f6 : A'=1, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=free_21, G'=4, H'=1, Q'=1, J'=free_21, K'=4, L'=6, [ 7>=free_21 && free_21>=1 ], cost: 1 16: f6 -> f4 : A'=free_22, B'=C, D'=E, F'=free_23, G'=2, H'=0, Q'=free_22, J'=free_23, K'=2, L'=4, [ 7>=free_23 && 1>=free_22 && free_22>=0 && free_23>=1 ], cost: 1 17: f6 -> f4 : A'=free_24, B'=C, D'=E, F'=free_25, G'=7, H'=1, Q'=free_24, J'=free_25, K'=7, L'=4, [ 7>=free_25 && 1>=free_24 && free_24>=0 && free_25>=1 && H==1 ], cost: 1 18: f4 -> f2 : A'=0, B'=C, D'=E, F'=free_26, G'=free_29, H'=0, Q'=0, J'=free_26, K'=free_29, L'=2, [ M>=1 && N>=1 && 7>=free_26 && 3>=free_29 && free_29>=1 && free_26>=1 && H==1 ], cost: 1 19: f4 -> f2 : A'=0, B'=C, D'=E, F'=free_30, G'=free_31, H'=0, Q'=0, J'=free_30, K'=free_31, L'=2, [ M>=1 && M>=1+E && N>=1 && N>=1+C && 7>=free_31 && 7>=free_30 && free_31>=5 && free_30>=1 && H==1 ], cost: 1 20: f4 -> f2 : A'=0, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ M>=2+E && N>=2+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 ], cost: 1 ### Simplification by acceleration and chaining ### Eliminated locations (on tree-shaped paths): Start location: f0 27: f0 -> f2 : A'=0, B'=C, D'=E, F'=3, G'=free_5, H'=0, Q'=0, J'=3, K'=free_5, L'=2, [ 3>=free_5 && free_5>=1 ], cost: 2 28: f0 -> f2 : A'=0, B'=C, D'=E, F'=3, G'=free_6, H'=0, Q'=0, J'=3, K'=free_6, L'=2, [ 7>=free_6 && free_6>=5 ], cost: 2 29: f0 -> f2 : A'=0, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=3, G'=4, H'=1, Q'=0, J'=3, K'=4, L'=2, [], cost: 2 30: f2 -> f6 : A'=1, B'=C, D'=E, F'=free_17, G'=free_18, Q'=1, J'=free_17, K'=free_18, L'=6, [ 7>=free_12 && 3>=free_13 && free_13>=1 && free_12>=1 && 7>=free_17 && 3>=free_18 && free_18>=1 && free_17>=1 ], cost: 2 31: f2 -> f6 : A'=1, B'=C, D'=E, F'=free_19, G'=free_20, Q'=1, J'=free_19, K'=free_20, L'=6, [ 7>=free_12 && 3>=free_13 && free_13>=1 && free_12>=1 && 7>=free_20 && 7>=free_19 && free_20>=5 && free_19>=1 ], cost: 2 32: f2 -> f6 : A'=1, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=free_21, G'=4, H'=1, Q'=1, J'=free_21, K'=4, L'=6, [ 7>=free_12 && 3>=free_13 && free_13>=1 && free_12>=1 && 7>=free_21 && free_21>=1 ], cost: 2 33: f2 -> f6 : A'=1, B'=C, D'=E, F'=free_17, G'=free_18, Q'=1, J'=free_17, K'=free_18, L'=6, [ 7>=free_15 && 7>=free_14 && free_15>=5 && free_14>=1 && 7>=free_17 && 3>=free_18 && free_18>=1 && free_17>=1 ], cost: 2 34: f2 -> f6 : A'=1, B'=C, D'=E, F'=free_19, G'=free_20, Q'=1, J'=free_19, K'=free_20, L'=6, [ 7>=free_15 && 7>=free_14 && free_15>=5 && free_14>=1 && 7>=free_20 && 7>=free_19 && free_20>=5 && free_19>=1 ], cost: 2 35: f2 -> f6 : A'=1, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=free_21, G'=4, H'=1, Q'=1, J'=free_21, K'=4, L'=6, [ 7>=free_15 && 7>=free_14 && free_15>=5 && free_14>=1 && 7>=free_21 && free_21>=1 ], cost: 2 36: f2 -> f6 : A'=1, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=free_17, G'=free_18, H'=1, Q'=1, J'=free_17, K'=free_18, L'=6, [ 7>=free_16 && free_16>=1 && 7>=free_17 && 3>=free_18 && free_18>=1 && free_17>=1 ], cost: 2 37: f2 -> f6 : A'=1, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=free_19, G'=free_20, H'=1, Q'=1, J'=free_19, K'=free_20, L'=6, [ 7>=free_16 && free_16>=1 && 7>=free_20 && 7>=free_19 && free_20>=5 && free_19>=1 ], cost: 2 38: f2 -> f6 : A'=1, B'=2+C, C'=2+C, D'=2+E, E'=2+E, F'=free_21, G'=4, H'=1, Q'=1, J'=free_21, K'=4, L'=6, [ 7>=free_16 && free_16>=1 && 7>=free_21 && free_21>=1 ], cost: 2 39: f6 -> f2 : A'=0, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ 7>=free_23 && 1>=free_22 && free_22>=0 && free_23>=1 && M>=2+E && N>=2+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 ], cost: 2 40: f6 -> f2 : A'=0, B'=C, D'=E, F'=free_26, G'=free_29, H'=0, Q'=0, J'=free_26, K'=free_29, L'=2, [ 7>=free_25 && 1>=free_24 && free_24>=0 && free_25>=1 && H==1 && M>=1 && N>=1 && 7>=free_26 && 3>=free_29 && free_29>=1 && free_26>=1 ], cost: 2 41: f6 -> f2 : A'=0, B'=C, D'=E, F'=free_30, G'=free_31, H'=0, Q'=0, J'=free_30, K'=free_31, L'=2, [ 7>=free_25 && 1>=free_24 && free_24>=0 && free_25>=1 && H==1 && M>=1 && M>=1+E && N>=1 && N>=1+C && 7>=free_31 && 7>=free_30 && free_31>=5 && free_30>=1 ], cost: 2 42: f6 -> f2 : A'=0, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ 7>=free_25 && 1>=free_24 && free_24>=0 && free_25>=1 && H==1 && M>=2+E && N>=2+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 ], cost: 2 Eliminated locations (on tree-shaped paths): Start location: f0 27: f0 -> f2 : A'=0, B'=C, D'=E, F'=3, G'=free_5, H'=0, Q'=0, J'=3, K'=free_5, L'=2, [ 3>=free_5 && free_5>=1 ], cost: 2 28: f0 -> f2 : A'=0, B'=C, D'=E, F'=3, G'=free_6, H'=0, Q'=0, J'=3, K'=free_6, L'=2, [ 7>=free_6 && free_6>=5 ], cost: 2 29: f0 -> f2 : A'=0, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=3, G'=4, H'=1, Q'=0, J'=3, K'=4, L'=2, [], cost: 2 43: f2 -> f2 : A'=0, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ 7>=free_12 && 3>=free_13 && free_13>=1 && free_12>=1 && 7>=free_17 && 3>=free_18 && free_18>=1 && free_17>=1 && 7>=free_23 && 1>=free_22 && free_22>=0 && free_23>=1 && M>=2+E && N>=2+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 ], cost: 4 44: f2 -> f2 : A'=0, B'=C, D'=E, F'=free_26, G'=free_29, H'=0, Q'=0, J'=free_26, K'=free_29, L'=2, [ 7>=free_12 && 3>=free_13 && free_13>=1 && free_12>=1 && 7>=free_17 && 3>=free_18 && free_18>=1 && free_17>=1 && 7>=free_25 && 1>=free_24 && free_24>=0 && free_25>=1 && H==1 && M>=1 && N>=1 && 7>=free_26 && 3>=free_29 && free_29>=1 && free_26>=1 ], cost: 4 45: f2 -> f2 : A'=0, B'=C, D'=E, F'=free_30, G'=free_31, H'=0, Q'=0, J'=free_30, K'=free_31, L'=2, [ 7>=free_12 && 3>=free_13 && free_13>=1 && free_12>=1 && 7>=free_17 && 3>=free_18 && free_18>=1 && free_17>=1 && 7>=free_25 && 1>=free_24 && free_24>=0 && free_25>=1 && H==1 && M>=1 && M>=1+E && N>=1 && N>=1+C && 7>=free_31 && 7>=free_30 && free_31>=5 && free_30>=1 ], cost: 4 46: f2 -> f2 : A'=0, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ 7>=free_12 && 3>=free_13 && free_13>=1 && free_12>=1 && 7>=free_17 && 3>=free_18 && free_18>=1 && free_17>=1 && 7>=free_25 && 1>=free_24 && free_24>=0 && free_25>=1 && H==1 && M>=2+E && N>=2+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 ], cost: 4 47: f2 -> f2 : A'=0, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ 7>=free_12 && 3>=free_13 && free_13>=1 && free_12>=1 && 7>=free_20 && 7>=free_19 && free_20>=5 && free_19>=1 && 7>=free_23 && 1>=free_22 && free_22>=0 && free_23>=1 && M>=2+E && N>=2+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 ], cost: 4 48: f2 -> f2 : A'=0, B'=C, D'=E, F'=free_26, G'=free_29, H'=0, Q'=0, J'=free_26, K'=free_29, L'=2, [ 7>=free_12 && 3>=free_13 && free_13>=1 && free_12>=1 && 7>=free_20 && 7>=free_19 && free_20>=5 && free_19>=1 && 7>=free_25 && 1>=free_24 && free_24>=0 && free_25>=1 && H==1 && M>=1 && N>=1 && 7>=free_26 && 3>=free_29 && free_29>=1 && free_26>=1 ], cost: 4 49: f2 -> f2 : A'=0, B'=C, D'=E, F'=free_30, G'=free_31, H'=0, Q'=0, J'=free_30, K'=free_31, L'=2, [ 7>=free_12 && 3>=free_13 && free_13>=1 && free_12>=1 && 7>=free_20 && 7>=free_19 && free_20>=5 && free_19>=1 && 7>=free_25 && 1>=free_24 && free_24>=0 && free_25>=1 && H==1 && M>=1 && M>=1+E && N>=1 && N>=1+C && 7>=free_31 && 7>=free_30 && free_31>=5 && free_30>=1 ], cost: 4 50: f2 -> f2 : A'=0, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ 7>=free_12 && 3>=free_13 && free_13>=1 && free_12>=1 && 7>=free_20 && 7>=free_19 && free_20>=5 && free_19>=1 && 7>=free_25 && 1>=free_24 && free_24>=0 && free_25>=1 && H==1 && M>=2+E && N>=2+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 ], cost: 4 51: f2 -> f2 : A'=0, B'=2+C, C'=2+C, D'=2+E, E'=2+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ 7>=free_12 && 3>=free_13 && free_13>=1 && free_12>=1 && 7>=free_21 && free_21>=1 && 7>=free_23 && 1>=free_22 && free_22>=0 && free_23>=1 && M>=3+E && N>=3+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 ], cost: 4 52: f2 -> f2 : A'=0, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=free_26, G'=free_29, H'=0, Q'=0, J'=free_26, K'=free_29, L'=2, [ 7>=free_12 && 3>=free_13 && free_13>=1 && free_12>=1 && 7>=free_21 && free_21>=1 && 7>=free_25 && 1>=free_24 && free_24>=0 && free_25>=1 && M>=1 && N>=1 && 7>=free_26 && 3>=free_29 && free_29>=1 && free_26>=1 ], cost: 4 53: f2 -> f2 : A'=0, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=free_30, G'=free_31, H'=0, Q'=0, J'=free_30, K'=free_31, L'=2, [ 7>=free_12 && 3>=free_13 && free_13>=1 && free_12>=1 && 7>=free_21 && free_21>=1 && 7>=free_25 && 1>=free_24 && free_24>=0 && free_25>=1 && M>=1 && M>=2+E && N>=1 && N>=2+C && 7>=free_31 && 7>=free_30 && free_31>=5 && free_30>=1 ], cost: 4 54: f2 -> f2 : A'=0, B'=2+C, C'=2+C, D'=2+E, E'=2+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ 7>=free_12 && 3>=free_13 && free_13>=1 && free_12>=1 && 7>=free_21 && free_21>=1 && 7>=free_25 && 1>=free_24 && free_24>=0 && free_25>=1 && M>=3+E && N>=3+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 ], cost: 4 55: f2 -> f2 : A'=0, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ 7>=free_15 && 7>=free_14 && free_15>=5 && free_14>=1 && 7>=free_17 && 3>=free_18 && free_18>=1 && free_17>=1 && 7>=free_23 && 1>=free_22 && free_22>=0 && free_23>=1 && M>=2+E && N>=2+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 ], cost: 4 56: f2 -> f2 : A'=0, B'=C, D'=E, F'=free_26, G'=free_29, H'=0, Q'=0, J'=free_26, K'=free_29, L'=2, [ 7>=free_15 && 7>=free_14 && free_15>=5 && free_14>=1 && 7>=free_17 && 3>=free_18 && free_18>=1 && free_17>=1 && 7>=free_25 && 1>=free_24 && free_24>=0 && free_25>=1 && H==1 && M>=1 && N>=1 && 7>=free_26 && 3>=free_29 && free_29>=1 && free_26>=1 ], cost: 4 57: f2 -> f2 : A'=0, B'=C, D'=E, F'=free_30, G'=free_31, H'=0, Q'=0, J'=free_30, K'=free_31, L'=2, [ 7>=free_15 && 7>=free_14 && free_15>=5 && free_14>=1 && 7>=free_17 && 3>=free_18 && free_18>=1 && free_17>=1 && 7>=free_25 && 1>=free_24 && free_24>=0 && free_25>=1 && H==1 && M>=1 && M>=1+E && N>=1 && N>=1+C && 7>=free_31 && 7>=free_30 && free_31>=5 && free_30>=1 ], cost: 4 58: f2 -> f2 : A'=0, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ 7>=free_15 && 7>=free_14 && free_15>=5 && free_14>=1 && 7>=free_17 && 3>=free_18 && free_18>=1 && free_17>=1 && 7>=free_25 && 1>=free_24 && free_24>=0 && free_25>=1 && H==1 && M>=2+E && N>=2+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 ], cost: 4 59: f2 -> f2 : A'=0, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ 7>=free_15 && 7>=free_14 && free_15>=5 && free_14>=1 && 7>=free_20 && 7>=free_19 && free_20>=5 && free_19>=1 && 7>=free_23 && 1>=free_22 && free_22>=0 && free_23>=1 && M>=2+E && N>=2+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 ], cost: 4 60: f2 -> f2 : A'=0, B'=C, D'=E, F'=free_26, G'=free_29, H'=0, Q'=0, J'=free_26, K'=free_29, L'=2, [ 7>=free_15 && 7>=free_14 && free_15>=5 && free_14>=1 && 7>=free_20 && 7>=free_19 && free_20>=5 && free_19>=1 && 7>=free_25 && 1>=free_24 && free_24>=0 && free_25>=1 && H==1 && M>=1 && N>=1 && 7>=free_26 && 3>=free_29 && free_29>=1 && free_26>=1 ], cost: 4 61: f2 -> f2 : A'=0, B'=C, D'=E, F'=free_30, G'=free_31, H'=0, Q'=0, J'=free_30, K'=free_31, L'=2, [ 7>=free_15 && 7>=free_14 && free_15>=5 && free_14>=1 && 7>=free_20 && 7>=free_19 && free_20>=5 && free_19>=1 && 7>=free_25 && 1>=free_24 && free_24>=0 && free_25>=1 && H==1 && M>=1 && M>=1+E && N>=1 && N>=1+C && 7>=free_31 && 7>=free_30 && free_31>=5 && free_30>=1 ], cost: 4 62: f2 -> f2 : A'=0, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ 7>=free_15 && 7>=free_14 && free_15>=5 && free_14>=1 && 7>=free_20 && 7>=free_19 && free_20>=5 && free_19>=1 && 7>=free_25 && 1>=free_24 && free_24>=0 && free_25>=1 && H==1 && M>=2+E && N>=2+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 ], cost: 4 63: f2 -> f2 : A'=0, B'=2+C, C'=2+C, D'=2+E, E'=2+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ 7>=free_15 && 7>=free_14 && free_15>=5 && free_14>=1 && 7>=free_21 && free_21>=1 && 7>=free_23 && 1>=free_22 && free_22>=0 && free_23>=1 && M>=3+E && N>=3+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 ], cost: 4 64: f2 -> f2 : A'=0, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=free_26, G'=free_29, H'=0, Q'=0, J'=free_26, K'=free_29, L'=2, [ 7>=free_15 && 7>=free_14 && free_15>=5 && free_14>=1 && 7>=free_21 && free_21>=1 && 7>=free_25 && 1>=free_24 && free_24>=0 && free_25>=1 && M>=1 && N>=1 && 7>=free_26 && 3>=free_29 && free_29>=1 && free_26>=1 ], cost: 4 65: f2 -> f2 : A'=0, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=free_30, G'=free_31, H'=0, Q'=0, J'=free_30, K'=free_31, L'=2, [ 7>=free_15 && 7>=free_14 && free_15>=5 && free_14>=1 && 7>=free_21 && free_21>=1 && 7>=free_25 && 1>=free_24 && free_24>=0 && free_25>=1 && M>=1 && M>=2+E && N>=1 && N>=2+C && 7>=free_31 && 7>=free_30 && free_31>=5 && free_30>=1 ], cost: 4 66: f2 -> f2 : A'=0, B'=2+C, C'=2+C, D'=2+E, E'=2+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ 7>=free_15 && 7>=free_14 && free_15>=5 && free_14>=1 && 7>=free_21 && free_21>=1 && 7>=free_25 && 1>=free_24 && free_24>=0 && free_25>=1 && M>=3+E && N>=3+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 ], cost: 4 67: f2 -> f2 : A'=0, B'=2+C, C'=2+C, D'=2+E, E'=2+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ 7>=free_16 && free_16>=1 && 7>=free_17 && 3>=free_18 && free_18>=1 && free_17>=1 && 7>=free_23 && 1>=free_22 && free_22>=0 && free_23>=1 && M>=3+E && N>=3+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 ], cost: 4 68: f2 -> f2 : A'=0, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=free_26, G'=free_29, H'=0, Q'=0, J'=free_26, K'=free_29, L'=2, [ 7>=free_16 && free_16>=1 && 7>=free_17 && 3>=free_18 && free_18>=1 && free_17>=1 && 7>=free_25 && 1>=free_24 && free_24>=0 && free_25>=1 && M>=1 && N>=1 && 7>=free_26 && 3>=free_29 && free_29>=1 && free_26>=1 ], cost: 4 69: f2 -> f2 : A'=0, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=free_30, G'=free_31, H'=0, Q'=0, J'=free_30, K'=free_31, L'=2, [ 7>=free_16 && free_16>=1 && 7>=free_17 && 3>=free_18 && free_18>=1 && free_17>=1 && 7>=free_25 && 1>=free_24 && free_24>=0 && free_25>=1 && M>=1 && M>=2+E && N>=1 && N>=2+C && 7>=free_31 && 7>=free_30 && free_31>=5 && free_30>=1 ], cost: 4 70: f2 -> f2 : A'=0, B'=2+C, C'=2+C, D'=2+E, E'=2+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ 7>=free_16 && free_16>=1 && 7>=free_17 && 3>=free_18 && free_18>=1 && free_17>=1 && 7>=free_25 && 1>=free_24 && free_24>=0 && free_25>=1 && M>=3+E && N>=3+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 ], cost: 4 71: f2 -> f2 : A'=0, B'=2+C, C'=2+C, D'=2+E, E'=2+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ 7>=free_16 && free_16>=1 && 7>=free_20 && 7>=free_19 && free_20>=5 && free_19>=1 && 7>=free_23 && 1>=free_22 && free_22>=0 && free_23>=1 && M>=3+E && N>=3+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 ], cost: 4 72: f2 -> f2 : A'=0, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=free_26, G'=free_29, H'=0, Q'=0, J'=free_26, K'=free_29, L'=2, [ 7>=free_16 && free_16>=1 && 7>=free_20 && 7>=free_19 && free_20>=5 && free_19>=1 && 7>=free_25 && 1>=free_24 && free_24>=0 && free_25>=1 && M>=1 && N>=1 && 7>=free_26 && 3>=free_29 && free_29>=1 && free_26>=1 ], cost: 4 73: f2 -> f2 : A'=0, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=free_30, G'=free_31, H'=0, Q'=0, J'=free_30, K'=free_31, L'=2, [ 7>=free_16 && free_16>=1 && 7>=free_20 && 7>=free_19 && free_20>=5 && free_19>=1 && 7>=free_25 && 1>=free_24 && free_24>=0 && free_25>=1 && M>=1 && M>=2+E && N>=1 && N>=2+C && 7>=free_31 && 7>=free_30 && free_31>=5 && free_30>=1 ], cost: 4 74: f2 -> f2 : A'=0, B'=2+C, C'=2+C, D'=2+E, E'=2+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ 7>=free_16 && free_16>=1 && 7>=free_20 && 7>=free_19 && free_20>=5 && free_19>=1 && 7>=free_25 && 1>=free_24 && free_24>=0 && free_25>=1 && M>=3+E && N>=3+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 ], cost: 4 75: f2 -> f2 : A'=0, B'=3+C, C'=3+C, D'=3+E, E'=3+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ 7>=free_16 && free_16>=1 && 7>=free_21 && free_21>=1 && 7>=free_23 && 1>=free_22 && free_22>=0 && free_23>=1 && M>=4+E && N>=4+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 ], cost: 4 76: f2 -> f2 : A'=0, B'=2+C, C'=2+C, D'=2+E, E'=2+E, F'=free_26, G'=free_29, H'=0, Q'=0, J'=free_26, K'=free_29, L'=2, [ 7>=free_16 && free_16>=1 && 7>=free_21 && free_21>=1 && 7>=free_25 && 1>=free_24 && free_24>=0 && free_25>=1 && M>=1 && N>=1 && 7>=free_26 && 3>=free_29 && free_29>=1 && free_26>=1 ], cost: 4 77: f2 -> f2 : A'=0, B'=2+C, C'=2+C, D'=2+E, E'=2+E, F'=free_30, G'=free_31, H'=0, Q'=0, J'=free_30, K'=free_31, L'=2, [ 7>=free_16 && free_16>=1 && 7>=free_21 && free_21>=1 && 7>=free_25 && 1>=free_24 && free_24>=0 && free_25>=1 && M>=1 && M>=3+E && N>=1 && N>=3+C && 7>=free_31 && 7>=free_30 && free_31>=5 && free_30>=1 ], cost: 4 78: f2 -> f2 : A'=0, B'=3+C, C'=3+C, D'=3+E, E'=3+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ 7>=free_16 && free_16>=1 && 7>=free_21 && free_21>=1 && 7>=free_25 && 1>=free_24 && free_24>=0 && free_25>=1 && M>=4+E && N>=4+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 ], cost: 4 Accelerating simple loops of location 2. Simplified some of the simple loops (and removed duplicate rules). Accelerating the following rules: 59: f2 -> f2 : A'=0, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ M>=2+E && N>=2+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 ], cost: 4 60: f2 -> f2 : A'=0, B'=C, D'=E, F'=free_26, G'=free_29, H'=0, Q'=0, J'=free_26, K'=free_29, L'=2, [ H==1 && M>=1 && N>=1 && 7>=free_26 && 3>=free_29 && free_29>=1 && free_26>=1 ], cost: 4 61: f2 -> f2 : A'=0, B'=C, D'=E, F'=free_30, G'=free_31, H'=0, Q'=0, J'=free_30, K'=free_31, L'=2, [ H==1 && M>=1 && M>=1+E && N>=1 && N>=1+C && 7>=free_31 && 7>=free_30 && free_31>=5 && free_30>=1 ], cost: 4 62: f2 -> f2 : A'=0, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ H==1 && M>=2+E && N>=2+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 ], cost: 4 72: f2 -> f2 : A'=0, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=free_26, G'=free_29, H'=0, Q'=0, J'=free_26, K'=free_29, L'=2, [ M>=1 && N>=1 && 7>=free_26 && 3>=free_29 && free_29>=1 && free_26>=1 ], cost: 4 73: f2 -> f2 : A'=0, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=free_30, G'=free_31, H'=0, Q'=0, J'=free_30, K'=free_31, L'=2, [ M>=1 && M>=2+E && N>=1 && N>=2+C && 7>=free_31 && 7>=free_30 && free_31>=5 && free_30>=1 ], cost: 4 74: f2 -> f2 : A'=0, B'=2+C, C'=2+C, D'=2+E, E'=2+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ M>=3+E && N>=3+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 ], cost: 4 76: f2 -> f2 : A'=0, B'=2+C, C'=2+C, D'=2+E, E'=2+E, F'=free_26, G'=free_29, H'=0, Q'=0, J'=free_26, K'=free_29, L'=2, [ M>=1 && N>=1 && 7>=free_26 && 3>=free_29 && free_29>=1 && free_26>=1 ], cost: 4 77: f2 -> f2 : A'=0, B'=2+C, C'=2+C, D'=2+E, E'=2+E, F'=free_30, G'=free_31, H'=0, Q'=0, J'=free_30, K'=free_31, L'=2, [ M>=1 && M>=3+E && N>=1 && N>=3+C && 7>=free_31 && 7>=free_30 && free_31>=5 && free_30>=1 ], cost: 4 78: f2 -> f2 : A'=0, B'=3+C, C'=3+C, D'=3+E, E'=3+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ M>=4+E && N>=4+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 ], cost: 4 Accelerated rule 59 with backward acceleration, yielding the new rule 79. Accelerated rule 59 with backward acceleration, yielding the new rule 80. Accelerated rule 60 with metering function H, yielding the new rule 81. Accelerated rule 61 with metering function H, yielding the new rule 82. Accelerated rule 62 with metering function -1+H, yielding the new rule 83. Accelerated rule 72 with NONTERM, yielding the new rule 84. Accelerated rule 73 with backward acceleration, yielding the new rule 85. Accelerated rule 73 with backward acceleration, yielding the new rule 86. Accelerated rule 74 with backward acceleration, yielding the new rule 87. Accelerated rule 76 with NONTERM, yielding the new rule 88. Accelerated rule 77 with backward acceleration, yielding the new rule 89. Accelerated rule 78 with backward acceleration, yielding the new rule 90. Nested simple loops 62 (outer loop) and 87 (inner loop) with metering function -1+H, resulting in the new rules: 91. Nested simple loops 62 (outer loop) and 89 (inner loop) with metering function -1+H, resulting in the new rules: 92. Nested simple loops 62 (outer loop) and 90 (inner loop) with metering function -1+H, resulting in the new rules: 93. Removing the simple loops: 59 60 61 62 72 73 74 76 77 78. Also removing duplicate rules:. Accelerated all simple loops using metering functions (where possible): Start location: f0 27: f0 -> f2 : A'=0, B'=C, D'=E, F'=3, G'=free_5, H'=0, Q'=0, J'=3, K'=free_5, L'=2, [ 3>=free_5 && free_5>=1 ], cost: 2 28: f0 -> f2 : A'=0, B'=C, D'=E, F'=3, G'=free_6, H'=0, Q'=0, J'=3, K'=free_6, L'=2, [ 7>=free_6 && free_6>=5 ], cost: 2 29: f0 -> f2 : A'=0, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=3, G'=4, H'=1, Q'=0, J'=3, K'=4, L'=2, [], cost: 2 79: f2 -> f2 : A'=0, B'=-1+C+M-E, C'=-1+C+M-E, D'=-1+M, E'=-1+M, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ M>=2+E && N>=2+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 && N>=C+M-E ], cost: -4+4*M-4*E 80: f2 -> f2 : A'=0, B'=-1+N, C'=-1+N, D'=-1-C+N+E, E'=-1-C+N+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ M>=2+E && N>=2+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 && M>=-C+N+E ], cost: -4-4*C+4*N 81: f2 -> f2 : A'=0, B'=C, D'=E, F'=free_26, G'=free_29, H'=0, Q'=0, J'=free_26, K'=free_29, L'=2, [ H==1 && M>=1 && N>=1 && 7>=free_26 && 3>=free_29 && free_29>=1 && free_26>=1 ], cost: 4*H 82: f2 -> f2 : A'=0, B'=C, D'=E, F'=free_30, G'=free_31, H'=0, Q'=0, J'=free_30, K'=free_31, L'=2, [ H==1 && M>=1 && M>=1+E && N>=1 && N>=1+C && 7>=free_31 && 7>=free_30 && free_31>=5 && free_30>=1 ], cost: 4*H 83: f2 -> f2 : A'=0, B'=-1+C+H, C'=-1+C+H, D'=-1+H+E, E'=-1+H+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ H==1 && M>=2+E && N>=2+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 && -1+H>=1 ], cost: -4+4*H 85: f2 -> f2 : A'=0, B'=-1+C+M-E, C'=-1+C+M-E, D'=-1+M, E'=-1+M, F'=free_30, G'=free_31, H'=0, Q'=0, J'=free_30, K'=free_31, L'=2, [ M>=1 && M>=2+E && N>=1 && N>=2+C && 7>=free_31 && 7>=free_30 && free_31>=5 && free_30>=1 && N>=C+M-E ], cost: -4+4*M-4*E 86: f2 -> f2 : A'=0, B'=-1+N, C'=-1+N, D'=-1-C+N+E, E'=-1-C+N+E, F'=free_30, G'=free_31, H'=0, Q'=0, J'=free_30, K'=free_31, L'=2, [ M>=1 && M>=2+E && N>=1 && N>=2+C && 7>=free_31 && 7>=free_30 && free_31>=5 && free_30>=1 && M>=-C+N+E ], cost: -4-4*C+4*N 87: f2 -> f2 : A'=0, B'=C+2*k_2, C'=C+2*k_2, D'=2*k_2+E, E'=2*k_2+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ M>=3+E && N>=3+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 && k_2>0 && M>=1+2*k_2+E && N>=1+C+2*k_2 ], cost: 4*k_2 88: f2 -> [7] : [ M>=1 && N>=1 && 7>=free_26 && 3>=free_29 && free_29>=1 && free_26>=1 ], cost: INF 89: f2 -> f2 : A'=0, B'=C+2*k_3, C'=C+2*k_3, D'=2*k_3+E, E'=2*k_3+E, F'=free_30, G'=free_31, H'=0, Q'=0, J'=free_30, K'=free_31, L'=2, [ M>=1 && M>=3+E && N>=1 && N>=3+C && 7>=free_31 && 7>=free_30 && free_31>=5 && free_30>=1 && k_3>0 && M>=1+2*k_3+E && N>=1+C+2*k_3 ], cost: 4*k_3 90: f2 -> f2 : A'=0, B'=C+3*k_4, C'=C+3*k_4, D'=3*k_4+E, E'=3*k_4+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ M>=4+E && N>=4+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 && k_4>0 && M>=1+3*k_4+E && N>=1+C+3*k_4 ], cost: 4*k_4 91: f2 -> f2 : A'=0, B'=-1+C+H+2*k_2*(-1+H), C'=-1+C+H+2*k_2*(-1+H), D'=-1+H+E+2*k_2*(-1+H), E'=-1+H+E+2*k_2*(-1+H), F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ H==1 && M>=1 && N>=1 && 7>=free_32 && free_32>=1 && M>=4+E && N>=4+C && k_2>0 && M>=2+2*k_2+E && N>=2+C+2*k_2 && -1+H>=1 ], cost: -4+4*H+4*k_2*(-1+H) 92: f2 -> f2 : A'=0, B'=-1+2*k_3*(-1+H)+C+H, C'=-1+2*k_3*(-1+H)+C+H, D'=-1+2*k_3*(-1+H)+H+E, E'=-1+2*k_3*(-1+H)+H+E, F'=free_30, G'=free_31, H'=0, Q'=0, J'=free_30, K'=free_31, L'=2, [ H==1 && M>=1 && N>=1 && M>=4+E && N>=4+C && 7>=free_31 && 7>=free_30 && free_31>=5 && free_30>=1 && k_3>0 && M>=2+2*k_3+E && N>=2+C+2*k_3 && -1+H>=1 ], cost: -4+4*k_3*(-1+H)+4*H 93: f2 -> f2 : A'=0, B'=-1+C+3*k_4*(-1+H)+H, C'=-1+C+3*k_4*(-1+H)+H, D'=-1+3*k_4*(-1+H)+H+E, E'=-1+3*k_4*(-1+H)+H+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ H==1 && M>=1 && N>=1 && 7>=free_32 && free_32>=1 && M>=5+E && N>=5+C && k_4>0 && M>=2+3*k_4+E && N>=2+C+3*k_4 && -1+H>=1 ], cost: -4+4*k_4*(-1+H)+4*H Chained accelerated rules (with incoming rules): Start location: f0 27: f0 -> f2 : A'=0, B'=C, D'=E, F'=3, G'=free_5, H'=0, Q'=0, J'=3, K'=free_5, L'=2, [ 3>=free_5 && free_5>=1 ], cost: 2 28: f0 -> f2 : A'=0, B'=C, D'=E, F'=3, G'=free_6, H'=0, Q'=0, J'=3, K'=free_6, L'=2, [ 7>=free_6 && free_6>=5 ], cost: 2 29: f0 -> f2 : A'=0, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=3, G'=4, H'=1, Q'=0, J'=3, K'=4, L'=2, [], cost: 2 94: f0 -> f2 : A'=0, B'=-1+C+M-E, C'=-1+C+M-E, D'=-1+M, E'=-1+M, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ M>=2+E && N>=2+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 && N>=C+M-E ], cost: -2+4*M-4*E 95: f0 -> f2 : A'=0, B'=-1+C+M-E, C'=-1+C+M-E, D'=-1+M, E'=-1+M, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ M>=2+E && N>=2+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 && N>=C+M-E ], cost: -2+4*M-4*E 96: f0 -> f2 : A'=0, B'=-1+C+M-E, C'=-1+C+M-E, D'=-1+M, E'=-1+M, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ M>=3+E && N>=3+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 && N>=C+M-E ], cost: -6+4*M-4*E 97: f0 -> f2 : A'=0, B'=-1+N, C'=-1+N, D'=-1-C+N+E, E'=-1-C+N+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ M>=2+E && N>=2+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 && M>=-C+N+E ], cost: -2-4*C+4*N 98: f0 -> f2 : A'=0, B'=-1+N, C'=-1+N, D'=-1-C+N+E, E'=-1-C+N+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ M>=2+E && N>=2+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 && M>=-C+N+E ], cost: -2-4*C+4*N 99: f0 -> f2 : A'=0, B'=-1+N, C'=-1+N, D'=-1-C+N+E, E'=-1-C+N+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ M>=3+E && N>=3+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 && M>=-C+N+E ], cost: -6-4*C+4*N 100: f0 -> f2 : A'=0, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=free_26, G'=free_29, H'=0, Q'=0, J'=free_26, K'=free_29, L'=2, [ M>=1 && N>=1 && 7>=free_26 && 3>=free_29 && free_29>=1 && free_26>=1 ], cost: 6 101: f0 -> f2 : A'=0, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=free_30, G'=free_31, H'=0, Q'=0, J'=free_30, K'=free_31, L'=2, [ M>=1 && M>=2+E && N>=1 && N>=2+C && 7>=free_31 && 7>=free_30 && free_31>=5 && free_30>=1 ], cost: 6 102: f0 -> f2 : A'=0, B'=-1+C+M-E, C'=-1+C+M-E, D'=-1+M, E'=-1+M, F'=free_30, G'=free_31, H'=0, Q'=0, J'=free_30, K'=free_31, L'=2, [ M>=1 && M>=2+E && N>=1 && N>=2+C && 7>=free_31 && 7>=free_30 && free_31>=5 && free_30>=1 && N>=C+M-E ], cost: -2+4*M-4*E 103: f0 -> f2 : A'=0, B'=-1+C+M-E, C'=-1+C+M-E, D'=-1+M, E'=-1+M, F'=free_30, G'=free_31, H'=0, Q'=0, J'=free_30, K'=free_31, L'=2, [ M>=1 && M>=2+E && N>=1 && N>=2+C && 7>=free_31 && 7>=free_30 && free_31>=5 && free_30>=1 && N>=C+M-E ], cost: -2+4*M-4*E 104: f0 -> f2 : A'=0, B'=-1+C+M-E, C'=-1+C+M-E, D'=-1+M, E'=-1+M, F'=free_30, G'=free_31, H'=0, Q'=0, J'=free_30, K'=free_31, L'=2, [ M>=1 && M>=3+E && N>=1 && N>=3+C && 7>=free_31 && 7>=free_30 && free_31>=5 && free_30>=1 && N>=C+M-E ], cost: -6+4*M-4*E 105: f0 -> f2 : A'=0, B'=-1+N, C'=-1+N, D'=-1-C+N+E, E'=-1-C+N+E, F'=free_30, G'=free_31, H'=0, Q'=0, J'=free_30, K'=free_31, L'=2, [ M>=1 && M>=2+E && N>=1 && N>=2+C && 7>=free_31 && 7>=free_30 && free_31>=5 && free_30>=1 && M>=-C+N+E ], cost: -2-4*C+4*N 106: f0 -> f2 : A'=0, B'=-1+N, C'=-1+N, D'=-1-C+N+E, E'=-1-C+N+E, F'=free_30, G'=free_31, H'=0, Q'=0, J'=free_30, K'=free_31, L'=2, [ M>=1 && M>=2+E && N>=1 && N>=2+C && 7>=free_31 && 7>=free_30 && free_31>=5 && free_30>=1 && M>=-C+N+E ], cost: -2-4*C+4*N 107: f0 -> f2 : A'=0, B'=-1+N, C'=-1+N, D'=-1-C+N+E, E'=-1-C+N+E, F'=free_30, G'=free_31, H'=0, Q'=0, J'=free_30, K'=free_31, L'=2, [ M>=1 && M>=3+E && N>=1 && N>=3+C && 7>=free_31 && 7>=free_30 && free_31>=5 && free_30>=1 && M>=-C+N+E ], cost: -6-4*C+4*N 108: f0 -> f2 : A'=0, B'=C+2*k_2, C'=C+2*k_2, D'=2*k_2+E, E'=2*k_2+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ M>=3+E && N>=3+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 && k_2>0 && M>=1+2*k_2+E && N>=1+C+2*k_2 ], cost: 2+4*k_2 109: f0 -> f2 : A'=0, B'=C+2*k_2, C'=C+2*k_2, D'=2*k_2+E, E'=2*k_2+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ M>=3+E && N>=3+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 && k_2>0 && M>=1+2*k_2+E && N>=1+C+2*k_2 ], cost: 2+4*k_2 110: f0 -> f2 : A'=0, B'=1+C+2*k_2, C'=1+C+2*k_2, D'=1+2*k_2+E, E'=1+2*k_2+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ M>=4+E && N>=4+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 && k_2>0 && M>=2+2*k_2+E && N>=2+C+2*k_2 ], cost: 2+4*k_2 111: f0 -> [7] : A'=0, B'=C, D'=E, F'=3, G'=free_5, H'=0, Q'=0, J'=3, K'=free_5, L'=2, [ 3>=free_5 && free_5>=1 && M>=1 && N>=1 ], cost: INF 112: f0 -> [7] : A'=0, B'=C, D'=E, F'=3, G'=free_6, H'=0, Q'=0, J'=3, K'=free_6, L'=2, [ 7>=free_6 && free_6>=5 && M>=1 && N>=1 ], cost: INF 113: f0 -> [7] : A'=0, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=3, G'=4, H'=1, Q'=0, J'=3, K'=4, L'=2, [ M>=1 && N>=1 ], cost: INF 114: f0 -> f2 : A'=0, B'=C+2*k_3, C'=C+2*k_3, D'=2*k_3+E, E'=2*k_3+E, F'=free_30, G'=free_31, H'=0, Q'=0, J'=free_30, K'=free_31, L'=2, [ M>=1 && M>=3+E && N>=1 && N>=3+C && 7>=free_31 && 7>=free_30 && free_31>=5 && free_30>=1 && k_3>0 && M>=1+2*k_3+E && N>=1+C+2*k_3 ], cost: 2+4*k_3 115: f0 -> f2 : A'=0, B'=C+2*k_3, C'=C+2*k_3, D'=2*k_3+E, E'=2*k_3+E, F'=free_30, G'=free_31, H'=0, Q'=0, J'=free_30, K'=free_31, L'=2, [ M>=1 && M>=3+E && N>=1 && N>=3+C && 7>=free_31 && 7>=free_30 && free_31>=5 && free_30>=1 && k_3>0 && M>=1+2*k_3+E && N>=1+C+2*k_3 ], cost: 2+4*k_3 116: f0 -> f2 : A'=0, B'=1+C+2*k_3, C'=1+C+2*k_3, D'=1+2*k_3+E, E'=1+2*k_3+E, F'=free_30, G'=free_31, H'=0, Q'=0, J'=free_30, K'=free_31, L'=2, [ M>=1 && M>=4+E && N>=1 && N>=4+C && 7>=free_31 && 7>=free_30 && free_31>=5 && free_30>=1 && k_3>0 && M>=2+2*k_3+E && N>=2+C+2*k_3 ], cost: 2+4*k_3 117: f0 -> f2 : A'=0, B'=C+3*k_4, C'=C+3*k_4, D'=3*k_4+E, E'=3*k_4+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ M>=4+E && N>=4+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 && k_4>0 && M>=1+3*k_4+E && N>=1+C+3*k_4 ], cost: 2+4*k_4 118: f0 -> f2 : A'=0, B'=C+3*k_4, C'=C+3*k_4, D'=3*k_4+E, E'=3*k_4+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ M>=4+E && N>=4+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 && k_4>0 && M>=1+3*k_4+E && N>=1+C+3*k_4 ], cost: 2+4*k_4 119: f0 -> f2 : A'=0, B'=1+C+3*k_4, C'=1+C+3*k_4, D'=1+3*k_4+E, E'=1+3*k_4+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ M>=5+E && N>=5+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 && k_4>0 && M>=2+3*k_4+E && N>=2+C+3*k_4 ], cost: 2+4*k_4 Removed unreachable locations (and leaf rules with constant cost): Start location: f0 94: f0 -> f2 : A'=0, B'=-1+C+M-E, C'=-1+C+M-E, D'=-1+M, E'=-1+M, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ M>=2+E && N>=2+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 && N>=C+M-E ], cost: -2+4*M-4*E 95: f0 -> f2 : A'=0, B'=-1+C+M-E, C'=-1+C+M-E, D'=-1+M, E'=-1+M, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ M>=2+E && N>=2+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 && N>=C+M-E ], cost: -2+4*M-4*E 96: f0 -> f2 : A'=0, B'=-1+C+M-E, C'=-1+C+M-E, D'=-1+M, E'=-1+M, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ M>=3+E && N>=3+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 && N>=C+M-E ], cost: -6+4*M-4*E 97: f0 -> f2 : A'=0, B'=-1+N, C'=-1+N, D'=-1-C+N+E, E'=-1-C+N+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ M>=2+E && N>=2+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 && M>=-C+N+E ], cost: -2-4*C+4*N 98: f0 -> f2 : A'=0, B'=-1+N, C'=-1+N, D'=-1-C+N+E, E'=-1-C+N+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ M>=2+E && N>=2+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 && M>=-C+N+E ], cost: -2-4*C+4*N 99: f0 -> f2 : A'=0, B'=-1+N, C'=-1+N, D'=-1-C+N+E, E'=-1-C+N+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ M>=3+E && N>=3+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 && M>=-C+N+E ], cost: -6-4*C+4*N 102: f0 -> f2 : A'=0, B'=-1+C+M-E, C'=-1+C+M-E, D'=-1+M, E'=-1+M, F'=free_30, G'=free_31, H'=0, Q'=0, J'=free_30, K'=free_31, L'=2, [ M>=1 && M>=2+E && N>=1 && N>=2+C && 7>=free_31 && 7>=free_30 && free_31>=5 && free_30>=1 && N>=C+M-E ], cost: -2+4*M-4*E 103: f0 -> f2 : A'=0, B'=-1+C+M-E, C'=-1+C+M-E, D'=-1+M, E'=-1+M, F'=free_30, G'=free_31, H'=0, Q'=0, J'=free_30, K'=free_31, L'=2, [ M>=1 && M>=2+E && N>=1 && N>=2+C && 7>=free_31 && 7>=free_30 && free_31>=5 && free_30>=1 && N>=C+M-E ], cost: -2+4*M-4*E 104: f0 -> f2 : A'=0, B'=-1+C+M-E, C'=-1+C+M-E, D'=-1+M, E'=-1+M, F'=free_30, G'=free_31, H'=0, Q'=0, J'=free_30, K'=free_31, L'=2, [ M>=1 && M>=3+E && N>=1 && N>=3+C && 7>=free_31 && 7>=free_30 && free_31>=5 && free_30>=1 && N>=C+M-E ], cost: -6+4*M-4*E 105: f0 -> f2 : A'=0, B'=-1+N, C'=-1+N, D'=-1-C+N+E, E'=-1-C+N+E, F'=free_30, G'=free_31, H'=0, Q'=0, J'=free_30, K'=free_31, L'=2, [ M>=1 && M>=2+E && N>=1 && N>=2+C && 7>=free_31 && 7>=free_30 && free_31>=5 && free_30>=1 && M>=-C+N+E ], cost: -2-4*C+4*N 106: f0 -> f2 : A'=0, B'=-1+N, C'=-1+N, D'=-1-C+N+E, E'=-1-C+N+E, F'=free_30, G'=free_31, H'=0, Q'=0, J'=free_30, K'=free_31, L'=2, [ M>=1 && M>=2+E && N>=1 && N>=2+C && 7>=free_31 && 7>=free_30 && free_31>=5 && free_30>=1 && M>=-C+N+E ], cost: -2-4*C+4*N 107: f0 -> f2 : A'=0, B'=-1+N, C'=-1+N, D'=-1-C+N+E, E'=-1-C+N+E, F'=free_30, G'=free_31, H'=0, Q'=0, J'=free_30, K'=free_31, L'=2, [ M>=1 && M>=3+E && N>=1 && N>=3+C && 7>=free_31 && 7>=free_30 && free_31>=5 && free_30>=1 && M>=-C+N+E ], cost: -6-4*C+4*N 108: f0 -> f2 : A'=0, B'=C+2*k_2, C'=C+2*k_2, D'=2*k_2+E, E'=2*k_2+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ M>=3+E && N>=3+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 && k_2>0 && M>=1+2*k_2+E && N>=1+C+2*k_2 ], cost: 2+4*k_2 109: f0 -> f2 : A'=0, B'=C+2*k_2, C'=C+2*k_2, D'=2*k_2+E, E'=2*k_2+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ M>=3+E && N>=3+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 && k_2>0 && M>=1+2*k_2+E && N>=1+C+2*k_2 ], cost: 2+4*k_2 110: f0 -> f2 : A'=0, B'=1+C+2*k_2, C'=1+C+2*k_2, D'=1+2*k_2+E, E'=1+2*k_2+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ M>=4+E && N>=4+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 && k_2>0 && M>=2+2*k_2+E && N>=2+C+2*k_2 ], cost: 2+4*k_2 111: f0 -> [7] : A'=0, B'=C, D'=E, F'=3, G'=free_5, H'=0, Q'=0, J'=3, K'=free_5, L'=2, [ 3>=free_5 && free_5>=1 && M>=1 && N>=1 ], cost: INF 112: f0 -> [7] : A'=0, B'=C, D'=E, F'=3, G'=free_6, H'=0, Q'=0, J'=3, K'=free_6, L'=2, [ 7>=free_6 && free_6>=5 && M>=1 && N>=1 ], cost: INF 113: f0 -> [7] : A'=0, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=3, G'=4, H'=1, Q'=0, J'=3, K'=4, L'=2, [ M>=1 && N>=1 ], cost: INF 114: f0 -> f2 : A'=0, B'=C+2*k_3, C'=C+2*k_3, D'=2*k_3+E, E'=2*k_3+E, F'=free_30, G'=free_31, H'=0, Q'=0, J'=free_30, K'=free_31, L'=2, [ M>=1 && M>=3+E && N>=1 && N>=3+C && 7>=free_31 && 7>=free_30 && free_31>=5 && free_30>=1 && k_3>0 && M>=1+2*k_3+E && N>=1+C+2*k_3 ], cost: 2+4*k_3 115: f0 -> f2 : A'=0, B'=C+2*k_3, C'=C+2*k_3, D'=2*k_3+E, E'=2*k_3+E, F'=free_30, G'=free_31, H'=0, Q'=0, J'=free_30, K'=free_31, L'=2, [ M>=1 && M>=3+E && N>=1 && N>=3+C && 7>=free_31 && 7>=free_30 && free_31>=5 && free_30>=1 && k_3>0 && M>=1+2*k_3+E && N>=1+C+2*k_3 ], cost: 2+4*k_3 116: f0 -> f2 : A'=0, B'=1+C+2*k_3, C'=1+C+2*k_3, D'=1+2*k_3+E, E'=1+2*k_3+E, F'=free_30, G'=free_31, H'=0, Q'=0, J'=free_30, K'=free_31, L'=2, [ M>=1 && M>=4+E && N>=1 && N>=4+C && 7>=free_31 && 7>=free_30 && free_31>=5 && free_30>=1 && k_3>0 && M>=2+2*k_3+E && N>=2+C+2*k_3 ], cost: 2+4*k_3 117: f0 -> f2 : A'=0, B'=C+3*k_4, C'=C+3*k_4, D'=3*k_4+E, E'=3*k_4+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ M>=4+E && N>=4+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 && k_4>0 && M>=1+3*k_4+E && N>=1+C+3*k_4 ], cost: 2+4*k_4 118: f0 -> f2 : A'=0, B'=C+3*k_4, C'=C+3*k_4, D'=3*k_4+E, E'=3*k_4+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ M>=4+E && N>=4+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 && k_4>0 && M>=1+3*k_4+E && N>=1+C+3*k_4 ], cost: 2+4*k_4 119: f0 -> f2 : A'=0, B'=1+C+3*k_4, C'=1+C+3*k_4, D'=1+3*k_4+E, E'=1+3*k_4+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ M>=5+E && N>=5+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 && k_4>0 && M>=2+3*k_4+E && N>=2+C+3*k_4 ], cost: 2+4*k_4 ### Computing asymptotic complexity ### Fully simplified ITS problem Start location: f0 95: f0 -> f2 : A'=0, B'=-1+C+M-E, C'=-1+C+M-E, D'=-1+M, E'=-1+M, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ M>=2+E && N>=2+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 && N>=C+M-E ], cost: -2+4*M-4*E 96: f0 -> f2 : A'=0, B'=-1+C+M-E, C'=-1+C+M-E, D'=-1+M, E'=-1+M, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ M>=3+E && N>=3+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 && N>=C+M-E ], cost: -6+4*M-4*E 98: f0 -> f2 : A'=0, B'=-1+N, C'=-1+N, D'=-1-C+N+E, E'=-1-C+N+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ M>=2+E && N>=2+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 && M>=-C+N+E ], cost: -2-4*C+4*N 99: f0 -> f2 : A'=0, B'=-1+N, C'=-1+N, D'=-1-C+N+E, E'=-1-C+N+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ M>=3+E && N>=3+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 && M>=-C+N+E ], cost: -6-4*C+4*N 103: f0 -> f2 : A'=0, B'=-1+C+M-E, C'=-1+C+M-E, D'=-1+M, E'=-1+M, F'=free_30, G'=free_31, H'=0, Q'=0, J'=free_30, K'=free_31, L'=2, [ M>=1 && M>=2+E && N>=1 && N>=2+C && 7>=free_31 && 7>=free_30 && free_31>=5 && free_30>=1 && N>=C+M-E ], cost: -2+4*M-4*E 104: f0 -> f2 : A'=0, B'=-1+C+M-E, C'=-1+C+M-E, D'=-1+M, E'=-1+M, F'=free_30, G'=free_31, H'=0, Q'=0, J'=free_30, K'=free_31, L'=2, [ M>=1 && M>=3+E && N>=1 && N>=3+C && 7>=free_31 && 7>=free_30 && free_31>=5 && free_30>=1 && N>=C+M-E ], cost: -6+4*M-4*E 106: f0 -> f2 : A'=0, B'=-1+N, C'=-1+N, D'=-1-C+N+E, E'=-1-C+N+E, F'=free_30, G'=free_31, H'=0, Q'=0, J'=free_30, K'=free_31, L'=2, [ M>=1 && M>=2+E && N>=1 && N>=2+C && 7>=free_31 && 7>=free_30 && free_31>=5 && free_30>=1 && M>=-C+N+E ], cost: -2-4*C+4*N 107: f0 -> f2 : A'=0, B'=-1+N, C'=-1+N, D'=-1-C+N+E, E'=-1-C+N+E, F'=free_30, G'=free_31, H'=0, Q'=0, J'=free_30, K'=free_31, L'=2, [ M>=1 && M>=3+E && N>=1 && N>=3+C && 7>=free_31 && 7>=free_30 && free_31>=5 && free_30>=1 && M>=-C+N+E ], cost: -6-4*C+4*N 109: f0 -> f2 : A'=0, B'=C+2*k_2, C'=C+2*k_2, D'=2*k_2+E, E'=2*k_2+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ M>=3+E && N>=3+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 && k_2>0 && M>=1+2*k_2+E && N>=1+C+2*k_2 ], cost: 2+4*k_2 110: f0 -> f2 : A'=0, B'=1+C+2*k_2, C'=1+C+2*k_2, D'=1+2*k_2+E, E'=1+2*k_2+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ M>=4+E && N>=4+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 && k_2>0 && M>=2+2*k_2+E && N>=2+C+2*k_2 ], cost: 2+4*k_2 111: f0 -> [7] : A'=0, B'=C, D'=E, F'=3, G'=free_5, H'=0, Q'=0, J'=3, K'=free_5, L'=2, [ 3>=free_5 && free_5>=1 && M>=1 && N>=1 ], cost: INF 112: f0 -> [7] : A'=0, B'=C, D'=E, F'=3, G'=free_6, H'=0, Q'=0, J'=3, K'=free_6, L'=2, [ 7>=free_6 && free_6>=5 && M>=1 && N>=1 ], cost: INF 113: f0 -> [7] : A'=0, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=3, G'=4, H'=1, Q'=0, J'=3, K'=4, L'=2, [ M>=1 && N>=1 ], cost: INF 115: f0 -> f2 : A'=0, B'=C+2*k_3, C'=C+2*k_3, D'=2*k_3+E, E'=2*k_3+E, F'=free_30, G'=free_31, H'=0, Q'=0, J'=free_30, K'=free_31, L'=2, [ M>=1 && M>=3+E && N>=1 && N>=3+C && 7>=free_31 && 7>=free_30 && free_31>=5 && free_30>=1 && k_3>0 && M>=1+2*k_3+E && N>=1+C+2*k_3 ], cost: 2+4*k_3 116: f0 -> f2 : A'=0, B'=1+C+2*k_3, C'=1+C+2*k_3, D'=1+2*k_3+E, E'=1+2*k_3+E, F'=free_30, G'=free_31, H'=0, Q'=0, J'=free_30, K'=free_31, L'=2, [ M>=1 && M>=4+E && N>=1 && N>=4+C && 7>=free_31 && 7>=free_30 && free_31>=5 && free_30>=1 && k_3>0 && M>=2+2*k_3+E && N>=2+C+2*k_3 ], cost: 2+4*k_3 118: f0 -> f2 : A'=0, B'=C+3*k_4, C'=C+3*k_4, D'=3*k_4+E, E'=3*k_4+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ M>=4+E && N>=4+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 && k_4>0 && M>=1+3*k_4+E && N>=1+C+3*k_4 ], cost: 2+4*k_4 119: f0 -> f2 : A'=0, B'=1+C+3*k_4, C'=1+C+3*k_4, D'=1+3*k_4+E, E'=1+3*k_4+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ M>=5+E && N>=5+C && M>=1 && N>=1 && 7>=free_32 && free_32>=1 && k_4>0 && M>=2+3*k_4+E && N>=2+C+3*k_4 ], cost: 2+4*k_4 Computing asymptotic complexity for rule 95 Solved the limit problem by the following transformations: Created initial limit problem: 1-C-M+N+E (+/+!), -1+M-E (+/+!), -2+4*M-4*E (+), free_32 (+/+!), M (+/+!), -1-C+N (+/+!), N (+/+!), 8-free_32 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-n,free_32==1,M==1,N==1,E==-n} resulting limit problem: [solved] Solution: C / -n free_32 / 1 M / 1 N / 1 E / -n Resulting cost 2+4*n has complexity: Poly(n^1) Found new complexity Poly(n^1). Computing asymptotic complexity for rule 109 Simplified the guard: 109: f0 -> f2 : A'=0, B'=C+2*k_2, C'=C+2*k_2, D'=2*k_2+E, E'=2*k_2+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ M>=1 && N>=1 && 7>=free_32 && free_32>=1 && k_2>0 && M>=1+2*k_2+E && N>=1+C+2*k_2 ], cost: 2+4*k_2 Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-3*n,free_32==1,M==1,N==1,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {M==1+2*k_2+E} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==1+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-3*n,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1+2*k_2+E} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {N==1+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 7 (+/+!), 1-C-2*k_2 (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), 1-C-2*k_2 (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-3*n,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {M==1+2*k_2+E} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==1+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 1+C+2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 1+C+2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), 1+C+2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==0,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1+2*k_2+E} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), 7 (+/+!), N (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {N==1+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 1+C+2*k_2 (+/+!), 7 (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 1+C+2*k_2 (+/+!), 7 (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), 1+C+2*k_2 (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==0,k_2==n,E==0} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {M==1+2*k_2+E} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==1+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-3*n,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1+2*k_2+E} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {N==1+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 7 (+/+!), 1-C-2*k_2 (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), 1-C-2*k_2 (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-3*n,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {M==1+2*k_2+E} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==1+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 1+C+2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 1+C+2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), 1+C+2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==0,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1+2*k_2+E} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), 7 (+/+!), N (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {N==1+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 1+C+2*k_2 (+/+!), 7 (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 1+C+2*k_2 (+/+!), 7 (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), 1+C+2*k_2 (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==0,k_2==n,E==0} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {M==1+2*k_2+E} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==1+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-3*n,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1+2*k_2+E} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {N==1+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 7 (+/+!), 1-C-2*k_2 (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), 1-C-2*k_2 (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-3*n,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {M==1+2*k_2+E} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==1+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 1+C+2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 1+C+2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), 1+C+2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==0,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1+2*k_2+E} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), 7 (+/+!), N (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {N==1+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 1+C+2*k_2 (+/+!), 7 (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 1+C+2*k_2 (+/+!), 7 (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), 1+C+2*k_2 (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==0,k_2==n,E==0} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {M==1+2*k_2+E} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==1+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), free_32 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-2*n,free_32==1,k_2==n,E==-3*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1+2*k_2+E} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), 1-C-2*k_2 (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {N==1+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), 1-C-2*k_2 (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), free_32 (+/+!), 1-C-2*k_2 (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-2*n,free_32==1,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {M==1+2*k_2+E} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==1+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 1+C+2*k_2 (+/+!), free_32 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 1+C+2*k_2 (+/+!), free_32 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-2*n,free_32==1,k_2==n,E==-3*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1+2*k_2+E} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), free_32 (+/+!), N (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {N==1+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 1+C+2*k_2 (+/+!), free_32 (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 1+C+2*k_2 (+/+!), free_32 (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==0,free_32==1,k_2==n,E==0} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==1+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-3*n,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {N==1+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), M-2*k_2-E (+/+!), M (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-2*n,M==1,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==1+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 1+C+2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 1+C+2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), 1+C+2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==0,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {N==1+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 1+C+2*k_2 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 1+C+2*k_2 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), 1+C+2*k_2 (+/+!), M-2*k_2-E (+/+!), M (+/+!), k_2 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-2*n,M==1,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==1+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-3*n,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {N==1+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), M-2*k_2-E (+/+!), M (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-2*n,M==1,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==1+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 1+C+2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 1+C+2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), 1+C+2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==0,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {N==1+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 1+C+2*k_2 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 1+C+2*k_2 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), 1+C+2*k_2 (+/+!), M-2*k_2-E (+/+!), M (+/+!), k_2 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-2*n,M==1,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==1+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-3*n,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {N==1+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), M-2*k_2-E (+/+!), M (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-2*n,M==1,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==1+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 1+C+2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 1+C+2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), 1+C+2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==0,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {N==1+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 1+C+2*k_2 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 1+C+2*k_2 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), 1+C+2*k_2 (+/+!), M-2*k_2-E (+/+!), M (+/+!), k_2 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-2*n,M==1,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==1+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), free_32 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-2*n,free_32==1,k_2==n,E==-3*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {N==1+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-3*n,free_32==1,M==1,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==1+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 1+C+2*k_2 (+/+!), free_32 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 1+C+2*k_2 (+/+!), free_32 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-2*n,free_32==1,k_2==n,E==-3*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {N==1+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 1+C+2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 1+C+2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==0,free_32==1,M==1,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {M==1+2*k_2+E} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-3*n,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1+2*k_2+E} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 7 (+/+!), 1-C-2*k_2 (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), 1-C-2*k_2 (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-3*n,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {M==1+2*k_2+E} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), N (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-2*n,N==1,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1+2*k_2+E} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), 7 (+/+!), N (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 7 (+/+!), N (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), N (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-2*n,N==1,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {M==1+2*k_2+E} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-3*n,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1+2*k_2+E} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 7 (+/+!), 1-C-2*k_2 (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), 1-C-2*k_2 (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-3*n,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {M==1+2*k_2+E} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), N (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-2*n,N==1,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1+2*k_2+E} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), 7 (+/+!), N (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 7 (+/+!), N (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), N (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-2*n,N==1,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {M==1+2*k_2+E} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-3*n,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1+2*k_2+E} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 7 (+/+!), 1-C-2*k_2 (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), 1-C-2*k_2 (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-3*n,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {M==1+2*k_2+E} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), N (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-2*n,N==1,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1+2*k_2+E} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), 7 (+/+!), N (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 7 (+/+!), N (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), N (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-2*n,N==1,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {M==1+2*k_2+E} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), free_32 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-2*n,free_32==1,k_2==n,E==-3*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1+2*k_2+E} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), 1-C-2*k_2 (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), free_32 (+/+!), 1-C-2*k_2 (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-2*n,free_32==1,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {M==1+2*k_2+E} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-3*n,free_32==1,N==1,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1+2*k_2+E} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), free_32 (+/+!), N (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), N (+/+!), 1+2*k_2+E (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-2*n,free_32==1,N==1,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-3*n,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), M-2*k_2-E (+/+!), M (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-2*n,M==1,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), N (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-2*n,N==1,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-n,M==1,N==1+n,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-3*n,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), M-2*k_2-E (+/+!), M (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-2*n,M==1,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), N (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-2*n,N==1,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-n,M==1,N==1+n,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), 1-C-2*k_2 (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-3*n,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), M-2*k_2-E (+/+!), M (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-2*n,M==1,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), N (+/+!), k_2 (+/+!), 1-2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-2*n,N==1,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-n,M==1,N==1+n,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), free_32 (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-2*n,free_32==1,k_2==n,E==-3*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), 1-C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-3*n,free_32==1,M==1,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), M-2*k_2-E (+/+!), M (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), -C+N-2*k_2 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), 1-2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-3*n,free_32==1,N==1,k_2==n,E==-2*n} resulting limit problem: [solved] Solution: C / -3*n free_32 / 1 M / 1 N / 1 k_2 / n E / -2*n Resulting cost 2+4*n has complexity: Poly(n^1) Computing asymptotic complexity for rule 110 Simplified the guard: 110: f0 -> f2 : A'=0, B'=1+C+2*k_2, C'=1+C+2*k_2, D'=1+2*k_2+E, E'=1+2*k_2+E, F'=free_32, G'=4, H'=0, Q'=0, J'=free_32, K'=4, L'=2, [ M>=1 && N>=1 && 7>=free_32 && free_32>=1 && k_2>0 && M>=2+2*k_2+E && N>=2+C+2*k_2 ], cost: 2+4*k_2 Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-n,free_32==1,M==1+n,N==2+n,k_2==n,E==-1-n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), -C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {M==2+2*k_2+E} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==2+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), -C-2*k_2 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-3*n,k_2==n,E==-1-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), M (+/+!), -C-2*k_2 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==2+2*k_2+E} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!) [not solved] applying transformation rule (C) using substitution {N==2+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), -C-2*k_2 (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-3*n,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {M==2+2*k_2+E} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==2+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 2+C+2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 2+C+2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), 2+C+2*k_2 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==0,k_2==n,E==-1-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==2+2*k_2+E} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {N==2+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 2+C+2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 2+C+2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), 2+C+2*k_2 (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==0,k_2==n,E==0} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), -C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {M==2+2*k_2+E} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==2+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), -C-2*k_2 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-3*n,k_2==n,E==-1-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), M (+/+!), -C-2*k_2 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==2+2*k_2+E} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!) [not solved] applying transformation rule (C) using substitution {N==2+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), -C-2*k_2 (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-3*n,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {M==2+2*k_2+E} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==2+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 2+C+2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 2+C+2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), 2+C+2*k_2 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==0,k_2==n,E==-1-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==2+2*k_2+E} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {N==2+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 2+C+2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 2+C+2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), 2+C+2*k_2 (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==0,k_2==n,E==0} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), -C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {M==2+2*k_2+E} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==2+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), -C-2*k_2 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-3*n,k_2==n,E==-1-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), M (+/+!), -C-2*k_2 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==2+2*k_2+E} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!) [not solved] applying transformation rule (C) using substitution {N==2+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), -C-2*k_2 (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-3*n,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {M==2+2*k_2+E} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==2+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 2+C+2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 2+C+2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), 2+C+2*k_2 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==0,k_2==n,E==-1-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==2+2*k_2+E} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {N==2+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 2+C+2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 2+C+2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), 2+C+2*k_2 (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==0,k_2==n,E==0} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), -C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {M==2+2*k_2+E} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), -C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==2+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), -C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), free_32 (+/+!), -C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-1-2*n,free_32==1,k_2==n,E==-3*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), M (+/+!), -C-2*k_2 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {M==2+2*k_2+E} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), -C-2*k_2 (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {N==2+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), -C-2*k_2 (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), free_32 (+/+!), -C-2*k_2 (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!), 8-free_32 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-1-2*n,free_32==1,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {M==2+2*k_2+E} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==2+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 2+C+2*k_2 (+/+!), free_32 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 2+C+2*k_2 (+/+!), free_32 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-2*n,free_32==1,k_2==n,E==-3*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==2+2*k_2+E} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {N==2+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 2+C+2*k_2 (+/+!), free_32 (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 2+C+2*k_2 (+/+!), free_32 (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!), 8-free_32 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==0,free_32==1,k_2==n,E==0} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), -C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==2+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), -C-2*k_2 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-3*n,k_2==n,E==-1-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), M (+/+!), -C-2*k_2 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {N==2+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), M (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), M (+/+!), -C-2*k_2 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-1-2*n,M==2*n,k_2==n,E==-2} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==2+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 2+C+2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 2+C+2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), 2+C+2*k_2 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==0,k_2==n,E==-1-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {N==2+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 2+C+2*k_2 (+/+!), M (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 2+C+2*k_2 (+/+!), M (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), 2+C+2*k_2 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-2*n,M==1+2*n,k_2==n,E==-1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), -C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==2+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), -C-2*k_2 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-3*n,k_2==n,E==-1-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), M (+/+!), -C-2*k_2 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {N==2+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), M (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), M (+/+!), -C-2*k_2 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-1-2*n,M==2*n,k_2==n,E==-2} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==2+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 2+C+2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 2+C+2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), 2+C+2*k_2 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==0,k_2==n,E==-1-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {N==2+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 2+C+2*k_2 (+/+!), M (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 2+C+2*k_2 (+/+!), M (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), 2+C+2*k_2 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-2*n,M==1+2*n,k_2==n,E==-1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), -C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==2+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), -C-2*k_2 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-3*n,k_2==n,E==-1-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), M (+/+!), -C-2*k_2 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {N==2+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), M (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), M (+/+!), -C-2*k_2 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-1-2*n,M==2*n,k_2==n,E==-2} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==2+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 2+C+2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 2+C+2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), 2+C+2*k_2 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==0,k_2==n,E==-1-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {N==2+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 2+C+2*k_2 (+/+!), M (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 2+C+2*k_2 (+/+!), M (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), 2+C+2*k_2 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-2*n,M==1+2*n,k_2==n,E==-1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), -C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==2+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), -C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), free_32 (+/+!), -C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-1-2*n,free_32==1,k_2==n,E==-3*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), M (+/+!), -C-2*k_2 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {N==2+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), M (+/+!), -C-2*k_2 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -C-2*k_2 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-1-2*n,free_32==1,M==2*n,k_2==n,E==-2} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==2+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 2+C+2*k_2 (+/+!), free_32 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 2+C+2*k_2 (+/+!), free_32 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-2*n,free_32==1,k_2==n,E==-3*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {N==2+C+2*k_2} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 2+C+2*k_2 (+/+!), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 2+C+2*k_2 (+/+!), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==0,free_32==1,M==1+2*n,k_2==n,E==-1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), -C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {M==2+2*k_2+E} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), -C-2*k_2 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-3*n,k_2==n,E==-1-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), M (+/+!), -C-2*k_2 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==2+2*k_2+E} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), -C-2*k_2 (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-3*n,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {M==2+2*k_2+E} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 7 (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-n,N==2+n,k_2==n,E==-1-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==2+2*k_2+E} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 7 (+/+!), N (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), N (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-n,N==2+n,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), -C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {M==2+2*k_2+E} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), -C-2*k_2 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-3*n,k_2==n,E==-1-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), M (+/+!), -C-2*k_2 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==2+2*k_2+E} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), -C-2*k_2 (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-3*n,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {M==2+2*k_2+E} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 7 (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-n,N==2+n,k_2==n,E==-1-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==2+2*k_2+E} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 7 (+/+!), N (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), N (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-n,N==2+n,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), -C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {M==2+2*k_2+E} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), -C-2*k_2 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-3*n,k_2==n,E==-1-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), M (+/+!), -C-2*k_2 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==2+2*k_2+E} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), -C-2*k_2 (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-3*n,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {M==2+2*k_2+E} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 7 (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-n,N==2+n,k_2==n,E==-1-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==2+2*k_2+E} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 7 (+/+!), N (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), N (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-n,N==2+n,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), -C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {M==2+2*k_2+E} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), -C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), free_32 (+/+!), -C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-1-2*n,free_32==1,k_2==n,E==-3*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), M (+/+!), -C-2*k_2 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {M==2+2*k_2+E} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), -C-2*k_2 (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), free_32 (+/+!), -C-2*k_2 (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!), 8-free_32 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-1-2*n,free_32==1,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {M==2+2*k_2+E} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-n,free_32==1,N==2+n,k_2==n,E==-1-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==2+2*k_2+E} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), free_32 (+/+!), N (+/+!), k_2 (+/+!), 2+2*k_2+E (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-n,free_32==1,N==2+n,k_2==n,E==-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), -C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), -C-2*k_2 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-3*n,k_2==n,E==-1-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), M (+/+!), -C-2*k_2 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), M (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), M (+/+!), -C-2*k_2 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-1-2*n,M==2*n,k_2==n,E==-2} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 7 (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-n,N==2+n,k_2==n,E==-1-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), M (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-n,M==1+2*n,N==2+n,k_2==n,E==-1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), -C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), -C-2*k_2 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-3*n,k_2==n,E==-1-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), M (+/+!), -C-2*k_2 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), M (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), M (+/+!), -C-2*k_2 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-1-2*n,M==2*n,k_2==n,E==-2} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 7 (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-n,N==2+n,k_2==n,E==-1-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), M (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-n,M==1+2*n,N==2+n,k_2==n,E==-1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), -C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), -C-2*k_2 (+/+!), 7 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), -C-2*k_2 (+/+!), k_2 (+/+!), -2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-3*n,k_2==n,E==-1-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), M (+/+!), -C-2*k_2 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), M (+/+!), -C-2*k_2 (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), M (+/+!), -C-2*k_2 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-1-2*n,M==2*n,k_2==n,E==-2} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), 7 (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), 7 (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-n,N==2+n,k_2==n,E==-1-2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {free_32==7} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), M (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), M (+/+!), 7 (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (B), deleting 7 (+/+!) resulting limit problem: 2+4*k_2 (+), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-n,M==1+2*n,N==2+n,k_2==n,E==-1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), -C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), free_32 (+/+!), -C-2*k_2 (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-1-2*n,free_32==1,k_2==n,E==-3*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {N==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), M (+/+!), -C-2*k_2 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -C-2*k_2 (+/+!), -1+M-2*k_2-E (+/+!), k_2 (+/+!), 8-free_32 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-1-2*n,free_32==1,M==2*n,k_2==n,E==-2} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2+4*k_2 (+), free_32 (+/+!), M (+/+!), -1+M-2*k_2-E (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!) [not solved] applying transformation rule (C) using substitution {M==1} resulting limit problem: 2+4*k_2 (+), 1 (+/+!), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+4*k_2 (+), free_32 (+/+!), N (+/+!), k_2 (+/+!), 8-free_32 (+/+!), -1-C+N-2*k_2 (+/+!), -2*k_2-E (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {C==-n,free_32==1,N==2+n,k_2==n,E==-1-2*n} resulting limit problem: [solved] Solution: C / -n free_32 / 1 M / 1+n N / 2+n k_2 / n E / -1-n Resulting cost 2+4*n has complexity: Poly(n^1) Computing asymptotic complexity for rule 111 Resulting cost INF has complexity: Nonterm Found new complexity Nonterm. Obtained the following overall complexity (w.r.t. the length of the input n): Complexity: Nonterm Cpx degree: Nonterm Solved cost: INF Rule cost: INF Rule guard: [ 3>=free_5 && free_5>=1 && M>=1 && N>=1 ] NO ---------------------------------------- (2) BOUNDS(INF, INF)