MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          goal(xs,ys) -> overlap(xs,ys)
          member(x,Nil()) -> False()
          member(x',Cons(x,xs)) -> member[Ite][True][Ite](!EQ(x,x'),x',Cons(x,xs))
          notEmpty(Cons(x,xs)) -> True()
          notEmpty(Nil()) -> False()
          overlap(Cons(x,xs),ys) -> overlap[Ite][True][Ite](member(x,ys),Cons(x,xs),ys)
          overlap(Nil(),ys) -> False()
      - Weak TRS:
          !EQ(0(),0()) -> True()
          !EQ(0(),S(y)) -> False()
          !EQ(S(x),0()) -> False()
          !EQ(S(x),S(y)) -> !EQ(x,y)
          member[Ite][True][Ite](False(),x',Cons(x,xs)) -> member(x',xs)
          member[Ite][True][Ite](True(),x,xs) -> True()
          overlap[Ite][True][Ite](False(),Cons(x,xs),ys) -> overlap(xs,ys)
          overlap[Ite][True][Ite](True(),xs,ys) -> True()
      - Signature:
          {!EQ/2,goal/2,member/2,member[Ite][True][Ite]/3,notEmpty/1,overlap/2,overlap[Ite][True][Ite]/3} / {0/0
          ,Cons/2,False/0,Nil/0,S/1,True/0}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {!EQ,goal,member,member[Ite][True][Ite],notEmpty,overlap
          ,overlap[Ite][True][Ite]} and constructors {0,Cons,False,Nil,S,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