YES

TRS:

  2nd(cons(X,n__cons(Y,Z))) -> activate(Y)
  from(X) -> cons(X,n__from(s(X)))
  cons(X1,X2) -> n__cons(X1,X2)
  from(X) -> n__from(X)
  activate(n__cons(X1,X2)) -> cons(X1,X2)
  activate(n__from(X)) -> from(X)
  activate(X) -> X

max/plus interpretations on N:

  2nd_A(x1) = max{0, x1}
  2nd#_A(x1) = max{0, x1}
  cons_A(x1,x2) = max{0, x1, x2}
  cons#_A(x1,x2) = max{0, x1, x2}
  n__cons_A(x1,x2) = max{0, x1, x2}
  n__cons#_A(x1,x2) = max{0, x1, x2}
  activate_A(x1) = max{0, x1}
  activate#_A(x1) = max{0, x1}
  from_A(x1) = max{0, x1}
  from#_A(x1) = max{0, x1}
  n__from_A(x1) = max{0, x1}
  n__from#_A(x1) = max{0, x1}
  s_A(x1) = max{0, x1}
  s#_A(x1) = max{0, x1}

precedence:

  2nd > activate > from > cons = n__from = s > n__cons