Term Rewriting System R: [X] active(f(X)) -> mark(g(h(f(X)))) active(f(X)) -> f(active(X)) active(h(X)) -> h(active(X)) f(mark(X)) -> mark(f(X)) f(ok(X)) -> ok(f(X)) h(mark(X)) -> mark(h(X)) h(ok(X)) -> ok(h(X)) proper(f(X)) -> f(proper(X)) proper(g(X)) -> g(proper(X)) proper(h(X)) -> h(proper(X)) g(ok(X)) -> ok(g(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Termination of R to be shown. Removing the following rules from R which fullfill a polynomial ordering: top(ok(X)) -> top(active(X)) where the Polynomial interpretation: POL(active(x_1)) = x_1 POL(g(x_1)) = x_1 POL(proper(x_1)) = x_1 POL(top(x_1)) = 1 + x_1 POL(mark(x_1)) = x_1 POL(h(x_1)) = x_1 POL(ok(x_1)) = 1 + x_1 POL(f(x_1)) = x_1 was used. Not all Rules of R can be deleted, so we still have to regard a part of R. Removing the following rules from R which fullfill a polynomial ordering: active(f(X)) -> mark(g(h(f(X)))) active(f(X)) -> f(active(X)) where the Polynomial interpretation: POL(active(x_1)) = 2*x_1 POL(g(x_1)) = x_1 POL(proper(x_1)) = x_1 POL(top(x_1)) = 1 + x_1 POL(mark(x_1)) = x_1 POL(h(x_1)) = x_1 POL(ok(x_1)) = x_1 POL(f(x_1)) = 1 + x_1 was used. Not all Rules of R can be deleted, so we still have to regard a part of R. Removing the following rules from R which fullfill a polynomial ordering: proper(g(X)) -> g(proper(X)) where the Polynomial interpretation: POL(active(x_1)) = x_1 POL(g(x_1)) = 1 + x_1 POL(proper(x_1)) = 2*x_1 POL(top(x_1)) = x_1 POL(mark(x_1)) = 2*x_1 POL(h(x_1)) = x_1 POL(ok(x_1)) = x_1 POL(f(x_1)) = x_1 was used. Not all Rules of R can be deleted, so we still have to regard a part of R. Removing the following rules from R which fullfill a polynomial ordering: active(h(X)) -> h(active(X)) where the Polynomial interpretation: POL(active(x_1)) = 2*x_1 POL(g(x_1)) = x_1 POL(proper(x_1)) = x_1 POL(top(x_1)) = x_1 POL(mark(x_1)) = x_1 POL(h(x_1)) = 1 + x_1 POL(ok(x_1)) = x_1 POL(f(x_1)) = x_1 was used. Not all Rules of R can be deleted, so we still have to regard a part of R. Removing the following rules from R which fullfill a polynomial ordering: top(mark(X)) -> top(proper(X)) where the Polynomial interpretation: POL(g(x_1)) = x_1 POL(proper(x_1)) = x_1 POL(top(x_1)) = x_1 POL(mark(x_1)) = 1 + x_1 POL(h(x_1)) = x_1 POL(ok(x_1)) = x_1 POL(f(x_1)) = x_1 was used. Not all Rules of R can be deleted, so we still have to regard a part of R. Removing the following rules from R which fullfill a polynomial ordering: h(mark(X)) -> mark(h(X)) where the Polynomial interpretation: POL(g(x_1)) = x_1 POL(proper(x_1)) = x_1 POL(mark(x_1)) = 1 + x_1 POL(h(x_1)) = 2*x_1 POL(ok(x_1)) = x_1 POL(f(x_1)) = x_1 was used. Not all Rules of R can be deleted, so we still have to regard a part of R. Removing the following rules from R which fullfill a polynomial ordering: proper(h(X)) -> h(proper(X)) where the Polynomial interpretation: POL(g(x_1)) = x_1 POL(proper(x_1)) = 2*x_1 POL(mark(x_1)) = x_1 POL(h(x_1)) = 1 + x_1 POL(ok(x_1)) = x_1 POL(f(x_1)) = x_1 was used. Not all Rules of R can be deleted, so we still have to regard a part of R. Removing the following rules from R which fullfill a polynomial ordering: f(mark(X)) -> mark(f(X)) where the Polynomial interpretation: POL(g(x_1)) = x_1 POL(proper(x_1)) = x_1 POL(mark(x_1)) = 1 + x_1 POL(h(x_1)) = x_1 POL(ok(x_1)) = x_1 POL(f(x_1)) = 2*x_1 was used. Not all Rules of R can be deleted, so we still have to regard a part of R. Removing the following rules from R which fullfill a polynomial ordering: proper(f(X)) -> f(proper(X)) where the Polynomial interpretation: POL(g(x_1)) = x_1 POL(proper(x_1)) = 2*x_1 POL(h(x_1)) = x_1 POL(ok(x_1)) = x_1 POL(f(x_1)) = 1 + x_1 was used. Not all Rules of R can be deleted, so we still have to regard a part of R. Removing the following rules from R which fullfill a polynomial ordering: h(ok(X)) -> ok(h(X)) where the Polynomial interpretation: POL(g(x_1)) = x_1 POL(h(x_1)) = 2*x_1 POL(ok(x_1)) = 1 + x_1 POL(f(x_1)) = x_1 was used. Not all Rules of R can be deleted, so we still have to regard a part of R. Removing the following rules from R which fullfill a polynomial ordering: f(ok(X)) -> ok(f(X)) where the Polynomial interpretation: POL(g(x_1)) = x_1 POL(ok(x_1)) = 1 + x_1 POL(f(x_1)) = 2*x_1 was used. Not all Rules of R can be deleted, so we still have to regard a part of R. Removing the following rules from R which fullfill a polynomial ordering: g(ok(X)) -> ok(g(X)) where the Polynomial interpretation: POL(g(x_1)) = 2*x_1 POL(ok(x_1)) = 1 + x_1 was used. All Rules of R can be deleted. Termination of R successfully shown. Duration: 0.998 seconds.