YES

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

linear polynomial interpretations on N:

  f_A(x1) = x1 + 12
  f#_A(x1) = x1 + 12
  c_A(x1) = x1 + 10
  c#_A(x1) = x1 + 10
  n__f_A(x1) = x1 + 6
  n__f#_A(x1) = x1 + 6
  g_A(x1) = x1 + 1
  g#_A(x1) = x1 + 1
  d_A(x1) = x1 + 2
  d#_A(x1) = x1 + 2
  activate_A(x1) = x1 + 7
  activate#_A(x1) = x1 + 7
  h_A(x1) = x1 + 12
  h#_A(x1) = x1 + 12
  n__d_A(x1) = x1 + 1
  n__d#_A(x1) = x1 + 1

precedence:

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