3.35/1.15	YES
3.35/1.16	
3.35/1.16	Problem:
3.35/1.16	 a(b(x1)) -> b(b(b(x1)))
3.35/1.16	 a(c(x1)) -> c(b(b(x1)))
3.35/1.16	 b(a(x1)) -> a(a(a(x1)))
3.35/1.16	 b(c(x1)) -> c(c(c(x1)))
3.35/1.16	 a(x1) -> x1
3.35/1.16	 b(x1) -> x1
3.35/1.16	 c(x1) -> x1
3.35/1.16	
3.35/1.16	Proof:
3.35/1.16	 String Reversal Processor:
3.35/1.16	  b(a(x1)) -> b(b(b(x1)))
3.35/1.16	  c(a(x1)) -> b(b(c(x1)))
3.35/1.16	  a(b(x1)) -> a(a(a(x1)))
3.35/1.16	  c(b(x1)) -> c(c(c(x1)))
3.35/1.16	  a(x1) -> x1
3.35/1.16	  b(x1) -> x1
3.35/1.16	  c(x1) -> x1
3.35/1.16	  Bounds Processor:
3.35/1.16	   bound: 1
3.35/1.16	   enrichment: match
3.35/1.16	   automaton:
3.35/1.16	    final states: {2,11,8,5,1}
3.35/1.16	    transitions:
3.35/1.16	     c1(17) -> 18*
3.35/1.16	     c1(19) -> 20*
3.35/1.16	     c1(18) -> 19*
3.35/1.16	     f30() -> 2*
3.35/1.16	     b0(7) -> 5*
3.35/1.16	     b0(2) -> 3*
3.35/1.16	     b0(4) -> 1*
3.35/1.16	     b0(6) -> 7*
3.35/1.16	     b0(3) -> 4*
3.35/1.16	     c0(12) -> 11*
3.35/1.16	     c0(2) -> 6*
3.35/1.16	     c0(6) -> 12*
3.35/1.16	     a0(10) -> 8*
3.35/1.16	     a0(2) -> 9*
3.35/1.16	     a0(9) -> 10*
3.35/1.16	     1 -> 3,4,7
3.35/1.16	     2 -> 6,3,9
3.35/1.16	     3 -> 4*
3.35/1.16	     4 -> 1*
3.35/1.16	     5 -> 6,7,12
3.35/1.16	     6 -> 12,7
3.35/1.16	     7 -> 17,5
3.35/1.16	     8 -> 9,10
3.35/1.16	     9 -> 10*
3.35/1.16	     10 -> 8*
3.35/1.16	     11 -> 5*
3.35/1.16	     12 -> 11*
3.35/1.16	     17 -> 18*
3.35/1.16	     18 -> 19*
3.35/1.16	     19 -> 12,20
3.35/1.16	     20 -> 18,11
3.35/1.16	   problem:
3.35/1.16	    
3.35/1.16	   Qed
3.35/1.16	EOF