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