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