YES(?,O(n^1))
684.30/297.01	YES(?,O(n^1))
684.30/297.01	
684.30/297.01	We are left with following problem, upon which TcT provides the
684.30/297.01	certificate YES(?,O(n^1)).
684.30/297.01	
684.30/297.01	Strict Trs: { b(c(a(b(b(c(x1)))))) -> a(b(c(b(b(c(a(x1))))))) }
684.30/297.01	Obligation:
684.30/297.01	  derivational complexity
684.30/297.01	Answer:
684.30/297.01	  YES(?,O(n^1))
684.30/297.01	
684.30/297.01	The problem is match-bounded by 1. The enriched problem is
684.30/297.01	compatible with the following automaton.
684.30/297.01	{ b_0(1) -> 1
684.30/297.01	, b_0(2) -> 1
684.30/297.01	, b_0(3) -> 1
684.30/297.01	, b_1(5) -> 4
684.30/297.01	, b_1(7) -> 6
684.30/297.01	, b_1(8) -> 7
684.30/297.01	, c_0(1) -> 2
684.30/297.01	, c_0(2) -> 2
684.30/297.01	, c_0(3) -> 2
684.30/297.01	, c_1(6) -> 5
684.30/297.01	, c_1(9) -> 8
684.30/297.01	, a_0(1) -> 3
684.30/297.01	, a_0(2) -> 3
684.30/297.01	, a_0(3) -> 3
684.30/297.01	, a_1(1) -> 9
684.30/297.01	, a_1(2) -> 9
684.30/297.01	, a_1(3) -> 9
684.30/297.01	, a_1(4) -> 1
684.30/297.01	, a_1(4) -> 7 }
684.30/297.01	
684.30/297.01	Hurray, we answered YES(?,O(n^1))
684.30/297.08	EOF