MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          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)) -> h(active(X))
          active(h(X)) -> mark(c(d(X)))
          c(ok(X)) -> ok(c(X))
          d(ok(X)) -> ok(d(X))
          f(mark(X)) -> mark(f(X))
          f(ok(X)) -> ok(f(X))
          g(ok(X)) -> ok(g(X))
          h(mark(X)) -> mark(h(X))
          h(ok(X)) -> ok(h(X))
          proper(c(X)) -> c(proper(X))
          proper(d(X)) -> d(proper(X))
          proper(f(X)) -> f(proper(X))
          proper(g(X)) -> g(proper(X))
          proper(h(X)) -> h(proper(X))
          top(mark(X)) -> top(proper(X))
          top(ok(X)) -> top(active(X))
      - Signature:
          {active/1,c/1,d/1,f/1,g/1,h/1,proper/1,top/1} / {mark/1,ok/1}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {active,c,d,f,g,h,proper,top} and constructors {mark,ok}
  + Applied Processor:
      Ara {heuristics_ = NoHeuristics, minDegree = 1, maxDegree = 3, araTimeout = 60, araFindStrictRules = Nothing, araSmtSolver = Z3}
  + Details:
      The input can not be schown compatible.
MAYBE