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