YES

Prover = TRS(tech=GUIDED_UNF_TRIPLES, nb_unfoldings=unlimited, unfold_variables=false, max_nb_coefficients=12, max_nb_unfolded_rules=-1, strategy=LEFTMOST_NE)

** BEGIN proof argument **
All the DP problems were proved finite.
As all the involved DP processors are sound,
the TRS under analysis terminates.
** END proof argument **

** BEGIN proof description **
## Searching for a generalized rewrite rule
(a rule whose right-hand side contains a variable
that does not occur in the left-hand side)...
No generalized rewrite rule found!

## Applying the DP framework...
## Round 1:
  ## DP problem: 
  Dependency pairs = [activate^#(n__from(_0)) -> activate^#(_0), activate^#(n__s(_0)) -> activate^#(_0)]
  TRS = {2nd(cons1(_0,cons(_1,_2))) -> _1, 2nd(cons(_0,_1)) -> 2nd(cons1(_0,activate(_1))), from(_0) -> cons(_0,n__from(n__s(_0))), from(_0) -> n__from(_0), s(_0) -> n__s(_0), activate(n__from(_0)) -> from(activate(_0)), activate(n__s(_0)) -> s(activate(_0)), activate(_0) -> _0}
    ## Trying with homeomorphic embeddings... Success!
  This DP problem is finite.

** END proof description **

Proof stopped at iteration 0
Number of unfolded rules generated by this proof = 0
Number of unfolded rules generated by all the parallel proofs = 0