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

Proof:
 String Reversal Processor:
  C(x1) -> c(x1)
  c(c(x1)) -> x1
  b(b(x1)) -> B(x1)
  B(B(x1)) -> b(x1)
  c(b(c(B(c(x1))))) -> b(c(B(c(b(c(B(x1)))))))
  B(b(x1)) -> x1
  b(B(x1)) -> x1
  C(c(x1)) -> x1
  c(C(x1)) -> x1
  Matrix Interpretation Processor: dim=1
   
   interpretation:
    [B](x0) = x0,
    
    [b](x0) = x0,
    
    [c](x0) = x0 + 1,
    
    [C](x0) = 4x0 + 1
   orientation:
    C(x1) = 4x1 + 1 >= x1 + 1 = c(x1)
    
    c(c(x1)) = x1 + 2 >= x1 = x1
    
    b(b(x1)) = x1 >= x1 = B(x1)
    
    B(B(x1)) = x1 >= x1 = b(x1)
    
    c(b(c(B(c(x1))))) = x1 + 3 >= x1 + 3 = b(c(B(c(b(c(B(x1)))))))
    
    B(b(x1)) = x1 >= x1 = x1
    
    b(B(x1)) = x1 >= x1 = x1
    
    C(c(x1)) = 4x1 + 5 >= x1 = x1
    
    c(C(x1)) = 4x1 + 2 >= x1 = x1
   problem:
    C(x1) -> c(x1)
    b(b(x1)) -> B(x1)
    B(B(x1)) -> b(x1)
    c(b(c(B(c(x1))))) -> b(c(B(c(b(c(B(x1)))))))
    B(b(x1)) -> x1
    b(B(x1)) -> x1
   String Reversal Processor:
    C(x1) -> c(x1)
    b(b(x1)) -> B(x1)
    B(B(x1)) -> b(x1)
    c(B(c(b(c(x1))))) -> B(c(b(c(B(c(b(x1)))))))
    b(B(x1)) -> x1
    B(b(x1)) -> x1
    Bounds Processor:
     bound: 1
     enrichment: match
     automaton:
      final states: {2,5,4,3,1}
      transitions:
       f40() -> 2*
       c0(7) -> 8*
       c0(2) -> 1*
       c0(9) -> 10*
       c0(4) -> 6*
       B0(10) -> 5*
       B0(2) -> 3*
       B0(6) -> 7*
       b0(2) -> 4*
       b0(8) -> 9*
       b1(11) -> 12*
       2 -> 4*
       3 -> 4*
       4 -> 3*
       5 -> 6,1,8
       10 -> 11,9
       12 -> 7*
     problem:
      
     Qed