YES

TRS:

  g(0()) -> 0()
  g(s(x)) -> f(g(x))
  f(0()) -> 0()

max/plus interpretations on N:

  g_A(x1) = max{0, x1}
  g#_A(x1) = max{0, x1}
  0_A = 0
  0#_A = 0
  s_A(x1) = max{0, x1}
  s#_A(x1) = max{0, x1}
  f_A(x1) = max{0, x1}
  f#_A(x1) = max{0, x1}

precedence:

  s > g = f > 0