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{9, 3 + x1, 8 + x2}
  first#_A(x1,x2) = max{9, 3 + x1, 8 + x2}
  0_A = 1
  0#_A = 1
  nil_A = 0
  nil#_A = 0
  s_A(x1) = max{2, x1}
  s#_A(x1) = max{2, x1}
  cons_A(x1,x2) = max{4, x1, x2}
  cons#_A(x1,x2) = max{4, x1, x2}
  n__first_A(x1,x2) = max{2, 1 + x1, 1 + x2}
  n__first#_A(x1,x2) = max{2, 1 + x1, 1 + x2}
  activate_A(x1) = max{6, 7 + x1}
  activate#_A(x1) = max{6, 7 + x1}
  from_A(x1) = max{4, 3 + x1}
  from#_A(x1) = max{4, 3 + x1}
  n__from_A(x1) = max{4, 2 + x1}
  n__from#_A(x1) = max{4, 2 + x1}

precedence:

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