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