/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:
 g(c(x,s(y))) -> g(c(s(x),y))
 f(c(s(x),y)) -> f(c(x,s(y)))
 f(f(x)) -> f(d(f(x)))
 f(x) -> x

Proof:
 Matrix Interpretation Processor: dim=1
  
  interpretation:
   [d](x0) = x0,
   
   [f](x0) = 4x0 + 1,
   
   [g](x0) = 4x0,
   
   [c](x0, x1) = x0 + x1 + 3,
   
   [s](x0) = x0 + 1
  orientation:
   g(c(x,s(y))) = 4x + 4y + 16 >= 4x + 4y + 16 = g(c(s(x),y))
   
   f(c(s(x),y)) = 4x + 4y + 17 >= 4x + 4y + 17 = f(c(x,s(y)))
   
   f(f(x)) = 16x + 5 >= 16x + 5 = f(d(f(x)))
   
   f(x) = 4x + 1 >= x = x
  problem:
   g(c(x,s(y))) -> g(c(s(x),y))
   f(c(s(x),y)) -> f(c(x,s(y)))
   f(f(x)) -> f(d(f(x)))
  Matrix Interpretation Processor: dim=3
   
   interpretation:
              [1 0 0]  
    [d](x0) = [0 0 0]x0
              [0 0 0]  ,
    
              [1 0 1]     [0]
    [f](x0) = [0 0 1]x0 + [0]
              [0 0 0]     [1],
    
              [1 0 0]     [0]
    [g](x0) = [0 1 0]x0 + [0]
              [0 0 0]     [1],
    
                  [1 0 0]     [1 0 1]  
    [c](x0, x1) = [0 0 0]x0 + [0 1 0]x1
                  [0 0 1]     [0 0 0]  ,
    
              [1 0 0]     [0]
    [s](x0) = [1 1 0]x0 + [0]
              [0 0 1]     [1]
   orientation:
                   [1 0 0]    [1 0 1]    [1]    [1 0 0]    [1 0 1]    [0]               
    g(c(x,s(y))) = [0 0 0]x + [1 1 0]y + [0] >= [0 0 0]x + [0 1 0]y + [0] = g(c(s(x),y))
                   [0 0 0]    [0 0 0]    [1]    [0 0 0]    [0 0 0]    [1]               
    
                   [1 0 1]    [1 0 1]    [1]    [1 0 1]    [1 0 1]    [1]               
    f(c(s(x),y)) = [0 0 1]x + [0 0 0]y + [1] >= [0 0 1]x + [0 0 0]y + [0] = f(c(x,s(y)))
                   [0 0 0]    [0 0 0]    [1]    [0 0 0]    [0 0 0]    [1]               
    
              [1 0 1]    [1]    [1 0 1]    [0]             
    f(f(x)) = [0 0 0]x + [1] >= [0 0 0]x + [0] = f(d(f(x)))
              [0 0 0]    [1]    [0 0 0]    [1]             
   problem:
    f(c(s(x),y)) -> f(c(x,s(y)))
   Matrix Interpretation Processor: dim=3
    
    interpretation:
               [1 0 1]  
     [f](x0) = [0 1 0]x0
               [1 0 0]  ,
     
                   [1 1 0]     [1 0 0]  
     [c](x0, x1) = [1 0 0]x0 + [0 0 0]x1
                   [0 0 1]     [0 0 0]  ,
     
                    [0]
     [s](x0) = x0 + [0]
                    [1]
    orientation:
                    [1 1 1]    [1 0 0]    [1]    [1 1 1]    [1 0 0]                
     f(c(s(x),y)) = [1 0 0]x + [0 0 0]y + [0] >= [1 0 0]x + [0 0 0]y = f(c(x,s(y)))
                    [1 1 0]    [1 0 0]    [0]    [1 1 0]    [1 0 0]                
    problem:
     
    Qed