/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), 262 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), 0 ms] (10) typed CpxTrs (11) RewriteLemmaProof [LOWER BOUND(ID), 436 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), 133 ms] (18) typed CpxTrs (19) RewriteLemmaProof [LOWER BOUND(ID), 121 ms] (20) typed CpxTrs (21) RewriteLemmaProof [LOWER BOUND(ID), 243 ms] (22) 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(h(X)) -> mark(g(X, X)) active(g(a, X)) -> mark(f(b, X)) active(f(X, X)) -> mark(h(a)) active(a) -> mark(b) active(h(X)) -> h(active(X)) active(g(X1, X2)) -> g(active(X1), X2) active(f(X1, X2)) -> f(active(X1), X2) h(mark(X)) -> mark(h(X)) g(mark(X1), X2) -> mark(g(X1, X2)) f(mark(X1), X2) -> mark(f(X1, X2)) proper(h(X)) -> h(proper(X)) proper(g(X1, X2)) -> g(proper(X1), proper(X2)) proper(a) -> ok(a) proper(f(X1, X2)) -> f(proper(X1), proper(X2)) proper(b) -> ok(b) h(ok(X)) -> ok(h(X)) g(ok(X1), ok(X2)) -> ok(g(X1, X2)) f(ok(X1), ok(X2)) -> ok(f(X1, X2)) 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(mark(x_1)) -> mark(encArg(x_1)) encArg(a) -> a encArg(b) -> b encArg(ok(x_1)) -> ok(encArg(x_1)) encArg(cons_active(x_1)) -> active(encArg(x_1)) encArg(cons_h(x_1)) -> h(encArg(x_1)) encArg(cons_g(x_1, x_2)) -> g(encArg(x_1), encArg(x_2)) encArg(cons_f(x_1, x_2)) -> f(encArg(x_1), encArg(x_2)) encArg(cons_proper(x_1)) -> proper(encArg(x_1)) encArg(cons_top(x_1)) -> top(encArg(x_1)) encode_active(x_1) -> active(encArg(x_1)) encode_h(x_1) -> h(encArg(x_1)) encode_mark(x_1) -> mark(encArg(x_1)) encode_g(x_1, x_2) -> g(encArg(x_1), encArg(x_2)) encode_a -> a encode_f(x_1, x_2) -> f(encArg(x_1), encArg(x_2)) encode_b -> b 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(h(X)) -> mark(g(X, X)) active(g(a, X)) -> mark(f(b, X)) active(f(X, X)) -> mark(h(a)) active(a) -> mark(b) active(h(X)) -> h(active(X)) active(g(X1, X2)) -> g(active(X1), X2) active(f(X1, X2)) -> f(active(X1), X2) h(mark(X)) -> mark(h(X)) g(mark(X1), X2) -> mark(g(X1, X2)) f(mark(X1), X2) -> mark(f(X1, X2)) proper(h(X)) -> h(proper(X)) proper(g(X1, X2)) -> g(proper(X1), proper(X2)) proper(a) -> ok(a) proper(f(X1, X2)) -> f(proper(X1), proper(X2)) proper(b) -> ok(b) h(ok(X)) -> ok(h(X)) g(ok(X1), ok(X2)) -> ok(g(X1, X2)) f(ok(X1), ok(X2)) -> ok(f(X1, X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) The (relative) TRS S consists of the following rules: encArg(mark(x_1)) -> mark(encArg(x_1)) encArg(a) -> a encArg(b) -> b encArg(ok(x_1)) -> ok(encArg(x_1)) encArg(cons_active(x_1)) -> active(encArg(x_1)) encArg(cons_h(x_1)) -> h(encArg(x_1)) encArg(cons_g(x_1, x_2)) -> g(encArg(x_1), encArg(x_2)) encArg(cons_f(x_1, x_2)) -> f(encArg(x_1), encArg(x_2)) encArg(cons_proper(x_1)) -> proper(encArg(x_1)) encArg(cons_top(x_1)) -> top(encArg(x_1)) encode_active(x_1) -> active(encArg(x_1)) encode_h(x_1) -> h(encArg(x_1)) encode_mark(x_1) -> mark(encArg(x_1)) encode_g(x_1, x_2) -> g(encArg(x_1), encArg(x_2)) encode_a -> a encode_f(x_1, x_2) -> f(encArg(x_1), encArg(x_2)) encode_b -> b 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(h(X)) -> mark(g(X, X)) active(g(a, X)) -> mark(f(b, X)) active(f(X, X)) -> mark(h(a)) active(a) -> mark(b) active(h(X)) -> h(active(X)) active(g(X1, X2)) -> g(active(X1), X2) active(f(X1, X2)) -> f(active(X1), X2) h(mark(X)) -> mark(h(X)) g(mark(X1), X2) -> mark(g(X1, X2)) f(mark(X1), X2) -> mark(f(X1, X2)) proper(h(X)) -> h(proper(X)) proper(g(X1, X2)) -> g(proper(X1), proper(X2)) proper(a) -> ok(a) proper(f(X1, X2)) -> f(proper(X1), proper(X2)) proper(b) -> ok(b) h(ok(X)) -> ok(h(X)) g(ok(X1), ok(X2)) -> ok(g(X1, X2)) f(ok(X1), ok(X2)) -> ok(f(X1, X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) The (relative) TRS S consists of the following rules: encArg(mark(x_1)) -> mark(encArg(x_1)) encArg(a) -> a encArg(b) -> b encArg(ok(x_1)) -> ok(encArg(x_1)) encArg(cons_active(x_1)) -> active(encArg(x_1)) encArg(cons_h(x_1)) -> h(encArg(x_1)) encArg(cons_g(x_1, x_2)) -> g(encArg(x_1), encArg(x_2)) encArg(cons_f(x_1, x_2)) -> f(encArg(x_1), encArg(x_2)) encArg(cons_proper(x_1)) -> proper(encArg(x_1)) encArg(cons_top(x_1)) -> top(encArg(x_1)) encode_active(x_1) -> active(encArg(x_1)) encode_h(x_1) -> h(encArg(x_1)) encode_mark(x_1) -> mark(encArg(x_1)) encode_g(x_1, x_2) -> g(encArg(x_1), encArg(x_2)) encode_a -> a encode_f(x_1, x_2) -> f(encArg(x_1), encArg(x_2)) encode_b -> b 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(h(X)) -> mark(g(X, X)) active(g(a, X)) -> mark(f(b, X)) active(f(X, X)) -> mark(h(a)) active(a) -> mark(b) active(h(X)) -> h(active(X)) active(g(X1, X2)) -> g(active(X1), X2) active(f(X1, X2)) -> f(active(X1), X2) h(mark(X)) -> mark(h(X)) g(mark(X1), X2) -> mark(g(X1, X2)) f(mark(X1), X2) -> mark(f(X1, X2)) proper(h(X)) -> h(proper(X)) proper(g(X1, X2)) -> g(proper(X1), proper(X2)) proper(a) -> ok(a) proper(f(X1, X2)) -> f(proper(X1), proper(X2)) proper(b) -> ok(b) h(ok(X)) -> ok(h(X)) g(ok(X1), ok(X2)) -> ok(g(X1, X2)) f(ok(X1), ok(X2)) -> ok(f(X1, X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) The (relative) TRS S consists of the following rules: encArg(mark(x_1)) -> mark(encArg(x_1)) encArg(a) -> a encArg(b) -> b encArg(ok(x_1)) -> ok(encArg(x_1)) encArg(cons_active(x_1)) -> active(encArg(x_1)) encArg(cons_h(x_1)) -> h(encArg(x_1)) encArg(cons_g(x_1, x_2)) -> g(encArg(x_1), encArg(x_2)) encArg(cons_f(x_1, x_2)) -> f(encArg(x_1), encArg(x_2)) encArg(cons_proper(x_1)) -> proper(encArg(x_1)) encArg(cons_top(x_1)) -> top(encArg(x_1)) encode_active(x_1) -> active(encArg(x_1)) encode_h(x_1) -> h(encArg(x_1)) encode_mark(x_1) -> mark(encArg(x_1)) encode_g(x_1, x_2) -> g(encArg(x_1), encArg(x_2)) encode_a -> a encode_f(x_1, x_2) -> f(encArg(x_1), encArg(x_2)) encode_b -> b 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(h(X)) -> mark(g(X, X)) active(g(a, X)) -> mark(f(b, X)) active(f(X, X)) -> mark(h(a)) active(a) -> mark(b) active(h(X)) -> h(active(X)) active(g(X1, X2)) -> g(active(X1), X2) active(f(X1, X2)) -> f(active(X1), X2) h(mark(X)) -> mark(h(X)) g(mark(X1), X2) -> mark(g(X1, X2)) f(mark(X1), X2) -> mark(f(X1, X2)) proper(h(X)) -> h(proper(X)) proper(g(X1, X2)) -> g(proper(X1), proper(X2)) proper(a) -> ok(a) proper(f(X1, X2)) -> f(proper(X1), proper(X2)) proper(b) -> ok(b) h(ok(X)) -> ok(h(X)) g(ok(X1), ok(X2)) -> ok(g(X1, X2)) f(ok(X1), ok(X2)) -> ok(f(X1, X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) encArg(mark(x_1)) -> mark(encArg(x_1)) encArg(a) -> a encArg(b) -> b encArg(ok(x_1)) -> ok(encArg(x_1)) encArg(cons_active(x_1)) -> active(encArg(x_1)) encArg(cons_h(x_1)) -> h(encArg(x_1)) encArg(cons_g(x_1, x_2)) -> g(encArg(x_1), encArg(x_2)) encArg(cons_f(x_1, x_2)) -> f(encArg(x_1), encArg(x_2)) encArg(cons_proper(x_1)) -> proper(encArg(x_1)) encArg(cons_top(x_1)) -> top(encArg(x_1)) encode_active(x_1) -> active(encArg(x_1)) encode_h(x_1) -> h(encArg(x_1)) encode_mark(x_1) -> mark(encArg(x_1)) encode_g(x_1, x_2) -> g(encArg(x_1), encArg(x_2)) encode_a -> a encode_f(x_1, x_2) -> f(encArg(x_1), encArg(x_2)) encode_b -> b 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 :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top h :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top mark :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top g :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top a :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top f :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top b :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top proper :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top ok :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top top :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encArg :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top cons_active :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top cons_h :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top cons_g :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top cons_f :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top cons_proper :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top cons_top :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_active :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_h :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_mark :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_g :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_a :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_f :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_b :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_proper :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_ok :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_top :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top hole_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top1_0 :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0 :: Nat -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top ---------------------------------------- (9) OrderProof (LOWER BOUND(ID)) Heuristically decided to analyse the following defined symbols: active, g, f, h, proper, top, encArg They will be analysed ascendingly in the following order: g < active f < active h < active active < top active < encArg g < proper g < encArg f < proper f < encArg h < proper h < encArg proper < top proper < encArg top < encArg ---------------------------------------- (10) Obligation: Innermost TRS: Rules: active(h(X)) -> mark(g(X, X)) active(g(a, X)) -> mark(f(b, X)) active(f(X, X)) -> mark(h(a)) active(a) -> mark(b) active(h(X)) -> h(active(X)) active(g(X1, X2)) -> g(active(X1), X2) active(f(X1, X2)) -> f(active(X1), X2) h(mark(X)) -> mark(h(X)) g(mark(X1), X2) -> mark(g(X1, X2)) f(mark(X1), X2) -> mark(f(X1, X2)) proper(h(X)) -> h(proper(X)) proper(g(X1, X2)) -> g(proper(X1), proper(X2)) proper(a) -> ok(a) proper(f(X1, X2)) -> f(proper(X1), proper(X2)) proper(b) -> ok(b) h(ok(X)) -> ok(h(X)) g(ok(X1), ok(X2)) -> ok(g(X1, X2)) f(ok(X1), ok(X2)) -> ok(f(X1, X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) encArg(mark(x_1)) -> mark(encArg(x_1)) encArg(a) -> a encArg(b) -> b encArg(ok(x_1)) -> ok(encArg(x_1)) encArg(cons_active(x_1)) -> active(encArg(x_1)) encArg(cons_h(x_1)) -> h(encArg(x_1)) encArg(cons_g(x_1, x_2)) -> g(encArg(x_1), encArg(x_2)) encArg(cons_f(x_1, x_2)) -> f(encArg(x_1), encArg(x_2)) encArg(cons_proper(x_1)) -> proper(encArg(x_1)) encArg(cons_top(x_1)) -> top(encArg(x_1)) encode_active(x_1) -> active(encArg(x_1)) encode_h(x_1) -> h(encArg(x_1)) encode_mark(x_1) -> mark(encArg(x_1)) encode_g(x_1, x_2) -> g(encArg(x_1), encArg(x_2)) encode_a -> a encode_f(x_1, x_2) -> f(encArg(x_1), encArg(x_2)) encode_b -> b 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 :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top h :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top mark :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top g :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top a :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top f :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top b :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top proper :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top ok :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top top :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encArg :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top cons_active :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top cons_h :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top cons_g :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top cons_f :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top cons_proper :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top cons_top :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_active :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_h :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_mark :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_g :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_a :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_f :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_b :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_proper :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_ok :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_top :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top hole_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top1_0 :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0 :: Nat -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top Generator Equations: gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(0) <=> a gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(+(x, 1)) <=> mark(gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(x)) The following defined symbols remain to be analysed: g, active, f, h, proper, top, encArg They will be analysed ascendingly in the following order: g < active f < active h < active active < top active < encArg g < proper g < encArg f < proper f < encArg h < proper h < encArg proper < top proper < encArg top < encArg ---------------------------------------- (11) RewriteLemmaProof (LOWER BOUND(ID)) Proved the following rewrite lemma: g(gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(+(1, n4_0)), gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(b)) -> *3_0, rt in Omega(n4_0) Induction Base: g(gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(+(1, 0)), gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(b)) Induction Step: g(gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(+(1, +(n4_0, 1))), gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(b)) ->_R^Omega(1) mark(g(gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(+(1, n4_0)), gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(b))) ->_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(h(X)) -> mark(g(X, X)) active(g(a, X)) -> mark(f(b, X)) active(f(X, X)) -> mark(h(a)) active(a) -> mark(b) active(h(X)) -> h(active(X)) active(g(X1, X2)) -> g(active(X1), X2) active(f(X1, X2)) -> f(active(X1), X2) h(mark(X)) -> mark(h(X)) g(mark(X1), X2) -> mark(g(X1, X2)) f(mark(X1), X2) -> mark(f(X1, X2)) proper(h(X)) -> h(proper(X)) proper(g(X1, X2)) -> g(proper(X1), proper(X2)) proper(a) -> ok(a) proper(f(X1, X2)) -> f(proper(X1), proper(X2)) proper(b) -> ok(b) h(ok(X)) -> ok(h(X)) g(ok(X1), ok(X2)) -> ok(g(X1, X2)) f(ok(X1), ok(X2)) -> ok(f(X1, X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) encArg(mark(x_1)) -> mark(encArg(x_1)) encArg(a) -> a encArg(b) -> b encArg(ok(x_1)) -> ok(encArg(x_1)) encArg(cons_active(x_1)) -> active(encArg(x_1)) encArg(cons_h(x_1)) -> h(encArg(x_1)) encArg(cons_g(x_1, x_2)) -> g(encArg(x_1), encArg(x_2)) encArg(cons_f(x_1, x_2)) -> f(encArg(x_1), encArg(x_2)) encArg(cons_proper(x_1)) -> proper(encArg(x_1)) encArg(cons_top(x_1)) -> top(encArg(x_1)) encode_active(x_1) -> active(encArg(x_1)) encode_h(x_1) -> h(encArg(x_1)) encode_mark(x_1) -> mark(encArg(x_1)) encode_g(x_1, x_2) -> g(encArg(x_1), encArg(x_2)) encode_a -> a encode_f(x_1, x_2) -> f(encArg(x_1), encArg(x_2)) encode_b -> b 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 :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top h :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top mark :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top g :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top a :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top f :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top b :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top proper :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top ok :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top top :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encArg :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top cons_active :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top cons_h :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top cons_g :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top cons_f :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top cons_proper :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top cons_top :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_active :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_h :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_mark :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_g :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_a :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_f :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_b :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_proper :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_ok :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_top :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top hole_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top1_0 :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0 :: Nat -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top Generator Equations: gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(0) <=> a gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(+(x, 1)) <=> mark(gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(x)) The following defined symbols remain to be analysed: g, active, f, h, proper, top, encArg They will be analysed ascendingly in the following order: g < active f < active h < active active < top active < encArg g < proper g < encArg f < proper f < encArg h < proper h < encArg proper < top proper < encArg top < encArg ---------------------------------------- (14) LowerBoundPropagationProof (FINISHED) Propagated lower bound. ---------------------------------------- (15) BOUNDS(n^1, INF) ---------------------------------------- (16) Obligation: Innermost TRS: Rules: active(h(X)) -> mark(g(X, X)) active(g(a, X)) -> mark(f(b, X)) active(f(X, X)) -> mark(h(a)) active(a) -> mark(b) active(h(X)) -> h(active(X)) active(g(X1, X2)) -> g(active(X1), X2) active(f(X1, X2)) -> f(active(X1), X2) h(mark(X)) -> mark(h(X)) g(mark(X1), X2) -> mark(g(X1, X2)) f(mark(X1), X2) -> mark(f(X1, X2)) proper(h(X)) -> h(proper(X)) proper(g(X1, X2)) -> g(proper(X1), proper(X2)) proper(a) -> ok(a) proper(f(X1, X2)) -> f(proper(X1), proper(X2)) proper(b) -> ok(b) h(ok(X)) -> ok(h(X)) g(ok(X1), ok(X2)) -> ok(g(X1, X2)) f(ok(X1), ok(X2)) -> ok(f(X1, X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) encArg(mark(x_1)) -> mark(encArg(x_1)) encArg(a) -> a encArg(b) -> b encArg(ok(x_1)) -> ok(encArg(x_1)) encArg(cons_active(x_1)) -> active(encArg(x_1)) encArg(cons_h(x_1)) -> h(encArg(x_1)) encArg(cons_g(x_1, x_2)) -> g(encArg(x_1), encArg(x_2)) encArg(cons_f(x_1, x_2)) -> f(encArg(x_1), encArg(x_2)) encArg(cons_proper(x_1)) -> proper(encArg(x_1)) encArg(cons_top(x_1)) -> top(encArg(x_1)) encode_active(x_1) -> active(encArg(x_1)) encode_h(x_1) -> h(encArg(x_1)) encode_mark(x_1) -> mark(encArg(x_1)) encode_g(x_1, x_2) -> g(encArg(x_1), encArg(x_2)) encode_a -> a encode_f(x_1, x_2) -> f(encArg(x_1), encArg(x_2)) encode_b -> b 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 :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top h :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top mark :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top g :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top a :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top f :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top b :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top proper :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top ok :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top top :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encArg :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top cons_active :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top cons_h :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top cons_g :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top cons_f :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top cons_proper :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top cons_top :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_active :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_h :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_mark :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_g :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_a :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_f :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_b :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_proper :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_ok :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_top :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top hole_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top1_0 :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0 :: Nat -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top Lemmas: g(gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(+(1, n4_0)), gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(b)) -> *3_0, rt in Omega(n4_0) Generator Equations: gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(0) <=> a gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(+(x, 1)) <=> mark(gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(x)) The following defined symbols remain to be analysed: f, active, h, proper, top, encArg They will be analysed ascendingly in the following order: f < active h < active active < top active < encArg f < proper f < encArg h < proper h < encArg proper < top proper < encArg top < encArg ---------------------------------------- (17) RewriteLemmaProof (LOWER BOUND(ID)) Proved the following rewrite lemma: f(gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(+(1, n1241_0)), gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(b)) -> *3_0, rt in Omega(n1241_0) Induction Base: f(gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(+(1, 0)), gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(b)) Induction Step: f(gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(+(1, +(n1241_0, 1))), gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(b)) ->_R^Omega(1) mark(f(gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(+(1, n1241_0)), gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(b))) ->_IH mark(*3_0) 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: active(h(X)) -> mark(g(X, X)) active(g(a, X)) -> mark(f(b, X)) active(f(X, X)) -> mark(h(a)) active(a) -> mark(b) active(h(X)) -> h(active(X)) active(g(X1, X2)) -> g(active(X1), X2) active(f(X1, X2)) -> f(active(X1), X2) h(mark(X)) -> mark(h(X)) g(mark(X1), X2) -> mark(g(X1, X2)) f(mark(X1), X2) -> mark(f(X1, X2)) proper(h(X)) -> h(proper(X)) proper(g(X1, X2)) -> g(proper(X1), proper(X2)) proper(a) -> ok(a) proper(f(X1, X2)) -> f(proper(X1), proper(X2)) proper(b) -> ok(b) h(ok(X)) -> ok(h(X)) g(ok(X1), ok(X2)) -> ok(g(X1, X2)) f(ok(X1), ok(X2)) -> ok(f(X1, X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) encArg(mark(x_1)) -> mark(encArg(x_1)) encArg(a) -> a encArg(b) -> b encArg(ok(x_1)) -> ok(encArg(x_1)) encArg(cons_active(x_1)) -> active(encArg(x_1)) encArg(cons_h(x_1)) -> h(encArg(x_1)) encArg(cons_g(x_1, x_2)) -> g(encArg(x_1), encArg(x_2)) encArg(cons_f(x_1, x_2)) -> f(encArg(x_1), encArg(x_2)) encArg(cons_proper(x_1)) -> proper(encArg(x_1)) encArg(cons_top(x_1)) -> top(encArg(x_1)) encode_active(x_1) -> active(encArg(x_1)) encode_h(x_1) -> h(encArg(x_1)) encode_mark(x_1) -> mark(encArg(x_1)) encode_g(x_1, x_2) -> g(encArg(x_1), encArg(x_2)) encode_a -> a encode_f(x_1, x_2) -> f(encArg(x_1), encArg(x_2)) encode_b -> b 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 :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top h :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top mark :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top g :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top a :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top f :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top b :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top proper :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top ok :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top top :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encArg :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top cons_active :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top cons_h :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top cons_g :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top cons_f :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top cons_proper :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top cons_top :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_active :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_h :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_mark :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_g :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_a :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_f :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_b :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_proper :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_ok :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_top :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top hole_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top1_0 :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0 :: Nat -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top Lemmas: g(gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(+(1, n4_0)), gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(b)) -> *3_0, rt in Omega(n4_0) f(gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(+(1, n1241_0)), gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(b)) -> *3_0, rt in Omega(n1241_0) Generator Equations: gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(0) <=> a gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(+(x, 1)) <=> mark(gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(x)) The following defined symbols remain to be analysed: h, active, proper, top, encArg They will be analysed ascendingly in the following order: h < active active < top active < encArg h < proper h < encArg proper < top proper < encArg top < encArg ---------------------------------------- (19) RewriteLemmaProof (LOWER BOUND(ID)) Proved the following rewrite lemma: h(gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(+(1, n2784_0))) -> *3_0, rt in Omega(n2784_0) Induction Base: h(gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(+(1, 0))) Induction Step: h(gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(+(1, +(n2784_0, 1)))) ->_R^Omega(1) mark(h(gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(+(1, n2784_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). ---------------------------------------- (20) Obligation: Innermost TRS: Rules: active(h(X)) -> mark(g(X, X)) active(g(a, X)) -> mark(f(b, X)) active(f(X, X)) -> mark(h(a)) active(a) -> mark(b) active(h(X)) -> h(active(X)) active(g(X1, X2)) -> g(active(X1), X2) active(f(X1, X2)) -> f(active(X1), X2) h(mark(X)) -> mark(h(X)) g(mark(X1), X2) -> mark(g(X1, X2)) f(mark(X1), X2) -> mark(f(X1, X2)) proper(h(X)) -> h(proper(X)) proper(g(X1, X2)) -> g(proper(X1), proper(X2)) proper(a) -> ok(a) proper(f(X1, X2)) -> f(proper(X1), proper(X2)) proper(b) -> ok(b) h(ok(X)) -> ok(h(X)) g(ok(X1), ok(X2)) -> ok(g(X1, X2)) f(ok(X1), ok(X2)) -> ok(f(X1, X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) encArg(mark(x_1)) -> mark(encArg(x_1)) encArg(a) -> a encArg(b) -> b encArg(ok(x_1)) -> ok(encArg(x_1)) encArg(cons_active(x_1)) -> active(encArg(x_1)) encArg(cons_h(x_1)) -> h(encArg(x_1)) encArg(cons_g(x_1, x_2)) -> g(encArg(x_1), encArg(x_2)) encArg(cons_f(x_1, x_2)) -> f(encArg(x_1), encArg(x_2)) encArg(cons_proper(x_1)) -> proper(encArg(x_1)) encArg(cons_top(x_1)) -> top(encArg(x_1)) encode_active(x_1) -> active(encArg(x_1)) encode_h(x_1) -> h(encArg(x_1)) encode_mark(x_1) -> mark(encArg(x_1)) encode_g(x_1, x_2) -> g(encArg(x_1), encArg(x_2)) encode_a -> a encode_f(x_1, x_2) -> f(encArg(x_1), encArg(x_2)) encode_b -> b 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 :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top h :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top mark :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top g :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top a :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top f :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top b :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top proper :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top ok :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top top :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encArg :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top cons_active :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top cons_h :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top cons_g :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top cons_f :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top cons_proper :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top cons_top :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_active :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_h :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_mark :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_g :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_a :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_f :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_b :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_proper :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_ok :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top encode_top :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top hole_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top1_0 :: mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0 :: Nat -> mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top Lemmas: g(gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(+(1, n4_0)), gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(b)) -> *3_0, rt in Omega(n4_0) f(gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(+(1, n1241_0)), gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(b)) -> *3_0, rt in Omega(n1241_0) h(gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(+(1, n2784_0))) -> *3_0, rt in Omega(n2784_0) Generator Equations: gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(0) <=> a gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(+(x, 1)) <=> mark(gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper: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 ---------------------------------------- (21) RewriteLemmaProof (LOWER BOUND(ID)) Proved the following rewrite lemma: encArg(gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(n4529_0)) -> gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(n4529_0), rt in Omega(0) Induction Base: encArg(gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(0)) ->_R^Omega(0) a Induction Step: encArg(gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(+(n4529_0, 1))) ->_R^Omega(0) mark(encArg(gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(n4529_0))) ->_IH mark(gen_mark:a:b:ok:cons_active:cons_h:cons_g:cons_f:cons_proper:cons_top2_0(c4530_0)) We have rt in Omega(1) and sz in O(n). Thus, we have irc_R in Omega(n^0). ---------------------------------------- (22) BOUNDS(1, INF)