3.16/1.43	YES
3.16/1.44	
3.16/1.44	Problem:
3.16/1.44	 f(0(x1)) -> s(0(x1))
3.16/1.44	 d(0(x1)) -> 0(x1)
3.16/1.44	 d(s(x1)) -> s(s(d(p(s(x1)))))
3.16/1.44	 f(s(x1)) -> d(f(p(s(x1))))
3.16/1.44	 p(s(x1)) -> x1
3.16/1.44	
3.16/1.44	Proof:
3.16/1.44	 Matrix Interpretation Processor: dim=1
3.16/1.44	  
3.16/1.44	  interpretation:
3.16/1.44	   [p](x0) = x0,
3.16/1.44	   
3.16/1.44	   [d](x0) = x0,
3.16/1.44	   
3.16/1.44	   [s](x0) = x0,
3.16/1.44	   
3.16/1.44	   [f](x0) = x0 + 8,
3.16/1.44	   
3.16/1.44	   [0](x0) = 2x0 + 14
3.16/1.44	  orientation:
3.16/1.44	   f(0(x1)) = 2x1 + 22 >= 2x1 + 14 = s(0(x1))
3.16/1.44	   
3.16/1.44	   d(0(x1)) = 2x1 + 14 >= 2x1 + 14 = 0(x1)
3.16/1.44	   
3.16/1.44	   d(s(x1)) = x1 >= x1 = s(s(d(p(s(x1)))))
3.16/1.44	   
3.16/1.44	   f(s(x1)) = x1 + 8 >= x1 + 8 = d(f(p(s(x1))))
3.16/1.44	   
3.16/1.44	   p(s(x1)) = x1 >= x1 = x1
3.16/1.44	  problem:
3.16/1.44	   d(0(x1)) -> 0(x1)
3.16/1.44	   d(s(x1)) -> s(s(d(p(s(x1)))))
3.16/1.44	   f(s(x1)) -> d(f(p(s(x1))))
3.16/1.44	   p(s(x1)) -> x1
3.16/1.44	  Bounds Processor:
3.16/1.44	   bound: 0
3.16/1.44	   enrichment: match
3.16/1.44	   automaton:
3.16/1.44	    final states: {2,8,3,1}
3.16/1.44	    transitions:
3.16/1.44	     f50() -> 2*
3.16/1.44	     00(2) -> 1*
3.16/1.44	     s0(7) -> 3*
3.16/1.44	     s0(2) -> 4*
3.16/1.44	     s0(6) -> 7*
3.16/1.44	     d0(5) -> 6*
3.16/1.44	     d0(9) -> 8*
3.16/1.44	     p0(4) -> 5*
3.16/1.44	     f0(5) -> 9*
3.16/1.44	     1 -> 6*
3.16/1.44	     2 -> 5*
3.16/1.44	     3 -> 6*
3.16/1.44	     8 -> 9*
3.16/1.44	   problem:
3.16/1.44	    
3.16/1.44	   Qed
3.16/1.44	EOF