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