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