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:
   [mark](x0) = x0,
   
   [ok](x0) = 6x0 + 7,
   
   [cons1](x0, x1) = x0 + x1,
   
   [active](x0) = 5x0 + 4,
   
   [from](x0) = x0,
   
   [cons](x0, x1) = x0 + x1 + 1,
   
   [proper](x0) = x0,
   
   [top](x0) = x0 + 4,
   
   [s](x0) = 4x0 + 3,
   
   [2nd](x0) = 2x0 + 1
  orientation:
   active(2nd(cons1(X,cons(Y,Z)))) = 10X + 10Y + 10Z + 19 >= Y = mark(Y)
   
   active(2nd(cons(X,X1))) = 10X + 10X1 + 19 >= 2X + 2X1 + 1 = mark(2nd(cons1(X,X1)))
   
   active(from(X)) = 5X + 4 >= 5X + 4 = mark(cons(X,from(s(X))))
   
   active(2nd(X)) = 10X + 9 >= 10X + 9 = 2nd(active(X))
   
   active(cons(X1,X2)) = 5X1 + 5X2 + 9 >= 5X1 + X2 + 5 = cons(active(X1),X2)
   
   active(from(X)) = 5X + 4 >= 5X + 4 = from(active(X))
   
   active(s(X)) = 20X + 19 >= 20X + 19 = s(active(X))
   
   active(cons1(X1,X2)) = 5X1 + 5X2 + 4 >= 5X1 + X2 + 4 = cons1(active(X1),X2)
   
   active(cons1(X1,X2)) = 5X1 + 5X2 + 4 >= X1 + 5X2 + 4 = cons1(X1,active(X2))
   
   2nd(mark(X)) = 2X + 1 >= 2X + 1 = mark(2nd(X))
   
   cons(mark(X1),X2) = X1 + X2 + 1 >= X1 + X2 + 1 = mark(cons(X1,X2))
   
   from(mark(X)) = X >= X = mark(from(X))
   
   s(mark(X)) = 4X + 3 >= 4X + 3 = 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)) = 2X + 1 >= 2X + 1 = 2nd(proper(X))
   
   proper(cons(X1,X2)) = X1 + X2 + 1 >= X1 + X2 + 1 = cons(proper(X1),proper(X2))
   
   proper(from(X)) = X >= X = from(proper(X))
   
   proper(s(X)) = 4X + 3 >= 4X + 3 = s(proper(X))
   
   proper(cons1(X1,X2)) = X1 + X2 >= X1 + X2 = cons1(proper(X1),proper(X2))
   
   2nd(ok(X)) = 12X + 15 >= 12X + 13 = ok(2nd(X))
   
   cons(ok(X1),ok(X2)) = 6X1 + 6X2 + 15 >= 6X1 + 6X2 + 13 = ok(cons(X1,X2))
   
   from(ok(X)) = 6X + 7 >= 6X + 7 = ok(from(X))
   
   s(ok(X)) = 24X + 31 >= 24X + 25 = ok(s(X))
   
   cons1(ok(X1),ok(X2)) = 6X1 + 6X2 + 14 >= 6X1 + 6X2 + 7 = ok(cons1(X1,X2))
   
   top(mark(X)) = X + 4 >= X + 4 = top(proper(X))
   
   top(ok(X)) = 6X + 11 >= 5X + 8 = top(active(X))
  problem:
   active(from(X)) -> mark(cons(X,from(s(X))))
   active(2nd(X)) -> 2nd(active(X))
   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))
   from(ok(X)) -> ok(from(X))
   top(mark(X)) -> top(proper(X))
  Matrix Interpretation Processor: dim=1
   
   interpretation:
    [mark](x0) = x0,
    
    [ok](x0) = x0,
    
    [cons1](x0, x1) = 2x0 + x1,
    
    [active](x0) = 4x0,
    
    [from](x0) = 2x0,
    
    [cons](x0, x1) = 6x0 + x1,
    
    [proper](x0) = x0,
    
    [top](x0) = x0 + 2,
    
    [s](x0) = x0,
    
    [2nd](x0) = 4x0 + 4
   orientation:
    active(from(X)) = 8X >= 8X = mark(cons(X,from(s(X))))
    
    active(2nd(X)) = 16X + 16 >= 16X + 4 = 2nd(active(X))
    
    active(from(X)) = 8X >= 8X = from(active(X))
    
    active(s(X)) = 4X >= 4X = s(active(X))
    
    active(cons1(X1,X2)) = 8X1 + 4X2 >= 8X1 + X2 = cons1(active(X1),X2)
    
    active(cons1(X1,X2)) = 8X1 + 4X2 >= 2X1 + 4X2 = cons1(X1,active(X2))
    
    2nd(mark(X)) = 4X + 4 >= 4X + 4 = mark(2nd(X))
    
    cons(mark(X1),X2) = 6X1 + X2 >= 6X1 + X2 = mark(cons(X1,X2))
    
    from(mark(X)) = 2X >= 2X = mark(from(X))
    
    s(mark(X)) = X >= X = mark(s(X))
    
    cons1(mark(X1),X2) = 2X1 + X2 >= 2X1 + X2 = mark(cons1(X1,X2))
    
    cons1(X1,mark(X2)) = 2X1 + X2 >= 2X1 + X2 = mark(cons1(X1,X2))
    
    proper(2nd(X)) = 4X + 4 >= 4X + 4 = 2nd(proper(X))
    
    proper(cons(X1,X2)) = 6X1 + X2 >= 6X1 + X2 = cons(proper(X1),proper(X2))
    
    proper(from(X)) = 2X >= 2X = from(proper(X))
    
    proper(s(X)) = X >= X = s(proper(X))
    
    proper(cons1(X1,X2)) = 2X1 + X2 >= 2X1 + X2 = cons1(proper(X1),proper(X2))
    
    from(ok(X)) = 2X >= 2X = ok(from(X))
    
    top(mark(X)) = X + 2 >= X + 2 = top(proper(X))
   problem:
    active(from(X)) -> mark(cons(X,from(s(X))))
    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))
    from(ok(X)) -> ok(from(X))
    top(mark(X)) -> top(proper(X))
   Matrix Interpretation Processor: dim=1
    
    interpretation:
     [mark](x0) = x0 + 1,
     
     [ok](x0) = x0 + 4,
     
     [cons1](x0, x1) = x0 + 4x1 + 2,
     
     [active](x0) = 5x0 + 1,
     
     [from](x0) = x0 + 1,
     
     [cons](x0, x1) = x0 + x1,
     
     [proper](x0) = x0,
     
     [top](x0) = x0 + 4,
     
     [s](x0) = 4x0 + 2,
     
     [2nd](x0) = 2x0 + 7
    orientation:
     active(from(X)) = 5X + 6 >= 5X + 4 = mark(cons(X,from(s(X))))
     
     active(from(X)) = 5X + 6 >= 5X + 2 = from(active(X))
     
     active(s(X)) = 20X + 11 >= 20X + 6 = s(active(X))
     
     active(cons1(X1,X2)) = 5X1 + 20X2 + 11 >= 5X1 + 4X2 + 3 = cons1(active(X1),X2)
     
     active(cons1(X1,X2)) = 5X1 + 20X2 + 11 >= X1 + 20X2 + 6 = cons1(X1,active(X2))
     
     2nd(mark(X)) = 2X + 9 >= 2X + 8 = mark(2nd(X))
     
     cons(mark(X1),X2) = X1 + X2 + 1 >= X1 + X2 + 1 = mark(cons(X1,X2))
     
     from(mark(X)) = X + 2 >= X + 2 = mark(from(X))
     
     s(mark(X)) = 4X + 6 >= 4X + 3 = mark(s(X))
     
     cons1(mark(X1),X2) = X1 + 4X2 + 3 >= X1 + 4X2 + 3 = mark(cons1(X1,X2))
     
     cons1(X1,mark(X2)) = X1 + 4X2 + 6 >= X1 + 4X2 + 3 = mark(cons1(X1,X2))
     
     proper(2nd(X)) = 2X + 7 >= 2X + 7 = 2nd(proper(X))
     
     proper(cons(X1,X2)) = X1 + X2 >= X1 + X2 = cons(proper(X1),proper(X2))
     
     proper(from(X)) = X + 1 >= X + 1 = from(proper(X))
     
     proper(s(X)) = 4X + 2 >= 4X + 2 = s(proper(X))
     
     proper(cons1(X1,X2)) = X1 + 4X2 + 2 >= X1 + 4X2 + 2 = cons1(proper(X1),proper(X2))
     
     from(ok(X)) = X + 5 >= X + 5 = ok(from(X))
     
     top(mark(X)) = X + 5 >= X + 4 = top(proper(X))
    problem:
     cons(mark(X1),X2) -> mark(cons(X1,X2))
     from(mark(X)) -> mark(from(X))
     cons1(mark(X1),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))
     from(ok(X)) -> ok(from(X))
    Matrix Interpretation Processor: dim=1
     
     interpretation:
      [mark](x0) = x0 + 1,
      
      [ok](x0) = 2x0 + 4,
      
      [cons1](x0, x1) = 4x0 + 3x1,
      
      [from](x0) = 2x0 + 4,
      
      [cons](x0, x1) = 4x0 + x1,
      
      [proper](x0) = 3x0,
      
      [s](x0) = x0,
      
      [2nd](x0) = 4x0 + 2
     orientation:
      cons(mark(X1),X2) = 4X1 + X2 + 4 >= 4X1 + X2 + 1 = mark(cons(X1,X2))
      
      from(mark(X)) = 2X + 6 >= 2X + 5 = mark(from(X))
      
      cons1(mark(X1),X2) = 4X1 + 3X2 + 4 >= 4X1 + 3X2 + 1 = mark(cons1(X1,X2))
      
      proper(2nd(X)) = 12X + 6 >= 12X + 2 = 2nd(proper(X))
      
      proper(cons(X1,X2)) = 12X1 + 3X2 >= 12X1 + 3X2 = cons(proper(X1),proper(X2))
      
      proper(from(X)) = 6X + 12 >= 6X + 4 = from(proper(X))
      
      proper(s(X)) = 3X >= 3X = s(proper(X))
      
      proper(cons1(X1,X2)) = 12X1 + 9X2 >= 12X1 + 9X2 = cons1(proper(X1),proper(X2))
      
      from(ok(X)) = 4X + 12 >= 4X + 12 = ok(from(X))
     problem:
      proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
      proper(s(X)) -> s(proper(X))
      proper(cons1(X1,X2)) -> cons1(proper(X1),proper(X2))
      from(ok(X)) -> ok(from(X))
     Matrix Interpretation Processor: dim=1
      
      interpretation:
       [ok](x0) = 3x0 + 5,
       
       [cons1](x0, x1) = x0 + 4x1 + 2,
       
       [from](x0) = 4x0 + 7,
       
       [cons](x0, x1) = 4x0 + x1 + 4,
       
       [proper](x0) = x0,
       
       [s](x0) = 4x0 + 4
      orientation:
       proper(cons(X1,X2)) = 4X1 + X2 + 4 >= 4X1 + X2 + 4 = cons(proper(X1),proper(X2))
       
       proper(s(X)) = 4X + 4 >= 4X + 4 = s(proper(X))
       
       proper(cons1(X1,X2)) = X1 + 4X2 + 2 >= X1 + 4X2 + 2 = cons1(proper(X1),proper(X2))
       
       from(ok(X)) = 12X + 27 >= 12X + 26 = ok(from(X))
      problem:
       proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
       proper(s(X)) -> s(proper(X))
       proper(cons1(X1,X2)) -> cons1(proper(X1),proper(X2))
      Matrix Interpretation Processor: dim=3
       
       interpretation:
                          [1 0 0]     [1 0 0]     [0]
        [cons1](x0, x1) = [0 1 0]x0 + [0 1 0]x1 + [1]
                          [0 0 0]     [0 0 0]     [0],
        
                         [1 0 0]     [1 0 1]     [1]
        [cons](x0, x1) = [0 1 1]x0 + [0 1 0]x1 + [0]
                         [0 0 0]     [0 0 0]     [0],
        
                       [1 1 0]  
        [proper](x0) = [0 1 0]x0
                       [0 0 0]  ,
        
                  [1 0 0]     [1]
        [s](x0) = [0 1 1]x0 + [0]
                  [0 0 0]     [0]
       orientation:
                              [1 1 1]     [1 1 1]     [1]    [1 1 0]     [1 1 0]     [1]                              
        proper(cons(X1,X2)) = [0 1 1]X1 + [0 1 0]X2 + [0] >= [0 1 0]X1 + [0 1 0]X2 + [0] = cons(proper(X1),proper(X2))
                              [0 0 0]     [0 0 0]     [0]    [0 0 0]     [0 0 0]     [0]                              
        
                       [1 1 1]    [1]    [1 1 0]    [1]               
        proper(s(X)) = [0 1 1]X + [0] >= [0 1 0]X + [0] = s(proper(X))
                       [0 0 0]    [0]    [0 0 0]    [0]               
        
                               [1 1 0]     [1 1 0]     [1]    [1 1 0]     [1 1 0]     [0]                               
        proper(cons1(X1,X2)) = [0 1 0]X1 + [0 1 0]X2 + [1] >= [0 1 0]X1 + [0 1 0]X2 + [1] = cons1(proper(X1),proper(X2))
                               [0 0 0]     [0 0 0]     [0]    [0 0 0]     [0 0 0]     [0]                               
       problem:
        proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
        proper(s(X)) -> s(proper(X))
       Matrix Interpretation Processor: dim=3
        
        interpretation:
                               [1 0 0]     [0]
         [cons](x0, x1) = x0 + [0 0 1]x1 + [1]
                               [0 1 0]     [0],
         
                        [1 1 1]  
         [proper](x0) = [0 1 0]x0
                        [0 0 1]  ,
         
                   [1 0 0]     [0]
         [s](x0) = [0 0 1]x0 + [1]
                   [0 1 0]     [0]
        orientation:
                               [1 1 1]     [1 1 1]     [1]    [1 1 1]     [1 1 1]     [0]                              
         proper(cons(X1,X2)) = [0 1 0]X1 + [0 0 1]X2 + [1] >= [0 1 0]X1 + [0 0 1]X2 + [1] = cons(proper(X1),proper(X2))
                               [0 0 1]     [0 1 0]     [0]    [0 0 1]     [0 1 0]     [0]                              
         
                        [1 1 1]    [1]    [1 1 1]    [0]               
         proper(s(X)) = [0 0 1]X + [1] >= [0 0 1]X + [1] = s(proper(X))
                        [0 1 0]    [0]    [0 1 0]    [0]               
        problem:
         
        Qed