4.56/1.46	YES
4.56/1.46	
4.56/1.46	Problem:
4.56/1.46	 a(x1) -> g(d(x1))
4.56/1.46	 b(b(b(x1))) -> c(d(c(x1)))
4.56/1.46	 b(b(x1)) -> a(g(g(x1)))
4.56/1.46	 c(d(x1)) -> g(g(x1))
4.56/1.46	 g(g(g(x1))) -> b(b(x1))
4.56/1.46	
4.56/1.46	Proof:
4.56/1.46	 Matrix Interpretation Processor: dim=1
4.56/1.46	  
4.56/1.46	  interpretation:
4.56/1.46	   [c](x0) = x0 + 4,
4.56/1.46	   
4.56/1.46	   [b](x0) = x0 + 3,
4.56/1.46	   
4.56/1.46	   [g](x0) = x0 + 2,
4.56/1.46	   
4.56/1.46	   [d](x0) = x0,
4.56/1.46	   
4.56/1.46	   [a](x0) = x0 + 2
4.56/1.46	  orientation:
4.56/1.46	   a(x1) = x1 + 2 >= x1 + 2 = g(d(x1))
4.56/1.46	   
4.56/1.46	   b(b(b(x1))) = x1 + 9 >= x1 + 8 = c(d(c(x1)))
4.56/1.46	   
4.56/1.46	   b(b(x1)) = x1 + 6 >= x1 + 6 = a(g(g(x1)))
4.56/1.46	   
4.56/1.46	   c(d(x1)) = x1 + 4 >= x1 + 4 = g(g(x1))
4.56/1.46	   
4.56/1.46	   g(g(g(x1))) = x1 + 6 >= x1 + 6 = b(b(x1))
4.56/1.46	  problem:
4.56/1.46	   a(x1) -> g(d(x1))
4.56/1.46	   b(b(x1)) -> a(g(g(x1)))
4.56/1.46	   c(d(x1)) -> g(g(x1))
4.56/1.46	   g(g(g(x1))) -> b(b(x1))
4.56/1.46	  Bounds Processor:
4.56/1.46	   bound: 2
4.56/1.46	   enrichment: match
4.56/1.46	   automaton:
4.56/1.46	    final states: {7,6,4,1}
4.56/1.46	    transitions:
4.56/1.46	     b0(2) -> 8*
4.56/1.46	     b0(8) -> 7*
4.56/1.46	     a1(21) -> 22*
4.56/1.46	     g1(20) -> 21*
4.56/1.46	     g1(10) -> 11*
4.56/1.46	     g1(19) -> 20*
4.56/1.46	     d1(9) -> 10*
4.56/1.46	     g2(24) -> 25*
4.56/1.46	     d2(23) -> 24*
4.56/1.46	     f50() -> 2*
4.56/1.46	     g0(5) -> 6*
4.56/1.46	     g0(2) -> 5*
4.56/1.46	     g0(3) -> 1*
4.56/1.46	     d0(2) -> 3*
4.56/1.46	     a0(6) -> 4*
4.56/1.46	     2 -> 19*
4.56/1.46	     4 -> 8*
4.56/1.46	     6 -> 9*
4.56/1.46	     7 -> 20,5,21,6,9,23
4.56/1.46	     11 -> 4*
4.56/1.46	     21 -> 23*
4.56/1.46	     22 -> 7*
4.56/1.46	     25 -> 22,7
4.56/1.46	   problem:
4.56/1.46	    
4.56/1.46	   Qed
4.56/1.47	EOF