Input TRS:
    1: active(zz(zz(X,Y),Z)) -> mark(zz(X,zz(Y,Z)))
    2: active(zz(X,nil())) -> mark(X)
    3: active(zz(nil(),X)) -> mark(X)
    4: active(and(tt(),X)) -> mark(X)
    5: active(isNePal(zz(I,zz(P,I)))) -> mark(tt())
    6: mark(zz(X1,X2)) -> active(zz(mark(X1),mark(X2)))
    7: mark(nil()) -> active(nil())
    8: mark(and(X1,X2)) -> active(and(mark(X1),X2))
    9: mark(tt()) -> active(tt())
    10: mark(isNePal(X)) -> active(isNePal(mark(X)))
    11: zz(mark(X1),X2) -> zz(X1,X2)
    12: zz(X1,mark(X2)) -> zz(X1,X2)
    13: zz(active(X1),X2) -> zz(X1,X2)
    14: zz(X1,active(X2)) -> zz(X1,X2)
    15: and(mark(X1),X2) -> and(X1,X2)
    16: and(X1,mark(X2)) -> and(X1,X2)
    17: and(active(X1),X2) -> and(X1,X2)
    18: and(X1,active(X2)) -> and(X1,X2)
    19: isNePal(mark(X)) -> isNePal(X)
    20: isNePal(active(X)) -> isNePal(X)
Number of Rules: 20
Direct QWPOS(Pol) ... orients all.
	I(tt) = 1
	I(mark) = x1	sigma(mark) = [1]
	I(active) = x1	sigma(active) = [1]
	I(nil) = 3
	I(and) = 3 * x1 + x2	sigma(and) = [1,2]
	I(zz) = 2 * x1 + x2 + 2	sigma(zz) = [1,2]
	I(isNePal) = 3 * x1 + 2	sigma(isNePal) = [1]
    PREC: mark = zz > and > tt > active = nil = isNePal
Number of Rules: 0