3.14/1.66	YES
3.14/1.66	
3.14/1.66	Proof:
3.14/1.66	This system is confluent.
3.14/1.66	Removed infeasible rules from system R.
3.14/1.66	By \cite{ALS94}, Theorem 4.1.
3.14/1.66	This system is of type 3 or smaller.
3.14/1.66	This system is strongly deterministic.
3.14/1.66	This system is quasi-decreasing.
3.14/1.66	By \cite{O02}, p. 214, Proposition 7.2.50.
3.14/1.66	This system is of type 3 or smaller.
3.14/1.66	This system is deterministic.
3.14/1.66	System R transformed to optimized U(R).
3.14/1.66	This system is terminating.
3.14/1.66	Call external tool:
3.14/1.66	./ttt2.sh
3.14/1.66	Input:
3.14/1.66	(VAR )
3.14/1.66	(RULES
3.14/1.66	  
3.14/1.66	)
3.14/1.66	
3.14/1.66	 Bounds Processor:
3.14/1.66	  bound: 0
3.14/1.66	  enrichment: match
3.14/1.66	  automaton:
3.14/1.66	   final states: {2}
3.14/1.66	   transitions:
3.14/1.66	    f20() -> 2*
3.14/1.66	  problem:
3.14/1.66	   
3.14/1.67	  Qed
3.14/1.67	All 0 critical pairs are joinable.
3.14/1.67	
3.40/1.69	EOF