4.70/2.18	YES
4.70/2.18	
4.70/2.18	Proof:
4.70/2.18	This system is confluent.
4.70/2.18	Removed infeasible rules from system R.
4.70/2.18	By \cite{ALS94}, Theorem 4.1.
4.70/2.18	This system is of type 3 or smaller.
4.70/2.18	This system is strongly deterministic.
4.70/2.18	This system is quasi-decreasing.
4.70/2.18	By \cite{O02}, p. 214, Proposition 7.2.50.
4.70/2.18	This system is of type 3 or smaller.
4.70/2.18	This system is deterministic.
4.70/2.18	System R transformed to optimized U(R).
4.70/2.18	This system is terminating.
4.70/2.18	Call external tool:
4.70/2.18	./ttt2.sh
4.70/2.18	Input:
4.70/2.18	(VAR x)
4.70/2.18	(RULES
4.70/2.18	  g(x, x) -> g(f(a), f(b))
4.70/2.18	)
4.70/2.18	
4.70/2.18	 DP Processor:
4.70/2.18	  DPs:
4.70/2.18	   g#(x,x) -> g#(f(a()),f(b()))
4.70/2.18	  TRS:
4.70/2.18	   g(x,x) -> g(f(a()),f(b()))
4.70/2.18	  EDG Processor:
4.70/2.18	   DPs:
4.70/2.18	    g#(x,x) -> g#(f(a()),f(b()))
4.70/2.18	   TRS:
4.70/2.18	    g(x,x) -> g(f(a()),f(b()))
4.70/2.18	   graph:
4.70/2.18	    
4.70/2.18	   SCC Processor:
4.70/2.18	    #sccs: 0
4.70/2.18	    #rules: 0
4.70/2.18	    #arcs: 0/1
4.70/2.18	    
4.70/2.18	All 0 critical pairs are joinable.
4.70/2.18	
6.56/2.50	EOF