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