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