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