YES(?,O(n^1))

We are left with following problem, upon which TcT provides the
certificate YES(?,O(n^1)).

Strict Trs:
  { rec(rec(x)) -> sent(rec(x))
  , rec(sent(x)) -> sent(rec(x))
  , rec(no(x)) -> sent(rec(x))
  , rec(bot()) -> up(sent(bot()))
  , rec(up(x)) -> up(rec(x))
  , sent(up(x)) -> up(sent(x))
  , no(up(x)) -> up(no(x))
  , top(rec(up(x))) -> top(check(rec(x)))
  , top(sent(up(x))) -> top(check(rec(x)))
  , top(no(up(x))) -> top(check(rec(x)))
  , check(rec(x)) -> rec(check(x))
  , check(sent(x)) -> sent(check(x))
  , check(no(x)) -> no(x)
  , check(no(x)) -> no(check(x))
  , check(up(x)) -> up(check(x)) }
Obligation:
  runtime complexity
Answer:
  YES(?,O(n^1))

The problem is match-bounded by 1. The enriched problem is
compatible with the following automaton.
{ rec_0(2) -> 1
, rec_1(2) -> 3
, sent_0(2) -> 1
, sent_1(2) -> 3
, sent_1(4) -> 3
, no_0(2) -> 1
, no_1(2) -> 3
, bot_0() -> 2
, bot_1() -> 4
, up_0(2) -> 2
, up_1(3) -> 1
, up_1(3) -> 3
, top_0(2) -> 1
, check_0(2) -> 1
, check_1(2) -> 3 }

Hurray, we answered YES(?,O(n^1))