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