MAYBE We are left with following problem, upon which TcT provides the certificate MAYBE. Strict Trs: { minus(x, 0()) -> x , minus(minus(x, y), z) -> minus(x, plus(y, z)) , minus(0(), y) -> 0() , minus(s(x), s(y)) -> minus(x, y) , plus(0(), y) -> y , plus(s(x), y) -> plus(x, s(y)) , plus(s(x), y) -> s(plus(y, x)) , zero(0()) -> true() , zero(s(x)) -> false() , p(0()) -> 0() , p(s(x)) -> x , div(x, y) -> quot(x, y, 0()) , quot(0(), s(y), z) -> z , quot(s(x), s(y), z) -> quot(minus(p(ack(0(), x)), y), s(y), s(z)) , ack(0(), x) -> plus(x, s(0())) , ack(0(), x) -> s(x) , ack(s(x), 0()) -> ack(x, s(0())) , ack(s(x), s(y)) -> ack(x, ack(s(x), y)) } 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: Computation stopped due to timeout after 30.0 seconds. 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 perSymbol-enrichment and initial automaton 'match'' failed due to the following reason: match-boundness of the problem could not be verified. 2) 'Bounds with minimal-enrichment and initial automaton 'match'' failed due to the following reason: match-boundness of the problem could not be verified. Arrrr..