Input TRS:
    1: f(X) -> if(X,c(),n__f(true()))
    2: if(true(),X,Y) -> X
    3: if(false(),X,Y) -> activate(Y)
    4: f(X) -> n__f(X)
    5: activate(n__f(X)) -> f(X)
    6: activate(X) -> X
Number of Rules: 6
Direct QWPOS(mSum) ... orients all.
	I(if) = x1 + x2 + x3	sigma(if) = [1,2,3]
	I(c) = 0
	I(f) = x1 + 1	sigma(f) = [1]
	I(activate) = x1 + 2	sigma(activate) = [1]
	I(n__f) = x1	sigma(n__f) = [1]
	I(true) = 0
	I(false) = 3
    PREC: if > activate > c = f = n__f = true = false
Number of Rules: 0