Input TRS:
    1: top(old(x)) -> top(check(x))
    2: top(new(x)) -> top(check(x))
   e1: bot() ->= new(bot())	[relative]
   e2: check(new(x)) ->= new(check(x))	[relative]
   e3: check(old(x)) ->= old(check(x))	[relative]
   e4: check(old(x)) ->= old(x)	[relative]
Dependency Pairs:
   #1: # top(new(x)) -> # top(check(x))
   #2: # top(old(x)) -> # top(check(x))
Number of SCCs: 1
  SCC { #1 #2 }
    POLO(Sum)... removes: #2
	I(new) = max(x1, 0)
	I(top) = 0
	I(bot) = 1
	I(check) = max(x1, 0)
	I(# top) = max(x1 + 1, 0)
	I(old) = max(x1 + 1, 0)
Number of SCCs: 1
  SCC { #1 }
    POLO(Sum)... QLPOS... QWPOpS(mSum)... Mat2b... failed.