WORST_CASE(NON_POLY,?) proof of input_QFplGIqK0M.trs # AProVE Commit ID: aff8ecad908e01718a4c36e68d2e55d5e0f16e15 fuhs 20220216 unpublished The Runtime Complexity (parallel-innermost) of the given CpxTRS could be proven to be BOUNDS(EXP, INF). (0) CpxTRS (1) CpxTrsToCdtProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CdtProblem (3) CdtToCpxRelTrsProof [BOTH BOUNDS(ID, ID), 0 ms] (4) CpxRelTRS (5) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (6) CpxRelTRS (7) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (8) typed CpxTrs (9) OrderProof [LOWER BOUND(ID), 12 ms] (10) typed CpxTrs (11) RewriteLemmaProof [LOWER BOUND(ID), 284 ms] (12) BEST (13) proven lower bound (14) LowerBoundPropagationProof [FINISHED, 0 ms] (15) BOUNDS(n^1, INF) (16) typed CpxTrs (17) RewriteLemmaProof [LOWER BOUND(ID), 1772 ms] (18) typed CpxTrs (19) RewriteLemmaProof [FINISHED, 268 ms] (20) BOUNDS(EXP, INF) ---------------------------------------- (0) Obligation: The Runtime Complexity (parallel-innermost) of the given CpxTRS could be proven to be BOUNDS(EXP, INF). The TRS R consists of the following rules: -(x, 0) -> x -(s(x), s(y)) -> -(x, y) +(0, y) -> y +(s(x), y) -> s(+(x, y)) *(x, 0) -> 0 *(x, s(y)) -> +(x, *(x, y)) f(s(x)) -> f(-(*(s(s(0)), s(x)), s(s(x)))) S is empty. Rewrite Strategy: PARALLEL_INNERMOST ---------------------------------------- (1) CpxTrsToCdtProof (BOTH BOUNDS(ID, ID)) Converted Cpx (relative) TRS with rewrite strategy PARALLEL_INNERMOST to CDT ---------------------------------------- (2) Obligation: Complexity Dependency Tuples Problem Rules: -(z0, 0) -> z0 -(s(z0), s(z1)) -> -(z0, z1) +(0, z0) -> z0 +(s(z0), z1) -> s(+(z0, z1)) *(z0, 0) -> 0 *(z0, s(z1)) -> +(z0, *(z0, z1)) f(s(z0)) -> f(-(*(s(s(0)), s(z0)), s(s(z0)))) Tuples: -'(z0, 0) -> c -'(s(z0), s(z1)) -> c1(-'(z0, z1)) +'(0, z0) -> c2 +'(s(z0), z1) -> c3(+'(z0, z1)) *'(z0, 0) -> c4 *'(z0, s(z1)) -> c5(+'(z0, *(z0, z1)), *'(z0, z1)) F(s(z0)) -> c6(F(-(*(s(s(0)), s(z0)), s(s(z0)))), -'(*(s(s(0)), s(z0)), s(s(z0))), *'(s(s(0)), s(z0))) S tuples: -'(z0, 0) -> c -'(s(z0), s(z1)) -> c1(-'(z0, z1)) +'(0, z0) -> c2 +'(s(z0), z1) -> c3(+'(z0, z1)) *'(z0, 0) -> c4 *'(z0, s(z1)) -> c5(+'(z0, *(z0, z1)), *'(z0, z1)) F(s(z0)) -> c6(F(-(*(s(s(0)), s(z0)), s(s(z0)))), -'(*(s(s(0)), s(z0)), s(s(z0))), *'(s(s(0)), s(z0))) K tuples:none Defined Rule Symbols: -_2, +_2, *_2, f_1 Defined Pair Symbols: -'_2, +'_2, *'_2, F_1 Compound Symbols: c, c1_1, c2, c3_1, c4, c5_2, c6_3 ---------------------------------------- (3) CdtToCpxRelTrsProof (BOTH BOUNDS(ID, ID)) Converted S to standard rules, and D \ S as well as R to relative rules. ---------------------------------------- (4) Obligation: The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(EXP, INF). The TRS R consists of the following rules: -'(z0, 0) -> c -'(s(z0), s(z1)) -> c1(-'(z0, z1)) +'(0, z0) -> c2 +'(s(z0), z1) -> c3(+'(z0, z1)) *'(z0, 0) -> c4 *'(z0, s(z1)) -> c5(+'(z0, *(z0, z1)), *'(z0, z1)) F(s(z0)) -> c6(F(-(*(s(s(0)), s(z0)), s(s(z0)))), -'(*(s(s(0)), s(z0)), s(s(z0))), *'(s(s(0)), s(z0))) The (relative) TRS S consists of the following rules: -(z0, 0) -> z0 -(s(z0), s(z1)) -> -(z0, z1) +(0, z0) -> z0 +(s(z0), z1) -> s(+(z0, z1)) *(z0, 0) -> 0 *(z0, s(z1)) -> +(z0, *(z0, z1)) f(s(z0)) -> f(-(*(s(s(0)), s(z0)), s(s(z0)))) Rewrite Strategy: INNERMOST ---------------------------------------- (5) RenamingProof (BOTH BOUNDS(ID, ID)) Renamed function symbols to avoid clashes with predefined symbol. ---------------------------------------- (6) Obligation: The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(EXP, INF). The TRS R consists of the following rules: -'(z0, 0') -> c -'(s(z0), s(z1)) -> c1(-'(z0, z1)) +'(0', z0) -> c2 +'(s(z0), z1) -> c3(+'(z0, z1)) *'(z0, 0') -> c4 *'(z0, s(z1)) -> c5(+'(z0, *'(z0, z1)), *'(z0, z1)) F(s(z0)) -> c6(F(-(*'(s(s(0')), s(z0)), s(s(z0)))), -'(*'(s(s(0')), s(z0)), s(s(z0))), *'(s(s(0')), s(z0))) The (relative) TRS S consists of the following rules: -(z0, 0') -> z0 -(s(z0), s(z1)) -> -(z0, z1) +'(0', z0) -> z0 +'(s(z0), z1) -> s(+'(z0, z1)) *'(z0, 0') -> 0' *'(z0, s(z1)) -> +'(z0, *'(z0, z1)) f(s(z0)) -> f(-(*'(s(s(0')), s(z0)), s(s(z0)))) Rewrite Strategy: INNERMOST ---------------------------------------- (7) TypeInferenceProof (BOTH BOUNDS(ID, ID)) Inferred types. ---------------------------------------- (8) Obligation: Innermost TRS: Rules: -'(z0, 0') -> c -'(s(z0), s(z1)) -> c1(-'(z0, z1)) +'(0', z0) -> c2 +'(s(z0), z1) -> c3(+'(z0, z1)) *'(z0, 0') -> c4 *'(z0, s(z1)) -> c5(+'(z0, *'(z0, z1)), *'(z0, z1)) F(s(z0)) -> c6(F(-(*'(s(s(0')), s(z0)), s(s(z0)))), -'(*'(s(s(0')), s(z0)), s(s(z0))), *'(s(s(0')), s(z0))) -(z0, 0') -> z0 -(s(z0), s(z1)) -> -(z0, z1) +'(0', z0) -> z0 +'(s(z0), z1) -> s(+'(z0, z1)) *'(z0, 0') -> 0' *'(z0, s(z1)) -> +'(z0, *'(z0, z1)) f(s(z0)) -> f(-(*'(s(s(0')), s(z0)), s(s(z0)))) Types: -' :: 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 -> c:c1 0' :: 0':s:c2:c3:c4:c5 c :: c:c1 s :: 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 c1 :: c:c1 -> c:c1 +' :: 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 c2 :: 0':s:c2:c3:c4:c5 c3 :: 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 *' :: 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 c4 :: 0':s:c2:c3:c4:c5 c5 :: 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 F :: 0':s:c2:c3:c4:c5 -> c6 c6 :: c6 -> c:c1 -> 0':s:c2:c3:c4:c5 -> c6 - :: 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 f :: 0':s:c2:c3:c4:c5 -> f hole_c:c11_7 :: c:c1 hole_0':s:c2:c3:c4:c52_7 :: 0':s:c2:c3:c4:c5 hole_c63_7 :: c6 hole_f4_7 :: f gen_c:c15_7 :: Nat -> c:c1 gen_0':s:c2:c3:c4:c56_7 :: Nat -> 0':s:c2:c3:c4:c5 gen_c67_7 :: Nat -> c6 ---------------------------------------- (9) OrderProof (LOWER BOUND(ID)) Heuristically decided to analyse the following defined symbols: -', +', *', F, -, f They will be analysed ascendingly in the following order: -' < F +' < *' *' < F *' < f - < F - < f ---------------------------------------- (10) Obligation: Innermost TRS: Rules: -'(z0, 0') -> c -'(s(z0), s(z1)) -> c1(-'(z0, z1)) +'(0', z0) -> c2 +'(s(z0), z1) -> c3(+'(z0, z1)) *'(z0, 0') -> c4 *'(z0, s(z1)) -> c5(+'(z0, *'(z0, z1)), *'(z0, z1)) F(s(z0)) -> c6(F(-(*'(s(s(0')), s(z0)), s(s(z0)))), -'(*'(s(s(0')), s(z0)), s(s(z0))), *'(s(s(0')), s(z0))) -(z0, 0') -> z0 -(s(z0), s(z1)) -> -(z0, z1) +'(0', z0) -> z0 +'(s(z0), z1) -> s(+'(z0, z1)) *'(z0, 0') -> 0' *'(z0, s(z1)) -> +'(z0, *'(z0, z1)) f(s(z0)) -> f(-(*'(s(s(0')), s(z0)), s(s(z0)))) Types: -' :: 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 -> c:c1 0' :: 0':s:c2:c3:c4:c5 c :: c:c1 s :: 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 c1 :: c:c1 -> c:c1 +' :: 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 c2 :: 0':s:c2:c3:c4:c5 c3 :: 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 *' :: 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 c4 :: 0':s:c2:c3:c4:c5 c5 :: 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 F :: 0':s:c2:c3:c4:c5 -> c6 c6 :: c6 -> c:c1 -> 0':s:c2:c3:c4:c5 -> c6 - :: 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 f :: 0':s:c2:c3:c4:c5 -> f hole_c:c11_7 :: c:c1 hole_0':s:c2:c3:c4:c52_7 :: 0':s:c2:c3:c4:c5 hole_c63_7 :: c6 hole_f4_7 :: f gen_c:c15_7 :: Nat -> c:c1 gen_0':s:c2:c3:c4:c56_7 :: Nat -> 0':s:c2:c3:c4:c5 gen_c67_7 :: Nat -> c6 Generator Equations: gen_c:c15_7(0) <=> c gen_c:c15_7(+(x, 1)) <=> c1(gen_c:c15_7(x)) gen_0':s:c2:c3:c4:c56_7(0) <=> 0' gen_0':s:c2:c3:c4:c56_7(+(x, 1)) <=> s(gen_0':s:c2:c3:c4:c56_7(x)) gen_c67_7(0) <=> hole_c63_7 gen_c67_7(+(x, 1)) <=> c6(gen_c67_7(x), c, 0') The following defined symbols remain to be analysed: -', +', *', F, -, f They will be analysed ascendingly in the following order: -' < F +' < *' *' < F *' < f - < F - < f ---------------------------------------- (11) RewriteLemmaProof (LOWER BOUND(ID)) Proved the following rewrite lemma: -'(gen_0':s:c2:c3:c4:c56_7(n9_7), gen_0':s:c2:c3:c4:c56_7(n9_7)) -> gen_c:c15_7(n9_7), rt in Omega(1 + n9_7) Induction Base: -'(gen_0':s:c2:c3:c4:c56_7(0), gen_0':s:c2:c3:c4:c56_7(0)) ->_R^Omega(1) c Induction Step: -'(gen_0':s:c2:c3:c4:c56_7(+(n9_7, 1)), gen_0':s:c2:c3:c4:c56_7(+(n9_7, 1))) ->_R^Omega(1) c1(-'(gen_0':s:c2:c3:c4:c56_7(n9_7), gen_0':s:c2:c3:c4:c56_7(n9_7))) ->_IH c1(gen_c:c15_7(c10_7)) We have rt in Omega(n^1) and sz in O(n). Thus, we have irc_R in Omega(n). ---------------------------------------- (12) Complex Obligation (BEST) ---------------------------------------- (13) Obligation: Proved the lower bound n^1 for the following obligation: Innermost TRS: Rules: -'(z0, 0') -> c -'(s(z0), s(z1)) -> c1(-'(z0, z1)) +'(0', z0) -> c2 +'(s(z0), z1) -> c3(+'(z0, z1)) *'(z0, 0') -> c4 *'(z0, s(z1)) -> c5(+'(z0, *'(z0, z1)), *'(z0, z1)) F(s(z0)) -> c6(F(-(*'(s(s(0')), s(z0)), s(s(z0)))), -'(*'(s(s(0')), s(z0)), s(s(z0))), *'(s(s(0')), s(z0))) -(z0, 0') -> z0 -(s(z0), s(z1)) -> -(z0, z1) +'(0', z0) -> z0 +'(s(z0), z1) -> s(+'(z0, z1)) *'(z0, 0') -> 0' *'(z0, s(z1)) -> +'(z0, *'(z0, z1)) f(s(z0)) -> f(-(*'(s(s(0')), s(z0)), s(s(z0)))) Types: -' :: 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 -> c:c1 0' :: 0':s:c2:c3:c4:c5 c :: c:c1 s :: 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 c1 :: c:c1 -> c:c1 +' :: 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 c2 :: 0':s:c2:c3:c4:c5 c3 :: 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 *' :: 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 c4 :: 0':s:c2:c3:c4:c5 c5 :: 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 F :: 0':s:c2:c3:c4:c5 -> c6 c6 :: c6 -> c:c1 -> 0':s:c2:c3:c4:c5 -> c6 - :: 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 f :: 0':s:c2:c3:c4:c5 -> f hole_c:c11_7 :: c:c1 hole_0':s:c2:c3:c4:c52_7 :: 0':s:c2:c3:c4:c5 hole_c63_7 :: c6 hole_f4_7 :: f gen_c:c15_7 :: Nat -> c:c1 gen_0':s:c2:c3:c4:c56_7 :: Nat -> 0':s:c2:c3:c4:c5 gen_c67_7 :: Nat -> c6 Generator Equations: gen_c:c15_7(0) <=> c gen_c:c15_7(+(x, 1)) <=> c1(gen_c:c15_7(x)) gen_0':s:c2:c3:c4:c56_7(0) <=> 0' gen_0':s:c2:c3:c4:c56_7(+(x, 1)) <=> s(gen_0':s:c2:c3:c4:c56_7(x)) gen_c67_7(0) <=> hole_c63_7 gen_c67_7(+(x, 1)) <=> c6(gen_c67_7(x), c, 0') The following defined symbols remain to be analysed: -', +', *', F, -, f They will be analysed ascendingly in the following order: -' < F +' < *' *' < F *' < f - < F - < f ---------------------------------------- (14) LowerBoundPropagationProof (FINISHED) Propagated lower bound. ---------------------------------------- (15) BOUNDS(n^1, INF) ---------------------------------------- (16) Obligation: Innermost TRS: Rules: -'(z0, 0') -> c -'(s(z0), s(z1)) -> c1(-'(z0, z1)) +'(0', z0) -> c2 +'(s(z0), z1) -> c3(+'(z0, z1)) *'(z0, 0') -> c4 *'(z0, s(z1)) -> c5(+'(z0, *'(z0, z1)), *'(z0, z1)) F(s(z0)) -> c6(F(-(*'(s(s(0')), s(z0)), s(s(z0)))), -'(*'(s(s(0')), s(z0)), s(s(z0))), *'(s(s(0')), s(z0))) -(z0, 0') -> z0 -(s(z0), s(z1)) -> -(z0, z1) +'(0', z0) -> z0 +'(s(z0), z1) -> s(+'(z0, z1)) *'(z0, 0') -> 0' *'(z0, s(z1)) -> +'(z0, *'(z0, z1)) f(s(z0)) -> f(-(*'(s(s(0')), s(z0)), s(s(z0)))) Types: -' :: 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 -> c:c1 0' :: 0':s:c2:c3:c4:c5 c :: c:c1 s :: 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 c1 :: c:c1 -> c:c1 +' :: 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 c2 :: 0':s:c2:c3:c4:c5 c3 :: 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 *' :: 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 c4 :: 0':s:c2:c3:c4:c5 c5 :: 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 F :: 0':s:c2:c3:c4:c5 -> c6 c6 :: c6 -> c:c1 -> 0':s:c2:c3:c4:c5 -> c6 - :: 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 f :: 0':s:c2:c3:c4:c5 -> f hole_c:c11_7 :: c:c1 hole_0':s:c2:c3:c4:c52_7 :: 0':s:c2:c3:c4:c5 hole_c63_7 :: c6 hole_f4_7 :: f gen_c:c15_7 :: Nat -> c:c1 gen_0':s:c2:c3:c4:c56_7 :: Nat -> 0':s:c2:c3:c4:c5 gen_c67_7 :: Nat -> c6 Lemmas: -'(gen_0':s:c2:c3:c4:c56_7(n9_7), gen_0':s:c2:c3:c4:c56_7(n9_7)) -> gen_c:c15_7(n9_7), rt in Omega(1 + n9_7) Generator Equations: gen_c:c15_7(0) <=> c gen_c:c15_7(+(x, 1)) <=> c1(gen_c:c15_7(x)) gen_0':s:c2:c3:c4:c56_7(0) <=> 0' gen_0':s:c2:c3:c4:c56_7(+(x, 1)) <=> s(gen_0':s:c2:c3:c4:c56_7(x)) gen_c67_7(0) <=> hole_c63_7 gen_c67_7(+(x, 1)) <=> c6(gen_c67_7(x), c, 0') The following defined symbols remain to be analysed: +', *', F, -, f They will be analysed ascendingly in the following order: +' < *' *' < F *' < f - < F - < f ---------------------------------------- (17) RewriteLemmaProof (LOWER BOUND(ID)) Proved the following rewrite lemma: +'(gen_0':s:c2:c3:c4:c56_7(+(1, n378_7)), gen_0':s:c2:c3:c4:c56_7(b)) -> *8_7, rt in Omega(n378_7) Induction Base: +'(gen_0':s:c2:c3:c4:c56_7(+(1, 0)), gen_0':s:c2:c3:c4:c56_7(b)) Induction Step: +'(gen_0':s:c2:c3:c4:c56_7(+(1, +(n378_7, 1))), gen_0':s:c2:c3:c4:c56_7(b)) ->_R^Omega(1) c3(+'(gen_0':s:c2:c3:c4:c56_7(+(1, n378_7)), gen_0':s:c2:c3:c4:c56_7(b))) ->_IH c3(*8_7) We have rt in Omega(n^1) and sz in O(n). Thus, we have irc_R in Omega(n). ---------------------------------------- (18) Obligation: Innermost TRS: Rules: -'(z0, 0') -> c -'(s(z0), s(z1)) -> c1(-'(z0, z1)) +'(0', z0) -> c2 +'(s(z0), z1) -> c3(+'(z0, z1)) *'(z0, 0') -> c4 *'(z0, s(z1)) -> c5(+'(z0, *'(z0, z1)), *'(z0, z1)) F(s(z0)) -> c6(F(-(*'(s(s(0')), s(z0)), s(s(z0)))), -'(*'(s(s(0')), s(z0)), s(s(z0))), *'(s(s(0')), s(z0))) -(z0, 0') -> z0 -(s(z0), s(z1)) -> -(z0, z1) +'(0', z0) -> z0 +'(s(z0), z1) -> s(+'(z0, z1)) *'(z0, 0') -> 0' *'(z0, s(z1)) -> +'(z0, *'(z0, z1)) f(s(z0)) -> f(-(*'(s(s(0')), s(z0)), s(s(z0)))) Types: -' :: 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 -> c:c1 0' :: 0':s:c2:c3:c4:c5 c :: c:c1 s :: 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 c1 :: c:c1 -> c:c1 +' :: 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 c2 :: 0':s:c2:c3:c4:c5 c3 :: 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 *' :: 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 c4 :: 0':s:c2:c3:c4:c5 c5 :: 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 F :: 0':s:c2:c3:c4:c5 -> c6 c6 :: c6 -> c:c1 -> 0':s:c2:c3:c4:c5 -> c6 - :: 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 -> 0':s:c2:c3:c4:c5 f :: 0':s:c2:c3:c4:c5 -> f hole_c:c11_7 :: c:c1 hole_0':s:c2:c3:c4:c52_7 :: 0':s:c2:c3:c4:c5 hole_c63_7 :: c6 hole_f4_7 :: f gen_c:c15_7 :: Nat -> c:c1 gen_0':s:c2:c3:c4:c56_7 :: Nat -> 0':s:c2:c3:c4:c5 gen_c67_7 :: Nat -> c6 Lemmas: -'(gen_0':s:c2:c3:c4:c56_7(n9_7), gen_0':s:c2:c3:c4:c56_7(n9_7)) -> gen_c:c15_7(n9_7), rt in Omega(1 + n9_7) +'(gen_0':s:c2:c3:c4:c56_7(+(1, n378_7)), gen_0':s:c2:c3:c4:c56_7(b)) -> *8_7, rt in Omega(n378_7) Generator Equations: gen_c:c15_7(0) <=> c gen_c:c15_7(+(x, 1)) <=> c1(gen_c:c15_7(x)) gen_0':s:c2:c3:c4:c56_7(0) <=> 0' gen_0':s:c2:c3:c4:c56_7(+(x, 1)) <=> s(gen_0':s:c2:c3:c4:c56_7(x)) gen_c67_7(0) <=> hole_c63_7 gen_c67_7(+(x, 1)) <=> c6(gen_c67_7(x), c, 0') The following defined symbols remain to be analysed: *', F, -, f They will be analysed ascendingly in the following order: *' < F *' < f - < F - < f ---------------------------------------- (19) RewriteLemmaProof (FINISHED) Proved the following rewrite lemma: *'(gen_0':s:c2:c3:c4:c56_7(a), gen_0':s:c2:c3:c4:c56_7(+(1, n2278_7))) -> *8_7, rt in Omega(EXP) Induction Base: *'(gen_0':s:c2:c3:c4:c56_7(a), gen_0':s:c2:c3:c4:c56_7(+(1, 0))) Induction Step: *'(gen_0':s:c2:c3:c4:c56_7(a), gen_0':s:c2:c3:c4:c56_7(+(1, +(n2278_7, 1)))) ->_R^Omega(1) c5(+'(gen_0':s:c2:c3:c4:c56_7(a), *'(gen_0':s:c2:c3:c4:c56_7(a), gen_0':s:c2:c3:c4:c56_7(+(1, n2278_7)))), *'(gen_0':s:c2:c3:c4:c56_7(a), gen_0':s:c2:c3:c4:c56_7(+(1, n2278_7)))) ->_IH c5(+'(gen_0':s:c2:c3:c4:c56_7(a), *8_7), *'(gen_0':s:c2:c3:c4:c56_7(a), gen_0':s:c2:c3:c4:c56_7(+(1, n2278_7)))) ->_IH c5(+'(gen_0':s:c2:c3:c4:c56_7(a), *8_7), *8_7) We have rt in EXP and sz in O(n). Thus, we have irc_R in EXP ---------------------------------------- (20) BOUNDS(EXP, INF)