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