MAYBE

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

Proof:
 DP Processor:
  DPs:
   f#(n__b(),X,n__c()) -> c#()
   f#(n__b(),X,n__c()) -> f#(X,c(),X)
   c#() -> b#()
   activate#(n__b()) -> b#()
   activate#(n__c()) -> c#()
  TRS:
   f(n__b(),X,n__c()) -> f(X,c(),X)
   c() -> b()
   b() -> n__b()
   c() -> n__c()
   activate(n__b()) -> b()
   activate(n__c()) -> c()
   activate(X) -> X
  ADG Processor:
   DPs:
    f#(n__b(),X,n__c()) -> c#()
    f#(n__b(),X,n__c()) -> f#(X,c(),X)
    c#() -> b#()
    activate#(n__b()) -> b#()
    activate#(n__c()) -> c#()
   TRS:
    f(n__b(),X,n__c()) -> f(X,c(),X)
    c() -> b()
    b() -> n__b()
    c() -> n__c()
    activate(n__b()) -> b()
    activate(n__c()) -> c()
    activate(X) -> X
   graph:
    activate#(n__c()) -> c#() -> c#() -> b#()
    f#(n__b(),X,n__c()) -> c#() -> c#() -> b#()
    f#(n__b(),X,n__c()) -> f#(X,c(),X) ->
    f#(n__b(),X,n__c()) -> c#()
    f#(n__b(),X,n__c()) -> f#(X,c(),X) -> f#(n__b(),X,n__c()) -> f#(X,c(),X)
   SCC Processor:
    #sccs: 1
    #rules: 1
    #arcs: 4/25
    DPs:
     f#(n__b(),X,n__c()) -> f#(X,c(),X)
    TRS:
     f(n__b(),X,n__c()) -> f(X,c(),X)
     c() -> b()
     b() -> n__b()
     c() -> n__c()
     activate(n__b()) -> b()
     activate(n__c()) -> c()
     activate(X) -> X
    Open