4.29/1.97	YES
4.29/1.97	
4.29/1.97	Proof:
4.29/1.98	This system is confluent.
4.29/1.98	By \cite{ALS94}, Theorem 4.1.
4.29/1.98	This system is of type 3 or smaller.
4.29/1.98	This system is strongly deterministic.
4.29/1.98	This system is quasi-decreasing.
4.29/1.98	By \cite{A14}, Theorem 11.5.9.
4.29/1.98	This system is of type 3 or smaller.
4.29/1.98	This system is deterministic.
4.29/1.98	System R transformed to V(R) + Emb.
4.29/1.98	This system is terminating.
4.29/1.98	Call external tool:
4.29/1.98	./ttt2.sh
4.29/1.98	Input:
4.29/1.98	(VAR x)
4.29/1.98	(RULES
4.29/1.98	  f(g(x)) -> b
4.29/1.98	  f(g(x)) -> x
4.29/1.98	  g(x) -> c
4.29/1.98	  g(x) -> x
4.29/1.98	  g(x) -> x
4.29/1.98	  f(x) -> x
4.29/1.98	)
4.29/1.98	
4.29/1.98	 Matrix Interpretation Processor: dim=3
4.29/1.98	  
4.29/1.98	  interpretation:
4.29/1.98	         [0]
4.29/1.98	   [c] = [0]
4.29/1.98	         [0],
4.29/1.98	   
4.29/1.98	         [0]
4.29/1.98	   [b] = [0]
4.29/1.98	         [1],
4.29/1.98	   
4.29/1.98	             [1 0 0]  
4.29/1.98	   [f](x0) = [0 1 0]x0
4.29/1.98	             [1 0 1]  ,
4.29/1.98	   
4.29/1.98	                  [1]
4.29/1.98	   [g](x0) = x0 + [0]
4.29/1.98	                  [0]
4.29/1.98	  orientation:
4.29/1.98	             [1 0 0]    [1]    [0]      
4.29/1.98	   f(g(x)) = [0 1 0]x + [0] >= [0] = b()
4.29/1.98	             [1 0 1]    [1]    [1]      
4.29/1.98	   
4.29/1.98	             [1 0 0]    [1]         
4.29/1.98	   f(g(x)) = [0 1 0]x + [0] >= x = x
4.29/1.98	             [1 0 1]    [1]         
4.29/1.98	   
4.29/1.98	              [1]    [0]      
4.29/1.98	   g(x) = x + [0] >= [0] = c()
4.29/1.99	              [0]    [0]      
4.29/1.99	   
4.29/1.99	              [1]         
4.29/1.99	   g(x) = x + [0] >= x = x
4.29/1.99	              [0]         
4.29/1.99	   
4.29/1.99	          [1 0 0]          
4.29/1.99	   f(x) = [0 1 0]x >= x = x
4.29/1.99	          [1 0 1]          
4.29/1.99	  problem:
4.29/1.99	   f(x) -> x
4.29/1.99	  Matrix Interpretation Processor: dim=3
4.29/1.99	   
4.29/1.99	   interpretation:
4.29/1.99	                   [1]
4.29/1.99	    [f](x0) = x0 + [0]
4.29/1.99	                   [0]
4.29/1.99	   orientation:
4.29/1.99	               [1]         
4.29/1.99	    f(x) = x + [0] >= x = x
4.29/1.99	               [0]         
4.29/1.99	   problem:
4.29/1.99	    
4.29/1.99	   Qed
4.29/1.99	All 1 critical pairs are joinable.
4.29/1.99	Overlap: (rule1: f(g(y)) -> b <= y = a, rule2: g(z) -> c <= z = c, pos: 1, mgu: {(y,z)})
4.29/1.99	CP: f(c) = b <= z = a, z = c
4.29/1.99	This critical pair is unfeasible.
4.29/1.99	
4.29/2.02	EOF