1.86/1.65	YES
1.86/1.65	
1.86/1.65	Proof:
1.86/1.65	This system is confluent.
1.86/1.65	Removed infeasible rules from system R.
1.86/1.65	By \cite{ALS94}, Theorem 4.1.
1.86/1.65	This system is of type 3 or smaller.
1.86/1.65	This system is strongly deterministic.
1.86/1.65	This system is quasi-decreasing.
1.86/1.65	By \cite{A14}, Theorem 11.5.9.
1.86/1.65	This system is of type 3 or smaller.
1.86/1.65	This system is deterministic.
1.86/1.66	System R transformed to V(R) + Emb.
1.86/1.66	This system is terminating.
1.86/1.66	Call external tool:
1.86/1.66	./ttt2.sh
1.86/1.66	Input:
1.86/1.66	(VAR )
1.86/1.66	(RULES
1.86/1.66	  
1.86/1.66	)
1.86/1.66	
1.86/1.66	 Bounds Processor:
1.86/1.66	  bound: 0
1.86/1.66	  enrichment: match
1.86/1.66	  automaton:
1.86/1.66	   final states: {}
1.86/1.66	   transitions:
1.86/1.66	  problem:
1.86/1.66	   
1.86/1.66	  Qed
1.86/1.66	All 0 critical pairs are joinable.
1.86/1.66	
3.38/1.72	EOF