YES

TRS:

  .(1(),x) -> x
  .(x,1()) -> x
  .(i(x),x) -> 1()
  .(x,i(x)) -> 1()
  i(1()) -> 1()
  i(i(x)) -> x
  .(i(y),.(y,z)) -> z
  .(y,.(i(y),z)) -> z

max/plus interpretations on N:

  ._A(x1,x2) = max{0, x1, x2}
  .#_A(x1,x2) = max{1, -1, -1}
  1_A = 2
  1#_A = 0
  i_A(x1) = max{1, 2 + x1}
  i#_A(x1) = max{1, 1}

precedence:

  . = i > 1