YES

Problem:
 from(X) -> cons(X,n__from(n__s(X)))
 after(0(),XS) -> XS
 after(s(N),cons(X,XS)) -> after(N,activate(XS))
 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:
   after#(s(N),cons(X,XS)) -> activate#(XS)
   after#(s(N),cons(X,XS)) -> after#(N,activate(XS))
   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)))
   after(0(),XS) -> XS
   after(s(N),cons(X,XS)) -> after(N,activate(XS))
   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
  TDG Processor:
   DPs:
    after#(s(N),cons(X,XS)) -> activate#(XS)
    after#(s(N),cons(X,XS)) -> after#(N,activate(XS))
    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)))
    after(0(),XS) -> XS
    after(s(N),cons(X,XS)) -> after(N,activate(XS))
    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
   graph:
    activate#(n__from(X)) -> activate#(X) ->
    activate#(n__s(X)) -> s#(activate(X))
    activate#(n__from(X)) -> activate#(X) ->
    activate#(n__s(X)) -> activate#(X)
    activate#(n__from(X)) -> activate#(X) ->
    activate#(n__from(X)) -> from#(activate(X))
    activate#(n__from(X)) -> activate#(X) ->
    activate#(n__from(X)) -> activate#(X)
    activate#(n__s(X)) -> activate#(X) ->
    activate#(n__s(X)) -> s#(activate(X))
    activate#(n__s(X)) -> activate#(X) ->
    activate#(n__s(X)) -> activate#(X)
    activate#(n__s(X)) -> activate#(X) ->
    activate#(n__from(X)) -> from#(activate(X))
    activate#(n__s(X)) -> activate#(X) ->
    activate#(n__from(X)) -> activate#(X)
    after#(s(N),cons(X,XS)) -> activate#(XS) ->
    activate#(n__s(X)) -> s#(activate(X))
    after#(s(N),cons(X,XS)) -> activate#(XS) ->
    activate#(n__s(X)) -> activate#(X)
    after#(s(N),cons(X,XS)) -> activate#(XS) ->
    activate#(n__from(X)) -> from#(activate(X))
    after#(s(N),cons(X,XS)) -> activate#(XS) ->
    activate#(n__from(X)) -> activate#(X)
    after#(s(N),cons(X,XS)) -> after#(N,activate(XS)) ->
    after#(s(N),cons(X,XS)) -> after#(N,activate(XS))
    after#(s(N),cons(X,XS)) -> after#(N,activate(XS)) -> after#(s(N),cons(X,XS)) -> activate#(XS)
   SCC Processor:
    #sccs: 2
    #rules: 3
    #arcs: 14/36
    DPs:
     after#(s(N),cons(X,XS)) -> after#(N,activate(XS))
    TRS:
     from(X) -> cons(X,n__from(n__s(X)))
     after(0(),XS) -> XS
     after(s(N),cons(X,XS)) -> after(N,activate(XS))
     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
    KBO Processor:
     argument filtering:
      pi(from) = []
      pi(n__s) = [0]
      pi(n__from) = []
      pi(cons) = 1
      pi(0) = []
      pi(after) = [0,1]
      pi(s) = [0]
      pi(activate) = [0]
      pi(after#) = 0
     weight function:
      w0 = 1
      w(s) = w(after) = w(0) = w(n__from) = w(n__s) = w(from) = 1
      w(after#) = w(activate) = w(cons) = 0
     precedence:
      activate ~ after ~ 0 > from > s > after# ~ cons ~ n__from ~ n__s
     problem:
      DPs:
       
      TRS:
       from(X) -> cons(X,n__from(n__s(X)))
       after(0(),XS) -> XS
       after(s(N),cons(X,XS)) -> after(N,activate(XS))
       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
    
    DPs:
     activate#(n__from(X)) -> activate#(X)
     activate#(n__s(X)) -> activate#(X)
    TRS:
     from(X) -> cons(X,n__from(n__s(X)))
     after(0(),XS) -> XS
     after(s(N),cons(X,XS)) -> after(N,activate(XS))
     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) = 1
      pi(0) = []
      pi(after) = [0,1]
      pi(s) = [0]
      pi(activate) = [0]
      pi(activate#) = 0
     precedence:
      after > activate > s ~ from > activate# ~ 0 ~ cons ~ n__from ~ n__s
     problem:
      DPs:
       
      TRS:
       from(X) -> cons(X,n__from(n__s(X)))
       after(0(),XS) -> XS
       after(s(N),cons(X,XS)) -> after(N,activate(XS))
       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