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