YES

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

Proof:
 DP Processor:
  DPs:
   f#(f(X)) -> c#(n__f(g(n__f(X))))
   c#(X) -> activate#(X)
   c#(X) -> d#(activate(X))
   h#(X) -> c#(n__d(X))
   activate#(n__f(X)) -> f#(X)
   activate#(n__d(X)) -> d#(X)
  TRS:
   f(f(X)) -> c(n__f(g(n__f(X))))
   c(X) -> d(activate(X))
   h(X) -> c(n__d(X))
   f(X) -> n__f(X)
   d(X) -> n__d(X)
   activate(n__f(X)) -> f(X)
   activate(n__d(X)) -> d(X)
   activate(X) -> X
  Usable Rule Processor:
   DPs:
    f#(f(X)) -> c#(n__f(g(n__f(X))))
    c#(X) -> activate#(X)
    c#(X) -> d#(activate(X))
    h#(X) -> c#(n__d(X))
    activate#(n__f(X)) -> f#(X)
    activate#(n__d(X)) -> d#(X)
   TRS:
    activate(n__f(X)) -> f(X)
    activate(n__d(X)) -> d(X)
    activate(X) -> X
    f(f(X)) -> c(n__f(g(n__f(X))))
    f(X) -> n__f(X)
    c(X) -> d(activate(X))
    d(X) -> n__d(X)
   CDG Processor:
    DPs:
     f#(f(X)) -> c#(n__f(g(n__f(X))))
     c#(X) -> activate#(X)
     c#(X) -> d#(activate(X))
     h#(X) -> c#(n__d(X))
     activate#(n__f(X)) -> f#(X)
     activate#(n__d(X)) -> d#(X)
    TRS:
     activate(n__f(X)) -> f(X)
     activate(n__d(X)) -> d(X)
     activate(X) -> X
     f(f(X)) -> c(n__f(g(n__f(X))))
     f(X) -> n__f(X)
     c(X) -> d(activate(X))
     d(X) -> n__d(X)
    graph:
     h#(X) -> c#(n__d(X)) -> c#(X) -> activate#(X)
     h#(X) -> c#(n__d(X)) -> c#(X) -> d#(activate(X))
     c#(X) -> activate#(X) -> activate#(n__f(X)) -> f#(X)
     f#(f(X)) -> c#(n__f(g(n__f(X)))) -> c#(X) -> activate#(X)
     f#(f(X)) -> c#(n__f(g(n__f(X)))) -> c#(X) -> d#(activate(X))
    Restore Modifier:
     DPs:
      f#(f(X)) -> c#(n__f(g(n__f(X))))
      c#(X) -> activate#(X)
      c#(X) -> d#(activate(X))
      h#(X) -> c#(n__d(X))
      activate#(n__f(X)) -> f#(X)
      activate#(n__d(X)) -> d#(X)
     TRS:
      f(f(X)) -> c(n__f(g(n__f(X))))
      c(X) -> d(activate(X))
      h(X) -> c(n__d(X))
      f(X) -> n__f(X)
      d(X) -> n__d(X)
      activate(n__f(X)) -> f(X)
      activate(n__d(X)) -> d(X)
      activate(X) -> X
     SCC Processor:
      #sccs: 0
      #rules: 0
      #arcs: 5/36