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