YES(?,O(n^1))
0.00/0.19	YES(?,O(n^1))
0.00/0.19	
0.00/0.19	We are left with following problem, upon which TcT provides the
0.00/0.19	certificate YES(?,O(n^1)).
0.00/0.19	
0.00/0.19	Strict Trs:
0.00/0.19	  { h(f(x), y) -> f(g(x, y))
0.00/0.19	  , g(x, y) -> h(x, y) }
0.00/0.19	Obligation:
0.00/0.19	  runtime complexity
0.00/0.19	Answer:
0.00/0.19	  YES(?,O(n^1))
0.00/0.19	
0.00/0.19	The input is overlay and right-linear. Switching to innermost
0.00/0.19	rewriting.
0.00/0.19	
0.00/0.19	We are left with following problem, upon which TcT provides the
0.00/0.19	certificate YES(?,O(n^1)).
0.00/0.19	
0.00/0.19	Strict Trs:
0.00/0.19	  { h(f(x), y) -> f(g(x, y))
0.00/0.19	  , g(x, y) -> h(x, y) }
0.00/0.19	Obligation:
0.00/0.19	  innermost runtime complexity
0.00/0.19	Answer:
0.00/0.19	  YES(?,O(n^1))
0.00/0.19	
0.00/0.19	The problem is match-bounded by 2. The enriched problem is
0.00/0.19	compatible with the following automaton.
0.00/0.19	{ h_0(2, 2) -> 1
0.00/0.19	, h_1(2, 2) -> 3
0.00/0.19	, h_2(2, 2) -> 4
0.00/0.19	, f_0(2) -> 2
0.00/0.19	, f_1(4) -> 1
0.00/0.19	, f_1(4) -> 3
0.00/0.19	, f_1(4) -> 4
0.00/0.19	, g_0(2, 2) -> 3
0.00/0.19	, g_1(2, 2) -> 4 }
0.00/0.19	
0.00/0.19	Hurray, we answered YES(?,O(n^1))
0.00/0.20	EOF