YES(?,O(n^1)) 0.15/0.29 YES(?,O(n^1)) 0.15/0.29 0.15/0.29 Problem: 0.15/0.29 f(f(a())) -> c(n__f(g(f(a())))) 0.15/0.29 f(X) -> n__f(X) 0.15/0.29 activate(n__f(X)) -> f(X) 0.15/0.29 activate(X) -> X 0.15/0.29 0.15/0.29 Proof: 0.15/0.29 Complexity Transformation Processor: 0.15/0.29 strict: 0.15/0.29 f(f(a())) -> c(n__f(g(f(a())))) 0.15/0.29 f(X) -> n__f(X) 0.15/0.29 activate(n__f(X)) -> f(X) 0.15/0.29 activate(X) -> X 0.15/0.29 weak: 0.15/0.29 0.15/0.29 Matrix Interpretation Processor: dim=1 0.15/0.29 0.15/0.29 max_matrix: 0.15/0.29 1 0.15/0.29 interpretation: 0.15/0.29 [activate](x0) = x0 + 9, 0.15/0.29 0.15/0.29 [c](x0) = x0, 0.15/0.29 0.15/0.29 [n__f](x0) = x0 + 28, 0.15/0.29 0.15/0.29 [g](x0) = x0 + 3, 0.15/0.29 0.15/0.29 [f](x0) = x0 + 120, 0.15/0.29 0.15/0.29 [a] = 145 0.15/0.29 orientation: 0.15/0.29 f(f(a())) = 385 >= 296 = c(n__f(g(f(a())))) 0.15/0.29 0.15/0.29 f(X) = X + 120 >= X + 28 = n__f(X) 0.15/0.29 0.15/0.29 activate(n__f(X)) = X + 37 >= X + 120 = f(X) 0.15/0.29 0.15/0.29 activate(X) = X + 9 >= X = X 0.15/0.29 problem: 0.15/0.29 strict: 0.15/0.29 activate(n__f(X)) -> f(X) 0.15/0.29 weak: 0.15/0.29 f(f(a())) -> c(n__f(g(f(a())))) 0.15/0.29 f(X) -> n__f(X) 0.15/0.29 activate(X) -> X 0.15/0.29 Matrix Interpretation Processor: dim=1 0.15/0.29 0.15/0.29 max_matrix: 0.15/0.29 1 0.15/0.29 interpretation: 0.15/0.29 [activate](x0) = x0 + 32, 0.15/0.29 0.15/0.29 [c](x0) = x0, 0.15/0.29 0.15/0.29 [n__f](x0) = x0, 0.15/0.29 0.15/0.29 [g](x0) = x0 + 2, 0.15/0.29 0.15/0.29 [f](x0) = x0 + 2, 0.15/0.29 0.15/0.29 [a] = 222 0.15/0.29 orientation: 0.15/0.29 activate(n__f(X)) = X + 32 >= X + 2 = f(X) 0.15/0.29 0.15/0.29 f(f(a())) = 226 >= 226 = c(n__f(g(f(a())))) 0.15/0.29 0.15/0.29 f(X) = X + 2 >= X = n__f(X) 0.15/0.29 0.15/0.29 activate(X) = X + 32 >= X = X 0.15/0.29 problem: 0.15/0.29 strict: 0.15/0.29 0.15/0.29 weak: 0.15/0.29 activate(n__f(X)) -> f(X) 0.15/0.29 f(f(a())) -> c(n__f(g(f(a())))) 0.15/0.29 f(X) -> n__f(X) 0.15/0.29 activate(X) -> X 0.15/0.29 Qed 0.15/0.29 EOF