MAYBE

Problem:
 f(a(),n__b(),X) -> f(X,X,X)
 c() -> a()
 c() -> b()
 b() -> n__b()
 activate(n__b()) -> b()
 activate(X) -> X

Proof:
 DP Processor:
  DPs:
   f#(a(),n__b(),X) -> f#(X,X,X)
   c#() -> b#()
   activate#(n__b()) -> b#()
  TRS:
   f(a(),n__b(),X) -> f(X,X,X)
   c() -> a()
   c() -> b()
   b() -> n__b()
   activate(n__b()) -> b()
   activate(X) -> X
  Usable Rule Processor:
   DPs:
    f#(a(),n__b(),X) -> f#(X,X,X)
    c#() -> b#()
    activate#(n__b()) -> b#()
   TRS:
    f10(x,y) -> x
    f10(x,y) -> y
   CDG Processor:
    DPs:
     f#(a(),n__b(),X) -> f#(X,X,X)
     c#() -> b#()
     activate#(n__b()) -> b#()
    TRS:
     f10(x,y) -> x
     f10(x,y) -> y
    graph:
     f#(a(),n__b(),X) -> f#(X,X,X) -> f#(a(),n__b(),X) -> f#(X,X,X)
    Restore Modifier:
     DPs:
      f#(a(),n__b(),X) -> f#(X,X,X)
      c#() -> b#()
      activate#(n__b()) -> b#()
     TRS:
      f(a(),n__b(),X) -> f(X,X,X)
      c() -> a()
      c() -> b()
      b() -> n__b()
      activate(n__b()) -> b()
      activate(X) -> X
     SCC Processor:
      #sccs: 1
      #rules: 1
      #arcs: 1/9
      DPs:
       f#(a(),n__b(),X) -> f#(X,X,X)
      TRS:
       f(a(),n__b(),X) -> f(X,X,X)
       c() -> a()
       c() -> b()
       b() -> n__b()
       activate(n__b()) -> b()
       activate(X) -> X
      Open