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