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