YES(?,O(n^1))
0.00/0.25	YES(?,O(n^1))
0.00/0.25	
0.00/0.25	We are left with following problem, upon which TcT provides the
0.00/0.25	certificate YES(?,O(n^1)).
0.00/0.25	
0.00/0.25	Strict Trs:
0.00/0.25	  { minus(minus(x)) -> x
0.00/0.25	  , minus(h(x)) -> h(minus(x))
0.00/0.25	  , minus(f(x, y)) -> f(minus(y), minus(x)) }
0.00/0.25	Obligation:
0.00/0.25	  innermost runtime complexity
0.00/0.25	Answer:
0.00/0.25	  YES(?,O(n^1))
0.00/0.25	
0.00/0.25	The problem is match-bounded by 1. The enriched problem is
0.00/0.25	compatible with the following automaton.
0.00/0.25	{ minus_0(2) -> 1
0.00/0.25	, minus_0(3) -> 1
0.00/0.25	, minus_1(2) -> 4
0.00/0.25	, minus_1(3) -> 4
0.00/0.25	, h_0(2) -> 2
0.00/0.25	, h_0(3) -> 2
0.00/0.25	, h_1(4) -> 1
0.00/0.25	, h_1(4) -> 4
0.00/0.25	, f_0(2, 2) -> 3
0.00/0.25	, f_0(2, 3) -> 3
0.00/0.25	, f_0(3, 2) -> 3
0.00/0.25	, f_0(3, 3) -> 3
0.00/0.25	, f_1(4, 4) -> 1
0.00/0.25	, f_1(4, 4) -> 4 }
0.00/0.25	
0.00/0.25	Hurray, we answered YES(?,O(n^1))
0.00/0.26	EOF