MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          goal(xs) -> subsets(xs)
          mapconsapp(x,Nil(),rest) -> rest
          mapconsapp(x',Cons(x,xs),rest) -> Cons(Cons(x',x),mapconsapp(x',xs,rest))
          notEmpty(Cons(x,xs)) -> True()
          notEmpty(Nil()) -> False()
          subsets(Cons(x,xs)) -> subsets[Ite][True][Let](Cons(x,xs),subsets(xs))
          subsets(Nil()) -> Cons(Nil(),Nil())
      - Weak TRS:
          subsets[Ite][True][Let](Cons(x,xs),subs) -> mapconsapp(x,subs,subs)
      - Signature:
          {goal/1,mapconsapp/3,notEmpty/1,subsets/1,subsets[Ite][True][Let]/2} / {Cons/2,False/0,Nil/0,True/0}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {goal,mapconsapp,notEmpty,subsets
          ,subsets[Ite][True][Let]} and constructors {Cons,False,Nil,True}
  + Applied Processor:
      Ara {heuristics_ = NoHeuristics, minDegree = 1, maxDegree = 3, araTimeout = 60, araFindStrictRules = Nothing, araSmtSolver = MiniSMT}
  + Details:
      The input can not be schown compatible.
MAYBE