YES

TRS:

  first(0(),X) -> nil()
  first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z)))
  from(X) -> cons(X,n__from(s(X)))
  first(X1,X2) -> n__first(X1,X2)
  from(X) -> n__from(X)
  activate(n__first(X1,X2)) -> first(X1,X2)
  activate(n__from(X)) -> from(X)
  activate(X) -> X

max/plus interpretations on N:

  first_A(x1,x2) = max{25, 16 + x1, 5 + x2}
  first#_A(x1,x2) = max{8, x1, 1 + x2}
  0_A = 0
  0#_A = 1
  nil_A = 25
  nil#_A = 2
  s_A(x1) = max{8, 14 + x1}
  s#_A(x1) = max{15, 0}
  cons_A(x1,x2) = max{0, 15, 5 + x2}
  cons#_A(x1,x2) = max{0, 7, 0}
  n__first_A(x1,x2) = max{25, 16 + x1, 5 + x2}
  n__first#_A(x1,x2) = max{6, x1, x2}
  activate_A(x1) = max{15, x1}
  activate#_A(x1) = max{15, 4 + x1}
  from_A(x1) = max{6, 15}
  from#_A(x1) = max{15, 8}
  n__from_A(x1) = max{5, 7}
  n__from#_A(x1) = max{0, 7}

precedence:

  activate > first = from > nil = s = cons = n__first = n__from > 0