YES

TRS:

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

max/plus interpretations on N:

  f_A(x1,x2) = max{1, 2 + x1, -5}
  f#_A(x1,x2) = max{0, 6 + x1, 1}
  g_A(x1,x2) = max{2, 2 + x1, -1}
  g#_A(x1,x2) = max{2, 3 + x1, 1}
  h_A(x1) = max{0, 4 + x1}
  h#_A(x1) = max{0, 7}

precedence:

  g > f = h