YES(?,O(n^1)) 6.44/1.75 YES(?,O(n^1)) 6.44/1.75 6.44/1.75 We are left with following problem, upon which TcT provides the 6.44/1.75 certificate YES(?,O(n^1)). 6.44/1.75 6.44/1.75 Strict Trs: 6.44/1.75 { g(c(x, s(y))) -> g(c(s(x), y)) 6.44/1.75 , f(x) -> x 6.44/1.75 , f(c(s(x), y)) -> f(c(x, s(y))) 6.44/1.75 , f(f(x)) -> f(d(f(x))) } 6.44/1.75 Obligation: 6.44/1.75 runtime complexity 6.44/1.75 Answer: 6.44/1.75 YES(?,O(n^1)) 6.44/1.75 6.44/1.75 The problem is match-bounded by 1. The enriched problem is 6.44/1.75 compatible with the following automaton. 6.44/1.75 { g_0(2) -> 1 6.44/1.75 , g_1(3) -> 1 6.44/1.75 , c_0(2, 2) -> 1 6.44/1.75 , c_0(2, 2) -> 2 6.44/1.75 , c_1(2, 4) -> 1 6.44/1.75 , c_1(2, 4) -> 5 6.44/1.75 , c_1(4, 2) -> 3 6.44/1.75 , s_0(2) -> 1 6.44/1.75 , s_0(2) -> 2 6.44/1.75 , s_1(2) -> 4 6.44/1.75 , s_1(4) -> 4 6.44/1.75 , f_0(2) -> 1 6.44/1.75 , f_1(5) -> 1 6.44/1.75 , d_0(2) -> 1 6.44/1.75 , d_0(2) -> 2 } 6.44/1.75 6.44/1.75 Hurray, we answered YES(?,O(n^1)) 6.44/1.75 EOF