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