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: azzand(tt(),X) -> mark(X)
    5: azzisList(V) -> azzisNeList(V)
    6: azzisList(nil()) -> tt()
    7: azzisList(zz(V1,V2)) -> azzand(azzisList(V1),isList(V2))
    8: azzisNeList(V) -> azzisQid(V)
    9: azzisNeList(zz(V1,V2)) -> azzand(azzisList(V1),isNeList(V2))
    10: azzisNeList(zz(V1,V2)) -> azzand(azzisNeList(V1),isList(V2))
    11: azzisNePal(V) -> azzisQid(V)
    12: azzisNePal(zz(I,zz(P,I))) -> azzand(azzisQid(I),isPal(P))
    13: azzisPal(V) -> azzisNePal(V)
    14: azzisPal(nil()) -> tt()
    15: azzisQid(a()) -> tt()
    16: azzisQid(e()) -> tt()
    17: azzisQid(i()) -> tt()
    18: azzisQid(o()) -> tt()
    19: azzisQid(u()) -> tt()
    20: mark(zz(X1,X2)) -> azzzz(mark(X1),mark(X2))
    21: mark(and(X1,X2)) -> azzand(mark(X1),X2)
    22: mark(isList(X)) -> azzisList(X)
    23: mark(isNeList(X)) -> azzisNeList(X)
    24: mark(isQid(X)) -> azzisQid(X)
    25: mark(isNePal(X)) -> azzisNePal(X)
    26: mark(isPal(X)) -> azzisPal(X)
    27: mark(nil()) -> nil()
    28: mark(tt()) -> tt()
    29: mark(a()) -> a()
    30: mark(e()) -> e()
    31: mark(i()) -> i()
    32: mark(o()) -> o()
    33: mark(u()) -> u()
    34: azzzz(X1,X2) -> zz(X1,X2)
    35: azzand(X1,X2) -> and(X1,X2)
    36: azzisList(X) -> isList(X)
    37: azzisNeList(X) -> isNeList(X)
    38: azzisQid(X) -> isQid(X)
    39: azzisNePal(X) -> isNePal(X)
    40: azzisPal(X) -> isPal(X)
Number of Rules: 40
Direct QWPOS(Sum) ... orients all.
	I(tt) = 1
	I(mark) = x1	sigma(mark) = [1]
	I(azzisNeList) = x1 + 3	sigma(azzisNeList) = [1]
	I(azzisList) = x1 + 4	sigma(azzisList) = [1]
	I(nil) = 2
	I(and) = x1 + x2 + 1	sigma(and) = [2,1]
	I(a) = 2
	I(e) = 2
	I(i) = 2
	I(o) = 0
	I(isList) = x1 + 4	sigma(isList) = [1]
	I(u) = 2
	I(zz) = x1 + x2 + 10	sigma(zz) = [2,1]
	I(azzand) = x1 + x2 + 1	sigma(azzand) = [2,1]
	I(isQid) = x1 + 2	sigma(isQid) = [1]
	I(isPal) = x1 + 6	sigma(isPal) = [1]
	I(isNeList) = x1 + 3	sigma(isNeList) = [1]
	I(azzzz) = x1 + x2 + 10	sigma(azzzz) = [1,2]
	I(azzisQid) = x1 + 2	sigma(azzisQid) = [1]
	I(azzisPal) = x1 + 6	sigma(azzisPal) = [1]
	I(azzisNePal) = x1 + 5	sigma(azzisNePal) = [1]
	I(isNePal) = x1 + 5	sigma(isNePal) = [1]
    PREC: a = i = u > tt = mark = azzand = azzisNePal > nil = and = e = o = azzzz = azzisPal = isNePal > zz > azzisList = isPal > azzisNeList > isList = isNeList = azzisQid > isQid
Number of Rules: 0