YES

Problem:
 a__2nd(cons(X,cons(Y,Z))) -> mark(Y)
 a__from(X) -> cons(mark(X),from(s(X)))
 mark(2nd(X)) -> a__2nd(mark(X))
 mark(from(X)) -> a__from(mark(X))
 mark(cons(X1,X2)) -> cons(mark(X1),X2)
 mark(s(X)) -> s(mark(X))
 a__2nd(X) -> 2nd(X)
 a__from(X) -> from(X)

Proof:
 DP Processor:
  DPs:
   a__2nd#(cons(X,cons(Y,Z))) -> mark#(Y)
   a__from#(X) -> mark#(X)
   mark#(2nd(X)) -> mark#(X)
   mark#(2nd(X)) -> a__2nd#(mark(X))
   mark#(from(X)) -> mark#(X)
   mark#(from(X)) -> a__from#(mark(X))
   mark#(cons(X1,X2)) -> mark#(X1)
   mark#(s(X)) -> mark#(X)
  TRS:
   a__2nd(cons(X,cons(Y,Z))) -> mark(Y)
   a__from(X) -> cons(mark(X),from(s(X)))
   mark(2nd(X)) -> a__2nd(mark(X))
   mark(from(X)) -> a__from(mark(X))
   mark(cons(X1,X2)) -> cons(mark(X1),X2)
   mark(s(X)) -> s(mark(X))
   a__2nd(X) -> 2nd(X)
   a__from(X) -> from(X)
  TDG Processor:
   DPs:
    a__2nd#(cons(X,cons(Y,Z))) -> mark#(Y)
    a__from#(X) -> mark#(X)
    mark#(2nd(X)) -> mark#(X)
    mark#(2nd(X)) -> a__2nd#(mark(X))
    mark#(from(X)) -> mark#(X)
    mark#(from(X)) -> a__from#(mark(X))
    mark#(cons(X1,X2)) -> mark#(X1)
    mark#(s(X)) -> mark#(X)
   TRS:
    a__2nd(cons(X,cons(Y,Z))) -> mark(Y)
    a__from(X) -> cons(mark(X),from(s(X)))
    mark(2nd(X)) -> a__2nd(mark(X))
    mark(from(X)) -> a__from(mark(X))
    mark(cons(X1,X2)) -> cons(mark(X1),X2)
    mark(s(X)) -> s(mark(X))
    a__2nd(X) -> 2nd(X)
    a__from(X) -> from(X)
   graph:
    a__from#(X) -> mark#(X) -> mark#(s(X)) -> mark#(X)
    a__from#(X) -> mark#(X) -> mark#(cons(X1,X2)) -> mark#(X1)
    a__from#(X) -> mark#(X) -> mark#(from(X)) -> a__from#(mark(X))
    a__from#(X) -> mark#(X) -> mark#(from(X)) -> mark#(X)
    a__from#(X) -> mark#(X) -> mark#(2nd(X)) -> a__2nd#(mark(X))
    a__from#(X) -> mark#(X) -> mark#(2nd(X)) -> mark#(X)
    mark#(2nd(X)) -> mark#(X) -> mark#(s(X)) -> mark#(X)
    mark#(2nd(X)) -> mark#(X) -> mark#(cons(X1,X2)) -> mark#(X1)
    mark#(2nd(X)) -> mark#(X) -> mark#(from(X)) -> a__from#(mark(X))
    mark#(2nd(X)) -> mark#(X) -> mark#(from(X)) -> mark#(X)
    mark#(2nd(X)) -> mark#(X) -> mark#(2nd(X)) -> a__2nd#(mark(X))
    mark#(2nd(X)) -> mark#(X) -> mark#(2nd(X)) -> mark#(X)
    mark#(2nd(X)) -> a__2nd#(mark(X)) ->
    a__2nd#(cons(X,cons(Y,Z))) -> mark#(Y)
    mark#(from(X)) -> a__from#(mark(X)) -> a__from#(X) -> mark#(X)
    mark#(from(X)) -> mark#(X) -> mark#(s(X)) -> mark#(X)
    mark#(from(X)) -> mark#(X) -> mark#(cons(X1,X2)) -> mark#(X1)
    mark#(from(X)) -> mark#(X) -> mark#(from(X)) -> a__from#(mark(X))
    mark#(from(X)) -> mark#(X) -> mark#(from(X)) -> mark#(X)
    mark#(from(X)) -> mark#(X) -> mark#(2nd(X)) -> a__2nd#(mark(X))
    mark#(from(X)) -> mark#(X) -> mark#(2nd(X)) -> mark#(X)
    mark#(s(X)) -> mark#(X) -> mark#(s(X)) -> mark#(X)
    mark#(s(X)) -> mark#(X) -> mark#(cons(X1,X2)) -> mark#(X1)
    mark#(s(X)) -> mark#(X) -> mark#(from(X)) -> a__from#(mark(X))
    mark#(s(X)) -> mark#(X) -> mark#(from(X)) -> mark#(X)
    mark#(s(X)) -> mark#(X) -> mark#(2nd(X)) -> a__2nd#(mark(X))
    mark#(s(X)) -> mark#(X) -> mark#(2nd(X)) -> mark#(X)
    mark#(cons(X1,X2)) -> mark#(X1) -> mark#(s(X)) -> mark#(X)
    mark#(cons(X1,X2)) -> mark#(X1) ->
    mark#(cons(X1,X2)) -> mark#(X1)
    mark#(cons(X1,X2)) -> mark#(X1) ->
    mark#(from(X)) -> a__from#(mark(X))
    mark#(cons(X1,X2)) -> mark#(X1) -> mark#(from(X)) -> mark#(X)
    mark#(cons(X1,X2)) -> mark#(X1) ->
    mark#(2nd(X)) -> a__2nd#(mark(X))
    mark#(cons(X1,X2)) -> mark#(X1) ->
    mark#(2nd(X)) -> mark#(X)
    a__2nd#(cons(X,cons(Y,Z))) -> mark#(Y) ->
    mark#(s(X)) -> mark#(X)
    a__2nd#(cons(X,cons(Y,Z))) -> mark#(Y) ->
    mark#(cons(X1,X2)) -> mark#(X1)
    a__2nd#(cons(X,cons(Y,Z))) -> mark#(Y) ->
    mark#(from(X)) -> a__from#(mark(X))
    a__2nd#(cons(X,cons(Y,Z))) -> mark#(Y) ->
    mark#(from(X)) -> mark#(X)
    a__2nd#(cons(X,cons(Y,Z))) -> mark#(Y) ->
    mark#(2nd(X)) -> a__2nd#(mark(X))
    a__2nd#(cons(X,cons(Y,Z))) -> mark#(Y) -> mark#(2nd(X)) -> mark#(X)
   Arctic Interpretation Processor:
    dimension: 1
    usable rules:
     a__2nd(cons(X,cons(Y,Z))) -> mark(Y)
     a__from(X) -> cons(mark(X),from(s(X)))
     mark(2nd(X)) -> a__2nd(mark(X))
     mark(from(X)) -> a__from(mark(X))
     mark(cons(X1,X2)) -> cons(mark(X1),X2)
     mark(s(X)) -> s(mark(X))
     a__2nd(X) -> 2nd(X)
     a__from(X) -> from(X)
    interpretation:
     [a__from#](x0) = 4x0 + 0,
     
     [mark#](x0) = x0,
     
     [a__2nd#](x0) = 3x0 + 0,
     
     [2nd](x0) = 3x0 + 3,
     
     [from](x0) = 6x0 + 6,
     
     [s](x0) = x0 + 0,
     
     [a__from](x0) = 6x0 + 6,
     
     [mark](x0) = x0 + 0,
     
     [a__2nd](x0) = 3x0 + 3,
     
     [cons](x0, x1) = x0 + x1 + -3
    orientation:
     a__2nd#(cons(X,cons(Y,Z))) = 3X + 3Y + 3Z + 0 >= Y = mark#(Y)
     
     a__from#(X) = 4X + 0 >= X = mark#(X)
     
     mark#(2nd(X)) = 3X + 3 >= X = mark#(X)
     
     mark#(2nd(X)) = 3X + 3 >= 3X + 3 = a__2nd#(mark(X))
     
     mark#(from(X)) = 6X + 6 >= X = mark#(X)
     
     mark#(from(X)) = 6X + 6 >= 4X + 4 = a__from#(mark(X))
     
     mark#(cons(X1,X2)) = X1 + X2 + -3 >= X1 = mark#(X1)
     
     mark#(s(X)) = X + 0 >= X = mark#(X)
     
     a__2nd(cons(X,cons(Y,Z))) = 3X + 3Y + 3Z + 3 >= Y + 0 = mark(Y)
     
     a__from(X) = 6X + 6 >= 6X + 6 = cons(mark(X),from(s(X)))
     
     mark(2nd(X)) = 3X + 3 >= 3X + 3 = a__2nd(mark(X))
     
     mark(from(X)) = 6X + 6 >= 6X + 6 = a__from(mark(X))
     
     mark(cons(X1,X2)) = X1 + X2 + 0 >= X1 + X2 + 0 = cons(mark(X1),X2)
     
     mark(s(X)) = X + 0 >= X + 0 = s(mark(X))
     
     a__2nd(X) = 3X + 3 >= 3X + 3 = 2nd(X)
     
     a__from(X) = 6X + 6 >= 6X + 6 = from(X)
    problem:
     DPs:
      mark#(2nd(X)) -> a__2nd#(mark(X))
      mark#(cons(X1,X2)) -> mark#(X1)
      mark#(s(X)) -> mark#(X)
     TRS:
      a__2nd(cons(X,cons(Y,Z))) -> mark(Y)
      a__from(X) -> cons(mark(X),from(s(X)))
      mark(2nd(X)) -> a__2nd(mark(X))
      mark(from(X)) -> a__from(mark(X))
      mark(cons(X1,X2)) -> cons(mark(X1),X2)
      mark(s(X)) -> s(mark(X))
      a__2nd(X) -> 2nd(X)
      a__from(X) -> from(X)
    Restore Modifier:
     DPs:
      mark#(2nd(X)) -> a__2nd#(mark(X))
      mark#(cons(X1,X2)) -> mark#(X1)
      mark#(s(X)) -> mark#(X)
     TRS:
      a__2nd(cons(X,cons(Y,Z))) -> mark(Y)
      a__from(X) -> cons(mark(X),from(s(X)))
      mark(2nd(X)) -> a__2nd(mark(X))
      mark(from(X)) -> a__from(mark(X))
      mark(cons(X1,X2)) -> cons(mark(X1),X2)
      mark(s(X)) -> s(mark(X))
      a__2nd(X) -> 2nd(X)
      a__from(X) -> from(X)
     SCC Processor:
      #sccs: 1
      #rules: 2
      #arcs: 38/9
      DPs:
       mark#(s(X)) -> mark#(X)
       mark#(cons(X1,X2)) -> mark#(X1)
      TRS:
       a__2nd(cons(X,cons(Y,Z))) -> mark(Y)
       a__from(X) -> cons(mark(X),from(s(X)))
       mark(2nd(X)) -> a__2nd(mark(X))
       mark(from(X)) -> a__from(mark(X))
       mark(cons(X1,X2)) -> cons(mark(X1),X2)
       mark(s(X)) -> s(mark(X))
       a__2nd(X) -> 2nd(X)
       a__from(X) -> from(X)
      Subterm Criterion Processor:
       simple projection:
        pi(mark#) = 0
       problem:
        DPs:
         
        TRS:
         a__2nd(cons(X,cons(Y,Z))) -> mark(Y)
         a__from(X) -> cons(mark(X),from(s(X)))
         mark(2nd(X)) -> a__2nd(mark(X))
         mark(from(X)) -> a__from(mark(X))
         mark(cons(X1,X2)) -> cons(mark(X1),X2)
         mark(s(X)) -> s(mark(X))
         a__2nd(X) -> 2nd(X)
         a__from(X) -> from(X)
       Qed