YES

Problem:
 from(X) -> cons(X,n__from(s(X)))
 first(0(),Z) -> nil()
 first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z)))
 sel(0(),cons(X,Z)) -> X
 sel(s(X),cons(Y,Z)) -> sel(X,activate(Z))
 from(X) -> n__from(X)
 first(X1,X2) -> n__first(X1,X2)
 activate(n__from(X)) -> from(X)
 activate(n__first(X1,X2)) -> first(X1,X2)
 activate(X) -> X

Proof:
 DP Processor:
  DPs:
   first#(s(X),cons(Y,Z)) -> activate#(Z)
   sel#(s(X),cons(Y,Z)) -> activate#(Z)
   sel#(s(X),cons(Y,Z)) -> sel#(X,activate(Z))
   activate#(n__from(X)) -> from#(X)
   activate#(n__first(X1,X2)) -> first#(X1,X2)
  TRS:
   from(X) -> cons(X,n__from(s(X)))
   first(0(),Z) -> nil()
   first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z)))
   sel(0(),cons(X,Z)) -> X
   sel(s(X),cons(Y,Z)) -> sel(X,activate(Z))
   from(X) -> n__from(X)
   first(X1,X2) -> n__first(X1,X2)
   activate(n__from(X)) -> from(X)
   activate(n__first(X1,X2)) -> first(X1,X2)
   activate(X) -> X
  Usable Rule Processor:
   DPs:
    first#(s(X),cons(Y,Z)) -> activate#(Z)
    sel#(s(X),cons(Y,Z)) -> activate#(Z)
    sel#(s(X),cons(Y,Z)) -> sel#(X,activate(Z))
    activate#(n__from(X)) -> from#(X)
    activate#(n__first(X1,X2)) -> first#(X1,X2)
   TRS:
    activate(n__from(X)) -> from(X)
    activate(n__first(X1,X2)) -> first(X1,X2)
    activate(X) -> X
    from(X) -> cons(X,n__from(s(X)))
    from(X) -> n__from(X)
    first(0(),Z) -> nil()
    first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z)))
    first(X1,X2) -> n__first(X1,X2)
   Matrix Interpretation Processor: dim=1
    
    usable rules:
     activate(n__from(X)) -> from(X)
     activate(n__first(X1,X2)) -> first(X1,X2)
     activate(X) -> X
     from(X) -> cons(X,n__from(s(X)))
     from(X) -> n__from(X)
     first(0(),Z) -> nil()
     first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z)))
     first(X1,X2) -> n__first(X1,X2)
    interpretation:
     [sel#](x0, x1) = 5x0 + x1,
     
     [activate#](x0) = x0,
     
     [first#](x0, x1) = x0 + x1,
     
     [from#](x0) = 0,
     
     [n__first](x0, x1) = x0 + x1 + 1,
     
     [activate](x0) = x0,
     
     [nil] = 4,
     
     [first](x0, x1) = x0 + x1 + 1,
     
     [0] = 3,
     
     [cons](x0, x1) = x1,
     
     [n__from](x0) = 1,
     
     [s](x0) = x0 + 5,
     
     [from](x0) = 1
    orientation:
     first#(s(X),cons(Y,Z)) = X + Z + 5 >= Z = activate#(Z)
     
     sel#(s(X),cons(Y,Z)) = 5X + Z + 25 >= Z = activate#(Z)
     
     sel#(s(X),cons(Y,Z)) = 5X + Z + 25 >= 5X + Z = sel#(X,activate(Z))
     
     activate#(n__from(X)) = 1 >= 0 = from#(X)
     
     activate#(n__first(X1,X2)) = X1 + X2 + 1 >= X1 + X2 = first#(X1,X2)
     
     activate(n__from(X)) = 1 >= 1 = from(X)
     
     activate(n__first(X1,X2)) = X1 + X2 + 1 >= X1 + X2 + 1 = first(X1,X2)
     
     activate(X) = X >= X = X
     
     from(X) = 1 >= 1 = cons(X,n__from(s(X)))
     
     from(X) = 1 >= 1 = n__from(X)
     
     first(0(),Z) = Z + 4 >= 4 = nil()
     
     first(s(X),cons(Y,Z)) = X + Z + 6 >= X + Z + 1 = cons(Y,n__first(X,activate(Z)))
     
     first(X1,X2) = X1 + X2 + 1 >= X1 + X2 + 1 = n__first(X1,X2)
    problem:
     DPs:
      
     TRS:
      activate(n__from(X)) -> from(X)
      activate(n__first(X1,X2)) -> first(X1,X2)
      activate(X) -> X
      from(X) -> cons(X,n__from(s(X)))
      from(X) -> n__from(X)
      first(0(),Z) -> nil()
      first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z)))
      first(X1,X2) -> n__first(X1,X2)
    Qed