MAYBE

Problem:
 g(X) -> h(activate(X))
 c() -> d()
 h(n__d()) -> g(n__c())
 d() -> n__d()
 c() -> n__c()
 activate(n__d()) -> d()
 activate(n__c()) -> c()
 activate(X) -> X

Proof:
 DP Processor:
  DPs:
   g#(X) -> activate#(X)
   g#(X) -> h#(activate(X))
   c#() -> d#()
   h#(n__d()) -> g#(n__c())
   activate#(n__d()) -> d#()
   activate#(n__c()) -> c#()
  TRS:
   g(X) -> h(activate(X))
   c() -> d()
   h(n__d()) -> g(n__c())
   d() -> n__d()
   c() -> n__c()
   activate(n__d()) -> d()
   activate(n__c()) -> c()
   activate(X) -> X
  Usable Rule Processor:
   DPs:
    g#(X) -> activate#(X)
    g#(X) -> h#(activate(X))
    c#() -> d#()
    h#(n__d()) -> g#(n__c())
    activate#(n__d()) -> d#()
    activate#(n__c()) -> c#()
   TRS:
    activate(n__d()) -> d()
    activate(n__c()) -> c()
    activate(X) -> X
    d() -> n__d()
    c() -> d()
    c() -> n__c()
   EDG Processor:
    DPs:
     g#(X) -> activate#(X)
     g#(X) -> h#(activate(X))
     c#() -> d#()
     h#(n__d()) -> g#(n__c())
     activate#(n__d()) -> d#()
     activate#(n__c()) -> c#()
    TRS:
     activate(n__d()) -> d()
     activate(n__c()) -> c()
     activate(X) -> X
     d() -> n__d()
     c() -> d()
     c() -> n__c()
    graph:
     h#(n__d()) -> g#(n__c()) -> g#(X) -> activate#(X)
     h#(n__d()) -> g#(n__c()) -> g#(X) -> h#(activate(X))
     activate#(n__c()) -> c#() -> c#() -> d#()
     g#(X) -> h#(activate(X)) -> h#(n__d()) -> g#(n__c())
     g#(X) -> activate#(X) -> activate#(n__d()) -> d#()
     g#(X) -> activate#(X) -> activate#(n__c()) -> c#()
    Restore Modifier:
     DPs:
      g#(X) -> activate#(X)
      g#(X) -> h#(activate(X))
      c#() -> d#()
      h#(n__d()) -> g#(n__c())
      activate#(n__d()) -> d#()
      activate#(n__c()) -> c#()
     TRS:
      g(X) -> h(activate(X))
      c() -> d()
      h(n__d()) -> g(n__c())
      d() -> n__d()
      c() -> n__c()
      activate(n__d()) -> d()
      activate(n__c()) -> c()
      activate(X) -> X
     SCC Processor:
      #sccs: 1
      #rules: 2
      #arcs: 6/36
      DPs:
       h#(n__d()) -> g#(n__c())
       g#(X) -> h#(activate(X))
      TRS:
       g(X) -> h(activate(X))
       c() -> d()
       h(n__d()) -> g(n__c())
       d() -> n__d()
       c() -> n__c()
       activate(n__d()) -> d()
       activate(n__c()) -> c()
       activate(X) -> X
      Open