YES(?,O(n^1))
113.86/42.10	YES(?,O(n^1))
113.86/42.10	
113.86/42.10	We are left with following problem, upon which TcT provides the
113.86/42.10	certificate YES(?,O(n^1)).
113.86/42.10	
113.86/42.10	Strict Trs:
113.86/42.10	  { a(a(f(x, y))) -> f(a(b(a(b(a(x))))), a(b(a(b(a(y))))))
113.86/42.10	  , f(a(x), a(y)) -> a(f(x, y))
113.86/42.10	  , f(b(x), b(y)) -> b(f(x, y)) }
113.86/42.10	Obligation:
113.86/42.10	  runtime complexity
113.86/42.10	Answer:
113.86/42.10	  YES(?,O(n^1))
113.86/42.10	
113.86/42.10	The problem is match-bounded by 1. The enriched problem is
113.86/42.10	compatible with the following automaton.
113.86/42.10	{ a_0(3) -> 1
113.86/42.10	, f_0(3, 3) -> 2
113.86/42.10	, f_1(3, 3) -> 4
113.86/42.10	, b_0(3) -> 3
113.86/42.10	, b_1(4) -> 2
113.86/42.10	, b_1(4) -> 4 }
113.86/42.10	
113.86/42.10	Hurray, we answered YES(?,O(n^1))
113.86/42.19	EOF