/export/starexec/sandbox2/solver/bin/starexec_run_complexity /export/starexec/sandbox2/benchmark/theBenchmark.koat /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1), O(n^1)) proof of /export/starexec/sandbox2/benchmark/theBenchmark.koat # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(n^1, n^1). (0) CpxIntTrs (1) Koat Proof [FINISHED, 666 ms] (2) BOUNDS(1, n^1) (3) Loat Proof [FINISHED, 9000 ms] (4) BOUNDS(n^1, INF) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: f2(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W) -> Com_1(f13(1, X, Y, Z, A1, B1, C1, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W)) :|: A >= 1 && A <= 1 f13(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W) -> Com_1(f16(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W)) :|: H >= I f16(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W) -> Com_1(f16(A, B, C, D, E, F, G, H, I, J, K + 1, L + 2, M, N, O, P, Q, R, S, T, U, V, W)) :|: J >= K f2(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W) -> Com_1(f27(A, X, Y, Z, A1, B1, C1, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W)) :|: 0 >= A f2(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W) -> Com_1(f27(A, X, Y, Z, A1, B1, C1, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W)) :|: A >= 2 f27(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W) -> Com_1(f35(A, B, C, D, E, F, G, H, I, J, K, L, H - I + 2, 1, 0, P, Q, R, S, T, U, V, W)) :|: 0 >= I && H >= I f27(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W) -> Com_1(f35(A, B, C, D, E, F, G, H, I, J, K, L, H - I + 2, 1, 0, P, Q, R, S, T, U, V, W)) :|: I >= 2 && H >= I f27(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W) -> Com_1(f35(A, B, C, D, E, F, G, H, 1, J, K, L, 1, 1, 0, P, Q, R, S, T, U, V, W)) :|: H >= 1 && I >= 1 && I <= 1 f35(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W) -> Com_1(f38(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W)) :|: P >= 2 * X && 3 * X >= P + 1 && X + 1 >= Q f38(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W) -> Com_1(f53(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W)) :|: 0 >= Q && J >= K f38(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W) -> Com_1(f53(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W)) :|: Q >= 2 && J >= K f38(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W) -> Com_1(f38(A, B, C, D, E, F, G, H, I, J, K + 1, X + 3, M, N, O, P, 1, B * Y + B * Z, B * A1 - B * B1, C * C1 - C * D1, -(C) * E1 - C * F1, V, W)) :|: J >= K + 4 * X && 5 * X + K >= J + 1 && 0 >= K && J >= K && Q >= 1 && Q <= 1 f38(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W) -> Com_1(f38(A, B, C, D, E, F, G, H, I, J, K + 1, X + 3, M, N, O, P, 1, B * Y + B * Z, B * A1 - B * B1, C * C1 - C * D1, -(C) * E1 - C * F1, V, W)) :|: J >= K + 4 * X && 5 * X + K >= J + 1 && J >= K && K >= 2 && Q >= 1 && Q <= 1 f38(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W) -> Com_1(f38(A, B, C, D, E, F, G, H, I, J, 2, 1, M, N, O, P, 1, B * X + B * Y, B * Z - B * A1, C * B1 - C * C1, -(C) * D1 - C * E1, V, W)) :|: J >= 1 && K >= 1 && K <= 1 && Q >= 1 && Q <= 1 f53(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W) -> Com_1(f38(A, B, C, D, E, F, G, H, I, J, K + 1, J - K + 2, M, N, O, P, Q, B * X + B * Y, B * Z - B * A1, C * B1 - C * C1, -(C) * D1 - C * E1, P + 3 - F1, W)) :|: Q >= 2 * F1 && 3 * F1 >= Q + 1 && 0 >= K f53(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W) -> Com_1(f38(A, B, C, D, E, F, G, H, I, J, K + 1, J - K + 2, M, N, O, P, Q, B * X + B * Y, B * Z - B * A1, C * B1 - C * C1, -(C) * D1 - C * E1, P + 3 - F1, W)) :|: Q >= 2 * F1 && 3 * F1 >= Q + 1 && K >= 2 f53(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W) -> Com_1(f38(A, B, C, D, E, F, G, H, I, J, 2, 1, M, N, O, P, Q, B * X + B * Y, B * Z - B * A1, C * B1 - C * C1, -(C) * D1 - C * E1, P + 3 - F1, W)) :|: Q >= 2 * F1 && 3 * F1 >= Q + 1 && K >= 1 && K <= 1 f38(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W) -> Com_1(f35(A, B, C, D, N, F, G, H, I, J, K, L, M, F * N - G * O + N, F * O + G * N + O, P, Q + 1, R, S, T, U, V, W + 2)) :|: K >= 1 + J f35(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W) -> Com_1(f27(A, B, C, D, E, F, G, H, I + 1, J, K, L, M, N, O, P, Q, R, S, T, U, V, W)) :|: P >= 2 * X && 3 * X >= P + 1 && Q >= 2 + X f27(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W) -> Com_1(f1(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W)) :|: 0 >= 2 + A && I >= 1 + H f27(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W) -> Com_1(f1(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W)) :|: A >= 0 && I >= 1 + H f27(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W) -> Com_1(f1(-(1), B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W)) :|: I >= 1 + H && A + 1 >= 0 && A + 1 <= 0 f16(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W) -> Com_1(f13(A, B, C, D, E, F, G, H, I + 1, J, K, L, M, N, O, P, Q, R, S, T, U, V, W)) :|: K >= 1 + J f13(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W) -> Com_1(f27(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W)) :|: I >= 1 + H The start-symbols are:[f2_23] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 8*Ar_7 + 8*Ar_8 + 8*Ar_9 + 18*Ar_10 + 3*Ar_15 + 3*Ar_16 + 50) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) f2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22) -> Com_1(f13(1, Fresh_65, Fresh_66, Fresh_67, Fresh_68, Fresh_69, Fresh_70, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22)) [ Ar_0 = 1 ] (Comp: ?, Cost: 1) f13(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22) -> Com_1(f16(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22)) [ Ar_7 >= Ar_8 ] (Comp: ?, Cost: 1) f16(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22) -> Com_1(f16(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_11 + 2, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22)) [ Ar_9 >= Ar_10 ] (Comp: ?, Cost: 1) f2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22) -> Com_1(f27(Ar_0, Fresh_59, Fresh_60, Fresh_61, Fresh_62, Fresh_63, Fresh_64, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22)) [ 0 >= Ar_0 ] (Comp: ?, Cost: 1) f2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22) -> Com_1(f27(Ar_0, Fresh_53, Fresh_54, Fresh_55, Fresh_56, Fresh_57, Fresh_58, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22)) [ Ar_0 >= 2 ] (Comp: ?, Cost: 1) f27(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22) -> Com_1(f35(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_7 - Ar_8 + 2, 1, 0, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22)) [ 0 >= Ar_8 /\ Ar_7 >= Ar_8 ] (Comp: ?, Cost: 1) f27(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22) -> Com_1(f35(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_7 - Ar_8 + 2, 1, 0, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22)) [ Ar_8 >= 2 /\ Ar_7 >= Ar_8 ] (Comp: ?, Cost: 1) f27(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22) -> Com_1(f35(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, 1, Ar_9, Ar_10, Ar_11, 1, 1, 0, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22)) [ Ar_7 >= 1 /\ Ar_8 = 1 ] (Comp: ?, Cost: 1) f35(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22) -> Com_1(f38(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22)) [ Ar_15 >= 2*X' /\ 3*X' >= Ar_15 + 1 /\ X' + 1 >= Ar_16 ] (Comp: ?, Cost: 1) f38(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22) -> Com_1(f53(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22)) [ 0 >= Ar_16 /\ Ar_9 >= Ar_10 ] (Comp: ?, Cost: 1) f38(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22) -> Com_1(f53(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22)) [ Ar_16 >= 2 /\ Ar_9 >= Ar_10 ] (Comp: ?, Cost: 1) f38(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22) -> Com_1(f38(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Fresh_44 + 3, Ar_12, Ar_13, Ar_14, Ar_15, 1, Ar_1*Fresh_45 + Ar_1*Fresh_46, Ar_1*Fresh_47 - Ar_1*Fresh_48, Ar_2*Fresh_49 - Ar_2*Fresh_50, -Ar_2*Fresh_51 - Ar_2*Fresh_52, Ar_21, Ar_22)) [ Ar_9 >= Ar_10 + 4*Fresh_44 /\ 5*Fresh_44 + Ar_10 >= Ar_9 + 1 /\ 0 >= Ar_10 /\ Ar_9 >= Ar_10 /\ Ar_16 = 1 ] (Comp: ?, Cost: 1) f38(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22) -> Com_1(f38(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Fresh_35 + 3, Ar_12, Ar_13, Ar_14, Ar_15, 1, Ar_1*Fresh_36 + Ar_1*Fresh_37, Ar_1*Fresh_38 - Ar_1*Fresh_39, Ar_2*Fresh_40 - Ar_2*Fresh_41, -Ar_2*Fresh_42 - Ar_2*Fresh_43, Ar_21, Ar_22)) [ Ar_9 >= Ar_10 + 4*Fresh_35 /\ 5*Fresh_35 + Ar_10 >= Ar_9 + 1 /\ Ar_9 >= Ar_10 /\ Ar_10 >= 2 /\ Ar_16 = 1 ] (Comp: ?, Cost: 1) f38(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22) -> Com_1(f38(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, 2, 1, Ar_12, Ar_13, Ar_14, Ar_15, 1, Ar_1*Fresh_27 + Ar_1*Fresh_28, Ar_1*Fresh_29 - Ar_1*Fresh_30, Ar_2*Fresh_31 - Ar_2*Fresh_32, -Ar_2*Fresh_33 - Ar_2*Fresh_34, Ar_21, Ar_22)) [ Ar_9 >= 1 /\ Ar_10 = 1 /\ Ar_16 = 1 ] (Comp: ?, Cost: 1) f53(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22) -> Com_1(f38(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_9 - Ar_10 + 2, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_1*Fresh_18 + Ar_1*Fresh_19, Ar_1*Fresh_20 - Ar_1*Fresh_21, Ar_2*Fresh_22 - Ar_2*Fresh_23, -Ar_2*Fresh_24 - Ar_2*Fresh_25, Ar_15 - Fresh_26 + 3, Ar_22)) [ Ar_16 >= 2*Fresh_26 /\ 3*Fresh_26 >= Ar_16 + 1 /\ 0 >= Ar_10 ] (Comp: ?, Cost: 1) f53(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22) -> Com_1(f38(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_9 - Ar_10 + 2, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_1*Fresh_9 + Ar_1*Fresh_10, Ar_1*Fresh_11 - Ar_1*Fresh_12, Ar_2*Fresh_13 - Ar_2*Fresh_14, -Ar_2*Fresh_15 - Ar_2*Fresh_16, Ar_15 - Fresh_17 + 3, Ar_22)) [ Ar_16 >= 2*Fresh_17 /\ 3*Fresh_17 >= Ar_16 + 1 /\ Ar_10 >= 2 ] (Comp: ?, Cost: 1) f53(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22) -> Com_1(f38(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, 2, 1, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_1*Fresh_0 + Ar_1*Fresh_1, Ar_1*Fresh_2 - Ar_1*Fresh_3, Ar_2*Fresh_4 - Ar_2*Fresh_5, -Ar_2*Fresh_6 - Ar_2*Fresh_7, Ar_15 - Fresh_8 + 3, Ar_22)) [ Ar_16 >= 2*Fresh_8 /\ 3*Fresh_8 >= Ar_16 + 1 /\ Ar_10 = 1 ] (Comp: ?, Cost: 1) f38(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22) -> Com_1(f35(Ar_0, Ar_1, Ar_2, Ar_3, Ar_13, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13*Ar_5 - Ar_14*Ar_6 + Ar_13, Ar_14*Ar_5 + Ar_13*Ar_6 + Ar_14, Ar_15, Ar_16 + 1, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22 + 2)) [ Ar_10 >= Ar_9 + 1 ] (Comp: ?, Cost: 1) f35(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22) -> Com_1(f27(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8 + 1, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22)) [ Ar_15 >= 2*X' /\ 3*X' >= Ar_15 + 1 /\ Ar_16 >= X' + 2 ] (Comp: ?, Cost: 1) f27(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22)) [ 0 >= Ar_0 + 2 /\ Ar_8 >= Ar_7 + 1 ] (Comp: ?, Cost: 1) f27(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22)) [ Ar_0 >= 0 /\ Ar_8 >= Ar_7 + 1 ] (Comp: ?, Cost: 1) f27(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22) -> Com_1(f1(-1, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22)) [ Ar_8 >= Ar_7 + 1 /\ Ar_0 + 1 = 0 ] (Comp: ?, Cost: 1) f16(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22) -> Com_1(f13(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8 + 1, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22)) [ Ar_10 >= Ar_9 + 1 ] (Comp: ?, Cost: 1) f13(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22) -> Com_1(f27(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22)) [ Ar_8 >= Ar_7 + 1 ] (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22) -> Com_1(f2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Slicing away variables that do not contribute to conditions from problem 1 leaves variables [Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16]. We thus obtain the following problem: 2: T: (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f2(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 <= 0 ] (Comp: ?, Cost: 1) f13(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_8 >= Ar_7 + 1 ] (Comp: ?, Cost: 1) f16(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f13(Ar_0, Ar_7, Ar_8 + 1, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_10 >= Ar_9 + 1 ] (Comp: ?, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f1(-1, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_8 >= Ar_7 + 1 /\ Ar_0 + 1 = 0 ] (Comp: ?, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f1(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_0 >= 0 /\ Ar_8 >= Ar_7 + 1 ] (Comp: ?, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f1(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 >= Ar_0 + 2 /\ Ar_8 >= Ar_7 + 1 ] (Comp: ?, Cost: 1) f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f27(Ar_0, Ar_7, Ar_8 + 1, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_15 >= 2*X' /\ 3*X' >= Ar_15 + 1 /\ Ar_16 >= X' + 2 ] (Comp: ?, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16 + 1)) [ Ar_10 >= Ar_9 + 1 ] (Comp: ?, Cost: 1) f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, 2, Ar_15, Ar_16)) [ Ar_16 >= 2*Fresh_8 /\ 3*Fresh_8 >= Ar_16 + 1 /\ Ar_10 = 1 ] (Comp: ?, Cost: 1) f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, Ar_16)) [ Ar_16 >= 2*Fresh_17 /\ 3*Fresh_17 >= Ar_16 + 1 /\ Ar_10 >= 2 ] (Comp: ?, Cost: 1) f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, Ar_16)) [ Ar_16 >= 2*Fresh_26 /\ 3*Fresh_26 >= Ar_16 + 1 /\ 0 >= Ar_10 ] (Comp: ?, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, 2, Ar_15, 1)) [ Ar_9 >= 1 /\ Ar_10 = 1 /\ Ar_16 = 1 ] (Comp: ?, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, 1)) [ Ar_9 >= Ar_10 + 4*Fresh_35 /\ 5*Fresh_35 + Ar_10 >= Ar_9 + 1 /\ Ar_9 >= Ar_10 /\ Ar_10 >= 2 /\ Ar_16 = 1 ] (Comp: ?, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, 1)) [ Ar_9 >= Ar_10 + 4*Fresh_44 /\ 5*Fresh_44 + Ar_10 >= Ar_9 + 1 /\ 0 >= Ar_10 /\ Ar_9 >= Ar_10 /\ Ar_16 = 1 ] (Comp: ?, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_16 >= 2 /\ Ar_9 >= Ar_10 ] (Comp: ?, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 >= Ar_16 /\ Ar_9 >= Ar_10 ] (Comp: ?, Cost: 1) f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_15 >= 2*X' /\ 3*X' >= Ar_15 + 1 /\ X' + 1 >= Ar_16 ] (Comp: ?, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f35(Ar_0, Ar_7, 1, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_7 >= 1 /\ Ar_8 = 1 ] (Comp: ?, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_8 >= 2 /\ Ar_7 >= Ar_8 ] (Comp: ?, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 >= Ar_8 /\ Ar_7 >= Ar_8 ] (Comp: ?, Cost: 1) f2(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_0 >= 2 ] (Comp: ?, Cost: 1) f2(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 >= Ar_0 ] (Comp: ?, Cost: 1) f16(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f16(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, Ar_16)) [ Ar_9 >= Ar_10 ] (Comp: ?, Cost: 1) f13(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f16(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_7 >= Ar_8 ] (Comp: ?, Cost: 1) f2(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f13(1, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_0 = 1 ] start location: koat_start leaf cost: 0 Repeatedly propagating knowledge in problem 2 produces the following problem: 3: T: (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f2(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 <= 0 ] (Comp: ?, Cost: 1) f13(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_8 >= Ar_7 + 1 ] (Comp: ?, Cost: 1) f16(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f13(Ar_0, Ar_7, Ar_8 + 1, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_10 >= Ar_9 + 1 ] (Comp: ?, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f1(-1, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_8 >= Ar_7 + 1 /\ Ar_0 + 1 = 0 ] (Comp: ?, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f1(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_0 >= 0 /\ Ar_8 >= Ar_7 + 1 ] (Comp: ?, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f1(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 >= Ar_0 + 2 /\ Ar_8 >= Ar_7 + 1 ] (Comp: ?, Cost: 1) f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f27(Ar_0, Ar_7, Ar_8 + 1, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_15 >= 2*X' /\ 3*X' >= Ar_15 + 1 /\ Ar_16 >= X' + 2 ] (Comp: ?, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16 + 1)) [ Ar_10 >= Ar_9 + 1 ] (Comp: ?, Cost: 1) f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, 2, Ar_15, Ar_16)) [ Ar_16 >= 2*Fresh_8 /\ 3*Fresh_8 >= Ar_16 + 1 /\ Ar_10 = 1 ] (Comp: ?, Cost: 1) f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, Ar_16)) [ Ar_16 >= 2*Fresh_17 /\ 3*Fresh_17 >= Ar_16 + 1 /\ Ar_10 >= 2 ] (Comp: ?, Cost: 1) f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, Ar_16)) [ Ar_16 >= 2*Fresh_26 /\ 3*Fresh_26 >= Ar_16 + 1 /\ 0 >= Ar_10 ] (Comp: ?, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, 2, Ar_15, 1)) [ Ar_9 >= 1 /\ Ar_10 = 1 /\ Ar_16 = 1 ] (Comp: ?, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, 1)) [ Ar_9 >= Ar_10 + 4*Fresh_35 /\ 5*Fresh_35 + Ar_10 >= Ar_9 + 1 /\ Ar_9 >= Ar_10 /\ Ar_10 >= 2 /\ Ar_16 = 1 ] (Comp: ?, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, 1)) [ Ar_9 >= Ar_10 + 4*Fresh_44 /\ 5*Fresh_44 + Ar_10 >= Ar_9 + 1 /\ 0 >= Ar_10 /\ Ar_9 >= Ar_10 /\ Ar_16 = 1 ] (Comp: ?, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_16 >= 2 /\ Ar_9 >= Ar_10 ] (Comp: ?, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 >= Ar_16 /\ Ar_9 >= Ar_10 ] (Comp: ?, Cost: 1) f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_15 >= 2*X' /\ 3*X' >= Ar_15 + 1 /\ X' + 1 >= Ar_16 ] (Comp: ?, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f35(Ar_0, Ar_7, 1, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_7 >= 1 /\ Ar_8 = 1 ] (Comp: ?, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_8 >= 2 /\ Ar_7 >= Ar_8 ] (Comp: ?, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 >= Ar_8 /\ Ar_7 >= Ar_8 ] (Comp: 1, Cost: 1) f2(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_0 >= 2 ] (Comp: 1, Cost: 1) f2(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 >= Ar_0 ] (Comp: ?, Cost: 1) f16(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f16(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, Ar_16)) [ Ar_9 >= Ar_10 ] (Comp: ?, Cost: 1) f13(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f16(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_7 >= Ar_8 ] (Comp: 1, Cost: 1) f2(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f13(1, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_0 = 1 ] start location: koat_start leaf cost: 0 A polynomial rank function with Pol(koat_start) = 2 Pol(f2) = 2 Pol(f13) = 2 Pol(f27) = 1 Pol(f16) = 2 Pol(f1) = 0 Pol(f35) = 1 Pol(f38) = 1 Pol(f53) = 1 orients all transitions weakly and the transitions f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f1(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_0 >= 0 /\ Ar_8 >= Ar_7 + 1 ] f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f1(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 >= Ar_0 + 2 /\ Ar_8 >= Ar_7 + 1 ] f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f1(-1, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_8 >= Ar_7 + 1 /\ Ar_0 + 1 = 0 ] f13(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_8 >= Ar_7 + 1 ] strictly and produces the following problem: 4: T: (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f2(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 <= 0 ] (Comp: 2, Cost: 1) f13(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_8 >= Ar_7 + 1 ] (Comp: ?, Cost: 1) f16(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f13(Ar_0, Ar_7, Ar_8 + 1, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_10 >= Ar_9 + 1 ] (Comp: 2, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f1(-1, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_8 >= Ar_7 + 1 /\ Ar_0 + 1 = 0 ] (Comp: 2, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f1(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_0 >= 0 /\ Ar_8 >= Ar_7 + 1 ] (Comp: 2, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f1(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 >= Ar_0 + 2 /\ Ar_8 >= Ar_7 + 1 ] (Comp: ?, Cost: 1) f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f27(Ar_0, Ar_7, Ar_8 + 1, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_15 >= 2*X' /\ 3*X' >= Ar_15 + 1 /\ Ar_16 >= X' + 2 ] (Comp: ?, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16 + 1)) [ Ar_10 >= Ar_9 + 1 ] (Comp: ?, Cost: 1) f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, 2, Ar_15, Ar_16)) [ Ar_16 >= 2*Fresh_8 /\ 3*Fresh_8 >= Ar_16 + 1 /\ Ar_10 = 1 ] (Comp: ?, Cost: 1) f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, Ar_16)) [ Ar_16 >= 2*Fresh_17 /\ 3*Fresh_17 >= Ar_16 + 1 /\ Ar_10 >= 2 ] (Comp: ?, Cost: 1) f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, Ar_16)) [ Ar_16 >= 2*Fresh_26 /\ 3*Fresh_26 >= Ar_16 + 1 /\ 0 >= Ar_10 ] (Comp: ?, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, 2, Ar_15, 1)) [ Ar_9 >= 1 /\ Ar_10 = 1 /\ Ar_16 = 1 ] (Comp: ?, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, 1)) [ Ar_9 >= Ar_10 + 4*Fresh_35 /\ 5*Fresh_35 + Ar_10 >= Ar_9 + 1 /\ Ar_9 >= Ar_10 /\ Ar_10 >= 2 /\ Ar_16 = 1 ] (Comp: ?, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, 1)) [ Ar_9 >= Ar_10 + 4*Fresh_44 /\ 5*Fresh_44 + Ar_10 >= Ar_9 + 1 /\ 0 >= Ar_10 /\ Ar_9 >= Ar_10 /\ Ar_16 = 1 ] (Comp: ?, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_16 >= 2 /\ Ar_9 >= Ar_10 ] (Comp: ?, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 >= Ar_16 /\ Ar_9 >= Ar_10 ] (Comp: ?, Cost: 1) f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_15 >= 2*X' /\ 3*X' >= Ar_15 + 1 /\ X' + 1 >= Ar_16 ] (Comp: ?, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f35(Ar_0, Ar_7, 1, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_7 >= 1 /\ Ar_8 = 1 ] (Comp: ?, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_8 >= 2 /\ Ar_7 >= Ar_8 ] (Comp: ?, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 >= Ar_8 /\ Ar_7 >= Ar_8 ] (Comp: 1, Cost: 1) f2(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_0 >= 2 ] (Comp: 1, Cost: 1) f2(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 >= Ar_0 ] (Comp: ?, Cost: 1) f16(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f16(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, Ar_16)) [ Ar_9 >= Ar_10 ] (Comp: ?, Cost: 1) f13(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f16(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_7 >= Ar_8 ] (Comp: 1, Cost: 1) f2(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f13(1, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_0 = 1 ] start location: koat_start leaf cost: 0 A polynomial rank function with Pol(koat_start) = -V_5 + 2 Pol(f2) = -V_5 + 2 Pol(f13) = -V_5 + 2 Pol(f27) = -V_5 + 2 Pol(f16) = -V_5 + 2 Pol(f1) = -V_5 Pol(f35) = -V_5 + 2 Pol(f38) = -V_5 + 2 Pol(f53) = -V_5 + 2 orients all transitions weakly and the transitions f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, 2, Ar_15, Ar_16)) [ Ar_16 >= 2*Fresh_8 /\ 3*Fresh_8 >= Ar_16 + 1 /\ Ar_10 = 1 ] f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, Ar_16)) [ Ar_16 >= 2*Fresh_26 /\ 3*Fresh_26 >= Ar_16 + 1 /\ 0 >= Ar_10 ] f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, 2, Ar_15, 1)) [ Ar_9 >= 1 /\ Ar_10 = 1 /\ Ar_16 = 1 ] f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, 1)) [ Ar_9 >= Ar_10 + 4*Fresh_44 /\ 5*Fresh_44 + Ar_10 >= Ar_9 + 1 /\ 0 >= Ar_10 /\ Ar_9 >= Ar_10 /\ Ar_16 = 1 ] strictly and produces the following problem: 5: T: (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f2(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 <= 0 ] (Comp: 2, Cost: 1) f13(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_8 >= Ar_7 + 1 ] (Comp: ?, Cost: 1) f16(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f13(Ar_0, Ar_7, Ar_8 + 1, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_10 >= Ar_9 + 1 ] (Comp: 2, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f1(-1, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_8 >= Ar_7 + 1 /\ Ar_0 + 1 = 0 ] (Comp: 2, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f1(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_0 >= 0 /\ Ar_8 >= Ar_7 + 1 ] (Comp: 2, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f1(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 >= Ar_0 + 2 /\ Ar_8 >= Ar_7 + 1 ] (Comp: ?, Cost: 1) f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f27(Ar_0, Ar_7, Ar_8 + 1, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_15 >= 2*X' /\ 3*X' >= Ar_15 + 1 /\ Ar_16 >= X' + 2 ] (Comp: ?, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16 + 1)) [ Ar_10 >= Ar_9 + 1 ] (Comp: Ar_10 + 2, Cost: 1) f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, 2, Ar_15, Ar_16)) [ Ar_16 >= 2*Fresh_8 /\ 3*Fresh_8 >= Ar_16 + 1 /\ Ar_10 = 1 ] (Comp: ?, Cost: 1) f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, Ar_16)) [ Ar_16 >= 2*Fresh_17 /\ 3*Fresh_17 >= Ar_16 + 1 /\ Ar_10 >= 2 ] (Comp: Ar_10 + 2, Cost: 1) f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, Ar_16)) [ Ar_16 >= 2*Fresh_26 /\ 3*Fresh_26 >= Ar_16 + 1 /\ 0 >= Ar_10 ] (Comp: Ar_10 + 2, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, 2, Ar_15, 1)) [ Ar_9 >= 1 /\ Ar_10 = 1 /\ Ar_16 = 1 ] (Comp: ?, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, 1)) [ Ar_9 >= Ar_10 + 4*Fresh_35 /\ 5*Fresh_35 + Ar_10 >= Ar_9 + 1 /\ Ar_9 >= Ar_10 /\ Ar_10 >= 2 /\ Ar_16 = 1 ] (Comp: Ar_10 + 2, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, 1)) [ Ar_9 >= Ar_10 + 4*Fresh_44 /\ 5*Fresh_44 + Ar_10 >= Ar_9 + 1 /\ 0 >= Ar_10 /\ Ar_9 >= Ar_10 /\ Ar_16 = 1 ] (Comp: ?, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_16 >= 2 /\ Ar_9 >= Ar_10 ] (Comp: ?, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 >= Ar_16 /\ Ar_9 >= Ar_10 ] (Comp: ?, Cost: 1) f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_15 >= 2*X' /\ 3*X' >= Ar_15 + 1 /\ X' + 1 >= Ar_16 ] (Comp: ?, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f35(Ar_0, Ar_7, 1, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_7 >= 1 /\ Ar_8 = 1 ] (Comp: ?, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_8 >= 2 /\ Ar_7 >= Ar_8 ] (Comp: ?, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 >= Ar_8 /\ Ar_7 >= Ar_8 ] (Comp: 1, Cost: 1) f2(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_0 >= 2 ] (Comp: 1, Cost: 1) f2(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 >= Ar_0 ] (Comp: ?, Cost: 1) f16(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f16(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, Ar_16)) [ Ar_9 >= Ar_10 ] (Comp: ?, Cost: 1) f13(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f16(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_7 >= Ar_8 ] (Comp: 1, Cost: 1) f2(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f13(1, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_0 = 1 ] start location: koat_start leaf cost: 0 A polynomial rank function with Pol(koat_start) = V_4 - V_5 + 1 Pol(f2) = V_4 - V_5 + 1 Pol(f13) = V_4 - V_5 + 1 Pol(f27) = V_4 - V_5 + 1 Pol(f16) = V_4 - V_5 + 1 Pol(f1) = V_4 - V_5 Pol(f35) = V_4 - V_5 + 1 Pol(f38) = V_4 - V_5 + 1 Pol(f53) = V_4 - V_5 orients all transitions weakly and the transitions f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_16 >= 2 /\ Ar_9 >= Ar_10 ] f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 >= Ar_16 /\ Ar_9 >= Ar_10 ] f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, 1)) [ Ar_9 >= Ar_10 + 4*Fresh_35 /\ 5*Fresh_35 + Ar_10 >= Ar_9 + 1 /\ Ar_9 >= Ar_10 /\ Ar_10 >= 2 /\ Ar_16 = 1 ] f16(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f16(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, Ar_16)) [ Ar_9 >= Ar_10 ] strictly and produces the following problem: 6: T: (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f2(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 <= 0 ] (Comp: 2, Cost: 1) f13(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_8 >= Ar_7 + 1 ] (Comp: ?, Cost: 1) f16(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f13(Ar_0, Ar_7, Ar_8 + 1, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_10 >= Ar_9 + 1 ] (Comp: 2, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f1(-1, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_8 >= Ar_7 + 1 /\ Ar_0 + 1 = 0 ] (Comp: 2, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f1(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_0 >= 0 /\ Ar_8 >= Ar_7 + 1 ] (Comp: 2, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f1(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 >= Ar_0 + 2 /\ Ar_8 >= Ar_7 + 1 ] (Comp: ?, Cost: 1) f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f27(Ar_0, Ar_7, Ar_8 + 1, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_15 >= 2*X' /\ 3*X' >= Ar_15 + 1 /\ Ar_16 >= X' + 2 ] (Comp: ?, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16 + 1)) [ Ar_10 >= Ar_9 + 1 ] (Comp: Ar_10 + 2, Cost: 1) f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, 2, Ar_15, Ar_16)) [ Ar_16 >= 2*Fresh_8 /\ 3*Fresh_8 >= Ar_16 + 1 /\ Ar_10 = 1 ] (Comp: ?, Cost: 1) f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, Ar_16)) [ Ar_16 >= 2*Fresh_17 /\ 3*Fresh_17 >= Ar_16 + 1 /\ Ar_10 >= 2 ] (Comp: Ar_10 + 2, Cost: 1) f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, Ar_16)) [ Ar_16 >= 2*Fresh_26 /\ 3*Fresh_26 >= Ar_16 + 1 /\ 0 >= Ar_10 ] (Comp: Ar_10 + 2, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, 2, Ar_15, 1)) [ Ar_9 >= 1 /\ Ar_10 = 1 /\ Ar_16 = 1 ] (Comp: Ar_9 + Ar_10 + 1, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, 1)) [ Ar_9 >= Ar_10 + 4*Fresh_35 /\ 5*Fresh_35 + Ar_10 >= Ar_9 + 1 /\ Ar_9 >= Ar_10 /\ Ar_10 >= 2 /\ Ar_16 = 1 ] (Comp: Ar_10 + 2, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, 1)) [ Ar_9 >= Ar_10 + 4*Fresh_44 /\ 5*Fresh_44 + Ar_10 >= Ar_9 + 1 /\ 0 >= Ar_10 /\ Ar_9 >= Ar_10 /\ Ar_16 = 1 ] (Comp: Ar_9 + Ar_10 + 1, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_16 >= 2 /\ Ar_9 >= Ar_10 ] (Comp: Ar_9 + Ar_10 + 1, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 >= Ar_16 /\ Ar_9 >= Ar_10 ] (Comp: ?, Cost: 1) f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_15 >= 2*X' /\ 3*X' >= Ar_15 + 1 /\ X' + 1 >= Ar_16 ] (Comp: ?, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f35(Ar_0, Ar_7, 1, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_7 >= 1 /\ Ar_8 = 1 ] (Comp: ?, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_8 >= 2 /\ Ar_7 >= Ar_8 ] (Comp: ?, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 >= Ar_8 /\ Ar_7 >= Ar_8 ] (Comp: 1, Cost: 1) f2(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_0 >= 2 ] (Comp: 1, Cost: 1) f2(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 >= Ar_0 ] (Comp: Ar_9 + Ar_10 + 1, Cost: 1) f16(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f16(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, Ar_16)) [ Ar_9 >= Ar_10 ] (Comp: ?, Cost: 1) f13(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f16(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_7 >= Ar_8 ] (Comp: 1, Cost: 1) f2(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f13(1, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_0 = 1 ] start location: koat_start leaf cost: 0 Repeatedly propagating knowledge in problem 6 produces the following problem: 7: T: (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f2(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 <= 0 ] (Comp: 2, Cost: 1) f13(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_8 >= Ar_7 + 1 ] (Comp: ?, Cost: 1) f16(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f13(Ar_0, Ar_7, Ar_8 + 1, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_10 >= Ar_9 + 1 ] (Comp: 2, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f1(-1, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_8 >= Ar_7 + 1 /\ Ar_0 + 1 = 0 ] (Comp: 2, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f1(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_0 >= 0 /\ Ar_8 >= Ar_7 + 1 ] (Comp: 2, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f1(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 >= Ar_0 + 2 /\ Ar_8 >= Ar_7 + 1 ] (Comp: ?, Cost: 1) f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f27(Ar_0, Ar_7, Ar_8 + 1, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_15 >= 2*X' /\ 3*X' >= Ar_15 + 1 /\ Ar_16 >= X' + 2 ] (Comp: ?, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16 + 1)) [ Ar_10 >= Ar_9 + 1 ] (Comp: Ar_10 + 2, Cost: 1) f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, 2, Ar_15, Ar_16)) [ Ar_16 >= 2*Fresh_8 /\ 3*Fresh_8 >= Ar_16 + 1 /\ Ar_10 = 1 ] (Comp: Ar_9 + Ar_10 + 1, Cost: 1) f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, Ar_16)) [ Ar_16 >= 2*Fresh_17 /\ 3*Fresh_17 >= Ar_16 + 1 /\ Ar_10 >= 2 ] (Comp: Ar_10 + 2, Cost: 1) f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, Ar_16)) [ Ar_16 >= 2*Fresh_26 /\ 3*Fresh_26 >= Ar_16 + 1 /\ 0 >= Ar_10 ] (Comp: Ar_10 + 2, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, 2, Ar_15, 1)) [ Ar_9 >= 1 /\ Ar_10 = 1 /\ Ar_16 = 1 ] (Comp: Ar_9 + Ar_10 + 1, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, 1)) [ Ar_9 >= Ar_10 + 4*Fresh_35 /\ 5*Fresh_35 + Ar_10 >= Ar_9 + 1 /\ Ar_9 >= Ar_10 /\ Ar_10 >= 2 /\ Ar_16 = 1 ] (Comp: Ar_10 + 2, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, 1)) [ Ar_9 >= Ar_10 + 4*Fresh_44 /\ 5*Fresh_44 + Ar_10 >= Ar_9 + 1 /\ 0 >= Ar_10 /\ Ar_9 >= Ar_10 /\ Ar_16 = 1 ] (Comp: Ar_9 + Ar_10 + 1, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_16 >= 2 /\ Ar_9 >= Ar_10 ] (Comp: Ar_9 + Ar_10 + 1, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 >= Ar_16 /\ Ar_9 >= Ar_10 ] (Comp: ?, Cost: 1) f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_15 >= 2*X' /\ 3*X' >= Ar_15 + 1 /\ X' + 1 >= Ar_16 ] (Comp: ?, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f35(Ar_0, Ar_7, 1, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_7 >= 1 /\ Ar_8 = 1 ] (Comp: ?, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_8 >= 2 /\ Ar_7 >= Ar_8 ] (Comp: ?, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 >= Ar_8 /\ Ar_7 >= Ar_8 ] (Comp: 1, Cost: 1) f2(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_0 >= 2 ] (Comp: 1, Cost: 1) f2(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 >= Ar_0 ] (Comp: Ar_9 + Ar_10 + 1, Cost: 1) f16(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f16(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, Ar_16)) [ Ar_9 >= Ar_10 ] (Comp: ?, Cost: 1) f13(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f16(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_7 >= Ar_8 ] (Comp: 1, Cost: 1) f2(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f13(1, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_0 = 1 ] start location: koat_start leaf cost: 0 A polynomial rank function with Pol(koat_start) = V_6 - V_7 + 1 Pol(f2) = V_6 - V_7 + 1 Pol(f13) = V_6 - V_7 + 1 Pol(f27) = V_6 - V_7 + 1 Pol(f16) = V_6 - V_7 + 1 Pol(f1) = V_6 - V_7 Pol(f35) = V_6 - V_7 + 1 Pol(f38) = V_6 - V_7 Pol(f53) = V_6 - V_7 orients all transitions weakly and the transition f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_15 >= 2*X' /\ 3*X' >= Ar_15 + 1 /\ X' + 1 >= Ar_16 ] strictly and produces the following problem: 8: T: (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f2(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 <= 0 ] (Comp: 2, Cost: 1) f13(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_8 >= Ar_7 + 1 ] (Comp: ?, Cost: 1) f16(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f13(Ar_0, Ar_7, Ar_8 + 1, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_10 >= Ar_9 + 1 ] (Comp: 2, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f1(-1, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_8 >= Ar_7 + 1 /\ Ar_0 + 1 = 0 ] (Comp: 2, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f1(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_0 >= 0 /\ Ar_8 >= Ar_7 + 1 ] (Comp: 2, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f1(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 >= Ar_0 + 2 /\ Ar_8 >= Ar_7 + 1 ] (Comp: ?, Cost: 1) f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f27(Ar_0, Ar_7, Ar_8 + 1, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_15 >= 2*X' /\ 3*X' >= Ar_15 + 1 /\ Ar_16 >= X' + 2 ] (Comp: ?, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16 + 1)) [ Ar_10 >= Ar_9 + 1 ] (Comp: Ar_10 + 2, Cost: 1) f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, 2, Ar_15, Ar_16)) [ Ar_16 >= 2*Fresh_8 /\ 3*Fresh_8 >= Ar_16 + 1 /\ Ar_10 = 1 ] (Comp: Ar_9 + Ar_10 + 1, Cost: 1) f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, Ar_16)) [ Ar_16 >= 2*Fresh_17 /\ 3*Fresh_17 >= Ar_16 + 1 /\ Ar_10 >= 2 ] (Comp: Ar_10 + 2, Cost: 1) f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, Ar_16)) [ Ar_16 >= 2*Fresh_26 /\ 3*Fresh_26 >= Ar_16 + 1 /\ 0 >= Ar_10 ] (Comp: Ar_10 + 2, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, 2, Ar_15, 1)) [ Ar_9 >= 1 /\ Ar_10 = 1 /\ Ar_16 = 1 ] (Comp: Ar_9 + Ar_10 + 1, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, 1)) [ Ar_9 >= Ar_10 + 4*Fresh_35 /\ 5*Fresh_35 + Ar_10 >= Ar_9 + 1 /\ Ar_9 >= Ar_10 /\ Ar_10 >= 2 /\ Ar_16 = 1 ] (Comp: Ar_10 + 2, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, 1)) [ Ar_9 >= Ar_10 + 4*Fresh_44 /\ 5*Fresh_44 + Ar_10 >= Ar_9 + 1 /\ 0 >= Ar_10 /\ Ar_9 >= Ar_10 /\ Ar_16 = 1 ] (Comp: Ar_9 + Ar_10 + 1, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_16 >= 2 /\ Ar_9 >= Ar_10 ] (Comp: Ar_9 + Ar_10 + 1, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 >= Ar_16 /\ Ar_9 >= Ar_10 ] (Comp: Ar_15 + Ar_16 + 1, Cost: 1) f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_15 >= 2*X' /\ 3*X' >= Ar_15 + 1 /\ X' + 1 >= Ar_16 ] (Comp: ?, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f35(Ar_0, Ar_7, 1, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_7 >= 1 /\ Ar_8 = 1 ] (Comp: ?, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_8 >= 2 /\ Ar_7 >= Ar_8 ] (Comp: ?, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 >= Ar_8 /\ Ar_7 >= Ar_8 ] (Comp: 1, Cost: 1) f2(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_0 >= 2 ] (Comp: 1, Cost: 1) f2(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 >= Ar_0 ] (Comp: Ar_9 + Ar_10 + 1, Cost: 1) f16(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f16(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, Ar_16)) [ Ar_9 >= Ar_10 ] (Comp: ?, Cost: 1) f13(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f16(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_7 >= Ar_8 ] (Comp: 1, Cost: 1) f2(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f13(1, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_0 = 1 ] start location: koat_start leaf cost: 0 Repeatedly propagating knowledge in problem 8 produces the following problem: 9: T: (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f2(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 <= 0 ] (Comp: 2, Cost: 1) f13(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_8 >= Ar_7 + 1 ] (Comp: ?, Cost: 1) f16(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f13(Ar_0, Ar_7, Ar_8 + 1, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_10 >= Ar_9 + 1 ] (Comp: 2, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f1(-1, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_8 >= Ar_7 + 1 /\ Ar_0 + 1 = 0 ] (Comp: 2, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f1(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_0 >= 0 /\ Ar_8 >= Ar_7 + 1 ] (Comp: 2, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f1(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 >= Ar_0 + 2 /\ Ar_8 >= Ar_7 + 1 ] (Comp: ?, Cost: 1) f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f27(Ar_0, Ar_7, Ar_8 + 1, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_15 >= 2*X' /\ 3*X' >= Ar_15 + 1 /\ Ar_16 >= X' + 2 ] (Comp: Ar_15 + Ar_16 + 4*Ar_10 + Ar_9 + 8, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16 + 1)) [ Ar_10 >= Ar_9 + 1 ] (Comp: Ar_10 + 2, Cost: 1) f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, 2, Ar_15, Ar_16)) [ Ar_16 >= 2*Fresh_8 /\ 3*Fresh_8 >= Ar_16 + 1 /\ Ar_10 = 1 ] (Comp: Ar_9 + Ar_10 + 1, Cost: 1) f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, Ar_16)) [ Ar_16 >= 2*Fresh_17 /\ 3*Fresh_17 >= Ar_16 + 1 /\ Ar_10 >= 2 ] (Comp: Ar_10 + 2, Cost: 1) f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, Ar_16)) [ Ar_16 >= 2*Fresh_26 /\ 3*Fresh_26 >= Ar_16 + 1 /\ 0 >= Ar_10 ] (Comp: Ar_10 + 2, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, 2, Ar_15, 1)) [ Ar_9 >= 1 /\ Ar_10 = 1 /\ Ar_16 = 1 ] (Comp: Ar_9 + Ar_10 + 1, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, 1)) [ Ar_9 >= Ar_10 + 4*Fresh_35 /\ 5*Fresh_35 + Ar_10 >= Ar_9 + 1 /\ Ar_9 >= Ar_10 /\ Ar_10 >= 2 /\ Ar_16 = 1 ] (Comp: Ar_10 + 2, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, 1)) [ Ar_9 >= Ar_10 + 4*Fresh_44 /\ 5*Fresh_44 + Ar_10 >= Ar_9 + 1 /\ 0 >= Ar_10 /\ Ar_9 >= Ar_10 /\ Ar_16 = 1 ] (Comp: Ar_9 + Ar_10 + 1, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_16 >= 2 /\ Ar_9 >= Ar_10 ] (Comp: Ar_9 + Ar_10 + 1, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 >= Ar_16 /\ Ar_9 >= Ar_10 ] (Comp: Ar_15 + Ar_16 + 1, Cost: 1) f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_15 >= 2*X' /\ 3*X' >= Ar_15 + 1 /\ X' + 1 >= Ar_16 ] (Comp: ?, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f35(Ar_0, Ar_7, 1, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_7 >= 1 /\ Ar_8 = 1 ] (Comp: ?, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_8 >= 2 /\ Ar_7 >= Ar_8 ] (Comp: ?, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 >= Ar_8 /\ Ar_7 >= Ar_8 ] (Comp: 1, Cost: 1) f2(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_0 >= 2 ] (Comp: 1, Cost: 1) f2(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 >= Ar_0 ] (Comp: Ar_9 + Ar_10 + 1, Cost: 1) f16(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f16(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, Ar_16)) [ Ar_9 >= Ar_10 ] (Comp: ?, Cost: 1) f13(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f16(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_7 >= Ar_8 ] (Comp: 1, Cost: 1) f2(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f13(1, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_0 = 1 ] start location: koat_start leaf cost: 0 A polynomial rank function with Pol(koat_start) = V_2 - V_3 + 1 Pol(f2) = V_2 - V_3 + 1 Pol(f13) = V_2 - V_3 + 1 Pol(f27) = V_2 - V_3 + 1 Pol(f16) = V_2 - V_3 Pol(f1) = V_2 - V_3 Pol(f35) = V_2 - V_3 Pol(f38) = V_2 - V_3 Pol(f53) = V_2 - V_3 orients all transitions weakly and the transitions f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f35(Ar_0, Ar_7, 1, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_7 >= 1 /\ Ar_8 = 1 ] f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_8 >= 2 /\ Ar_7 >= Ar_8 ] f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 >= Ar_8 /\ Ar_7 >= Ar_8 ] f13(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f16(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_7 >= Ar_8 ] strictly and produces the following problem: 10: T: (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f2(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 <= 0 ] (Comp: 2, Cost: 1) f13(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_8 >= Ar_7 + 1 ] (Comp: ?, Cost: 1) f16(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f13(Ar_0, Ar_7, Ar_8 + 1, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_10 >= Ar_9 + 1 ] (Comp: 2, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f1(-1, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_8 >= Ar_7 + 1 /\ Ar_0 + 1 = 0 ] (Comp: 2, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f1(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_0 >= 0 /\ Ar_8 >= Ar_7 + 1 ] (Comp: 2, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f1(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 >= Ar_0 + 2 /\ Ar_8 >= Ar_7 + 1 ] (Comp: ?, Cost: 1) f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f27(Ar_0, Ar_7, Ar_8 + 1, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_15 >= 2*X' /\ 3*X' >= Ar_15 + 1 /\ Ar_16 >= X' + 2 ] (Comp: Ar_15 + Ar_16 + 4*Ar_10 + Ar_9 + 8, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16 + 1)) [ Ar_10 >= Ar_9 + 1 ] (Comp: Ar_10 + 2, Cost: 1) f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, 2, Ar_15, Ar_16)) [ Ar_16 >= 2*Fresh_8 /\ 3*Fresh_8 >= Ar_16 + 1 /\ Ar_10 = 1 ] (Comp: Ar_9 + Ar_10 + 1, Cost: 1) f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, Ar_16)) [ Ar_16 >= 2*Fresh_17 /\ 3*Fresh_17 >= Ar_16 + 1 /\ Ar_10 >= 2 ] (Comp: Ar_10 + 2, Cost: 1) f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, Ar_16)) [ Ar_16 >= 2*Fresh_26 /\ 3*Fresh_26 >= Ar_16 + 1 /\ 0 >= Ar_10 ] (Comp: Ar_10 + 2, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, 2, Ar_15, 1)) [ Ar_9 >= 1 /\ Ar_10 = 1 /\ Ar_16 = 1 ] (Comp: Ar_9 + Ar_10 + 1, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, 1)) [ Ar_9 >= Ar_10 + 4*Fresh_35 /\ 5*Fresh_35 + Ar_10 >= Ar_9 + 1 /\ Ar_9 >= Ar_10 /\ Ar_10 >= 2 /\ Ar_16 = 1 ] (Comp: Ar_10 + 2, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, 1)) [ Ar_9 >= Ar_10 + 4*Fresh_44 /\ 5*Fresh_44 + Ar_10 >= Ar_9 + 1 /\ 0 >= Ar_10 /\ Ar_9 >= Ar_10 /\ Ar_16 = 1 ] (Comp: Ar_9 + Ar_10 + 1, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_16 >= 2 /\ Ar_9 >= Ar_10 ] (Comp: Ar_9 + Ar_10 + 1, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 >= Ar_16 /\ Ar_9 >= Ar_10 ] (Comp: Ar_15 + Ar_16 + 1, Cost: 1) f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_15 >= 2*X' /\ 3*X' >= Ar_15 + 1 /\ X' + 1 >= Ar_16 ] (Comp: Ar_7 + Ar_8 + 1, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f35(Ar_0, Ar_7, 1, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_7 >= 1 /\ Ar_8 = 1 ] (Comp: Ar_7 + Ar_8 + 1, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_8 >= 2 /\ Ar_7 >= Ar_8 ] (Comp: Ar_7 + Ar_8 + 1, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 >= Ar_8 /\ Ar_7 >= Ar_8 ] (Comp: 1, Cost: 1) f2(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_0 >= 2 ] (Comp: 1, Cost: 1) f2(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 >= Ar_0 ] (Comp: Ar_9 + Ar_10 + 1, Cost: 1) f16(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f16(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, Ar_16)) [ Ar_9 >= Ar_10 ] (Comp: Ar_7 + Ar_8 + 1, Cost: 1) f13(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f16(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_7 >= Ar_8 ] (Comp: 1, Cost: 1) f2(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f13(1, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_0 = 1 ] start location: koat_start leaf cost: 0 Repeatedly propagating knowledge in problem 10 produces the following problem: 11: T: (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f2(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 <= 0 ] (Comp: 2, Cost: 1) f13(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_8 >= Ar_7 + 1 ] (Comp: Ar_7 + Ar_8 + Ar_9 + Ar_10 + 2, Cost: 1) f16(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f13(Ar_0, Ar_7, Ar_8 + 1, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_10 >= Ar_9 + 1 ] (Comp: 2, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f1(-1, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_8 >= Ar_7 + 1 /\ Ar_0 + 1 = 0 ] (Comp: 2, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f1(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_0 >= 0 /\ Ar_8 >= Ar_7 + 1 ] (Comp: 2, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f1(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 >= Ar_0 + 2 /\ Ar_8 >= Ar_7 + 1 ] (Comp: 3*Ar_7 + 3*Ar_8 + Ar_15 + Ar_16 + 4*Ar_10 + Ar_9 + 11, Cost: 1) f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f27(Ar_0, Ar_7, Ar_8 + 1, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_15 >= 2*X' /\ 3*X' >= Ar_15 + 1 /\ Ar_16 >= X' + 2 ] (Comp: Ar_15 + Ar_16 + 4*Ar_10 + Ar_9 + 8, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16 + 1)) [ Ar_10 >= Ar_9 + 1 ] (Comp: Ar_10 + 2, Cost: 1) f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, 2, Ar_15, Ar_16)) [ Ar_16 >= 2*Fresh_8 /\ 3*Fresh_8 >= Ar_16 + 1 /\ Ar_10 = 1 ] (Comp: Ar_9 + Ar_10 + 1, Cost: 1) f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, Ar_16)) [ Ar_16 >= 2*Fresh_17 /\ 3*Fresh_17 >= Ar_16 + 1 /\ Ar_10 >= 2 ] (Comp: Ar_10 + 2, Cost: 1) f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, Ar_16)) [ Ar_16 >= 2*Fresh_26 /\ 3*Fresh_26 >= Ar_16 + 1 /\ 0 >= Ar_10 ] (Comp: Ar_10 + 2, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, 2, Ar_15, 1)) [ Ar_9 >= 1 /\ Ar_10 = 1 /\ Ar_16 = 1 ] (Comp: Ar_9 + Ar_10 + 1, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, 1)) [ Ar_9 >= Ar_10 + 4*Fresh_35 /\ 5*Fresh_35 + Ar_10 >= Ar_9 + 1 /\ Ar_9 >= Ar_10 /\ Ar_10 >= 2 /\ Ar_16 = 1 ] (Comp: Ar_10 + 2, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, 1)) [ Ar_9 >= Ar_10 + 4*Fresh_44 /\ 5*Fresh_44 + Ar_10 >= Ar_9 + 1 /\ 0 >= Ar_10 /\ Ar_9 >= Ar_10 /\ Ar_16 = 1 ] (Comp: Ar_9 + Ar_10 + 1, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_16 >= 2 /\ Ar_9 >= Ar_10 ] (Comp: Ar_9 + Ar_10 + 1, Cost: 1) f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f53(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 >= Ar_16 /\ Ar_9 >= Ar_10 ] (Comp: Ar_15 + Ar_16 + 1, Cost: 1) f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f38(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_15 >= 2*X' /\ 3*X' >= Ar_15 + 1 /\ X' + 1 >= Ar_16 ] (Comp: Ar_7 + Ar_8 + 1, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f35(Ar_0, Ar_7, 1, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_7 >= 1 /\ Ar_8 = 1 ] (Comp: Ar_7 + Ar_8 + 1, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_8 >= 2 /\ Ar_7 >= Ar_8 ] (Comp: Ar_7 + Ar_8 + 1, Cost: 1) f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f35(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 >= Ar_8 /\ Ar_7 >= Ar_8 ] (Comp: 1, Cost: 1) f2(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_0 >= 2 ] (Comp: 1, Cost: 1) f2(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f27(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ 0 >= Ar_0 ] (Comp: Ar_9 + Ar_10 + 1, Cost: 1) f16(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f16(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_15, Ar_16)) [ Ar_9 >= Ar_10 ] (Comp: Ar_7 + Ar_8 + 1, Cost: 1) f13(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f16(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_7 >= Ar_8 ] (Comp: 1, Cost: 1) f2(Ar_0, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16) -> Com_1(f13(1, Ar_7, Ar_8, Ar_9, Ar_10, Ar_15, Ar_16)) [ Ar_0 = 1 ] start location: koat_start leaf cost: 0 Complexity upper bound 8*Ar_7 + 8*Ar_8 + 8*Ar_9 + 18*Ar_10 + 3*Ar_15 + 3*Ar_16 + 50 Time: 0.708 sec (SMT: 0.391 sec) ---------------------------------------- (2) BOUNDS(1, n^1) ---------------------------------------- (3) Loat Proof (FINISHED) ### Pre-processing the ITS problem ### Initial linear ITS problem Start location: f2 0: f2 -> f13 : A'=1, B'=free_3, C'=free_4, D'=free_1, E'=free_5, F'=free_2, G'=free, [ A==1 ], cost: 1 3: f2 -> f27 : B'=free_9, C'=free_10, D'=free_7, E'=free_11, F'=free_8, G'=free_6, [ 0>=A ], cost: 1 4: f2 -> f27 : B'=free_15, C'=free_16, D'=free_13, E'=free_17, F'=free_14, G'=free_12, [ A>=2 ], cost: 1 1: f13 -> f16 : [ H>=Q ], cost: 1 23: f13 -> f27 : [ Q>=1+H ], cost: 1 2: f16 -> f16 : K'=1+K, L'=2+L, [ J>=K ], cost: 1 22: f16 -> f13 : Q'=1+Q, [ K>=1+J ], cost: 1 5: f27 -> f35 : M'=2+H-Q, N'=1, O'=0, [ 0>=Q && H>=Q ], cost: 1 6: f27 -> f35 : M'=2+H-Q, N'=1, O'=0, [ Q>=2 && H>=Q ], cost: 1 7: f27 -> f35 : Q'=1, M'=1, N'=1, O'=0, [ H>=1 && Q==1 ], cost: 1 19: f27 -> f1 : A1'=B, B'=C, B1'=D, C'=E, C1'=F, D'=G, D1'=H, E'=Q, E1'=J, F'=K, F1'=L, G'=M, H'=N, Q'=O, J'=P, K'=Q_1, L'=R, M'=S, N'=T, O'=U, P'=V, Q_1'=W, [ 0>=2+A && Q>=1+H ], cost: 1 20: f27 -> f1 : A1'=B, B'=C, B1'=D, C'=E, C1'=F, D'=G, D1'=H, E'=Q, E1'=J, F'=K, F1'=L, G'=M, H'=N, Q'=O, J'=P, K'=Q_1, L'=R, M'=S, N'=T, O'=U, P'=V, Q_1'=W, [ A>=0 && Q>=1+H ], cost: 1 21: f27 -> f1 : A'=-1, A1'=B, B'=C, B1'=D, C'=E, C1'=F, D'=G, D1'=H, E'=Q, E1'=J, F'=K, F1'=L, G'=M, H'=N, Q'=O, J'=P, K'=Q_1, L'=R, M'=S, N'=T, O'=U, P'=V, Q_1'=W, [ Q>=1+H && 1+A==0 ], cost: 1 8: f35 -> f38 : [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 ], cost: 1 18: f35 -> f27 : Q'=1+Q, [ P>=2*free_72 && 3*free_72>=1+P && Q_1>=2+free_72 ], cost: 1 9: f38 -> f53 : [ 0>=Q_1 && J>=K ], cost: 1 10: f38 -> f53 : [ Q_1>=2 && J>=K ], cost: 1 11: f38 -> f38 : K'=1+K, L'=3+free_23, Q_1'=1, R'=B*free_20+free_25*B, S'=-B*free_22+B*free_26, T'=-C*free_24+free_19*C, U'=-C*free_21-free_27*C, [ J>=K+4*free_23 && K+5*free_23>=1+J && 0>=K && J>=K && Q_1==1 ], cost: 1 12: f38 -> f38 : K'=1+K, L'=3+free_32, Q_1'=1, R'=B*free_29+B*free_34, S'=B*free_35-B*free_31, T'=free_28*C-free_33*C, U'=-free_36*C-free_30*C, [ J>=4*free_32+K && 5*free_32+K>=1+J && J>=K && K>=2 && Q_1==1 ], cost: 1 13: f38 -> f38 : K'=2, L'=1, Q_1'=1, R'=free_41*B+B*free_43, S'=B*free_38-B*free_44, T'=-C*free_37+C*free_40, U'=-free_42*C-free_39*C, [ J>=1 && K==1 && Q_1==1 ], cost: 1 17: f38 -> f35 : E'=N, N'=N*F+N-G*O, O'=G*N+F*O+O, Q_1'=1+Q_1, W'=2+W, [ K>=1+J ], cost: 1 14: f53 -> f38 : K'=1+K, L'=2+J-K, R'=B*free_49+B*free_51, S'=B*free_46-B*free_52, T'=-free_45*C+free_48*C, U'=-C*free_50-C*free_47, V'=3-free_53+P, [ Q_1>=2*free_53 && 3*free_53>=1+Q_1 && 0>=K ], cost: 1 15: f53 -> f38 : K'=1+K, L'=2+J-K, R'=B*free_58+B*free_60, S'=-B*free_61+B*free_55, T'=C*free_57-free_54*C, U'=-free_59*C-free_56*C, V'=3-free_62+P, [ Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 ], cost: 1 16: f53 -> f38 : K'=2, L'=1, R'=free_67*B+B*free_69, S'=-free_70*B+B*free_64, T'=-C*free_63+C*free_66, U'=-free_68*C-free_65*C, V'=3-free_71+P, [ Q_1>=2*free_71 && 3*free_71>=1+Q_1 && K==1 ], cost: 1 Checking for constant complexity: The following rule is satisfiable with cost >= 1, yielding constant complexity: 0: f2 -> f13 : A'=1, B'=free_3, C'=free_4, D'=free_1, E'=free_5, F'=free_2, G'=free, [ A==1 ], cost: 1 Removed unreachable and leaf rules: Start location: f2 0: f2 -> f13 : A'=1, B'=free_3, C'=free_4, D'=free_1, E'=free_5, F'=free_2, G'=free, [ A==1 ], cost: 1 3: f2 -> f27 : B'=free_9, C'=free_10, D'=free_7, E'=free_11, F'=free_8, G'=free_6, [ 0>=A ], cost: 1 4: f2 -> f27 : B'=free_15, C'=free_16, D'=free_13, E'=free_17, F'=free_14, G'=free_12, [ A>=2 ], cost: 1 1: f13 -> f16 : [ H>=Q ], cost: 1 23: f13 -> f27 : [ Q>=1+H ], cost: 1 2: f16 -> f16 : K'=1+K, L'=2+L, [ J>=K ], cost: 1 22: f16 -> f13 : Q'=1+Q, [ K>=1+J ], cost: 1 5: f27 -> f35 : M'=2+H-Q, N'=1, O'=0, [ 0>=Q && H>=Q ], cost: 1 6: f27 -> f35 : M'=2+H-Q, N'=1, O'=0, [ Q>=2 && H>=Q ], cost: 1 7: f27 -> f35 : Q'=1, M'=1, N'=1, O'=0, [ H>=1 && Q==1 ], cost: 1 8: f35 -> f38 : [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 ], cost: 1 18: f35 -> f27 : Q'=1+Q, [ P>=2*free_72 && 3*free_72>=1+P && Q_1>=2+free_72 ], cost: 1 9: f38 -> f53 : [ 0>=Q_1 && J>=K ], cost: 1 10: f38 -> f53 : [ Q_1>=2 && J>=K ], cost: 1 11: f38 -> f38 : K'=1+K, L'=3+free_23, Q_1'=1, R'=B*free_20+free_25*B, S'=-B*free_22+B*free_26, T'=-C*free_24+free_19*C, U'=-C*free_21-free_27*C, [ J>=K+4*free_23 && K+5*free_23>=1+J && 0>=K && J>=K && Q_1==1 ], cost: 1 12: f38 -> f38 : K'=1+K, L'=3+free_32, Q_1'=1, R'=B*free_29+B*free_34, S'=B*free_35-B*free_31, T'=free_28*C-free_33*C, U'=-free_36*C-free_30*C, [ J>=4*free_32+K && 5*free_32+K>=1+J && J>=K && K>=2 && Q_1==1 ], cost: 1 13: f38 -> f38 : K'=2, L'=1, Q_1'=1, R'=free_41*B+B*free_43, S'=B*free_38-B*free_44, T'=-C*free_37+C*free_40, U'=-free_42*C-free_39*C, [ J>=1 && K==1 && Q_1==1 ], cost: 1 17: f38 -> f35 : E'=N, N'=N*F+N-G*O, O'=G*N+F*O+O, Q_1'=1+Q_1, W'=2+W, [ K>=1+J ], cost: 1 14: f53 -> f38 : K'=1+K, L'=2+J-K, R'=B*free_49+B*free_51, S'=B*free_46-B*free_52, T'=-free_45*C+free_48*C, U'=-C*free_50-C*free_47, V'=3-free_53+P, [ Q_1>=2*free_53 && 3*free_53>=1+Q_1 && 0>=K ], cost: 1 15: f53 -> f38 : K'=1+K, L'=2+J-K, R'=B*free_58+B*free_60, S'=-B*free_61+B*free_55, T'=C*free_57-free_54*C, U'=-free_59*C-free_56*C, V'=3-free_62+P, [ Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 ], cost: 1 16: f53 -> f38 : K'=2, L'=1, R'=free_67*B+B*free_69, S'=-free_70*B+B*free_64, T'=-C*free_63+C*free_66, U'=-free_68*C-free_65*C, V'=3-free_71+P, [ Q_1>=2*free_71 && 3*free_71>=1+Q_1 && K==1 ], cost: 1 ### Simplification by acceleration and chaining ### Accelerating simple loops of location 2. Accelerating the following rules: 2: f16 -> f16 : K'=1+K, L'=2+L, [ J>=K ], cost: 1 Accelerated rule 2 with metering function 1+J-K, yielding the new rule 24. Removing the simple loops: 2. Accelerating simple loops of location 5. Accelerating the following rules: 11: f38 -> f38 : K'=1+K, L'=3+free_23, Q_1'=1, R'=B*free_20+free_25*B, S'=-B*free_22+B*free_26, T'=-C*free_24+free_19*C, U'=-C*free_21-free_27*C, [ J>=K+4*free_23 && K+5*free_23>=1+J && 0>=K && Q_1==1 ], cost: 1 12: f38 -> f38 : K'=1+K, L'=3+free_32, Q_1'=1, R'=B*free_29+B*free_34, S'=B*free_35-B*free_31, T'=free_28*C-free_33*C, U'=-free_36*C-free_30*C, [ J>=4*free_32+K && 5*free_32+K>=1+J && K>=2 && Q_1==1 ], cost: 1 13: f38 -> f38 : K'=2, L'=1, Q_1'=1, R'=free_41*B+B*free_43, S'=B*free_38-B*free_44, T'=-C*free_37+C*free_40, U'=-free_42*C-free_39*C, [ J>=1 && K==1 && Q_1==1 ], cost: 1 Found no metering function for rule 11. Accelerated rule 12 with metering function 1+J-4*free_32-K, yielding the new rule 25. Accelerated rule 13 with metering function 2-K, yielding the new rule 26. Removing the simple loops: 12 13. Accelerated all simple loops using metering functions (where possible): Start location: f2 0: f2 -> f13 : A'=1, B'=free_3, C'=free_4, D'=free_1, E'=free_5, F'=free_2, G'=free, [ A==1 ], cost: 1 3: f2 -> f27 : B'=free_9, C'=free_10, D'=free_7, E'=free_11, F'=free_8, G'=free_6, [ 0>=A ], cost: 1 4: f2 -> f27 : B'=free_15, C'=free_16, D'=free_13, E'=free_17, F'=free_14, G'=free_12, [ A>=2 ], cost: 1 1: f13 -> f16 : [ H>=Q ], cost: 1 23: f13 -> f27 : [ Q>=1+H ], cost: 1 22: f16 -> f13 : Q'=1+Q, [ K>=1+J ], cost: 1 24: f16 -> f16 : K'=1+J, L'=2+2*J-2*K+L, [ J>=K ], cost: 1+J-K 5: f27 -> f35 : M'=2+H-Q, N'=1, O'=0, [ 0>=Q && H>=Q ], cost: 1 6: f27 -> f35 : M'=2+H-Q, N'=1, O'=0, [ Q>=2 && H>=Q ], cost: 1 7: f27 -> f35 : Q'=1, M'=1, N'=1, O'=0, [ H>=1 && Q==1 ], cost: 1 8: f35 -> f38 : [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 ], cost: 1 18: f35 -> f27 : Q'=1+Q, [ P>=2*free_72 && 3*free_72>=1+P && Q_1>=2+free_72 ], cost: 1 9: f38 -> f53 : [ 0>=Q_1 && J>=K ], cost: 1 10: f38 -> f53 : [ Q_1>=2 && J>=K ], cost: 1 11: f38 -> f38 : K'=1+K, L'=3+free_23, Q_1'=1, R'=B*free_20+free_25*B, S'=-B*free_22+B*free_26, T'=-C*free_24+free_19*C, U'=-C*free_21-free_27*C, [ J>=K+4*free_23 && K+5*free_23>=1+J && 0>=K && Q_1==1 ], cost: 1 17: f38 -> f35 : E'=N, N'=N*F+N-G*O, O'=G*N+F*O+O, Q_1'=1+Q_1, W'=2+W, [ K>=1+J ], cost: 1 25: f38 -> f38 : K'=1+J-4*free_32, L'=3+free_32, Q_1'=1, R'=B*free_29+B*free_34, S'=B*free_35-B*free_31, T'=free_28*C-free_33*C, U'=-free_36*C-free_30*C, [ J>=4*free_32+K && 5*free_32+K>=1+J && K>=2 && Q_1==1 ], cost: 1+J-4*free_32-K 26: f38 -> f38 : K'=2, L'=1, Q_1'=1, R'=free_41*B+B*free_43, S'=B*free_38-B*free_44, T'=-C*free_37+C*free_40, U'=-free_42*C-free_39*C, [ J>=1 && K==1 && Q_1==1 ], cost: 2-K 14: f53 -> f38 : K'=1+K, L'=2+J-K, R'=B*free_49+B*free_51, S'=B*free_46-B*free_52, T'=-free_45*C+free_48*C, U'=-C*free_50-C*free_47, V'=3-free_53+P, [ Q_1>=2*free_53 && 3*free_53>=1+Q_1 && 0>=K ], cost: 1 15: f53 -> f38 : K'=1+K, L'=2+J-K, R'=B*free_58+B*free_60, S'=-B*free_61+B*free_55, T'=C*free_57-free_54*C, U'=-free_59*C-free_56*C, V'=3-free_62+P, [ Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 ], cost: 1 16: f53 -> f38 : K'=2, L'=1, R'=free_67*B+B*free_69, S'=-free_70*B+B*free_64, T'=-C*free_63+C*free_66, U'=-free_68*C-free_65*C, V'=3-free_71+P, [ Q_1>=2*free_71 && 3*free_71>=1+Q_1 && K==1 ], cost: 1 Chained accelerated rules (with incoming rules): Start location: f2 0: f2 -> f13 : A'=1, B'=free_3, C'=free_4, D'=free_1, E'=free_5, F'=free_2, G'=free, [ A==1 ], cost: 1 3: f2 -> f27 : B'=free_9, C'=free_10, D'=free_7, E'=free_11, F'=free_8, G'=free_6, [ 0>=A ], cost: 1 4: f2 -> f27 : B'=free_15, C'=free_16, D'=free_13, E'=free_17, F'=free_14, G'=free_12, [ A>=2 ], cost: 1 1: f13 -> f16 : [ H>=Q ], cost: 1 23: f13 -> f27 : [ Q>=1+H ], cost: 1 27: f13 -> f16 : K'=1+J, L'=2+2*J-2*K+L, [ H>=Q && J>=K ], cost: 2+J-K 22: f16 -> f13 : Q'=1+Q, [ K>=1+J ], cost: 1 5: f27 -> f35 : M'=2+H-Q, N'=1, O'=0, [ 0>=Q && H>=Q ], cost: 1 6: f27 -> f35 : M'=2+H-Q, N'=1, O'=0, [ Q>=2 && H>=Q ], cost: 1 7: f27 -> f35 : Q'=1, M'=1, N'=1, O'=0, [ H>=1 && Q==1 ], cost: 1 8: f35 -> f38 : [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 ], cost: 1 18: f35 -> f27 : Q'=1+Q, [ P>=2*free_72 && 3*free_72>=1+P && Q_1>=2+free_72 ], cost: 1 28: f35 -> f38 : K'=1+K, L'=3+free_23, Q_1'=1, R'=B*free_20+free_25*B, S'=-B*free_22+B*free_26, T'=-C*free_24+free_19*C, U'=-C*free_21-free_27*C, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_23 && K+5*free_23>=1+J && 0>=K && Q_1==1 ], cost: 2 29: f35 -> f38 : K'=1+J-4*free_32, L'=3+free_32, Q_1'=1, R'=B*free_29+B*free_34, S'=B*free_35-B*free_31, T'=free_28*C-free_33*C, U'=-free_36*C-free_30*C, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=4*free_32+K && 5*free_32+K>=1+J && K>=2 && Q_1==1 ], cost: 2+J-4*free_32-K 30: f35 -> f38 : K'=2, L'=1, Q_1'=1, R'=free_41*B+B*free_43, S'=B*free_38-B*free_44, T'=-C*free_37+C*free_40, U'=-free_42*C-free_39*C, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=1 && K==1 && Q_1==1 ], cost: 3-K 9: f38 -> f53 : [ 0>=Q_1 && J>=K ], cost: 1 10: f38 -> f53 : [ Q_1>=2 && J>=K ], cost: 1 17: f38 -> f35 : E'=N, N'=N*F+N-G*O, O'=G*N+F*O+O, Q_1'=1+Q_1, W'=2+W, [ K>=1+J ], cost: 1 14: f53 -> f38 : K'=1+K, L'=2+J-K, R'=B*free_49+B*free_51, S'=B*free_46-B*free_52, T'=-free_45*C+free_48*C, U'=-C*free_50-C*free_47, V'=3-free_53+P, [ Q_1>=2*free_53 && 3*free_53>=1+Q_1 && 0>=K ], cost: 1 15: f53 -> f38 : K'=1+K, L'=2+J-K, R'=B*free_58+B*free_60, S'=-B*free_61+B*free_55, T'=C*free_57-free_54*C, U'=-free_59*C-free_56*C, V'=3-free_62+P, [ Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 ], cost: 1 16: f53 -> f38 : K'=2, L'=1, R'=free_67*B+B*free_69, S'=-free_70*B+B*free_64, T'=-C*free_63+C*free_66, U'=-free_68*C-free_65*C, V'=3-free_71+P, [ Q_1>=2*free_71 && 3*free_71>=1+Q_1 && K==1 ], cost: 1 Eliminated locations (on tree-shaped paths): Start location: f2 0: f2 -> f13 : A'=1, B'=free_3, C'=free_4, D'=free_1, E'=free_5, F'=free_2, G'=free, [ A==1 ], cost: 1 3: f2 -> f27 : B'=free_9, C'=free_10, D'=free_7, E'=free_11, F'=free_8, G'=free_6, [ 0>=A ], cost: 1 4: f2 -> f27 : B'=free_15, C'=free_16, D'=free_13, E'=free_17, F'=free_14, G'=free_12, [ A>=2 ], cost: 1 23: f13 -> f27 : [ Q>=1+H ], cost: 1 31: f13 -> f13 : Q'=1+Q, [ H>=Q && K>=1+J ], cost: 2 32: f13 -> f13 : Q'=1+Q, K'=1+J, L'=2+2*J-2*K+L, [ H>=Q && J>=K ], cost: 3+J-K 5: f27 -> f35 : M'=2+H-Q, N'=1, O'=0, [ 0>=Q && H>=Q ], cost: 1 6: f27 -> f35 : M'=2+H-Q, N'=1, O'=0, [ Q>=2 && H>=Q ], cost: 1 7: f27 -> f35 : Q'=1, M'=1, N'=1, O'=0, [ H>=1 && Q==1 ], cost: 1 8: f35 -> f38 : [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 ], cost: 1 18: f35 -> f27 : Q'=1+Q, [ P>=2*free_72 && 3*free_72>=1+P && Q_1>=2+free_72 ], cost: 1 28: f35 -> f38 : K'=1+K, L'=3+free_23, Q_1'=1, R'=B*free_20+free_25*B, S'=-B*free_22+B*free_26, T'=-C*free_24+free_19*C, U'=-C*free_21-free_27*C, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_23 && K+5*free_23>=1+J && 0>=K && Q_1==1 ], cost: 2 29: f35 -> f38 : K'=1+J-4*free_32, L'=3+free_32, Q_1'=1, R'=B*free_29+B*free_34, S'=B*free_35-B*free_31, T'=free_28*C-free_33*C, U'=-free_36*C-free_30*C, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=4*free_32+K && 5*free_32+K>=1+J && K>=2 && Q_1==1 ], cost: 2+J-4*free_32-K 30: f35 -> f38 : K'=2, L'=1, Q_1'=1, R'=free_41*B+B*free_43, S'=B*free_38-B*free_44, T'=-C*free_37+C*free_40, U'=-free_42*C-free_39*C, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=1 && K==1 && Q_1==1 ], cost: 3-K 17: f38 -> f35 : E'=N, N'=N*F+N-G*O, O'=G*N+F*O+O, Q_1'=1+Q_1, W'=2+W, [ K>=1+J ], cost: 1 33: f38 -> f38 : K'=1+K, L'=2+J-K, R'=B*free_49+B*free_51, S'=B*free_46-B*free_52, T'=-free_45*C+free_48*C, U'=-C*free_50-C*free_47, V'=3-free_53+P, [ Q_1>=2 && J>=K && Q_1>=2*free_53 && 3*free_53>=1+Q_1 && 0>=K ], cost: 2 34: f38 -> f38 : K'=1+K, L'=2+J-K, R'=B*free_58+B*free_60, S'=-B*free_61+B*free_55, T'=C*free_57-free_54*C, U'=-free_59*C-free_56*C, V'=3-free_62+P, [ Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 ], cost: 2 35: f38 -> f38 : K'=2, L'=1, R'=free_67*B+B*free_69, S'=-free_70*B+B*free_64, T'=-C*free_63+C*free_66, U'=-free_68*C-free_65*C, V'=3-free_71+P, [ Q_1>=2 && J>=K && Q_1>=2*free_71 && 3*free_71>=1+Q_1 && K==1 ], cost: 2 Accelerating simple loops of location 1. Accelerating the following rules: 31: f13 -> f13 : Q'=1+Q, [ H>=Q && K>=1+J ], cost: 2 32: f13 -> f13 : Q'=1+Q, K'=1+J, L'=2+2*J-2*K+L, [ H>=Q && J>=K ], cost: 3+J-K Accelerated rule 31 with metering function 1+H-Q, yielding the new rule 36. Found no metering function for rule 32. Removing the simple loops: 31. Accelerating simple loops of location 5. Accelerating the following rules: 33: f38 -> f38 : K'=1+K, L'=2+J-K, R'=B*free_49+B*free_51, S'=B*free_46-B*free_52, T'=-free_45*C+free_48*C, U'=-C*free_50-C*free_47, V'=3-free_53+P, [ Q_1>=2 && J>=K && Q_1>=2*free_53 && 3*free_53>=1+Q_1 && 0>=K ], cost: 2 34: f38 -> f38 : K'=1+K, L'=2+J-K, R'=B*free_58+B*free_60, S'=-B*free_61+B*free_55, T'=C*free_57-free_54*C, U'=-free_59*C-free_56*C, V'=3-free_62+P, [ Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 ], cost: 2 35: f38 -> f38 : K'=2, L'=1, R'=free_67*B+B*free_69, S'=-free_70*B+B*free_64, T'=-C*free_63+C*free_66, U'=-free_68*C-free_65*C, V'=3-free_71+P, [ Q_1>=2 && J>=K && Q_1>=2*free_71 && 3*free_71>=1+Q_1 && K==1 ], cost: 2 Found no metering function for rule 33. Accelerated rule 34 with metering function 1+J-K, yielding the new rule 37. Accelerated rule 35 with metering function 1-K, yielding the new rule 38. Removing the simple loops: 34 35. Accelerated all simple loops using metering functions (where possible): Start location: f2 0: f2 -> f13 : A'=1, B'=free_3, C'=free_4, D'=free_1, E'=free_5, F'=free_2, G'=free, [ A==1 ], cost: 1 3: f2 -> f27 : B'=free_9, C'=free_10, D'=free_7, E'=free_11, F'=free_8, G'=free_6, [ 0>=A ], cost: 1 4: f2 -> f27 : B'=free_15, C'=free_16, D'=free_13, E'=free_17, F'=free_14, G'=free_12, [ A>=2 ], cost: 1 23: f13 -> f27 : [ Q>=1+H ], cost: 1 32: f13 -> f13 : Q'=1+Q, K'=1+J, L'=2+2*J-2*K+L, [ H>=Q && J>=K ], cost: 3+J-K 36: f13 -> f13 : Q'=1+H, [ H>=Q && K>=1+J ], cost: 2+2*H-2*Q 5: f27 -> f35 : M'=2+H-Q, N'=1, O'=0, [ 0>=Q && H>=Q ], cost: 1 6: f27 -> f35 : M'=2+H-Q, N'=1, O'=0, [ Q>=2 && H>=Q ], cost: 1 7: f27 -> f35 : Q'=1, M'=1, N'=1, O'=0, [ H>=1 && Q==1 ], cost: 1 8: f35 -> f38 : [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 ], cost: 1 18: f35 -> f27 : Q'=1+Q, [ P>=2*free_72 && 3*free_72>=1+P && Q_1>=2+free_72 ], cost: 1 28: f35 -> f38 : K'=1+K, L'=3+free_23, Q_1'=1, R'=B*free_20+free_25*B, S'=-B*free_22+B*free_26, T'=-C*free_24+free_19*C, U'=-C*free_21-free_27*C, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_23 && K+5*free_23>=1+J && 0>=K && Q_1==1 ], cost: 2 29: f35 -> f38 : K'=1+J-4*free_32, L'=3+free_32, Q_1'=1, R'=B*free_29+B*free_34, S'=B*free_35-B*free_31, T'=free_28*C-free_33*C, U'=-free_36*C-free_30*C, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=4*free_32+K && 5*free_32+K>=1+J && K>=2 && Q_1==1 ], cost: 2+J-4*free_32-K 30: f35 -> f38 : K'=2, L'=1, Q_1'=1, R'=free_41*B+B*free_43, S'=B*free_38-B*free_44, T'=-C*free_37+C*free_40, U'=-free_42*C-free_39*C, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=1 && K==1 && Q_1==1 ], cost: 3-K 17: f38 -> f35 : E'=N, N'=N*F+N-G*O, O'=G*N+F*O+O, Q_1'=1+Q_1, W'=2+W, [ K>=1+J ], cost: 1 33: f38 -> f38 : K'=1+K, L'=2+J-K, R'=B*free_49+B*free_51, S'=B*free_46-B*free_52, T'=-free_45*C+free_48*C, U'=-C*free_50-C*free_47, V'=3-free_53+P, [ Q_1>=2 && J>=K && Q_1>=2*free_53 && 3*free_53>=1+Q_1 && 0>=K ], cost: 2 37: f38 -> f38 : K'=1+J, L'=2, R'=B*free_58+B*free_60, S'=-B*free_61+B*free_55, T'=C*free_57-free_54*C, U'=-free_59*C-free_56*C, V'=3-free_62+P, [ Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 ], cost: 2+2*J-2*K 38: f38 -> f38 : K'=2, L'=1, R'=free_67*B+B*free_69, S'=-free_70*B+B*free_64, T'=-C*free_63+C*free_66, U'=-free_68*C-free_65*C, V'=3-free_71+P, [ Q_1>=2 && J>=K && Q_1>=2*free_71 && 3*free_71>=1+Q_1 && K==1 && 1-K>=1 ], cost: 2-2*K Chained accelerated rules (with incoming rules): Start location: f2 0: f2 -> f13 : A'=1, B'=free_3, C'=free_4, D'=free_1, E'=free_5, F'=free_2, G'=free, [ A==1 ], cost: 1 3: f2 -> f27 : B'=free_9, C'=free_10, D'=free_7, E'=free_11, F'=free_8, G'=free_6, [ 0>=A ], cost: 1 4: f2 -> f27 : B'=free_15, C'=free_16, D'=free_13, E'=free_17, F'=free_14, G'=free_12, [ A>=2 ], cost: 1 39: f2 -> f13 : A'=1, B'=free_3, C'=free_4, D'=free_1, E'=free_5, F'=free_2, G'=free, Q'=1+Q, K'=1+J, L'=2+2*J-2*K+L, [ A==1 && H>=Q && J>=K ], cost: 4+J-K 40: f2 -> f13 : A'=1, B'=free_3, C'=free_4, D'=free_1, E'=free_5, F'=free_2, G'=free, Q'=1+H, [ A==1 && H>=Q && K>=1+J ], cost: 3+2*H-2*Q 23: f13 -> f27 : [ Q>=1+H ], cost: 1 5: f27 -> f35 : M'=2+H-Q, N'=1, O'=0, [ 0>=Q && H>=Q ], cost: 1 6: f27 -> f35 : M'=2+H-Q, N'=1, O'=0, [ Q>=2 && H>=Q ], cost: 1 7: f27 -> f35 : Q'=1, M'=1, N'=1, O'=0, [ H>=1 && Q==1 ], cost: 1 8: f35 -> f38 : [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 ], cost: 1 18: f35 -> f27 : Q'=1+Q, [ P>=2*free_72 && 3*free_72>=1+P && Q_1>=2+free_72 ], cost: 1 28: f35 -> f38 : K'=1+K, L'=3+free_23, Q_1'=1, R'=B*free_20+free_25*B, S'=-B*free_22+B*free_26, T'=-C*free_24+free_19*C, U'=-C*free_21-free_27*C, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_23 && K+5*free_23>=1+J && 0>=K && Q_1==1 ], cost: 2 29: f35 -> f38 : K'=1+J-4*free_32, L'=3+free_32, Q_1'=1, R'=B*free_29+B*free_34, S'=B*free_35-B*free_31, T'=free_28*C-free_33*C, U'=-free_36*C-free_30*C, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=4*free_32+K && 5*free_32+K>=1+J && K>=2 && Q_1==1 ], cost: 2+J-4*free_32-K 30: f35 -> f38 : K'=2, L'=1, Q_1'=1, R'=free_41*B+B*free_43, S'=B*free_38-B*free_44, T'=-C*free_37+C*free_40, U'=-free_42*C-free_39*C, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=1 && K==1 && Q_1==1 ], cost: 3-K 41: f35 -> f38 : K'=1+K, L'=2+J-K, R'=B*free_49+B*free_51, S'=B*free_46-B*free_52, T'=-free_45*C+free_48*C, U'=-C*free_50-C*free_47, V'=3-free_53+P, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_53 && 3*free_53>=1+Q_1 && 0>=K ], cost: 3 42: f35 -> f38 : K'=1+J, L'=2, R'=B*free_58+B*free_60, S'=-B*free_61+B*free_55, T'=C*free_57-free_54*C, U'=-free_59*C-free_56*C, V'=3-free_62+P, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 ], cost: 3+2*J-2*K 17: f38 -> f35 : E'=N, N'=N*F+N-G*O, O'=G*N+F*O+O, Q_1'=1+Q_1, W'=2+W, [ K>=1+J ], cost: 1 Eliminated locations (on tree-shaped paths): Start location: f2 3: f2 -> f27 : B'=free_9, C'=free_10, D'=free_7, E'=free_11, F'=free_8, G'=free_6, [ 0>=A ], cost: 1 4: f2 -> f27 : B'=free_15, C'=free_16, D'=free_13, E'=free_17, F'=free_14, G'=free_12, [ A>=2 ], cost: 1 43: f2 -> f27 : A'=1, B'=free_3, C'=free_4, D'=free_1, E'=free_5, F'=free_2, G'=free, [ A==1 && Q>=1+H ], cost: 2 44: f2 -> f27 : A'=1, B'=free_3, C'=free_4, D'=free_1, E'=free_5, F'=free_2, G'=free, Q'=1+Q, K'=1+J, L'=2+2*J-2*K+L, [ A==1 && H>=Q && J>=K && 1+Q>=1+H ], cost: 5+J-K 45: f2 -> f27 : A'=1, B'=free_3, C'=free_4, D'=free_1, E'=free_5, F'=free_2, G'=free, Q'=1+H, [ A==1 && H>=Q && K>=1+J ], cost: 4+2*H-2*Q 5: f27 -> f35 : M'=2+H-Q, N'=1, O'=0, [ 0>=Q && H>=Q ], cost: 1 6: f27 -> f35 : M'=2+H-Q, N'=1, O'=0, [ Q>=2 && H>=Q ], cost: 1 7: f27 -> f35 : Q'=1, M'=1, N'=1, O'=0, [ H>=1 && Q==1 ], cost: 1 18: f35 -> f27 : Q'=1+Q, [ P>=2*free_72 && 3*free_72>=1+P && Q_1>=2+free_72 ], cost: 1 46: f35 -> f35 : E'=N, N'=N*F+N-G*O, O'=G*N+F*O+O, Q_1'=1+Q_1, W'=2+W, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && K>=1+J ], cost: 2 47: f35 -> f35 : E'=N, K'=2, L'=1, N'=N*F+N-G*O, O'=G*N+F*O+O, Q_1'=2, R'=free_41*B+B*free_43, S'=B*free_38-B*free_44, T'=-C*free_37+C*free_40, U'=-free_42*C-free_39*C, W'=2+W, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=1 && K==1 && Q_1==1 && 2>=1+J ], cost: 4-K 48: f35 -> f35 : E'=N, K'=1+K, L'=2+J-K, N'=N*F+N-G*O, O'=G*N+F*O+O, Q_1'=1+Q_1, R'=B*free_49+B*free_51, S'=B*free_46-B*free_52, T'=-free_45*C+free_48*C, U'=-C*free_50-C*free_47, V'=3-free_53+P, W'=2+W, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_53 && 3*free_53>=1+Q_1 && 0>=K && 1+K>=1+J ], cost: 4 49: f35 -> f35 : E'=N, K'=1+J, L'=2, N'=N*F+N-G*O, O'=G*N+F*O+O, Q_1'=1+Q_1, R'=B*free_58+B*free_60, S'=-B*free_61+B*free_55, T'=C*free_57-free_54*C, U'=-free_59*C-free_56*C, V'=3-free_62+P, W'=2+W, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 ], cost: 4+2*J-2*K 50: f35 -> [12] : [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=4*free_32+K && 5*free_32+K>=1+J && K>=2 && Q_1==1 ], cost: 2+J-4*free_32-K Accelerating simple loops of location 4. Simplified some of the simple loops (and removed duplicate rules). Accelerating the following rules: 46: f35 -> f35 : E'=N, N'=N*F+N-G*O, O'=G*N+F*O+O, Q_1'=1+Q_1, W'=2+W, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && K>=1+J ], cost: 2 47: f35 -> f35 : E'=N, K'=2, L'=1, N'=N*F+N-G*O, O'=G*N+F*O+O, Q_1'=2, R'=free_41*B+B*free_43, S'=B*free_38-B*free_44, T'=-C*free_37+C*free_40, U'=-free_42*C-free_39*C, W'=2+W, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && 1-J==0 && K==1 && Q_1==1 ], cost: 4-K 48: f35 -> f35 : E'=N, K'=1+K, L'=2+J-K, N'=N*F+N-G*O, O'=G*N+F*O+O, Q_1'=1+Q_1, R'=B*free_49+B*free_51, S'=B*free_46-B*free_52, T'=-free_45*C+free_48*C, U'=-C*free_50-C*free_47, V'=3-free_53+P, W'=2+W, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && -J+K==0 && Q_1>=2*free_53 && 3*free_53>=1+Q_1 && 0>=K ], cost: 4 49: f35 -> f35 : E'=N, K'=1+J, L'=2, N'=N*F+N-G*O, O'=G*N+F*O+O, Q_1'=1+Q_1, R'=B*free_58+B*free_60, S'=-B*free_61+B*free_55, T'=C*free_57-free_54*C, U'=-free_59*C-free_56*C, V'=3-free_62+P, W'=2+W, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 ], cost: 4+2*J-2*K Found no metering function for rule 46 (rule is too complicated). Found no metering function for rule 47 (rule is too complicated). Found no metering function for rule 48 (rule is too complicated). Found no metering function for rule 49. Removing the simple loops:. Accelerated all simple loops using metering functions (where possible): Start location: f2 3: f2 -> f27 : B'=free_9, C'=free_10, D'=free_7, E'=free_11, F'=free_8, G'=free_6, [ 0>=A ], cost: 1 4: f2 -> f27 : B'=free_15, C'=free_16, D'=free_13, E'=free_17, F'=free_14, G'=free_12, [ A>=2 ], cost: 1 43: f2 -> f27 : A'=1, B'=free_3, C'=free_4, D'=free_1, E'=free_5, F'=free_2, G'=free, [ A==1 && Q>=1+H ], cost: 2 44: f2 -> f27 : A'=1, B'=free_3, C'=free_4, D'=free_1, E'=free_5, F'=free_2, G'=free, Q'=1+Q, K'=1+J, L'=2+2*J-2*K+L, [ A==1 && H>=Q && J>=K && 1+Q>=1+H ], cost: 5+J-K 45: f2 -> f27 : A'=1, B'=free_3, C'=free_4, D'=free_1, E'=free_5, F'=free_2, G'=free, Q'=1+H, [ A==1 && H>=Q && K>=1+J ], cost: 4+2*H-2*Q 5: f27 -> f35 : M'=2+H-Q, N'=1, O'=0, [ 0>=Q && H>=Q ], cost: 1 6: f27 -> f35 : M'=2+H-Q, N'=1, O'=0, [ Q>=2 && H>=Q ], cost: 1 7: f27 -> f35 : Q'=1, M'=1, N'=1, O'=0, [ H>=1 && Q==1 ], cost: 1 18: f35 -> f27 : Q'=1+Q, [ P>=2*free_72 && 3*free_72>=1+P && Q_1>=2+free_72 ], cost: 1 46: f35 -> f35 : E'=N, N'=N*F+N-G*O, O'=G*N+F*O+O, Q_1'=1+Q_1, W'=2+W, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && K>=1+J ], cost: 2 47: f35 -> f35 : E'=N, K'=2, L'=1, N'=N*F+N-G*O, O'=G*N+F*O+O, Q_1'=2, R'=free_41*B+B*free_43, S'=B*free_38-B*free_44, T'=-C*free_37+C*free_40, U'=-free_42*C-free_39*C, W'=2+W, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && 1-J==0 && K==1 && Q_1==1 ], cost: 4-K 48: f35 -> f35 : E'=N, K'=1+K, L'=2+J-K, N'=N*F+N-G*O, O'=G*N+F*O+O, Q_1'=1+Q_1, R'=B*free_49+B*free_51, S'=B*free_46-B*free_52, T'=-free_45*C+free_48*C, U'=-C*free_50-C*free_47, V'=3-free_53+P, W'=2+W, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && -J+K==0 && Q_1>=2*free_53 && 3*free_53>=1+Q_1 && 0>=K ], cost: 4 49: f35 -> f35 : E'=N, K'=1+J, L'=2, N'=N*F+N-G*O, O'=G*N+F*O+O, Q_1'=1+Q_1, R'=B*free_58+B*free_60, S'=-B*free_61+B*free_55, T'=C*free_57-free_54*C, U'=-free_59*C-free_56*C, V'=3-free_62+P, W'=2+W, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 ], cost: 4+2*J-2*K 50: f35 -> [12] : [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=4*free_32+K && 5*free_32+K>=1+J && K>=2 && Q_1==1 ], cost: 2+J-4*free_32-K Chained accelerated rules (with incoming rules): Start location: f2 3: f2 -> f27 : B'=free_9, C'=free_10, D'=free_7, E'=free_11, F'=free_8, G'=free_6, [ 0>=A ], cost: 1 4: f2 -> f27 : B'=free_15, C'=free_16, D'=free_13, E'=free_17, F'=free_14, G'=free_12, [ A>=2 ], cost: 1 43: f2 -> f27 : A'=1, B'=free_3, C'=free_4, D'=free_1, E'=free_5, F'=free_2, G'=free, [ A==1 && Q>=1+H ], cost: 2 44: f2 -> f27 : A'=1, B'=free_3, C'=free_4, D'=free_1, E'=free_5, F'=free_2, G'=free, Q'=1+Q, K'=1+J, L'=2+2*J-2*K+L, [ A==1 && H>=Q && J>=K && 1+Q>=1+H ], cost: 5+J-K 45: f2 -> f27 : A'=1, B'=free_3, C'=free_4, D'=free_1, E'=free_5, F'=free_2, G'=free, Q'=1+H, [ A==1 && H>=Q && K>=1+J ], cost: 4+2*H-2*Q 5: f27 -> f35 : M'=2+H-Q, N'=1, O'=0, [ 0>=Q && H>=Q ], cost: 1 6: f27 -> f35 : M'=2+H-Q, N'=1, O'=0, [ Q>=2 && H>=Q ], cost: 1 7: f27 -> f35 : Q'=1, M'=1, N'=1, O'=0, [ H>=1 && Q==1 ], cost: 1 51: f27 -> f35 : E'=1, M'=2+H-Q, N'=1+F, O'=G, Q_1'=1+Q_1, W'=2+W, [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && K>=1+J ], cost: 3 52: f27 -> f35 : E'=1, M'=2+H-Q, N'=1+F, O'=G, Q_1'=1+Q_1, W'=2+W, [ Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && K>=1+J ], cost: 3 53: f27 -> f35 : E'=1, Q'=1, M'=1, N'=1+F, O'=G, Q_1'=1+Q_1, W'=2+W, [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && K>=1+J ], cost: 3 54: f27 -> f35 : E'=1, K'=2, L'=1, M'=2+H-Q, N'=1+F, O'=G, Q_1'=2, R'=free_41*B+B*free_43, S'=B*free_38-B*free_44, T'=-C*free_37+C*free_40, U'=-free_42*C-free_39*C, W'=2+W, [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && 1-J==0 && K==1 && Q_1==1 ], cost: 5-K 55: f27 -> f35 : E'=1, K'=2, L'=1, M'=2+H-Q, N'=1+F, O'=G, Q_1'=2, R'=free_41*B+B*free_43, S'=B*free_38-B*free_44, T'=-C*free_37+C*free_40, U'=-free_42*C-free_39*C, W'=2+W, [ Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && 1-J==0 && K==1 && Q_1==1 ], cost: 5-K 56: f27 -> f35 : E'=1, Q'=1, K'=2, L'=1, M'=1, N'=1+F, O'=G, Q_1'=2, R'=free_41*B+B*free_43, S'=B*free_38-B*free_44, T'=-C*free_37+C*free_40, U'=-free_42*C-free_39*C, W'=2+W, [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && 1-J==0 && K==1 && Q_1==1 ], cost: 5-K 57: f27 -> f35 : E'=1, K'=1+K, L'=2+J-K, M'=2+H-Q, N'=1+F, O'=G, Q_1'=1+Q_1, R'=B*free_49+B*free_51, S'=B*free_46-B*free_52, T'=-free_45*C+free_48*C, U'=-C*free_50-C*free_47, V'=3-free_53+P, W'=2+W, [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && -J+K==0 && Q_1>=2*free_53 && 3*free_53>=1+Q_1 && 0>=K ], cost: 5 58: f27 -> f35 : E'=1, K'=1+K, L'=2+J-K, M'=2+H-Q, N'=1+F, O'=G, Q_1'=1+Q_1, R'=B*free_49+B*free_51, S'=B*free_46-B*free_52, T'=-free_45*C+free_48*C, U'=-C*free_50-C*free_47, V'=3-free_53+P, W'=2+W, [ Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && -J+K==0 && Q_1>=2*free_53 && 3*free_53>=1+Q_1 && 0>=K ], cost: 5 59: f27 -> f35 : E'=1, Q'=1, K'=1+K, L'=2+J-K, M'=1, N'=1+F, O'=G, Q_1'=1+Q_1, R'=B*free_49+B*free_51, S'=B*free_46-B*free_52, T'=-free_45*C+free_48*C, U'=-C*free_50-C*free_47, V'=3-free_53+P, W'=2+W, [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && -J+K==0 && Q_1>=2*free_53 && 3*free_53>=1+Q_1 && 0>=K ], cost: 5 60: f27 -> f35 : E'=1, K'=1+J, L'=2, M'=2+H-Q, N'=1+F, O'=G, Q_1'=1+Q_1, R'=B*free_58+B*free_60, S'=-B*free_61+B*free_55, T'=C*free_57-free_54*C, U'=-free_59*C-free_56*C, V'=3-free_62+P, W'=2+W, [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 ], cost: 5+2*J-2*K 61: f27 -> f35 : E'=1, K'=1+J, L'=2, M'=2+H-Q, N'=1+F, O'=G, Q_1'=1+Q_1, R'=B*free_58+B*free_60, S'=-B*free_61+B*free_55, T'=C*free_57-free_54*C, U'=-free_59*C-free_56*C, V'=3-free_62+P, W'=2+W, [ Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 ], cost: 5+2*J-2*K 62: f27 -> f35 : E'=1, Q'=1, K'=1+J, L'=2, M'=1, N'=1+F, O'=G, Q_1'=1+Q_1, R'=B*free_58+B*free_60, S'=-B*free_61+B*free_55, T'=C*free_57-free_54*C, U'=-free_59*C-free_56*C, V'=3-free_62+P, W'=2+W, [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 ], cost: 5+2*J-2*K 18: f35 -> f27 : Q'=1+Q, [ P>=2*free_72 && 3*free_72>=1+P && Q_1>=2+free_72 ], cost: 1 50: f35 -> [12] : [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=4*free_32+K && 5*free_32+K>=1+J && K>=2 && Q_1==1 ], cost: 2+J-4*free_32-K Eliminated locations (on tree-shaped paths): Start location: f2 3: f2 -> f27 : B'=free_9, C'=free_10, D'=free_7, E'=free_11, F'=free_8, G'=free_6, [ 0>=A ], cost: 1 4: f2 -> f27 : B'=free_15, C'=free_16, D'=free_13, E'=free_17, F'=free_14, G'=free_12, [ A>=2 ], cost: 1 43: f2 -> f27 : A'=1, B'=free_3, C'=free_4, D'=free_1, E'=free_5, F'=free_2, G'=free, [ A==1 && Q>=1+H ], cost: 2 44: f2 -> f27 : A'=1, B'=free_3, C'=free_4, D'=free_1, E'=free_5, F'=free_2, G'=free, Q'=1+Q, K'=1+J, L'=2+2*J-2*K+L, [ A==1 && H>=Q && J>=K && 1+Q>=1+H ], cost: 5+J-K 45: f2 -> f27 : A'=1, B'=free_3, C'=free_4, D'=free_1, E'=free_5, F'=free_2, G'=free, Q'=1+H, [ A==1 && H>=Q && K>=1+J ], cost: 4+2*H-2*Q 63: f27 -> f27 : Q'=1+Q, M'=2+H-Q, N'=1, O'=0, [ 0>=Q && H>=Q && P>=2*free_72 && 3*free_72>=1+P && Q_1>=2+free_72 ], cost: 2 64: f27 -> [12] : M'=2+H-Q, N'=1, O'=0, [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=4*free_32+K && 5*free_32+K>=1+J && K>=2 && Q_1==1 ], cost: 3+J-4*free_32-K 65: f27 -> f27 : Q'=1+Q, M'=2+H-Q, N'=1, O'=0, [ Q>=2 && H>=Q && P>=2*free_72 && 3*free_72>=1+P && Q_1>=2+free_72 ], cost: 2 66: f27 -> [12] : M'=2+H-Q, N'=1, O'=0, [ Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=4*free_32+K && 5*free_32+K>=1+J && K>=2 && Q_1==1 ], cost: 3+J-4*free_32-K 67: f27 -> f27 : Q'=2, M'=1, N'=1, O'=0, [ H>=1 && Q==1 && P>=2*free_72 && 3*free_72>=1+P && Q_1>=2+free_72 ], cost: 2 68: f27 -> [12] : Q'=1, M'=1, N'=1, O'=0, [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=4*free_32+K && 5*free_32+K>=1+J && K>=2 && Q_1==1 ], cost: 3+J-4*free_32-K 69: f27 -> f27 : E'=1, Q'=1+Q, M'=2+H-Q, N'=1+F, O'=G, Q_1'=1+Q_1, W'=2+W, [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && K>=1+J && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 4 70: f27 -> f27 : E'=1, Q'=1+Q, M'=2+H-Q, N'=1+F, O'=G, Q_1'=1+Q_1, W'=2+W, [ Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && K>=1+J && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 4 71: f27 -> f27 : E'=1, Q'=2, M'=1, N'=1+F, O'=G, Q_1'=1+Q_1, W'=2+W, [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && K>=1+J && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 4 72: f27 -> f27 : E'=1, Q'=1+Q, K'=1+K, L'=2+J-K, M'=2+H-Q, N'=1+F, O'=G, Q_1'=1+Q_1, R'=B*free_49+B*free_51, S'=B*free_46-B*free_52, T'=-free_45*C+free_48*C, U'=-C*free_50-C*free_47, V'=3-free_53+P, W'=2+W, [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && -J+K==0 && Q_1>=2*free_53 && 3*free_53>=1+Q_1 && 0>=K && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 6 73: f27 -> f27 : E'=1, Q'=1+Q, K'=1+K, L'=2+J-K, M'=2+H-Q, N'=1+F, O'=G, Q_1'=1+Q_1, R'=B*free_49+B*free_51, S'=B*free_46-B*free_52, T'=-free_45*C+free_48*C, U'=-C*free_50-C*free_47, V'=3-free_53+P, W'=2+W, [ Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && -J+K==0 && Q_1>=2*free_53 && 3*free_53>=1+Q_1 && 0>=K && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 6 74: f27 -> f27 : E'=1, Q'=2, K'=1+K, L'=2+J-K, M'=1, N'=1+F, O'=G, Q_1'=1+Q_1, R'=B*free_49+B*free_51, S'=B*free_46-B*free_52, T'=-free_45*C+free_48*C, U'=-C*free_50-C*free_47, V'=3-free_53+P, W'=2+W, [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && -J+K==0 && Q_1>=2*free_53 && 3*free_53>=1+Q_1 && 0>=K && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 6 75: f27 -> f27 : E'=1, Q'=1+Q, K'=1+J, L'=2, M'=2+H-Q, N'=1+F, O'=G, Q_1'=1+Q_1, R'=B*free_58+B*free_60, S'=-B*free_61+B*free_55, T'=C*free_57-free_54*C, U'=-free_59*C-free_56*C, V'=3-free_62+P, W'=2+W, [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 6+2*J-2*K 76: f27 -> f27 : E'=1, Q'=1+Q, K'=1+J, L'=2, M'=2+H-Q, N'=1+F, O'=G, Q_1'=1+Q_1, R'=B*free_58+B*free_60, S'=-B*free_61+B*free_55, T'=C*free_57-free_54*C, U'=-free_59*C-free_56*C, V'=3-free_62+P, W'=2+W, [ Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 6+2*J-2*K 77: f27 -> f27 : E'=1, Q'=2, K'=1+J, L'=2, M'=1, N'=1+F, O'=G, Q_1'=1+Q_1, R'=B*free_58+B*free_60, S'=-B*free_61+B*free_55, T'=C*free_57-free_54*C, U'=-free_59*C-free_56*C, V'=3-free_62+P, W'=2+W, [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 6+2*J-2*K 78: f27 -> [14] : [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && 1-J==0 && K==1 && Q_1==1 ], cost: 5-K 79: f27 -> [14] : [ Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && 1-J==0 && K==1 && Q_1==1 ], cost: 5-K 80: f27 -> [14] : [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && 1-J==0 && K==1 && Q_1==1 ], cost: 5-K 81: f27 -> [14] : [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 ], cost: 5+2*J-2*K 82: f27 -> [14] : [ Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 ], cost: 5+2*J-2*K 83: f27 -> [14] : [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 ], cost: 5+2*J-2*K Applied pruning (of leafs and parallel rules): Start location: f2 3: f2 -> f27 : B'=free_9, C'=free_10, D'=free_7, E'=free_11, F'=free_8, G'=free_6, [ 0>=A ], cost: 1 4: f2 -> f27 : B'=free_15, C'=free_16, D'=free_13, E'=free_17, F'=free_14, G'=free_12, [ A>=2 ], cost: 1 43: f2 -> f27 : A'=1, B'=free_3, C'=free_4, D'=free_1, E'=free_5, F'=free_2, G'=free, [ A==1 && Q>=1+H ], cost: 2 44: f2 -> f27 : A'=1, B'=free_3, C'=free_4, D'=free_1, E'=free_5, F'=free_2, G'=free, Q'=1+Q, K'=1+J, L'=2+2*J-2*K+L, [ A==1 && H>=Q && J>=K && 1+Q>=1+H ], cost: 5+J-K 45: f2 -> f27 : A'=1, B'=free_3, C'=free_4, D'=free_1, E'=free_5, F'=free_2, G'=free, Q'=1+H, [ A==1 && H>=Q && K>=1+J ], cost: 4+2*H-2*Q 64: f27 -> [12] : M'=2+H-Q, N'=1, O'=0, [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=4*free_32+K && 5*free_32+K>=1+J && K>=2 && Q_1==1 ], cost: 3+J-4*free_32-K 66: f27 -> [12] : M'=2+H-Q, N'=1, O'=0, [ Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=4*free_32+K && 5*free_32+K>=1+J && K>=2 && Q_1==1 ], cost: 3+J-4*free_32-K 68: f27 -> [12] : Q'=1, M'=1, N'=1, O'=0, [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=4*free_32+K && 5*free_32+K>=1+J && K>=2 && Q_1==1 ], cost: 3+J-4*free_32-K 69: f27 -> f27 : E'=1, Q'=1+Q, M'=2+H-Q, N'=1+F, O'=G, Q_1'=1+Q_1, W'=2+W, [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && K>=1+J && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 4 72: f27 -> f27 : E'=1, Q'=1+Q, K'=1+K, L'=2+J-K, M'=2+H-Q, N'=1+F, O'=G, Q_1'=1+Q_1, R'=B*free_49+B*free_51, S'=B*free_46-B*free_52, T'=-free_45*C+free_48*C, U'=-C*free_50-C*free_47, V'=3-free_53+P, W'=2+W, [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && -J+K==0 && Q_1>=2*free_53 && 3*free_53>=1+Q_1 && 0>=K && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 6 75: f27 -> f27 : E'=1, Q'=1+Q, K'=1+J, L'=2, M'=2+H-Q, N'=1+F, O'=G, Q_1'=1+Q_1, R'=B*free_58+B*free_60, S'=-B*free_61+B*free_55, T'=C*free_57-free_54*C, U'=-free_59*C-free_56*C, V'=3-free_62+P, W'=2+W, [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 6+2*J-2*K 76: f27 -> f27 : E'=1, Q'=1+Q, K'=1+J, L'=2, M'=2+H-Q, N'=1+F, O'=G, Q_1'=1+Q_1, R'=B*free_58+B*free_60, S'=-B*free_61+B*free_55, T'=C*free_57-free_54*C, U'=-free_59*C-free_56*C, V'=3-free_62+P, W'=2+W, [ Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 6+2*J-2*K 77: f27 -> f27 : E'=1, Q'=2, K'=1+J, L'=2, M'=1, N'=1+F, O'=G, Q_1'=1+Q_1, R'=B*free_58+B*free_60, S'=-B*free_61+B*free_55, T'=C*free_57-free_54*C, U'=-free_59*C-free_56*C, V'=3-free_62+P, W'=2+W, [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 6+2*J-2*K 78: f27 -> [14] : [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && 1-J==0 && K==1 && Q_1==1 ], cost: 5-K 79: f27 -> [14] : [ Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && 1-J==0 && K==1 && Q_1==1 ], cost: 5-K 81: f27 -> [14] : [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 ], cost: 5+2*J-2*K 82: f27 -> [14] : [ Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 ], cost: 5+2*J-2*K 83: f27 -> [14] : [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 ], cost: 5+2*J-2*K Accelerating simple loops of location 3. Accelerating the following rules: 69: f27 -> f27 : E'=1, Q'=1+Q, M'=2+H-Q, N'=1+F, O'=G, Q_1'=1+Q_1, W'=2+W, [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && K>=1+J && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 4 72: f27 -> f27 : E'=1, Q'=1+Q, K'=1+K, L'=2+J-K, M'=2+H-Q, N'=1+F, O'=G, Q_1'=1+Q_1, R'=B*free_49+B*free_51, S'=B*free_46-B*free_52, T'=-free_45*C+free_48*C, U'=-C*free_50-C*free_47, V'=3-free_53+P, W'=2+W, [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && -J+K==0 && Q_1>=2*free_53 && 3*free_53>=1+Q_1 && 0>=K && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 6 75: f27 -> f27 : E'=1, Q'=1+Q, K'=1+J, L'=2, M'=2+H-Q, N'=1+F, O'=G, Q_1'=1+Q_1, R'=B*free_58+B*free_60, S'=-B*free_61+B*free_55, T'=C*free_57-free_54*C, U'=-free_59*C-free_56*C, V'=3-free_62+P, W'=2+W, [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 6+2*J-2*K 76: f27 -> f27 : E'=1, Q'=1+Q, K'=1+J, L'=2, M'=2+H-Q, N'=1+F, O'=G, Q_1'=1+Q_1, R'=B*free_58+B*free_60, S'=-B*free_61+B*free_55, T'=C*free_57-free_54*C, U'=-free_59*C-free_56*C, V'=3-free_62+P, W'=2+W, [ Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 6+2*J-2*K 77: f27 -> f27 : E'=1, Q'=2, K'=1+J, L'=2, M'=1, N'=1+F, O'=G, Q_1'=1+Q_1, R'=B*free_58+B*free_60, S'=-B*free_61+B*free_55, T'=C*free_57-free_54*C, U'=-free_59*C-free_56*C, V'=3-free_62+P, W'=2+W, [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 6+2*J-2*K Found no metering function for rule 69. Accelerated rule 72 with metering function J-K, yielding the new rule 84. Found no metering function for rule 75. Found no metering function for rule 76. Accelerated rule 77 with metering function 1-Q, yielding the new rule 85. Removing the simple loops: 72 77. Accelerated all simple loops using metering functions (where possible): Start location: f2 3: f2 -> f27 : B'=free_9, C'=free_10, D'=free_7, E'=free_11, F'=free_8, G'=free_6, [ 0>=A ], cost: 1 4: f2 -> f27 : B'=free_15, C'=free_16, D'=free_13, E'=free_17, F'=free_14, G'=free_12, [ A>=2 ], cost: 1 43: f2 -> f27 : A'=1, B'=free_3, C'=free_4, D'=free_1, E'=free_5, F'=free_2, G'=free, [ A==1 && Q>=1+H ], cost: 2 44: f2 -> f27 : A'=1, B'=free_3, C'=free_4, D'=free_1, E'=free_5, F'=free_2, G'=free, Q'=1+Q, K'=1+J, L'=2+2*J-2*K+L, [ A==1 && H>=Q && J>=K && 1+Q>=1+H ], cost: 5+J-K 45: f2 -> f27 : A'=1, B'=free_3, C'=free_4, D'=free_1, E'=free_5, F'=free_2, G'=free, Q'=1+H, [ A==1 && H>=Q && K>=1+J ], cost: 4+2*H-2*Q 64: f27 -> [12] : M'=2+H-Q, N'=1, O'=0, [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=4*free_32+K && 5*free_32+K>=1+J && K>=2 && Q_1==1 ], cost: 3+J-4*free_32-K 66: f27 -> [12] : M'=2+H-Q, N'=1, O'=0, [ Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=4*free_32+K && 5*free_32+K>=1+J && K>=2 && Q_1==1 ], cost: 3+J-4*free_32-K 68: f27 -> [12] : Q'=1, M'=1, N'=1, O'=0, [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=4*free_32+K && 5*free_32+K>=1+J && K>=2 && Q_1==1 ], cost: 3+J-4*free_32-K 69: f27 -> f27 : E'=1, Q'=1+Q, M'=2+H-Q, N'=1+F, O'=G, Q_1'=1+Q_1, W'=2+W, [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && K>=1+J && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 4 75: f27 -> f27 : E'=1, Q'=1+Q, K'=1+J, L'=2, M'=2+H-Q, N'=1+F, O'=G, Q_1'=1+Q_1, R'=B*free_58+B*free_60, S'=-B*free_61+B*free_55, T'=C*free_57-free_54*C, U'=-free_59*C-free_56*C, V'=3-free_62+P, W'=2+W, [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 6+2*J-2*K 76: f27 -> f27 : E'=1, Q'=1+Q, K'=1+J, L'=2, M'=2+H-Q, N'=1+F, O'=G, Q_1'=1+Q_1, R'=B*free_58+B*free_60, S'=-B*free_61+B*free_55, T'=C*free_57-free_54*C, U'=-free_59*C-free_56*C, V'=3-free_62+P, W'=2+W, [ Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 6+2*J-2*K 78: f27 -> [14] : [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && 1-J==0 && K==1 && Q_1==1 ], cost: 5-K 79: f27 -> [14] : [ Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && 1-J==0 && K==1 && Q_1==1 ], cost: 5-K 81: f27 -> [14] : [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 ], cost: 5+2*J-2*K 82: f27 -> [14] : [ Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 ], cost: 5+2*J-2*K 83: f27 -> [14] : [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 ], cost: 5+2*J-2*K 84: f27 -> f27 : E'=1, Q'=J-K+Q, K'=J, L'=3, M'=3-J+K+H-Q, N'=1+F, O'=G, Q_1'=J+Q_1-K, R'=B*free_49+B*free_51, S'=B*free_46-B*free_52, T'=-free_45*C+free_48*C, U'=-C*free_50-C*free_47, V'=3-free_53+P, W'=2*J+W-2*K, [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && -J+K==0 && Q_1>=2*free_53 && 3*free_53>=1+Q_1 && 0>=K && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 && J-K>=1 ], cost: 6*J-6*K 85: f27 -> f27 : E'=1, Q'=2, K'=1+J, L'=2, M'=1, N'=1+F, O'=G, Q_1'=1+Q_1-Q, R'=B*free_58+B*free_60, S'=-B*free_61+B*free_55, T'=C*free_57-free_54*C, U'=-free_59*C-free_56*C, V'=3-free_62+P, W'=2+W-2*Q, [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 && 1-Q>=1 ], cost: 4-4*Q Chained accelerated rules (with incoming rules): Start location: f2 3: f2 -> f27 : B'=free_9, C'=free_10, D'=free_7, E'=free_11, F'=free_8, G'=free_6, [ 0>=A ], cost: 1 4: f2 -> f27 : B'=free_15, C'=free_16, D'=free_13, E'=free_17, F'=free_14, G'=free_12, [ A>=2 ], cost: 1 43: f2 -> f27 : A'=1, B'=free_3, C'=free_4, D'=free_1, E'=free_5, F'=free_2, G'=free, [ A==1 && Q>=1+H ], cost: 2 44: f2 -> f27 : A'=1, B'=free_3, C'=free_4, D'=free_1, E'=free_5, F'=free_2, G'=free, Q'=1+Q, K'=1+J, L'=2+2*J-2*K+L, [ A==1 && H>=Q && J>=K && 1+Q>=1+H ], cost: 5+J-K 45: f2 -> f27 : A'=1, B'=free_3, C'=free_4, D'=free_1, E'=free_5, F'=free_2, G'=free, Q'=1+H, [ A==1 && H>=Q && K>=1+J ], cost: 4+2*H-2*Q 86: f2 -> f27 : B'=free_9, C'=free_10, D'=free_7, E'=1, F'=free_8, G'=free_6, Q'=1+Q, M'=2+H-Q, N'=1+free_8, O'=free_6, Q_1'=1+Q_1, W'=2+W, [ 0>=A && 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && K>=1+J && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 5 87: f2 -> f27 : B'=free_15, C'=free_16, D'=free_13, E'=1, F'=free_14, G'=free_12, Q'=1+Q, M'=2+H-Q, N'=1+free_14, O'=free_12, Q_1'=1+Q_1, W'=2+W, [ A>=2 && 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && K>=1+J && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 5 88: f2 -> f27 : B'=free_9, C'=free_10, D'=free_7, E'=1, F'=free_8, G'=free_6, Q'=1+Q, K'=1+J, L'=2, M'=2+H-Q, N'=1+free_8, O'=free_6, Q_1'=1+Q_1, R'=free_9*free_60+free_9*free_58, S'=free_9*free_55-free_9*free_61, T'=free_10*free_57-free_54*free_10, U'=-free_10*free_59-free_10*free_56, V'=3-free_62+P, W'=2+W, [ 0>=A && 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 7+2*J-2*K 89: f2 -> f27 : B'=free_15, C'=free_16, D'=free_13, E'=1, F'=free_14, G'=free_12, Q'=1+Q, K'=1+J, L'=2, M'=2+H-Q, N'=1+free_14, O'=free_12, Q_1'=1+Q_1, R'=free_15*free_60+free_15*free_58, S'=-free_15*free_61+free_15*free_55, T'=-free_54*free_16+free_16*free_57, U'=-free_16*free_59-free_16*free_56, V'=3-free_62+P, W'=2+W, [ A>=2 && 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 7+2*J-2*K 90: f2 -> f27 : B'=free_9, C'=free_10, D'=free_7, E'=1, F'=free_8, G'=free_6, Q'=1+Q, K'=1+J, L'=2, M'=2+H-Q, N'=1+free_8, O'=free_6, Q_1'=1+Q_1, R'=free_9*free_60+free_9*free_58, S'=free_9*free_55-free_9*free_61, T'=free_10*free_57-free_54*free_10, U'=-free_10*free_59-free_10*free_56, V'=3-free_62+P, W'=2+W, [ 0>=A && Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 7+2*J-2*K 91: f2 -> f27 : B'=free_15, C'=free_16, D'=free_13, E'=1, F'=free_14, G'=free_12, Q'=1+Q, K'=1+J, L'=2, M'=2+H-Q, N'=1+free_14, O'=free_12, Q_1'=1+Q_1, R'=free_15*free_60+free_15*free_58, S'=-free_15*free_61+free_15*free_55, T'=-free_54*free_16+free_16*free_57, U'=-free_16*free_59-free_16*free_56, V'=3-free_62+P, W'=2+W, [ A>=2 && Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 7+2*J-2*K 64: f27 -> [12] : M'=2+H-Q, N'=1, O'=0, [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=4*free_32+K && 5*free_32+K>=1+J && K>=2 && Q_1==1 ], cost: 3+J-4*free_32-K 66: f27 -> [12] : M'=2+H-Q, N'=1, O'=0, [ Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=4*free_32+K && 5*free_32+K>=1+J && K>=2 && Q_1==1 ], cost: 3+J-4*free_32-K 68: f27 -> [12] : Q'=1, M'=1, N'=1, O'=0, [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=4*free_32+K && 5*free_32+K>=1+J && K>=2 && Q_1==1 ], cost: 3+J-4*free_32-K 78: f27 -> [14] : [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && 1-J==0 && K==1 && Q_1==1 ], cost: 5-K 79: f27 -> [14] : [ Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && 1-J==0 && K==1 && Q_1==1 ], cost: 5-K 81: f27 -> [14] : [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 ], cost: 5+2*J-2*K 82: f27 -> [14] : [ Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 ], cost: 5+2*J-2*K 83: f27 -> [14] : [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 ], cost: 5+2*J-2*K Eliminated locations (on tree-shaped paths): Start location: f2 92: f2 -> [12] : B'=free_9, C'=free_10, D'=free_7, E'=free_11, F'=free_8, G'=free_6, M'=2+H-Q, N'=1, O'=0, [ 0>=A && 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=4*free_32+K && 5*free_32+K>=1+J && K>=2 && Q_1==1 ], cost: 4+J-4*free_32-K 93: f2 -> [12] : B'=free_9, C'=free_10, D'=free_7, E'=free_11, F'=free_8, G'=free_6, M'=2+H-Q, N'=1, O'=0, [ 0>=A && Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=4*free_32+K && 5*free_32+K>=1+J && K>=2 && Q_1==1 ], cost: 4+J-4*free_32-K 94: f2 -> [12] : B'=free_9, C'=free_10, D'=free_7, E'=free_11, F'=free_8, G'=free_6, Q'=1, M'=1, N'=1, O'=0, [ 0>=A && H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=4*free_32+K && 5*free_32+K>=1+J && K>=2 && Q_1==1 ], cost: 4+J-4*free_32-K 95: f2 -> [14] : B'=free_9, C'=free_10, D'=free_7, E'=free_11, F'=free_8, G'=free_6, [ 0>=A && 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && 1-J==0 && K==1 && Q_1==1 ], cost: 6-K 96: f2 -> [14] : B'=free_9, C'=free_10, D'=free_7, E'=free_11, F'=free_8, G'=free_6, [ 0>=A && Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && 1-J==0 && K==1 && Q_1==1 ], cost: 6-K 97: f2 -> [14] : B'=free_9, C'=free_10, D'=free_7, E'=free_11, F'=free_8, G'=free_6, [ 0>=A && 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 ], cost: 6+2*J-2*K 98: f2 -> [14] : B'=free_9, C'=free_10, D'=free_7, E'=free_11, F'=free_8, G'=free_6, [ 0>=A && Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 ], cost: 6+2*J-2*K 99: f2 -> [14] : B'=free_9, C'=free_10, D'=free_7, E'=free_11, F'=free_8, G'=free_6, [ 0>=A && H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 ], cost: 6+2*J-2*K 100: f2 -> [12] : B'=free_15, C'=free_16, D'=free_13, E'=free_17, F'=free_14, G'=free_12, M'=2+H-Q, N'=1, O'=0, [ A>=2 && 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=4*free_32+K && 5*free_32+K>=1+J && K>=2 && Q_1==1 ], cost: 4+J-4*free_32-K 101: f2 -> [12] : B'=free_15, C'=free_16, D'=free_13, E'=free_17, F'=free_14, G'=free_12, M'=2+H-Q, N'=1, O'=0, [ A>=2 && Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=4*free_32+K && 5*free_32+K>=1+J && K>=2 && Q_1==1 ], cost: 4+J-4*free_32-K 102: f2 -> [12] : B'=free_15, C'=free_16, D'=free_13, E'=free_17, F'=free_14, G'=free_12, Q'=1, M'=1, N'=1, O'=0, [ A>=2 && H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=4*free_32+K && 5*free_32+K>=1+J && K>=2 && Q_1==1 ], cost: 4+J-4*free_32-K 103: f2 -> [14] : B'=free_15, C'=free_16, D'=free_13, E'=free_17, F'=free_14, G'=free_12, [ A>=2 && 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && 1-J==0 && K==1 && Q_1==1 ], cost: 6-K 104: f2 -> [14] : B'=free_15, C'=free_16, D'=free_13, E'=free_17, F'=free_14, G'=free_12, [ A>=2 && Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && 1-J==0 && K==1 && Q_1==1 ], cost: 6-K 105: f2 -> [14] : B'=free_15, C'=free_16, D'=free_13, E'=free_17, F'=free_14, G'=free_12, [ A>=2 && 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 ], cost: 6+2*J-2*K 106: f2 -> [14] : B'=free_15, C'=free_16, D'=free_13, E'=free_17, F'=free_14, G'=free_12, [ A>=2 && Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 ], cost: 6+2*J-2*K 107: f2 -> [14] : B'=free_15, C'=free_16, D'=free_13, E'=free_17, F'=free_14, G'=free_12, [ A>=2 && H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 ], cost: 6+2*J-2*K 108: f2 -> [16] : [ A==1 && H>=Q && J>=K && 1+Q>=1+H ], cost: 5+J-K 109: f2 -> [16] : [ A==1 && H>=Q && K>=1+J ], cost: 4+2*H-2*Q 110: f2 -> [16] : [ 0>=A && 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 7+2*J-2*K 111: f2 -> [16] : [ A>=2 && 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 7+2*J-2*K 112: f2 -> [16] : [ 0>=A && Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 7+2*J-2*K 113: f2 -> [16] : [ A>=2 && Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 7+2*J-2*K Applied pruning (of leafs and parallel rules): Start location: f2 92: f2 -> [12] : B'=free_9, C'=free_10, D'=free_7, E'=free_11, F'=free_8, G'=free_6, M'=2+H-Q, N'=1, O'=0, [ 0>=A && 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=4*free_32+K && 5*free_32+K>=1+J && K>=2 && Q_1==1 ], cost: 4+J-4*free_32-K 93: f2 -> [12] : B'=free_9, C'=free_10, D'=free_7, E'=free_11, F'=free_8, G'=free_6, M'=2+H-Q, N'=1, O'=0, [ 0>=A && Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=4*free_32+K && 5*free_32+K>=1+J && K>=2 && Q_1==1 ], cost: 4+J-4*free_32-K 94: f2 -> [12] : B'=free_9, C'=free_10, D'=free_7, E'=free_11, F'=free_8, G'=free_6, Q'=1, M'=1, N'=1, O'=0, [ 0>=A && H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=4*free_32+K && 5*free_32+K>=1+J && K>=2 && Q_1==1 ], cost: 4+J-4*free_32-K 97: f2 -> [14] : B'=free_9, C'=free_10, D'=free_7, E'=free_11, F'=free_8, G'=free_6, [ 0>=A && 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 ], cost: 6+2*J-2*K 98: f2 -> [14] : B'=free_9, C'=free_10, D'=free_7, E'=free_11, F'=free_8, G'=free_6, [ 0>=A && Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 ], cost: 6+2*J-2*K 99: f2 -> [14] : B'=free_9, C'=free_10, D'=free_7, E'=free_11, F'=free_8, G'=free_6, [ 0>=A && H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 ], cost: 6+2*J-2*K 100: f2 -> [12] : B'=free_15, C'=free_16, D'=free_13, E'=free_17, F'=free_14, G'=free_12, M'=2+H-Q, N'=1, O'=0, [ A>=2 && 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=4*free_32+K && 5*free_32+K>=1+J && K>=2 && Q_1==1 ], cost: 4+J-4*free_32-K 102: f2 -> [12] : B'=free_15, C'=free_16, D'=free_13, E'=free_17, F'=free_14, G'=free_12, Q'=1, M'=1, N'=1, O'=0, [ A>=2 && H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=4*free_32+K && 5*free_32+K>=1+J && K>=2 && Q_1==1 ], cost: 4+J-4*free_32-K 105: f2 -> [14] : B'=free_15, C'=free_16, D'=free_13, E'=free_17, F'=free_14, G'=free_12, [ A>=2 && 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 ], cost: 6+2*J-2*K 107: f2 -> [14] : B'=free_15, C'=free_16, D'=free_13, E'=free_17, F'=free_14, G'=free_12, [ A>=2 && H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 ], cost: 6+2*J-2*K 108: f2 -> [16] : [ A==1 && H>=Q && J>=K && 1+Q>=1+H ], cost: 5+J-K 110: f2 -> [16] : [ 0>=A && 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 7+2*J-2*K 111: f2 -> [16] : [ A>=2 && 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 7+2*J-2*K 112: f2 -> [16] : [ 0>=A && Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 7+2*J-2*K 113: f2 -> [16] : [ A>=2 && Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 7+2*J-2*K ### Computing asymptotic complexity ### Fully simplified ITS problem Start location: f2 92: f2 -> [12] : B'=free_9, C'=free_10, D'=free_7, E'=free_11, F'=free_8, G'=free_6, M'=2+H-Q, N'=1, O'=0, [ 0>=A && 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=4*free_32+K && 5*free_32+K>=1+J && K>=2 && Q_1==1 ], cost: 4+J-4*free_32-K 93: f2 -> [12] : B'=free_9, C'=free_10, D'=free_7, E'=free_11, F'=free_8, G'=free_6, M'=2+H-Q, N'=1, O'=0, [ 0>=A && Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=4*free_32+K && 5*free_32+K>=1+J && K>=2 && Q_1==1 ], cost: 4+J-4*free_32-K 94: f2 -> [12] : B'=free_9, C'=free_10, D'=free_7, E'=free_11, F'=free_8, G'=free_6, Q'=1, M'=1, N'=1, O'=0, [ 0>=A && H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=4*free_32+K && 5*free_32+K>=1+J && K>=2 && Q_1==1 ], cost: 4+J-4*free_32-K 97: f2 -> [14] : B'=free_9, C'=free_10, D'=free_7, E'=free_11, F'=free_8, G'=free_6, [ 0>=A && 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 ], cost: 6+2*J-2*K 98: f2 -> [14] : B'=free_9, C'=free_10, D'=free_7, E'=free_11, F'=free_8, G'=free_6, [ 0>=A && Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 ], cost: 6+2*J-2*K 99: f2 -> [14] : B'=free_9, C'=free_10, D'=free_7, E'=free_11, F'=free_8, G'=free_6, [ 0>=A && H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 ], cost: 6+2*J-2*K 100: f2 -> [12] : B'=free_15, C'=free_16, D'=free_13, E'=free_17, F'=free_14, G'=free_12, M'=2+H-Q, N'=1, O'=0, [ A>=2 && 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=4*free_32+K && 5*free_32+K>=1+J && K>=2 && Q_1==1 ], cost: 4+J-4*free_32-K 102: f2 -> [12] : B'=free_15, C'=free_16, D'=free_13, E'=free_17, F'=free_14, G'=free_12, Q'=1, M'=1, N'=1, O'=0, [ A>=2 && H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=4*free_32+K && 5*free_32+K>=1+J && K>=2 && Q_1==1 ], cost: 4+J-4*free_32-K 105: f2 -> [14] : B'=free_15, C'=free_16, D'=free_13, E'=free_17, F'=free_14, G'=free_12, [ A>=2 && 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 ], cost: 6+2*J-2*K 107: f2 -> [14] : B'=free_15, C'=free_16, D'=free_13, E'=free_17, F'=free_14, G'=free_12, [ A>=2 && H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 ], cost: 6+2*J-2*K 108: f2 -> [16] : [ A==1 && H>=Q && J>=K && 1+Q>=1+H ], cost: 5+J-K 110: f2 -> [16] : [ 0>=A && 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 7+2*J-2*K 111: f2 -> [16] : [ A>=2 && 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 7+2*J-2*K 112: f2 -> [16] : [ 0>=A && Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 7+2*J-2*K 113: f2 -> [16] : [ A>=2 && Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_62 && 3*free_62>=1+Q_1 && K>=2 && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 7+2*J-2*K Computing asymptotic complexity for rule 92 Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,Q_1==1,K==2,A==-n,H==0,Q==0,free_18==1,P==2} resulting limit problem: [solved] Solution: J / 5*n free_32 / n Q_1 / 1 K / 2 A / -n H / 0 Q / 0 free_18 / 1 P / 2 Resulting cost 2+n has complexity: Poly(n^1) Found new complexity Poly(n^1). Computing asymptotic complexity for rule 93 Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 4+J-4*free_32-K (+), -1+K (+/+!), 1-A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,K==2,A==-n,H==2,Q==2,free_18==1,P==2} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {A==0} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {Q==2} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -1+H (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {H==Q} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {P==2*free_18} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {K==2} resulting limit problem: 1 (+/+!), 2+J-4*free_32 (+), -1+Q (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+J-4*free_32 (+), -1+Q (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,Q==n,free_18==1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {Q==2} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -1+H (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {H==Q} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {P==2*free_18} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {K==2} resulting limit problem: 1 (+/+!), 2+J-4*free_32 (+), 1-A (+/+!), -1+Q (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+J-4*free_32 (+), 1-A (+/+!), -1+Q (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,A==-n,Q==n,free_18==1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {A==0} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {H==Q} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {P==2*free_18} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {K==2} resulting limit problem: 1 (+/+!), 2+J-4*free_32 (+), -1+Q (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+J-4*free_32 (+), -1+Q (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,Q==n,free_18==1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {H==Q} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {P==2*free_18} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {K==2} resulting limit problem: 1 (+/+!), 2+J-4*free_32 (+), 1-A (+/+!), -1+Q (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+J-4*free_32 (+), 1-A (+/+!), -1+Q (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,A==-n,Q==n,free_18==1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {A==0} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {Q==2} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -1+H (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {P==2*free_18} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1+J-4*free_32-K (+/+!), -1+H (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {K==2} resulting limit problem: 1 (+/+!), 2+J-4*free_32 (+), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), -1+H (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+J-4*free_32 (+), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), -1+H (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,H==n,free_18==1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {Q==2} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -1+H (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {P==2*free_18} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 1+J-4*free_32-K (+/+!), -1+H (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {K==2} resulting limit problem: 1 (+/+!), 2+J-4*free_32 (+), 1-A (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), -1+H (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+J-4*free_32 (+), 1-A (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), -1+H (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,A==-n,H==n,free_18==1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {A==0} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {P==2*free_18} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1+H-Q (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {K==2} resulting limit problem: 1 (+/+!), 2+J-4*free_32 (+), 1+H-Q (+/+!), -1+Q (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+J-4*free_32 (+), 1+H-Q (+/+!), -1+Q (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,H==n,Q==2,free_18==1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {P==2*free_18} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 1+H-Q (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {K==2} resulting limit problem: 1 (+/+!), 2+J-4*free_32 (+), 1-A (+/+!), 1+H-Q (+/+!), -1+Q (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+J-4*free_32 (+), 1-A (+/+!), 1+H-Q (+/+!), -1+Q (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,A==-n,H==2,Q==2,free_18==1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {A==0} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {Q==2} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -1+H (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {H==Q} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {K==2} resulting limit problem: 1 (+/+!), 2+J-4*free_32 (+), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+J-4*free_32 (+), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,Q==n,free_18==1,P==2} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {Q==2} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -1+H (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {H==Q} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {K==2} resulting limit problem: 1 (+/+!), 2+J-4*free_32 (+), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+J-4*free_32 (+), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,A==-n,Q==n,free_18==1,P==2} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {A==0} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {H==Q} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {K==2} resulting limit problem: 1 (+/+!), 2+J-4*free_32 (+), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+J-4*free_32 (+), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,Q==n,free_18==1,P==2} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {H==Q} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {K==2} resulting limit problem: 1 (+/+!), 2+J-4*free_32 (+), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+J-4*free_32 (+), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,A==-n,Q==n,free_18==1,P==2} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {A==0} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {Q==2} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -1+H (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {K==2} resulting limit problem: 1 (+/+!), 2+J-4*free_32 (+), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), -1+H (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+J-4*free_32 (+), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), -1+H (+/+!), 1+free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,H==n,free_18==1,P==2} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {Q==2} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -1+H (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {K==2} resulting limit problem: 1 (+/+!), 2+J-4*free_32 (+), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), -1+H (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+J-4*free_32 (+), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), -1+H (+/+!), 1+free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,A==-n,H==n,free_18==1,P==2} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {A==0} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {K==2} resulting limit problem: 1 (+/+!), 2+J-4*free_32 (+), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+J-4*free_32 (+), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,H==2,Q==2,free_18==1,P==2} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {K==2} resulting limit problem: 1 (+/+!), 2+J-4*free_32 (+), 1-A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+J-4*free_32 (+), 1-A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,A==-n,H==2,Q==2,free_18==1,P==2} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {A==0} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {Q==2} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -1+H (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {H==Q} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {P==2*free_18} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 4+J-4*free_32-K (+), -1+K (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,K==2,Q==n,free_18==1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {Q==2} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -1+H (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {H==Q} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {P==2*free_18} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 4+J-4*free_32-K (+), -1+K (+/+!), 1-A (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,K==2,A==-n,Q==n,free_18==1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {A==0} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {H==Q} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {P==2*free_18} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 4+J-4*free_32-K (+), -1+K (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,K==2,Q==n,free_18==1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {H==Q} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {P==2*free_18} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 4+J-4*free_32-K (+), -1+K (+/+!), 1-A (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,K==2,A==-n,Q==n,free_18==1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {A==0} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {Q==2} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -1+H (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {P==2*free_18} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1+J-4*free_32-K (+/+!), -1+H (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 4+J-4*free_32-K (+), -1+K (+/+!), 1+J-4*free_32-K (+/+!), -1+H (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,K==2,H==n,free_18==1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {Q==2} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -1+H (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {P==2*free_18} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 1+J-4*free_32-K (+/+!), -1+H (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 4+J-4*free_32-K (+), -1+K (+/+!), 1-A (+/+!), 1+J-4*free_32-K (+/+!), -1+H (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,K==2,A==-n,H==n,free_18==1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {A==0} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {P==2*free_18} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1+H-Q (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 4+J-4*free_32-K (+), -1+K (+/+!), 1+H-Q (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==6*n,free_32==n,K==2+n,H==2,Q==2,free_18==1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {P==2*free_18} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 1+H-Q (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 4+J-4*free_32-K (+), -1+K (+/+!), 1-A (+/+!), 1+H-Q (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,K==2,A==-n,H==2,Q==2,free_18==1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {A==0} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {Q==2} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -1+H (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {H==Q} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 4+J-4*free_32-K (+), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,K==2,Q==n,free_18==1,P==2} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {Q==2} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -1+H (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {H==Q} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 4+J-4*free_32-K (+), -1+K (+/+!), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,K==2,A==-n,Q==n,free_18==1,P==2} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {A==0} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {H==Q} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 4+J-4*free_32-K (+), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,K==2,Q==n,free_18==1,P==2} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {H==Q} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 4+J-4*free_32-K (+), -1+K (+/+!), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,K==2,A==-n,Q==n,free_18==1,P==2} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {A==0} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {Q==2} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -1+H (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 4+J-4*free_32-K (+), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -1+H (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,K==2,H==n,free_18==1,P==2} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {Q==2} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -1+H (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 4+J-4*free_32-K (+), -1+K (+/+!), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -1+H (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,K==2,A==-n,H==n,free_18==1,P==2} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {A==0} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 4+J-4*free_32-K (+), -1+K (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), -1+Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,K==2,H==2+n,Q==2+n,free_18==1,P==2} resulting limit problem: [solved] Solution: J / 5*n free_32 / n Q_1 / 1 K / 2 A / -n H / 2 Q / 2 free_18 / 1 P / 2 Resulting cost 2+n has complexity: Poly(n^1) Computing asymptotic complexity for rule 94 Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 2-Q (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), Q (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q==1} resulting limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 4+J-4*free_32-K (+), -1+K (+/+!), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,K==2,A==-n,H==n,free_18==1,P==2} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 2-Q (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), Q (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q==1} resulting limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {A==0} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {H==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {P==2*free_18} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {K==2} resulting limit problem: 1 (+/+!), 2+J-4*free_32 (+), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+J-4*free_32 (+), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,free_18==n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 2-Q (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), Q (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q==1} resulting limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {H==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {P==2*free_18} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {K==2} resulting limit problem: 1 (+/+!), 2+J-4*free_32 (+), 1-A (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+J-4*free_32 (+), 1-A (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,A==-n,free_18==1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 2-Q (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), Q (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q==1} resulting limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {A==0} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {P==2*free_18} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {K==2} resulting limit problem: 1 (+/+!), 2+J-4*free_32 (+), 2-J+5*free_32 (+/+!), H (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+J-4*free_32 (+), 2-J+5*free_32 (+/+!), H (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,H==n,free_18==1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 2-Q (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), Q (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q==1} resulting limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {P==2*free_18} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {K==2} resulting limit problem: 1 (+/+!), 2+J-4*free_32 (+), 1-A (+/+!), 2-J+5*free_32 (+/+!), H (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+J-4*free_32 (+), 1-A (+/+!), 2-J+5*free_32 (+/+!), H (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,A==-n,H==n,free_18==1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 2-Q (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), Q (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q==1} resulting limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {A==0} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {H==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {K==2} resulting limit problem: 1 (+/+!), 2+J-4*free_32 (+), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+J-4*free_32 (+), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,free_18==n,P==2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 2-Q (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), Q (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q==1} resulting limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {H==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {K==2} resulting limit problem: 1 (+/+!), 2+J-4*free_32 (+), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+J-4*free_32 (+), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,A==-n,free_18==1,P==2} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 2-Q (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), Q (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q==1} resulting limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {A==0} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {K==2} resulting limit problem: 1 (+/+!), 2+J-4*free_32 (+), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 2-J+5*free_32 (+/+!), H (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+J-4*free_32 (+), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 2-J+5*free_32 (+/+!), H (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,H==n,free_18==1,P==2} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 2-Q (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), Q (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q==1} resulting limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {K==2} resulting limit problem: 1 (+/+!), 2+J-4*free_32 (+), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 2-J+5*free_32 (+/+!), H (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+J-4*free_32 (+), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 2-J+5*free_32 (+/+!), H (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,A==-n,H==n,free_18==1,P==2} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 2-Q (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), Q (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q==1} resulting limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {A==0} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {H==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {P==2*free_18} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 4+J-4*free_32-K (+), -1+K (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,K==2,free_18==n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 2-Q (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), Q (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q==1} resulting limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {H==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {P==2*free_18} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 4+J-4*free_32-K (+), -1+K (+/+!), 1-A (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,K==2,A==-n,free_18==1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 2-Q (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), Q (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q==1} resulting limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {A==0} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {P==2*free_18} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 4+J-4*free_32-K (+), -1+K (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,K==2,H==n,free_18==1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 2-Q (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), Q (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q==1} resulting limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {P==2*free_18} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 4+J-4*free_32-K (+), -1+K (+/+!), 1-A (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,K==2,A==-n,H==n,free_18==1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 2-Q (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), Q (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q==1} resulting limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {A==0} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {H==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 4+J-4*free_32-K (+), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,K==2,free_18==n,P==2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 2-Q (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), Q (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q==1} resulting limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {H==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 4+J-4*free_32-K (+), -1+K (+/+!), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,K==2,A==-n,free_18==1,P==2} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 2-Q (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), Q (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q==1} resulting limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), 1-A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {A==0} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 4+J-4*free_32-K (+), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,K==2,H==n,free_18==1,P==2} resulting limit problem: [solved] Solution: J / 5*n free_32 / n Q_1 / 1 K / 2 A / -n H / n Q / 1 free_18 / 1 P / 2 Resulting cost 2+n has complexity: Poly(n^1) Computing asymptotic complexity for rule 100 Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 4+J-4*free_32-K (+), -1+K (+/+!), -1+A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,K==2,A==n,H==0,Q==0,free_18==1,P==2} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {A==2} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {Q==0} resulting limit problem: 4+J-4*free_32-K (+), 1+H (+/+!), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {H==Q} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), 1+Q (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {P==2*free_18} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1+J-4*free_32-K (+/+!), 1+Q (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {K==2} resulting limit problem: 1 (+/+!), 2+J-4*free_32 (+), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+Q (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+J-4*free_32 (+), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+Q (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,Q==n,free_18==1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {Q==0} resulting limit problem: 4+J-4*free_32-K (+), 1+H (+/+!), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {H==Q} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), 1+Q (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {P==2*free_18} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 1+J-4*free_32-K (+/+!), 1+Q (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {K==2} resulting limit problem: 1 (+/+!), 2+J-4*free_32 (+), -1+A (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+Q (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+J-4*free_32 (+), -1+A (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+Q (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,A==n,Q==n,free_18==1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {A==2} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {H==Q} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {P==2*free_18} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {K==2} resulting limit problem: 1 (+/+!), 2+J-4*free_32 (+), 1-Q (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+J-4*free_32 (+), 1-Q (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,Q==-n,free_18==1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {H==Q} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {P==2*free_18} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {K==2} resulting limit problem: 1 (+/+!), 2+J-4*free_32 (+), -1+A (+/+!), 1-Q (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+J-4*free_32 (+), -1+A (+/+!), 1-Q (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,A==n,Q==-n,free_18==1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {A==2} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {Q==0} resulting limit problem: 4+J-4*free_32-K (+), 1+H (+/+!), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {P==2*free_18} resulting limit problem: 4+J-4*free_32-K (+), 1+H (+/+!), 1 (+/+!), -1+K (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {K==2} resulting limit problem: 1+H (+/+!), 1 (+/+!), 2+J-4*free_32 (+), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 1+H (+/+!), 2+J-4*free_32 (+), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,H==n,free_18==1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {Q==0} resulting limit problem: 4+J-4*free_32-K (+), 1+H (+/+!), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {P==2*free_18} resulting limit problem: 4+J-4*free_32-K (+), 1+H (+/+!), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {K==2} resulting limit problem: 1+H (+/+!), 1 (+/+!), 2+J-4*free_32 (+), -1+A (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 1+H (+/+!), 2+J-4*free_32 (+), -1+A (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,A==n,H==n,free_18==1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {A==2} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {P==2*free_18} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {K==2} resulting limit problem: 1 (+/+!), 2+J-4*free_32 (+), 1+H-Q (+/+!), 1-Q (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+J-4*free_32 (+), 1+H-Q (+/+!), 1-Q (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,H==n,Q==0,free_18==1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {P==2*free_18} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {K==2} resulting limit problem: 1 (+/+!), 2+J-4*free_32 (+), -1+A (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+J-4*free_32 (+), -1+A (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,A==n,H==0,Q==0,free_18==1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {A==2} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {Q==0} resulting limit problem: 4+J-4*free_32-K (+), 1+H (+/+!), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {H==Q} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), 1+Q (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {K==2} resulting limit problem: 1 (+/+!), 2+J-4*free_32 (+), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+Q (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+J-4*free_32 (+), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+Q (+/+!), 1+free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,Q==n,free_18==1,P==2} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {Q==0} resulting limit problem: 4+J-4*free_32-K (+), 1+H (+/+!), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {H==Q} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), 1+Q (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {K==2} resulting limit problem: 1 (+/+!), 2+J-4*free_32 (+), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+Q (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+J-4*free_32 (+), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+Q (+/+!), 1+free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,A==n,Q==n,free_18==1,P==2} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {A==2} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {H==Q} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {K==2} resulting limit problem: 1 (+/+!), 2+J-4*free_32 (+), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+J-4*free_32 (+), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,Q==-n,free_18==1,P==2} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {H==Q} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {K==2} resulting limit problem: 1 (+/+!), 2+J-4*free_32 (+), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+J-4*free_32 (+), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,A==n,Q==-n,free_18==1,P==2} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {A==2} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {Q==0} resulting limit problem: 4+J-4*free_32-K (+), 1+H (+/+!), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {K==2} resulting limit problem: 1+H (+/+!), 1 (+/+!), 2+J-4*free_32 (+), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 1+H (+/+!), 2+J-4*free_32 (+), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,H==n,free_18==1,P==2} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {Q==0} resulting limit problem: 4+J-4*free_32-K (+), 1+H (+/+!), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {K==2} resulting limit problem: 1+H (+/+!), 1 (+/+!), 2+J-4*free_32 (+), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 1+H (+/+!), 2+J-4*free_32 (+), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,A==n,H==n,free_18==1,P==2} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {A==2} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {K==2} resulting limit problem: 1 (+/+!), 2+J-4*free_32 (+), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+J-4*free_32 (+), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,H==0,Q==0,free_18==1,P==2} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {K==2} resulting limit problem: 1 (+/+!), 2+J-4*free_32 (+), -1+A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+J-4*free_32 (+), -1+A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,A==n,H==0,Q==0,free_18==1,P==2} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {A==2} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {Q==0} resulting limit problem: 4+J-4*free_32-K (+), 1+H (+/+!), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {H==Q} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), 1+Q (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {P==2*free_18} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1+J-4*free_32-K (+/+!), 1+Q (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 4+J-4*free_32-K (+), -1+K (+/+!), 1+J-4*free_32-K (+/+!), 1+Q (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,K==2,Q==n,free_18==1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {Q==0} resulting limit problem: 4+J-4*free_32-K (+), 1+H (+/+!), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {H==Q} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), 1+Q (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {P==2*free_18} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 1+J-4*free_32-K (+/+!), 1+Q (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 4+J-4*free_32-K (+), -1+K (+/+!), -1+A (+/+!), 1+J-4*free_32-K (+/+!), 1+Q (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,K==2,A==n,Q==n,free_18==1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {A==2} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {H==Q} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {P==2*free_18} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 4+J-4*free_32-K (+), -1+K (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,K==2,Q==-n,free_18==1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {H==Q} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {P==2*free_18} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 4+J-4*free_32-K (+), -1+K (+/+!), -1+A (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,K==2,A==n,Q==-n,free_18==1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {A==2} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {Q==0} resulting limit problem: 4+J-4*free_32-K (+), 1+H (+/+!), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {P==2*free_18} resulting limit problem: 4+J-4*free_32-K (+), 1+H (+/+!), 1 (+/+!), -1+K (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 4+J-4*free_32-K (+), 1+H (+/+!), -1+K (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,K==2,H==n,free_18==1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {Q==0} resulting limit problem: 4+J-4*free_32-K (+), 1+H (+/+!), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {P==2*free_18} resulting limit problem: 4+J-4*free_32-K (+), 1+H (+/+!), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 4+J-4*free_32-K (+), 1+H (+/+!), -1+K (+/+!), -1+A (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,K==2,A==n,H==n,free_18==1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {A==2} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {P==2*free_18} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 4+J-4*free_32-K (+), -1+K (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==6*n,free_32==n,K==2+n,H==0,Q==0,free_18==1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {P==2*free_18} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 4+J-4*free_32-K (+), -1+K (+/+!), -1+A (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,K==2,A==n,H==0,Q==0,free_18==1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {A==2} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {Q==0} resulting limit problem: 4+J-4*free_32-K (+), 1+H (+/+!), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {H==Q} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), 1+Q (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 4+J-4*free_32-K (+), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), 1+Q (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,K==2,Q==n,free_18==1,P==2} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {Q==0} resulting limit problem: 4+J-4*free_32-K (+), 1+H (+/+!), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {H==Q} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), 1+Q (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 4+J-4*free_32-K (+), -1+K (+/+!), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), 1+Q (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,K==2,A==n,Q==n,free_18==1,P==2} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {A==2} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {H==Q} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 4+J-4*free_32-K (+), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,K==2,Q==-n,free_18==1,P==2} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {H==Q} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 4+J-4*free_32-K (+), -1+K (+/+!), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,K==2,A==n,Q==-n,free_18==1,P==2} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {A==2} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {Q==0} resulting limit problem: 4+J-4*free_32-K (+), 1+H (+/+!), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 4+J-4*free_32-K (+), 1+H (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,K==2,H==n,free_18==1,P==2} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {Q==0} resulting limit problem: 4+J-4*free_32-K (+), 1+H (+/+!), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 4+J-4*free_32-K (+), 1+H (+/+!), -1+K (+/+!), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,K==2,A==n,H==n,free_18==1,P==2} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {A==2} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 4+J-4*free_32-K (+), -1+K (+/+!), 1+H-Q (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1-Q (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,K==2,H==-n,Q==-n,free_18==1,P==2} resulting limit problem: [solved] Solution: J / 5*n free_32 / n Q_1 / 1 K / 2 A / n H / 0 Q / 0 free_18 / 1 P / 2 Resulting cost 2+n has complexity: Poly(n^1) Computing asymptotic complexity for rule 102 Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 2-Q (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), Q (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q==1} resulting limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 4+J-4*free_32-K (+), -1+K (+/+!), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,K==2,A==n,H==n,free_18==1,P==2} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 2-Q (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), Q (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q==1} resulting limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {A==2} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {H==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {P==2*free_18} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {K==2} resulting limit problem: 1 (+/+!), 2+J-4*free_32 (+), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+J-4*free_32 (+), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,free_18==n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 2-Q (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), Q (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q==1} resulting limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {H==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {P==2*free_18} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {K==2} resulting limit problem: 1 (+/+!), 2+J-4*free_32 (+), -1+A (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+J-4*free_32 (+), -1+A (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,A==n,free_18==1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 2-Q (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), Q (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q==1} resulting limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {A==2} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {P==2*free_18} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {K==2} resulting limit problem: 1 (+/+!), 2+J-4*free_32 (+), 2-J+5*free_32 (+/+!), H (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+J-4*free_32 (+), 2-J+5*free_32 (+/+!), H (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,H==n,free_18==1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 2-Q (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), Q (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q==1} resulting limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {P==2*free_18} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {K==2} resulting limit problem: 1 (+/+!), 2+J-4*free_32 (+), -1+A (+/+!), 2-J+5*free_32 (+/+!), H (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+J-4*free_32 (+), -1+A (+/+!), 2-J+5*free_32 (+/+!), H (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,A==n,H==n,free_18==1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 2-Q (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), Q (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q==1} resulting limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {A==2} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {H==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {K==2} resulting limit problem: 1 (+/+!), 2+J-4*free_32 (+), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+J-4*free_32 (+), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,free_18==n,P==2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 2-Q (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), Q (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q==1} resulting limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {H==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {K==2} resulting limit problem: 1 (+/+!), 2+J-4*free_32 (+), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+J-4*free_32 (+), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 2-J+5*free_32 (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,A==n,free_18==1,P==2} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 2-Q (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), Q (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q==1} resulting limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {A==2} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {K==2} resulting limit problem: 1 (+/+!), 2+J-4*free_32 (+), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 2-J+5*free_32 (+/+!), H (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+J-4*free_32 (+), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 2-J+5*free_32 (+/+!), H (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,H==n,free_18==1,P==2} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 2-Q (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), Q (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q==1} resulting limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {K==2} resulting limit problem: 1 (+/+!), 2+J-4*free_32 (+), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 2-J+5*free_32 (+/+!), H (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 2+J-4*free_32 (+), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 2-J+5*free_32 (+/+!), H (+/+!), -1+J-4*free_32 (+/+!), 1+free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,A==n,H==n,free_18==1,P==2} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 2-Q (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), Q (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q==1} resulting limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {A==2} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {H==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {P==2*free_18} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 4+J-4*free_32-K (+), -1+K (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,K==2,free_18==n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 2-Q (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), Q (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q==1} resulting limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {H==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {P==2*free_18} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 4+J-4*free_32-K (+), -1+K (+/+!), -1+A (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,K==2,A==n,free_18==1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 2-Q (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), Q (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q==1} resulting limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {A==2} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {P==2*free_18} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 4+J-4*free_32-K (+), -1+K (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,K==2,H==n,free_18==1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 2-Q (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), Q (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q==1} resulting limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {P==2*free_18} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 4+J-4*free_32-K (+), -1+K (+/+!), -1+A (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!), free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,K==2,A==n,H==n,free_18==1} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 2-Q (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), Q (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q==1} resulting limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {A==2} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {H==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 4+J-4*free_32-K (+), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,K==2,free_18==n,P==2*n} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 2-Q (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), Q (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q==1} resulting limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {H==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 4+J-4*free_32-K (+), -1+K (+/+!), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,K==2,A==n,free_18==1,P==2} resulting limit problem: [solved] Solved the limit problem by the following transformations: Created initial limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 2-Q (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), Q (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q==1} resulting limit problem: 2-Q_1+free_18 (+/+!), 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 2-Q_1 (+/+!), -1+A (+/+!), Q_1 (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!) [not solved] applying transformation rule (C) using substitution {Q_1==1} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), -1+A (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (C) using substitution {A==2} resulting limit problem: 4+J-4*free_32-K (+), 1 (+/+!), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] applying transformation rule (B), deleting 1 (+/+!) resulting limit problem: 4+J-4*free_32-K (+), -1+K (+/+!), 3*free_18-P (+/+!), 1-2*free_18+P (+/+!), H (+/+!), 1+J-4*free_32-K (+/+!), -J+5*free_32+K (+/+!), 1+free_18 (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {J==5*n,free_32==n,K==2,H==n,free_18==1,P==2} resulting limit problem: [solved] Solution: J / 5*n free_32 / n Q_1 / 1 K / 2 A / n H / n Q / 1 free_18 / 1 P / 2 Resulting cost 2+n has complexity: Poly(n^1) Obtained the following overall complexity (w.r.t. the length of the input n): Complexity: Poly(n^1) Cpx degree: 1 Solved cost: 2+n Rule cost: 4+J-4*free_32-K Rule guard: [ 0>=A && 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=4*free_32+K && 5*free_32+K>=1+J && K>=2 && Q_1==1 ] WORST_CASE(Omega(n^1),?) ---------------------------------------- (4) BOUNDS(n^1, INF)