YES

Problem:
 from(X) -> cons(X,n__from(s(X)))
 after(0(),XS) -> XS
 after(s(N),cons(X,XS)) -> after(N,activate(XS))
 from(X) -> n__from(X)
 activate(n__from(X)) -> from(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)) -> from#(X)
  TRS:
   from(X) -> cons(X,n__from(s(X)))
   after(0(),XS) -> XS
   after(s(N),cons(X,XS)) -> after(N,activate(XS))
   from(X) -> n__from(X)
   activate(n__from(X)) -> from(X)
   activate(X) -> X
  Arctic Interpretation Processor:
   dimension: 1
   interpretation:
    [activate#](x0) = 3,
    
    [after#](x0, x1) = 3x0,
    
    [from#](x0) = 2,
    
    [activate](x0) = 1x0 + 4,
    
    [after](x0, x1) = 6x0 + 2x1 + 0,
    
    [0] = 1,
    
    [cons](x0, x1) = 2x1 + 0,
    
    [n__from](x0) = 0,
    
    [s](x0) = 1x0 + 1,
    
    [from](x0) = 3
   orientation:
    after#(s(N),cons(X,XS)) = 4N + 4 >= 3 = activate#(XS)
    
    after#(s(N),cons(X,XS)) = 4N + 4 >= 3N = after#(N,activate(XS))
    
    activate#(n__from(X)) = 3 >= 2 = from#(X)
    
    from(X) = 3 >= 2 = cons(X,n__from(s(X)))
    
    after(0(),XS) = 2XS + 7 >= XS = XS
    
    after(s(N),cons(X,XS)) = 7N + 4XS + 7 >= 6N + 3XS + 6 = after(N,activate(XS))
    
    from(X) = 3 >= 0 = n__from(X)
    
    activate(n__from(X)) = 4 >= 3 = from(X)
    
    activate(X) = 1X + 4 >= X = X
   problem:
    DPs:
     
    TRS:
     from(X) -> cons(X,n__from(s(X)))
     after(0(),XS) -> XS
     after(s(N),cons(X,XS)) -> after(N,activate(XS))
     from(X) -> n__from(X)
     activate(n__from(X)) -> from(X)
     activate(X) -> X
   Qed