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