YES

TRS:

  f(f(a(),f(x,a())),a()) -> f(a(),f(f(x,a()),a()))

max/plus interpretations on N:

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

precedence:

  f = a