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