Input TRS:
    1: f(f(a())) -> f(g(n__f(n__a())))
    2: f(X) -> n__f(X)
    3: a() -> n__a()
    4: activate(n__f(X)) -> f(activate(X))
    5: activate(n__a()) -> a()
    6: activate(X) -> X
Number of Rules: 6
Direct QLPOS ... orients all.
	sigma(f) = [1]
	sigma(g) = [1]
	sigma(activate) = [1]
	sigma(n__f) = [1]
    PREC: a = activate > n__a > f > g = n__f
Number of Rules: 0