YES(?,O(n^1))
1080.69/297.02	YES(?,O(n^1))
1080.69/297.02	
1080.69/297.02	We are left with following problem, upon which TcT provides the
1080.69/297.02	certificate YES(?,O(n^1)).
1080.69/297.02	
1080.69/297.02	Strict Trs: { b(a(a(a(b(b(x1)))))) -> a(b(a(a(b(b(a(x1))))))) }
1080.69/297.02	Obligation:
1080.69/297.02	  derivational complexity
1080.69/297.02	Answer:
1080.69/297.02	  YES(?,O(n^1))
1080.69/297.02	
1080.69/297.02	The problem is match-bounded by 1. The enriched problem is
1080.69/297.02	compatible with the following automaton.
1080.69/297.02	{ b_0(1) -> 1
1080.69/297.02	, b_0(2) -> 1
1080.69/297.02	, b_1(4) -> 3
1080.69/297.02	, b_1(7) -> 6
1080.69/297.02	, b_1(8) -> 7
1080.69/297.02	, a_0(1) -> 2
1080.69/297.02	, a_0(2) -> 2
1080.69/297.02	, a_1(1) -> 8
1080.69/297.02	, a_1(2) -> 8
1080.69/297.02	, a_1(3) -> 1
1080.69/297.02	, a_1(3) -> 7
1080.69/297.02	, a_1(5) -> 4
1080.69/297.02	, a_1(6) -> 5 }
1080.69/297.02	
1080.69/297.02	Hurray, we answered YES(?,O(n^1))
1080.81/297.18	EOF