MAYBE

We are left with following problem, upon which TcT provides the
certificate MAYBE.

Strict Trs:
  { a__g(X) -> a__h(X)
  , a__g(X) -> g(X)
  , a__h(X) -> h(X)
  , a__h(d()) -> a__g(c())
  , a__c() -> d()
  , a__c() -> c()
  , mark(d()) -> d()
  , mark(c()) -> a__c()
  , mark(g(X)) -> a__g(X)
  , mark(h(X)) -> a__h(X) }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

The input cannot be shown compatible

Arrrr..