11.49/3.38	MAYBE
11.49/3.38	
11.49/3.38	Problem:
11.49/3.38	lt(x, 0()) -> false()
11.49/3.38	lt(0(), s(x)) -> true()
11.49/3.38	lt(s(x), s(y)) -> lt(x, y)
11.49/3.38	m(0(), s(y)) -> 0()
11.49/3.38	m(x, 0()) -> x
11.49/3.38	m(s(x), s(y)) -> m(x, y)
11.49/3.38	gcd(x, x) -> x
11.49/3.38	gcd(s(x), 0()) -> s(x)
11.49/3.38	gcd(0(), s(y)) -> s(y)
11.49/3.38	gcd(s(x), s(y)) -> gcd(m(x, y), s(y)) <= lt(y, x) = true()
11.49/3.38	gcd(s(x), s(y)) -> gcd(s(x), m(y, x)) <= lt(x, y) = true()
11.49/3.38	
11.49/3.38	Proof:
11.49/3.38	ConCon could not decide confluence of the system.
11.49/3.38	\cite{ALS94}, Theorem 4.1 does not apply.
11.49/3.38	ConCon could not decide whether all 6 critical pairs are joinable or not.
11.49/3.38	CP: s(x) = gcd(s(x), m(x, x)) <= lt(x, x) = true():
11.49/3.38	ConCon could not decide infeasibility of this critical pair.
11.49/3.38	
12.65/3.69	EOF