MAYBE

Problem:
 c() -> f(n__g(n__c()))
 f(n__g(X)) -> g(activate(X))
 g(X) -> n__g(X)
 c() -> n__c()
 activate(n__g(X)) -> g(X)
 activate(n__c()) -> c()
 activate(X) -> X

Proof:
 DP Processor:
  DPs:
   c#() -> f#(n__g(n__c()))
   f#(n__g(X)) -> activate#(X)
   f#(n__g(X)) -> g#(activate(X))
   activate#(n__g(X)) -> g#(X)
   activate#(n__c()) -> c#()
  TRS:
   c() -> f(n__g(n__c()))
   f(n__g(X)) -> g(activate(X))
   g(X) -> n__g(X)
   c() -> n__c()
   activate(n__g(X)) -> g(X)
   activate(n__c()) -> c()
   activate(X) -> X
  TDG Processor:
   DPs:
    c#() -> f#(n__g(n__c()))
    f#(n__g(X)) -> activate#(X)
    f#(n__g(X)) -> g#(activate(X))
    activate#(n__g(X)) -> g#(X)
    activate#(n__c()) -> c#()
   TRS:
    c() -> f(n__g(n__c()))
    f(n__g(X)) -> g(activate(X))
    g(X) -> n__g(X)
    c() -> n__c()
    activate(n__g(X)) -> g(X)
    activate(n__c()) -> c()
    activate(X) -> X
   graph:
    activate#(n__c()) -> c#() -> c#() -> f#(n__g(n__c()))
    f#(n__g(X)) -> activate#(X) -> activate#(n__c()) -> c#()
    f#(n__g(X)) -> activate#(X) -> activate#(n__g(X)) -> g#(X)
    c#() -> f#(n__g(n__c())) -> f#(n__g(X)) -> g#(activate(X))
    c#() -> f#(n__g(n__c())) -> f#(n__g(X)) -> activate#(X)
   SCC Processor:
    #sccs: 1
    #rules: 3
    #arcs: 5/25
    DPs:
     activate#(n__c()) -> c#()
     c#() -> f#(n__g(n__c()))
     f#(n__g(X)) -> activate#(X)
    TRS:
     c() -> f(n__g(n__c()))
     f(n__g(X)) -> g(activate(X))
     g(X) -> n__g(X)
     c() -> n__c()
     activate(n__g(X)) -> g(X)
     activate(n__c()) -> c()
     activate(X) -> X
    Open