YES

Problem:
 2nd(cons(X,n__cons(Y,Z))) -> activate(Y)
 from(X) -> cons(X,n__from(s(X)))
 cons(X1,X2) -> n__cons(X1,X2)
 from(X) -> n__from(X)
 activate(n__cons(X1,X2)) -> cons(X1,X2)
 activate(n__from(X)) -> from(X)
 activate(X) -> X

Proof:
 Matrix Interpretation Processor: dim=1
  
  interpretation:
   [n__from](x0) = x0 + 1,
   
   [s](x0) = 2x0,
   
   [from](x0) = 5x0 + 2,
   
   [activate](x0) = 6x0,
   
   [2nd](x0) = 3x0,
   
   [cons](x0, x1) = x0 + 2x1,
   
   [n__cons](x0, x1) = x0 + x1
  orientation:
   2nd(cons(X,n__cons(Y,Z))) = 3X + 6Y + 6Z >= 6Y = activate(Y)
   
   from(X) = 5X + 2 >= 5X + 2 = cons(X,n__from(s(X)))
   
   cons(X1,X2) = X1 + 2X2 >= X1 + X2 = n__cons(X1,X2)
   
   from(X) = 5X + 2 >= X + 1 = n__from(X)
   
   activate(n__cons(X1,X2)) = 6X1 + 6X2 >= X1 + 2X2 = cons(X1,X2)
   
   activate(n__from(X)) = 6X + 6 >= 5X + 2 = from(X)
   
   activate(X) = 6X >= X = X
  problem:
   2nd(cons(X,n__cons(Y,Z))) -> activate(Y)
   from(X) -> cons(X,n__from(s(X)))
   cons(X1,X2) -> n__cons(X1,X2)
   activate(n__cons(X1,X2)) -> cons(X1,X2)
   activate(X) -> X
  Matrix Interpretation Processor: dim=1
   
   interpretation:
    [n__from](x0) = x0 + 3,
    
    [s](x0) = 4x0,
    
    [from](x0) = 6x0 + 6,
    
    [activate](x0) = 3x0 + 4,
    
    [2nd](x0) = 3x0 + 1,
    
    [cons](x0, x1) = 2x0 + x1 + 2,
    
    [n__cons](x0, x1) = x0 + x1 + 2
   orientation:
    2nd(cons(X,n__cons(Y,Z))) = 6X + 3Y + 3Z + 13 >= 3Y + 4 = activate(Y)
    
    from(X) = 6X + 6 >= 6X + 5 = cons(X,n__from(s(X)))
    
    cons(X1,X2) = 2X1 + X2 + 2 >= X1 + X2 + 2 = n__cons(X1,X2)
    
    activate(n__cons(X1,X2)) = 3X1 + 3X2 + 10 >= 2X1 + X2 + 2 = cons(X1,X2)
    
    activate(X) = 3X + 4 >= X = X
   problem:
    cons(X1,X2) -> n__cons(X1,X2)
   Matrix Interpretation Processor: dim=3
    
    interpretation:
                      [1 0 0]     [1 0 0]     [1]
     [cons](x0, x1) = [0 0 0]x0 + [0 0 0]x1 + [0]
                      [0 0 0]     [0 0 0]     [0],
     
                         [1 0 0]     [1 0 0]  
     [n__cons](x0, x1) = [0 0 0]x0 + [0 0 0]x1
                         [0 0 0]     [0 0 0]  
    orientation:
                   [1 0 0]     [1 0 0]     [1]    [1 0 0]     [1 0 0]                   
     cons(X1,X2) = [0 0 0]X1 + [0 0 0]X2 + [0] >= [0 0 0]X1 + [0 0 0]X2 = n__cons(X1,X2)
                   [0 0 0]     [0 0 0]     [0]    [0 0 0]     [0 0 0]                   
    problem:
     
    Qed