MAYBE

Problem:
 f(X) -> f(c())
 c() -> b()

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