YES

TRS:

  f(f(x,y,z),u,f(x,y,v)) -> f(x,y,f(z,u,v))
  f(x,y,y) -> y
  f(x,y,g(y)) -> x
  f(x,x,y) -> x
  f(g(x),x,y) -> y

max/plus interpretations on N:

  f_A(x1,x2,x3) = max{0, x1, x2, x3}
  f#_A(x1,x2,x3) = max{0, x1, x2, x3}
  g_A(x1) = max{0, x1}
  g#_A(x1) = max{0, x1}

precedence:

  f = g