MAYBE

Problem:
 f(x,x) -> f(a(),b())
 b() -> c()

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