YES

TRS:

  f(X) -> g()

max/plus interpretations on N:

  f_A(x1) = max{1, 1 + x1}
  f#_A(x1) = max{1, 1 + x1}
  g_A = 0
  g#_A = 0

precedence:

  g > f