1.26/1.03	MAYBE
1.26/1.03	
1.26/1.03	Proof:
1.26/1.03	ConCon could not decide confluence of the system.
1.26/1.03	\cite{ALS94}, Theorem 4.1 does not apply.
1.26/1.03	This system is of type 3 or smaller.
1.26/1.03	This system is strongly deterministic.
1.26/1.03	This system is of type 3 or smaller.
1.26/1.03	This system is deterministic.
1.26/1.03	This system is non-terminating.
1.26/1.03	Call external tool:
1.26/1.03	./ttt2.sh
1.26/1.03	Input:
1.26/1.03	  a -> b
1.26/1.03	  a -> f(a)
1.26/1.03	  f(x) -> x
1.26/1.03	
1.26/1.03	 Containment Processor: loop length: 1
1.26/1.03	                        terms:
1.26/1.03	                         a()
1.26/1.03	                        context: f([])
1.26/1.03	                        substitution:
1.26/1.03	                         
1.26/1.03	  Qed
1.26/1.03	ConCon could not decide if this system is quasi-decreasing.
1.26/1.03	\cite{A14}, Theorem 11.5.9 does not apply.
1.26/1.03	This system is of type 3 or smaller.
1.26/1.03	This system is deterministic.
1.26/1.03	This system is non-terminating.
1.26/1.03	Call external tool:
1.26/1.03	./ttt2.sh
1.26/1.03	Input:
1.26/1.03	  a -> b
1.26/1.03	  a -> f(a)
1.26/1.03	  f(x) -> x
1.26/1.03	
1.26/1.03	 Containment Processor: loop length: 1
1.26/1.03	                        terms:
1.26/1.03	                         a()
1.26/1.03	                        context: f([])
1.26/1.03	                        substitution:
1.26/1.03	                         
1.26/1.03	  Qed
1.26/1.04	
1.26/1.05	EOF