MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          =(.(x,y),.(u(),v())) -> and(=(x,u()),=(y,v()))
          =(.(x,y),nil()) -> false()
          =(nil(),.(y,z)) -> false()
          =(nil(),nil()) -> true()
          del(.(x,.(y,z))) -> f(=(x,y),x,y,z)
          f(false(),x,y,z) -> .(x,del(.(y,z)))
          f(true(),x,y,z) -> del(.(y,z))
      - Signature:
          {=/2,del/1,f/4} / {./2,and/2,false/0,nil/0,true/0,u/0,v/0}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {=,del,f} and constructors {.,and,false,nil,true,u,v}
  + Applied Processor:
      Ara {heuristics_ = NoHeuristics, minDegree = 1, maxDegree = 3, araTimeout = 60, araFindStrictRules = Nothing, araSmtSolver = MiniSMT}
  + Details:
      The input can not be schown compatible.
MAYBE