YES

Problem:
 2nd(cons1(X,cons(Y,Z))) -> Y
 2nd(cons(X,X1)) -> 2nd(cons1(X,activate(X1)))
 from(X) -> cons(X,n__from(s(X)))
 from(X) -> n__from(X)
 activate(n__from(X)) -> from(X)
 activate(X) -> X

Proof:
 DP Processor:
  DPs:
   2nd#(cons(X,X1)) -> activate#(X1)
   2nd#(cons(X,X1)) -> 2nd#(cons1(X,activate(X1)))
   activate#(n__from(X)) -> from#(X)
  TRS:
   2nd(cons1(X,cons(Y,Z))) -> Y
   2nd(cons(X,X1)) -> 2nd(cons1(X,activate(X1)))
   from(X) -> cons(X,n__from(s(X)))
   from(X) -> n__from(X)
   activate(n__from(X)) -> from(X)
   activate(X) -> X
  Arctic Interpretation Processor:
   dimension: 1
   interpretation:
    [from#](x0) = 1x0,
    
    [activate#](x0) = x0,
    
    [2nd#](x0) = 1x0,
    
    [n__from](x0) = 2x0 + 2,
    
    [s](x0) = 1x0 + -6,
    
    [from](x0) = 6x0 + 4,
    
    [activate](x0) = 5x0,
    
    [2nd](x0) = 2x0 + 0,
    
    [cons1](x0, x1) = 4x0 + -6x1,
    
    [cons](x0, x1) = 5x0 + x1 + -1
   orientation:
    2nd#(cons(X,X1)) = 6X + 1X1 + 0 >= X1 = activate#(X1)
    
    2nd#(cons(X,X1)) = 6X + 1X1 + 0 >= 5X + X1 = 2nd#(cons1(X,activate(X1)))
    
    activate#(n__from(X)) = 2X + 2 >= 1X = from#(X)
    
    2nd(cons1(X,cons(Y,Z))) = 6X + 1Y + -4Z + 0 >= Y = Y
    
    2nd(cons(X,X1)) = 7X + 2X1 + 1 >= 6X + 1X1 + 0 = 2nd(cons1(X,activate(X1)))
    
    from(X) = 6X + 4 >= 5X + 2 = cons(X,n__from(s(X)))
    
    from(X) = 6X + 4 >= 2X + 2 = n__from(X)
    
    activate(n__from(X)) = 7X + 7 >= 6X + 4 = from(X)
    
    activate(X) = 5X >= X = X
   problem:
    DPs:
     
    TRS:
     2nd(cons1(X,cons(Y,Z))) -> Y
     2nd(cons(X,X1)) -> 2nd(cons1(X,activate(X1)))
     from(X) -> cons(X,n__from(s(X)))
     from(X) -> n__from(X)
     activate(n__from(X)) -> from(X)
     activate(X) -> X
   Qed