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