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