3.35/1.19	YES
3.49/1.19	
3.49/1.19	Problem:
3.49/1.19	 f(0(x1)) -> s(0(x1))
3.49/1.19	 d(0(x1)) -> 0(x1)
3.49/1.19	 d(s(x1)) -> s(s(d(x1)))
3.49/1.19	 f(s(x1)) -> d(f(x1))
3.49/1.19	
3.49/1.19	Proof:
3.49/1.19	 String Reversal Processor:
3.49/1.19	  0(f(x1)) -> 0(s(x1))
3.49/1.19	  0(d(x1)) -> 0(x1)
3.49/1.19	  s(d(x1)) -> d(s(s(x1)))
3.49/1.19	  s(f(x1)) -> f(d(x1))
3.49/1.19	  Matrix Interpretation Processor: dim=1
3.49/1.19	   
3.49/1.19	   interpretation:
3.49/1.19	    [d](x0) = x0,
3.49/1.19	    
3.49/1.19	    [s](x0) = x0,
3.49/1.19	    
3.49/1.19	    [f](x0) = 8x0 + 8,
3.49/1.19	    
3.49/1.19	    [0](x0) = x0 + 1
3.49/1.19	   orientation:
3.49/1.19	    0(f(x1)) = 8x1 + 9 >= x1 + 1 = 0(s(x1))
3.49/1.19	    
3.49/1.19	    0(d(x1)) = x1 + 1 >= x1 + 1 = 0(x1)
3.49/1.19	    
3.49/1.19	    s(d(x1)) = x1 >= x1 = d(s(s(x1)))
3.49/1.19	    
3.49/1.19	    s(f(x1)) = 8x1 + 8 >= 8x1 + 8 = f(d(x1))
3.49/1.19	   problem:
3.49/1.19	    0(d(x1)) -> 0(x1)
3.49/1.19	    s(d(x1)) -> d(s(s(x1)))
3.49/1.19	    s(f(x1)) -> f(d(x1))
3.49/1.19	   String Reversal Processor:
3.49/1.19	    d(0(x1)) -> 0(x1)
3.49/1.19	    d(s(x1)) -> s(s(d(x1)))
3.49/1.19	    f(s(x1)) -> d(f(x1))
3.49/1.19	    Bounds Processor:
3.49/1.19	     bound: 0
3.49/1.19	     enrichment: match
3.49/1.19	     automaton:
3.49/1.19	      final states: {6,3,1}
3.49/1.19	      transitions:
3.49/1.19	       f40() -> 2*
3.49/1.19	       00(2) -> 1*
3.49/1.19	       s0(5) -> 3*
3.49/1.19	       s0(4) -> 5*
3.49/1.19	       d0(7) -> 6*
3.49/1.19	       d0(2) -> 4*
3.49/1.19	       f0(2) -> 7*
3.49/1.19	       1 -> 4*
3.49/1.19	       3 -> 4*
3.49/1.19	       6 -> 7*
3.49/1.19	     problem:
3.49/1.19	      
3.49/1.19	     Qed
3.49/1.20	EOF