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