/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), 63 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), 77.0 s] (12) BEST (13) proven lower bound (14) LowerBoundPropagationProof [FINISHED, 0 ms] (15) BOUNDS(n^1, INF) (16) typed CpxTrs ---------------------------------------- (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: sq(0(x1)) -> p(s(p(s(p(p(p(p(s(s(s(s(0(p(s(p(s(x1))))))))))))))))) sq(s(x1)) -> s(p(s(p(s(p(p(s(s(twice(p(s(p(s(p(p(p(s(s(s(sq(p(p(p(p(p(p(s(s(s(s(s(s(x1))))))))))))))))))))))))))))))))) twice(0(x1)) -> p(p(p(p(s(s(p(s(s(s(0(p(p(p(s(s(s(p(p(s(s(p(s(p(s(p(s(x1))))))))))))))))))))))))))) twice(s(x1)) -> p(p(s(s(s(p(p(s(s(s(twice(p(s(p(s(x1))))))))))))))) p(p(s(x1))) -> p(x1) p(s(x1)) -> x1 p(0(x1)) -> 0(s(s(s(s(s(s(s(s(s(s(s(x1)))))))))))) 0(x1) -> x1 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(s(x_1)) -> s(encArg(x_1)) encArg(cons_sq(x_1)) -> sq(encArg(x_1)) encArg(cons_twice(x_1)) -> twice(encArg(x_1)) encArg(cons_p(x_1)) -> p(encArg(x_1)) encArg(cons_0(x_1)) -> 0(encArg(x_1)) encode_sq(x_1) -> sq(encArg(x_1)) encode_0(x_1) -> 0(encArg(x_1)) encode_p(x_1) -> p(encArg(x_1)) encode_s(x_1) -> s(encArg(x_1)) encode_twice(x_1) -> twice(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: sq(0(x1)) -> p(s(p(s(p(p(p(p(s(s(s(s(0(p(s(p(s(x1))))))))))))))))) sq(s(x1)) -> s(p(s(p(s(p(p(s(s(twice(p(s(p(s(p(p(p(s(s(s(sq(p(p(p(p(p(p(s(s(s(s(s(s(x1))))))))))))))))))))))))))))))))) twice(0(x1)) -> p(p(p(p(s(s(p(s(s(s(0(p(p(p(s(s(s(p(p(s(s(p(s(p(s(p(s(x1))))))))))))))))))))))))))) twice(s(x1)) -> p(p(s(s(s(p(p(s(s(s(twice(p(s(p(s(x1))))))))))))))) p(p(s(x1))) -> p(x1) p(s(x1)) -> x1 p(0(x1)) -> 0(s(s(s(s(s(s(s(s(s(s(s(x1)))))))))))) 0(x1) -> x1 The (relative) TRS S consists of the following rules: encArg(s(x_1)) -> s(encArg(x_1)) encArg(cons_sq(x_1)) -> sq(encArg(x_1)) encArg(cons_twice(x_1)) -> twice(encArg(x_1)) encArg(cons_p(x_1)) -> p(encArg(x_1)) encArg(cons_0(x_1)) -> 0(encArg(x_1)) encode_sq(x_1) -> sq(encArg(x_1)) encode_0(x_1) -> 0(encArg(x_1)) encode_p(x_1) -> p(encArg(x_1)) encode_s(x_1) -> s(encArg(x_1)) encode_twice(x_1) -> twice(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: sq(0(x1)) -> p(s(p(s(p(p(p(p(s(s(s(s(0(p(s(p(s(x1))))))))))))))))) sq(s(x1)) -> s(p(s(p(s(p(p(s(s(twice(p(s(p(s(p(p(p(s(s(s(sq(p(p(p(p(p(p(s(s(s(s(s(s(x1))))))))))))))))))))))))))))))))) twice(0(x1)) -> p(p(p(p(s(s(p(s(s(s(0(p(p(p(s(s(s(p(p(s(s(p(s(p(s(p(s(x1))))))))))))))))))))))))))) twice(s(x1)) -> p(p(s(s(s(p(p(s(s(s(twice(p(s(p(s(x1))))))))))))))) p(p(s(x1))) -> p(x1) p(s(x1)) -> x1 p(0(x1)) -> 0(s(s(s(s(s(s(s(s(s(s(s(x1)))))))))))) 0(x1) -> x1 The (relative) TRS S consists of the following rules: encArg(s(x_1)) -> s(encArg(x_1)) encArg(cons_sq(x_1)) -> sq(encArg(x_1)) encArg(cons_twice(x_1)) -> twice(encArg(x_1)) encArg(cons_p(x_1)) -> p(encArg(x_1)) encArg(cons_0(x_1)) -> 0(encArg(x_1)) encode_sq(x_1) -> sq(encArg(x_1)) encode_0(x_1) -> 0(encArg(x_1)) encode_p(x_1) -> p(encArg(x_1)) encode_s(x_1) -> s(encArg(x_1)) encode_twice(x_1) -> twice(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: sq(0(x1)) -> p(s(p(s(p(p(p(p(s(s(s(s(0(p(s(p(s(x1))))))))))))))))) sq(s(x1)) -> s(p(s(p(s(p(p(s(s(twice(p(s(p(s(p(p(p(s(s(s(sq(p(p(p(p(p(p(s(s(s(s(s(s(x1))))))))))))))))))))))))))))))))) twice(0(x1)) -> p(p(p(p(s(s(p(s(s(s(0(p(p(p(s(s(s(p(p(s(s(p(s(p(s(p(s(x1))))))))))))))))))))))))))) twice(s(x1)) -> p(p(s(s(s(p(p(s(s(s(twice(p(s(p(s(x1))))))))))))))) p(p(s(x1))) -> p(x1) p(s(x1)) -> x1 p(0(x1)) -> 0(s(s(s(s(s(s(s(s(s(s(s(x1)))))))))))) 0(x1) -> x1 The (relative) TRS S consists of the following rules: encArg(s(x_1)) -> s(encArg(x_1)) encArg(cons_sq(x_1)) -> sq(encArg(x_1)) encArg(cons_twice(x_1)) -> twice(encArg(x_1)) encArg(cons_p(x_1)) -> p(encArg(x_1)) encArg(cons_0(x_1)) -> 0(encArg(x_1)) encode_sq(x_1) -> sq(encArg(x_1)) encode_0(x_1) -> 0(encArg(x_1)) encode_p(x_1) -> p(encArg(x_1)) encode_s(x_1) -> s(encArg(x_1)) encode_twice(x_1) -> twice(encArg(x_1)) Rewrite Strategy: INNERMOST ---------------------------------------- (7) TypeInferenceProof (BOTH BOUNDS(ID, ID)) Infered types. ---------------------------------------- (8) Obligation: Innermost TRS: Rules: sq(0(x1)) -> p(s(p(s(p(p(p(p(s(s(s(s(0(p(s(p(s(x1))))))))))))))))) sq(s(x1)) -> s(p(s(p(s(p(p(s(s(twice(p(s(p(s(p(p(p(s(s(s(sq(p(p(p(p(p(p(s(s(s(s(s(s(x1))))))))))))))))))))))))))))))))) twice(0(x1)) -> p(p(p(p(s(s(p(s(s(s(0(p(p(p(s(s(s(p(p(s(s(p(s(p(s(p(s(x1))))))))))))))))))))))))))) twice(s(x1)) -> p(p(s(s(s(p(p(s(s(s(twice(p(s(p(s(x1))))))))))))))) p(p(s(x1))) -> p(x1) p(s(x1)) -> x1 p(0(x1)) -> 0(s(s(s(s(s(s(s(s(s(s(s(x1)))))))))))) 0(x1) -> x1 encArg(s(x_1)) -> s(encArg(x_1)) encArg(cons_sq(x_1)) -> sq(encArg(x_1)) encArg(cons_twice(x_1)) -> twice(encArg(x_1)) encArg(cons_p(x_1)) -> p(encArg(x_1)) encArg(cons_0(x_1)) -> 0(encArg(x_1)) encode_sq(x_1) -> sq(encArg(x_1)) encode_0(x_1) -> 0(encArg(x_1)) encode_p(x_1) -> p(encArg(x_1)) encode_s(x_1) -> s(encArg(x_1)) encode_twice(x_1) -> twice(encArg(x_1)) Types: sq :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 0 :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 p :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 s :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 twice :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 encArg :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 cons_sq :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 cons_twice :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 cons_p :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 cons_0 :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 encode_sq :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 encode_0 :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 encode_p :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 encode_s :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 encode_twice :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 hole_s:cons_sq:cons_twice:cons_p:cons_01_2 :: s:cons_sq:cons_twice:cons_p:cons_0 gen_s:cons_sq:cons_twice:cons_p:cons_02_2 :: Nat -> s:cons_sq:cons_twice:cons_p:cons_0 ---------------------------------------- (9) OrderProof (LOWER BOUND(ID)) Heuristically decided to analyse the following defined symbols: sq, p, twice, encArg They will be analysed ascendingly in the following order: p < sq twice < sq sq < encArg p < twice p < encArg twice < encArg ---------------------------------------- (10) Obligation: Innermost TRS: Rules: sq(0(x1)) -> p(s(p(s(p(p(p(p(s(s(s(s(0(p(s(p(s(x1))))))))))))))))) sq(s(x1)) -> s(p(s(p(s(p(p(s(s(twice(p(s(p(s(p(p(p(s(s(s(sq(p(p(p(p(p(p(s(s(s(s(s(s(x1))))))))))))))))))))))))))))))))) twice(0(x1)) -> p(p(p(p(s(s(p(s(s(s(0(p(p(p(s(s(s(p(p(s(s(p(s(p(s(p(s(x1))))))))))))))))))))))))))) twice(s(x1)) -> p(p(s(s(s(p(p(s(s(s(twice(p(s(p(s(x1))))))))))))))) p(p(s(x1))) -> p(x1) p(s(x1)) -> x1 p(0(x1)) -> 0(s(s(s(s(s(s(s(s(s(s(s(x1)))))))))))) 0(x1) -> x1 encArg(s(x_1)) -> s(encArg(x_1)) encArg(cons_sq(x_1)) -> sq(encArg(x_1)) encArg(cons_twice(x_1)) -> twice(encArg(x_1)) encArg(cons_p(x_1)) -> p(encArg(x_1)) encArg(cons_0(x_1)) -> 0(encArg(x_1)) encode_sq(x_1) -> sq(encArg(x_1)) encode_0(x_1) -> 0(encArg(x_1)) encode_p(x_1) -> p(encArg(x_1)) encode_s(x_1) -> s(encArg(x_1)) encode_twice(x_1) -> twice(encArg(x_1)) Types: sq :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 0 :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 p :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 s :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 twice :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 encArg :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 cons_sq :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 cons_twice :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 cons_p :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 cons_0 :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 encode_sq :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 encode_0 :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 encode_p :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 encode_s :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 encode_twice :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 hole_s:cons_sq:cons_twice:cons_p:cons_01_2 :: s:cons_sq:cons_twice:cons_p:cons_0 gen_s:cons_sq:cons_twice:cons_p:cons_02_2 :: Nat -> s:cons_sq:cons_twice:cons_p:cons_0 Generator Equations: gen_s:cons_sq:cons_twice:cons_p:cons_02_2(0) <=> hole_s:cons_sq:cons_twice:cons_p:cons_01_2 gen_s:cons_sq:cons_twice:cons_p:cons_02_2(+(x, 1)) <=> s(gen_s:cons_sq:cons_twice:cons_p:cons_02_2(x)) The following defined symbols remain to be analysed: p, sq, twice, encArg They will be analysed ascendingly in the following order: p < sq twice < sq sq < encArg p < twice p < encArg twice < encArg ---------------------------------------- (11) RewriteLemmaProof (LOWER BOUND(ID)) Proved the following rewrite lemma: twice(gen_s:cons_sq:cons_twice:cons_p:cons_02_2(+(1, n17_2))) -> *3_2, rt in Omega(n17_2) Induction Base: twice(gen_s:cons_sq:cons_twice:cons_p:cons_02_2(+(1, 0))) Induction Step: twice(gen_s:cons_sq:cons_twice:cons_p:cons_02_2(+(1, +(n17_2, 1)))) ->_R^Omega(1) p(p(s(s(s(p(p(s(s(s(twice(p(s(p(s(gen_s:cons_sq:cons_twice:cons_p:cons_02_2(+(1, n17_2))))))))))))))))) ->_R^Omega(1) p(p(s(s(s(p(p(s(s(s(twice(p(s(gen_s:cons_sq:cons_twice:cons_p:cons_02_2(+(1, n17_2))))))))))))))) ->_R^Omega(1) p(p(s(s(s(p(p(s(s(s(twice(gen_s:cons_sq:cons_twice:cons_p:cons_02_2(+(1, n17_2))))))))))))) ->_IH p(p(s(s(s(p(p(s(s(s(*3_2)))))))))) 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: sq(0(x1)) -> p(s(p(s(p(p(p(p(s(s(s(s(0(p(s(p(s(x1))))))))))))))))) sq(s(x1)) -> s(p(s(p(s(p(p(s(s(twice(p(s(p(s(p(p(p(s(s(s(sq(p(p(p(p(p(p(s(s(s(s(s(s(x1))))))))))))))))))))))))))))))))) twice(0(x1)) -> p(p(p(p(s(s(p(s(s(s(0(p(p(p(s(s(s(p(p(s(s(p(s(p(s(p(s(x1))))))))))))))))))))))))))) twice(s(x1)) -> p(p(s(s(s(p(p(s(s(s(twice(p(s(p(s(x1))))))))))))))) p(p(s(x1))) -> p(x1) p(s(x1)) -> x1 p(0(x1)) -> 0(s(s(s(s(s(s(s(s(s(s(s(x1)))))))))))) 0(x1) -> x1 encArg(s(x_1)) -> s(encArg(x_1)) encArg(cons_sq(x_1)) -> sq(encArg(x_1)) encArg(cons_twice(x_1)) -> twice(encArg(x_1)) encArg(cons_p(x_1)) -> p(encArg(x_1)) encArg(cons_0(x_1)) -> 0(encArg(x_1)) encode_sq(x_1) -> sq(encArg(x_1)) encode_0(x_1) -> 0(encArg(x_1)) encode_p(x_1) -> p(encArg(x_1)) encode_s(x_1) -> s(encArg(x_1)) encode_twice(x_1) -> twice(encArg(x_1)) Types: sq :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 0 :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 p :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 s :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 twice :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 encArg :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 cons_sq :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 cons_twice :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 cons_p :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 cons_0 :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 encode_sq :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 encode_0 :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 encode_p :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 encode_s :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 encode_twice :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 hole_s:cons_sq:cons_twice:cons_p:cons_01_2 :: s:cons_sq:cons_twice:cons_p:cons_0 gen_s:cons_sq:cons_twice:cons_p:cons_02_2 :: Nat -> s:cons_sq:cons_twice:cons_p:cons_0 Generator Equations: gen_s:cons_sq:cons_twice:cons_p:cons_02_2(0) <=> hole_s:cons_sq:cons_twice:cons_p:cons_01_2 gen_s:cons_sq:cons_twice:cons_p:cons_02_2(+(x, 1)) <=> s(gen_s:cons_sq:cons_twice:cons_p:cons_02_2(x)) The following defined symbols remain to be analysed: twice, sq, encArg They will be analysed ascendingly in the following order: twice < sq sq < encArg twice < encArg ---------------------------------------- (14) LowerBoundPropagationProof (FINISHED) Propagated lower bound. ---------------------------------------- (15) BOUNDS(n^1, INF) ---------------------------------------- (16) Obligation: Innermost TRS: Rules: sq(0(x1)) -> p(s(p(s(p(p(p(p(s(s(s(s(0(p(s(p(s(x1))))))))))))))))) sq(s(x1)) -> s(p(s(p(s(p(p(s(s(twice(p(s(p(s(p(p(p(s(s(s(sq(p(p(p(p(p(p(s(s(s(s(s(s(x1))))))))))))))))))))))))))))))))) twice(0(x1)) -> p(p(p(p(s(s(p(s(s(s(0(p(p(p(s(s(s(p(p(s(s(p(s(p(s(p(s(x1))))))))))))))))))))))))))) twice(s(x1)) -> p(p(s(s(s(p(p(s(s(s(twice(p(s(p(s(x1))))))))))))))) p(p(s(x1))) -> p(x1) p(s(x1)) -> x1 p(0(x1)) -> 0(s(s(s(s(s(s(s(s(s(s(s(x1)))))))))))) 0(x1) -> x1 encArg(s(x_1)) -> s(encArg(x_1)) encArg(cons_sq(x_1)) -> sq(encArg(x_1)) encArg(cons_twice(x_1)) -> twice(encArg(x_1)) encArg(cons_p(x_1)) -> p(encArg(x_1)) encArg(cons_0(x_1)) -> 0(encArg(x_1)) encode_sq(x_1) -> sq(encArg(x_1)) encode_0(x_1) -> 0(encArg(x_1)) encode_p(x_1) -> p(encArg(x_1)) encode_s(x_1) -> s(encArg(x_1)) encode_twice(x_1) -> twice(encArg(x_1)) Types: sq :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 0 :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 p :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 s :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 twice :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 encArg :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 cons_sq :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 cons_twice :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 cons_p :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 cons_0 :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 encode_sq :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 encode_0 :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 encode_p :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 encode_s :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 encode_twice :: s:cons_sq:cons_twice:cons_p:cons_0 -> s:cons_sq:cons_twice:cons_p:cons_0 hole_s:cons_sq:cons_twice:cons_p:cons_01_2 :: s:cons_sq:cons_twice:cons_p:cons_0 gen_s:cons_sq:cons_twice:cons_p:cons_02_2 :: Nat -> s:cons_sq:cons_twice:cons_p:cons_0 Lemmas: twice(gen_s:cons_sq:cons_twice:cons_p:cons_02_2(+(1, n17_2))) -> *3_2, rt in Omega(n17_2) Generator Equations: gen_s:cons_sq:cons_twice:cons_p:cons_02_2(0) <=> hole_s:cons_sq:cons_twice:cons_p:cons_01_2 gen_s:cons_sq:cons_twice:cons_p:cons_02_2(+(x, 1)) <=> s(gen_s:cons_sq:cons_twice:cons_p:cons_02_2(x)) The following defined symbols remain to be analysed: sq, encArg They will be analysed ascendingly in the following order: sq < encArg