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