YES(?,O(n^1))
1079.86/297.02	YES(?,O(n^1))
1079.86/297.02	
1079.86/297.02	We are left with following problem, upon which TcT provides the
1079.86/297.02	certificate YES(?,O(n^1)).
1079.86/297.02	
1079.86/297.02	Strict Trs: { b(a(b(a(b(b(x1)))))) -> a(b(a(b(b(b(a(x1))))))) }
1079.86/297.02	Obligation:
1079.86/297.02	  derivational complexity
1079.86/297.02	Answer:
1079.86/297.02	  YES(?,O(n^1))
1079.86/297.02	
1079.86/297.02	The problem is match-bounded by 3. The enriched problem is
1079.86/297.02	compatible with the following automaton.
1079.86/297.02	{ b_0(1) -> 1
1079.86/297.02	, b_1(3) -> 2
1079.86/297.02	, b_1(5) -> 4
1079.86/297.02	, b_1(6) -> 5
1079.86/297.02	, b_1(7) -> 6
1079.86/297.02	, b_2(9) -> 8
1079.86/297.02	, b_2(11) -> 10
1079.86/297.02	, b_2(12) -> 11
1079.86/297.02	, b_2(13) -> 12
1079.86/297.02	, b_2(15) -> 14
1079.86/297.02	, b_2(17) -> 16
1079.86/297.02	, b_2(18) -> 17
1079.86/297.02	, b_2(19) -> 18
1079.86/297.02	, b_3(21) -> 20
1079.86/297.02	, b_3(23) -> 22
1079.86/297.02	, b_3(24) -> 23
1079.86/297.02	, b_3(25) -> 24
1079.86/297.02	, a_0(1) -> 1
1079.86/297.02	, a_1(1) -> 7
1079.86/297.02	, a_1(2) -> 1
1079.86/297.02	, a_1(2) -> 6
1079.86/297.02	, a_1(2) -> 12
1079.86/297.02	, a_1(4) -> 3
1079.86/297.02	, a_1(6) -> 7
1079.86/297.02	, a_2(6) -> 13
1079.86/297.02	, a_2(8) -> 5
1079.86/297.02	, a_2(8) -> 11
1079.86/297.02	, a_2(10) -> 9
1079.86/297.02	, a_2(12) -> 19
1079.86/297.02	, a_2(14) -> 4
1079.86/297.02	, a_2(16) -> 15
1079.86/297.02	, a_3(12) -> 25
1079.86/297.02	, a_3(20) -> 10
1079.86/297.02	, a_3(22) -> 21 }
1079.86/297.02	
1079.86/297.02	Hurray, we answered YES(?,O(n^1))
1079.98/297.17	EOF