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