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