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


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


YES

Problem:
 p(m,n,s(r)) -> p(m,r,n)
 p(m,s(n),0()) -> p(0(),n,m)
 p(m,0(),0()) -> m

Proof:
 Matrix Interpretation Processor: dim=3
  
  interpretation:
         [0]
   [0] = [0]
         [0],
   
                                    [0]
   [p](x0, x1, x2) = x0 + x1 + x2 + [1]
                                    [0],
   
                  [1]
   [s](x0) = x0 + [0]
                  [0]
  orientation:
                             [1]                [0]           
   p(m,n,s(r)) = m + n + r + [1] >= m + n + r + [1] = p(m,r,n)
                             [0]                [0]           
   
                           [1]            [0]             
   p(m,s(n),0()) = m + n + [1] >= m + n + [1] = p(0(),n,m)
                           [0]            [0]             
   
                      [0]         
   p(m,0(),0()) = m + [1] >= m = m
                      [0]         
  problem:
   p(m,0(),0()) -> m
  Matrix Interpretation Processor: dim=3
   
   interpretation:
          [0]
    [0] = [0]
          [1],
    
                           [1 0 0]     [1 0 1]  
    [p](x0, x1, x2) = x0 + [0 0 0]x1 + [0 0 0]x2
                           [0 0 0]     [0 0 0]  
   orientation:
                       [1]         
    p(m,0(),0()) = m + [0] >= m = m
                       [0]         
   problem:
    
   Qed