MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          *(x,0()) -> 0()
          *(x,s(y)) -> +(x,*(x,y))
          +(0(),y) -> y
          +(s(x),y) -> s(+(x,y))
          -(x,0()) -> x
          -(s(x),s(y)) -> -(x,y)
          f(s(x)) -> f(-(+(*(s(x),s(x)),*(s(x),s(s(s(0()))))),*(s(s(x)),s(s(x)))))
      - Signature:
          {*/2,+/2,-/2,f/1} / {0/0,s/1}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {*,+,-,f} 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