MAYBE

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

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