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


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


YES

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

Proof:
 Matrix Interpretation Processor: dim=3
  
  interpretation:
             [1 0 1]     [0]
   [b](x0) = [0 0 1]x0 + [1]
             [0 0 0]     [0],
   
             [1 0 1]     [0]
   [a](x0) = [0 1 0]x0 + [1]
             [0 1 0]     [0],
   
             [1 0 0]  
   [c](x0) = [0 0 0]x0
             [0 0 0]  
  orientation:
              [1 1 1]     [0]    [1 1 1]     [0]              
   a(a(x1)) = [0 1 0]x1 + [2] >= [0 1 0]x1 + [2] = a(b(a(x1)))
              [0 1 0]     [1]    [0 1 0]     [1]              
   
                 [1 0 2]     [1]    [1 0 1]     [0]              
   b(a(b(x1))) = [0 0 1]x1 + [2] >= [0 0 0]x1 + [1] = a(c(a(x1)))
                 [0 0 0]     [0]    [0 0 0]     [0]              
  problem:
   a(a(x1)) -> a(b(a(x1)))
  Bounds Processor:
   bound: 2
   enrichment: match
   automaton:
    final states: {3}
    transitions:
     b1(9) -> 10*
     b1(12) -> 13*
     b2(21) -> 22*
     a2(20) -> 21*
     a2(22) -> 23*
     a0(3) -> 3*
     a1(10) -> 11*
     a1(8) -> 9*
     b0(3) -> 3*
     11 -> 9,12,3
     13 -> 10*
     3 -> 8*
     10 -> 20*
     23 -> 9*
   problem:
    
   Qed