Input TRS:
    1: __(__(X,Y),Z) -> __(X,__(Y,Z))
    2: __(X,nil()) -> X
    3: __(nil(),X) -> X
    4: and(tt(),X) -> activate(X)
    5: isNePal(__(I,__(P,I))) -> tt()
    6: activate(X) -> X
Number of strict rules: 6
Direct Order(PosReal,>,Poly) ... removes: 4 1 3 5 6 2
activate(x1)	weight: (/ 1 8) + x1
   and(x1,x2)	weight: (/ 1 4) + x1 + x2
isNePal(x1)	weight: x1
   nil()	weight: 0
    tt()	weight: 0
    __(x1,x2)	weight: (/ 1 8) + 2 * x1 + x2
Number of strict rules: 0
YES