YES

Problem:
 from(X) -> cons(X,n__from(n__s(X)))
 sel(0(),cons(X,Y)) -> X
 sel(s(X),cons(Y,Z)) -> sel(X,activate(Z))
 from(X) -> n__from(X)
 s(X) -> n__s(X)
 activate(n__from(X)) -> from(activate(X))
 activate(n__s(X)) -> s(activate(X))
 activate(X) -> X

Proof:
 DP Processor:
  DPs:
   sel#(s(X),cons(Y,Z)) -> activate#(Z)
   sel#(s(X),cons(Y,Z)) -> sel#(X,activate(Z))
   activate#(n__from(X)) -> activate#(X)
   activate#(n__from(X)) -> from#(activate(X))
   activate#(n__s(X)) -> activate#(X)
   activate#(n__s(X)) -> s#(activate(X))
  TRS:
   from(X) -> cons(X,n__from(n__s(X)))
   sel(0(),cons(X,Y)) -> X
   sel(s(X),cons(Y,Z)) -> sel(X,activate(Z))
   from(X) -> n__from(X)
   s(X) -> n__s(X)
   activate(n__from(X)) -> from(activate(X))
   activate(n__s(X)) -> s(activate(X))
   activate(X) -> X
  LPO Processor:
   argument filtering:
    pi(from) = [0]
    pi(n__s) = [0]
    pi(n__from) = [0]
    pi(cons) = [0,1]
    pi(0) = []
    pi(sel) = [0,1]
    pi(s) = [0]
    pi(activate) = [0]
    pi(from#) = 0
    pi(sel#) = [0,1]
    pi(activate#) = [0]
    pi(s#) = []
   precedence:
    sel# > activate# > sel > activate > s ~ from > s# ~ from# ~ 0 ~ cons ~ n__from ~ n__s
   problem:
    DPs:
     
    TRS:
     from(X) -> cons(X,n__from(n__s(X)))
     sel(0(),cons(X,Y)) -> X
     sel(s(X),cons(Y,Z)) -> sel(X,activate(Z))
     from(X) -> n__from(X)
     s(X) -> n__s(X)
     activate(n__from(X)) -> from(activate(X))
     activate(n__s(X)) -> s(activate(X))
     activate(X) -> X
   Qed