YES(?,O(n^1))
0.00/0.21	YES(?,O(n^1))
0.00/0.21	
0.00/0.21	We are left with following problem, upon which TcT provides the
0.00/0.21	certificate YES(?,O(n^1)).
0.00/0.21	
0.00/0.21	Strict Trs:
0.00/0.21	  { f(x, y) -> h(x, y)
0.00/0.21	  , f(x, y) -> h(y, x)
0.00/0.21	  , h(x, x) -> x }
0.00/0.21	Obligation:
0.00/0.21	  derivational complexity
0.00/0.21	Answer:
0.00/0.21	  YES(?,O(n^1))
0.00/0.21	
0.00/0.21	The problem is match-bounded by 1. The enriched problem is
0.00/0.21	compatible with the following automaton.
0.00/0.21	{ f_0(1, 1) -> 1
0.00/0.21	, f_0(1, 1) -> 2
0.00/0.21	, f_0(1, 2) -> 1
0.00/0.21	, f_0(1, 2) -> 2
0.00/0.21	, f_0(2, 1) -> 1
0.00/0.21	, f_0(2, 1) -> 2
0.00/0.21	, f_0(2, 2) -> 1
0.00/0.21	, f_0(2, 2) -> 2
0.00/0.21	, h_0(1, 1) -> 1
0.00/0.21	, h_0(1, 1) -> 2
0.00/0.21	, h_0(1, 2) -> 1
0.00/0.21	, h_0(1, 2) -> 2
0.00/0.21	, h_0(2, 1) -> 1
0.00/0.21	, h_0(2, 1) -> 2
0.00/0.21	, h_0(2, 2) -> 1
0.00/0.21	, h_0(2, 2) -> 2
0.00/0.21	, h_1(1, 1) -> 1
0.00/0.21	, h_1(1, 1) -> 2
0.00/0.21	, h_1(1, 2) -> 1
0.00/0.21	, h_1(1, 2) -> 2
0.00/0.21	, h_1(2, 1) -> 1
0.00/0.21	, h_1(2, 1) -> 2
0.00/0.21	, h_1(2, 2) -> 1
0.00/0.21	, h_1(2, 2) -> 2 }
0.00/0.21	
0.00/0.21	Hurray, we answered YES(?,O(n^1))
0.00/0.21	EOF