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


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


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) = 2x0,
   
   [s](x0) = 2x0,
   
   [from](x0) = 5x0 + 1,
   
   [activate](x0) = 3x0 + 7,
   
   [2nd](x0) = 4x0 + 7,
   
   [cons](x0, x1) = x0 + x1,
   
   [n__cons](x0, x1) = x0 + x1
  orientation:
   2nd(cons(X,n__cons(Y,Z))) = 4X + 4Y + 4Z + 7 >= 3Y + 7 = activate(Y)
   
   from(X) = 5X + 1 >= 5X = cons(X,n__from(s(X)))
   
   cons(X1,X2) = X1 + X2 >= X1 + X2 = n__cons(X1,X2)
   
   from(X) = 5X + 1 >= 2X = n__from(X)
   
   activate(n__cons(X1,X2)) = 3X1 + 3X2 + 7 >= X1 + X2 = cons(X1,X2)
   
   activate(n__from(X)) = 6X + 7 >= 5X + 1 = from(X)
   
   activate(X) = 3X + 7 >= X = X
  problem:
   2nd(cons(X,n__cons(Y,Z))) -> activate(Y)
   cons(X1,X2) -> n__cons(X1,X2)
  Matrix Interpretation Processor: dim=3
   
   interpretation:
                     [1 0 0]  
    [activate](x0) = [0 0 0]x0
                     [0 0 0]  ,
    
                [1 0 0]  
    [2nd](x0) = [0 0 0]x0
                [0 0 0]  ,
    
                     [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 0 0]    [1]    [1 0 0]               
    2nd(cons(X,n__cons(Y,Z))) = [0 0 0]X + [0 0 0]Y + [0 0 0]Z + [0] >= [0 0 0]Y = activate(Y)
                                [0 0 0]    [0 0 0]    [0 0 0]    [0]    [0 0 0]               
    
                  [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