Input TRS:
    1: top(ok(new(x))) -> top(check(x))
    2: top(ok(old(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)) ->= ok(old(x))	[relative]
   e5: new(ok(x)) ->= ok(new(x))	[relative]
   e6: old(ok(x)) ->= ok(old(x))	[relative]
Dependency Pairs:
   #1: # top(ok(old(x))) -> # top(check(x))
   #2: # top(ok(new(x))) -> # top(check(x))
Number of SCCs: 1
  SCC { #1 #2 }
    POLO(Sum)... removes: #1
	I(new) = max(x1, 0)
	I(top) = max(x1 - 1, 0)
	I(bot) = 1
	I(check) = max(x1 + 2, 0)
	I(ok) = max(x1 + 2, 0)
	I(# top) = max(x1 + 1, 0)
	I(old) = max(x1 + 3, 0)
Number of SCCs: 1
  SCC { #2 }
    POLO(Sum)... QLPOS... QWPOpS(mSum)... Mat2b... removes: #2
	I(new) = [1,0;1,1] * x1
	I(top) = [0,0;1,0] * x1
	I(bot) = [0;1]
	I(check) = [1,0;1,1] * x1 + [0;1]
	I(ok) = x1 + [0;2]
	I(# top) = [0,1;1,0] * x1
	I(old) = x1 + [1;1]
Number of SCCs: 0