YES

Problem:
 active(2nd(cons1(X,cons(Y,Z)))) -> mark(Y)
 active(2nd(cons(X,X1))) -> mark(2nd(cons1(X,X1)))
 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))
 active(cons1(X1,X2)) -> cons1(active(X1),X2)
 active(cons1(X1,X2)) -> cons1(X1,active(X2))
 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))
 cons1(mark(X1),X2) -> mark(cons1(X1,X2))
 cons1(X1,mark(X2)) -> mark(cons1(X1,X2))
 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))
 proper(cons1(X1,X2)) -> cons1(proper(X1),proper(X2))
 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))
 cons1(ok(X1),ok(X2)) -> ok(cons1(X1,X2))
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))

Proof:
 Matrix Interpretation Processor: dim=1
  
  interpretation:
   [top](x0) = 2x0,
   
   [ok](x0) = 4x0 + 1,
   
   [proper](x0) = x0,
   
   [s](x0) = x0,
   
   [from](x0) = x0,
   
   [mark](x0) = x0,
   
   [active](x0) = 3x0 + 1,
   
   [2nd](x0) = x0,
   
   [cons1](x0, x1) = x0 + x1,
   
   [cons](x0, x1) = x0 + 2x1
  orientation:
   active(2nd(cons1(X,cons(Y,Z)))) = 3X + 3Y + 6Z + 1 >= Y = mark(Y)
   
   active(2nd(cons(X,X1))) = 3X + 6X1 + 1 >= X + X1 = mark(2nd(cons1(X,X1)))
   
   active(from(X)) = 3X + 1 >= 3X = mark(cons(X,from(s(X))))
   
   active(2nd(X)) = 3X + 1 >= 3X + 1 = 2nd(active(X))
   
   active(cons(X1,X2)) = 3X1 + 6X2 + 1 >= 3X1 + 2X2 + 1 = cons(active(X1),X2)
   
   active(from(X)) = 3X + 1 >= 3X + 1 = from(active(X))
   
   active(s(X)) = 3X + 1 >= 3X + 1 = s(active(X))
   
   active(cons1(X1,X2)) = 3X1 + 3X2 + 1 >= 3X1 + X2 + 1 = cons1(active(X1),X2)
   
   active(cons1(X1,X2)) = 3X1 + 3X2 + 1 >= X1 + 3X2 + 1 = cons1(X1,active(X2))
   
   2nd(mark(X)) = X >= X = mark(2nd(X))
   
   cons(mark(X1),X2) = X1 + 2X2 >= X1 + 2X2 = mark(cons(X1,X2))
   
   from(mark(X)) = X >= X = mark(from(X))
   
   s(mark(X)) = X >= X = mark(s(X))
   
   cons1(mark(X1),X2) = X1 + X2 >= X1 + X2 = mark(cons1(X1,X2))
   
   cons1(X1,mark(X2)) = X1 + X2 >= X1 + X2 = mark(cons1(X1,X2))
   
   proper(2nd(X)) = X >= X = 2nd(proper(X))
   
   proper(cons(X1,X2)) = X1 + 2X2 >= X1 + 2X2 = cons(proper(X1),proper(X2))
   
   proper(from(X)) = X >= X = from(proper(X))
   
   proper(s(X)) = X >= X = s(proper(X))
   
   proper(cons1(X1,X2)) = X1 + X2 >= X1 + X2 = cons1(proper(X1),proper(X2))
   
   2nd(ok(X)) = 4X + 1 >= 4X + 1 = ok(2nd(X))
   
   cons(ok(X1),ok(X2)) = 4X1 + 8X2 + 3 >= 4X1 + 8X2 + 1 = ok(cons(X1,X2))
   
   from(ok(X)) = 4X + 1 >= 4X + 1 = ok(from(X))
   
   s(ok(X)) = 4X + 1 >= 4X + 1 = ok(s(X))
   
   cons1(ok(X1),ok(X2)) = 4X1 + 4X2 + 2 >= 4X1 + 4X2 + 1 = ok(cons1(X1,X2))
   
   top(mark(X)) = 2X >= 2X = top(proper(X))
   
   top(ok(X)) = 8X + 2 >= 6X + 2 = top(active(X))
  problem:
   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))
   active(cons1(X1,X2)) -> cons1(active(X1),X2)
   active(cons1(X1,X2)) -> cons1(X1,active(X2))
   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))
   cons1(mark(X1),X2) -> mark(cons1(X1,X2))
   cons1(X1,mark(X2)) -> mark(cons1(X1,X2))
   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))
   proper(cons1(X1,X2)) -> cons1(proper(X1),proper(X2))
   2nd(ok(X)) -> ok(2nd(X))
   from(ok(X)) -> ok(from(X))
   s(ok(X)) -> ok(s(X))
   top(mark(X)) -> top(proper(X))
   top(ok(X)) -> top(active(X))
  DP Processor:
   DPs:
    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))
    active#(cons1(X1,X2)) -> active#(X1)
    active#(cons1(X1,X2)) -> cons1#(active(X1),X2)
    active#(cons1(X1,X2)) -> active#(X2)
    active#(cons1(X1,X2)) -> cons1#(X1,active(X2))
    2nd#(mark(X)) -> 2nd#(X)
    cons#(mark(X1),X2) -> cons#(X1,X2)
    from#(mark(X)) -> from#(X)
    s#(mark(X)) -> s#(X)
    cons1#(mark(X1),X2) -> cons1#(X1,X2)
    cons1#(X1,mark(X2)) -> cons1#(X1,X2)
    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))
    proper#(cons1(X1,X2)) -> proper#(X2)
    proper#(cons1(X1,X2)) -> proper#(X1)
    proper#(cons1(X1,X2)) -> cons1#(proper(X1),proper(X2))
    2nd#(ok(X)) -> 2nd#(X)
    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(X)) -> 2nd(active(X))
    active(cons(X1,X2)) -> cons(active(X1),X2)
    active(from(X)) -> from(active(X))
    active(s(X)) -> s(active(X))
    active(cons1(X1,X2)) -> cons1(active(X1),X2)
    active(cons1(X1,X2)) -> cons1(X1,active(X2))
    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))
    cons1(mark(X1),X2) -> mark(cons1(X1,X2))
    cons1(X1,mark(X2)) -> mark(cons1(X1,X2))
    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))
    proper(cons1(X1,X2)) -> cons1(proper(X1),proper(X2))
    2nd(ok(X)) -> ok(2nd(X))
    from(ok(X)) -> ok(from(X))
    s(ok(X)) -> ok(s(X))
    top(mark(X)) -> top(proper(X))
    top(ok(X)) -> top(active(X))
   TDG Processor:
    DPs:
     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))
     active#(cons1(X1,X2)) -> active#(X1)
     active#(cons1(X1,X2)) -> cons1#(active(X1),X2)
     active#(cons1(X1,X2)) -> active#(X2)
     active#(cons1(X1,X2)) -> cons1#(X1,active(X2))
     2nd#(mark(X)) -> 2nd#(X)
     cons#(mark(X1),X2) -> cons#(X1,X2)
     from#(mark(X)) -> from#(X)
     s#(mark(X)) -> s#(X)
     cons1#(mark(X1),X2) -> cons1#(X1,X2)
     cons1#(X1,mark(X2)) -> cons1#(X1,X2)
     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))
     proper#(cons1(X1,X2)) -> proper#(X2)
     proper#(cons1(X1,X2)) -> proper#(X1)
     proper#(cons1(X1,X2)) -> cons1#(proper(X1),proper(X2))
     2nd#(ok(X)) -> 2nd#(X)
     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(X)) -> 2nd(active(X))
     active(cons(X1,X2)) -> cons(active(X1),X2)
     active(from(X)) -> from(active(X))
     active(s(X)) -> s(active(X))
     active(cons1(X1,X2)) -> cons1(active(X1),X2)
     active(cons1(X1,X2)) -> cons1(X1,active(X2))
     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))
     cons1(mark(X1),X2) -> mark(cons1(X1,X2))
     cons1(X1,mark(X2)) -> mark(cons1(X1,X2))
     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))
     proper(cons1(X1,X2)) -> cons1(proper(X1),proper(X2))
     2nd(ok(X)) -> ok(2nd(X))
     from(ok(X)) -> ok(from(X))
     s(ok(X)) -> ok(s(X))
     top(mark(X)) -> top(proper(X))
     top(ok(X)) -> top(active(X))
    graph:
     top#(ok(X)) -> top#(active(X)) -> top#(ok(X)) -> top#(active(X))
     top#(ok(X)) -> top#(active(X)) -> top#(ok(X)) -> active#(X)
     top#(ok(X)) -> top#(active(X)) ->
     top#(mark(X)) -> top#(proper(X))
     top#(ok(X)) -> top#(active(X)) -> top#(mark(X)) -> proper#(X)
     top#(ok(X)) -> active#(X) ->
     active#(cons1(X1,X2)) -> cons1#(X1,active(X2))
     top#(ok(X)) -> active#(X) -> active#(cons1(X1,X2)) -> active#(X2)
     top#(ok(X)) -> active#(X) ->
     active#(cons1(X1,X2)) -> cons1#(active(X1),X2)
     top#(ok(X)) -> active#(X) -> active#(cons1(X1,X2)) -> active#(X1)
     top#(ok(X)) -> active#(X) -> active#(s(X)) -> s#(active(X))
     top#(ok(X)) -> active#(X) -> active#(s(X)) -> active#(X)
     top#(ok(X)) -> active#(X) -> active#(from(X)) -> from#(active(X))
     top#(ok(X)) -> active#(X) -> active#(from(X)) -> active#(X)
     top#(ok(X)) -> active#(X) ->
     active#(cons(X1,X2)) -> cons#(active(X1),X2)
     top#(ok(X)) -> active#(X) -> active#(cons(X1,X2)) -> active#(X1)
     top#(ok(X)) -> active#(X) -> active#(2nd(X)) -> 2nd#(active(X))
     top#(ok(X)) -> active#(X) -> active#(2nd(X)) -> active#(X)
     top#(mark(X)) -> top#(proper(X)) ->
     top#(ok(X)) -> top#(active(X))
     top#(mark(X)) -> top#(proper(X)) -> top#(ok(X)) -> active#(X)
     top#(mark(X)) -> top#(proper(X)) ->
     top#(mark(X)) -> top#(proper(X))
     top#(mark(X)) -> top#(proper(X)) -> top#(mark(X)) -> proper#(X)
     top#(mark(X)) -> proper#(X) ->
     proper#(cons1(X1,X2)) -> cons1#(proper(X1),proper(X2))
     top#(mark(X)) -> proper#(X) -> proper#(cons1(X1,X2)) -> proper#(X1)
     top#(mark(X)) -> proper#(X) -> proper#(cons1(X1,X2)) -> proper#(X2)
     top#(mark(X)) -> proper#(X) -> proper#(s(X)) -> s#(proper(X))
     top#(mark(X)) -> proper#(X) -> proper#(s(X)) -> proper#(X)
     top#(mark(X)) -> proper#(X) -> proper#(from(X)) -> from#(proper(X))
     top#(mark(X)) -> proper#(X) -> proper#(from(X)) -> proper#(X)
     top#(mark(X)) -> proper#(X) ->
     proper#(cons(X1,X2)) -> cons#(proper(X1),proper(X2))
     top#(mark(X)) -> proper#(X) -> proper#(cons(X1,X2)) -> proper#(X1)
     top#(mark(X)) -> proper#(X) -> proper#(cons(X1,X2)) -> proper#(X2)
     top#(mark(X)) -> proper#(X) -> proper#(2nd(X)) -> 2nd#(proper(X))
     top#(mark(X)) -> proper#(X) -> proper#(2nd(X)) -> proper#(X)
     proper#(s(X)) -> proper#(X) ->
     proper#(cons1(X1,X2)) -> cons1#(proper(X1),proper(X2))
     proper#(s(X)) -> proper#(X) -> proper#(cons1(X1,X2)) -> proper#(X1)
     proper#(s(X)) -> proper#(X) -> proper#(cons1(X1,X2)) -> proper#(X2)
     proper#(s(X)) -> proper#(X) -> proper#(s(X)) -> s#(proper(X))
     proper#(s(X)) -> proper#(X) -> proper#(s(X)) -> proper#(X)
     proper#(s(X)) -> proper#(X) -> proper#(from(X)) -> from#(proper(X))
     proper#(s(X)) -> proper#(X) -> proper#(from(X)) -> proper#(X)
     proper#(s(X)) -> proper#(X) ->
     proper#(cons(X1,X2)) -> cons#(proper(X1),proper(X2))
     proper#(s(X)) -> proper#(X) -> proper#(cons(X1,X2)) -> proper#(X1)
     proper#(s(X)) -> proper#(X) -> proper#(cons(X1,X2)) -> proper#(X2)
     proper#(s(X)) -> proper#(X) -> proper#(2nd(X)) -> 2nd#(proper(X))
     proper#(s(X)) -> proper#(X) -> proper#(2nd(X)) -> proper#(X)
     proper#(s(X)) -> s#(proper(X)) -> s#(ok(X)) -> s#(X)
     proper#(s(X)) -> s#(proper(X)) -> s#(mark(X)) -> s#(X)
     proper#(from(X)) -> proper#(X) ->
     proper#(cons1(X1,X2)) -> cons1#(proper(X1),proper(X2))
     proper#(from(X)) -> proper#(X) ->
     proper#(cons1(X1,X2)) -> proper#(X1)
     proper#(from(X)) -> proper#(X) ->
     proper#(cons1(X1,X2)) -> proper#(X2)
     proper#(from(X)) -> proper#(X) -> proper#(s(X)) -> s#(proper(X))
     proper#(from(X)) -> proper#(X) -> proper#(s(X)) -> proper#(X)
     proper#(from(X)) -> proper#(X) ->
     proper#(from(X)) -> from#(proper(X))
     proper#(from(X)) -> proper#(X) -> proper#(from(X)) -> proper#(X)
     proper#(from(X)) -> proper#(X) ->
     proper#(cons(X1,X2)) -> cons#(proper(X1),proper(X2))
     proper#(from(X)) -> proper#(X) ->
     proper#(cons(X1,X2)) -> proper#(X1)
     proper#(from(X)) -> proper#(X) ->
     proper#(cons(X1,X2)) -> proper#(X2)
     proper#(from(X)) -> proper#(X) ->
     proper#(2nd(X)) -> 2nd#(proper(X))
     proper#(from(X)) -> proper#(X) ->
     proper#(2nd(X)) -> proper#(X)
     proper#(from(X)) -> from#(proper(X)) ->
     from#(ok(X)) -> from#(X)
     proper#(from(X)) -> from#(proper(X)) ->
     from#(mark(X)) -> from#(X)
     proper#(2nd(X)) -> proper#(X) ->
     proper#(cons1(X1,X2)) -> cons1#(proper(X1),proper(X2))
     proper#(2nd(X)) -> proper#(X) ->
     proper#(cons1(X1,X2)) -> proper#(X1)
     proper#(2nd(X)) -> proper#(X) ->
     proper#(cons1(X1,X2)) -> proper#(X2)
     proper#(2nd(X)) -> proper#(X) -> proper#(s(X)) -> s#(proper(X))
     proper#(2nd(X)) -> proper#(X) -> proper#(s(X)) -> proper#(X)
     proper#(2nd(X)) -> proper#(X) ->
     proper#(from(X)) -> from#(proper(X))
     proper#(2nd(X)) -> proper#(X) -> proper#(from(X)) -> proper#(X)
     proper#(2nd(X)) -> proper#(X) ->
     proper#(cons(X1,X2)) -> cons#(proper(X1),proper(X2))
     proper#(2nd(X)) -> proper#(X) ->
     proper#(cons(X1,X2)) -> proper#(X1)
     proper#(2nd(X)) -> proper#(X) ->
     proper#(cons(X1,X2)) -> proper#(X2)
     proper#(2nd(X)) -> proper#(X) ->
     proper#(2nd(X)) -> 2nd#(proper(X))
     proper#(2nd(X)) -> proper#(X) ->
     proper#(2nd(X)) -> proper#(X)
     proper#(2nd(X)) -> 2nd#(proper(X)) -> 2nd#(ok(X)) -> 2nd#(X)
     proper#(2nd(X)) -> 2nd#(proper(X)) ->
     2nd#(mark(X)) -> 2nd#(X)
     proper#(cons1(X1,X2)) -> proper#(X2) ->
     proper#(cons1(X1,X2)) -> cons1#(proper(X1),proper(X2))
     proper#(cons1(X1,X2)) -> proper#(X2) ->
     proper#(cons1(X1,X2)) -> proper#(X1)
     proper#(cons1(X1,X2)) -> proper#(X2) ->
     proper#(cons1(X1,X2)) -> proper#(X2)
     proper#(cons1(X1,X2)) -> proper#(X2) ->
     proper#(s(X)) -> s#(proper(X))
     proper#(cons1(X1,X2)) -> proper#(X2) ->
     proper#(s(X)) -> proper#(X)
     proper#(cons1(X1,X2)) -> proper#(X2) ->
     proper#(from(X)) -> from#(proper(X))
     proper#(cons1(X1,X2)) -> proper#(X2) ->
     proper#(from(X)) -> proper#(X)
     proper#(cons1(X1,X2)) -> proper#(X2) ->
     proper#(cons(X1,X2)) -> cons#(proper(X1),proper(X2))
     proper#(cons1(X1,X2)) -> proper#(X2) ->
     proper#(cons(X1,X2)) -> proper#(X1)
     proper#(cons1(X1,X2)) -> proper#(X2) ->
     proper#(cons(X1,X2)) -> proper#(X2)
     proper#(cons1(X1,X2)) -> proper#(X2) ->
     proper#(2nd(X)) -> 2nd#(proper(X))
     proper#(cons1(X1,X2)) -> proper#(X2) ->
     proper#(2nd(X)) -> proper#(X)
     proper#(cons1(X1,X2)) -> proper#(X1) ->
     proper#(cons1(X1,X2)) -> cons1#(proper(X1),proper(X2))
     proper#(cons1(X1,X2)) -> proper#(X1) ->
     proper#(cons1(X1,X2)) -> proper#(X1)
     proper#(cons1(X1,X2)) -> proper#(X1) ->
     proper#(cons1(X1,X2)) -> proper#(X2)
     proper#(cons1(X1,X2)) -> proper#(X1) ->
     proper#(s(X)) -> s#(proper(X))
     proper#(cons1(X1,X2)) -> proper#(X1) ->
     proper#(s(X)) -> proper#(X)
     proper#(cons1(X1,X2)) -> proper#(X1) ->
     proper#(from(X)) -> from#(proper(X))
     proper#(cons1(X1,X2)) -> proper#(X1) ->
     proper#(from(X)) -> proper#(X)
     proper#(cons1(X1,X2)) -> proper#(X1) ->
     proper#(cons(X1,X2)) -> cons#(proper(X1),proper(X2))
     proper#(cons1(X1,X2)) -> proper#(X1) ->
     proper#(cons(X1,X2)) -> proper#(X1)
     proper#(cons1(X1,X2)) -> proper#(X1) ->
     proper#(cons(X1,X2)) -> proper#(X2)
     proper#(cons1(X1,X2)) -> proper#(X1) ->
     proper#(2nd(X)) -> 2nd#(proper(X))
     proper#(cons1(X1,X2)) -> proper#(X1) ->
     proper#(2nd(X)) -> proper#(X)
     proper#(cons1(X1,X2)) -> cons1#(proper(X1),proper(X2)) ->
     cons1#(X1,mark(X2)) -> cons1#(X1,X2)
     proper#(cons1(X1,X2)) -> cons1#(proper(X1),proper(X2)) ->
     cons1#(mark(X1),X2) -> cons1#(X1,X2)
     proper#(cons(X1,X2)) -> proper#(X2) ->
     proper#(cons1(X1,X2)) -> cons1#(proper(X1),proper(X2))
     proper#(cons(X1,X2)) -> proper#(X2) ->
     proper#(cons1(X1,X2)) -> proper#(X1)
     proper#(cons(X1,X2)) -> proper#(X2) ->
     proper#(cons1(X1,X2)) -> proper#(X2)
     proper#(cons(X1,X2)) -> proper#(X2) ->
     proper#(s(X)) -> s#(proper(X))
     proper#(cons(X1,X2)) -> proper#(X2) ->
     proper#(s(X)) -> proper#(X)
     proper#(cons(X1,X2)) -> proper#(X2) ->
     proper#(from(X)) -> from#(proper(X))
     proper#(cons(X1,X2)) -> proper#(X2) ->
     proper#(from(X)) -> proper#(X)
     proper#(cons(X1,X2)) -> proper#(X2) ->
     proper#(cons(X1,X2)) -> cons#(proper(X1),proper(X2))
     proper#(cons(X1,X2)) -> proper#(X2) ->
     proper#(cons(X1,X2)) -> proper#(X1)
     proper#(cons(X1,X2)) -> proper#(X2) ->
     proper#(cons(X1,X2)) -> proper#(X2)
     proper#(cons(X1,X2)) -> proper#(X2) ->
     proper#(2nd(X)) -> 2nd#(proper(X))
     proper#(cons(X1,X2)) -> proper#(X2) ->
     proper#(2nd(X)) -> proper#(X)
     proper#(cons(X1,X2)) -> proper#(X1) ->
     proper#(cons1(X1,X2)) -> cons1#(proper(X1),proper(X2))
     proper#(cons(X1,X2)) -> proper#(X1) ->
     proper#(cons1(X1,X2)) -> proper#(X1)
     proper#(cons(X1,X2)) -> proper#(X1) ->
     proper#(cons1(X1,X2)) -> proper#(X2)
     proper#(cons(X1,X2)) -> proper#(X1) ->
     proper#(s(X)) -> s#(proper(X))
     proper#(cons(X1,X2)) -> proper#(X1) ->
     proper#(s(X)) -> proper#(X)
     proper#(cons(X1,X2)) -> proper#(X1) ->
     proper#(from(X)) -> from#(proper(X))
     proper#(cons(X1,X2)) -> proper#(X1) ->
     proper#(from(X)) -> proper#(X)
     proper#(cons(X1,X2)) -> proper#(X1) ->
     proper#(cons(X1,X2)) -> cons#(proper(X1),proper(X2))
     proper#(cons(X1,X2)) -> proper#(X1) ->
     proper#(cons(X1,X2)) -> proper#(X1)
     proper#(cons(X1,X2)) -> proper#(X1) ->
     proper#(cons(X1,X2)) -> proper#(X2)
     proper#(cons(X1,X2)) -> proper#(X1) ->
     proper#(2nd(X)) -> 2nd#(proper(X))
     proper#(cons(X1,X2)) -> proper#(X1) ->
     proper#(2nd(X)) -> proper#(X)
     proper#(cons(X1,X2)) -> cons#(proper(X1),proper(X2)) ->
     cons#(mark(X1),X2) -> cons#(X1,X2)
     cons1#(mark(X1),X2) -> cons1#(X1,X2) ->
     cons1#(X1,mark(X2)) -> cons1#(X1,X2)
     cons1#(mark(X1),X2) -> cons1#(X1,X2) ->
     cons1#(mark(X1),X2) -> cons1#(X1,X2)
     cons1#(X1,mark(X2)) -> cons1#(X1,X2) ->
     cons1#(X1,mark(X2)) -> cons1#(X1,X2)
     cons1#(X1,mark(X2)) -> cons1#(X1,X2) -> cons1#(mark(X1),X2) -> cons1#(X1,X2)
     s#(ok(X)) -> s#(X) -> s#(ok(X)) -> s#(X)
     s#(ok(X)) -> s#(X) -> s#(mark(X)) -> s#(X)
     s#(mark(X)) -> s#(X) -> s#(ok(X)) -> s#(X)
     s#(mark(X)) -> s#(X) -> s#(mark(X)) -> s#(X)
     from#(ok(X)) -> from#(X) -> from#(ok(X)) -> from#(X)
     from#(ok(X)) -> from#(X) -> from#(mark(X)) -> from#(X)
     from#(mark(X)) -> from#(X) -> from#(ok(X)) -> from#(X)
     from#(mark(X)) -> from#(X) -> from#(mark(X)) -> from#(X)
     cons#(mark(X1),X2) -> cons#(X1,X2) -> cons#(mark(X1),X2) -> cons#(X1,X2)
     2nd#(ok(X)) -> 2nd#(X) -> 2nd#(ok(X)) -> 2nd#(X)
     2nd#(ok(X)) -> 2nd#(X) -> 2nd#(mark(X)) -> 2nd#(X)
     2nd#(mark(X)) -> 2nd#(X) -> 2nd#(ok(X)) -> 2nd#(X)
     2nd#(mark(X)) -> 2nd#(X) -> 2nd#(mark(X)) -> 2nd#(X)
     active#(s(X)) -> s#(active(X)) -> s#(ok(X)) -> s#(X)
     active#(s(X)) -> s#(active(X)) -> s#(mark(X)) -> s#(X)
     active#(s(X)) -> active#(X) ->
     active#(cons1(X1,X2)) -> cons1#(X1,active(X2))
     active#(s(X)) -> active#(X) -> active#(cons1(X1,X2)) -> active#(X2)
     active#(s(X)) -> active#(X) ->
     active#(cons1(X1,X2)) -> cons1#(active(X1),X2)
     active#(s(X)) -> active#(X) -> active#(cons1(X1,X2)) -> active#(X1)
     active#(s(X)) -> active#(X) -> active#(s(X)) -> s#(active(X))
     active#(s(X)) -> active#(X) -> active#(s(X)) -> active#(X)
     active#(s(X)) -> active#(X) -> active#(from(X)) -> from#(active(X))
     active#(s(X)) -> active#(X) -> active#(from(X)) -> active#(X)
     active#(s(X)) -> active#(X) ->
     active#(cons(X1,X2)) -> cons#(active(X1),X2)
     active#(s(X)) -> active#(X) -> active#(cons(X1,X2)) -> active#(X1)
     active#(s(X)) -> active#(X) -> active#(2nd(X)) -> 2nd#(active(X))
     active#(s(X)) -> active#(X) ->
     active#(2nd(X)) -> active#(X)
     active#(from(X)) -> from#(active(X)) ->
     from#(ok(X)) -> from#(X)
     active#(from(X)) -> from#(active(X)) ->
     from#(mark(X)) -> from#(X)
     active#(from(X)) -> active#(X) ->
     active#(cons1(X1,X2)) -> cons1#(X1,active(X2))
     active#(from(X)) -> active#(X) ->
     active#(cons1(X1,X2)) -> active#(X2)
     active#(from(X)) -> active#(X) ->
     active#(cons1(X1,X2)) -> cons1#(active(X1),X2)
     active#(from(X)) -> active#(X) ->
     active#(cons1(X1,X2)) -> active#(X1)
     active#(from(X)) -> active#(X) -> active#(s(X)) -> s#(active(X))
     active#(from(X)) -> active#(X) -> active#(s(X)) -> active#(X)
     active#(from(X)) -> active#(X) ->
     active#(from(X)) -> from#(active(X))
     active#(from(X)) -> active#(X) -> active#(from(X)) -> active#(X)
     active#(from(X)) -> active#(X) ->
     active#(cons(X1,X2)) -> cons#(active(X1),X2)
     active#(from(X)) -> active#(X) ->
     active#(cons(X1,X2)) -> active#(X1)
     active#(from(X)) -> active#(X) ->
     active#(2nd(X)) -> 2nd#(active(X))
     active#(from(X)) -> active#(X) ->
     active#(2nd(X)) -> active#(X)
     active#(2nd(X)) -> 2nd#(active(X)) -> 2nd#(ok(X)) -> 2nd#(X)
     active#(2nd(X)) -> 2nd#(active(X)) -> 2nd#(mark(X)) -> 2nd#(X)
     active#(2nd(X)) -> active#(X) ->
     active#(cons1(X1,X2)) -> cons1#(X1,active(X2))
     active#(2nd(X)) -> active#(X) ->
     active#(cons1(X1,X2)) -> active#(X2)
     active#(2nd(X)) -> active#(X) ->
     active#(cons1(X1,X2)) -> cons1#(active(X1),X2)
     active#(2nd(X)) -> active#(X) ->
     active#(cons1(X1,X2)) -> active#(X1)
     active#(2nd(X)) -> active#(X) -> active#(s(X)) -> s#(active(X))
     active#(2nd(X)) -> active#(X) -> active#(s(X)) -> active#(X)
     active#(2nd(X)) -> active#(X) ->
     active#(from(X)) -> from#(active(X))
     active#(2nd(X)) -> active#(X) -> active#(from(X)) -> active#(X)
     active#(2nd(X)) -> active#(X) ->
     active#(cons(X1,X2)) -> cons#(active(X1),X2)
     active#(2nd(X)) -> active#(X) ->
     active#(cons(X1,X2)) -> active#(X1)
     active#(2nd(X)) -> active#(X) ->
     active#(2nd(X)) -> 2nd#(active(X))
     active#(2nd(X)) -> active#(X) ->
     active#(2nd(X)) -> active#(X)
     active#(cons1(X1,X2)) -> cons1#(active(X1),X2) ->
     cons1#(X1,mark(X2)) -> cons1#(X1,X2)
     active#(cons1(X1,X2)) -> cons1#(active(X1),X2) ->
     cons1#(mark(X1),X2) -> cons1#(X1,X2)
     active#(cons1(X1,X2)) -> cons1#(X1,active(X2)) ->
     cons1#(X1,mark(X2)) -> cons1#(X1,X2)
     active#(cons1(X1,X2)) -> cons1#(X1,active(X2)) ->
     cons1#(mark(X1),X2) -> cons1#(X1,X2)
     active#(cons1(X1,X2)) -> active#(X2) ->
     active#(cons1(X1,X2)) -> cons1#(X1,active(X2))
     active#(cons1(X1,X2)) -> active#(X2) ->
     active#(cons1(X1,X2)) -> active#(X2)
     active#(cons1(X1,X2)) -> active#(X2) ->
     active#(cons1(X1,X2)) -> cons1#(active(X1),X2)
     active#(cons1(X1,X2)) -> active#(X2) ->
     active#(cons1(X1,X2)) -> active#(X1)
     active#(cons1(X1,X2)) -> active#(X2) ->
     active#(s(X)) -> s#(active(X))
     active#(cons1(X1,X2)) -> active#(X2) ->
     active#(s(X)) -> active#(X)
     active#(cons1(X1,X2)) -> active#(X2) ->
     active#(from(X)) -> from#(active(X))
     active#(cons1(X1,X2)) -> active#(X2) ->
     active#(from(X)) -> active#(X)
     active#(cons1(X1,X2)) -> active#(X2) ->
     active#(cons(X1,X2)) -> cons#(active(X1),X2)
     active#(cons1(X1,X2)) -> active#(X2) ->
     active#(cons(X1,X2)) -> active#(X1)
     active#(cons1(X1,X2)) -> active#(X2) ->
     active#(2nd(X)) -> 2nd#(active(X))
     active#(cons1(X1,X2)) -> active#(X2) ->
     active#(2nd(X)) -> active#(X)
     active#(cons1(X1,X2)) -> active#(X1) ->
     active#(cons1(X1,X2)) -> cons1#(X1,active(X2))
     active#(cons1(X1,X2)) -> active#(X1) ->
     active#(cons1(X1,X2)) -> active#(X2)
     active#(cons1(X1,X2)) -> active#(X1) ->
     active#(cons1(X1,X2)) -> cons1#(active(X1),X2)
     active#(cons1(X1,X2)) -> active#(X1) ->
     active#(cons1(X1,X2)) -> active#(X1)
     active#(cons1(X1,X2)) -> active#(X1) ->
     active#(s(X)) -> s#(active(X))
     active#(cons1(X1,X2)) -> active#(X1) ->
     active#(s(X)) -> active#(X)
     active#(cons1(X1,X2)) -> active#(X1) ->
     active#(from(X)) -> from#(active(X))
     active#(cons1(X1,X2)) -> active#(X1) ->
     active#(from(X)) -> active#(X)
     active#(cons1(X1,X2)) -> active#(X1) ->
     active#(cons(X1,X2)) -> cons#(active(X1),X2)
     active#(cons1(X1,X2)) -> active#(X1) ->
     active#(cons(X1,X2)) -> active#(X1)
     active#(cons1(X1,X2)) -> active#(X1) ->
     active#(2nd(X)) -> 2nd#(active(X))
     active#(cons1(X1,X2)) -> active#(X1) ->
     active#(2nd(X)) -> active#(X)
     active#(cons(X1,X2)) -> cons#(active(X1),X2) ->
     cons#(mark(X1),X2) -> cons#(X1,X2)
     active#(cons(X1,X2)) -> active#(X1) ->
     active#(cons1(X1,X2)) -> cons1#(X1,active(X2))
     active#(cons(X1,X2)) -> active#(X1) ->
     active#(cons1(X1,X2)) -> active#(X2)
     active#(cons(X1,X2)) -> active#(X1) ->
     active#(cons1(X1,X2)) -> cons1#(active(X1),X2)
     active#(cons(X1,X2)) -> active#(X1) ->
     active#(cons1(X1,X2)) -> active#(X1)
     active#(cons(X1,X2)) -> active#(X1) ->
     active#(s(X)) -> s#(active(X))
     active#(cons(X1,X2)) -> active#(X1) ->
     active#(s(X)) -> active#(X)
     active#(cons(X1,X2)) -> active#(X1) ->
     active#(from(X)) -> from#(active(X))
     active#(cons(X1,X2)) -> active#(X1) ->
     active#(from(X)) -> active#(X)
     active#(cons(X1,X2)) -> active#(X1) ->
     active#(cons(X1,X2)) -> cons#(active(X1),X2)
     active#(cons(X1,X2)) -> active#(X1) ->
     active#(cons(X1,X2)) -> active#(X1)
     active#(cons(X1,X2)) -> active#(X1) ->
     active#(2nd(X)) -> 2nd#(active(X))
     active#(cons(X1,X2)) -> active#(X1) -> active#(2nd(X)) -> active#(X)
    SCC Processor:
     #sccs: 8
     #rules: 24
     #arcs: 225/1369
     DPs:
      top#(ok(X)) -> top#(active(X))
      top#(mark(X)) -> top#(proper(X))
     TRS:
      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))
      active(cons1(X1,X2)) -> cons1(active(X1),X2)
      active(cons1(X1,X2)) -> cons1(X1,active(X2))
      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))
      cons1(mark(X1),X2) -> mark(cons1(X1,X2))
      cons1(X1,mark(X2)) -> mark(cons1(X1,X2))
      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))
      proper(cons1(X1,X2)) -> cons1(proper(X1),proper(X2))
      2nd(ok(X)) -> ok(2nd(X))
      from(ok(X)) -> ok(from(X))
      s(ok(X)) -> ok(s(X))
      top(mark(X)) -> top(proper(X))
      top(ok(X)) -> top(active(X))
     CDG Processor:
      DPs:
       top#(ok(X)) -> top#(active(X))
       top#(mark(X)) -> top#(proper(X))
      TRS:
       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))
       active(cons1(X1,X2)) -> cons1(active(X1),X2)
       active(cons1(X1,X2)) -> cons1(X1,active(X2))
       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))
       cons1(mark(X1),X2) -> mark(cons1(X1,X2))
       cons1(X1,mark(X2)) -> mark(cons1(X1,X2))
       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))
       proper(cons1(X1,X2)) -> cons1(proper(X1),proper(X2))
       2nd(ok(X)) -> ok(2nd(X))
       from(ok(X)) -> ok(from(X))
       s(ok(X)) -> ok(s(X))
       top(mark(X)) -> top(proper(X))
       top(ok(X)) -> top(active(X))
      graph:
       top#(ok(X)) -> top#(active(X)) -> top#(mark(X)) -> top#(proper(X))
      SCC Processor:
       #sccs: 0
       #rules: 0
       #arcs: 1/4
       
     
     DPs:
      active#(2nd(X)) -> active#(X)
      active#(cons(X1,X2)) -> active#(X1)
      active#(from(X)) -> active#(X)
      active#(s(X)) -> active#(X)
      active#(cons1(X1,X2)) -> active#(X1)
      active#(cons1(X1,X2)) -> active#(X2)
     TRS:
      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))
      active(cons1(X1,X2)) -> cons1(active(X1),X2)
      active(cons1(X1,X2)) -> cons1(X1,active(X2))
      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))
      cons1(mark(X1),X2) -> mark(cons1(X1,X2))
      cons1(X1,mark(X2)) -> mark(cons1(X1,X2))
      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))
      proper(cons1(X1,X2)) -> cons1(proper(X1),proper(X2))
      2nd(ok(X)) -> ok(2nd(X))
      from(ok(X)) -> ok(from(X))
      s(ok(X)) -> ok(s(X))
      top(mark(X)) -> top(proper(X))
      top(ok(X)) -> top(active(X))
     Subterm Criterion Processor:
      simple projection:
       pi(active#) = 0
      problem:
       DPs:
        
       TRS:
        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))
        active(cons1(X1,X2)) -> cons1(active(X1),X2)
        active(cons1(X1,X2)) -> cons1(X1,active(X2))
        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))
        cons1(mark(X1),X2) -> mark(cons1(X1,X2))
        cons1(X1,mark(X2)) -> mark(cons1(X1,X2))
        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))
        proper(cons1(X1,X2)) -> cons1(proper(X1),proper(X2))
        2nd(ok(X)) -> ok(2nd(X))
        from(ok(X)) -> ok(from(X))
        s(ok(X)) -> ok(s(X))
        top(mark(X)) -> top(proper(X))
        top(ok(X)) -> top(active(X))
      Qed
     
     DPs:
      proper#(2nd(X)) -> proper#(X)
      proper#(cons(X1,X2)) -> proper#(X2)
      proper#(cons(X1,X2)) -> proper#(X1)
      proper#(from(X)) -> proper#(X)
      proper#(s(X)) -> proper#(X)
      proper#(cons1(X1,X2)) -> proper#(X2)
      proper#(cons1(X1,X2)) -> proper#(X1)
     TRS:
      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))
      active(cons1(X1,X2)) -> cons1(active(X1),X2)
      active(cons1(X1,X2)) -> cons1(X1,active(X2))
      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))
      cons1(mark(X1),X2) -> mark(cons1(X1,X2))
      cons1(X1,mark(X2)) -> mark(cons1(X1,X2))
      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))
      proper(cons1(X1,X2)) -> cons1(proper(X1),proper(X2))
      2nd(ok(X)) -> ok(2nd(X))
      from(ok(X)) -> ok(from(X))
      s(ok(X)) -> ok(s(X))
      top(mark(X)) -> top(proper(X))
      top(ok(X)) -> top(active(X))
     Subterm Criterion Processor:
      simple projection:
       pi(proper#) = 0
      problem:
       DPs:
        
       TRS:
        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))
        active(cons1(X1,X2)) -> cons1(active(X1),X2)
        active(cons1(X1,X2)) -> cons1(X1,active(X2))
        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))
        cons1(mark(X1),X2) -> mark(cons1(X1,X2))
        cons1(X1,mark(X2)) -> mark(cons1(X1,X2))
        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))
        proper(cons1(X1,X2)) -> cons1(proper(X1),proper(X2))
        2nd(ok(X)) -> ok(2nd(X))
        from(ok(X)) -> ok(from(X))
        s(ok(X)) -> ok(s(X))
        top(mark(X)) -> top(proper(X))
        top(ok(X)) -> top(active(X))
      Qed
     
     DPs:
      cons1#(mark(X1),X2) -> cons1#(X1,X2)
      cons1#(X1,mark(X2)) -> cons1#(X1,X2)
     TRS:
      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))
      active(cons1(X1,X2)) -> cons1(active(X1),X2)
      active(cons1(X1,X2)) -> cons1(X1,active(X2))
      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))
      cons1(mark(X1),X2) -> mark(cons1(X1,X2))
      cons1(X1,mark(X2)) -> mark(cons1(X1,X2))
      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))
      proper(cons1(X1,X2)) -> cons1(proper(X1),proper(X2))
      2nd(ok(X)) -> ok(2nd(X))
      from(ok(X)) -> ok(from(X))
      s(ok(X)) -> ok(s(X))
      top(mark(X)) -> top(proper(X))
      top(ok(X)) -> top(active(X))
     Subterm Criterion Processor:
      simple projection:
       pi(cons1#) = 1
      problem:
       DPs:
        cons1#(mark(X1),X2) -> cons1#(X1,X2)
       TRS:
        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))
        active(cons1(X1,X2)) -> cons1(active(X1),X2)
        active(cons1(X1,X2)) -> cons1(X1,active(X2))
        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))
        cons1(mark(X1),X2) -> mark(cons1(X1,X2))
        cons1(X1,mark(X2)) -> mark(cons1(X1,X2))
        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))
        proper(cons1(X1,X2)) -> cons1(proper(X1),proper(X2))
        2nd(ok(X)) -> ok(2nd(X))
        from(ok(X)) -> ok(from(X))
        s(ok(X)) -> ok(s(X))
        top(mark(X)) -> top(proper(X))
        top(ok(X)) -> top(active(X))
      Subterm Criterion Processor:
       simple projection:
        pi(cons1#) = 0
       problem:
        DPs:
         
        TRS:
         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))
         active(cons1(X1,X2)) -> cons1(active(X1),X2)
         active(cons1(X1,X2)) -> cons1(X1,active(X2))
         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))
         cons1(mark(X1),X2) -> mark(cons1(X1,X2))
         cons1(X1,mark(X2)) -> mark(cons1(X1,X2))
         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))
         proper(cons1(X1,X2)) -> cons1(proper(X1),proper(X2))
         2nd(ok(X)) -> ok(2nd(X))
         from(ok(X)) -> ok(from(X))
         s(ok(X)) -> ok(s(X))
         top(mark(X)) -> top(proper(X))
         top(ok(X)) -> top(active(X))
       Qed
     
     DPs:
      s#(mark(X)) -> s#(X)
      s#(ok(X)) -> s#(X)
     TRS:
      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))
      active(cons1(X1,X2)) -> cons1(active(X1),X2)
      active(cons1(X1,X2)) -> cons1(X1,active(X2))
      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))
      cons1(mark(X1),X2) -> mark(cons1(X1,X2))
      cons1(X1,mark(X2)) -> mark(cons1(X1,X2))
      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))
      proper(cons1(X1,X2)) -> cons1(proper(X1),proper(X2))
      2nd(ok(X)) -> ok(2nd(X))
      from(ok(X)) -> ok(from(X))
      s(ok(X)) -> ok(s(X))
      top(mark(X)) -> top(proper(X))
      top(ok(X)) -> top(active(X))
     Subterm Criterion Processor:
      simple projection:
       pi(s#) = 0
      problem:
       DPs:
        
       TRS:
        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))
        active(cons1(X1,X2)) -> cons1(active(X1),X2)
        active(cons1(X1,X2)) -> cons1(X1,active(X2))
        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))
        cons1(mark(X1),X2) -> mark(cons1(X1,X2))
        cons1(X1,mark(X2)) -> mark(cons1(X1,X2))
        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))
        proper(cons1(X1,X2)) -> cons1(proper(X1),proper(X2))
        2nd(ok(X)) -> ok(2nd(X))
        from(ok(X)) -> ok(from(X))
        s(ok(X)) -> ok(s(X))
        top(mark(X)) -> top(proper(X))
        top(ok(X)) -> top(active(X))
      Qed
     
     DPs:
      from#(mark(X)) -> from#(X)
      from#(ok(X)) -> from#(X)
     TRS:
      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))
      active(cons1(X1,X2)) -> cons1(active(X1),X2)
      active(cons1(X1,X2)) -> cons1(X1,active(X2))
      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))
      cons1(mark(X1),X2) -> mark(cons1(X1,X2))
      cons1(X1,mark(X2)) -> mark(cons1(X1,X2))
      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))
      proper(cons1(X1,X2)) -> cons1(proper(X1),proper(X2))
      2nd(ok(X)) -> ok(2nd(X))
      from(ok(X)) -> ok(from(X))
      s(ok(X)) -> ok(s(X))
      top(mark(X)) -> top(proper(X))
      top(ok(X)) -> top(active(X))
     Subterm Criterion Processor:
      simple projection:
       pi(from#) = 0
      problem:
       DPs:
        
       TRS:
        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))
        active(cons1(X1,X2)) -> cons1(active(X1),X2)
        active(cons1(X1,X2)) -> cons1(X1,active(X2))
        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))
        cons1(mark(X1),X2) -> mark(cons1(X1,X2))
        cons1(X1,mark(X2)) -> mark(cons1(X1,X2))
        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))
        proper(cons1(X1,X2)) -> cons1(proper(X1),proper(X2))
        2nd(ok(X)) -> ok(2nd(X))
        from(ok(X)) -> ok(from(X))
        s(ok(X)) -> ok(s(X))
        top(mark(X)) -> top(proper(X))
        top(ok(X)) -> top(active(X))
      Qed
     
     DPs:
      cons#(mark(X1),X2) -> cons#(X1,X2)
     TRS:
      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))
      active(cons1(X1,X2)) -> cons1(active(X1),X2)
      active(cons1(X1,X2)) -> cons1(X1,active(X2))
      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))
      cons1(mark(X1),X2) -> mark(cons1(X1,X2))
      cons1(X1,mark(X2)) -> mark(cons1(X1,X2))
      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))
      proper(cons1(X1,X2)) -> cons1(proper(X1),proper(X2))
      2nd(ok(X)) -> ok(2nd(X))
      from(ok(X)) -> ok(from(X))
      s(ok(X)) -> ok(s(X))
      top(mark(X)) -> top(proper(X))
      top(ok(X)) -> top(active(X))
     Subterm Criterion Processor:
      simple projection:
       pi(cons#) = 0
      problem:
       DPs:
        
       TRS:
        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))
        active(cons1(X1,X2)) -> cons1(active(X1),X2)
        active(cons1(X1,X2)) -> cons1(X1,active(X2))
        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))
        cons1(mark(X1),X2) -> mark(cons1(X1,X2))
        cons1(X1,mark(X2)) -> mark(cons1(X1,X2))
        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))
        proper(cons1(X1,X2)) -> cons1(proper(X1),proper(X2))
        2nd(ok(X)) -> ok(2nd(X))
        from(ok(X)) -> ok(from(X))
        s(ok(X)) -> ok(s(X))
        top(mark(X)) -> top(proper(X))
        top(ok(X)) -> top(active(X))
      Qed
     
     DPs:
      2nd#(mark(X)) -> 2nd#(X)
      2nd#(ok(X)) -> 2nd#(X)
     TRS:
      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))
      active(cons1(X1,X2)) -> cons1(active(X1),X2)
      active(cons1(X1,X2)) -> cons1(X1,active(X2))
      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))
      cons1(mark(X1),X2) -> mark(cons1(X1,X2))
      cons1(X1,mark(X2)) -> mark(cons1(X1,X2))
      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))
      proper(cons1(X1,X2)) -> cons1(proper(X1),proper(X2))
      2nd(ok(X)) -> ok(2nd(X))
      from(ok(X)) -> ok(from(X))
      s(ok(X)) -> ok(s(X))
      top(mark(X)) -> top(proper(X))
      top(ok(X)) -> top(active(X))
     Subterm Criterion Processor:
      simple projection:
       pi(2nd#) = 0
      problem:
       DPs:
        
       TRS:
        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))
        active(cons1(X1,X2)) -> cons1(active(X1),X2)
        active(cons1(X1,X2)) -> cons1(X1,active(X2))
        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))
        cons1(mark(X1),X2) -> mark(cons1(X1,X2))
        cons1(X1,mark(X2)) -> mark(cons1(X1,X2))
        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))
        proper(cons1(X1,X2)) -> cons1(proper(X1),proper(X2))
        2nd(ok(X)) -> ok(2nd(X))
        from(ok(X)) -> ok(from(X))
        s(ok(X)) -> ok(s(X))
        top(mark(X)) -> top(proper(X))
        top(ok(X)) -> top(active(X))
      Qed