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