YES(?,O(n^1))
5.04/1.57	YES(?,O(n^1))
5.04/1.57	
5.04/1.57	We are left with following problem, upon which TcT provides the
5.04/1.57	certificate YES(?,O(n^1)).
5.04/1.57	
5.04/1.57	Strict Trs:
5.04/1.57	  { f(0()) -> cons(0())
5.04/1.57	  , f(s(0())) -> f(p(s(0())))
5.04/1.57	  , p(s(X)) -> X }
5.04/1.57	Obligation:
5.04/1.57	  innermost runtime complexity
5.04/1.57	Answer:
5.04/1.57	  YES(?,O(n^1))
5.04/1.57	
5.04/1.57	The problem is match-bounded by 2. The enriched problem is
5.04/1.57	compatible with the following automaton.
5.04/1.57	{ f_0(2) -> 1
5.04/1.57	, f_1(4) -> 1
5.04/1.57	, 0_0() -> 1
5.04/1.57	, 0_0() -> 2
5.04/1.57	, 0_1() -> 3
5.04/1.57	, 0_1() -> 4
5.04/1.57	, 0_2() -> 6
5.04/1.57	, cons_0(2) -> 1
5.04/1.57	, cons_0(2) -> 2
5.04/1.57	, cons_1(3) -> 1
5.04/1.57	, cons_2(6) -> 1
5.04/1.57	, s_0(2) -> 1
5.04/1.57	, s_0(2) -> 2
5.04/1.57	, s_1(3) -> 5
5.04/1.57	, p_0(2) -> 1
5.04/1.57	, p_1(5) -> 4 }
5.04/1.57	
5.04/1.57	Hurray, we answered YES(?,O(n^1))
5.04/1.58	EOF