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