YES

TRS:

  rev(ls) -> r1(ls,empty())
  r1(empty(),a) -> a
  r1(cons(x,k),a) -> r1(k,cons(x,a))

max/plus interpretations on N:

  rev_A(x1) = max{1, 3}
  rev#_A(x1) = max{1, 1}
  r1_A(x1,x2) = max{3, 2, x2}
  r1#_A(x1,x2) = max{1, 1, 1}
  empty_A = 1
  empty#_A = 0
  cons_A(x1,x2) = max{3, -1, 1}
  cons#_A(x1,x2) = max{0, 0, 0}

precedence:

  rev > r1 = empty > cons