/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:
 U11(tt(),M,N) -> U12(tt(),activate(M),activate(N))
 U12(tt(),M,N) -> s(plus(activate(N),activate(M)))
 plus(N,0()) -> N
 plus(N,s(M)) -> U11(tt(),M,N)
 activate(X) -> X

Proof:
 Matrix Interpretation Processor: dim=3
  
  interpretation:
         [0]
   [0] = [0]
         [0],
   
               
   [s](x0) = x0
               ,
   
                         [1 0 0]     [1]
   [plus](x0, x1) = x0 + [0 0 0]x1 + [0]
                         [0 0 0]     [0],
   
                       [1 0 0]     [1 0 0]          [1]
   [U12](x0, x1, x2) = [0 0 0]x0 + [0 0 0]x1 + x2 + [0]
                       [0 0 0]     [0 0 0]          [0],
   
                      
   [activate](x0) = x0
                      ,
   
                       [1 0 0]     [1 0 0]          [1]
   [U11](x0, x1, x2) = [0 0 0]x0 + [0 0 0]x1 + x2 + [0]
                       [0 0 0]     [0 0 0]          [0],
   
          [0]
   [tt] = [0]
          [0]
  orientation:
                   [1 0 0]        [1]    [1 0 0]        [1]                                    
   U11(tt(),M,N) = [0 0 0]M + N + [0] >= [0 0 0]M + N + [0] = U12(tt(),activate(M),activate(N))
                   [0 0 0]        [0]    [0 0 0]        [0]                                    
   
                   [1 0 0]        [1]    [1 0 0]        [1]                                   
   U12(tt(),M,N) = [0 0 0]M + N + [0] >= [0 0 0]M + N + [0] = s(plus(activate(N),activate(M)))
                   [0 0 0]        [0]    [0 0 0]        [0]                                   
   
                     [1]         
   plus(N,0()) = N + [0] >= N = N
                     [0]         
   
                  [1 0 0]        [1]    [1 0 0]        [1]                
   plus(N,s(M)) = [0 0 0]M + N + [0] >= [0 0 0]M + N + [0] = U11(tt(),M,N)
                  [0 0 0]        [0]    [0 0 0]        [0]                
   
                           
   activate(X) = X >= X = X
                           
  problem:
   U11(tt(),M,N) -> U12(tt(),activate(M),activate(N))
   U12(tt(),M,N) -> s(plus(activate(N),activate(M)))
   plus(N,s(M)) -> U11(tt(),M,N)
   activate(X) -> X
  Matrix Interpretation Processor: dim=1
   
   interpretation:
    [s](x0) = x0 + 4,
    
    [plus](x0, x1) = x0 + 4x1 + 6,
    
    [U12](x0, x1, x2) = 3x0 + 4x1 + x2 + 1,
    
    [activate](x0) = x0,
    
    [U11](x0, x1, x2) = 6x0 + 4x1 + x2 + 4,
    
    [tt] = 3
   orientation:
    U11(tt(),M,N) = 4M + N + 22 >= 4M + N + 10 = U12(tt(),activate(M),activate(N))
    
    U12(tt(),M,N) = 4M + N + 10 >= 4M + N + 10 = s(plus(activate(N),activate(M)))
    
    plus(N,s(M)) = 4M + N + 22 >= 4M + N + 22 = U11(tt(),M,N)
    
    activate(X) = X >= X = X
   problem:
    U12(tt(),M,N) -> s(plus(activate(N),activate(M)))
    plus(N,s(M)) -> U11(tt(),M,N)
    activate(X) -> X
   Matrix Interpretation Processor: dim=3
    
    interpretation:
               [1 0 0]     [0]
     [s](x0) = [0 0 0]x0 + [1]
               [0 0 0]     [0],
     
                      [1 0 0]     [1 1 0]  
     [plus](x0, x1) = [0 0 0]x0 + [0 0 0]x1
                      [0 0 0]     [0 0 0]  ,
     
                         [1 0 0]     [1 1 0]     [1 0 0]     [1]
     [U12](x0, x1, x2) = [0 0 1]x0 + [0 0 0]x1 + [0 0 0]x2 + [0]
                         [0 0 0]     [0 0 0]     [0 0 0]     [0],
     
                        
     [activate](x0) = x0
                        ,
     
                         [1 0 0]     [1 0 0]     [1 0 0]  
     [U11](x0, x1, x2) = [0 0 0]x0 + [0 0 0]x1 + [0 0 0]x2
                         [0 0 0]     [0 0 0]     [0 0 0]  ,
     
            [0]
     [tt] = [0]
            [1]
    orientation:
                     [1 1 0]    [1 0 0]    [1]    [1 1 0]    [1 0 0]    [0]                                   
     U12(tt(),M,N) = [0 0 0]M + [0 0 0]N + [1] >= [0 0 0]M + [0 0 0]N + [1] = s(plus(activate(N),activate(M)))
                     [0 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]                 
     plus(N,s(M)) = [0 0 0]M + [0 0 0]N + [0] >= [0 0 0]M + [0 0 0]N = U11(tt(),M,N)
                    [0 0 0]    [0 0 0]    [0]    [0 0 0]    [0 0 0]                 
     
                             
     activate(X) = X >= X = X
                             
    problem:
     activate(X) -> X
    Matrix Interpretation Processor: dim=3
     
     interpretation:
                            [1]
      [activate](x0) = x0 + [0]
                            [0]
     orientation:
                        [1]         
      activate(X) = X + [0] >= X = X
                        [0]         
     problem:
      
     Qed