/export/starexec/sandbox2/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


NO

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(X1,X2)
 activate(X) -> X

Proof:
 Matrix Interpretation Processor: dim=1
  
  interpretation:
   [n__take](x0, x1) = 2x0 + x1 + 2,
   
   [take](x0, x1) = 2x0 + x1 + 7,
   
   [s](x0) = x0,
   
   [length](x0) = x0 + 3,
   
   [nil] = 4,
   
   [activate](x0) = x0 + 5,
   
   [and](x0, x1) = x0 + 4x1 + 5,
   
   [tt] = 0,
   
   [cons](x0, x1) = 4x0 + x1 + 5,
   
   [n__zeros] = 0,
   
   [0] = 0,
   
   [zeros] = 5
  orientation:
   zeros() = 5 >= 5 = cons(0(),n__zeros())
   
   and(tt(),X) = 4X + 5 >= X + 5 = activate(X)
   
   length(nil()) = 7 >= 0 = 0()
   
   length(cons(N,L)) = L + 4N + 8 >= L + 8 = s(length(activate(L)))
   
   take(0(),IL) = IL + 7 >= 4 = nil()
   
   take(s(M),cons(N,IL)) = IL + 2M + 4N + 12 >= IL + 2M + 4N + 12 = cons(N,n__take(M,activate(IL)))
   
   zeros() = 5 >= 0 = n__zeros()
   
   take(X1,X2) = 2X1 + X2 + 7 >= 2X1 + X2 + 2 = n__take(X1,X2)
   
   activate(n__zeros()) = 5 >= 5 = zeros()
   
   activate(n__take(X1,X2)) = 2X1 + X2 + 7 >= 2X1 + X2 + 7 = take(X1,X2)
   
   activate(X) = X + 5 >= X = X
  problem:
   zeros() -> cons(0(),n__zeros())
   and(tt(),X) -> activate(X)
   length(cons(N,L)) -> s(length(activate(L)))
   take(s(M),cons(N,IL)) -> cons(N,n__take(M,activate(IL)))
   activate(n__zeros()) -> zeros()
   activate(n__take(X1,X2)) -> take(X1,X2)
  Matrix Interpretation Processor: dim=1
   
   interpretation:
    [n__take](x0, x1) = 4x0 + x1,
    
    [take](x0, x1) = 4x0 + x1 + 4,
    
    [s](x0) = x0,
    
    [length](x0) = 4x0,
    
    [activate](x0) = x0 + 4,
    
    [and](x0, x1) = 6x0 + x1 + 6,
    
    [tt] = 3,
    
    [cons](x0, x1) = x0 + x1 + 4,
    
    [n__zeros] = 2,
    
    [0] = 0,
    
    [zeros] = 6
   orientation:
    zeros() = 6 >= 6 = cons(0(),n__zeros())
    
    and(tt(),X) = X + 24 >= X + 4 = activate(X)
    
    length(cons(N,L)) = 4L + 4N + 16 >= 4L + 16 = s(length(activate(L)))
    
    take(s(M),cons(N,IL)) = IL + 4M + N + 8 >= IL + 4M + N + 8 = cons(N,n__take(M,activate(IL)))
    
    activate(n__zeros()) = 6 >= 6 = zeros()
    
    activate(n__take(X1,X2)) = 4X1 + X2 + 4 >= 4X1 + X2 + 4 = take(X1,X2)
   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)))
    activate(n__zeros()) -> zeros()
    activate(n__take(X1,X2)) -> take(X1,X2)
   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