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