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