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


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


YES

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

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