MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          e(g(X)) -> e(X)
          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
      - Signature:
          {e/1,f/1} / {a/0,b/0,c/1,d/1,g/1}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {e,f} and constructors {a,b,c,d,g}
  + Applied Processor:
      Ara {heuristics_ = NoHeuristics, minDegree = 1, maxDegree = 3, araTimeout = 60, araFindStrictRules = Nothing, araSmtSolver = MiniSMT}
  + Details:
      The input can not be schown compatible.
MAYBE