YES(?,O(n^1))
0.00/0.51	YES(?,O(n^1))
0.00/0.51	
0.00/0.51	We are left with following problem, upon which TcT provides the
0.00/0.51	certificate YES(?,O(n^1)).
0.00/0.51	
0.00/0.51	Strict Trs:
0.00/0.51	  { f(a(), a()) -> f(a(), b())
0.00/0.51	  , f(a(), b()) -> f(s(a()), c())
0.00/0.51	  , f(s(X), c()) -> f(X, c())
0.00/0.51	  , f(c(), c()) -> f(a(), a()) }
0.00/0.51	Obligation:
0.00/0.51	  derivational complexity
0.00/0.51	Answer:
0.00/0.51	  YES(?,O(n^1))
0.00/0.51	
0.00/0.51	The problem is match-bounded by 4. The enriched problem is
0.00/0.51	compatible with the following automaton.
0.00/0.51	{ f_0(1, 1) -> 1
0.00/0.51	, f_1(1, 3) -> 1
0.00/0.51	, f_1(2, 2) -> 1
0.00/0.51	, f_1(2, 3) -> 1
0.00/0.51	, f_2(2, 5) -> 1
0.00/0.51	, f_2(4, 5) -> 1
0.00/0.51	, f_2(6, 8) -> 1
0.00/0.51	, f_3(6, 7) -> 1
0.00/0.51	, f_4(9, 10) -> 1
0.00/0.51	, a_0() -> 1
0.00/0.51	, a_1() -> 2
0.00/0.51	, a_2() -> 6
0.00/0.51	, a_3() -> 9
0.00/0.51	, b_0() -> 1
0.00/0.51	, b_1() -> 3
0.00/0.51	, b_2() -> 8
0.00/0.51	, s_0(1) -> 1
0.00/0.51	, s_1(2) -> 2
0.00/0.51	, s_2(6) -> 4
0.00/0.51	, s_3(9) -> 6
0.00/0.51	, c_0() -> 1
0.00/0.51	, c_1() -> 3
0.00/0.51	, c_2() -> 5
0.00/0.51	, c_3() -> 7
0.00/0.51	, c_4() -> 10 }
0.00/0.51	
0.00/0.51	Hurray, we answered YES(?,O(n^1))
0.00/0.51	EOF