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