YES

TRS:

  f(f(a())) -> f(g())

max/plus interpretations on N:

  f_A(x1) = max{2, 2}
  f#_A(x1) = max{1, -1}
  a_A = 2
  a#_A = 2
  g_A = 1
  g#_A = 0

precedence:

  a > f > g