YES(?,O(n^1))
1003.60/297.02	YES(?,O(n^1))
1003.60/297.02	
1003.60/297.02	We are left with following problem, upon which TcT provides the
1003.60/297.02	certificate YES(?,O(n^1)).
1003.60/297.02	
1003.60/297.02	Strict Trs:
1003.60/297.02	  { f(f(a(), x), y) -> f(y, f(x, f(a(), f(h(a()), a())))) }
1003.60/297.02	Obligation:
1003.60/297.02	  derivational complexity
1003.60/297.02	Answer:
1003.60/297.02	  YES(?,O(n^1))
1003.60/297.02	
1003.60/297.02	The problem is match-bounded by 2. The enriched problem is
1003.60/297.02	compatible with the following automaton.
1003.60/297.02	{ f_0(1, 1) -> 1
1003.60/297.02	, f_1(1, 2) -> 1
1003.60/297.02	, f_1(1, 3) -> 2
1003.60/297.02	, f_1(2, 2) -> 1
1003.60/297.02	, f_1(2, 3) -> 2
1003.60/297.02	, f_1(3, 2) -> 2
1003.60/297.02	, f_1(3, 3) -> 2
1003.60/297.02	, f_1(4, 5) -> 3
1003.60/297.02	, f_1(6, 7) -> 5
1003.60/297.02	, f_1(9, 2) -> 2
1003.60/297.02	, f_2(2, 9) -> 2
1003.60/297.02	, f_2(3, 9) -> 2
1003.60/297.02	, f_2(5, 10) -> 9
1003.60/297.02	, f_2(9, 9) -> 2
1003.60/297.02	, f_2(11, 12) -> 10
1003.60/297.02	, f_2(13, 14) -> 12
1003.60/297.02	, a_0() -> 1
1003.60/297.02	, a_1() -> 4
1003.60/297.02	, a_1() -> 7
1003.60/297.02	, a_1() -> 8
1003.60/297.02	, a_2() -> 11
1003.60/297.02	, a_2() -> 14
1003.60/297.02	, a_2() -> 15
1003.60/297.02	, h_0(1) -> 1
1003.60/297.02	, h_1(8) -> 6
1003.60/297.02	, h_2(15) -> 13 }
1003.60/297.02	
1003.60/297.02	Hurray, we answered YES(?,O(n^1))
1003.71/297.13	EOF