YES

TRS:

  g(x,y) -> x
  g(x,y) -> y
  f(s(x),y,y) -> f(y,x,s(x))

max/plus interpretations on N:

  g_A(x1,x2) = max{0, x1, x2}
  g#_A(x1,x2) = max{0, x1, x2}
  f_A(x1,x2,x3) = max{1, 3 + x1, 4 + x2, 2 + x3}
  f#_A(x1,x2,x3) = max{1, 3 + x1, 4 + x2, 2 + x3}
  s_A(x1) = max{0, 2 + x1}
  s#_A(x1) = max{0, 2 + x1}

precedence:

  s > g = f