YES(?,O(n^1)) 4.55/2.74 YES(?,O(n^1)) 4.55/2.74 4.55/2.74 We are left with following problem, upon which TcT provides the 4.55/2.74 certificate YES(?,O(n^1)). 4.55/2.74 4.55/2.74 Strict Trs: { g(x, a(), b()) -> g(b(), b(), a()) } 4.55/2.74 Obligation: 4.55/2.74 derivational complexity 4.55/2.74 Answer: 4.55/2.74 YES(?,O(n^1)) 4.55/2.74 4.55/2.74 TcT has computed the following matrix interpretation satisfying 4.55/2.74 not(EDA) and not(IDA(1)). 4.55/2.74 4.55/2.74 [1 0 0 0] [1 0 0 0] [1 1 0 0] [0] 4.55/2.74 [g](x1, x2, x3) = [0 0 0 0] x1 + [0 0 0 0] x2 + [0 0 0 0] x3 + [1] 4.55/2.74 [0 0 0 0] [0 0 0 0] [0 0 0 0] [1] 4.55/2.74 [0 0 0 0] [0 0 0 0] [0 0 0 0] [1] 4.55/2.74 4.55/2.74 [0] 4.55/2.74 [a] = [0] 4.55/2.74 [0] 4.55/2.74 [0] 4.55/2.74 4.55/2.74 [0] 4.55/2.74 [b] = [1] 4.55/2.74 [0] 4.55/2.74 [0] 4.55/2.74 4.55/2.74 The order satisfies the following ordering constraints: 4.55/2.74 4.55/2.74 [g(x, a(), b())] = [1 0 0 0] [1] 4.55/2.74 [0 0 0 0] x + [1] 4.55/2.74 [0 0 0 0] [1] 4.55/2.74 [0 0 0 0] [1] 4.55/2.74 > [0] 4.55/2.74 [1] 4.55/2.74 [1] 4.55/2.74 [1] 4.55/2.74 = [g(b(), b(), a())] 4.55/2.74 4.55/2.74 4.55/2.74 Hurray, we answered YES(?,O(n^1)) 4.55/2.75 EOF