YES

TRS:

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

max/plus interpretations on N:

  from_A(x1) = max{14, 6 + x1}
  from#_A(x1) = max{9, 6}
  cons_A(x1,x2) = max{0, -1 + x1, 8 + x2}
  cons#_A(x1,x2) = max{1, 8, -7 + x2}
  n__from_A(x1) = max{1, 6 + x1}
  n__from#_A(x1) = max{0, 5}
  s_A(x1) = max{0, -7}
  s#_A(x1) = max{0, 0}
  first_A(x1,x2) = max{23, 7, 10 + x2}
  first#_A(x1,x2) = max{1, 3, 6 + x2}
  0_A = 1
  0#_A = 8
  nil_A = 11
  nil#_A = 7
  n__first_A(x1,x2) = max{15, 14, 2 + x2}
  n__first#_A(x1,x2) = max{0, 1, 6 + x2}
  activate_A(x1) = max{7, 8 + x1}
  activate#_A(x1) = max{7, 4 + x1}
  sel_A(x1,x2) = max{0, 0, 1 + x2}
  sel#_A(x1,x2) = max{6, 8, -3 + x2}

precedence:

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