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