MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          active(f(x)) -> mark(f(f(x)))
          chk(no(c())) -> active(c())
          chk(no(f(x))) -> f(chk(mat(f(f(f(f(f(f(f(f(f(f(X())))))))))),x)))
          f(active(x)) -> active(f(x))
          f(mark(x)) -> mark(f(x))
          f(no(x)) -> no(f(x))
          mat(f(x),c()) -> no(c())
          mat(f(x),f(y())) -> f(mat(x,y()))
          tp(mark(x)) -> tp(chk(mat(f(f(f(f(f(f(f(f(f(f(X())))))))))),x)))
      - Signature:
          {active/1,chk/1,f/1,mat/2,tp/1} / {X/0,c/0,mark/1,no/1,y/0}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {active,chk,f,mat,tp} and constructors {X,c,mark,no,y}
  + Applied Processor:
      Ara {heuristics_ = NoHeuristics, minDegree = 1, maxDegree = 3, araTimeout = 60, araFindStrictRules = Nothing, araSmtSolver = MiniSMT}
  + Details:
      The input can not be schown compatible.
MAYBE