Input TRS:
    1: active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z)))
    2: active(__(X,nil())) -> mark(X)
    3: active(__(nil(),X)) -> mark(X)
    4: active(and(tt(),X)) -> mark(X)
    5: active(isList(V)) -> mark(isNeList(V))
    6: active(isList(nil())) -> mark(tt())
    7: active(isList(__(V1,V2))) -> mark(and(isList(V1),isList(V2)))
    8: active(isNeList(V)) -> mark(isQid(V))
    9: active(isNeList(__(V1,V2))) -> mark(and(isList(V1),isNeList(V2)))
    10: active(isNeList(__(V1,V2))) -> mark(and(isNeList(V1),isList(V2)))
    11: active(isNePal(V)) -> mark(isQid(V))
    12: active(isNePal(__(I,__(P,I)))) -> mark(and(isQid(I),isPal(P)))
    13: active(isPal(V)) -> mark(isNePal(V))
    14: active(isPal(nil())) -> mark(tt())
    15: active(isQid(a())) -> mark(tt())
    16: active(isQid(e())) -> mark(tt())
    17: active(isQid(i())) -> mark(tt())
    18: active(isQid(o())) -> mark(tt())
    19: active(isQid(u())) -> mark(tt())
    20: mark(__(X1,X2)) -> active(__(mark(X1),mark(X2)))
    21: mark(nil()) -> active(nil())
    22: mark(and(X1,X2)) -> active(and(mark(X1),X2))
    23: mark(tt()) -> active(tt())
    24: mark(isList(X)) -> active(isList(X))
    25: mark(isNeList(X)) -> active(isNeList(X))
    26: mark(isQid(X)) -> active(isQid(X))
    27: mark(isNePal(X)) -> active(isNePal(X))
    28: mark(isPal(X)) -> active(isPal(X))
    29: mark(a()) -> active(a())
    30: mark(e()) -> active(e())
    31: mark(i()) -> active(i())
    32: mark(o()) -> active(o())
    33: mark(u()) -> active(u())
    34: __(mark(X1),X2) -> __(X1,X2)
    35: __(X1,mark(X2)) -> __(X1,X2)
    36: __(active(X1),X2) -> __(X1,X2)
    37: __(X1,active(X2)) -> __(X1,X2)
    38: and(mark(X1),X2) -> and(X1,X2)
    39: and(X1,mark(X2)) -> and(X1,X2)
    40: and(active(X1),X2) -> and(X1,X2)
    41: and(X1,active(X2)) -> and(X1,X2)
    42: isList(mark(X)) -> isList(X)
    43: isList(active(X)) -> isList(X)
    44: isNeList(mark(X)) -> isNeList(X)
    45: isNeList(active(X)) -> isNeList(X)
    46: isQid(mark(X)) -> isQid(X)
    47: isQid(active(X)) -> isQid(X)
    48: isNePal(mark(X)) -> isNePal(X)
    49: isNePal(active(X)) -> isNePal(X)
    50: isPal(mark(X)) -> isPal(X)
    51: isPal(active(X)) -> isPal(X)
Number of strict rules: 51
Direct Order(PosReal,>,Poly) ... removes: 18 4 15 8 3 16 19 17 5 10 7 14 12 11 9 13 6 2
     a()	weight: 0
isNeList(x1)	weight: (/ 1 16) + x1
 isPal(x1)	weight: (/ 390787 32) + x1
     u()	weight: 0
   and(x1,x2)	weight: (/ 1 32) + x1 + x2
isNePal(x1)	weight: (/ 195393 16) + x1
 isQid(x1)	weight: (/ 1 32) + x1
     o()	weight: 0
isList(x1)	weight: (/ 3 32) + x1
   nil()	weight: 0
  mark(x1)	weight: x1
     i()	weight: 0
     e()	weight: 0
active(x1)	weight: x1
    tt()	weight: 0
    __(x1,x2)	weight: (/ 5 32) + x1 + x2
Number of strict rules: 33
Direct Order(PosReal,>,Poly) ... removes: 1
     a()	weight: 0
isNeList(x1)	weight: (/ 170541 4) + x1
 isPal(x1)	weight: (/ 63769 4) + x1
     u()	weight: 0
   and(x1,x2)	weight: (/ 1 4) + x1 + x2
isNePal(x1)	weight: (/ 10989 4) + x1
 isQid(x1)	weight: (/ 10989 4) + x1
     o()	weight: 0
isList(x1)	weight: (/ 170541 4) + x1
   nil()	weight: 0
  mark(x1)	weight: x1
     i()	weight: 0
     e()	weight: 0
active(x1)	weight: x1
    tt()	weight: 0
    __(x1,x2)	weight: (/ 85271 2) + 2 * x1 + x2
Number of strict rules: 32
Direct Order(PosReal,>,Poly) ... removes: 26 27 22 28 20 25 24
     a()	weight: 0
isNeList(x1)	weight: 62500 + x1
 isPal(x1)	weight: (/ 1453516 3) + x1
     u()	weight: 0
   and(x1,x2)	weight: 19629 + x1 + x2
isNePal(x1)	weight: (/ 726758 3) + x1
 isQid(x1)	weight: 31250 + x1
     o()	weight: 0
isList(x1)	weight: 125000 + x1
   nil()	weight: 0
  mark(x1)	weight: 2 * x1
     i()	weight: 0
     e()	weight: 0
active(x1)	weight: x1
    tt()	weight: 0
    __(x1,x2)	weight: 414258 + x1 + x2
Number of strict rules: 25
Direct Order(PosReal,>,Poly) ... removes: 50 21 36 32 34 44 33 39 49 30 31 45 23 51 40 38 48 47 37 41 42 46 35 29 43
     a()	weight: 0
isNeList(x1)	weight: (/ 3 64) + x1
 isPal(x1)	weight: (/ 7 64) + x1
     u()	weight: 0
   and(x1,x2)	weight: (/ 1 64) + x1 + x2
isNePal(x1)	weight: (/ 3 64) + x1
 isQid(x1)	weight: (/ 1 64) + x1
     o()	weight: 0
isList(x1)	weight: (/ 1 128) + x1
   nil()	weight: 0
  mark(x1)	weight: (/ 5 128) + 2 * x1
     i()	weight: 0
     e()	weight: 0
active(x1)	weight: (/ 3 128) + x1
    tt()	weight: 0
    __(x1,x2)	weight: (/ 1 8) + 2 * x1 + x2
Number of strict rules: 0
YES