YES(?,O(n^1))
13.50/7.66	YES(?,O(n^1))
13.50/7.66	
13.50/7.66	We are left with following problem, upon which TcT provides the
13.50/7.66	certificate YES(?,O(n^1)).
13.50/7.66	
13.50/7.66	Strict Trs:
13.50/7.66	  { zeros() -> cons(0(), n__zeros())
13.50/7.66	  , zeros() -> n__zeros()
13.50/7.66	  , tail(cons(X, XS)) -> activate(XS)
13.50/7.66	  , activate(X) -> X
13.50/7.66	  , activate(n__zeros()) -> zeros() }
13.50/7.66	Obligation:
13.50/7.66	  derivational complexity
13.50/7.66	Answer:
13.50/7.66	  YES(?,O(n^1))
13.50/7.66	
13.50/7.66	The problem is match-bounded by 3. The enriched problem is
13.50/7.66	compatible with the following automaton.
13.50/7.66	{ zeros_0() -> 1
13.50/7.66	, zeros_1() -> 1
13.50/7.66	, zeros_2() -> 1
13.50/7.66	, cons_0(1, 1) -> 1
13.50/7.66	, cons_1(2, 3) -> 1
13.50/7.66	, cons_2(4, 5) -> 1
13.50/7.66	, cons_3(6, 7) -> 1
13.50/7.66	, 0_0() -> 1
13.50/7.66	, 0_1() -> 2
13.50/7.66	, 0_2() -> 4
13.50/7.66	, 0_3() -> 6
13.50/7.66	, n__zeros_0() -> 1
13.50/7.66	, n__zeros_1() -> 1
13.50/7.66	, n__zeros_1() -> 3
13.50/7.66	, n__zeros_2() -> 1
13.50/7.66	, n__zeros_2() -> 5
13.50/7.66	, n__zeros_3() -> 1
13.50/7.66	, n__zeros_3() -> 7
13.50/7.66	, tail_0(1) -> 1
13.50/7.66	, activate_0(1) -> 1
13.50/7.66	, activate_1(1) -> 1
13.50/7.66	, activate_1(3) -> 1
13.50/7.66	, activate_1(5) -> 1
13.50/7.66	, activate_1(7) -> 1 }
13.50/7.66	
13.50/7.66	Hurray, we answered YES(?,O(n^1))
13.50/7.67	EOF