MAYBE
Input TRS:
      1: top(old(x)) -> top(check(x))
      2: top(new(x)) -> top(check(x))
      3: bot() ->= new(bot())
      4: check(new(x)) ->= new(check(x))
      5: check(old(x)) ->= old(check(x))
      6: check(old(x)) ->= old(x)
Number of strict rules: 2
Direct POLO(bPol) ... removes: 1
      new	w: x1
      top	w: x1 + 8365
      bot	w: 32286
      check	w: x1
      old	w: x1 + 10451
Number of strict rules: 1
Direct POLO(bPol) ... removes: 5 6
      new	w: 2 * x1
      top	w: x1 + 23045
      bot	w: 0
      check	w: 2 * x1
      old	w: 2 * x1 + 10451
Number of strict rules: 1
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #top(new(x)) -> #top(check(x))
Number of SCCs: 1, DPs: 1
  SCC { #1 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.