MAYBE

Problem:
 f(a()) -> f(c(a()))
 f(c(X)) -> X
 f(c(a())) -> f(d(b()))
 f(a()) -> f(d(a()))
 f(d(X)) -> X
 f(c(b())) -> f(d(a()))
 e(g(X)) -> e(X)

Proof:
 DP Processor:
  DPs:
   f#(a()) -> f#(c(a()))
   f#(c(a())) -> f#(d(b()))
   f#(a()) -> f#(d(a()))
   f#(c(b())) -> f#(d(a()))
   e#(g(X)) -> e#(X)
  TRS:
   f(a()) -> f(c(a()))
   f(c(X)) -> X
   f(c(a())) -> f(d(b()))
   f(a()) -> f(d(a()))
   f(d(X)) -> X
   f(c(b())) -> f(d(a()))
   e(g(X)) -> e(X)
  Usable Rule Processor:
   DPs:
    f#(a()) -> f#(c(a()))
    f#(c(a())) -> f#(d(b()))
    f#(a()) -> f#(d(a()))
    f#(c(b())) -> f#(d(a()))
    e#(g(X)) -> e#(X)
   TRS:
    
   CDG Processor:
    DPs:
     f#(a()) -> f#(c(a()))
     f#(c(a())) -> f#(d(b()))
     f#(a()) -> f#(d(a()))
     f#(c(b())) -> f#(d(a()))
     e#(g(X)) -> e#(X)
    TRS:
     
    graph:
     e#(g(X)) -> e#(X) -> e#(g(X)) -> e#(X)
     f#(a()) -> f#(c(a())) -> f#(c(a())) -> f#(d(b()))
    Restore Modifier:
     DPs:
      f#(a()) -> f#(c(a()))
      f#(c(a())) -> f#(d(b()))
      f#(a()) -> f#(d(a()))
      f#(c(b())) -> f#(d(a()))
      e#(g(X)) -> e#(X)
     TRS:
      f(a()) -> f(c(a()))
      f(c(X)) -> X
      f(c(a())) -> f(d(b()))
      f(a()) -> f(d(a()))
      f(d(X)) -> X
      f(c(b())) -> f(d(a()))
      e(g(X)) -> e(X)
     SCC Processor:
      #sccs: 1
      #rules: 1
      #arcs: 2/25
      DPs:
       e#(g(X)) -> e#(X)
      TRS:
       f(a()) -> f(c(a()))
       f(c(X)) -> X
       f(c(a())) -> f(d(b()))
       f(a()) -> f(d(a()))
       f(d(X)) -> X
       f(c(b())) -> f(d(a()))
       e(g(X)) -> e(X)
      Open