YES

TRS:

  f(f(a())) -> c(n__f(g(f(a()))))
  f(X) -> n__f(X)
  activate(n__f(X)) -> f(X)
  activate(X) -> X

linear polynomial interpretations on N:

  f_A(x1) = x1 + 1
  f#_A(x1) = x1 + 1
  a_A = 0
  a#_A = 0
  c_A(x1) = x1
  c#_A(x1) = x1
  n__f_A(x1) = x1
  n__f#_A(x1) = x1
  g_A(x1) = x1
  g#_A(x1) = x1
  activate_A(x1) = x1 + 2
  activate#_A(x1) = x1 + 2

precedence:

  a > f > c = n__f = g = activate