MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          add0(x,0()) -> x
          add0(x',S(x)) -> +(S(0()),add0(x',x))
          mult(x,0()) -> 0()
          mult(x',S(x)) -> add0(x',mult(x',x))
          power(x,0()) -> S(0())
          power(x',S(x)) -> mult(x',power(x',x))
      - Weak TRS:
          +(x,S(0())) -> S(x)
          +(S(0()),y) -> S(y)
      - Signature:
          {+/2,add0/2,mult/2,power/2} / {0/0,S/1}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {+,add0,mult,power} and constructors {0,S}
  + Applied Processor:
      Ara {heuristics_ = NoHeuristics, minDegree = 1, maxDegree = 3, araTimeout = 60, araFindStrictRules = Nothing, araSmtSolver = MiniSMT}
  + Details:
      The input can not be schown compatible.
MAYBE