MAYBE We are left with following problem, upon which TcT provides the certificate MAYBE. Strict Trs: { a__f(X) -> f(X) , a__f(0()) -> cons(0(), f(s(0()))) , a__f(s(0())) -> a__f(a__p(s(0()))) , a__p(X) -> p(X) , a__p(s(X)) -> mark(X) , mark(0()) -> 0() , mark(cons(X1, X2)) -> cons(mark(X1), X2) , mark(f(X)) -> a__f(mark(X)) , mark(s(X)) -> s(mark(X)) , mark(p(X)) -> a__p(mark(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) '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 Arrrr..