YES(?,O(n^1))
0.00/0.11	YES(?,O(n^1))
0.00/0.11	
0.00/0.11	We are left with following problem, upon which TcT provides the
0.00/0.11	certificate YES(?,O(n^1)).
0.00/0.11	
0.00/0.11	Strict Trs: { f(s(X), Y) -> h(s(f(h(Y), X))) }
0.00/0.11	Obligation:
0.00/0.11	  innermost runtime complexity
0.00/0.11	Answer:
0.00/0.11	  YES(?,O(n^1))
0.00/0.11	
0.00/0.11	The problem is match-bounded by 1. The enriched problem is
0.00/0.11	compatible with the following automaton.
0.00/0.11	{ f_0(2, 2) -> 1
0.00/0.11	, f_0(2, 3) -> 1
0.00/0.11	, f_0(3, 2) -> 1
0.00/0.11	, f_0(3, 3) -> 1
0.00/0.11	, f_1(6, 2) -> 5
0.00/0.11	, f_1(6, 3) -> 5
0.00/0.11	, s_0(2) -> 2
0.00/0.11	, s_0(3) -> 2
0.00/0.11	, s_1(5) -> 4
0.00/0.11	, h_0(2) -> 3
0.00/0.11	, h_0(3) -> 3
0.00/0.11	, h_1(2) -> 6
0.00/0.11	, h_1(3) -> 6
0.00/0.11	, h_1(4) -> 1 }
0.00/0.11	
0.00/0.11	Hurray, we answered YES(?,O(n^1))
0.00/0.11	EOF