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