YES

TRS:

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

linear polynomial interpretations on N:

  f_A(x1) = x1 + 3
  f#_A(x1) = x1 + 4
  c_A(x1) = x1 + 1
  c#_A(x1) = x1 + 3
  n__f_A(x1) = x1 + 3
  n__f#_A(x1) = 1
  n__g_A(x1) = 0
  n__g#_A(x1) = 0
  d_A(x1) = 1
  d#_A(x1) = 1
  activate_A(x1) = x1
  activate#_A(x1) = x1 + 2
  h_A(x1) = x1 + 2
  h#_A(x1) = x1 + 5
  n__d_A(x1) = 1
  n__d#_A(x1) = 0
  g_A(x1) = 0
  g#_A(x1) = 1

precedence:

  d > activate = n__d > f = h > c = n__f = n__g > g