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