YES(?,O(n^1))
3.60/1.24	YES(?,O(n^1))
3.60/1.24	
3.60/1.24	We are left with following problem, upon which TcT provides the
3.60/1.24	certificate YES(?,O(n^1)).
3.60/1.24	
3.60/1.24	Strict Trs:
3.60/1.24	  { f(x, x, y) -> x
3.60/1.24	  , f(x, y, y) -> y
3.60/1.24	  , f(x, y, g(y)) -> x
3.60/1.24	  , f(f(x, y, z), u, f(x, y, v)) -> f(x, y, f(z, u, v))
3.60/1.24	  , f(g(x), x, y) -> y }
3.60/1.24	Obligation:
3.60/1.24	  runtime complexity
3.60/1.24	Answer:
3.60/1.24	  YES(?,O(n^1))
3.60/1.24	
3.60/1.24	The problem is match-bounded by 0. The enriched problem is
3.60/1.24	compatible with the following automaton.
3.60/1.24	{ f_0(2, 2, 2) -> 1
3.60/1.24	, g_0(2) -> 1
3.60/1.24	, g_0(2) -> 2 }
3.60/1.24	
3.60/1.24	Hurray, we answered YES(?,O(n^1))
3.60/1.24	EOF