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