MAYBE We are left with following problem, upon which TcT provides the certificate MAYBE. Strict Trs: { i(x, x) -> i(a(), b()) , g(x, x) -> g(a(), b()) , g(a(), g(x, g(b(), g(a(), g(x, y))))) -> g(a(), g(a(), g(a(), g(x, g(b(), g(b(), y)))))) , h(i(x, y)) -> i(i(c(), h(h(y))), x) , h(g(x, s(y))) -> h(g(s(x), y)) , h(s(f(x))) -> h(f(x)) , f(g(s(x), y)) -> f(g(x, s(y))) , f(s(x)) -> s(s(f(h(s(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) '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..