MAYBE We are left with following problem, upon which TcT provides the certificate MAYBE. Strict Trs: { f(t(), x, y) -> f(g(x, y), x, s(y)) , g(s(x), s(y)) -> g(x, y) , g(s(x), 0()) -> t() } 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) 'WithProblem (timeout of 60 seconds)' failed due to the following reason: Computation stopped due to timeout after 60.0 seconds. 2) '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) The following argument positions are usable: Uargs(f) = {1} TcT has computed the following matrix interpretation satisfying not(EDA) and not(IDA(1)). [f](x1, x2, x3) = [1] x1 + [1] x2 + [1] x3 + [7] [t] = [3] [g](x1, x2) = [7] [s](x1) = [0] [0] = [7] The following symbols are considered usable {f, g} The order satisfies the following ordering constraints: [f(t(), x, y)] = [1] x + [1] y + [10] ? [1] x + [14] = [f(g(x, y), x, s(y))] [g(s(x), s(y))] = [7] >= [7] = [g(x, y)] [g(s(x), 0())] = [7] > [3] = [t()] 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: { f(t(), x, y) -> f(g(x, y), x, s(y)) , g(s(x), s(y)) -> g(x, y) } Weak Trs: { g(s(x), 0()) -> t() } 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: The weightgap principle applies (using the following nonconstant growth matrix-interpretation) The following argument positions are usable: Uargs(f) = {1} TcT has computed the following matrix interpretation satisfying not(EDA) and not(IDA(1)). [f](x1, x2, x3) = [1 1] x1 + [1 0] x3 + [0] [0 0] [0 0] [1] [t] = [0] [4] [g](x1, x2) = [0 0] x2 + [0] [1 0] [0] [s](x1) = [0] [0] [0] = [4] [0] The following symbols are considered usable {f, g} The order satisfies the following ordering constraints: [f(t(), x, y)] = [1 0] y + [4] [0 0] [1] > [1 0] y + [0] [0 0] [1] = [f(g(x, y), x, s(y))] [g(s(x), s(y))] = [0] [0] ? [0 0] y + [0] [1 0] [0] = [g(x, y)] [g(s(x), 0())] = [0] [4] >= [0] [4] = [t()] 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: { g(s(x), s(y)) -> g(x, y) } Weak Trs: { f(t(), x, y) -> f(g(x, y), x, s(y)) , g(s(x), 0()) -> t() } 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) '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) '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 3) 'Fastest (timeout of 5 seconds) (timeout of 60 seconds)' failed due to the following reason: None of the processors succeeded. Details of failed attempt(s): ----------------------------- 1) 'Bounds with minimal-enrichment and initial automaton 'match'' failed due to the following reason: match-boundness of the problem could not be verified. 2) 'Bounds with perSymbol-enrichment and initial automaton 'match'' failed due to the following reason: match-boundness of the problem could not be verified. Arrrr..