YES(?,O(n^1))
0.00/0.50	YES(?,O(n^1))
0.00/0.50	
0.00/0.50	We are left with following problem, upon which TcT provides the
0.00/0.50	certificate YES(?,O(n^1)).
0.00/0.50	
0.00/0.50	Strict Trs:
0.00/0.50	  { g(S(x), y) -> g(x, S(y))
0.00/0.50	  , g(0(), x2) -> x2
0.00/0.50	  , f(y, S(x)) -> f(S(y), x)
0.00/0.50	  , f(x1, 0()) -> g(x1, 0()) }
0.00/0.50	Obligation:
0.00/0.50	  innermost runtime complexity
0.00/0.50	Answer:
0.00/0.50	  YES(?,O(n^1))
0.00/0.50	
0.00/0.50	The problem is match-bounded by 2. The enriched problem is
0.00/0.50	compatible with the following automaton.
0.00/0.50	{ g_0(2, 2) -> 1
0.00/0.50	, g_0(2, 4) -> 1
0.00/0.50	, g_0(4, 2) -> 1
0.00/0.50	, g_0(4, 4) -> 1
0.00/0.50	, g_1(2, 5) -> 1
0.00/0.50	, g_1(2, 6) -> 3
0.00/0.50	, g_1(4, 5) -> 1
0.00/0.50	, g_1(4, 6) -> 3
0.00/0.50	, g_1(5, 6) -> 3
0.00/0.50	, g_2(2, 7) -> 3
0.00/0.50	, g_2(4, 7) -> 3
0.00/0.50	, g_2(5, 7) -> 3
0.00/0.50	, S_0(2) -> 1
0.00/0.50	, S_0(2) -> 2
0.00/0.50	, S_0(4) -> 1
0.00/0.50	, S_0(4) -> 2
0.00/0.50	, S_1(2) -> 1
0.00/0.50	, S_1(2) -> 5
0.00/0.50	, S_1(4) -> 1
0.00/0.50	, S_1(4) -> 5
0.00/0.50	, S_1(5) -> 1
0.00/0.50	, S_1(5) -> 5
0.00/0.50	, S_1(6) -> 3
0.00/0.50	, S_1(6) -> 6
0.00/0.50	, S_1(7) -> 3
0.00/0.50	, S_1(7) -> 6
0.00/0.50	, S_2(6) -> 3
0.00/0.50	, S_2(6) -> 7
0.00/0.50	, S_2(7) -> 3
0.00/0.50	, S_2(7) -> 7
0.00/0.50	, f_0(2, 2) -> 3
0.00/0.50	, f_0(2, 4) -> 3
0.00/0.50	, f_0(4, 2) -> 3
0.00/0.50	, f_0(4, 4) -> 3
0.00/0.50	, f_1(5, 2) -> 3
0.00/0.50	, f_1(5, 4) -> 3
0.00/0.50	, 0_0() -> 1
0.00/0.50	, 0_0() -> 4
0.00/0.50	, 0_1() -> 3
0.00/0.50	, 0_1() -> 6 }
0.00/0.50	
0.00/0.50	Hurray, we answered YES(?,O(n^1))
0.00/0.50	EOF