YES

We show the termination of the TRS R:

  first(|0|(),X) -> nil()
  first(s(X),cons(Y)) -> cons(Y)
  from(X) -> cons(X)

-- SCC decomposition.

Consider the dependency pair problem (P, R), where P consists of

  (no rules)

and R consists of:

r1: first(|0|(),X) -> nil()
r2: first(s(X),cons(Y)) -> cons(Y)
r3: from(X) -> cons(X)

The estimated dependency graph contains the following SCCs:

  (no SCCs)