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