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