/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:
 a(a(b(x1))) -> b(a(b(c(a(x1)))))
 b(a(x1)) -> a(b(b(x1)))
 b(c(a(x1))) -> c(a(b(x1)))

Proof:
 Matrix Interpretation Processor: dim=3
  
  interpretation:
             [1 0 0]  
   [c](x0) = [0 1 0]x0
             [0 0 0]  ,
   
             [1 0 1]     [0]
   [a](x0) = [0 0 1]x0 + [0]
             [1 0 1]     [1],
   
             [1 0 0]  
   [b](x0) = [1 0 0]x0
             [0 0 1]  
  orientation:
                 [2 0 2]     [1]    [1 0 1]     [0]                    
   a(a(b(x1))) = [1 0 1]x1 + [1] >= [1 0 1]x1 + [0] = b(a(b(c(a(x1)))))
                 [2 0 2]     [2]    [1 0 1]     [1]                    
   
              [1 0 1]     [0]    [1 0 1]     [0]              
   b(a(x1)) = [1 0 1]x1 + [0] >= [0 0 1]x1 + [0] = a(b(b(x1)))
              [1 0 1]     [1]    [1 0 1]     [1]              
   
                 [1 0 1]      [1 0 1]                
   b(c(a(x1))) = [1 0 1]x1 >= [0 0 1]x1 = c(a(b(x1)))
                 [0 0 0]      [0 0 0]                
  problem:
   b(a(x1)) -> a(b(b(x1)))
   b(c(a(x1))) -> c(a(b(x1)))
  String Reversal Processor:
   a(b(x1)) -> b(b(a(x1)))
   a(c(b(x1))) -> b(a(c(x1)))
   Bounds Processor:
    bound: 0
    enrichment: match
    automaton:
     final states: {5,1}
     transitions:
      f30() -> 2*
      b0(7) -> 5*
      b0(4) -> 1*
      b0(3) -> 4*
      a0(2) -> 3*
      a0(6) -> 7*
      c0(2) -> 6*
      1 -> 3*
      5 -> 3,7
    problem:
     
    Qed