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