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