MAYBE
MAYBE
TRS:
 {
      g(ok(X)) -> ok(g(X)),
    h(mark(X)) -> mark(h(X)),
      h(ok(X)) -> ok(h(X)),
    f(mark(X)) -> mark(f(X)),
      f(ok(X)) -> ok(f(X)),
  active(h(X)) -> h(active(X)),
  active(f(X)) -> mark(g(h(f(X)))),
  active(f(X)) -> f(active(X)),
  proper(g(X)) -> g(proper(X)),
  proper(h(X)) -> h(proper(X)),
  proper(f(X)) -> f(proper(X)),
  top(mark(X)) -> top(proper(X)),
    top(ok(X)) -> top(active(X))
 }
 DUP: We consider a non-duplicating system.
  Trs:
   {
        g(ok(X)) -> ok(g(X)),
      h(mark(X)) -> mark(h(X)),
        h(ok(X)) -> ok(h(X)),
      f(mark(X)) -> mark(f(X)),
        f(ok(X)) -> ok(f(X)),
    active(h(X)) -> h(active(X)),
    active(f(X)) -> mark(g(h(f(X)))),
    active(f(X)) -> f(active(X)),
    proper(g(X)) -> g(proper(X)),
    proper(h(X)) -> h(proper(X)),
    proper(f(X)) -> f(proper(X)),
    top(mark(X)) -> top(proper(X)),
      top(ok(X)) -> top(active(X))
   }
  Fail