MAYBE We are left with following problem, upon which TcT provides the certificate MAYBE. Strict Trs: { c() -> f(g(c())) , f(g(X)) -> g(X) } Obligation: innermost runtime complexity Answer: MAYBE None of the processors succeeded. Details of failed attempt(s): ----------------------------- 1) 'empty' failed due to the following reason: Empty strict component of the problem is NOT empty. 2) 'Best' failed due to the following reason: None of the processors succeeded. Details of failed attempt(s): ----------------------------- 1) 'Best' failed due to the following reason: None of the processors succeeded. Details of failed attempt(s): ----------------------------- 1) 'WithProblem (timeout of 30 seconds) (timeout of 60 seconds)' failed due to the following reason: The weightgap principle applies (using the following nonconstant growth matrix-interpretation) TcT has computed the following matrix interpretation satisfying not(EDA) and not(IDA(1)). [c] = [4] [f](x1) = [1] x1 + [4] [g](x1) = [1] x1 + [4] The following symbols are considered usable {c, f} The order satisfies the following ordering constraints: [c()] = [4] ? [12] = [f(g(c()))] [f(g(X))] = [1] X + [8] > [1] X + [4] = [g(X)] Further, it can be verified that all rules not oriented are covered by the weightgap condition. We are left with following problem, upon which TcT provides the certificate MAYBE. Strict Trs: { c() -> f(g(c())) } Weak Trs: { f(g(X)) -> g(X) } Obligation: innermost runtime complexity Answer: MAYBE None of the processors succeeded. Details of failed attempt(s): ----------------------------- 1) 'empty' failed due to the following reason: Empty strict component of the problem is NOT empty. 2) 'WithProblem' failed due to the following reason: None of the processors succeeded. Details of failed attempt(s): ----------------------------- 1) 'empty' failed due to the following reason: Empty strict component of the problem is NOT empty. 2) 'Fastest' failed due to the following reason: None of the processors succeeded. Details of failed attempt(s): ----------------------------- 1) 'WithProblem' failed due to the following reason: None of the processors succeeded. Details of failed attempt(s): ----------------------------- 1) 'empty' failed due to the following reason: Empty strict component of the problem is NOT empty. 2) 'WithProblem' failed due to the following reason: None of the processors succeeded. Details of failed attempt(s): ----------------------------- 1) 'empty' failed due to the following reason: Empty strict component of the problem is NOT empty. 2) 'WithProblem' failed due to the following reason: None of the processors succeeded. Details of failed attempt(s): ----------------------------- 1) 'empty' failed due to the following reason: Empty strict component of the problem is NOT empty. 2) 'WithProblem' failed due to the following reason: Empty strict component of the problem is NOT empty. 2) 'WithProblem' failed due to the following reason: None of the processors succeeded. Details of failed attempt(s): ----------------------------- 1) 'empty' failed due to the following reason: Empty strict component of the problem is NOT empty. 2) 'WithProblem' failed due to the following reason: Empty strict component of the problem is NOT empty. 2) 'Fastest (timeout of 5 seconds) (timeout of 60 seconds)' failed due to the following reason: Computation stopped due to timeout after 5.0 seconds. 3) 'Best' failed due to the following reason: None of the processors succeeded. Details of failed attempt(s): ----------------------------- 1) 'Polynomial Path Order (PS) (timeout of 60 seconds)' failed due to the following reason: The input cannot be shown compatible 2) 'bsearch-popstar (timeout of 60 seconds)' failed due to the following reason: The input cannot be shown compatible 2) 'WithProblem (timeout of 60 seconds)' failed due to the following reason: We add the following dependency tuples: Strict DPs: { c^#() -> c_1(f^#(g(c())), c^#()) , f^#(g(X)) -> c_2() } and mark the set of starting terms. We are left with following problem, upon which TcT provides the certificate MAYBE. Strict DPs: { c^#() -> c_1(f^#(g(c())), c^#()) , f^#(g(X)) -> c_2() } Weak Trs: { c() -> f(g(c())) , f(g(X)) -> g(X) } Obligation: innermost runtime complexity Answer: MAYBE We estimate the number of application of {2} by applications of Pre({2}) = {1}. Here rules are labeled as follows: DPs: { 1: c^#() -> c_1(f^#(g(c())), c^#()) , 2: f^#(g(X)) -> c_2() } We are left with following problem, upon which TcT provides the certificate MAYBE. Strict DPs: { c^#() -> c_1(f^#(g(c())), c^#()) } Weak DPs: { f^#(g(X)) -> c_2() } Weak Trs: { c() -> f(g(c())) , f(g(X)) -> g(X) } Obligation: innermost runtime complexity Answer: MAYBE The following weak DPs constitute a sub-graph of the DG that is closed under successors. The DPs are removed. { f^#(g(X)) -> c_2() } We are left with following problem, upon which TcT provides the certificate MAYBE. Strict DPs: { c^#() -> c_1(f^#(g(c())), c^#()) } Weak Trs: { c() -> f(g(c())) , f(g(X)) -> g(X) } Obligation: innermost runtime complexity Answer: MAYBE Due to missing edges in the dependency-graph, the right-hand sides of following rules could be simplified: { c^#() -> c_1(f^#(g(c())), c^#()) } We are left with following problem, upon which TcT provides the certificate MAYBE. Strict DPs: { c^#() -> c_1(c^#()) } Weak Trs: { c() -> f(g(c())) , f(g(X)) -> g(X) } Obligation: innermost runtime complexity Answer: MAYBE No rule is usable, rules are removed from the input problem. We are left with following problem, upon which TcT provides the certificate MAYBE. Strict DPs: { c^#() -> c_1(c^#()) } Obligation: innermost runtime complexity Answer: MAYBE None of the processors succeeded. Details of failed attempt(s): ----------------------------- 1) 'empty' failed due to the following reason: Empty strict component of the problem is NOT empty. 2) 'WithProblem' failed due to the following reason: None of the processors succeeded. Details of failed attempt(s): ----------------------------- 1) 'empty' failed due to the following reason: Empty strict component of the problem is NOT empty. 2) 'Fastest' failed due to the following reason: None of the processors succeeded. Details of failed attempt(s): ----------------------------- 1) 'Fastest (timeout of 5 seconds)' failed due to the following reason: Computation stopped due to timeout after 5.0 seconds. 2) 'WithProblem' failed due to the following reason: None of the processors succeeded. Details of failed attempt(s): ----------------------------- 1) 'empty' failed due to the following reason: Empty strict component of the problem is NOT empty. 2) 'Polynomial Path Order (PS)' failed due to the following reason: The input cannot be shown compatible 3) 'Polynomial Path Order (PS)' failed due to the following reason: The input cannot be shown compatible Arrrr..