YES(?,O(n^1)) 943.01/297.02 YES(?,O(n^1)) 943.01/297.02 943.01/297.02 We are left with following problem, upon which TcT provides the 943.01/297.02 certificate YES(?,O(n^1)). 943.01/297.02 943.01/297.02 Strict Trs: 943.01/297.02 { +(+(x, y), z) -> +(x, +(y, z)) 943.01/297.02 , +(*(x, y), +(*(x, z), u())) -> +(*(x, +(y, z)), u()) 943.01/297.02 , +(*(x, y), *(x, z)) -> *(x, +(y, z)) } 943.01/297.02 Obligation: 943.01/297.02 innermost runtime complexity 943.01/297.02 Answer: 943.01/297.02 YES(?,O(n^1)) 943.01/297.02 943.01/297.02 The problem is match-bounded by 1. The enriched problem is 943.01/297.02 compatible with the following automaton. 943.01/297.02 { +_0(2, 2) -> 1 943.01/297.02 , +_1(2, 2) -> 3 943.01/297.02 , *_0(2, 2) -> 2 943.01/297.02 , *_1(2, 3) -> 1 943.01/297.02 , *_1(2, 3) -> 3 943.01/297.02 , u_0() -> 2 } 943.01/297.02 943.01/297.02 Hurray, we answered YES(?,O(n^1)) 943.23/297.26 EOF