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