/export/starexec/sandbox/solver/bin/starexec_run_ttt2 /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=1
  
  interpretation:
   [p](x0, x1, x2) = x0 + x1 + x2 + 3,
   
   [s](x0) = x0,
   
   [0] = 6
  orientation:
   p(m,n,s(r)) = m + n + r + 3 >= m + n + r + 3 = p(m,r,n)
   
   p(m,s(n),0()) = m + n + 9 >= m + n + 9 = p(0(),n,m)
   
   p(m,0(),0()) = m + 15 >= m = m
  problem:
   p(m,n,s(r)) -> p(m,r,n)
   p(m,s(n),0()) -> p(0(),n,m)
  Matrix Interpretation Processor: dim=3
   
   interpretation:
                      [1 0 0]     [1 0 0]     [1 0 0]  
    [p](x0, x1, x2) = [0 1 1]x0 + [0 1 1]x1 + [0 1 1]x2
                      [0 0 0]     [0 0 0]     [0 0 0]  ,
    
              [1 0 0]     [1]
    [s](x0) = [0 0 1]x0 + [0]
              [0 1 0]     [0],
    
          [0]
    [0] = [0]
          [0]
   orientation:
                  [1 0 0]    [1 0 0]    [1 0 0]    [1]    [1 0 0]    [1 0 0]    [1 0 0]            
    p(m,n,s(r)) = [0 1 1]m + [0 1 1]n + [0 1 1]r + [0] >= [0 1 1]m + [0 1 1]n + [0 1 1]r = p(m,r,n)
                  [0 0 0]    [0 0 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]              
    p(m,s(n),0()) = [0 1 1]m + [0 1 1]n + [0] >= [0 1 1]m + [0 1 1]n = p(0(),n,m)
                    [0 0 0]    [0 0 0]    [0]    [0 0 0]    [0 0 0]              
   problem:
    
   Qed