YES(?,O(n^1))
0.00/0.31	YES(?,O(n^1))
0.00/0.31	
0.00/0.31	We are left with following problem, upon which TcT provides the
0.00/0.31	certificate YES(?,O(n^1)).
0.00/0.31	
0.00/0.31	Strict Trs:
0.00/0.31	  { g(a()) -> g(b())
0.00/0.31	  , b() -> f(a(), a())
0.00/0.31	  , f(a(), a()) -> g(d()) }
0.00/0.31	Obligation:
0.00/0.31	  derivational complexity
0.00/0.31	Answer:
0.00/0.31	  YES(?,O(n^1))
0.00/0.31	
0.00/0.31	The problem is match-bounded by 3. The enriched problem is
0.00/0.31	compatible with the following automaton.
0.00/0.31	{ g_0(1) -> 1
0.00/0.31	, g_1(2) -> 1
0.00/0.31	, g_2(7) -> 1
0.00/0.31	, g_3(8) -> 2
0.00/0.31	, a_0() -> 1
0.00/0.31	, a_1() -> 3
0.00/0.31	, a_1() -> 4
0.00/0.31	, a_2() -> 5
0.00/0.31	, a_2() -> 6
0.00/0.31	, b_0() -> 1
0.00/0.31	, b_1() -> 2
0.00/0.31	, f_0(1, 1) -> 1
0.00/0.31	, f_1(3, 4) -> 1
0.00/0.31	, f_2(5, 6) -> 2
0.00/0.31	, d_0() -> 1
0.00/0.31	, d_1() -> 2
0.00/0.31	, d_2() -> 7
0.00/0.31	, d_3() -> 8 }
0.00/0.31	
0.00/0.31	Hurray, we answered YES(?,O(n^1))
0.00/0.31	EOF