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