Input TRS:
    1: f(f(a())) -> f(g(n__f(a())))
    2: f(X) -> n__f(X)
    3: activate(n__f(X)) -> f(X)
    4: activate(X) -> X
Number of Rules: 4
Direct POLO(Sum) ... removes: 4 3 2 1
	I(a) = 0
	I(f) = x1 + 1
	I(g) = x1
	I(activate) = x1 + 2
	I(n__f) = x1
Number of Rules: 0