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