MAYBE We are left with following problem, upon which TcT provides the certificate MAYBE. Strict Trs: { f(X) -> n__f(X) , f(0()) -> cons(0(), n__f(s(0()))) , f(s(0())) -> f(p(s(0()))) , p(s(0())) -> 0() , activate(X) -> X , activate(n__f(X)) -> f(X) } Obligation: innermost runtime complexity Answer: MAYBE The input cannot be shown compatible Arrrr..