YES O(n^5) TRS: { c(X) -> d(activate(X)), f(X) -> n__f(X), f(f(X)) -> c(n__f(g(n__f(X)))), d(X) -> n__d(X), activate(X) -> X, activate(n__f(X)) -> f(X), activate(n__d(X)) -> d(X), h(X) -> c(n__d(X)) } DUP: We consider a non-duplicating system. Trs: { c(X) -> d(activate(X)), f(X) -> n__f(X), f(f(X)) -> c(n__f(g(n__f(X)))), d(X) -> n__d(X), activate(X) -> X, activate(n__f(X)) -> f(X), activate(n__d(X)) -> d(X), h(X) -> c(n__d(X)) } Matrix Interpretation: Interpretation class: triangular [X4] [1 0 0 0 0][X4] [7] [X3] [0 0 0 0 0][X3] [0] [h]([X2]) = [0 0 0 4 4][X2] + [0] [X1] [0 0 0 0 0][X1] [0] [X0] [0 0 0 0 0][X0] [0] [X4] [1 0 0 0 0][X4] [0] [X3] [0 0 0 0 0][X3] [0] [n__d]([X2]) = [0 0 0 0 0][X2] + [0] [X1] [0 0 0 0 0][X1] [0] [X0] [0 0 0 0 0][X0] [0] [X4] [1 0 0 1 0][X4] [4] [X3] [0 1 4 0 4][X3] [4] [activate]([X2]) = [0 0 1 0 0][X2] + [0] [X1] [0 0 0 1 4][X1] [3] [X0] [0 0 0 0 1][X0] [0] [X4] [1 0 0 0 0][X4] [1] [X3] [0 0 0 0 0][X3] [0] [d]([X2]) = [0 0 0 0 0][X2] + [0] [X1] [0 0 0 0 0][X1] [0] [X0] [0 0 0 0 0][X0] [0] [X4] [1 1 0 7 2][X4] [6] [X3] [0 1 4 7 0][X3] [4] [f]([X2]) = [0 0 1 6 0][X2] + [0] [X1] [0 0 0 1 3][X1] [7] [X0] [0 0 0 0 0][X0] [0] [X4] [1 0 1 0 0][X4] [0] [X3] [0 0 0 0 0][X3] [0] [g]([X2]) = [0 0 0 6 0][X2] + [6] [X1] [0 0 0 0 0][X1] [0] [X0] [0 0 0 0 0][X0] [1] [X4] [1 1 0 7 0][X4] [0] [X3] [0 1 0 0 0][X3] [0] [n__f]([X2]) = [0 0 1 6 0][X2] + [0] [X1] [0 0 0 1 3][X1] [4] [X0] [0 0 0 0 0][X0] [0] [X4] [1 0 1 4 0][X4] [6] [X3] [0 0 1 0 2][X3] [0] [c]([X2]) = [0 0 0 0 2][X2] + [0] [X1] [0 0 0 1 4][X1] [0] [X0] [0 0 0 0 0][X0] [0] Qed