YES

TRS:

  f(empty(),l) -> l
  f(cons(x,k),l) -> g(k,l,cons(x,k))
  g(a,b,c) -> f(a,cons(b,c))

max/plus interpretations on N:

  f_A(x1,x2) = max{11, 7 + x1, x2}
  f#_A(x1,x2) = max{8, 6 + x1, 4}
  empty_A = 0
  empty#_A = 0
  cons_A(x1,x2) = max{2, 11, 6 + x2}
  cons#_A(x1,x2) = max{0, 2, 1}
  g_A(x1,x2,x3) = max{1, 12 + x1, 10, 6 + x3}
  g#_A(x1,x2,x3) = max{13, 7 + x1, 3, 5}

precedence:

  g > f = empty > cons