Input TRS:
    1: zz(zz(X,Y),Z) -> zz(X,zz(Y,Z))
    2: zz(X,nil()) -> X
    3: zz(nil(),X) -> X
    4: and(tt(),X) -> activate(X)
    5: isList(V) -> isNeList(activate(V))
    6: isList(nzznil()) -> tt()
    7: isList(nzzzz(V1,V2)) -> and(isList(activate(V1)),nzzisList(activate(V2)))
    8: isNeList(V) -> isQid(activate(V))
    9: isNeList(nzzzz(V1,V2)) -> and(isList(activate(V1)),nzzisNeList(activate(V2)))
    10: isNeList(nzzzz(V1,V2)) -> and(isNeList(activate(V1)),nzzisList(activate(V2)))
    11: isNePal(V) -> isQid(activate(V))
    12: isNePal(nzzzz(I,zz(P,I))) -> and(isQid(activate(I)),nzzisPal(activate(P)))
    13: isPal(V) -> isNePal(activate(V))
    14: isPal(nzznil()) -> tt()
    15: isQid(nzza()) -> tt()
    16: isQid(nzze()) -> tt()
    17: isQid(nzzi()) -> tt()
    18: isQid(nzzo()) -> tt()
    19: isQid(nzzu()) -> tt()
    20: nil() -> nzznil()
    21: zz(X1,X2) -> nzzzz(X1,X2)
    22: isList(X) -> nzzisList(X)
    23: isNeList(X) -> nzzisNeList(X)
    24: isPal(X) -> nzzisPal(X)
    25: a() -> nzza()
    26: e() -> nzze()
    27: i() -> nzzi()
    28: o() -> nzzo()
    29: u() -> nzzu()
    30: activate(nzznil()) -> nil()
    31: activate(nzzzz(X1,X2)) -> zz(X1,X2)
    32: activate(nzzisList(X)) -> isList(X)
    33: activate(nzzisNeList(X)) -> isNeList(X)
    34: activate(nzzisPal(X)) -> isPal(X)
    35: activate(nzza()) -> a()
    36: activate(nzze()) -> e()
    37: activate(nzzi()) -> i()
    38: activate(nzzo()) -> o()
    39: activate(nzzu()) -> u()
    40: activate(X) -> X
Number of Rules: 40
Direct QWPOS(mPol) ... orients all.
	I(nzzisPal) = x1 + 2	sigma(nzzisPal) = [1]
	I(tt) = 0
	I(nzzisNeList) = 3 * x1 + 1	sigma(nzzisNeList) = [1]
	I(nil) = 1
	I(and) = x1 + x2 + 1	sigma(and) = [1,2]
	I(a) = 1
	I(e) = 3
	I(i) = 0
	I(o) = 3
	I(isList) = 3 * x1 + 3	sigma(isList) = [1]
	I(u) = 2
	I(zz) = 3 * x1 + x2 + 2	sigma(zz) = [2,1]
	I(isQid) = x1	sigma(isQid) = [1]
	I(activate) = x1	sigma(activate) = [1]
	I(isPal) = x1 + 2	sigma(isPal) = [1]
	I(nzzzz) = 3 * x1 + x2 + 2	sigma(nzzzz) = [1,2]
	I(nzza) = 1
	I(nzze) = 3
	I(nzzi) = 0
	I(isNeList) = 3 * x1 + 1	sigma(isNeList) = [1]
	I(nzzo) = 3
	I(nzzu) = 2
	I(nzzisList) = 3 * x1 + 3	sigma(nzzisList) = [1]
	I(isNePal) = x1 + 1	sigma(isNePal) = [1]
	I(nzznil) = 1
    PREC: nil = a = e = i = zz = activate = isNePal > nzznil > isQid > u > isPal = nzzu > isList > nzzisPal = o = nzzzz = nzza = nzze = nzzi = isNeList > tt = nzzisNeList = and = nzzo = nzzisList
Number of Rules: 0