YES

TRS:

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

max/plus interpretations on N:

  f_A(x1,x2) = max{0, x1, x2}
  f#_A(x1,x2) = max{0, x1, x2}
  g_A(x1) = max{0, x1}
  g#_A(x1) = max{0, x1}
  h_A(x1,x2) = max{0, x1, x2}
  h#_A(x1,x2) = max{0, x1, x2}
  a_A = 0
  a#_A = 0

precedence:

  g > h = a > f