Problem:
 zeros() -> cons(0(),n__zeros())
 and(tt(),X) -> activate(X)
 length(nil()) -> 0()
 length(cons(N,L)) -> s(length(activate(L)))
 take(0(),IL) -> nil()
 take(s(M),cons(N,IL)) -> cons(N,n__take(M,activate(IL)))
 zeros() -> n__zeros()
 take(X1,X2) -> n__take(X1,X2)
 activate(n__zeros()) -> zeros()
 activate(n__take(X1,X2)) -> take(activate(X1),activate(X2))
 activate(X) -> X

Proof:
 Matrix Interpretation Processor: dim=1
  
  interpretation:
   [n__take](x0, x1) = x0 + 4x1,
   
   [take](x0, x1) = x0 + 4x1,
   
   [s](x0) = x0,
   
   [length](x0) = x0,
   
   [nil] = 0,
   
   [activate](x0) = x0,
   
   [and](x0, x1) = x0 + 2x1 + 4,
   
   [tt] = 0,
   
   [cons](x0, x1) = x0 + x1,
   
   [n__zeros] = 0,
   
   [0] = 0,
   
   [zeros] = 0
  orientation:
   zeros() = 0 >= 0 = cons(0(),n__zeros())
   
   and(tt(),X) = 2X + 4 >= X = activate(X)
   
   length(nil()) = 0 >= 0 = 0()
   
   length(cons(N,L)) = L + N >= L = s(length(activate(L)))
   
   take(0(),IL) = 4IL >= 0 = nil()
   
   take(s(M),cons(N,IL)) = 4IL + M + 4N >= 4IL + M + N = cons(N,n__take(M,activate(IL)))
   
   zeros() = 0 >= 0 = n__zeros()
   
   take(X1,X2) = X1 + 4X2 >= X1 + 4X2 = n__take(X1,X2)
   
   activate(n__zeros()) = 0 >= 0 = zeros()
   
   activate(n__take(X1,X2)) = X1 + 4X2 >= X1 + 4X2 = take(activate(X1),activate(X2))
   
   activate(X) = X >= X = X
  problem:
   zeros() -> cons(0(),n__zeros())
   length(nil()) -> 0()
   length(cons(N,L)) -> s(length(activate(L)))
   take(0(),IL) -> nil()
   take(s(M),cons(N,IL)) -> cons(N,n__take(M,activate(IL)))
   zeros() -> n__zeros()
   take(X1,X2) -> n__take(X1,X2)
   activate(n__zeros()) -> zeros()
   activate(n__take(X1,X2)) -> take(activate(X1),activate(X2))
   activate(X) -> X
  Matrix Interpretation Processor: dim=1
   
   interpretation:
    [n__take](x0, x1) = x0 + x1 + 3,
    
    [take](x0, x1) = x0 + x1 + 3,
    
    [s](x0) = x0,
    
    [length](x0) = 2x0,
    
    [nil] = 0,
    
    [activate](x0) = x0,
    
    [cons](x0, x1) = x0 + x1,
    
    [n__zeros] = 0,
    
    [0] = 0,
    
    [zeros] = 0
   orientation:
    zeros() = 0 >= 0 = cons(0(),n__zeros())
    
    length(nil()) = 0 >= 0 = 0()
    
    length(cons(N,L)) = 2L + 2N >= 2L = s(length(activate(L)))
    
    take(0(),IL) = IL + 3 >= 0 = nil()
    
    take(s(M),cons(N,IL)) = IL + M + N + 3 >= IL + M + N + 3 = cons(N,n__take(M,activate(IL)))
    
    zeros() = 0 >= 0 = n__zeros()
    
    take(X1,X2) = X1 + X2 + 3 >= X1 + X2 + 3 = n__take(X1,X2)
    
    activate(n__zeros()) = 0 >= 0 = zeros()
    
    activate(n__take(X1,X2)) = X1 + X2 + 3 >= X1 + X2 + 3 = take(activate(X1),activate(X2))
    
    activate(X) = X >= X = X
   problem:
    zeros() -> cons(0(),n__zeros())
    length(nil()) -> 0()
    length(cons(N,L)) -> s(length(activate(L)))
    take(s(M),cons(N,IL)) -> cons(N,n__take(M,activate(IL)))
    zeros() -> n__zeros()
    take(X1,X2) -> n__take(X1,X2)
    activate(n__zeros()) -> zeros()
    activate(n__take(X1,X2)) -> take(activate(X1),activate(X2))
    activate(X) -> X
   Matrix Interpretation Processor: dim=3
    
    interpretation:
                         [1 0 0]     [1 1 0]     [1]
     [n__take](x0, x1) = [0 1 0]x0 + [0 1 0]x1 + [0]
                         [0 0 0]     [0 0 0]     [0],
     
                      [1 0 0]     [1 1 0]     [1]
     [take](x0, x1) = [0 1 0]x0 + [0 1 0]x1 + [0]
                      [0 0 0]     [0 0 0]     [0],
     
               [1 0 0]  
     [s](x0) = [0 1 0]x0
               [0 0 0]  ,
     
                    [1 0 0]     [1]
     [length](x0) = [0 0 0]x0 + [0]
                    [0 0 0]     [0],
     
             [0]
     [nil] = [0]
             [0],
     
                      [1 0 0]  
     [activate](x0) = [0 1 0]x0
                      [0 1 1]  ,
     
                      [1 0 0]     [1 0 0]  
     [cons](x0, x1) = [0 0 0]x0 + [0 1 1]x1
                      [0 0 0]     [0 0 0]  ,
     
                  [0]
     [n__zeros] = [1]
                  [0],
     
           [0]
     [0] = [0]
           [0],
     
               [0]
     [zeros] = [1]
               [0]
    orientation:
               [0]    [0]                       
     zeros() = [1] >= [1] = cons(0(),n__zeros())
               [0]    [0]                       
     
                     [1]    [0]      
     length(nil()) = [0] >= [0] = 0()
                     [0]    [0]      
     
                         [1 0 0]    [1 0 0]    [1]    [1 0 0]    [1]                         
     length(cons(N,L)) = [0 0 0]L + [0 0 0]N + [0] >= [0 0 0]L + [0] = s(length(activate(L)))
                         [0 0 0]    [0 0 0]    [0]    [0 0 0]    [0]                         
     
                             [1 1 1]     [1 0 0]    [1 0 0]    [1]    [1 1 0]     [1 0 0]    [1 0 0]    [1]                                  
     take(s(M),cons(N,IL)) = [0 1 1]IL + [0 1 0]M + [0 0 0]N + [0] >= [0 1 0]IL + [0 1 0]M + [0 0 0]N + [0] = cons(N,n__take(M,activate(IL)))
                             [0 0 0]     [0 0 0]    [0 0 0]    [0]    [0 0 0]     [0 0 0]    [0 0 0]    [0]                                  
     
               [0]    [0]             
     zeros() = [1] >= [1] = n__zeros()
               [0]    [0]             
     
                   [1 0 0]     [1 1 0]     [1]    [1 0 0]     [1 1 0]     [1]                 
     take(X1,X2) = [0 1 0]X1 + [0 1 0]X2 + [0] >= [0 1 0]X1 + [0 1 0]X2 + [0] = n__take(X1,X2)
                   [0 0 0]     [0 0 0]     [0]    [0 0 0]     [0 0 0]     [0]                 
     
                            [0]    [0]          
     activate(n__zeros()) = [1] >= [1] = zeros()
                            [1]    [0]          
     
                                [1 0 0]     [1 1 0]     [1]    [1 0 0]     [1 1 0]     [1]                                  
     activate(n__take(X1,X2)) = [0 1 0]X1 + [0 1 0]X2 + [0] >= [0 1 0]X1 + [0 1 0]X2 + [0] = take(activate(X1),activate(X2))
                                [0 1 0]     [0 1 0]     [0]    [0 0 0]     [0 0 0]     [0]                                  
     
                   [1 0 0]          
     activate(X) = [0 1 0]X >= X = X
                   [0 1 1]          
    problem:
     zeros() -> cons(0(),n__zeros())
     length(cons(N,L)) -> s(length(activate(L)))
     take(s(M),cons(N,IL)) -> cons(N,n__take(M,activate(IL)))
     zeros() -> n__zeros()
     take(X1,X2) -> n__take(X1,X2)
     activate(n__zeros()) -> zeros()
     activate(n__take(X1,X2)) -> take(activate(X1),activate(X2))
     activate(X) -> X
    Unfolding Processor:
     loop length: 3
     terms:
      length(cons(N,n__zeros()))
      s(length(activate(n__zeros())))
      s(length(zeros()))
     context: s([])
     substitution:
      N -> 0()
     Qed