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