/export/starexec/sandbox/solver/bin/starexec_run_ttt2 /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


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


YES

Problem:
 a(b(x1)) -> b(c(a(x1)))
 b(c(x1)) -> c(b(b(x1)))
 b(a(x1)) -> a(c(b(x1)))

Proof:
 Matrix Interpretation Processor: dim=2
  
  interpretation:
             [1 3]  
   [a](x0) = [0 2]x0,
   
                  [0]
   [b](x0) = x0 + [2],
   
             [1 0]  
   [c](x0) = [0 0]x0
  orientation:
              [1 3]     [6]    [1 3]     [0]              
   a(b(x1)) = [0 2]x1 + [4] >= [0 0]x1 + [2] = b(c(a(x1)))
   
              [1 0]     [0]    [1 0]                
   b(c(x1)) = [0 0]x1 + [2] >= [0 0]x1 = c(b(b(x1)))
   
              [1 3]     [0]    [1 0]                
   b(a(x1)) = [0 2]x1 + [2] >= [0 0]x1 = a(c(b(x1)))
  problem:
   b(c(x1)) -> c(b(b(x1)))
   b(a(x1)) -> a(c(b(x1)))
  String Reversal Processor:
   c(b(x1)) -> b(b(c(x1)))
   a(b(x1)) -> b(c(a(x1)))
   WPO Processor:
    algebra: Sum
    weight function:
     w0 = 0
     w(c) = w(a) = w(b) = 0
    status function:
     st(c) = st(a) = st(b) = [0]
    precedence:
     a > c > b
    problem:
     
    Qed