MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          active(and(X1,X2)) -> and(active(X1),X2)
          active(and(tt(),X)) -> mark(X)
          active(plus(N,0())) -> mark(N)
          active(plus(N,s(M))) -> mark(s(plus(N,M)))
          active(plus(X1,X2)) -> plus(X1,active(X2))
          active(plus(X1,X2)) -> plus(active(X1),X2)
          active(s(X)) -> s(active(X))
          and(mark(X1),X2) -> mark(and(X1,X2))
          and(ok(X1),ok(X2)) -> ok(and(X1,X2))
          plus(X1,mark(X2)) -> mark(plus(X1,X2))
          plus(mark(X1),X2) -> mark(plus(X1,X2))
          plus(ok(X1),ok(X2)) -> ok(plus(X1,X2))
          proper(0()) -> ok(0())
          proper(and(X1,X2)) -> and(proper(X1),proper(X2))
          proper(plus(X1,X2)) -> plus(proper(X1),proper(X2))
          proper(s(X)) -> s(proper(X))
          proper(tt()) -> ok(tt())
          s(mark(X)) -> mark(s(X))
          s(ok(X)) -> ok(s(X))
          top(mark(X)) -> top(proper(X))
          top(ok(X)) -> top(active(X))
      - Signature:
          {active/1,and/2,plus/2,proper/1,s/1,top/1} / {0/0,mark/1,ok/1,tt/0}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {active,and,plus,proper,s,top} and constructors {0,mark,ok
          ,tt}
  + Applied Processor:
      Ara {heuristics_ = NoHeuristics, minDegree = 1, maxDegree = 3, araTimeout = 60, araFindStrictRules = Nothing, araSmtSolver = MiniSMT}
  + Details:
      The input can not be schown compatible.
MAYBE