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