/export/starexec/sandbox/solver/bin/starexec_run_rcdcRelativeAlsoLower /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1), ?) proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty The Derivational Complexity (innermost) of the given DCpxTrs could be proven to be BOUNDS(n^1, INF). (0) DCpxTrs (1) DerivationalComplexityToRuntimeComplexityProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxRelTRS (3) SInnermostTerminationProof [BOTH CONCRETE BOUNDS(ID, ID), 52 ms] (4) CpxRelTRS (5) RenamingProof [BOTH BOUNDS(ID, ID), 2 ms] (6) CpxRelTRS (7) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (8) typed CpxTrs (9) OrderProof [LOWER BOUND(ID), 0 ms] (10) typed CpxTrs (11) RewriteLemmaProof [LOWER BOUND(ID), 451 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), 107 ms] (18) BOUNDS(1, INF) ---------------------------------------- (0) Obligation: The Derivational Complexity (innermost) of the given DCpxTrs could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: active(f(f(a))) -> mark(f(g(f(a)))) active(g(X)) -> g(active(X)) g(mark(X)) -> mark(g(X)) proper(f(X)) -> f(proper(X)) proper(a) -> ok(a) proper(g(X)) -> g(proper(X)) f(ok(X)) -> ok(f(X)) g(ok(X)) -> ok(g(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (1) DerivationalComplexityToRuntimeComplexityProof (BOTH BOUNDS(ID, ID)) The following rules have been added to S to convert the given derivational complexity problem to a runtime complexity problem: encArg(a) -> a encArg(mark(x_1)) -> mark(encArg(x_1)) encArg(ok(x_1)) -> ok(encArg(x_1)) encArg(cons_active(x_1)) -> active(encArg(x_1)) encArg(cons_g(x_1)) -> g(encArg(x_1)) encArg(cons_proper(x_1)) -> proper(encArg(x_1)) encArg(cons_f(x_1)) -> f(encArg(x_1)) encArg(cons_top(x_1)) -> top(encArg(x_1)) encode_active(x_1) -> active(encArg(x_1)) encode_f(x_1) -> f(encArg(x_1)) encode_a -> a encode_mark(x_1) -> mark(encArg(x_1)) encode_g(x_1) -> g(encArg(x_1)) encode_proper(x_1) -> proper(encArg(x_1)) encode_ok(x_1) -> ok(encArg(x_1)) encode_top(x_1) -> top(encArg(x_1)) ---------------------------------------- (2) Obligation: The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: active(f(f(a))) -> mark(f(g(f(a)))) active(g(X)) -> g(active(X)) g(mark(X)) -> mark(g(X)) proper(f(X)) -> f(proper(X)) proper(a) -> ok(a) proper(g(X)) -> g(proper(X)) f(ok(X)) -> ok(f(X)) g(ok(X)) -> ok(g(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) The (relative) TRS S consists of the following rules: encArg(a) -> a encArg(mark(x_1)) -> mark(encArg(x_1)) encArg(ok(x_1)) -> ok(encArg(x_1)) encArg(cons_active(x_1)) -> active(encArg(x_1)) encArg(cons_g(x_1)) -> g(encArg(x_1)) encArg(cons_proper(x_1)) -> proper(encArg(x_1)) encArg(cons_f(x_1)) -> f(encArg(x_1)) encArg(cons_top(x_1)) -> top(encArg(x_1)) encode_active(x_1) -> active(encArg(x_1)) encode_f(x_1) -> f(encArg(x_1)) encode_a -> a encode_mark(x_1) -> mark(encArg(x_1)) encode_g(x_1) -> g(encArg(x_1)) encode_proper(x_1) -> proper(encArg(x_1)) encode_ok(x_1) -> ok(encArg(x_1)) encode_top(x_1) -> top(encArg(x_1)) Rewrite Strategy: INNERMOST ---------------------------------------- (3) SInnermostTerminationProof (BOTH CONCRETE BOUNDS(ID, ID)) proved innermost termination of relative rules ---------------------------------------- (4) Obligation: The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: active(f(f(a))) -> mark(f(g(f(a)))) active(g(X)) -> g(active(X)) g(mark(X)) -> mark(g(X)) proper(f(X)) -> f(proper(X)) proper(a) -> ok(a) proper(g(X)) -> g(proper(X)) f(ok(X)) -> ok(f(X)) g(ok(X)) -> ok(g(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) The (relative) TRS S consists of the following rules: encArg(a) -> a encArg(mark(x_1)) -> mark(encArg(x_1)) encArg(ok(x_1)) -> ok(encArg(x_1)) encArg(cons_active(x_1)) -> active(encArg(x_1)) encArg(cons_g(x_1)) -> g(encArg(x_1)) encArg(cons_proper(x_1)) -> proper(encArg(x_1)) encArg(cons_f(x_1)) -> f(encArg(x_1)) encArg(cons_top(x_1)) -> top(encArg(x_1)) encode_active(x_1) -> active(encArg(x_1)) encode_f(x_1) -> f(encArg(x_1)) encode_a -> a encode_mark(x_1) -> mark(encArg(x_1)) encode_g(x_1) -> g(encArg(x_1)) encode_proper(x_1) -> proper(encArg(x_1)) encode_ok(x_1) -> ok(encArg(x_1)) encode_top(x_1) -> top(encArg(x_1)) 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(n^1, INF). The TRS R consists of the following rules: active(f(f(a))) -> mark(f(g(f(a)))) active(g(X)) -> g(active(X)) g(mark(X)) -> mark(g(X)) proper(f(X)) -> f(proper(X)) proper(a) -> ok(a) proper(g(X)) -> g(proper(X)) f(ok(X)) -> ok(f(X)) g(ok(X)) -> ok(g(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) The (relative) TRS S consists of the following rules: encArg(a) -> a encArg(mark(x_1)) -> mark(encArg(x_1)) encArg(ok(x_1)) -> ok(encArg(x_1)) encArg(cons_active(x_1)) -> active(encArg(x_1)) encArg(cons_g(x_1)) -> g(encArg(x_1)) encArg(cons_proper(x_1)) -> proper(encArg(x_1)) encArg(cons_f(x_1)) -> f(encArg(x_1)) encArg(cons_top(x_1)) -> top(encArg(x_1)) encode_active(x_1) -> active(encArg(x_1)) encode_f(x_1) -> f(encArg(x_1)) encode_a -> a encode_mark(x_1) -> mark(encArg(x_1)) encode_g(x_1) -> g(encArg(x_1)) encode_proper(x_1) -> proper(encArg(x_1)) encode_ok(x_1) -> ok(encArg(x_1)) encode_top(x_1) -> top(encArg(x_1)) Rewrite Strategy: INNERMOST ---------------------------------------- (7) TypeInferenceProof (BOTH BOUNDS(ID, ID)) Infered types. ---------------------------------------- (8) Obligation: Innermost TRS: Rules: active(f(f(a))) -> mark(f(g(f(a)))) active(g(X)) -> g(active(X)) g(mark(X)) -> mark(g(X)) proper(f(X)) -> f(proper(X)) proper(a) -> ok(a) proper(g(X)) -> g(proper(X)) f(ok(X)) -> ok(f(X)) g(ok(X)) -> ok(g(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) encArg(a) -> a encArg(mark(x_1)) -> mark(encArg(x_1)) encArg(ok(x_1)) -> ok(encArg(x_1)) encArg(cons_active(x_1)) -> active(encArg(x_1)) encArg(cons_g(x_1)) -> g(encArg(x_1)) encArg(cons_proper(x_1)) -> proper(encArg(x_1)) encArg(cons_f(x_1)) -> f(encArg(x_1)) encArg(cons_top(x_1)) -> top(encArg(x_1)) encode_active(x_1) -> active(encArg(x_1)) encode_f(x_1) -> f(encArg(x_1)) encode_a -> a encode_mark(x_1) -> mark(encArg(x_1)) encode_g(x_1) -> g(encArg(x_1)) encode_proper(x_1) -> proper(encArg(x_1)) encode_ok(x_1) -> ok(encArg(x_1)) encode_top(x_1) -> top(encArg(x_1)) Types: active :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top f :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top a :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top mark :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top g :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top proper :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top ok :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top top :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top encArg :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top cons_active :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top cons_g :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top cons_proper :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top cons_f :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top cons_top :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top encode_active :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top encode_f :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top encode_a :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top encode_mark :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top encode_g :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top encode_proper :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top encode_ok :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top encode_top :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top hole_a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top1_0 :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top gen_a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top2_0 :: Nat -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top ---------------------------------------- (9) OrderProof (LOWER BOUND(ID)) Heuristically decided to analyse the following defined symbols: active, f, g, proper, top, encArg They will be analysed ascendingly in the following order: f < active g < active active < top active < encArg f < proper f < encArg g < proper g < encArg proper < top proper < encArg top < encArg ---------------------------------------- (10) Obligation: Innermost TRS: Rules: active(f(f(a))) -> mark(f(g(f(a)))) active(g(X)) -> g(active(X)) g(mark(X)) -> mark(g(X)) proper(f(X)) -> f(proper(X)) proper(a) -> ok(a) proper(g(X)) -> g(proper(X)) f(ok(X)) -> ok(f(X)) g(ok(X)) -> ok(g(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) encArg(a) -> a encArg(mark(x_1)) -> mark(encArg(x_1)) encArg(ok(x_1)) -> ok(encArg(x_1)) encArg(cons_active(x_1)) -> active(encArg(x_1)) encArg(cons_g(x_1)) -> g(encArg(x_1)) encArg(cons_proper(x_1)) -> proper(encArg(x_1)) encArg(cons_f(x_1)) -> f(encArg(x_1)) encArg(cons_top(x_1)) -> top(encArg(x_1)) encode_active(x_1) -> active(encArg(x_1)) encode_f(x_1) -> f(encArg(x_1)) encode_a -> a encode_mark(x_1) -> mark(encArg(x_1)) encode_g(x_1) -> g(encArg(x_1)) encode_proper(x_1) -> proper(encArg(x_1)) encode_ok(x_1) -> ok(encArg(x_1)) encode_top(x_1) -> top(encArg(x_1)) Types: active :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top f :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top a :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top mark :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top g :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top proper :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top ok :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top top :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top encArg :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top cons_active :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top cons_g :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top cons_proper :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top cons_f :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top cons_top :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top encode_active :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top encode_f :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top encode_a :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top encode_mark :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top encode_g :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top encode_proper :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top encode_ok :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top encode_top :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top hole_a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top1_0 :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top gen_a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top2_0 :: Nat -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top Generator Equations: gen_a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top2_0(0) <=> a gen_a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top2_0(+(x, 1)) <=> mark(gen_a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top2_0(x)) The following defined symbols remain to be analysed: f, active, g, proper, top, encArg They will be analysed ascendingly in the following order: f < active g < active active < top active < encArg f < proper f < encArg g < proper g < encArg proper < top proper < encArg top < encArg ---------------------------------------- (11) RewriteLemmaProof (LOWER BOUND(ID)) Proved the following rewrite lemma: g(gen_a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top2_0(+(1, n8_0))) -> *3_0, rt in Omega(n8_0) Induction Base: g(gen_a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top2_0(+(1, 0))) Induction Step: g(gen_a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top2_0(+(1, +(n8_0, 1)))) ->_R^Omega(1) mark(g(gen_a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top2_0(+(1, n8_0)))) ->_IH mark(*3_0) 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: active(f(f(a))) -> mark(f(g(f(a)))) active(g(X)) -> g(active(X)) g(mark(X)) -> mark(g(X)) proper(f(X)) -> f(proper(X)) proper(a) -> ok(a) proper(g(X)) -> g(proper(X)) f(ok(X)) -> ok(f(X)) g(ok(X)) -> ok(g(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) encArg(a) -> a encArg(mark(x_1)) -> mark(encArg(x_1)) encArg(ok(x_1)) -> ok(encArg(x_1)) encArg(cons_active(x_1)) -> active(encArg(x_1)) encArg(cons_g(x_1)) -> g(encArg(x_1)) encArg(cons_proper(x_1)) -> proper(encArg(x_1)) encArg(cons_f(x_1)) -> f(encArg(x_1)) encArg(cons_top(x_1)) -> top(encArg(x_1)) encode_active(x_1) -> active(encArg(x_1)) encode_f(x_1) -> f(encArg(x_1)) encode_a -> a encode_mark(x_1) -> mark(encArg(x_1)) encode_g(x_1) -> g(encArg(x_1)) encode_proper(x_1) -> proper(encArg(x_1)) encode_ok(x_1) -> ok(encArg(x_1)) encode_top(x_1) -> top(encArg(x_1)) Types: active :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top f :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top a :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top mark :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top g :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top proper :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top ok :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top top :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top encArg :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top cons_active :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top cons_g :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top cons_proper :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top cons_f :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top cons_top :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top encode_active :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top encode_f :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top encode_a :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top encode_mark :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top encode_g :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top encode_proper :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top encode_ok :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top encode_top :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top hole_a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top1_0 :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top gen_a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top2_0 :: Nat -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top Generator Equations: gen_a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top2_0(0) <=> a gen_a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top2_0(+(x, 1)) <=> mark(gen_a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top2_0(x)) The following defined symbols remain to be analysed: g, active, proper, top, encArg They will be analysed ascendingly in the following order: g < active active < top active < encArg g < proper g < encArg proper < top proper < encArg top < encArg ---------------------------------------- (14) LowerBoundPropagationProof (FINISHED) Propagated lower bound. ---------------------------------------- (15) BOUNDS(n^1, INF) ---------------------------------------- (16) Obligation: Innermost TRS: Rules: active(f(f(a))) -> mark(f(g(f(a)))) active(g(X)) -> g(active(X)) g(mark(X)) -> mark(g(X)) proper(f(X)) -> f(proper(X)) proper(a) -> ok(a) proper(g(X)) -> g(proper(X)) f(ok(X)) -> ok(f(X)) g(ok(X)) -> ok(g(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) encArg(a) -> a encArg(mark(x_1)) -> mark(encArg(x_1)) encArg(ok(x_1)) -> ok(encArg(x_1)) encArg(cons_active(x_1)) -> active(encArg(x_1)) encArg(cons_g(x_1)) -> g(encArg(x_1)) encArg(cons_proper(x_1)) -> proper(encArg(x_1)) encArg(cons_f(x_1)) -> f(encArg(x_1)) encArg(cons_top(x_1)) -> top(encArg(x_1)) encode_active(x_1) -> active(encArg(x_1)) encode_f(x_1) -> f(encArg(x_1)) encode_a -> a encode_mark(x_1) -> mark(encArg(x_1)) encode_g(x_1) -> g(encArg(x_1)) encode_proper(x_1) -> proper(encArg(x_1)) encode_ok(x_1) -> ok(encArg(x_1)) encode_top(x_1) -> top(encArg(x_1)) Types: active :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top f :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top a :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top mark :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top g :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top proper :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top ok :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top top :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top encArg :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top cons_active :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top cons_g :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top cons_proper :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top cons_f :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top cons_top :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top encode_active :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top encode_f :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top encode_a :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top encode_mark :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top encode_g :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top encode_proper :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top encode_ok :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top encode_top :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top hole_a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top1_0 :: a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top gen_a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top2_0 :: Nat -> a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top Lemmas: g(gen_a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top2_0(+(1, n8_0))) -> *3_0, rt in Omega(n8_0) Generator Equations: gen_a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top2_0(0) <=> a gen_a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top2_0(+(x, 1)) <=> mark(gen_a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top2_0(x)) The following defined symbols remain to be analysed: active, proper, top, encArg They will be analysed ascendingly in the following order: active < top active < encArg proper < top proper < encArg top < encArg ---------------------------------------- (17) RewriteLemmaProof (LOWER BOUND(ID)) Proved the following rewrite lemma: encArg(gen_a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top2_0(n506_0)) -> gen_a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top2_0(n506_0), rt in Omega(0) Induction Base: encArg(gen_a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top2_0(0)) ->_R^Omega(0) a Induction Step: encArg(gen_a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top2_0(+(n506_0, 1))) ->_R^Omega(0) mark(encArg(gen_a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top2_0(n506_0))) ->_IH mark(gen_a:mark:ok:cons_active:cons_g:cons_proper:cons_f:cons_top2_0(c507_0)) We have rt in Omega(1) and sz in O(n). Thus, we have irc_R in Omega(n^0). ---------------------------------------- (18) BOUNDS(1, INF)