Input TRS:
    1: azzzz(zz(X,Y),Z) -> azzzz(mark(X),azzzz(mark(Y),mark(Z)))
    2: azzzz(X,nil()) -> mark(X)
    3: azzzz(nil(),X) -> mark(X)
    4: azzU11(tt()) -> azzU12(tt())
    5: azzU12(tt()) -> tt()
    6: azzisNePal(zz(I,zz(P,I))) -> azzU11(tt())
    7: mark(zz(X1,X2)) -> azzzz(mark(X1),mark(X2))
    8: mark(U11(X)) -> azzU11(mark(X))
    9: mark(U12(X)) -> azzU12(mark(X))
    10: mark(isNePal(X)) -> azzisNePal(mark(X))
    11: mark(nil()) -> nil()
    12: mark(tt()) -> tt()
    13: azzzz(X1,X2) -> zz(X1,X2)
    14: azzU11(X) -> U11(X)
    15: azzU12(X) -> U12(X)
    16: azzisNePal(X) -> isNePal(X)
Number of Rules: 16
Direct POLO(Sum) ... removes: 6 5 4 3 2
	I(tt) = 0
	I(mark) = x1
	I(nil) = 1
	I(zz) = x1 + x2
	I(U11) = x1 + 2
	I(U12) = x1 + 1
	I(azzzz) = x1 + x2
	I(azzisNePal) = x1 + 3
	I(azzU11) = x1 + 2
	I(azzU12) = x1 + 1
	I(isNePal) = x1 + 3
Number of Rules: 11
Direct POLO(Sum) ...Direct QLPOS ...Direct QKBOS ... removes: 16 15 14 13 12 11 10 9 8 7 1
	I(tt) = 1
	I(mark) = x1	sigma(mark) = [1]
	I(nil) = 1
	I(zz) = x1 + x2	sigma(zz) = [2,1]
	I(U11) = x1 + 1	sigma(U11) = [1]
	I(U12) = x1 + 1	sigma(U12) = [1]
	I(azzzz) = x1 + x2	sigma(azzzz) = [1,2]
	I(azzisNePal) = x1 + 1	sigma(azzisNePal) = [1]
	I(azzU11) = x1 + 1	sigma(azzU11) = [1]
	I(azzU12) = x1 + 1	sigma(azzU12) = [1]
	I(isNePal) = x1 + 1	sigma(isNePal) = [1]
    PREC: mark > azzzz = azzisNePal = azzU11 = azzU12 > tt = nil = zz = U11 = U12 = isNePal
Number of Rules: 0