YES O(n^5) TRS: { a__f(X) -> f(X), a__f(0()) -> cons(0(), f(s(0()))), a__f(s(0())) -> a__f(a__p(s(0()))), a__p(X) -> p(X), a__p(s(0())) -> 0(), mark(cons(X1, X2)) -> cons(mark(X1), X2), mark(0()) -> 0(), mark(f(X)) -> a__f(mark(X)), mark(s(X)) -> s(mark(X)), mark(p(X)) -> a__p(mark(X)) } DUP: We consider a non-duplicating system. Trs: { a__f(X) -> f(X), a__f(0()) -> cons(0(), f(s(0()))), a__f(s(0())) -> a__f(a__p(s(0()))), a__p(X) -> p(X), a__p(s(0())) -> 0(), mark(cons(X1, X2)) -> cons(mark(X1), X2), mark(0()) -> 0(), mark(f(X)) -> a__f(mark(X)), mark(s(X)) -> s(mark(X)), mark(p(X)) -> a__p(mark(X)) } Matrix Interpretation: Interpretation class: triangular [X4] [1 0 0 0 0][X4] [0] [X3] [0 1 0 1 0][X3] [1] [p]([X2]) = [0 0 1 1 0][X2] + [1] [X1] [0 0 0 0 0][X1] [0] [X0] [0 0 0 0 0][X0] [0] [X4] [1 1 1 1 0][X4] [0] [X3] [0 1 0 0 0][X3] [0] [mark]([X2]) = [0 0 1 0 0][X2] + [0] [X1] [0 0 0 1 0][X1] [0] [X0] [0 0 0 0 1][X0] [0] [X4] [1 0 0 0 0][X4] [1] [X3] [0 1 0 1 0][X3] [1] [a__p]([X2]) = [0 0 1 1 0][X2] + [1] [X1] [0 0 0 0 0][X1] [0] [X0] [0 0 0 0 0][X0] [0] [X4] [1 0 0 1 1][X4] [1] [X3] [0 1 0 1 1][X3] [1] [a__f]([X2]) = [0 0 1 1 1][X2] + [1] [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 1 1 0 0][X3] [0] [s]([X2]) = [0 0 1 1 0][X2] + [0] [X1] [0 0 0 0 0][X1] [1] [X0] [0 0 0 0 0][X0] [1] [X4] [1 0 0 0 0][X4] [0] [X3] [0 1 0 1 1][X3] [1] [f]([X2]) = [0 0 1 1 1][X2] + [1] [X1] [0 0 0 0 0][X1] [0] [X0] [0 0 0 0 0][X0] [0] [0] [1] [0] = [0] [0] [0] [X9] [X4] [1 0 0 0 0][X9] [1 0 0 0 0][X4] [0] [X8] [X3] [0 1 1 0 0][X8] [0 0 0 0 0][X3] [0] [cons]([X7], [X2]) = [0 0 0 0 0][X7] + [0 0 0 0 0][X2] + [1] [X6] [X1] [0 0 0 1 0][X6] [0 0 0 0 0][X1] [0] [X5] [X0] [0 0 0 0 0][X5] [0 0 0 0 0][X0] [0] Qed