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

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