5.04/3.29 WORST_CASE(NON_POLY, ?) 5.04/3.30 proof of /export/starexec/sandbox/benchmark/theBenchmark.koat 5.04/3.30 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 5.04/3.30 5.04/3.30 5.04/3.30 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(INF, INF). 5.04/3.30 5.04/3.30 (0) CpxIntTrs 5.04/3.30 (1) Loat Proof [FINISHED, 617 ms] 5.04/3.30 (2) BOUNDS(INF, INF) 5.04/3.30 5.04/3.30 5.04/3.30 ---------------------------------------- 5.04/3.30 5.04/3.30 (0) 5.04/3.30 Obligation: 5.04/3.30 Complexity Int TRS consisting of the following rules: 5.04/3.30 f47(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T) -> Com_1(f47(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) :|: TRUE 5.04/3.30 f49(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T) -> Com_1(f52(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) :|: TRUE 5.04/3.30 f11(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T) -> Com_1(f47(A, B, 0, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) :|: A >= B 5.04/3.30 f35(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T) -> Com_1(f47(A, B, 0, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) :|: D >= 3 5.04/3.30 f35(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T) -> Com_1(f47(A, B, 0, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) :|: 1 >= D 5.04/3.30 f35(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T) -> Com_1(f47(A, B, 0, 2, F, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) :|: D >= 2 && D <= 2 5.04/3.30 f11(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T) -> Com_1(f47(A, B, 0, D, E, U, V, W, X, C, U, U, M, N, O, P, Q, R, S, T)) :|: U >= 1 && B >= A + 1 5.04/3.30 f11(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T) -> Com_1(f35(A, B, C, Y, E, U, V, W, X, C, U, U, U, O, 0, Y, Y, 0, S, T)) :|: B >= A + 1 && 0 >= U && Y >= 2 5.04/3.30 f11(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T) -> Com_1(f35(A, B, C, Y, E, U, V, W, X, C, U, U, U, O, 0, Y, Y, 0, S, T)) :|: B >= A + 1 && 0 >= U && 0 >= Y 5.04/3.30 f11(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T) -> Com_1(f11(A + 1, B, C, 1, E, U, V, W, X, C, U, U, U, O, O, 1, 1, 0, S, T)) :|: 0 >= U && B >= A + 1 5.04/3.30 f0(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T) -> Com_1(f11(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, 0, 0)) :|: TRUE 5.04/3.30 5.04/3.30 The start-symbols are:[f0_20] 5.04/3.30 5.04/3.30 5.04/3.30 ---------------------------------------- 5.04/3.30 5.04/3.30 (1) Loat Proof (FINISHED) 5.04/3.30 5.04/3.30 5.04/3.30 ### Pre-processing the ITS problem ### 5.04/3.30 5.04/3.30 5.04/3.30 5.04/3.30 Initial linear ITS problem 5.04/3.30 5.04/3.30 Start location: f0 5.04/3.30 5.04/3.30 0: f47 -> f47 : [], cost: 1 5.04/3.30 5.04/3.30 1: f49 -> f52 : [], cost: 1 5.04/3.30 5.04/3.30 2: f11 -> f47 : C'=0, [ A>=B ], cost: 1 5.04/3.30 5.04/3.30 6: f11 -> f47 : C'=0, F'=free_3, G'=free, H'=free_1, Q'=free_2, J'=C, K'=free_3, L'=free_3, [ free_3>=1 && B>=1+A ], cost: 1 5.04/3.30 5.04/3.30 7: f11 -> f35 : D'=free_8, F'=free_5, G'=free_6, H'=free_7, Q'=free_4, J'=C, K'=free_5, L'=free_5, M'=free_5, N'=O, O'=0, P'=free_8, Q_1'=free_8, R'=0, [ B>=1+A && 0>=free_5 && free_8>=2 ], cost: 1 5.04/3.30 5.04/3.30 8: f11 -> f35 : D'=free_13, F'=free_10, G'=free_11, H'=free_12, Q'=free_9, J'=C, K'=free_10, L'=free_10, M'=free_10, N'=O, O'=0, P'=free_13, Q_1'=free_13, R'=0, [ B>=1+A && 0>=free_10 && 0>=free_13 ], cost: 1 5.04/3.30 5.04/3.30 9: f11 -> f11 : A'=1+A, D'=1, F'=free_17, G'=free_14, H'=free_15, Q'=free_16, J'=C, K'=free_17, L'=free_17, M'=free_17, N'=O, P'=1, Q_1'=1, R'=0, [ 0>=free_17 && B>=1+A ], cost: 1 5.04/3.30 5.04/3.30 3: f35 -> f47 : C'=0, [ D>=3 ], cost: 1 5.04/3.30 5.04/3.30 4: f35 -> f47 : C'=0, [ 1>=D ], cost: 1 5.04/3.30 5.04/3.30 5: f35 -> f47 : C'=0, D'=2, E'=F, [ D==2 ], cost: 1 5.04/3.30 5.04/3.30 10: f0 -> f11 : S'=0, T'=0, [], cost: 1 5.04/3.30 5.04/3.30 5.04/3.30 5.04/3.30 Removed unreachable and leaf rules: 5.04/3.30 5.04/3.30 Start location: f0 5.04/3.30 5.04/3.30 0: f47 -> f47 : [], cost: 1 5.04/3.30 5.04/3.30 2: f11 -> f47 : C'=0, [ A>=B ], cost: 1 5.04/3.30 5.04/3.30 6: f11 -> f47 : C'=0, F'=free_3, G'=free, H'=free_1, Q'=free_2, J'=C, K'=free_3, L'=free_3, [ free_3>=1 && B>=1+A ], cost: 1 5.04/3.30 5.04/3.30 7: f11 -> f35 : D'=free_8, F'=free_5, G'=free_6, H'=free_7, Q'=free_4, J'=C, K'=free_5, L'=free_5, M'=free_5, N'=O, O'=0, P'=free_8, Q_1'=free_8, R'=0, [ B>=1+A && 0>=free_5 && free_8>=2 ], cost: 1 5.04/3.30 5.04/3.30 8: f11 -> f35 : D'=free_13, F'=free_10, G'=free_11, H'=free_12, Q'=free_9, J'=C, K'=free_10, L'=free_10, M'=free_10, N'=O, O'=0, P'=free_13, Q_1'=free_13, R'=0, [ B>=1+A && 0>=free_10 && 0>=free_13 ], cost: 1 5.04/3.30 5.04/3.30 9: f11 -> f11 : A'=1+A, D'=1, F'=free_17, G'=free_14, H'=free_15, Q'=free_16, J'=C, K'=free_17, L'=free_17, M'=free_17, N'=O, P'=1, Q_1'=1, R'=0, [ 0>=free_17 && B>=1+A ], cost: 1 5.04/3.30 5.04/3.30 3: f35 -> f47 : C'=0, [ D>=3 ], cost: 1 5.04/3.30 5.04/3.30 4: f35 -> f47 : C'=0, [ 1>=D ], cost: 1 5.04/3.30 5.04/3.30 5: f35 -> f47 : C'=0, D'=2, E'=F, [ D==2 ], cost: 1 5.04/3.30 5.04/3.30 10: f0 -> f11 : S'=0, T'=0, [], cost: 1 5.04/3.30 5.04/3.30 5.04/3.30 5.04/3.30 ### Simplification by acceleration and chaining ### 5.04/3.30 5.04/3.30 5.04/3.30 5.04/3.30 Accelerating simple loops of location 0. 5.04/3.30 5.04/3.30 Accelerating the following rules: 5.04/3.30 5.04/3.30 0: f47 -> f47 : [], cost: 1 5.04/3.30 5.04/3.30 5.04/3.30 5.04/3.30 Accelerated rule 0 with NONTERM, yielding the new rule 11. 5.04/3.30 5.04/3.30 Removing the simple loops: 0. 5.04/3.30 5.04/3.30 5.04/3.30 5.04/3.30 Accelerating simple loops of location 2. 5.04/3.30 5.04/3.30 Accelerating the following rules: 5.04/3.30 5.04/3.30 9: f11 -> f11 : A'=1+A, D'=1, F'=free_17, G'=free_14, H'=free_15, Q'=free_16, J'=C, K'=free_17, L'=free_17, M'=free_17, N'=O, P'=1, Q_1'=1, R'=0, [ 0>=free_17 && B>=1+A ], cost: 1 5.04/3.30 5.04/3.30 5.04/3.30 5.04/3.30 Accelerated rule 9 with metering function -A+B, yielding the new rule 12. 5.04/3.30 5.04/3.30 Removing the simple loops: 9. 5.04/3.30 5.04/3.30 5.04/3.30 5.04/3.30 Accelerated all simple loops using metering functions (where possible): 5.04/3.30 5.04/3.30 Start location: f0 5.04/3.30 5.04/3.30 11: f47 -> [6] : [], cost: INF 5.04/3.30 5.04/3.30 2: f11 -> f47 : C'=0, [ A>=B ], cost: 1 5.04/3.30 5.04/3.30 6: f11 -> f47 : C'=0, F'=free_3, G'=free, H'=free_1, Q'=free_2, J'=C, K'=free_3, L'=free_3, [ free_3>=1 && B>=1+A ], cost: 1 5.04/3.30 5.04/3.30 7: f11 -> f35 : D'=free_8, F'=free_5, G'=free_6, H'=free_7, Q'=free_4, J'=C, K'=free_5, L'=free_5, M'=free_5, N'=O, O'=0, P'=free_8, Q_1'=free_8, R'=0, [ B>=1+A && 0>=free_5 && free_8>=2 ], cost: 1 5.04/3.30 5.04/3.30 8: f11 -> f35 : D'=free_13, F'=free_10, G'=free_11, H'=free_12, Q'=free_9, J'=C, K'=free_10, L'=free_10, M'=free_10, N'=O, O'=0, P'=free_13, Q_1'=free_13, R'=0, [ B>=1+A && 0>=free_10 && 0>=free_13 ], cost: 1 5.04/3.30 5.04/3.30 12: f11 -> f11 : A'=B, D'=1, F'=free_17, G'=free_14, H'=free_15, Q'=free_16, J'=C, K'=free_17, L'=free_17, M'=free_17, N'=O, P'=1, Q_1'=1, R'=0, [ 0>=free_17 && B>=1+A ], cost: -A+B 5.04/3.30 5.04/3.30 3: f35 -> f47 : C'=0, [ D>=3 ], cost: 1 5.04/3.30 5.04/3.30 4: f35 -> f47 : C'=0, [ 1>=D ], cost: 1 5.04/3.30 5.04/3.30 5: f35 -> f47 : C'=0, D'=2, E'=F, [ D==2 ], cost: 1 5.04/3.30 5.04/3.30 10: f0 -> f11 : S'=0, T'=0, [], cost: 1 5.04/3.30 5.04/3.30 5.04/3.30 5.04/3.30 Chained accelerated rules (with incoming rules): 5.04/3.30 5.04/3.30 Start location: f0 5.04/3.30 5.04/3.30 2: f11 -> f47 : C'=0, [ A>=B ], cost: 1 5.04/3.30 5.04/3.30 6: f11 -> f47 : C'=0, F'=free_3, G'=free, H'=free_1, Q'=free_2, J'=C, K'=free_3, L'=free_3, [ free_3>=1 && B>=1+A ], cost: 1 5.04/3.30 5.04/3.30 7: f11 -> f35 : D'=free_8, F'=free_5, G'=free_6, H'=free_7, Q'=free_4, J'=C, K'=free_5, L'=free_5, M'=free_5, N'=O, O'=0, P'=free_8, Q_1'=free_8, R'=0, [ B>=1+A && 0>=free_5 && free_8>=2 ], cost: 1 5.04/3.30 5.04/3.30 8: f11 -> f35 : D'=free_13, F'=free_10, G'=free_11, H'=free_12, Q'=free_9, J'=C, K'=free_10, L'=free_10, M'=free_10, N'=O, O'=0, P'=free_13, Q_1'=free_13, R'=0, [ B>=1+A && 0>=free_10 && 0>=free_13 ], cost: 1 5.04/3.30 5.04/3.30 13: f11 -> [6] : C'=0, [ A>=B ], cost: INF 5.04/3.30 5.04/3.30 17: f11 -> [6] : C'=0, F'=free_3, G'=free, H'=free_1, Q'=free_2, J'=C, K'=free_3, L'=free_3, [ free_3>=1 && B>=1+A ], cost: INF 5.04/3.30 5.04/3.30 3: f35 -> f47 : C'=0, [ D>=3 ], cost: 1 5.04/3.30 5.04/3.30 4: f35 -> f47 : C'=0, [ 1>=D ], cost: 1 5.04/3.30 5.04/3.30 5: f35 -> f47 : C'=0, D'=2, E'=F, [ D==2 ], cost: 1 5.04/3.30 5.04/3.30 14: f35 -> [6] : C'=0, [ D>=3 ], cost: INF 5.04/3.30 5.04/3.30 15: f35 -> [6] : C'=0, [ 1>=D ], cost: INF 5.04/3.30 5.04/3.30 16: f35 -> [6] : C'=0, D'=2, E'=F, [ D==2 ], cost: INF 5.04/3.30 5.04/3.30 10: f0 -> f11 : S'=0, T'=0, [], cost: 1 5.04/3.30 5.04/3.30 18: f0 -> f11 : A'=B, D'=1, F'=free_17, G'=free_14, H'=free_15, Q'=free_16, J'=C, K'=free_17, L'=free_17, M'=free_17, N'=O, P'=1, Q_1'=1, R'=0, S'=0, T'=0, [ 0>=free_17 && B>=1+A ], cost: 1-A+B 5.04/3.30 5.04/3.30 5.04/3.30 5.04/3.30 Removed unreachable locations (and leaf rules with constant cost): 5.04/3.30 5.04/3.30 Start location: f0 5.04/3.30 5.04/3.30 7: f11 -> f35 : D'=free_8, F'=free_5, G'=free_6, H'=free_7, Q'=free_4, J'=C, K'=free_5, L'=free_5, M'=free_5, N'=O, O'=0, P'=free_8, Q_1'=free_8, R'=0, [ B>=1+A && 0>=free_5 && free_8>=2 ], cost: 1 5.04/3.30 5.04/3.30 8: f11 -> f35 : D'=free_13, F'=free_10, G'=free_11, H'=free_12, Q'=free_9, J'=C, K'=free_10, L'=free_10, M'=free_10, N'=O, O'=0, P'=free_13, Q_1'=free_13, R'=0, [ B>=1+A && 0>=free_10 && 0>=free_13 ], cost: 1 5.04/3.30 5.04/3.30 13: f11 -> [6] : C'=0, [ A>=B ], cost: INF 5.04/3.30 5.04/3.30 17: f11 -> [6] : C'=0, F'=free_3, G'=free, H'=free_1, Q'=free_2, J'=C, K'=free_3, L'=free_3, [ free_3>=1 && B>=1+A ], cost: INF 5.04/3.30 5.04/3.30 14: f35 -> [6] : C'=0, [ D>=3 ], cost: INF 5.04/3.30 5.04/3.30 15: f35 -> [6] : C'=0, [ 1>=D ], cost: INF 5.04/3.30 5.04/3.30 16: f35 -> [6] : C'=0, D'=2, E'=F, [ D==2 ], cost: INF 5.04/3.30 5.04/3.30 10: f0 -> f11 : S'=0, T'=0, [], cost: 1 5.04/3.30 5.04/3.30 18: f0 -> f11 : A'=B, D'=1, F'=free_17, G'=free_14, H'=free_15, Q'=free_16, J'=C, K'=free_17, L'=free_17, M'=free_17, N'=O, P'=1, Q_1'=1, R'=0, S'=0, T'=0, [ 0>=free_17 && B>=1+A ], cost: 1-A+B 5.04/3.30 5.04/3.30 5.04/3.30 5.04/3.30 Eliminated locations (on tree-shaped paths): 5.04/3.30 5.04/3.30 Start location: f0 5.04/3.30 5.04/3.30 14: f35 -> [6] : C'=0, [ D>=3 ], cost: INF 5.04/3.30 5.04/3.30 15: f35 -> [6] : C'=0, [ 1>=D ], cost: INF 5.04/3.30 5.04/3.30 16: f35 -> [6] : C'=0, D'=2, E'=F, [ D==2 ], cost: INF 5.04/3.30 5.04/3.30 19: f0 -> f35 : D'=free_8, F'=free_5, G'=free_6, H'=free_7, Q'=free_4, J'=C, K'=free_5, L'=free_5, M'=free_5, N'=O, O'=0, P'=free_8, Q_1'=free_8, R'=0, S'=0, T'=0, [ B>=1+A && 0>=free_5 && free_8>=2 ], cost: 2 5.04/3.30 5.04/3.30 20: f0 -> f35 : D'=free_13, F'=free_10, G'=free_11, H'=free_12, Q'=free_9, J'=C, K'=free_10, L'=free_10, M'=free_10, N'=O, O'=0, P'=free_13, Q_1'=free_13, R'=0, S'=0, T'=0, [ B>=1+A && 0>=free_10 && 0>=free_13 ], cost: 2 5.04/3.30 5.04/3.30 21: f0 -> [6] : C'=0, S'=0, T'=0, [ A>=B ], cost: INF 5.04/3.30 5.04/3.30 22: f0 -> [6] : C'=0, F'=free_3, G'=free, H'=free_1, Q'=free_2, J'=C, K'=free_3, L'=free_3, S'=0, T'=0, [ free_3>=1 && B>=1+A ], cost: INF 5.04/3.30 5.04/3.30 23: f0 -> [6] : A'=B, C'=0, D'=1, F'=free_17, G'=free_14, H'=free_15, Q'=free_16, J'=C, K'=free_17, L'=free_17, M'=free_17, N'=O, P'=1, Q_1'=1, R'=0, S'=0, T'=0, [ 0>=free_17 && B>=1+A ], cost: INF 5.04/3.30 5.04/3.30 24: f0 -> [8] : [ 0>=free_17 && B>=1+A ], cost: 1-A+B 5.04/3.30 5.04/3.30 5.04/3.30 5.04/3.30 Eliminated locations (on tree-shaped paths): 5.04/3.30 5.04/3.30 Start location: f0 5.04/3.30 5.04/3.30 21: f0 -> [6] : C'=0, S'=0, T'=0, [ A>=B ], cost: INF 5.04/3.30 5.04/3.30 22: f0 -> [6] : C'=0, F'=free_3, G'=free, H'=free_1, Q'=free_2, J'=C, K'=free_3, L'=free_3, S'=0, T'=0, [ free_3>=1 && B>=1+A ], cost: INF 5.04/3.30 5.04/3.30 23: f0 -> [6] : A'=B, C'=0, D'=1, F'=free_17, G'=free_14, H'=free_15, Q'=free_16, J'=C, K'=free_17, L'=free_17, M'=free_17, N'=O, P'=1, Q_1'=1, R'=0, S'=0, T'=0, [ 0>=free_17 && B>=1+A ], cost: INF 5.04/3.30 5.04/3.30 24: f0 -> [8] : [ 0>=free_17 && B>=1+A ], cost: 1-A+B 5.04/3.30 5.04/3.30 25: f0 -> [6] : C'=0, D'=free_8, F'=free_5, G'=free_6, H'=free_7, Q'=free_4, J'=C, K'=free_5, L'=free_5, M'=free_5, N'=O, O'=0, P'=free_8, Q_1'=free_8, R'=0, S'=0, T'=0, [ B>=1+A && 0>=free_5 && free_8>=3 ], cost: INF 5.04/3.30 5.04/3.30 26: f0 -> [6] : C'=0, D'=2, E'=free_5, F'=free_5, G'=free_6, H'=free_7, Q'=free_4, J'=C, K'=free_5, L'=free_5, M'=free_5, N'=O, O'=0, P'=free_8, Q_1'=free_8, R'=0, S'=0, T'=0, [ B>=1+A && 0>=free_5 && free_8==2 ], cost: INF 5.04/3.30 5.04/3.30 27: f0 -> [6] : C'=0, D'=free_13, F'=free_10, G'=free_11, H'=free_12, Q'=free_9, J'=C, K'=free_10, L'=free_10, M'=free_10, N'=O, O'=0, P'=free_13, Q_1'=free_13, R'=0, S'=0, T'=0, [ B>=1+A && 0>=free_10 && 0>=free_13 ], cost: INF 5.04/3.30 5.04/3.30 5.04/3.30 5.04/3.30 Applied pruning (of leafs and parallel rules): 5.04/3.30 5.04/3.30 Start location: f0 5.04/3.30 5.04/3.30 21: f0 -> [6] : C'=0, S'=0, T'=0, [ A>=B ], cost: INF 5.04/3.30 5.04/3.30 22: f0 -> [6] : C'=0, F'=free_3, G'=free, H'=free_1, Q'=free_2, J'=C, K'=free_3, L'=free_3, S'=0, T'=0, [ free_3>=1 && B>=1+A ], cost: INF 5.04/3.30 5.04/3.30 23: f0 -> [6] : A'=B, C'=0, D'=1, F'=free_17, G'=free_14, H'=free_15, Q'=free_16, J'=C, K'=free_17, L'=free_17, M'=free_17, N'=O, P'=1, Q_1'=1, R'=0, S'=0, T'=0, [ 0>=free_17 && B>=1+A ], cost: INF 5.04/3.30 5.04/3.30 24: f0 -> [8] : [ 0>=free_17 && B>=1+A ], cost: 1-A+B 5.04/3.30 5.04/3.30 25: f0 -> [6] : C'=0, D'=free_8, F'=free_5, G'=free_6, H'=free_7, Q'=free_4, J'=C, K'=free_5, L'=free_5, M'=free_5, N'=O, O'=0, P'=free_8, Q_1'=free_8, R'=0, S'=0, T'=0, [ B>=1+A && 0>=free_5 && free_8>=3 ], cost: INF 5.04/3.30 5.04/3.30 27: f0 -> [6] : C'=0, D'=free_13, F'=free_10, G'=free_11, H'=free_12, Q'=free_9, J'=C, K'=free_10, L'=free_10, M'=free_10, N'=O, O'=0, P'=free_13, Q_1'=free_13, R'=0, S'=0, T'=0, [ B>=1+A && 0>=free_10 && 0>=free_13 ], cost: INF 5.04/3.30 5.04/3.30 5.04/3.30 5.04/3.30 ### Computing asymptotic complexity ### 5.04/3.30 5.04/3.30 5.04/3.30 5.04/3.30 Fully simplified ITS problem 5.04/3.30 5.04/3.30 Start location: f0 5.04/3.30 5.04/3.30 21: f0 -> [6] : C'=0, S'=0, T'=0, [ A>=B ], cost: INF 5.04/3.30 5.04/3.30 22: f0 -> [6] : C'=0, F'=free_3, G'=free, H'=free_1, Q'=free_2, J'=C, K'=free_3, L'=free_3, S'=0, T'=0, [ free_3>=1 && B>=1+A ], cost: INF 5.04/3.30 5.04/3.30 23: f0 -> [6] : A'=B, C'=0, D'=1, F'=free_17, G'=free_14, H'=free_15, Q'=free_16, J'=C, K'=free_17, L'=free_17, M'=free_17, N'=O, P'=1, Q_1'=1, R'=0, S'=0, T'=0, [ 0>=free_17 && B>=1+A ], cost: INF 5.04/3.30 5.04/3.30 24: f0 -> [8] : [ 0>=free_17 && B>=1+A ], cost: 1-A+B 5.04/3.30 5.04/3.30 25: f0 -> [6] : C'=0, D'=free_8, F'=free_5, G'=free_6, H'=free_7, Q'=free_4, J'=C, K'=free_5, L'=free_5, M'=free_5, N'=O, O'=0, P'=free_8, Q_1'=free_8, R'=0, S'=0, T'=0, [ B>=1+A && 0>=free_5 && free_8>=3 ], cost: INF 5.04/3.30 5.04/3.30 27: f0 -> [6] : C'=0, D'=free_13, F'=free_10, G'=free_11, H'=free_12, Q'=free_9, J'=C, K'=free_10, L'=free_10, M'=free_10, N'=O, O'=0, P'=free_13, Q_1'=free_13, R'=0, S'=0, T'=0, [ B>=1+A && 0>=free_10 && 0>=free_13 ], cost: INF 5.04/3.30 5.04/3.30 5.04/3.30 5.04/3.30 Computing asymptotic complexity for rule 21 5.04/3.30 5.04/3.30 Resulting cost INF has complexity: Nonterm 5.04/3.30 5.04/3.30 5.04/3.30 5.04/3.30 Found new complexity Nonterm. 5.04/3.30 5.04/3.30 5.04/3.30 5.04/3.30 Obtained the following overall complexity (w.r.t. the length of the input n): 5.04/3.30 5.04/3.30 Complexity: Nonterm 5.04/3.30 5.04/3.30 Cpx degree: Nonterm 5.04/3.30 5.04/3.30 Solved cost: INF 5.04/3.30 5.04/3.30 Rule cost: INF 5.04/3.30 5.04/3.30 Rule guard: [ A>=B ] 5.04/3.30 5.04/3.30 5.04/3.30 5.04/3.30 NO 5.04/3.30 5.04/3.30 5.04/3.30 ---------------------------------------- 5.04/3.30 5.04/3.30 (2) 5.04/3.30 BOUNDS(INF, INF) 5.04/3.32 EOF