MAYBE We are left with following problem, upon which TcT provides the certificate MAYBE. Strict Trs: { tower(x) -> f(a(), x, s(0())) , f(a(), s(x), y) -> f(b(), y, s(x)) , f(a(), 0(), y) -> y , f(b(), y, x) -> f(a(), half(x), exp(y)) , half(s(s(x))) -> s(half(x)) , half(s(0())) -> half(0()) , half(0()) -> double(0()) , exp(s(x)) -> double(exp(x)) , exp(0()) -> s(0()) , double(s(x)) -> s(s(double(x))) , double(0()) -> 0() } 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) '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) '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 Arrrr..