YES

Problem:
 active(2nd(cons(X,cons(Y,Z)))) -> mark(Y)
 active(from(X)) -> mark(cons(X,from(s(X))))
 active(2nd(X)) -> 2nd(active(X))
 active(cons(X1,X2)) -> cons(active(X1),X2)
 active(from(X)) -> from(active(X))
 active(s(X)) -> s(active(X))
 2nd(mark(X)) -> mark(2nd(X))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 from(mark(X)) -> mark(from(X))
 s(mark(X)) -> mark(s(X))
 proper(2nd(X)) -> 2nd(proper(X))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(from(X)) -> from(proper(X))
 proper(s(X)) -> s(proper(X))
 2nd(ok(X)) -> ok(2nd(X))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 from(ok(X)) -> ok(from(X))
 s(ok(X)) -> ok(s(X))
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))

Proof:
 DP Processor:
  DPs:
   active#(from(X)) -> s#(X)
   active#(from(X)) -> from#(s(X))
   active#(from(X)) -> cons#(X,from(s(X)))
   active#(2nd(X)) -> active#(X)
   active#(2nd(X)) -> 2nd#(active(X))
   active#(cons(X1,X2)) -> active#(X1)
   active#(cons(X1,X2)) -> cons#(active(X1),X2)
   active#(from(X)) -> active#(X)
   active#(from(X)) -> from#(active(X))
   active#(s(X)) -> active#(X)
   active#(s(X)) -> s#(active(X))
   2nd#(mark(X)) -> 2nd#(X)
   cons#(mark(X1),X2) -> cons#(X1,X2)
   from#(mark(X)) -> from#(X)
   s#(mark(X)) -> s#(X)
   proper#(2nd(X)) -> proper#(X)
   proper#(2nd(X)) -> 2nd#(proper(X))
   proper#(cons(X1,X2)) -> proper#(X2)
   proper#(cons(X1,X2)) -> proper#(X1)
   proper#(cons(X1,X2)) -> cons#(proper(X1),proper(X2))
   proper#(from(X)) -> proper#(X)
   proper#(from(X)) -> from#(proper(X))
   proper#(s(X)) -> proper#(X)
   proper#(s(X)) -> s#(proper(X))
   2nd#(ok(X)) -> 2nd#(X)
   cons#(ok(X1),ok(X2)) -> cons#(X1,X2)
   from#(ok(X)) -> from#(X)
   s#(ok(X)) -> s#(X)
   top#(mark(X)) -> proper#(X)
   top#(mark(X)) -> top#(proper(X))
   top#(ok(X)) -> active#(X)
   top#(ok(X)) -> top#(active(X))
  TRS:
   active(2nd(cons(X,cons(Y,Z)))) -> mark(Y)
   active(from(X)) -> mark(cons(X,from(s(X))))
   active(2nd(X)) -> 2nd(active(X))
   active(cons(X1,X2)) -> cons(active(X1),X2)
   active(from(X)) -> from(active(X))
   active(s(X)) -> s(active(X))
   2nd(mark(X)) -> mark(2nd(X))
   cons(mark(X1),X2) -> mark(cons(X1,X2))
   from(mark(X)) -> mark(from(X))
   s(mark(X)) -> mark(s(X))
   proper(2nd(X)) -> 2nd(proper(X))
   proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
   proper(from(X)) -> from(proper(X))
   proper(s(X)) -> s(proper(X))
   2nd(ok(X)) -> ok(2nd(X))
   cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
   from(ok(X)) -> ok(from(X))
   s(ok(X)) -> ok(s(X))
   top(mark(X)) -> top(proper(X))
   top(ok(X)) -> top(active(X))
  Usable Rule Processor:
   DPs:
    active#(from(X)) -> s#(X)
    active#(from(X)) -> from#(s(X))
    active#(from(X)) -> cons#(X,from(s(X)))
    active#(2nd(X)) -> active#(X)
    active#(2nd(X)) -> 2nd#(active(X))
    active#(cons(X1,X2)) -> active#(X1)
    active#(cons(X1,X2)) -> cons#(active(X1),X2)
    active#(from(X)) -> active#(X)
    active#(from(X)) -> from#(active(X))
    active#(s(X)) -> active#(X)
    active#(s(X)) -> s#(active(X))
    2nd#(mark(X)) -> 2nd#(X)
    cons#(mark(X1),X2) -> cons#(X1,X2)
    from#(mark(X)) -> from#(X)
    s#(mark(X)) -> s#(X)
    proper#(2nd(X)) -> proper#(X)
    proper#(2nd(X)) -> 2nd#(proper(X))
    proper#(cons(X1,X2)) -> proper#(X2)
    proper#(cons(X1,X2)) -> proper#(X1)
    proper#(cons(X1,X2)) -> cons#(proper(X1),proper(X2))
    proper#(from(X)) -> proper#(X)
    proper#(from(X)) -> from#(proper(X))
    proper#(s(X)) -> proper#(X)
    proper#(s(X)) -> s#(proper(X))
    2nd#(ok(X)) -> 2nd#(X)
    cons#(ok(X1),ok(X2)) -> cons#(X1,X2)
    from#(ok(X)) -> from#(X)
    s#(ok(X)) -> s#(X)
    top#(mark(X)) -> proper#(X)
    top#(mark(X)) -> top#(proper(X))
    top#(ok(X)) -> active#(X)
    top#(ok(X)) -> top#(active(X))
   TRS:
    s(mark(X)) -> mark(s(X))
    s(ok(X)) -> ok(s(X))
    from(mark(X)) -> mark(from(X))
    from(ok(X)) -> ok(from(X))
    active(2nd(cons(X,cons(Y,Z)))) -> mark(Y)
    active(from(X)) -> mark(cons(X,from(s(X))))
    active(2nd(X)) -> 2nd(active(X))
    active(cons(X1,X2)) -> cons(active(X1),X2)
    active(from(X)) -> from(active(X))
    active(s(X)) -> s(active(X))
    cons(mark(X1),X2) -> mark(cons(X1,X2))
    cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
    2nd(mark(X)) -> mark(2nd(X))
    2nd(ok(X)) -> ok(2nd(X))
    proper(2nd(X)) -> 2nd(proper(X))
    proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
    proper(from(X)) -> from(proper(X))
    proper(s(X)) -> s(proper(X))
   Matrix Interpretation Processor: dim=1
    
    usable rules:
     s(mark(X)) -> mark(s(X))
     s(ok(X)) -> ok(s(X))
     from(mark(X)) -> mark(from(X))
     from(ok(X)) -> ok(from(X))
     active(2nd(cons(X,cons(Y,Z)))) -> mark(Y)
     active(from(X)) -> mark(cons(X,from(s(X))))
     active(2nd(X)) -> 2nd(active(X))
     active(cons(X1,X2)) -> cons(active(X1),X2)
     active(from(X)) -> from(active(X))
     active(s(X)) -> s(active(X))
     cons(mark(X1),X2) -> mark(cons(X1,X2))
     cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
     2nd(mark(X)) -> mark(2nd(X))
     2nd(ok(X)) -> ok(2nd(X))
     proper(2nd(X)) -> 2nd(proper(X))
     proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
     proper(from(X)) -> from(proper(X))
     proper(s(X)) -> s(proper(X))
    interpretation:
     [top#](x0) = 3x0 + 6,
     
     [proper#](x0) = 3x0 + 4,
     
     [2nd#](x0) = 2x0,
     
     [cons#](x0, x1) = 2x0 + x1 + 6,
     
     [from#](x0) = 2x0 + 2,
     
     [s#](x0) = 2x0 + 1,
     
     [active#](x0) = 5x0 + 4,
     
     [ok](x0) = 5x0 + 4,
     
     [proper](x0) = x0,
     
     [s](x0) = 4x0 + 1,
     
     [from](x0) = 4x0 + 3,
     
     [mark](x0) = x0 + 1,
     
     [active](x0) = 5x0 + 1,
     
     [2nd](x0) = 2x0 + 1,
     
     [cons](x0, x1) = 2x0 + x1 + 1
    orientation:
     active#(from(X)) = 20X + 19 >= 2X + 1 = s#(X)
     
     active#(from(X)) = 20X + 19 >= 8X + 4 = from#(s(X))
     
     active#(from(X)) = 20X + 19 >= 18X + 13 = cons#(X,from(s(X)))
     
     active#(2nd(X)) = 10X + 9 >= 5X + 4 = active#(X)
     
     active#(2nd(X)) = 10X + 9 >= 10X + 2 = 2nd#(active(X))
     
     active#(cons(X1,X2)) = 10X1 + 5X2 + 9 >= 5X1 + 4 = active#(X1)
     
     active#(cons(X1,X2)) = 10X1 + 5X2 + 9 >= 10X1 + X2 + 8 = cons#(active(X1),X2)
     
     active#(from(X)) = 20X + 19 >= 5X + 4 = active#(X)
     
     active#(from(X)) = 20X + 19 >= 10X + 4 = from#(active(X))
     
     active#(s(X)) = 20X + 9 >= 5X + 4 = active#(X)
     
     active#(s(X)) = 20X + 9 >= 10X + 3 = s#(active(X))
     
     2nd#(mark(X)) = 2X + 2 >= 2X = 2nd#(X)
     
     cons#(mark(X1),X2) = 2X1 + X2 + 8 >= 2X1 + X2 + 6 = cons#(X1,X2)
     
     from#(mark(X)) = 2X + 4 >= 2X + 2 = from#(X)
     
     s#(mark(X)) = 2X + 3 >= 2X + 1 = s#(X)
     
     proper#(2nd(X)) = 6X + 7 >= 3X + 4 = proper#(X)
     
     proper#(2nd(X)) = 6X + 7 >= 2X = 2nd#(proper(X))
     
     proper#(cons(X1,X2)) = 6X1 + 3X2 + 7 >= 3X2 + 4 = proper#(X2)
     
     proper#(cons(X1,X2)) = 6X1 + 3X2 + 7 >= 3X1 + 4 = proper#(X1)
     
     proper#(cons(X1,X2)) = 6X1 + 3X2 + 7 >= 2X1 + X2 + 6 = cons#(proper(X1),proper(X2))
     
     proper#(from(X)) = 12X + 13 >= 3X + 4 = proper#(X)
     
     proper#(from(X)) = 12X + 13 >= 2X + 2 = from#(proper(X))
     
     proper#(s(X)) = 12X + 7 >= 3X + 4 = proper#(X)
     
     proper#(s(X)) = 12X + 7 >= 2X + 1 = s#(proper(X))
     
     2nd#(ok(X)) = 10X + 8 >= 2X = 2nd#(X)
     
     cons#(ok(X1),ok(X2)) = 10X1 + 5X2 + 18 >= 2X1 + X2 + 6 = cons#(X1,X2)
     
     from#(ok(X)) = 10X + 10 >= 2X + 2 = from#(X)
     
     s#(ok(X)) = 10X + 9 >= 2X + 1 = s#(X)
     
     top#(mark(X)) = 3X + 9 >= 3X + 4 = proper#(X)
     
     top#(mark(X)) = 3X + 9 >= 3X + 6 = top#(proper(X))
     
     top#(ok(X)) = 15X + 18 >= 5X + 4 = active#(X)
     
     top#(ok(X)) = 15X + 18 >= 15X + 9 = top#(active(X))
     
     s(mark(X)) = 4X + 5 >= 4X + 2 = mark(s(X))
     
     s(ok(X)) = 20X + 17 >= 20X + 9 = ok(s(X))
     
     from(mark(X)) = 4X + 7 >= 4X + 4 = mark(from(X))
     
     from(ok(X)) = 20X + 19 >= 20X + 19 = ok(from(X))
     
     active(2nd(cons(X,cons(Y,Z)))) = 20X + 20Y + 10Z + 26 >= Y + 1 = mark(Y)
     
     active(from(X)) = 20X + 16 >= 18X + 9 = mark(cons(X,from(s(X))))
     
     active(2nd(X)) = 10X + 6 >= 10X + 3 = 2nd(active(X))
     
     active(cons(X1,X2)) = 10X1 + 5X2 + 6 >= 10X1 + X2 + 3 = cons(active(X1),X2)
     
     active(from(X)) = 20X + 16 >= 20X + 7 = from(active(X))
     
     active(s(X)) = 20X + 6 >= 20X + 5 = s(active(X))
     
     cons(mark(X1),X2) = 2X1 + X2 + 3 >= 2X1 + X2 + 2 = mark(cons(X1,X2))
     
     cons(ok(X1),ok(X2)) = 10X1 + 5X2 + 13 >= 10X1 + 5X2 + 9 = ok(cons(X1,X2))
     
     2nd(mark(X)) = 2X + 3 >= 2X + 2 = mark(2nd(X))
     
     2nd(ok(X)) = 10X + 9 >= 10X + 9 = ok(2nd(X))
     
     proper(2nd(X)) = 2X + 1 >= 2X + 1 = 2nd(proper(X))
     
     proper(cons(X1,X2)) = 2X1 + X2 + 1 >= 2X1 + X2 + 1 = cons(proper(X1),proper(X2))
     
     proper(from(X)) = 4X + 3 >= 4X + 3 = from(proper(X))
     
     proper(s(X)) = 4X + 1 >= 4X + 1 = s(proper(X))
    problem:
     DPs:
      
     TRS:
      s(mark(X)) -> mark(s(X))
      s(ok(X)) -> ok(s(X))
      from(mark(X)) -> mark(from(X))
      from(ok(X)) -> ok(from(X))
      active(2nd(cons(X,cons(Y,Z)))) -> mark(Y)
      active(from(X)) -> mark(cons(X,from(s(X))))
      active(2nd(X)) -> 2nd(active(X))
      active(cons(X1,X2)) -> cons(active(X1),X2)
      active(from(X)) -> from(active(X))
      active(s(X)) -> s(active(X))
      cons(mark(X1),X2) -> mark(cons(X1,X2))
      cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
      2nd(mark(X)) -> mark(2nd(X))
      2nd(ok(X)) -> ok(2nd(X))
      proper(2nd(X)) -> 2nd(proper(X))
      proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
      proper(from(X)) -> from(proper(X))
      proper(s(X)) -> s(proper(X))
    Qed