Input TRS: 1: a____(__(X,Y),Z) -> a____(mark(X),a____(mark(Y),mark(Z))) 2: a____(X,nil()) -> mark(X) 3: a____(nil(),X) -> mark(X) 4: a__and(tt(),X) -> mark(X) 5: a__isNePal(__(I,__(P,I))) -> tt() 6: mark(__(X1,X2)) -> a____(mark(X1),mark(X2)) 7: mark(and(X1,X2)) -> a__and(mark(X1),X2) 8: mark(isNePal(X)) -> a__isNePal(mark(X)) 9: mark(nil()) -> nil() 10: mark(tt()) -> tt() 11: a____(X1,X2) -> __(X1,X2) 12: a__and(X1,X2) -> and(X1,X2) 13: a__isNePal(X) -> isNePal(X) Number of strict rules: 13 Direct Order(PosReal,>,Poly) ... removes: 4 3 5 2 and(x1,x2) weight: (/ 2249 8) + 2 * x1 + x2 isNePal(x1) weight: (/ 1 8) + x1 a____(x1,x2) weight: (/ 1 8) + x1 + x2 nil() weight: 0 mark(x1) weight: x1 a__isNePal(x1) weight: (/ 1 8) + x1 tt() weight: 0 a__and(x1,x2) weight: (/ 2249 8) + 2 * x1 + x2 __(x1,x2) weight: (/ 1 8) + x1 + x2 Number of strict rules: 9 Direct Order(PosReal,>,Poly) ... removes: 1 and(x1,x2) weight: (/ 1125 4) + x1 + x2 isNePal(x1) weight: (/ 1 4) + x1 a____(x1,x2) weight: (/ 11989 4) + 2 * x1 + x2 nil() weight: 0 mark(x1) weight: x1 a__isNePal(x1) weight: (/ 1 4) + x1 tt() weight: 0 a__and(x1,x2) weight: (/ 1125 4) + x1 + x2 __(x1,x2) weight: (/ 11989 4) + 2 * x1 + x2 Number of strict rules: 8 Direct Order(PosReal,>,Poly) ... removes: 8 7 12 11 13 6 and(x1,x2) weight: 281 + x1 + x2 isNePal(x1) weight: (/ 1 4) + x1 a____(x1,x2) weight: (/ 47953 8) + 2 * x1 + x2 nil() weight: 0 mark(x1) weight: 2 * x1 a__isNePal(x1) weight: (/ 3 8) + x1 tt() weight: 0 a__and(x1,x2) weight: (/ 2249 8) + x1 + x2 __(x1,x2) weight: (/ 23977 8) + 2 * x1 + x2 Number of strict rules: 2 Direct Order(PosReal,>,Poly) ... removes: 10 9 and(x1,x2) weight: (/ 2249 8) + x1 + x2 isNePal(x1) weight: (/ 1 4) + x1 a____(x1,x2) weight: (/ 5993 2) + 2 * x1 + 2 * x2 nil() weight: 0 mark(x1) weight: (/ 1 8) + 2 * x1 a__isNePal(x1) weight: (/ 3 8) + x1 tt() weight: 0 a__and(x1,x2) weight: (/ 1125 4) + 2 * x1 + x2 __(x1,x2) weight: (/ 23977 8) + 2 * x1 + x2 Number of strict rules: 0 YES