/export/starexec/sandbox/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


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


YES

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

Proof:
 String Reversal Processor:
  a(a(x1)) -> b(b(b(x1)))
  b(b(x1)) -> c(c(c(x1)))
  c(c(c(c(x1)))) -> b(a(x1))
  Matrix Interpretation Processor: dim=1
   
   interpretation:
    [c](x0) = x0 + 2,
    
    [b](x0) = x0 + 3,
    
    [a](x0) = x0 + 5
   orientation:
    a(a(x1)) = x1 + 10 >= x1 + 9 = b(b(b(x1)))
    
    b(b(x1)) = x1 + 6 >= x1 + 6 = c(c(c(x1)))
    
    c(c(c(c(x1)))) = x1 + 8 >= x1 + 8 = b(a(x1))
   problem:
    b(b(x1)) -> c(c(c(x1)))
    c(c(c(c(x1)))) -> b(a(x1))
   String Reversal Processor:
    b(b(x1)) -> c(c(c(x1)))
    c(c(c(c(x1)))) -> a(b(x1))
    Bounds Processor:
     bound: 2
     enrichment: match
     automaton:
      final states: {4}
      transitions:
       a1(29) -> 30*
       a1(14) -> 15*
       b1(35) -> 36*
       b1(31) -> 32*
       b1(28) -> 29*
       b1(13) -> 14*
       c1(10) -> 11*
       c1(9) -> 10*
       c1(11) -> 12*
       a2(47) -> 48*
       a2(21) -> 22*
       a2(38) -> 39*
       b0(4) -> 4*
       b2(20) -> 21*
       b2(37) -> 38*
       b2(46) -> 47*
       c0(4) -> 4*
       a0(4) -> 4*
       4 -> 13,9
       9 -> 35,20
       10 -> 46,28
       11 -> 37,31
       12 -> 21,36,14,4
       15 -> 11,12,10,4
       22 -> 10*
       30 -> 11,4,10
       32 -> 29*
       36 -> 14*
       39 -> 12,4
       48 -> 11*
     problem:
      
     Qed