MAYBE Problem: active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z))) active(__(X,nil())) -> mark(X) active(__(nil(),X)) -> mark(X) active(and(tt(),X)) -> mark(X) active(isList(V)) -> mark(isNeList(V)) active(isList(nil())) -> mark(tt()) active(isList(__(V1,V2))) -> mark(and(isList(V1),isList(V2))) active(isNeList(V)) -> mark(isQid(V)) active(isNeList(__(V1,V2))) -> mark(and(isList(V1),isNeList(V2))) active(isNeList(__(V1,V2))) -> mark(and(isNeList(V1),isList(V2))) active(isNePal(V)) -> mark(isQid(V)) active(isNePal(__(I,__(P,I)))) -> mark(and(isQid(I),isPal(P))) active(isPal(V)) -> mark(isNePal(V)) active(isPal(nil())) -> mark(tt()) active(isQid(a())) -> mark(tt()) active(isQid(e())) -> mark(tt()) active(isQid(i())) -> mark(tt()) active(isQid(o())) -> mark(tt()) active(isQid(u())) -> mark(tt()) mark(__(X1,X2)) -> active(__(mark(X1),mark(X2))) mark(nil()) -> active(nil()) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(tt()) -> active(tt()) mark(isList(X)) -> active(isList(X)) mark(isNeList(X)) -> active(isNeList(X)) mark(isQid(X)) -> active(isQid(X)) mark(isNePal(X)) -> active(isNePal(X)) mark(isPal(X)) -> active(isPal(X)) mark(a()) -> active(a()) mark(e()) -> active(e()) mark(i()) -> active(i()) mark(o()) -> active(o()) mark(u()) -> active(u()) __(mark(X1),X2) -> __(X1,X2) __(X1,mark(X2)) -> __(X1,X2) __(active(X1),X2) -> __(X1,X2) __(X1,active(X2)) -> __(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) and(active(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) isList(mark(X)) -> isList(X) isList(active(X)) -> isList(X) isNeList(mark(X)) -> isNeList(X) isNeList(active(X)) -> isNeList(X) isQid(mark(X)) -> isQid(X) isQid(active(X)) -> isQid(X) isNePal(mark(X)) -> isNePal(X) isNePal(active(X)) -> isNePal(X) isPal(mark(X)) -> isPal(X) isPal(active(X)) -> isPal(X) Proof: DP Processor: DPs: active#(__(__(X,Y),Z)) -> __#(Y,Z) active#(__(__(X,Y),Z)) -> __#(X,__(Y,Z)) active#(__(__(X,Y),Z)) -> mark#(__(X,__(Y,Z))) active#(__(X,nil())) -> mark#(X) active#(__(nil(),X)) -> mark#(X) active#(and(tt(),X)) -> mark#(X) active#(isList(V)) -> isNeList#(V) active#(isList(V)) -> mark#(isNeList(V)) active#(isList(nil())) -> mark#(tt()) active#(isList(__(V1,V2))) -> isList#(V2) active#(isList(__(V1,V2))) -> isList#(V1) active#(isList(__(V1,V2))) -> and#(isList(V1),isList(V2)) active#(isList(__(V1,V2))) -> mark#(and(isList(V1),isList(V2))) active#(isNeList(V)) -> isQid#(V) active#(isNeList(V)) -> mark#(isQid(V)) active#(isNeList(__(V1,V2))) -> isNeList#(V2) active#(isNeList(__(V1,V2))) -> isList#(V1) active#(isNeList(__(V1,V2))) -> and#(isList(V1),isNeList(V2)) active#(isNeList(__(V1,V2))) -> mark#(and(isList(V1),isNeList(V2))) active#(isNeList(__(V1,V2))) -> isList#(V2) active#(isNeList(__(V1,V2))) -> isNeList#(V1) active#(isNeList(__(V1,V2))) -> and#(isNeList(V1),isList(V2)) active#(isNeList(__(V1,V2))) -> mark#(and(isNeList(V1),isList(V2))) active#(isNePal(V)) -> isQid#(V) active#(isNePal(V)) -> mark#(isQid(V)) active#(isNePal(__(I,__(P,I)))) -> isPal#(P) active#(isNePal(__(I,__(P,I)))) -> isQid#(I) active#(isNePal(__(I,__(P,I)))) -> and#(isQid(I),isPal(P)) active#(isNePal(__(I,__(P,I)))) -> mark#(and(isQid(I),isPal(P))) active#(isPal(V)) -> isNePal#(V) active#(isPal(V)) -> mark#(isNePal(V)) active#(isPal(nil())) -> mark#(tt()) active#(isQid(a())) -> mark#(tt()) active#(isQid(e())) -> mark#(tt()) active#(isQid(i())) -> mark#(tt()) active#(isQid(o())) -> mark#(tt()) active#(isQid(u())) -> mark#(tt()) mark#(__(X1,X2)) -> mark#(X2) mark#(__(X1,X2)) -> mark#(X1) mark#(__(X1,X2)) -> __#(mark(X1),mark(X2)) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) mark#(nil()) -> active#(nil()) mark#(and(X1,X2)) -> mark#(X1) mark#(and(X1,X2)) -> and#(mark(X1),X2) mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) mark#(tt()) -> active#(tt()) mark#(isList(X)) -> active#(isList(X)) mark#(isNeList(X)) -> active#(isNeList(X)) mark#(isQid(X)) -> active#(isQid(X)) mark#(isNePal(X)) -> active#(isNePal(X)) mark#(isPal(X)) -> active#(isPal(X)) mark#(a()) -> active#(a()) mark#(e()) -> active#(e()) mark#(i()) -> active#(i()) mark#(o()) -> active#(o()) mark#(u()) -> active#(u()) __#(mark(X1),X2) -> __#(X1,X2) __#(X1,mark(X2)) -> __#(X1,X2) __#(active(X1),X2) -> __#(X1,X2) __#(X1,active(X2)) -> __#(X1,X2) and#(mark(X1),X2) -> and#(X1,X2) and#(X1,mark(X2)) -> and#(X1,X2) and#(active(X1),X2) -> and#(X1,X2) and#(X1,active(X2)) -> and#(X1,X2) isList#(mark(X)) -> isList#(X) isList#(active(X)) -> isList#(X) isNeList#(mark(X)) -> isNeList#(X) isNeList#(active(X)) -> isNeList#(X) isQid#(mark(X)) -> isQid#(X) isQid#(active(X)) -> isQid#(X) isNePal#(mark(X)) -> isNePal#(X) isNePal#(active(X)) -> isNePal#(X) isPal#(mark(X)) -> isPal#(X) isPal#(active(X)) -> isPal#(X) TRS: active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z))) active(__(X,nil())) -> mark(X) active(__(nil(),X)) -> mark(X) active(and(tt(),X)) -> mark(X) active(isList(V)) -> mark(isNeList(V)) active(isList(nil())) -> mark(tt()) active(isList(__(V1,V2))) -> mark(and(isList(V1),isList(V2))) active(isNeList(V)) -> mark(isQid(V)) active(isNeList(__(V1,V2))) -> mark(and(isList(V1),isNeList(V2))) active(isNeList(__(V1,V2))) -> mark(and(isNeList(V1),isList(V2))) active(isNePal(V)) -> mark(isQid(V)) active(isNePal(__(I,__(P,I)))) -> mark(and(isQid(I),isPal(P))) active(isPal(V)) -> mark(isNePal(V)) active(isPal(nil())) -> mark(tt()) active(isQid(a())) -> mark(tt()) active(isQid(e())) -> mark(tt()) active(isQid(i())) -> mark(tt()) active(isQid(o())) -> mark(tt()) active(isQid(u())) -> mark(tt()) mark(__(X1,X2)) -> active(__(mark(X1),mark(X2))) mark(nil()) -> active(nil()) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(tt()) -> active(tt()) mark(isList(X)) -> active(isList(X)) mark(isNeList(X)) -> active(isNeList(X)) mark(isQid(X)) -> active(isQid(X)) mark(isNePal(X)) -> active(isNePal(X)) mark(isPal(X)) -> active(isPal(X)) mark(a()) -> active(a()) mark(e()) -> active(e()) mark(i()) -> active(i()) mark(o()) -> active(o()) mark(u()) -> active(u()) __(mark(X1),X2) -> __(X1,X2) __(X1,mark(X2)) -> __(X1,X2) __(active(X1),X2) -> __(X1,X2) __(X1,active(X2)) -> __(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) and(active(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) isList(mark(X)) -> isList(X) isList(active(X)) -> isList(X) isNeList(mark(X)) -> isNeList(X) isNeList(active(X)) -> isNeList(X) isQid(mark(X)) -> isQid(X) isQid(active(X)) -> isQid(X) isNePal(mark(X)) -> isNePal(X) isNePal(active(X)) -> isNePal(X) isPal(mark(X)) -> isPal(X) isPal(active(X)) -> isPal(X) EDG Processor: DPs: active#(__(__(X,Y),Z)) -> __#(Y,Z) active#(__(__(X,Y),Z)) -> __#(X,__(Y,Z)) active#(__(__(X,Y),Z)) -> mark#(__(X,__(Y,Z))) active#(__(X,nil())) -> mark#(X) active#(__(nil(),X)) -> mark#(X) active#(and(tt(),X)) -> mark#(X) active#(isList(V)) -> isNeList#(V) active#(isList(V)) -> mark#(isNeList(V)) active#(isList(nil())) -> mark#(tt()) active#(isList(__(V1,V2))) -> isList#(V2) active#(isList(__(V1,V2))) -> isList#(V1) active#(isList(__(V1,V2))) -> and#(isList(V1),isList(V2)) active#(isList(__(V1,V2))) -> mark#(and(isList(V1),isList(V2))) active#(isNeList(V)) -> isQid#(V) active#(isNeList(V)) -> mark#(isQid(V)) active#(isNeList(__(V1,V2))) -> isNeList#(V2) active#(isNeList(__(V1,V2))) -> isList#(V1) active#(isNeList(__(V1,V2))) -> and#(isList(V1),isNeList(V2)) active#(isNeList(__(V1,V2))) -> mark#(and(isList(V1),isNeList(V2))) active#(isNeList(__(V1,V2))) -> isList#(V2) active#(isNeList(__(V1,V2))) -> isNeList#(V1) active#(isNeList(__(V1,V2))) -> and#(isNeList(V1),isList(V2)) active#(isNeList(__(V1,V2))) -> mark#(and(isNeList(V1),isList(V2))) active#(isNePal(V)) -> isQid#(V) active#(isNePal(V)) -> mark#(isQid(V)) active#(isNePal(__(I,__(P,I)))) -> isPal#(P) active#(isNePal(__(I,__(P,I)))) -> isQid#(I) active#(isNePal(__(I,__(P,I)))) -> and#(isQid(I),isPal(P)) active#(isNePal(__(I,__(P,I)))) -> mark#(and(isQid(I),isPal(P))) active#(isPal(V)) -> isNePal#(V) active#(isPal(V)) -> mark#(isNePal(V)) active#(isPal(nil())) -> mark#(tt()) active#(isQid(a())) -> mark#(tt()) active#(isQid(e())) -> mark#(tt()) active#(isQid(i())) -> mark#(tt()) active#(isQid(o())) -> mark#(tt()) active#(isQid(u())) -> mark#(tt()) mark#(__(X1,X2)) -> mark#(X2) mark#(__(X1,X2)) -> mark#(X1) mark#(__(X1,X2)) -> __#(mark(X1),mark(X2)) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) mark#(nil()) -> active#(nil()) mark#(and(X1,X2)) -> mark#(X1) mark#(and(X1,X2)) -> and#(mark(X1),X2) mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) mark#(tt()) -> active#(tt()) mark#(isList(X)) -> active#(isList(X)) mark#(isNeList(X)) -> active#(isNeList(X)) mark#(isQid(X)) -> active#(isQid(X)) mark#(isNePal(X)) -> active#(isNePal(X)) mark#(isPal(X)) -> active#(isPal(X)) mark#(a()) -> active#(a()) mark#(e()) -> active#(e()) mark#(i()) -> active#(i()) mark#(o()) -> active#(o()) mark#(u()) -> active#(u()) __#(mark(X1),X2) -> __#(X1,X2) __#(X1,mark(X2)) -> __#(X1,X2) __#(active(X1),X2) -> __#(X1,X2) __#(X1,active(X2)) -> __#(X1,X2) and#(mark(X1),X2) -> and#(X1,X2) and#(X1,mark(X2)) -> and#(X1,X2) and#(active(X1),X2) -> and#(X1,X2) and#(X1,active(X2)) -> and#(X1,X2) isList#(mark(X)) -> isList#(X) isList#(active(X)) -> isList#(X) isNeList#(mark(X)) -> isNeList#(X) isNeList#(active(X)) -> isNeList#(X) isQid#(mark(X)) -> isQid#(X) isQid#(active(X)) -> isQid#(X) isNePal#(mark(X)) -> isNePal#(X) isNePal#(active(X)) -> isNePal#(X) isPal#(mark(X)) -> isPal#(X) isPal#(active(X)) -> isPal#(X) TRS: active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z))) active(__(X,nil())) -> mark(X) active(__(nil(),X)) -> mark(X) active(and(tt(),X)) -> mark(X) active(isList(V)) -> mark(isNeList(V)) active(isList(nil())) -> mark(tt()) active(isList(__(V1,V2))) -> mark(and(isList(V1),isList(V2))) active(isNeList(V)) -> mark(isQid(V)) active(isNeList(__(V1,V2))) -> mark(and(isList(V1),isNeList(V2))) active(isNeList(__(V1,V2))) -> mark(and(isNeList(V1),isList(V2))) active(isNePal(V)) -> mark(isQid(V)) active(isNePal(__(I,__(P,I)))) -> mark(and(isQid(I),isPal(P))) active(isPal(V)) -> mark(isNePal(V)) active(isPal(nil())) -> mark(tt()) active(isQid(a())) -> mark(tt()) active(isQid(e())) -> mark(tt()) active(isQid(i())) -> mark(tt()) active(isQid(o())) -> mark(tt()) active(isQid(u())) -> mark(tt()) mark(__(X1,X2)) -> active(__(mark(X1),mark(X2))) mark(nil()) -> active(nil()) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(tt()) -> active(tt()) mark(isList(X)) -> active(isList(X)) mark(isNeList(X)) -> active(isNeList(X)) mark(isQid(X)) -> active(isQid(X)) mark(isNePal(X)) -> active(isNePal(X)) mark(isPal(X)) -> active(isPal(X)) mark(a()) -> active(a()) mark(e()) -> active(e()) mark(i()) -> active(i()) mark(o()) -> active(o()) mark(u()) -> active(u()) __(mark(X1),X2) -> __(X1,X2) __(X1,mark(X2)) -> __(X1,X2) __(active(X1),X2) -> __(X1,X2) __(X1,active(X2)) -> __(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) and(active(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) isList(mark(X)) -> isList(X) isList(active(X)) -> isList(X) isNeList(mark(X)) -> isNeList(X) isNeList(active(X)) -> isNeList(X) isQid(mark(X)) -> isQid(X) isQid(active(X)) -> isQid(X) isNePal(mark(X)) -> isNePal(X) isNePal(active(X)) -> isNePal(X) isPal(mark(X)) -> isPal(X) isPal(active(X)) -> isPal(X) graph: isNePal#(mark(X)) -> isNePal#(X) -> isNePal#(mark(X)) -> isNePal#(X) isNePal#(mark(X)) -> isNePal#(X) -> isNePal#(active(X)) -> isNePal#(X) isNePal#(active(X)) -> isNePal#(X) -> isNePal#(mark(X)) -> isNePal#(X) isNePal#(active(X)) -> isNePal#(X) -> isNePal#(active(X)) -> isNePal#(X) isPal#(mark(X)) -> isPal#(X) -> isPal#(mark(X)) -> isPal#(X) isPal#(mark(X)) -> isPal#(X) -> isPal#(active(X)) -> isPal#(X) isPal#(active(X)) -> isPal#(X) -> isPal#(mark(X)) -> isPal#(X) isPal#(active(X)) -> isPal#(X) -> isPal#(active(X)) -> isPal#(X) isQid#(mark(X)) -> isQid#(X) -> isQid#(mark(X)) -> isQid#(X) isQid#(mark(X)) -> isQid#(X) -> isQid#(active(X)) -> isQid#(X) isQid#(active(X)) -> isQid#(X) -> isQid#(mark(X)) -> isQid#(X) isQid#(active(X)) -> isQid#(X) -> isQid#(active(X)) -> isQid#(X) and#(mark(X1),X2) -> and#(X1,X2) -> and#(mark(X1),X2) -> and#(X1,X2) and#(mark(X1),X2) -> and#(X1,X2) -> and#(X1,mark(X2)) -> and#(X1,X2) and#(mark(X1),X2) -> and#(X1,X2) -> and#(active(X1),X2) -> and#(X1,X2) and#(mark(X1),X2) -> and#(X1,X2) -> and#(X1,active(X2)) -> and#(X1,X2) and#(active(X1),X2) -> and#(X1,X2) -> and#(mark(X1),X2) -> and#(X1,X2) and#(active(X1),X2) -> and#(X1,X2) -> and#(X1,mark(X2)) -> and#(X1,X2) and#(active(X1),X2) -> and#(X1,X2) -> and#(active(X1),X2) -> and#(X1,X2) and#(active(X1),X2) -> and#(X1,X2) -> and#(X1,active(X2)) -> and#(X1,X2) and#(X1,mark(X2)) -> and#(X1,X2) -> and#(mark(X1),X2) -> and#(X1,X2) and#(X1,mark(X2)) -> and#(X1,X2) -> and#(X1,mark(X2)) -> and#(X1,X2) and#(X1,mark(X2)) -> and#(X1,X2) -> and#(active(X1),X2) -> and#(X1,X2) and#(X1,mark(X2)) -> and#(X1,X2) -> and#(X1,active(X2)) -> and#(X1,X2) and#(X1,active(X2)) -> and#(X1,X2) -> and#(mark(X1),X2) -> and#(X1,X2) and#(X1,active(X2)) -> and#(X1,X2) -> and#(X1,mark(X2)) -> and#(X1,X2) and#(X1,active(X2)) -> and#(X1,X2) -> and#(active(X1),X2) -> and#(X1,X2) and#(X1,active(X2)) -> and#(X1,X2) -> and#(X1,active(X2)) -> and#(X1,X2) isList#(mark(X)) -> isList#(X) -> isList#(mark(X)) -> isList#(X) isList#(mark(X)) -> isList#(X) -> isList#(active(X)) -> isList#(X) isList#(active(X)) -> isList#(X) -> isList#(mark(X)) -> isList#(X) isList#(active(X)) -> isList#(X) -> isList#(active(X)) -> isList#(X) isNeList#(mark(X)) -> isNeList#(X) -> isNeList#(mark(X)) -> isNeList#(X) isNeList#(mark(X)) -> isNeList#(X) -> isNeList#(active(X)) -> isNeList#(X) isNeList#(active(X)) -> isNeList#(X) -> isNeList#(mark(X)) -> isNeList#(X) isNeList#(active(X)) -> isNeList#(X) -> isNeList#(active(X)) -> isNeList#(X) mark#(isPal(X)) -> active#(isPal(X)) -> active#(__(__(X,Y),Z)) -> __#(Y,Z) mark#(isPal(X)) -> active#(isPal(X)) -> active#(__(__(X,Y),Z)) -> __#(X,__(Y,Z)) mark#(isPal(X)) -> active#(isPal(X)) -> active#(__(__(X,Y),Z)) -> mark#(__(X,__(Y,Z))) mark#(isPal(X)) -> active#(isPal(X)) -> active#(__(X,nil())) -> mark#(X) mark#(isPal(X)) -> active#(isPal(X)) -> active#(__(nil(),X)) -> mark#(X) mark#(isPal(X)) -> active#(isPal(X)) -> active#(and(tt(),X)) -> mark#(X) mark#(isPal(X)) -> active#(isPal(X)) -> active#(isList(V)) -> isNeList#(V) mark#(isPal(X)) -> active#(isPal(X)) -> active#(isList(V)) -> mark#(isNeList(V)) mark#(isPal(X)) -> active#(isPal(X)) -> active#(isList(nil())) -> mark#(tt()) mark#(isPal(X)) -> active#(isPal(X)) -> active#(isList(__(V1,V2))) -> isList#(V2) mark#(isPal(X)) -> active#(isPal(X)) -> active#(isList(__(V1,V2))) -> isList#(V1) mark#(isPal(X)) -> active#(isPal(X)) -> active#(isList(__(V1,V2))) -> and#(isList(V1),isList(V2)) mark#(isPal(X)) -> active#(isPal(X)) -> active#(isList(__(V1,V2))) -> mark#(and(isList(V1),isList(V2))) mark#(isPal(X)) -> active#(isPal(X)) -> active#(isNeList(V)) -> isQid#(V) mark#(isPal(X)) -> active#(isPal(X)) -> active#(isNeList(V)) -> mark#(isQid(V)) mark#(isPal(X)) -> active#(isPal(X)) -> active#(isNeList(__(V1,V2))) -> isNeList#(V2) mark#(isPal(X)) -> active#(isPal(X)) -> active#(isNeList(__(V1,V2))) -> isList#(V1) mark#(isPal(X)) -> active#(isPal(X)) -> active#(isNeList(__(V1,V2))) -> and#(isList(V1),isNeList(V2)) mark#(isPal(X)) -> active#(isPal(X)) -> active#(isNeList(__(V1,V2))) -> mark#(and(isList(V1),isNeList(V2))) mark#(isPal(X)) -> active#(isPal(X)) -> active#(isNeList(__(V1,V2))) -> isList#(V2) mark#(isPal(X)) -> active#(isPal(X)) -> active#(isNeList(__(V1,V2))) -> isNeList#(V1) mark#(isPal(X)) -> active#(isPal(X)) -> active#(isNeList(__(V1,V2))) -> and#(isNeList(V1),isList(V2)) mark#(isPal(X)) -> active#(isPal(X)) -> active#(isNeList(__(V1,V2))) -> mark#(and(isNeList(V1),isList(V2))) mark#(isPal(X)) -> active#(isPal(X)) -> active#(isNePal(V)) -> isQid#(V) mark#(isPal(X)) -> active#(isPal(X)) -> active#(isNePal(V)) -> mark#(isQid(V)) mark#(isPal(X)) -> active#(isPal(X)) -> active#(isNePal(__(I,__(P,I)))) -> isPal#(P) mark#(isPal(X)) -> active#(isPal(X)) -> active#(isNePal(__(I,__(P,I)))) -> isQid#(I) mark#(isPal(X)) -> active#(isPal(X)) -> active#(isNePal(__(I,__(P,I)))) -> and#(isQid(I),isPal(P)) mark#(isPal(X)) -> active#(isPal(X)) -> active#(isNePal(__(I,__(P,I)))) -> mark#(and(isQid(I),isPal(P))) mark#(isPal(X)) -> active#(isPal(X)) -> active#(isPal(V)) -> isNePal#(V) mark#(isPal(X)) -> active#(isPal(X)) -> active#(isPal(V)) -> mark#(isNePal(V)) mark#(isPal(X)) -> active#(isPal(X)) -> active#(isPal(nil())) -> mark#(tt()) mark#(isPal(X)) -> active#(isPal(X)) -> active#(isQid(a())) -> mark#(tt()) mark#(isPal(X)) -> active#(isPal(X)) -> active#(isQid(e())) -> mark#(tt()) mark#(isPal(X)) -> active#(isPal(X)) -> active#(isQid(i())) -> mark#(tt()) mark#(isPal(X)) -> active#(isPal(X)) -> active#(isQid(o())) -> mark#(tt()) mark#(isPal(X)) -> active#(isPal(X)) -> active#(isQid(u())) -> mark#(tt()) mark#(isNePal(X)) -> active#(isNePal(X)) -> active#(__(__(X,Y),Z)) -> __#(Y,Z) mark#(isNePal(X)) -> active#(isNePal(X)) -> active#(__(__(X,Y),Z)) -> __#(X,__(Y,Z)) mark#(isNePal(X)) -> active#(isNePal(X)) -> active#(__(__(X,Y),Z)) -> mark#(__(X,__(Y,Z))) mark#(isNePal(X)) -> active#(isNePal(X)) -> active#(__(X,nil())) -> mark#(X) mark#(isNePal(X)) -> active#(isNePal(X)) -> active#(__(nil(),X)) -> mark#(X) mark#(isNePal(X)) -> active#(isNePal(X)) -> active#(and(tt(),X)) -> mark#(X) mark#(isNePal(X)) -> active#(isNePal(X)) -> active#(isList(V)) -> isNeList#(V) mark#(isNePal(X)) -> active#(isNePal(X)) -> active#(isList(V)) -> mark#(isNeList(V)) mark#(isNePal(X)) -> active#(isNePal(X)) -> active#(isList(nil())) -> mark#(tt()) mark#(isNePal(X)) -> active#(isNePal(X)) -> active#(isList(__(V1,V2))) -> isList#(V2) mark#(isNePal(X)) -> active#(isNePal(X)) -> active#(isList(__(V1,V2))) -> isList#(V1) mark#(isNePal(X)) -> active#(isNePal(X)) -> active#(isList(__(V1,V2))) -> and#(isList(V1),isList(V2)) mark#(isNePal(X)) -> active#(isNePal(X)) -> active#(isList(__(V1,V2))) -> mark#(and(isList(V1),isList(V2))) mark#(isNePal(X)) -> active#(isNePal(X)) -> active#(isNeList(V)) -> isQid#(V) mark#(isNePal(X)) -> active#(isNePal(X)) -> active#(isNeList(V)) -> mark#(isQid(V)) mark#(isNePal(X)) -> active#(isNePal(X)) -> active#(isNeList(__(V1,V2))) -> isNeList#(V2) mark#(isNePal(X)) -> active#(isNePal(X)) -> active#(isNeList(__(V1,V2))) -> isList#(V1) mark#(isNePal(X)) -> active#(isNePal(X)) -> active#(isNeList(__(V1,V2))) -> and#(isList(V1),isNeList(V2)) mark#(isNePal(X)) -> active#(isNePal(X)) -> active#(isNeList(__(V1,V2))) -> mark#(and(isList(V1),isNeList(V2))) mark#(isNePal(X)) -> active#(isNePal(X)) -> active#(isNeList(__(V1,V2))) -> isList#(V2) mark#(isNePal(X)) -> active#(isNePal(X)) -> active#(isNeList(__(V1,V2))) -> isNeList#(V1) mark#(isNePal(X)) -> active#(isNePal(X)) -> active#(isNeList(__(V1,V2))) -> and#(isNeList(V1),isList(V2)) mark#(isNePal(X)) -> active#(isNePal(X)) -> active#(isNeList(__(V1,V2))) -> mark#(and(isNeList(V1),isList(V2))) mark#(isNePal(X)) -> active#(isNePal(X)) -> active#(isNePal(V)) -> isQid#(V) mark#(isNePal(X)) -> active#(isNePal(X)) -> active#(isNePal(V)) -> mark#(isQid(V)) mark#(isNePal(X)) -> active#(isNePal(X)) -> active#(isNePal(__(I,__(P,I)))) -> isPal#(P) mark#(isNePal(X)) -> active#(isNePal(X)) -> active#(isNePal(__(I,__(P,I)))) -> isQid#(I) mark#(isNePal(X)) -> active#(isNePal(X)) -> active#(isNePal(__(I,__(P,I)))) -> and#(isQid(I),isPal(P)) mark#(isNePal(X)) -> active#(isNePal(X)) -> active#(isNePal(__(I,__(P,I)))) -> mark#(and(isQid(I),isPal(P))) mark#(isNePal(X)) -> active#(isNePal(X)) -> active#(isPal(V)) -> isNePal#(V) mark#(isNePal(X)) -> active#(isNePal(X)) -> active#(isPal(V)) -> mark#(isNePal(V)) mark#(isNePal(X)) -> active#(isNePal(X)) -> active#(isPal(nil())) -> mark#(tt()) mark#(isNePal(X)) -> active#(isNePal(X)) -> active#(isQid(a())) -> mark#(tt()) mark#(isNePal(X)) -> active#(isNePal(X)) -> active#(isQid(e())) -> mark#(tt()) mark#(isNePal(X)) -> active#(isNePal(X)) -> active#(isQid(i())) -> mark#(tt()) mark#(isNePal(X)) -> active#(isNePal(X)) -> active#(isQid(o())) -> mark#(tt()) mark#(isNePal(X)) -> active#(isNePal(X)) -> active#(isQid(u())) -> mark#(tt()) mark#(isQid(X)) -> active#(isQid(X)) -> active#(__(__(X,Y),Z)) -> __#(Y,Z) mark#(isQid(X)) -> active#(isQid(X)) -> active#(__(__(X,Y),Z)) -> __#(X,__(Y,Z)) mark#(isQid(X)) -> active#(isQid(X)) -> active#(__(__(X,Y),Z)) -> mark#(__(X,__(Y,Z))) mark#(isQid(X)) -> active#(isQid(X)) -> active#(__(X,nil())) -> mark#(X) mark#(isQid(X)) -> active#(isQid(X)) -> active#(__(nil(),X)) -> mark#(X) mark#(isQid(X)) -> active#(isQid(X)) -> active#(and(tt(),X)) -> mark#(X) mark#(isQid(X)) -> active#(isQid(X)) -> active#(isList(V)) -> isNeList#(V) mark#(isQid(X)) -> active#(isQid(X)) -> active#(isList(V)) -> mark#(isNeList(V)) mark#(isQid(X)) -> active#(isQid(X)) -> active#(isList(nil())) -> mark#(tt()) mark#(isQid(X)) -> active#(isQid(X)) -> active#(isList(__(V1,V2))) -> isList#(V2) mark#(isQid(X)) -> active#(isQid(X)) -> active#(isList(__(V1,V2))) -> isList#(V1) mark#(isQid(X)) -> active#(isQid(X)) -> active#(isList(__(V1,V2))) -> and#(isList(V1),isList(V2)) mark#(isQid(X)) -> active#(isQid(X)) -> active#(isList(__(V1,V2))) -> mark#(and(isList(V1),isList(V2))) mark#(isQid(X)) -> active#(isQid(X)) -> active#(isNeList(V)) -> isQid#(V) mark#(isQid(X)) -> active#(isQid(X)) -> active#(isNeList(V)) -> mark#(isQid(V)) mark#(isQid(X)) -> active#(isQid(X)) -> active#(isNeList(__(V1,V2))) -> isNeList#(V2) mark#(isQid(X)) -> active#(isQid(X)) -> active#(isNeList(__(V1,V2))) -> isList#(V1) mark#(isQid(X)) -> active#(isQid(X)) -> active#(isNeList(__(V1,V2))) -> and#(isList(V1),isNeList(V2)) mark#(isQid(X)) -> active#(isQid(X)) -> active#(isNeList(__(V1,V2))) -> mark#(and(isList(V1),isNeList(V2))) mark#(isQid(X)) -> active#(isQid(X)) -> active#(isNeList(__(V1,V2))) -> isList#(V2) mark#(isQid(X)) -> active#(isQid(X)) -> active#(isNeList(__(V1,V2))) -> isNeList#(V1) mark#(isQid(X)) -> active#(isQid(X)) -> active#(isNeList(__(V1,V2))) -> and#(isNeList(V1),isList(V2)) mark#(isQid(X)) -> active#(isQid(X)) -> active#(isNeList(__(V1,V2))) -> mark#(and(isNeList(V1),isList(V2))) mark#(isQid(X)) -> active#(isQid(X)) -> active#(isNePal(V)) -> isQid#(V) mark#(isQid(X)) -> active#(isQid(X)) -> active#(isNePal(V)) -> mark#(isQid(V)) mark#(isQid(X)) -> active#(isQid(X)) -> active#(isNePal(__(I,__(P,I)))) -> isPal#(P) mark#(isQid(X)) -> active#(isQid(X)) -> active#(isNePal(__(I,__(P,I)))) -> isQid#(I) mark#(isQid(X)) -> active#(isQid(X)) -> active#(isNePal(__(I,__(P,I)))) -> and#(isQid(I),isPal(P)) mark#(isQid(X)) -> active#(isQid(X)) -> active#(isNePal(__(I,__(P,I)))) -> mark#(and(isQid(I),isPal(P))) mark#(isQid(X)) -> active#(isQid(X)) -> active#(isPal(V)) -> isNePal#(V) mark#(isQid(X)) -> active#(isQid(X)) -> active#(isPal(V)) -> mark#(isNePal(V)) mark#(isQid(X)) -> active#(isQid(X)) -> active#(isPal(nil())) -> mark#(tt()) mark#(isQid(X)) -> active#(isQid(X)) -> active#(isQid(a())) -> mark#(tt()) mark#(isQid(X)) -> active#(isQid(X)) -> active#(isQid(e())) -> mark#(tt()) mark#(isQid(X)) -> active#(isQid(X)) -> active#(isQid(i())) -> mark#(tt()) mark#(isQid(X)) -> active#(isQid(X)) -> active#(isQid(o())) -> mark#(tt()) mark#(isQid(X)) -> active#(isQid(X)) -> active#(isQid(u())) -> mark#(tt()) mark#(isNeList(X)) -> active#(isNeList(X)) -> active#(__(__(X,Y),Z)) -> __#(Y,Z) mark#(isNeList(X)) -> active#(isNeList(X)) -> active#(__(__(X,Y),Z)) -> __#(X,__(Y,Z)) mark#(isNeList(X)) -> active#(isNeList(X)) -> active#(__(__(X,Y),Z)) -> mark#(__(X,__(Y,Z))) mark#(isNeList(X)) -> active#(isNeList(X)) -> active#(__(X,nil())) -> mark#(X) mark#(isNeList(X)) -> active#(isNeList(X)) -> active#(__(nil(),X)) -> mark#(X) mark#(isNeList(X)) -> active#(isNeList(X)) -> active#(and(tt(),X)) -> mark#(X) mark#(isNeList(X)) -> active#(isNeList(X)) -> active#(isList(V)) -> isNeList#(V) mark#(isNeList(X)) -> active#(isNeList(X)) -> active#(isList(V)) -> mark#(isNeList(V)) mark#(isNeList(X)) -> active#(isNeList(X)) -> active#(isList(nil())) -> mark#(tt()) mark#(isNeList(X)) -> active#(isNeList(X)) -> active#(isList(__(V1,V2))) -> isList#(V2) mark#(isNeList(X)) -> active#(isNeList(X)) -> active#(isList(__(V1,V2))) -> isList#(V1) mark#(isNeList(X)) -> active#(isNeList(X)) -> active#(isList(__(V1,V2))) -> and#(isList(V1),isList(V2)) mark#(isNeList(X)) -> active#(isNeList(X)) -> active#(isList(__(V1,V2))) -> mark#(and(isList(V1),isList(V2))) mark#(isNeList(X)) -> active#(isNeList(X)) -> active#(isNeList(V)) -> isQid#(V) mark#(isNeList(X)) -> active#(isNeList(X)) -> active#(isNeList(V)) -> mark#(isQid(V)) mark#(isNeList(X)) -> active#(isNeList(X)) -> active#(isNeList(__(V1,V2))) -> isNeList#(V2) mark#(isNeList(X)) -> active#(isNeList(X)) -> active#(isNeList(__(V1,V2))) -> isList#(V1) mark#(isNeList(X)) -> active#(isNeList(X)) -> active#(isNeList(__(V1,V2))) -> and#(isList(V1),isNeList(V2)) mark#(isNeList(X)) -> active#(isNeList(X)) -> active#(isNeList(__(V1,V2))) -> mark#(and(isList(V1),isNeList(V2))) mark#(isNeList(X)) -> active#(isNeList(X)) -> active#(isNeList(__(V1,V2))) -> isList#(V2) mark#(isNeList(X)) -> active#(isNeList(X)) -> active#(isNeList(__(V1,V2))) -> isNeList#(V1) mark#(isNeList(X)) -> active#(isNeList(X)) -> active#(isNeList(__(V1,V2))) -> and#(isNeList(V1),isList(V2)) mark#(isNeList(X)) -> active#(isNeList(X)) -> active#(isNeList(__(V1,V2))) -> mark#(and(isNeList(V1),isList(V2))) mark#(isNeList(X)) -> active#(isNeList(X)) -> active#(isNePal(V)) -> isQid#(V) mark#(isNeList(X)) -> active#(isNeList(X)) -> active#(isNePal(V)) -> mark#(isQid(V)) mark#(isNeList(X)) -> active#(isNeList(X)) -> active#(isNePal(__(I,__(P,I)))) -> isPal#(P) mark#(isNeList(X)) -> active#(isNeList(X)) -> active#(isNePal(__(I,__(P,I)))) -> isQid#(I) mark#(isNeList(X)) -> active#(isNeList(X)) -> active#(isNePal(__(I,__(P,I)))) -> and#(isQid(I),isPal(P)) mark#(isNeList(X)) -> active#(isNeList(X)) -> active#(isNePal(__(I,__(P,I)))) -> mark#(and(isQid(I),isPal(P))) mark#(isNeList(X)) -> active#(isNeList(X)) -> active#(isPal(V)) -> isNePal#(V) mark#(isNeList(X)) -> active#(isNeList(X)) -> active#(isPal(V)) -> mark#(isNePal(V)) mark#(isNeList(X)) -> active#(isNeList(X)) -> active#(isPal(nil())) -> mark#(tt()) mark#(isNeList(X)) -> active#(isNeList(X)) -> active#(isQid(a())) -> mark#(tt()) mark#(isNeList(X)) -> active#(isNeList(X)) -> active#(isQid(e())) -> mark#(tt()) mark#(isNeList(X)) -> active#(isNeList(X)) -> active#(isQid(i())) -> mark#(tt()) mark#(isNeList(X)) -> active#(isNeList(X)) -> active#(isQid(o())) -> mark#(tt()) mark#(isNeList(X)) -> active#(isNeList(X)) -> active#(isQid(u())) -> mark#(tt()) mark#(isList(X)) -> active#(isList(X)) -> active#(__(__(X,Y),Z)) -> __#(Y,Z) mark#(isList(X)) -> active#(isList(X)) -> active#(__(__(X,Y),Z)) -> __#(X,__(Y,Z)) mark#(isList(X)) -> active#(isList(X)) -> active#(__(__(X,Y),Z)) -> mark#(__(X,__(Y,Z))) mark#(isList(X)) -> active#(isList(X)) -> active#(__(X,nil())) -> mark#(X) mark#(isList(X)) -> active#(isList(X)) -> active#(__(nil(),X)) -> mark#(X) mark#(isList(X)) -> active#(isList(X)) -> active#(and(tt(),X)) -> mark#(X) mark#(isList(X)) -> active#(isList(X)) -> active#(isList(V)) -> isNeList#(V) mark#(isList(X)) -> active#(isList(X)) -> active#(isList(V)) -> mark#(isNeList(V)) mark#(isList(X)) -> active#(isList(X)) -> active#(isList(nil())) -> mark#(tt()) mark#(isList(X)) -> active#(isList(X)) -> active#(isList(__(V1,V2))) -> isList#(V2) mark#(isList(X)) -> active#(isList(X)) -> active#(isList(__(V1,V2))) -> isList#(V1) mark#(isList(X)) -> active#(isList(X)) -> active#(isList(__(V1,V2))) -> and#(isList(V1),isList(V2)) mark#(isList(X)) -> active#(isList(X)) -> active#(isList(__(V1,V2))) -> mark#(and(isList(V1),isList(V2))) mark#(isList(X)) -> active#(isList(X)) -> active#(isNeList(V)) -> isQid#(V) mark#(isList(X)) -> active#(isList(X)) -> active#(isNeList(V)) -> mark#(isQid(V)) mark#(isList(X)) -> active#(isList(X)) -> active#(isNeList(__(V1,V2))) -> isNeList#(V2) mark#(isList(X)) -> active#(isList(X)) -> active#(isNeList(__(V1,V2))) -> isList#(V1) mark#(isList(X)) -> active#(isList(X)) -> active#(isNeList(__(V1,V2))) -> and#(isList(V1),isNeList(V2)) mark#(isList(X)) -> active#(isList(X)) -> active#(isNeList(__(V1,V2))) -> mark#(and(isList(V1),isNeList(V2))) mark#(isList(X)) -> active#(isList(X)) -> active#(isNeList(__(V1,V2))) -> isList#(V2) mark#(isList(X)) -> active#(isList(X)) -> active#(isNeList(__(V1,V2))) -> isNeList#(V1) mark#(isList(X)) -> active#(isList(X)) -> active#(isNeList(__(V1,V2))) -> and#(isNeList(V1),isList(V2)) mark#(isList(X)) -> active#(isList(X)) -> active#(isNeList(__(V1,V2))) -> mark#(and(isNeList(V1),isList(V2))) mark#(isList(X)) -> active#(isList(X)) -> active#(isNePal(V)) -> isQid#(V) mark#(isList(X)) -> active#(isList(X)) -> active#(isNePal(V)) -> mark#(isQid(V)) mark#(isList(X)) -> active#(isList(X)) -> active#(isNePal(__(I,__(P,I)))) -> isPal#(P) mark#(isList(X)) -> active#(isList(X)) -> active#(isNePal(__(I,__(P,I)))) -> isQid#(I) mark#(isList(X)) -> active#(isList(X)) -> active#(isNePal(__(I,__(P,I)))) -> and#(isQid(I),isPal(P)) mark#(isList(X)) -> active#(isList(X)) -> active#(isNePal(__(I,__(P,I)))) -> mark#(and(isQid(I),isPal(P))) mark#(isList(X)) -> active#(isList(X)) -> active#(isPal(V)) -> isNePal#(V) mark#(isList(X)) -> active#(isList(X)) -> active#(isPal(V)) -> mark#(isNePal(V)) mark#(isList(X)) -> active#(isList(X)) -> active#(isPal(nil())) -> mark#(tt()) mark#(isList(X)) -> active#(isList(X)) -> active#(isQid(a())) -> mark#(tt()) mark#(isList(X)) -> active#(isList(X)) -> active#(isQid(e())) -> mark#(tt()) mark#(isList(X)) -> active#(isList(X)) -> active#(isQid(i())) -> mark#(tt()) mark#(isList(X)) -> active#(isList(X)) -> active#(isQid(o())) -> mark#(tt()) mark#(isList(X)) -> active#(isList(X)) -> active#(isQid(u())) -> mark#(tt()) mark#(and(X1,X2)) -> and#(mark(X1),X2) -> and#(mark(X1),X2) -> and#(X1,X2) mark#(and(X1,X2)) -> and#(mark(X1),X2) -> and#(X1,mark(X2)) -> and#(X1,X2) mark#(and(X1,X2)) -> and#(mark(X1),X2) -> and#(active(X1),X2) -> and#(X1,X2) mark#(and(X1,X2)) -> and#(mark(X1),X2) -> and#(X1,active(X2)) -> and#(X1,X2) mark#(and(X1,X2)) -> mark#(X1) -> mark#(__(X1,X2)) -> mark#(X2) mark#(and(X1,X2)) -> mark#(X1) -> mark#(__(X1,X2)) -> mark#(X1) mark#(and(X1,X2)) -> mark#(X1) -> mark#(__(X1,X2)) -> __#(mark(X1),mark(X2)) mark#(and(X1,X2)) -> mark#(X1) -> mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) mark#(and(X1,X2)) -> mark#(X1) -> mark#(nil()) -> active#(nil()) mark#(and(X1,X2)) -> mark#(X1) -> mark#(and(X1,X2)) -> mark#(X1) mark#(and(X1,X2)) -> mark#(X1) -> mark#(and(X1,X2)) -> and#(mark(X1),X2) mark#(and(X1,X2)) -> mark#(X1) -> mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) mark#(and(X1,X2)) -> mark#(X1) -> mark#(tt()) -> active#(tt()) mark#(and(X1,X2)) -> mark#(X1) -> mark#(isList(X)) -> active#(isList(X)) mark#(and(X1,X2)) -> mark#(X1) -> mark#(isNeList(X)) -> active#(isNeList(X)) mark#(and(X1,X2)) -> mark#(X1) -> mark#(isQid(X)) -> active#(isQid(X)) mark#(and(X1,X2)) -> mark#(X1) -> mark#(isNePal(X)) -> active#(isNePal(X)) mark#(and(X1,X2)) -> mark#(X1) -> mark#(isPal(X)) -> active#(isPal(X)) mark#(and(X1,X2)) -> mark#(X1) -> mark#(a()) -> active#(a()) mark#(and(X1,X2)) -> mark#(X1) -> mark#(e()) -> active#(e()) mark#(and(X1,X2)) -> mark#(X1) -> mark#(i()) -> active#(i()) mark#(and(X1,X2)) -> mark#(X1) -> mark#(o()) -> active#(o()) mark#(and(X1,X2)) -> mark#(X1) -> mark#(u()) -> active#(u()) mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) -> active#(__(__(X,Y),Z)) -> __#(Y,Z) mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) -> active#(__(__(X,Y),Z)) -> __#(X,__(Y,Z)) mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) -> active#(__(__(X,Y),Z)) -> mark#(__(X,__(Y,Z))) mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) -> active#(__(X,nil())) -> mark#(X) mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) -> active#(__(nil(),X)) -> mark#(X) mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) -> active#(and(tt(),X)) -> mark#(X) mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) -> active#(isList(V)) -> isNeList#(V) mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) -> active#(isList(V)) -> mark#(isNeList(V)) mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) -> active#(isList(nil())) -> mark#(tt()) mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) -> active#(isList(__(V1,V2))) -> isList#(V2) mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) -> active#(isList(__(V1,V2))) -> isList#(V1) mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) -> active#(isList(__(V1,V2))) -> and#(isList(V1),isList(V2)) mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) -> active#(isList(__(V1,V2))) -> mark#(and(isList(V1),isList(V2))) mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) -> active#(isNeList(V)) -> isQid#(V) mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) -> active#(isNeList(V)) -> mark#(isQid(V)) mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) -> active#(isNeList(__(V1,V2))) -> isNeList#(V2) mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) -> active#(isNeList(__(V1,V2))) -> isList#(V1) mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) -> active#(isNeList(__(V1,V2))) -> and#(isList(V1),isNeList(V2)) mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) -> active#(isNeList(__(V1,V2))) -> mark#(and(isList(V1),isNeList(V2))) mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) -> active#(isNeList(__(V1,V2))) -> isList#(V2) mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) -> active#(isNeList(__(V1,V2))) -> isNeList#(V1) mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) -> active#(isNeList(__(V1,V2))) -> and#(isNeList(V1),isList(V2)) mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) -> active#(isNeList(__(V1,V2))) -> mark#(and(isNeList(V1),isList(V2))) mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) -> active#(isNePal(V)) -> isQid#(V) mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) -> active#(isNePal(V)) -> mark#(isQid(V)) mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) -> active#(isNePal(__(I,__(P,I)))) -> isPal#(P) mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) -> active#(isNePal(__(I,__(P,I)))) -> isQid#(I) mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) -> active#(isNePal(__(I,__(P,I)))) -> and#(isQid(I),isPal(P)) mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) -> active#(isNePal(__(I,__(P,I)))) -> mark#(and(isQid(I),isPal(P))) mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) -> active#(isPal(V)) -> isNePal#(V) mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) -> active#(isPal(V)) -> mark#(isNePal(V)) mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) -> active#(isPal(nil())) -> mark#(tt()) mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) -> active#(isQid(a())) -> mark#(tt()) mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) -> active#(isQid(e())) -> mark#(tt()) mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) -> active#(isQid(i())) -> mark#(tt()) mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) -> active#(isQid(o())) -> mark#(tt()) mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) -> active#(isQid(u())) -> mark#(tt()) mark#(__(X1,X2)) -> mark#(X2) -> mark#(__(X1,X2)) -> mark#(X2) mark#(__(X1,X2)) -> mark#(X2) -> mark#(__(X1,X2)) -> mark#(X1) mark#(__(X1,X2)) -> mark#(X2) -> mark#(__(X1,X2)) -> __#(mark(X1),mark(X2)) mark#(__(X1,X2)) -> mark#(X2) -> mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) mark#(__(X1,X2)) -> mark#(X2) -> mark#(nil()) -> active#(nil()) mark#(__(X1,X2)) -> mark#(X2) -> mark#(and(X1,X2)) -> mark#(X1) mark#(__(X1,X2)) -> mark#(X2) -> mark#(and(X1,X2)) -> and#(mark(X1),X2) mark#(__(X1,X2)) -> mark#(X2) -> mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) mark#(__(X1,X2)) -> mark#(X2) -> mark#(tt()) -> active#(tt()) mark#(__(X1,X2)) -> mark#(X2) -> mark#(isList(X)) -> active#(isList(X)) mark#(__(X1,X2)) -> mark#(X2) -> mark#(isNeList(X)) -> active#(isNeList(X)) mark#(__(X1,X2)) -> mark#(X2) -> mark#(isQid(X)) -> active#(isQid(X)) mark#(__(X1,X2)) -> mark#(X2) -> mark#(isNePal(X)) -> active#(isNePal(X)) mark#(__(X1,X2)) -> mark#(X2) -> mark#(isPal(X)) -> active#(isPal(X)) mark#(__(X1,X2)) -> mark#(X2) -> mark#(a()) -> active#(a()) mark#(__(X1,X2)) -> mark#(X2) -> mark#(e()) -> active#(e()) mark#(__(X1,X2)) -> mark#(X2) -> mark#(i()) -> active#(i()) mark#(__(X1,X2)) -> mark#(X2) -> mark#(o()) -> active#(o()) mark#(__(X1,X2)) -> mark#(X2) -> mark#(u()) -> active#(u()) mark#(__(X1,X2)) -> mark#(X1) -> mark#(__(X1,X2)) -> mark#(X2) mark#(__(X1,X2)) -> mark#(X1) -> mark#(__(X1,X2)) -> mark#(X1) mark#(__(X1,X2)) -> mark#(X1) -> mark#(__(X1,X2)) -> __#(mark(X1),mark(X2)) mark#(__(X1,X2)) -> mark#(X1) -> mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) mark#(__(X1,X2)) -> mark#(X1) -> mark#(nil()) -> active#(nil()) mark#(__(X1,X2)) -> mark#(X1) -> mark#(and(X1,X2)) -> mark#(X1) mark#(__(X1,X2)) -> mark#(X1) -> mark#(and(X1,X2)) -> and#(mark(X1),X2) mark#(__(X1,X2)) -> mark#(X1) -> mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) mark#(__(X1,X2)) -> mark#(X1) -> mark#(tt()) -> active#(tt()) mark#(__(X1,X2)) -> mark#(X1) -> mark#(isList(X)) -> active#(isList(X)) mark#(__(X1,X2)) -> mark#(X1) -> mark#(isNeList(X)) -> active#(isNeList(X)) mark#(__(X1,X2)) -> mark#(X1) -> mark#(isQid(X)) -> active#(isQid(X)) mark#(__(X1,X2)) -> mark#(X1) -> mark#(isNePal(X)) -> active#(isNePal(X)) mark#(__(X1,X2)) -> mark#(X1) -> mark#(isPal(X)) -> active#(isPal(X)) mark#(__(X1,X2)) -> mark#(X1) -> mark#(a()) -> active#(a()) mark#(__(X1,X2)) -> mark#(X1) -> mark#(e()) -> active#(e()) mark#(__(X1,X2)) -> mark#(X1) -> mark#(i()) -> active#(i()) mark#(__(X1,X2)) -> mark#(X1) -> mark#(o()) -> active#(o()) mark#(__(X1,X2)) -> mark#(X1) -> mark#(u()) -> active#(u()) mark#(__(X1,X2)) -> __#(mark(X1),mark(X2)) -> __#(mark(X1),X2) -> __#(X1,X2) mark#(__(X1,X2)) -> __#(mark(X1),mark(X2)) -> __#(X1,mark(X2)) -> __#(X1,X2) mark#(__(X1,X2)) -> __#(mark(X1),mark(X2)) -> __#(active(X1),X2) -> __#(X1,X2) mark#(__(X1,X2)) -> __#(mark(X1),mark(X2)) -> __#(X1,active(X2)) -> __#(X1,X2) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) -> active#(__(__(X,Y),Z)) -> __#(Y,Z) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) -> active#(__(__(X,Y),Z)) -> __#(X,__(Y,Z)) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) -> active#(__(__(X,Y),Z)) -> mark#(__(X,__(Y,Z))) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) -> active#(__(X,nil())) -> mark#(X) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) -> active#(__(nil(),X)) -> mark#(X) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) -> active#(and(tt(),X)) -> mark#(X) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) -> active#(isList(V)) -> isNeList#(V) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) -> active#(isList(V)) -> mark#(isNeList(V)) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) -> active#(isList(nil())) -> mark#(tt()) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) -> active#(isList(__(V1,V2))) -> isList#(V2) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) -> active#(isList(__(V1,V2))) -> isList#(V1) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) -> active#(isList(__(V1,V2))) -> and#(isList(V1),isList(V2)) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) -> active#(isList(__(V1,V2))) -> mark#(and(isList(V1),isList(V2))) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) -> active#(isNeList(V)) -> isQid#(V) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) -> active#(isNeList(V)) -> mark#(isQid(V)) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) -> active#(isNeList(__(V1,V2))) -> isNeList#(V2) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) -> active#(isNeList(__(V1,V2))) -> isList#(V1) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) -> active#(isNeList(__(V1,V2))) -> and#(isList(V1),isNeList(V2)) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) -> active#(isNeList(__(V1,V2))) -> mark#(and(isList(V1),isNeList(V2))) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) -> active#(isNeList(__(V1,V2))) -> isList#(V2) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) -> active#(isNeList(__(V1,V2))) -> isNeList#(V1) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) -> active#(isNeList(__(V1,V2))) -> and#(isNeList(V1),isList(V2)) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) -> active#(isNeList(__(V1,V2))) -> mark#(and(isNeList(V1),isList(V2))) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) -> active#(isNePal(V)) -> isQid#(V) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) -> active#(isNePal(V)) -> mark#(isQid(V)) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) -> active#(isNePal(__(I,__(P,I)))) -> isPal#(P) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) -> active#(isNePal(__(I,__(P,I)))) -> isQid#(I) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) -> active#(isNePal(__(I,__(P,I)))) -> and#(isQid(I),isPal(P)) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) -> active#(isNePal(__(I,__(P,I)))) -> mark#(and(isQid(I),isPal(P))) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) -> active#(isPal(V)) -> isNePal#(V) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) -> active#(isPal(V)) -> mark#(isNePal(V)) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) -> active#(isPal(nil())) -> mark#(tt()) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) -> active#(isQid(a())) -> mark#(tt()) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) -> active#(isQid(e())) -> mark#(tt()) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) -> active#(isQid(i())) -> mark#(tt()) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) -> active#(isQid(o())) -> mark#(tt()) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) -> active#(isQid(u())) -> mark#(tt()) __#(mark(X1),X2) -> __#(X1,X2) -> __#(mark(X1),X2) -> __#(X1,X2) __#(mark(X1),X2) -> __#(X1,X2) -> __#(X1,mark(X2)) -> __#(X1,X2) __#(mark(X1),X2) -> __#(X1,X2) -> __#(active(X1),X2) -> __#(X1,X2) __#(mark(X1),X2) -> __#(X1,X2) -> __#(X1,active(X2)) -> __#(X1,X2) __#(active(X1),X2) -> __#(X1,X2) -> __#(mark(X1),X2) -> __#(X1,X2) __#(active(X1),X2) -> __#(X1,X2) -> __#(X1,mark(X2)) -> __#(X1,X2) __#(active(X1),X2) -> __#(X1,X2) -> __#(active(X1),X2) -> __#(X1,X2) __#(active(X1),X2) -> __#(X1,X2) -> __#(X1,active(X2)) -> __#(X1,X2) __#(X1,mark(X2)) -> __#(X1,X2) -> __#(mark(X1),X2) -> __#(X1,X2) __#(X1,mark(X2)) -> __#(X1,X2) -> __#(X1,mark(X2)) -> __#(X1,X2) __#(X1,mark(X2)) -> __#(X1,X2) -> __#(active(X1),X2) -> __#(X1,X2) __#(X1,mark(X2)) -> __#(X1,X2) -> __#(X1,active(X2)) -> __#(X1,X2) __#(X1,active(X2)) -> __#(X1,X2) -> __#(mark(X1),X2) -> __#(X1,X2) __#(X1,active(X2)) -> __#(X1,X2) -> __#(X1,mark(X2)) -> __#(X1,X2) __#(X1,active(X2)) -> __#(X1,X2) -> __#(active(X1),X2) -> __#(X1,X2) __#(X1,active(X2)) -> __#(X1,X2) -> __#(X1,active(X2)) -> __#(X1,X2) active#(isPal(nil())) -> mark#(tt()) -> mark#(tt()) -> active#(tt()) active#(isPal(V)) -> isNePal#(V) -> isNePal#(mark(X)) -> isNePal#(X) active#(isPal(V)) -> isNePal#(V) -> isNePal#(active(X)) -> isNePal#(X) active#(isPal(V)) -> mark#(isNePal(V)) -> mark#(__(X1,X2)) -> mark#(X2) active#(isPal(V)) -> mark#(isNePal(V)) -> mark#(__(X1,X2)) -> mark#(X1) active#(isPal(V)) -> mark#(isNePal(V)) -> mark#(__(X1,X2)) -> __#(mark(X1),mark(X2)) active#(isPal(V)) -> mark#(isNePal(V)) -> mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) active#(isPal(V)) -> mark#(isNePal(V)) -> mark#(and(X1,X2)) -> mark#(X1) active#(isPal(V)) -> mark#(isNePal(V)) -> mark#(and(X1,X2)) -> and#(mark(X1),X2) active#(isPal(V)) -> mark#(isNePal(V)) -> mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) active#(isPal(V)) -> mark#(isNePal(V)) -> mark#(isList(X)) -> active#(isList(X)) active#(isPal(V)) -> mark#(isNePal(V)) -> mark#(isNeList(X)) -> active#(isNeList(X)) active#(isPal(V)) -> mark#(isNePal(V)) -> mark#(isQid(X)) -> active#(isQid(X)) active#(isPal(V)) -> mark#(isNePal(V)) -> mark#(isNePal(X)) -> active#(isNePal(X)) active#(isPal(V)) -> mark#(isNePal(V)) -> mark#(isPal(X)) -> active#(isPal(X)) active#(isNePal(__(I,__(P,I)))) -> isPal#(P) -> isPal#(mark(X)) -> isPal#(X) active#(isNePal(__(I,__(P,I)))) -> isPal#(P) -> isPal#(active(X)) -> isPal#(X) active#(isNePal(__(I,__(P,I)))) -> isQid#(I) -> isQid#(mark(X)) -> isQid#(X) active#(isNePal(__(I,__(P,I)))) -> isQid#(I) -> isQid#(active(X)) -> isQid#(X) active#(isNePal(__(I,__(P,I)))) -> and#(isQid(I),isPal(P)) -> and#(mark(X1),X2) -> and#(X1,X2) active#(isNePal(__(I,__(P,I)))) -> and#(isQid(I),isPal(P)) -> and#(X1,mark(X2)) -> and#(X1,X2) active#(isNePal(__(I,__(P,I)))) -> and#(isQid(I),isPal(P)) -> and#(active(X1),X2) -> and#(X1,X2) active#(isNePal(__(I,__(P,I)))) -> and#(isQid(I),isPal(P)) -> and#(X1,active(X2)) -> and#(X1,X2) active#(isNePal(__(I,__(P,I)))) -> mark#(and(isQid(I),isPal(P))) -> mark#(__(X1,X2)) -> mark#(X2) active#(isNePal(__(I,__(P,I)))) -> mark#(and(isQid(I),isPal(P))) -> mark#(__(X1,X2)) -> mark#(X1) active#(isNePal(__(I,__(P,I)))) -> mark#(and(isQid(I),isPal(P))) -> mark#(__(X1,X2)) -> __#(mark(X1),mark(X2)) active#(isNePal(__(I,__(P,I)))) -> mark#(and(isQid(I),isPal(P))) -> mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) active#(isNePal(__(I,__(P,I)))) -> mark#(and(isQid(I),isPal(P))) -> mark#(and(X1,X2)) -> mark#(X1) active#(isNePal(__(I,__(P,I)))) -> mark#(and(isQid(I),isPal(P))) -> mark#(and(X1,X2)) -> and#(mark(X1),X2) active#(isNePal(__(I,__(P,I)))) -> mark#(and(isQid(I),isPal(P))) -> mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) active#(isNePal(__(I,__(P,I)))) -> mark#(and(isQid(I),isPal(P))) -> mark#(isList(X)) -> active#(isList(X)) active#(isNePal(__(I,__(P,I)))) -> mark#(and(isQid(I),isPal(P))) -> mark#(isNeList(X)) -> active#(isNeList(X)) active#(isNePal(__(I,__(P,I)))) -> mark#(and(isQid(I),isPal(P))) -> mark#(isQid(X)) -> active#(isQid(X)) active#(isNePal(__(I,__(P,I)))) -> mark#(and(isQid(I),isPal(P))) -> mark#(isNePal(X)) -> active#(isNePal(X)) active#(isNePal(__(I,__(P,I)))) -> mark#(and(isQid(I),isPal(P))) -> mark#(isPal(X)) -> active#(isPal(X)) active#(isNePal(V)) -> isQid#(V) -> isQid#(mark(X)) -> isQid#(X) active#(isNePal(V)) -> isQid#(V) -> isQid#(active(X)) -> isQid#(X) active#(isNePal(V)) -> mark#(isQid(V)) -> mark#(__(X1,X2)) -> mark#(X2) active#(isNePal(V)) -> mark#(isQid(V)) -> mark#(__(X1,X2)) -> mark#(X1) active#(isNePal(V)) -> mark#(isQid(V)) -> mark#(__(X1,X2)) -> __#(mark(X1),mark(X2)) active#(isNePal(V)) -> mark#(isQid(V)) -> mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) active#(isNePal(V)) -> mark#(isQid(V)) -> mark#(and(X1,X2)) -> mark#(X1) active#(isNePal(V)) -> mark#(isQid(V)) -> mark#(and(X1,X2)) -> and#(mark(X1),X2) active#(isNePal(V)) -> mark#(isQid(V)) -> mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) active#(isNePal(V)) -> mark#(isQid(V)) -> mark#(isList(X)) -> active#(isList(X)) active#(isNePal(V)) -> mark#(isQid(V)) -> mark#(isNeList(X)) -> active#(isNeList(X)) active#(isNePal(V)) -> mark#(isQid(V)) -> mark#(isQid(X)) -> active#(isQid(X)) active#(isNePal(V)) -> mark#(isQid(V)) -> mark#(isNePal(X)) -> active#(isNePal(X)) active#(isNePal(V)) -> mark#(isQid(V)) -> mark#(isPal(X)) -> active#(isPal(X)) active#(isQid(u())) -> mark#(tt()) -> mark#(tt()) -> active#(tt()) active#(isQid(o())) -> mark#(tt()) -> mark#(tt()) -> active#(tt()) active#(isQid(i())) -> mark#(tt()) -> mark#(tt()) -> active#(tt()) active#(isQid(e())) -> mark#(tt()) -> mark#(tt()) -> active#(tt()) active#(isQid(a())) -> mark#(tt()) -> mark#(tt()) -> active#(tt()) active#(isNeList(__(V1,V2))) -> and#(isNeList(V1),isList(V2)) -> and#(mark(X1),X2) -> and#(X1,X2) active#(isNeList(__(V1,V2))) -> and#(isNeList(V1),isList(V2)) -> and#(X1,mark(X2)) -> and#(X1,X2) active#(isNeList(__(V1,V2))) -> and#(isNeList(V1),isList(V2)) -> and#(active(X1),X2) -> and#(X1,X2) active#(isNeList(__(V1,V2))) -> and#(isNeList(V1),isList(V2)) -> and#(X1,active(X2)) -> and#(X1,X2) active#(isNeList(__(V1,V2))) -> and#(isList(V1),isNeList(V2)) -> and#(mark(X1),X2) -> and#(X1,X2) active#(isNeList(__(V1,V2))) -> and#(isList(V1),isNeList(V2)) -> and#(X1,mark(X2)) -> and#(X1,X2) active#(isNeList(__(V1,V2))) -> and#(isList(V1),isNeList(V2)) -> and#(active(X1),X2) -> and#(X1,X2) active#(isNeList(__(V1,V2))) -> and#(isList(V1),isNeList(V2)) -> and#(X1,active(X2)) -> and#(X1,X2) active#(isNeList(__(V1,V2))) -> isList#(V2) -> isList#(mark(X)) -> isList#(X) active#(isNeList(__(V1,V2))) -> isList#(V2) -> isList#(active(X)) -> isList#(X) active#(isNeList(__(V1,V2))) -> isList#(V1) -> isList#(mark(X)) -> isList#(X) active#(isNeList(__(V1,V2))) -> isList#(V1) -> isList#(active(X)) -> isList#(X) active#(isNeList(__(V1,V2))) -> isNeList#(V2) -> isNeList#(mark(X)) -> isNeList#(X) active#(isNeList(__(V1,V2))) -> isNeList#(V2) -> isNeList#(active(X)) -> isNeList#(X) active#(isNeList(__(V1,V2))) -> isNeList#(V1) -> isNeList#(mark(X)) -> isNeList#(X) active#(isNeList(__(V1,V2))) -> isNeList#(V1) -> isNeList#(active(X)) -> isNeList#(X) active#(isNeList(__(V1,V2))) -> mark#(and(isNeList(V1),isList(V2))) -> mark#(__(X1,X2)) -> mark#(X2) active#(isNeList(__(V1,V2))) -> mark#(and(isNeList(V1),isList(V2))) -> mark#(__(X1,X2)) -> mark#(X1) active#(isNeList(__(V1,V2))) -> mark#(and(isNeList(V1),isList(V2))) -> mark#(__(X1,X2)) -> __#(mark(X1),mark(X2)) active#(isNeList(__(V1,V2))) -> mark#(and(isNeList(V1),isList(V2))) -> mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) active#(isNeList(__(V1,V2))) -> mark#(and(isNeList(V1),isList(V2))) -> mark#(and(X1,X2)) -> mark#(X1) active#(isNeList(__(V1,V2))) -> mark#(and(isNeList(V1),isList(V2))) -> mark#(and(X1,X2)) -> and#(mark(X1),X2) active#(isNeList(__(V1,V2))) -> mark#(and(isNeList(V1),isList(V2))) -> mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) active#(isNeList(__(V1,V2))) -> mark#(and(isNeList(V1),isList(V2))) -> mark#(isList(X)) -> active#(isList(X)) active#(isNeList(__(V1,V2))) -> mark#(and(isNeList(V1),isList(V2))) -> mark#(isNeList(X)) -> active#(isNeList(X)) active#(isNeList(__(V1,V2))) -> mark#(and(isNeList(V1),isList(V2))) -> mark#(isQid(X)) -> active#(isQid(X)) active#(isNeList(__(V1,V2))) -> mark#(and(isNeList(V1),isList(V2))) -> mark#(isNePal(X)) -> active#(isNePal(X)) active#(isNeList(__(V1,V2))) -> mark#(and(isNeList(V1),isList(V2))) -> mark#(isPal(X)) -> active#(isPal(X)) active#(isNeList(__(V1,V2))) -> mark#(and(isList(V1),isNeList(V2))) -> mark#(__(X1,X2)) -> mark#(X2) active#(isNeList(__(V1,V2))) -> mark#(and(isList(V1),isNeList(V2))) -> mark#(__(X1,X2)) -> mark#(X1) active#(isNeList(__(V1,V2))) -> mark#(and(isList(V1),isNeList(V2))) -> mark#(__(X1,X2)) -> __#(mark(X1),mark(X2)) active#(isNeList(__(V1,V2))) -> mark#(and(isList(V1),isNeList(V2))) -> mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) active#(isNeList(__(V1,V2))) -> mark#(and(isList(V1),isNeList(V2))) -> mark#(and(X1,X2)) -> mark#(X1) active#(isNeList(__(V1,V2))) -> mark#(and(isList(V1),isNeList(V2))) -> mark#(and(X1,X2)) -> and#(mark(X1),X2) active#(isNeList(__(V1,V2))) -> mark#(and(isList(V1),isNeList(V2))) -> mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) active#(isNeList(__(V1,V2))) -> mark#(and(isList(V1),isNeList(V2))) -> mark#(isList(X)) -> active#(isList(X)) active#(isNeList(__(V1,V2))) -> mark#(and(isList(V1),isNeList(V2))) -> mark#(isNeList(X)) -> active#(isNeList(X)) active#(isNeList(__(V1,V2))) -> mark#(and(isList(V1),isNeList(V2))) -> mark#(isQid(X)) -> active#(isQid(X)) active#(isNeList(__(V1,V2))) -> mark#(and(isList(V1),isNeList(V2))) -> mark#(isNePal(X)) -> active#(isNePal(X)) active#(isNeList(__(V1,V2))) -> mark#(and(isList(V1),isNeList(V2))) -> mark#(isPal(X)) -> active#(isPal(X)) active#(isNeList(V)) -> isQid#(V) -> isQid#(mark(X)) -> isQid#(X) active#(isNeList(V)) -> isQid#(V) -> isQid#(active(X)) -> isQid#(X) active#(isNeList(V)) -> mark#(isQid(V)) -> mark#(__(X1,X2)) -> mark#(X2) active#(isNeList(V)) -> mark#(isQid(V)) -> mark#(__(X1,X2)) -> mark#(X1) active#(isNeList(V)) -> mark#(isQid(V)) -> mark#(__(X1,X2)) -> __#(mark(X1),mark(X2)) active#(isNeList(V)) -> mark#(isQid(V)) -> mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) active#(isNeList(V)) -> mark#(isQid(V)) -> mark#(and(X1,X2)) -> mark#(X1) active#(isNeList(V)) -> mark#(isQid(V)) -> mark#(and(X1,X2)) -> and#(mark(X1),X2) active#(isNeList(V)) -> mark#(isQid(V)) -> mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) active#(isNeList(V)) -> mark#(isQid(V)) -> mark#(isList(X)) -> active#(isList(X)) active#(isNeList(V)) -> mark#(isQid(V)) -> mark#(isNeList(X)) -> active#(isNeList(X)) active#(isNeList(V)) -> mark#(isQid(V)) -> mark#(isQid(X)) -> active#(isQid(X)) active#(isNeList(V)) -> mark#(isQid(V)) -> mark#(isNePal(X)) -> active#(isNePal(X)) active#(isNeList(V)) -> mark#(isQid(V)) -> mark#(isPal(X)) -> active#(isPal(X)) active#(isList(nil())) -> mark#(tt()) -> mark#(tt()) -> active#(tt()) active#(isList(__(V1,V2))) -> and#(isList(V1),isList(V2)) -> and#(mark(X1),X2) -> and#(X1,X2) active#(isList(__(V1,V2))) -> and#(isList(V1),isList(V2)) -> and#(X1,mark(X2)) -> and#(X1,X2) active#(isList(__(V1,V2))) -> and#(isList(V1),isList(V2)) -> and#(active(X1),X2) -> and#(X1,X2) active#(isList(__(V1,V2))) -> and#(isList(V1),isList(V2)) -> and#(X1,active(X2)) -> and#(X1,X2) active#(isList(__(V1,V2))) -> isList#(V2) -> isList#(mark(X)) -> isList#(X) active#(isList(__(V1,V2))) -> isList#(V2) -> isList#(active(X)) -> isList#(X) active#(isList(__(V1,V2))) -> isList#(V1) -> isList#(mark(X)) -> isList#(X) active#(isList(__(V1,V2))) -> isList#(V1) -> isList#(active(X)) -> isList#(X) active#(isList(__(V1,V2))) -> mark#(and(isList(V1),isList(V2))) -> mark#(__(X1,X2)) -> mark#(X2) active#(isList(__(V1,V2))) -> mark#(and(isList(V1),isList(V2))) -> mark#(__(X1,X2)) -> mark#(X1) active#(isList(__(V1,V2))) -> mark#(and(isList(V1),isList(V2))) -> mark#(__(X1,X2)) -> __#(mark(X1),mark(X2)) active#(isList(__(V1,V2))) -> mark#(and(isList(V1),isList(V2))) -> mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) active#(isList(__(V1,V2))) -> mark#(and(isList(V1),isList(V2))) -> mark#(and(X1,X2)) -> mark#(X1) active#(isList(__(V1,V2))) -> mark#(and(isList(V1),isList(V2))) -> mark#(and(X1,X2)) -> and#(mark(X1),X2) active#(isList(__(V1,V2))) -> mark#(and(isList(V1),isList(V2))) -> mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) active#(isList(__(V1,V2))) -> mark#(and(isList(V1),isList(V2))) -> mark#(isList(X)) -> active#(isList(X)) active#(isList(__(V1,V2))) -> mark#(and(isList(V1),isList(V2))) -> mark#(isNeList(X)) -> active#(isNeList(X)) active#(isList(__(V1,V2))) -> mark#(and(isList(V1),isList(V2))) -> mark#(isQid(X)) -> active#(isQid(X)) active#(isList(__(V1,V2))) -> mark#(and(isList(V1),isList(V2))) -> mark#(isNePal(X)) -> active#(isNePal(X)) active#(isList(__(V1,V2))) -> mark#(and(isList(V1),isList(V2))) -> mark#(isPal(X)) -> active#(isPal(X)) active#(isList(V)) -> isNeList#(V) -> isNeList#(mark(X)) -> isNeList#(X) active#(isList(V)) -> isNeList#(V) -> isNeList#(active(X)) -> isNeList#(X) active#(isList(V)) -> mark#(isNeList(V)) -> mark#(__(X1,X2)) -> mark#(X2) active#(isList(V)) -> mark#(isNeList(V)) -> mark#(__(X1,X2)) -> mark#(X1) active#(isList(V)) -> mark#(isNeList(V)) -> mark#(__(X1,X2)) -> __#(mark(X1),mark(X2)) active#(isList(V)) -> mark#(isNeList(V)) -> mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) active#(isList(V)) -> mark#(isNeList(V)) -> mark#(and(X1,X2)) -> mark#(X1) active#(isList(V)) -> mark#(isNeList(V)) -> mark#(and(X1,X2)) -> and#(mark(X1),X2) active#(isList(V)) -> mark#(isNeList(V)) -> mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) active#(isList(V)) -> mark#(isNeList(V)) -> mark#(isList(X)) -> active#(isList(X)) active#(isList(V)) -> mark#(isNeList(V)) -> mark#(isNeList(X)) -> active#(isNeList(X)) active#(isList(V)) -> mark#(isNeList(V)) -> mark#(isQid(X)) -> active#(isQid(X)) active#(isList(V)) -> mark#(isNeList(V)) -> mark#(isNePal(X)) -> active#(isNePal(X)) active#(isList(V)) -> mark#(isNeList(V)) -> mark#(isPal(X)) -> active#(isPal(X)) active#(and(tt(),X)) -> mark#(X) -> mark#(__(X1,X2)) -> mark#(X2) active#(and(tt(),X)) -> mark#(X) -> mark#(__(X1,X2)) -> mark#(X1) active#(and(tt(),X)) -> mark#(X) -> mark#(__(X1,X2)) -> __#(mark(X1),mark(X2)) active#(and(tt(),X)) -> mark#(X) -> mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) active#(and(tt(),X)) -> mark#(X) -> mark#(nil()) -> active#(nil()) active#(and(tt(),X)) -> mark#(X) -> mark#(and(X1,X2)) -> mark#(X1) active#(and(tt(),X)) -> mark#(X) -> mark#(and(X1,X2)) -> and#(mark(X1),X2) active#(and(tt(),X)) -> mark#(X) -> mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) active#(and(tt(),X)) -> mark#(X) -> mark#(tt()) -> active#(tt()) active#(and(tt(),X)) -> mark#(X) -> mark#(isList(X)) -> active#(isList(X)) active#(and(tt(),X)) -> mark#(X) -> mark#(isNeList(X)) -> active#(isNeList(X)) active#(and(tt(),X)) -> mark#(X) -> mark#(isQid(X)) -> active#(isQid(X)) active#(and(tt(),X)) -> mark#(X) -> mark#(isNePal(X)) -> active#(isNePal(X)) active#(and(tt(),X)) -> mark#(X) -> mark#(isPal(X)) -> active#(isPal(X)) active#(and(tt(),X)) -> mark#(X) -> mark#(a()) -> active#(a()) active#(and(tt(),X)) -> mark#(X) -> mark#(e()) -> active#(e()) active#(and(tt(),X)) -> mark#(X) -> mark#(i()) -> active#(i()) active#(and(tt(),X)) -> mark#(X) -> mark#(o()) -> active#(o()) active#(and(tt(),X)) -> mark#(X) -> mark#(u()) -> active#(u()) active#(__(nil(),X)) -> mark#(X) -> mark#(__(X1,X2)) -> mark#(X2) active#(__(nil(),X)) -> mark#(X) -> mark#(__(X1,X2)) -> mark#(X1) active#(__(nil(),X)) -> mark#(X) -> mark#(__(X1,X2)) -> __#(mark(X1),mark(X2)) active#(__(nil(),X)) -> mark#(X) -> mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) active#(__(nil(),X)) -> mark#(X) -> mark#(nil()) -> active#(nil()) active#(__(nil(),X)) -> mark#(X) -> mark#(and(X1,X2)) -> mark#(X1) active#(__(nil(),X)) -> mark#(X) -> mark#(and(X1,X2)) -> and#(mark(X1),X2) active#(__(nil(),X)) -> mark#(X) -> mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) active#(__(nil(),X)) -> mark#(X) -> mark#(tt()) -> active#(tt()) active#(__(nil(),X)) -> mark#(X) -> mark#(isList(X)) -> active#(isList(X)) active#(__(nil(),X)) -> mark#(X) -> mark#(isNeList(X)) -> active#(isNeList(X)) active#(__(nil(),X)) -> mark#(X) -> mark#(isQid(X)) -> active#(isQid(X)) active#(__(nil(),X)) -> mark#(X) -> mark#(isNePal(X)) -> active#(isNePal(X)) active#(__(nil(),X)) -> mark#(X) -> mark#(isPal(X)) -> active#(isPal(X)) active#(__(nil(),X)) -> mark#(X) -> mark#(a()) -> active#(a()) active#(__(nil(),X)) -> mark#(X) -> mark#(e()) -> active#(e()) active#(__(nil(),X)) -> mark#(X) -> mark#(i()) -> active#(i()) active#(__(nil(),X)) -> mark#(X) -> mark#(o()) -> active#(o()) active#(__(nil(),X)) -> mark#(X) -> mark#(u()) -> active#(u()) active#(__(__(X,Y),Z)) -> mark#(__(X,__(Y,Z))) -> mark#(__(X1,X2)) -> mark#(X2) active#(__(__(X,Y),Z)) -> mark#(__(X,__(Y,Z))) -> mark#(__(X1,X2)) -> mark#(X1) active#(__(__(X,Y),Z)) -> mark#(__(X,__(Y,Z))) -> mark#(__(X1,X2)) -> __#(mark(X1),mark(X2)) active#(__(__(X,Y),Z)) -> mark#(__(X,__(Y,Z))) -> mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) active#(__(__(X,Y),Z)) -> mark#(__(X,__(Y,Z))) -> mark#(and(X1,X2)) -> mark#(X1) active#(__(__(X,Y),Z)) -> mark#(__(X,__(Y,Z))) -> mark#(and(X1,X2)) -> and#(mark(X1),X2) active#(__(__(X,Y),Z)) -> mark#(__(X,__(Y,Z))) -> mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) active#(__(__(X,Y),Z)) -> mark#(__(X,__(Y,Z))) -> mark#(isList(X)) -> active#(isList(X)) active#(__(__(X,Y),Z)) -> mark#(__(X,__(Y,Z))) -> mark#(isNeList(X)) -> active#(isNeList(X)) active#(__(__(X,Y),Z)) -> mark#(__(X,__(Y,Z))) -> mark#(isQid(X)) -> active#(isQid(X)) active#(__(__(X,Y),Z)) -> mark#(__(X,__(Y,Z))) -> mark#(isNePal(X)) -> active#(isNePal(X)) active#(__(__(X,Y),Z)) -> mark#(__(X,__(Y,Z))) -> mark#(isPal(X)) -> active#(isPal(X)) active#(__(__(X,Y),Z)) -> __#(Y,Z) -> __#(mark(X1),X2) -> __#(X1,X2) active#(__(__(X,Y),Z)) -> __#(Y,Z) -> __#(X1,mark(X2)) -> __#(X1,X2) active#(__(__(X,Y),Z)) -> __#(Y,Z) -> __#(active(X1),X2) -> __#(X1,X2) active#(__(__(X,Y),Z)) -> __#(Y,Z) -> __#(X1,active(X2)) -> __#(X1,X2) active#(__(__(X,Y),Z)) -> __#(X,__(Y,Z)) -> __#(mark(X1),X2) -> __#(X1,X2) active#(__(__(X,Y),Z)) -> __#(X,__(Y,Z)) -> __#(X1,mark(X2)) -> __#(X1,X2) active#(__(__(X,Y),Z)) -> __#(X,__(Y,Z)) -> __#(active(X1),X2) -> __#(X1,X2) active#(__(__(X,Y),Z)) -> __#(X,__(Y,Z)) -> __#(X1,active(X2)) -> __#(X1,X2) active#(__(X,nil())) -> mark#(X) -> mark#(__(X1,X2)) -> mark#(X2) active#(__(X,nil())) -> mark#(X) -> mark#(__(X1,X2)) -> mark#(X1) active#(__(X,nil())) -> mark#(X) -> mark#(__(X1,X2)) -> __#(mark(X1),mark(X2)) active#(__(X,nil())) -> mark#(X) -> mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) active#(__(X,nil())) -> mark#(X) -> mark#(nil()) -> active#(nil()) active#(__(X,nil())) -> mark#(X) -> mark#(and(X1,X2)) -> mark#(X1) active#(__(X,nil())) -> mark#(X) -> mark#(and(X1,X2)) -> and#(mark(X1),X2) active#(__(X,nil())) -> mark#(X) -> mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) active#(__(X,nil())) -> mark#(X) -> mark#(tt()) -> active#(tt()) active#(__(X,nil())) -> mark#(X) -> mark#(isList(X)) -> active#(isList(X)) active#(__(X,nil())) -> mark#(X) -> mark#(isNeList(X)) -> active#(isNeList(X)) active#(__(X,nil())) -> mark#(X) -> mark#(isQid(X)) -> active#(isQid(X)) active#(__(X,nil())) -> mark#(X) -> mark#(isNePal(X)) -> active#(isNePal(X)) active#(__(X,nil())) -> mark#(X) -> mark#(isPal(X)) -> active#(isPal(X)) active#(__(X,nil())) -> mark#(X) -> mark#(a()) -> active#(a()) active#(__(X,nil())) -> mark#(X) -> mark#(e()) -> active#(e()) active#(__(X,nil())) -> mark#(X) -> mark#(i()) -> active#(i()) active#(__(X,nil())) -> mark#(X) -> mark#(o()) -> active#(o()) active#(__(X,nil())) -> mark#(X) -> mark#(u()) -> active#(u()) Restore Modifier: DPs: active#(__(__(X,Y),Z)) -> __#(Y,Z) active#(__(__(X,Y),Z)) -> __#(X,__(Y,Z)) active#(__(__(X,Y),Z)) -> mark#(__(X,__(Y,Z))) active#(__(X,nil())) -> mark#(X) active#(__(nil(),X)) -> mark#(X) active#(and(tt(),X)) -> mark#(X) active#(isList(V)) -> isNeList#(V) active#(isList(V)) -> mark#(isNeList(V)) active#(isList(nil())) -> mark#(tt()) active#(isList(__(V1,V2))) -> isList#(V2) active#(isList(__(V1,V2))) -> isList#(V1) active#(isList(__(V1,V2))) -> and#(isList(V1),isList(V2)) active#(isList(__(V1,V2))) -> mark#(and(isList(V1),isList(V2))) active#(isNeList(V)) -> isQid#(V) active#(isNeList(V)) -> mark#(isQid(V)) active#(isNeList(__(V1,V2))) -> isNeList#(V2) active#(isNeList(__(V1,V2))) -> isList#(V1) active#(isNeList(__(V1,V2))) -> and#(isList(V1),isNeList(V2)) active#(isNeList(__(V1,V2))) -> mark#(and(isList(V1),isNeList(V2))) active#(isNeList(__(V1,V2))) -> isList#(V2) active#(isNeList(__(V1,V2))) -> isNeList#(V1) active#(isNeList(__(V1,V2))) -> and#(isNeList(V1),isList(V2)) active#(isNeList(__(V1,V2))) -> mark#(and(isNeList(V1),isList(V2))) active#(isNePal(V)) -> isQid#(V) active#(isNePal(V)) -> mark#(isQid(V)) active#(isNePal(__(I,__(P,I)))) -> isPal#(P) active#(isNePal(__(I,__(P,I)))) -> isQid#(I) active#(isNePal(__(I,__(P,I)))) -> and#(isQid(I),isPal(P)) active#(isNePal(__(I,__(P,I)))) -> mark#(and(isQid(I),isPal(P))) active#(isPal(V)) -> isNePal#(V) active#(isPal(V)) -> mark#(isNePal(V)) active#(isPal(nil())) -> mark#(tt()) active#(isQid(a())) -> mark#(tt()) active#(isQid(e())) -> mark#(tt()) active#(isQid(i())) -> mark#(tt()) active#(isQid(o())) -> mark#(tt()) active#(isQid(u())) -> mark#(tt()) mark#(__(X1,X2)) -> mark#(X2) mark#(__(X1,X2)) -> mark#(X1) mark#(__(X1,X2)) -> __#(mark(X1),mark(X2)) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) mark#(nil()) -> active#(nil()) mark#(and(X1,X2)) -> mark#(X1) mark#(and(X1,X2)) -> and#(mark(X1),X2) mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) mark#(tt()) -> active#(tt()) mark#(isList(X)) -> active#(isList(X)) mark#(isNeList(X)) -> active#(isNeList(X)) mark#(isQid(X)) -> active#(isQid(X)) mark#(isNePal(X)) -> active#(isNePal(X)) mark#(isPal(X)) -> active#(isPal(X)) mark#(a()) -> active#(a()) mark#(e()) -> active#(e()) mark#(i()) -> active#(i()) mark#(o()) -> active#(o()) mark#(u()) -> active#(u()) __#(mark(X1),X2) -> __#(X1,X2) __#(X1,mark(X2)) -> __#(X1,X2) __#(active(X1),X2) -> __#(X1,X2) __#(X1,active(X2)) -> __#(X1,X2) and#(mark(X1),X2) -> and#(X1,X2) and#(X1,mark(X2)) -> and#(X1,X2) and#(active(X1),X2) -> and#(X1,X2) and#(X1,active(X2)) -> and#(X1,X2) isList#(mark(X)) -> isList#(X) isList#(active(X)) -> isList#(X) isNeList#(mark(X)) -> isNeList#(X) isNeList#(active(X)) -> isNeList#(X) isQid#(mark(X)) -> isQid#(X) isQid#(active(X)) -> isQid#(X) isNePal#(mark(X)) -> isNePal#(X) isNePal#(active(X)) -> isNePal#(X) isPal#(mark(X)) -> isPal#(X) isPal#(active(X)) -> isPal#(X) TRS: active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z))) active(__(X,nil())) -> mark(X) active(__(nil(),X)) -> mark(X) active(and(tt(),X)) -> mark(X) active(isList(V)) -> mark(isNeList(V)) active(isList(nil())) -> mark(tt()) active(isList(__(V1,V2))) -> mark(and(isList(V1),isList(V2))) active(isNeList(V)) -> mark(isQid(V)) active(isNeList(__(V1,V2))) -> mark(and(isList(V1),isNeList(V2))) active(isNeList(__(V1,V2))) -> mark(and(isNeList(V1),isList(V2))) active(isNePal(V)) -> mark(isQid(V)) active(isNePal(__(I,__(P,I)))) -> mark(and(isQid(I),isPal(P))) active(isPal(V)) -> mark(isNePal(V)) active(isPal(nil())) -> mark(tt()) active(isQid(a())) -> mark(tt()) active(isQid(e())) -> mark(tt()) active(isQid(i())) -> mark(tt()) active(isQid(o())) -> mark(tt()) active(isQid(u())) -> mark(tt()) mark(__(X1,X2)) -> active(__(mark(X1),mark(X2))) mark(nil()) -> active(nil()) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(tt()) -> active(tt()) mark(isList(X)) -> active(isList(X)) mark(isNeList(X)) -> active(isNeList(X)) mark(isQid(X)) -> active(isQid(X)) mark(isNePal(X)) -> active(isNePal(X)) mark(isPal(X)) -> active(isPal(X)) mark(a()) -> active(a()) mark(e()) -> active(e()) mark(i()) -> active(i()) mark(o()) -> active(o()) mark(u()) -> active(u()) __(mark(X1),X2) -> __(X1,X2) __(X1,mark(X2)) -> __(X1,X2) __(active(X1),X2) -> __(X1,X2) __(X1,active(X2)) -> __(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) and(active(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) isList(mark(X)) -> isList(X) isList(active(X)) -> isList(X) isNeList(mark(X)) -> isNeList(X) isNeList(active(X)) -> isNeList(X) isQid(mark(X)) -> isQid(X) isQid(active(X)) -> isQid(X) isNePal(mark(X)) -> isNePal(X) isNePal(active(X)) -> isNePal(X) isPal(mark(X)) -> isPal(X) isPal(active(X)) -> isPal(X) SCC Processor: #sccs: 8 #rules: 40 #arcs: 596/5476 DPs: mark#(isPal(X)) -> active#(isPal(X)) active#(isPal(V)) -> mark#(isNePal(V)) mark#(isNePal(X)) -> active#(isNePal(X)) active#(isNePal(__(I,__(P,I)))) -> mark#(and(isQid(I),isPal(P))) mark#(isQid(X)) -> active#(isQid(X)) active#(isNePal(V)) -> mark#(isQid(V)) mark#(isNeList(X)) -> active#(isNeList(X)) active#(isNeList(__(V1,V2))) -> mark#(and(isNeList(V1),isList(V2))) mark#(isList(X)) -> active#(isList(X)) active#(isNeList(__(V1,V2))) -> mark#(and(isList(V1),isNeList(V2))) mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) active#(isNeList(V)) -> mark#(isQid(V)) mark#(and(X1,X2)) -> mark#(X1) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) active#(isList(__(V1,V2))) -> mark#(and(isList(V1),isList(V2))) mark#(__(X1,X2)) -> mark#(X1) mark#(__(X1,X2)) -> mark#(X2) active#(isList(V)) -> mark#(isNeList(V)) active#(and(tt(),X)) -> mark#(X) active#(__(nil(),X)) -> mark#(X) active#(__(X,nil())) -> mark#(X) active#(__(__(X,Y),Z)) -> mark#(__(X,__(Y,Z))) TRS: active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z))) active(__(X,nil())) -> mark(X) active(__(nil(),X)) -> mark(X) active(and(tt(),X)) -> mark(X) active(isList(V)) -> mark(isNeList(V)) active(isList(nil())) -> mark(tt()) active(isList(__(V1,V2))) -> mark(and(isList(V1),isList(V2))) active(isNeList(V)) -> mark(isQid(V)) active(isNeList(__(V1,V2))) -> mark(and(isList(V1),isNeList(V2))) active(isNeList(__(V1,V2))) -> mark(and(isNeList(V1),isList(V2))) active(isNePal(V)) -> mark(isQid(V)) active(isNePal(__(I,__(P,I)))) -> mark(and(isQid(I),isPal(P))) active(isPal(V)) -> mark(isNePal(V)) active(isPal(nil())) -> mark(tt()) active(isQid(a())) -> mark(tt()) active(isQid(e())) -> mark(tt()) active(isQid(i())) -> mark(tt()) active(isQid(o())) -> mark(tt()) active(isQid(u())) -> mark(tt()) mark(__(X1,X2)) -> active(__(mark(X1),mark(X2))) mark(nil()) -> active(nil()) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(tt()) -> active(tt()) mark(isList(X)) -> active(isList(X)) mark(isNeList(X)) -> active(isNeList(X)) mark(isQid(X)) -> active(isQid(X)) mark(isNePal(X)) -> active(isNePal(X)) mark(isPal(X)) -> active(isPal(X)) mark(a()) -> active(a()) mark(e()) -> active(e()) mark(i()) -> active(i()) mark(o()) -> active(o()) mark(u()) -> active(u()) __(mark(X1),X2) -> __(X1,X2) __(X1,mark(X2)) -> __(X1,X2) __(active(X1),X2) -> __(X1,X2) __(X1,active(X2)) -> __(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) and(active(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) isList(mark(X)) -> isList(X) isList(active(X)) -> isList(X) isNeList(mark(X)) -> isNeList(X) isNeList(active(X)) -> isNeList(X) isQid(mark(X)) -> isQid(X) isQid(active(X)) -> isQid(X) isNePal(mark(X)) -> isNePal(X) isNePal(active(X)) -> isNePal(X) isPal(mark(X)) -> isPal(X) isPal(active(X)) -> isPal(X) Open DPs: __#(X1,active(X2)) -> __#(X1,X2) __#(active(X1),X2) -> __#(X1,X2) __#(X1,mark(X2)) -> __#(X1,X2) __#(mark(X1),X2) -> __#(X1,X2) TRS: active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z))) active(__(X,nil())) -> mark(X) active(__(nil(),X)) -> mark(X) active(and(tt(),X)) -> mark(X) active(isList(V)) -> mark(isNeList(V)) active(isList(nil())) -> mark(tt()) active(isList(__(V1,V2))) -> mark(and(isList(V1),isList(V2))) active(isNeList(V)) -> mark(isQid(V)) active(isNeList(__(V1,V2))) -> mark(and(isList(V1),isNeList(V2))) active(isNeList(__(V1,V2))) -> mark(and(isNeList(V1),isList(V2))) active(isNePal(V)) -> mark(isQid(V)) active(isNePal(__(I,__(P,I)))) -> mark(and(isQid(I),isPal(P))) active(isPal(V)) -> mark(isNePal(V)) active(isPal(nil())) -> mark(tt()) active(isQid(a())) -> mark(tt()) active(isQid(e())) -> mark(tt()) active(isQid(i())) -> mark(tt()) active(isQid(o())) -> mark(tt()) active(isQid(u())) -> mark(tt()) mark(__(X1,X2)) -> active(__(mark(X1),mark(X2))) mark(nil()) -> active(nil()) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(tt()) -> active(tt()) mark(isList(X)) -> active(isList(X)) mark(isNeList(X)) -> active(isNeList(X)) mark(isQid(X)) -> active(isQid(X)) mark(isNePal(X)) -> active(isNePal(X)) mark(isPal(X)) -> active(isPal(X)) mark(a()) -> active(a()) mark(e()) -> active(e()) mark(i()) -> active(i()) mark(o()) -> active(o()) mark(u()) -> active(u()) __(mark(X1),X2) -> __(X1,X2) __(X1,mark(X2)) -> __(X1,X2) __(active(X1),X2) -> __(X1,X2) __(X1,active(X2)) -> __(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) and(active(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) isList(mark(X)) -> isList(X) isList(active(X)) -> isList(X) isNeList(mark(X)) -> isNeList(X) isNeList(active(X)) -> isNeList(X) isQid(mark(X)) -> isQid(X) isQid(active(X)) -> isQid(X) isNePal(mark(X)) -> isNePal(X) isNePal(active(X)) -> isNePal(X) isPal(mark(X)) -> isPal(X) isPal(active(X)) -> isPal(X) Open DPs: isNeList#(mark(X)) -> isNeList#(X) isNeList#(active(X)) -> isNeList#(X) TRS: active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z))) active(__(X,nil())) -> mark(X) active(__(nil(),X)) -> mark(X) active(and(tt(),X)) -> mark(X) active(isList(V)) -> mark(isNeList(V)) active(isList(nil())) -> mark(tt()) active(isList(__(V1,V2))) -> mark(and(isList(V1),isList(V2))) active(isNeList(V)) -> mark(isQid(V)) active(isNeList(__(V1,V2))) -> mark(and(isList(V1),isNeList(V2))) active(isNeList(__(V1,V2))) -> mark(and(isNeList(V1),isList(V2))) active(isNePal(V)) -> mark(isQid(V)) active(isNePal(__(I,__(P,I)))) -> mark(and(isQid(I),isPal(P))) active(isPal(V)) -> mark(isNePal(V)) active(isPal(nil())) -> mark(tt()) active(isQid(a())) -> mark(tt()) active(isQid(e())) -> mark(tt()) active(isQid(i())) -> mark(tt()) active(isQid(o())) -> mark(tt()) active(isQid(u())) -> mark(tt()) mark(__(X1,X2)) -> active(__(mark(X1),mark(X2))) mark(nil()) -> active(nil()) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(tt()) -> active(tt()) mark(isList(X)) -> active(isList(X)) mark(isNeList(X)) -> active(isNeList(X)) mark(isQid(X)) -> active(isQid(X)) mark(isNePal(X)) -> active(isNePal(X)) mark(isPal(X)) -> active(isPal(X)) mark(a()) -> active(a()) mark(e()) -> active(e()) mark(i()) -> active(i()) mark(o()) -> active(o()) mark(u()) -> active(u()) __(mark(X1),X2) -> __(X1,X2) __(X1,mark(X2)) -> __(X1,X2) __(active(X1),X2) -> __(X1,X2) __(X1,active(X2)) -> __(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) and(active(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) isList(mark(X)) -> isList(X) isList(active(X)) -> isList(X) isNeList(mark(X)) -> isNeList(X) isNeList(active(X)) -> isNeList(X) isQid(mark(X)) -> isQid(X) isQid(active(X)) -> isQid(X) isNePal(mark(X)) -> isNePal(X) isNePal(active(X)) -> isNePal(X) isPal(mark(X)) -> isPal(X) isPal(active(X)) -> isPal(X) Open DPs: isList#(mark(X)) -> isList#(X) isList#(active(X)) -> isList#(X) TRS: active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z))) active(__(X,nil())) -> mark(X) active(__(nil(),X)) -> mark(X) active(and(tt(),X)) -> mark(X) active(isList(V)) -> mark(isNeList(V)) active(isList(nil())) -> mark(tt()) active(isList(__(V1,V2))) -> mark(and(isList(V1),isList(V2))) active(isNeList(V)) -> mark(isQid(V)) active(isNeList(__(V1,V2))) -> mark(and(isList(V1),isNeList(V2))) active(isNeList(__(V1,V2))) -> mark(and(isNeList(V1),isList(V2))) active(isNePal(V)) -> mark(isQid(V)) active(isNePal(__(I,__(P,I)))) -> mark(and(isQid(I),isPal(P))) active(isPal(V)) -> mark(isNePal(V)) active(isPal(nil())) -> mark(tt()) active(isQid(a())) -> mark(tt()) active(isQid(e())) -> mark(tt()) active(isQid(i())) -> mark(tt()) active(isQid(o())) -> mark(tt()) active(isQid(u())) -> mark(tt()) mark(__(X1,X2)) -> active(__(mark(X1),mark(X2))) mark(nil()) -> active(nil()) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(tt()) -> active(tt()) mark(isList(X)) -> active(isList(X)) mark(isNeList(X)) -> active(isNeList(X)) mark(isQid(X)) -> active(isQid(X)) mark(isNePal(X)) -> active(isNePal(X)) mark(isPal(X)) -> active(isPal(X)) mark(a()) -> active(a()) mark(e()) -> active(e()) mark(i()) -> active(i()) mark(o()) -> active(o()) mark(u()) -> active(u()) __(mark(X1),X2) -> __(X1,X2) __(X1,mark(X2)) -> __(X1,X2) __(active(X1),X2) -> __(X1,X2) __(X1,active(X2)) -> __(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) and(active(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) isList(mark(X)) -> isList(X) isList(active(X)) -> isList(X) isNeList(mark(X)) -> isNeList(X) isNeList(active(X)) -> isNeList(X) isQid(mark(X)) -> isQid(X) isQid(active(X)) -> isQid(X) isNePal(mark(X)) -> isNePal(X) isNePal(active(X)) -> isNePal(X) isPal(mark(X)) -> isPal(X) isPal(active(X)) -> isPal(X) Open DPs: and#(mark(X1),X2) -> and#(X1,X2) and#(X1,active(X2)) -> and#(X1,X2) and#(active(X1),X2) -> and#(X1,X2) and#(X1,mark(X2)) -> and#(X1,X2) TRS: active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z))) active(__(X,nil())) -> mark(X) active(__(nil(),X)) -> mark(X) active(and(tt(),X)) -> mark(X) active(isList(V)) -> mark(isNeList(V)) active(isList(nil())) -> mark(tt()) active(isList(__(V1,V2))) -> mark(and(isList(V1),isList(V2))) active(isNeList(V)) -> mark(isQid(V)) active(isNeList(__(V1,V2))) -> mark(and(isList(V1),isNeList(V2))) active(isNeList(__(V1,V2))) -> mark(and(isNeList(V1),isList(V2))) active(isNePal(V)) -> mark(isQid(V)) active(isNePal(__(I,__(P,I)))) -> mark(and(isQid(I),isPal(P))) active(isPal(V)) -> mark(isNePal(V)) active(isPal(nil())) -> mark(tt()) active(isQid(a())) -> mark(tt()) active(isQid(e())) -> mark(tt()) active(isQid(i())) -> mark(tt()) active(isQid(o())) -> mark(tt()) active(isQid(u())) -> mark(tt()) mark(__(X1,X2)) -> active(__(mark(X1),mark(X2))) mark(nil()) -> active(nil()) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(tt()) -> active(tt()) mark(isList(X)) -> active(isList(X)) mark(isNeList(X)) -> active(isNeList(X)) mark(isQid(X)) -> active(isQid(X)) mark(isNePal(X)) -> active(isNePal(X)) mark(isPal(X)) -> active(isPal(X)) mark(a()) -> active(a()) mark(e()) -> active(e()) mark(i()) -> active(i()) mark(o()) -> active(o()) mark(u()) -> active(u()) __(mark(X1),X2) -> __(X1,X2) __(X1,mark(X2)) -> __(X1,X2) __(active(X1),X2) -> __(X1,X2) __(X1,active(X2)) -> __(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) and(active(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) isList(mark(X)) -> isList(X) isList(active(X)) -> isList(X) isNeList(mark(X)) -> isNeList(X) isNeList(active(X)) -> isNeList(X) isQid(mark(X)) -> isQid(X) isQid(active(X)) -> isQid(X) isNePal(mark(X)) -> isNePal(X) isNePal(active(X)) -> isNePal(X) isPal(mark(X)) -> isPal(X) isPal(active(X)) -> isPal(X) Open DPs: isQid#(mark(X)) -> isQid#(X) isQid#(active(X)) -> isQid#(X) TRS: active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z))) active(__(X,nil())) -> mark(X) active(__(nil(),X)) -> mark(X) active(and(tt(),X)) -> mark(X) active(isList(V)) -> mark(isNeList(V)) active(isList(nil())) -> mark(tt()) active(isList(__(V1,V2))) -> mark(and(isList(V1),isList(V2))) active(isNeList(V)) -> mark(isQid(V)) active(isNeList(__(V1,V2))) -> mark(and(isList(V1),isNeList(V2))) active(isNeList(__(V1,V2))) -> mark(and(isNeList(V1),isList(V2))) active(isNePal(V)) -> mark(isQid(V)) active(isNePal(__(I,__(P,I)))) -> mark(and(isQid(I),isPal(P))) active(isPal(V)) -> mark(isNePal(V)) active(isPal(nil())) -> mark(tt()) active(isQid(a())) -> mark(tt()) active(isQid(e())) -> mark(tt()) active(isQid(i())) -> mark(tt()) active(isQid(o())) -> mark(tt()) active(isQid(u())) -> mark(tt()) mark(__(X1,X2)) -> active(__(mark(X1),mark(X2))) mark(nil()) -> active(nil()) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(tt()) -> active(tt()) mark(isList(X)) -> active(isList(X)) mark(isNeList(X)) -> active(isNeList(X)) mark(isQid(X)) -> active(isQid(X)) mark(isNePal(X)) -> active(isNePal(X)) mark(isPal(X)) -> active(isPal(X)) mark(a()) -> active(a()) mark(e()) -> active(e()) mark(i()) -> active(i()) mark(o()) -> active(o()) mark(u()) -> active(u()) __(mark(X1),X2) -> __(X1,X2) __(X1,mark(X2)) -> __(X1,X2) __(active(X1),X2) -> __(X1,X2) __(X1,active(X2)) -> __(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) and(active(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) isList(mark(X)) -> isList(X) isList(active(X)) -> isList(X) isNeList(mark(X)) -> isNeList(X) isNeList(active(X)) -> isNeList(X) isQid(mark(X)) -> isQid(X) isQid(active(X)) -> isQid(X) isNePal(mark(X)) -> isNePal(X) isNePal(active(X)) -> isNePal(X) isPal(mark(X)) -> isPal(X) isPal(active(X)) -> isPal(X) Open DPs: isPal#(mark(X)) -> isPal#(X) isPal#(active(X)) -> isPal#(X) TRS: active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z))) active(__(X,nil())) -> mark(X) active(__(nil(),X)) -> mark(X) active(and(tt(),X)) -> mark(X) active(isList(V)) -> mark(isNeList(V)) active(isList(nil())) -> mark(tt()) active(isList(__(V1,V2))) -> mark(and(isList(V1),isList(V2))) active(isNeList(V)) -> mark(isQid(V)) active(isNeList(__(V1,V2))) -> mark(and(isList(V1),isNeList(V2))) active(isNeList(__(V1,V2))) -> mark(and(isNeList(V1),isList(V2))) active(isNePal(V)) -> mark(isQid(V)) active(isNePal(__(I,__(P,I)))) -> mark(and(isQid(I),isPal(P))) active(isPal(V)) -> mark(isNePal(V)) active(isPal(nil())) -> mark(tt()) active(isQid(a())) -> mark(tt()) active(isQid(e())) -> mark(tt()) active(isQid(i())) -> mark(tt()) active(isQid(o())) -> mark(tt()) active(isQid(u())) -> mark(tt()) mark(__(X1,X2)) -> active(__(mark(X1),mark(X2))) mark(nil()) -> active(nil()) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(tt()) -> active(tt()) mark(isList(X)) -> active(isList(X)) mark(isNeList(X)) -> active(isNeList(X)) mark(isQid(X)) -> active(isQid(X)) mark(isNePal(X)) -> active(isNePal(X)) mark(isPal(X)) -> active(isPal(X)) mark(a()) -> active(a()) mark(e()) -> active(e()) mark(i()) -> active(i()) mark(o()) -> active(o()) mark(u()) -> active(u()) __(mark(X1),X2) -> __(X1,X2) __(X1,mark(X2)) -> __(X1,X2) __(active(X1),X2) -> __(X1,X2) __(X1,active(X2)) -> __(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) and(active(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) isList(mark(X)) -> isList(X) isList(active(X)) -> isList(X) isNeList(mark(X)) -> isNeList(X) isNeList(active(X)) -> isNeList(X) isQid(mark(X)) -> isQid(X) isQid(active(X)) -> isQid(X) isNePal(mark(X)) -> isNePal(X) isNePal(active(X)) -> isNePal(X) isPal(mark(X)) -> isPal(X) isPal(active(X)) -> isPal(X) Open DPs: isNePal#(mark(X)) -> isNePal#(X) isNePal#(active(X)) -> isNePal#(X) TRS: active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z))) active(__(X,nil())) -> mark(X) active(__(nil(),X)) -> mark(X) active(and(tt(),X)) -> mark(X) active(isList(V)) -> mark(isNeList(V)) active(isList(nil())) -> mark(tt()) active(isList(__(V1,V2))) -> mark(and(isList(V1),isList(V2))) active(isNeList(V)) -> mark(isQid(V)) active(isNeList(__(V1,V2))) -> mark(and(isList(V1),isNeList(V2))) active(isNeList(__(V1,V2))) -> mark(and(isNeList(V1),isList(V2))) active(isNePal(V)) -> mark(isQid(V)) active(isNePal(__(I,__(P,I)))) -> mark(and(isQid(I),isPal(P))) active(isPal(V)) -> mark(isNePal(V)) active(isPal(nil())) -> mark(tt()) active(isQid(a())) -> mark(tt()) active(isQid(e())) -> mark(tt()) active(isQid(i())) -> mark(tt()) active(isQid(o())) -> mark(tt()) active(isQid(u())) -> mark(tt()) mark(__(X1,X2)) -> active(__(mark(X1),mark(X2))) mark(nil()) -> active(nil()) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(tt()) -> active(tt()) mark(isList(X)) -> active(isList(X)) mark(isNeList(X)) -> active(isNeList(X)) mark(isQid(X)) -> active(isQid(X)) mark(isNePal(X)) -> active(isNePal(X)) mark(isPal(X)) -> active(isPal(X)) mark(a()) -> active(a()) mark(e()) -> active(e()) mark(i()) -> active(i()) mark(o()) -> active(o()) mark(u()) -> active(u()) __(mark(X1),X2) -> __(X1,X2) __(X1,mark(X2)) -> __(X1,X2) __(active(X1),X2) -> __(X1,X2) __(X1,active(X2)) -> __(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) and(active(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) isList(mark(X)) -> isList(X) isList(active(X)) -> isList(X) isNeList(mark(X)) -> isNeList(X) isNeList(active(X)) -> isNeList(X) isQid(mark(X)) -> isQid(X) isQid(active(X)) -> isQid(X) isNePal(mark(X)) -> isNePal(X) isNePal(active(X)) -> isNePal(X) isPal(mark(X)) -> isPal(X) isPal(active(X)) -> isPal(X) Open