YES

TRS:

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

max/plus interpretations on N:

  f_A(x1) = max{0, x1}
  f#_A(x1) = max{0, x1}
  a_A = 0
  a#_A = 0
  g_A(x1) = max{0, x1}
  g#_A(x1) = max{0, x1}
  n__f_A(x1) = max{0, x1}
  n__f#_A(x1) = max{0, x1}
  activate_A(x1) = max{0, x1}
  activate#_A(x1) = max{0, x1}

precedence:

  a = activate > f > g = n__f