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