YES(?,O(n^1))
0.00/0.17	YES(?,O(n^1))
0.00/0.17	
0.00/0.17	We are left with following problem, upon which TcT provides the
0.00/0.17	certificate YES(?,O(n^1)).
0.00/0.17	
0.00/0.17	Strict Trs:
0.00/0.17	  { f(f(X)) -> c()
0.00/0.17	  , c() -> d()
0.00/0.17	  , h(X) -> c() }
0.00/0.17	Obligation:
0.00/0.17	  derivational complexity
0.00/0.17	Answer:
0.00/0.17	  YES(?,O(n^1))
0.00/0.17	
0.00/0.17	The problem is match-bounded by 2. The enriched problem is
0.00/0.17	compatible with the following automaton.
0.00/0.17	{ f_0(1) -> 1
0.00/0.17	, f_0(2) -> 1
0.00/0.17	, f_0(3) -> 1
0.00/0.17	, f_0(4) -> 1
0.00/0.17	, c_0() -> 2
0.00/0.17	, c_1() -> 1
0.00/0.17	, c_1() -> 4
0.00/0.17	, d_0() -> 3
0.00/0.17	, d_1() -> 2
0.00/0.17	, d_2() -> 1
0.00/0.17	, d_2() -> 4
0.00/0.17	, h_0(1) -> 4
0.00/0.17	, h_0(2) -> 4
0.00/0.17	, h_0(3) -> 4
0.00/0.17	, h_0(4) -> 4 }
0.00/0.17	
0.00/0.17	Hurray, we answered YES(?,O(n^1))
0.00/0.18	EOF