MAYBE

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

Strict Trs:
  { f(a()) -> f(c(a()))
  , f(a()) -> f(d(a()))
  , f(c(X)) -> X
  , f(c(a())) -> f(d(b()))
  , f(c(b())) -> f(d(a()))
  , f(d(X)) -> X
  , e(g(X)) -> e(X) }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

The input cannot be shown compatible

Arrrr..