MAYBE We are left with following problem, upon which TcT provides the certificate MAYBE. Strict Trs: { double(x) -> permute(x, x, a()) , permute(x, y, a()) -> permute(isZero(x), x, b()) , permute(y, x, c()) -> s(s(permute(x, y, a()))) , permute(false(), x, b()) -> permute(ack(x, x), p(x), c()) , permute(true(), x, b()) -> 0() , isZero(0()) -> true() , isZero(s(x)) -> false() , ack(0(), x) -> plus(x, s(0())) , ack(s(x), 0()) -> ack(x, s(0())) , ack(s(x), s(y)) -> ack(x, ack(s(x), y)) , p(0()) -> 0() , p(s(x)) -> x , plus(x, 0()) -> x , plus(x, s(0())) -> s(x) , plus(x, s(s(y))) -> s(plus(s(x), y)) , plus(0(), y) -> y , plus(s(x), y) -> plus(x, s(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) 'bsearch-popstar (timeout of 60 seconds)' failed due to the following reason: The input cannot be shown compatible 2) 'Polynomial Path Order (PS) (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..