YES(?,O(n^1))
0.00/0.34	YES(?,O(n^1))
0.00/0.34	
0.00/0.34	We are left with following problem, upon which TcT provides the
0.00/0.34	certificate YES(?,O(n^1)).
0.00/0.34	
0.00/0.34	Strict Trs:
0.00/0.34	  { double(0()) -> 0()
0.00/0.34	  , double(s(x)) -> s(s(double(x)))
0.00/0.34	  , half(double(x)) -> x
0.00/0.34	  , half(0()) -> 0()
0.00/0.34	  , half(s(0())) -> 0()
0.00/0.34	  , half(s(s(x))) -> s(half(x))
0.00/0.34	  , -(x, 0()) -> x
0.00/0.34	  , -(s(x), s(y)) -> -(x, y)
0.00/0.34	  , if(0(), y, z) -> y
0.00/0.34	  , if(s(x), y, z) -> z }
0.00/0.34	Obligation:
0.00/0.34	  innermost runtime complexity
0.00/0.34	Answer:
0.00/0.34	  YES(?,O(n^1))
0.00/0.34	
0.00/0.34	The problem is match-bounded by 1. The enriched problem is
0.00/0.34	compatible with the following automaton.
0.00/0.34	{ double_0(2) -> 1
0.00/0.34	, double_1(2) -> 4
0.00/0.34	, 0_0() -> 1
0.00/0.34	, 0_0() -> 2
0.00/0.34	, 0_1() -> 1
0.00/0.34	, 0_1() -> 3
0.00/0.34	, 0_1() -> 4
0.00/0.34	, s_0(2) -> 1
0.00/0.34	, s_0(2) -> 2
0.00/0.34	, s_1(3) -> 1
0.00/0.34	, s_1(3) -> 3
0.00/0.34	, s_1(3) -> 4
0.00/0.34	, s_1(4) -> 3
0.00/0.34	, half_0(2) -> 1
0.00/0.34	, half_1(2) -> 3
0.00/0.34	, -_0(2, 2) -> 1
0.00/0.34	, -_1(2, 2) -> 1
0.00/0.34	, if_0(2, 2, 2) -> 1 }
0.00/0.34	
0.00/0.34	Hurray, we answered YES(?,O(n^1))
0.00/0.34	EOF