YES 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(isNePal(__(I,__(P,I)))) -> 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(isNePal(X)) -> active(isNePal(mark(X))) __(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) isNePal(mark(X)) -> isNePal(X) isNePal(active(X)) -> isNePal(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#(isNePal(__(I,__(P,I)))) -> 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#(isNePal(X)) -> mark#(X) mark#(isNePal(X)) -> isNePal#(mark(X)) mark#(isNePal(X)) -> active#(isNePal(mark(X))) __#(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) 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(isNePal(__(I,__(P,I)))) -> 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(isNePal(X)) -> active(isNePal(mark(X))) __(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) isNePal(mark(X)) -> isNePal(X) isNePal(active(X)) -> isNePal(X) TDG 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#(isNePal(__(I,__(P,I)))) -> 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#(isNePal(X)) -> mark#(X) mark#(isNePal(X)) -> isNePal#(mark(X)) mark#(isNePal(X)) -> active#(isNePal(mark(X))) __#(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) 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(isNePal(__(I,__(P,I)))) -> 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(isNePal(X)) -> active(isNePal(mark(X))) __(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) isNePal(mark(X)) -> isNePal(X) isNePal(active(X)) -> isNePal(X) graph: isNePal#(mark(X)) -> isNePal#(X) -> isNePal#(active(X)) -> isNePal#(X) isNePal#(mark(X)) -> isNePal#(X) -> isNePal#(mark(X)) -> isNePal#(X) isNePal#(active(X)) -> isNePal#(X) -> isNePal#(active(X)) -> isNePal#(X) isNePal#(active(X)) -> isNePal#(X) -> isNePal#(mark(X)) -> isNePal#(X) and#(mark(X1),X2) -> and#(X1,X2) -> and#(X1,active(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,mark(X2)) -> and#(X1,X2) and#(mark(X1),X2) -> and#(X1,X2) -> and#(mark(X1),X2) -> and#(X1,X2) and#(active(X1),X2) -> and#(X1,X2) -> and#(X1,active(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,mark(X2)) -> and#(X1,X2) and#(active(X1),X2) -> and#(X1,X2) -> and#(mark(X1),X2) -> and#(X1,X2) and#(X1,mark(X2)) -> and#(X1,X2) -> and#(X1,active(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,mark(X2)) -> and#(X1,X2) and#(X1,mark(X2)) -> and#(X1,X2) -> and#(mark(X1),X2) -> and#(X1,X2) and#(X1,active(X2)) -> and#(X1,X2) -> and#(X1,active(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,mark(X2)) -> and#(X1,X2) and#(X1,active(X2)) -> and#(X1,X2) -> and#(mark(X1),X2) -> and#(X1,X2) mark#(isNePal(X)) -> isNePal#(mark(X)) -> isNePal#(active(X)) -> isNePal#(X) mark#(isNePal(X)) -> isNePal#(mark(X)) -> isNePal#(mark(X)) -> isNePal#(X) mark#(isNePal(X)) -> mark#(X) -> mark#(isNePal(X)) -> active#(isNePal(mark(X))) mark#(isNePal(X)) -> mark#(X) -> mark#(isNePal(X)) -> isNePal#(mark(X)) mark#(isNePal(X)) -> mark#(X) -> mark#(isNePal(X)) -> mark#(X) mark#(isNePal(X)) -> mark#(X) -> mark#(tt()) -> active#(tt()) mark#(isNePal(X)) -> mark#(X) -> mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) mark#(isNePal(X)) -> mark#(X) -> mark#(and(X1,X2)) -> and#(mark(X1),X2) mark#(isNePal(X)) -> mark#(X) -> mark#(and(X1,X2)) -> mark#(X1) mark#(isNePal(X)) -> mark#(X) -> mark#(nil()) -> active#(nil()) mark#(isNePal(X)) -> mark#(X) -> mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) mark#(isNePal(X)) -> mark#(X) -> mark#(__(X1,X2)) -> __#(mark(X1),mark(X2)) mark#(isNePal(X)) -> mark#(X) -> mark#(__(X1,X2)) -> mark#(X1) mark#(isNePal(X)) -> mark#(X) -> mark#(__(X1,X2)) -> mark#(X2) mark#(isNePal(X)) -> active#(isNePal(mark(X))) -> active#(isNePal(__(I,__(P,I)))) -> mark#(tt()) mark#(isNePal(X)) -> active#(isNePal(mark(X))) -> active#(and(tt(),X)) -> mark#(X) mark#(isNePal(X)) -> active#(isNePal(mark(X))) -> active#(__(nil(),X)) -> mark#(X) mark#(isNePal(X)) -> active#(isNePal(mark(X))) -> active#(__(X,nil())) -> mark#(X) mark#(isNePal(X)) -> active#(isNePal(mark(X))) -> active#(__(__(X,Y),Z)) -> mark#(__(X,__(Y,Z))) mark#(isNePal(X)) -> active#(isNePal(mark(X))) -> active#(__(__(X,Y),Z)) -> __#(X,__(Y,Z)) mark#(isNePal(X)) -> active#(isNePal(mark(X))) -> active#(__(__(X,Y),Z)) -> __#(Y,Z) mark#(and(X1,X2)) -> and#(mark(X1),X2) -> and#(X1,active(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,mark(X2)) -> and#(X1,X2) mark#(and(X1,X2)) -> and#(mark(X1),X2) -> and#(mark(X1),X2) -> and#(X1,X2) mark#(and(X1,X2)) -> mark#(X1) -> mark#(isNePal(X)) -> active#(isNePal(mark(X))) mark#(and(X1,X2)) -> mark#(X1) -> mark#(isNePal(X)) -> isNePal#(mark(X)) mark#(and(X1,X2)) -> mark#(X1) -> mark#(isNePal(X)) -> mark#(X) mark#(and(X1,X2)) -> mark#(X1) -> mark#(tt()) -> active#(tt()) mark#(and(X1,X2)) -> mark#(X1) -> mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) mark#(and(X1,X2)) -> mark#(X1) -> mark#(and(X1,X2)) -> and#(mark(X1),X2) mark#(and(X1,X2)) -> mark#(X1) -> mark#(and(X1,X2)) -> mark#(X1) mark#(and(X1,X2)) -> mark#(X1) -> mark#(nil()) -> active#(nil()) mark#(and(X1,X2)) -> mark#(X1) -> mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) mark#(and(X1,X2)) -> mark#(X1) -> mark#(__(X1,X2)) -> __#(mark(X1),mark(X2)) mark#(and(X1,X2)) -> mark#(X1) -> mark#(__(X1,X2)) -> mark#(X1) mark#(and(X1,X2)) -> mark#(X1) -> mark#(__(X1,X2)) -> mark#(X2) mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) -> active#(isNePal(__(I,__(P,I)))) -> mark#(tt()) 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#(__(nil(),X)) -> mark#(X) mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) -> active#(__(X,nil())) -> mark#(X) 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,Y),Z)) -> __#(X,__(Y,Z)) mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) -> active#(__(__(X,Y),Z)) -> __#(Y,Z) mark#(tt()) -> active#(tt()) -> active#(isNePal(__(I,__(P,I)))) -> mark#(tt()) mark#(tt()) -> active#(tt()) -> active#(and(tt(),X)) -> mark#(X) mark#(tt()) -> active#(tt()) -> active#(__(nil(),X)) -> mark#(X) mark#(tt()) -> active#(tt()) -> active#(__(X,nil())) -> mark#(X) mark#(tt()) -> active#(tt()) -> active#(__(__(X,Y),Z)) -> mark#(__(X,__(Y,Z))) mark#(tt()) -> active#(tt()) -> active#(__(__(X,Y),Z)) -> __#(X,__(Y,Z)) mark#(tt()) -> active#(tt()) -> active#(__(__(X,Y),Z)) -> __#(Y,Z) mark#(nil()) -> active#(nil()) -> active#(isNePal(__(I,__(P,I)))) -> mark#(tt()) mark#(nil()) -> active#(nil()) -> active#(and(tt(),X)) -> mark#(X) mark#(nil()) -> active#(nil()) -> active#(__(nil(),X)) -> mark#(X) mark#(nil()) -> active#(nil()) -> active#(__(X,nil())) -> mark#(X) mark#(nil()) -> active#(nil()) -> active#(__(__(X,Y),Z)) -> mark#(__(X,__(Y,Z))) mark#(nil()) -> active#(nil()) -> active#(__(__(X,Y),Z)) -> __#(X,__(Y,Z)) mark#(nil()) -> active#(nil()) -> active#(__(__(X,Y),Z)) -> __#(Y,Z) mark#(__(X1,X2)) -> mark#(X2) -> mark#(isNePal(X)) -> active#(isNePal(mark(X))) mark#(__(X1,X2)) -> mark#(X2) -> mark#(isNePal(X)) -> isNePal#(mark(X)) mark#(__(X1,X2)) -> mark#(X2) -> mark#(isNePal(X)) -> mark#(X) mark#(__(X1,X2)) -> mark#(X2) -> mark#(tt()) -> active#(tt()) mark#(__(X1,X2)) -> mark#(X2) -> mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) mark#(__(X1,X2)) -> mark#(X2) -> mark#(and(X1,X2)) -> and#(mark(X1),X2) mark#(__(X1,X2)) -> mark#(X2) -> mark#(and(X1,X2)) -> mark#(X1) mark#(__(X1,X2)) -> mark#(X2) -> mark#(nil()) -> active#(nil()) mark#(__(X1,X2)) -> mark#(X2) -> mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) mark#(__(X1,X2)) -> mark#(X2) -> mark#(__(X1,X2)) -> __#(mark(X1),mark(X2)) mark#(__(X1,X2)) -> mark#(X2) -> mark#(__(X1,X2)) -> mark#(X1) mark#(__(X1,X2)) -> mark#(X2) -> mark#(__(X1,X2)) -> mark#(X2) mark#(__(X1,X2)) -> mark#(X1) -> mark#(isNePal(X)) -> active#(isNePal(mark(X))) mark#(__(X1,X2)) -> mark#(X1) -> mark#(isNePal(X)) -> isNePal#(mark(X)) mark#(__(X1,X2)) -> mark#(X1) -> mark#(isNePal(X)) -> mark#(X) mark#(__(X1,X2)) -> mark#(X1) -> mark#(tt()) -> active#(tt()) mark#(__(X1,X2)) -> mark#(X1) -> mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) mark#(__(X1,X2)) -> mark#(X1) -> mark#(and(X1,X2)) -> and#(mark(X1),X2) mark#(__(X1,X2)) -> mark#(X1) -> mark#(and(X1,X2)) -> mark#(X1) mark#(__(X1,X2)) -> mark#(X1) -> mark#(nil()) -> active#(nil()) mark#(__(X1,X2)) -> mark#(X1) -> mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) mark#(__(X1,X2)) -> mark#(X1) -> mark#(__(X1,X2)) -> __#(mark(X1),mark(X2)) mark#(__(X1,X2)) -> mark#(X1) -> mark#(__(X1,X2)) -> mark#(X1) mark#(__(X1,X2)) -> mark#(X1) -> mark#(__(X1,X2)) -> mark#(X2) mark#(__(X1,X2)) -> __#(mark(X1),mark(X2)) -> __#(X1,active(X2)) -> __#(X1,X2) mark#(__(X1,X2)) -> __#(mark(X1),mark(X2)) -> __#(active(X1),X2) -> __#(X1,X2) mark#(__(X1,X2)) -> __#(mark(X1),mark(X2)) -> __#(X1,mark(X2)) -> __#(X1,X2) mark#(__(X1,X2)) -> __#(mark(X1),mark(X2)) -> __#(mark(X1),X2) -> __#(X1,X2) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) -> active#(isNePal(__(I,__(P,I)))) -> mark#(tt()) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) -> active#(and(tt(),X)) -> mark#(X) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) -> active#(__(nil(),X)) -> mark#(X) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) -> active#(__(X,nil())) -> mark#(X) 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,Y),Z)) -> __#(X,__(Y,Z)) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) -> active#(__(__(X,Y),Z)) -> __#(Y,Z) __#(mark(X1),X2) -> __#(X1,X2) -> __#(X1,active(X2)) -> __#(X1,X2) __#(mark(X1),X2) -> __#(X1,X2) -> __#(active(X1),X2) -> __#(X1,X2) __#(mark(X1),X2) -> __#(X1,X2) -> __#(X1,mark(X2)) -> __#(X1,X2) __#(mark(X1),X2) -> __#(X1,X2) -> __#(mark(X1),X2) -> __#(X1,X2) __#(active(X1),X2) -> __#(X1,X2) -> __#(X1,active(X2)) -> __#(X1,X2) __#(active(X1),X2) -> __#(X1,X2) -> __#(active(X1),X2) -> __#(X1,X2) __#(active(X1),X2) -> __#(X1,X2) -> __#(X1,mark(X2)) -> __#(X1,X2) __#(active(X1),X2) -> __#(X1,X2) -> __#(mark(X1),X2) -> __#(X1,X2) __#(X1,mark(X2)) -> __#(X1,X2) -> __#(X1,active(X2)) -> __#(X1,X2) __#(X1,mark(X2)) -> __#(X1,X2) -> __#(active(X1),X2) -> __#(X1,X2) __#(X1,mark(X2)) -> __#(X1,X2) -> __#(X1,mark(X2)) -> __#(X1,X2) __#(X1,mark(X2)) -> __#(X1,X2) -> __#(mark(X1),X2) -> __#(X1,X2) __#(X1,active(X2)) -> __#(X1,X2) -> __#(X1,active(X2)) -> __#(X1,X2) __#(X1,active(X2)) -> __#(X1,X2) -> __#(active(X1),X2) -> __#(X1,X2) __#(X1,active(X2)) -> __#(X1,X2) -> __#(X1,mark(X2)) -> __#(X1,X2) __#(X1,active(X2)) -> __#(X1,X2) -> __#(mark(X1),X2) -> __#(X1,X2) active#(isNePal(__(I,__(P,I)))) -> mark#(tt()) -> mark#(isNePal(X)) -> active#(isNePal(mark(X))) active#(isNePal(__(I,__(P,I)))) -> mark#(tt()) -> mark#(isNePal(X)) -> isNePal#(mark(X)) active#(isNePal(__(I,__(P,I)))) -> mark#(tt()) -> mark#(isNePal(X)) -> mark#(X) active#(isNePal(__(I,__(P,I)))) -> mark#(tt()) -> mark#(tt()) -> active#(tt()) active#(isNePal(__(I,__(P,I)))) -> mark#(tt()) -> mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) active#(isNePal(__(I,__(P,I)))) -> mark#(tt()) -> mark#(and(X1,X2)) -> and#(mark(X1),X2) active#(isNePal(__(I,__(P,I)))) -> mark#(tt()) -> mark#(and(X1,X2)) -> mark#(X1) active#(isNePal(__(I,__(P,I)))) -> mark#(tt()) -> mark#(nil()) -> active#(nil()) active#(isNePal(__(I,__(P,I)))) -> mark#(tt()) -> mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) active#(isNePal(__(I,__(P,I)))) -> mark#(tt()) -> mark#(__(X1,X2)) -> __#(mark(X1),mark(X2)) active#(isNePal(__(I,__(P,I)))) -> mark#(tt()) -> mark#(__(X1,X2)) -> mark#(X1) active#(isNePal(__(I,__(P,I)))) -> mark#(tt()) -> mark#(__(X1,X2)) -> mark#(X2) active#(and(tt(),X)) -> mark#(X) -> mark#(isNePal(X)) -> active#(isNePal(mark(X))) active#(and(tt(),X)) -> mark#(X) -> mark#(isNePal(X)) -> isNePal#(mark(X)) active#(and(tt(),X)) -> mark#(X) -> mark#(isNePal(X)) -> mark#(X) active#(and(tt(),X)) -> mark#(X) -> mark#(tt()) -> active#(tt()) active#(and(tt(),X)) -> mark#(X) -> mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) active#(and(tt(),X)) -> mark#(X) -> mark#(and(X1,X2)) -> and#(mark(X1),X2) active#(and(tt(),X)) -> mark#(X) -> mark#(and(X1,X2)) -> mark#(X1) active#(and(tt(),X)) -> mark#(X) -> mark#(nil()) -> active#(nil()) active#(and(tt(),X)) -> mark#(X) -> mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) active#(and(tt(),X)) -> mark#(X) -> mark#(__(X1,X2)) -> __#(mark(X1),mark(X2)) active#(and(tt(),X)) -> mark#(X) -> mark#(__(X1,X2)) -> mark#(X1) active#(and(tt(),X)) -> mark#(X) -> mark#(__(X1,X2)) -> mark#(X2) active#(__(nil(),X)) -> mark#(X) -> mark#(isNePal(X)) -> active#(isNePal(mark(X))) active#(__(nil(),X)) -> mark#(X) -> mark#(isNePal(X)) -> isNePal#(mark(X)) active#(__(nil(),X)) -> mark#(X) -> mark#(isNePal(X)) -> mark#(X) active#(__(nil(),X)) -> mark#(X) -> mark#(tt()) -> active#(tt()) active#(__(nil(),X)) -> mark#(X) -> mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) active#(__(nil(),X)) -> mark#(X) -> mark#(and(X1,X2)) -> and#(mark(X1),X2) active#(__(nil(),X)) -> mark#(X) -> mark#(and(X1,X2)) -> mark#(X1) active#(__(nil(),X)) -> mark#(X) -> mark#(nil()) -> active#(nil()) active#(__(nil(),X)) -> mark#(X) -> mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) active#(__(nil(),X)) -> mark#(X) -> mark#(__(X1,X2)) -> __#(mark(X1),mark(X2)) active#(__(nil(),X)) -> mark#(X) -> mark#(__(X1,X2)) -> mark#(X1) active#(__(nil(),X)) -> mark#(X) -> mark#(__(X1,X2)) -> mark#(X2) active#(__(__(X,Y),Z)) -> mark#(__(X,__(Y,Z))) -> mark#(isNePal(X)) -> active#(isNePal(mark(X))) active#(__(__(X,Y),Z)) -> mark#(__(X,__(Y,Z))) -> mark#(isNePal(X)) -> isNePal#(mark(X)) active#(__(__(X,Y),Z)) -> mark#(__(X,__(Y,Z))) -> mark#(isNePal(X)) -> mark#(X) active#(__(__(X,Y),Z)) -> mark#(__(X,__(Y,Z))) -> mark#(tt()) -> active#(tt()) 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#(and(X1,X2)) -> and#(mark(X1),X2) active#(__(__(X,Y),Z)) -> mark#(__(X,__(Y,Z))) -> mark#(and(X1,X2)) -> mark#(X1) active#(__(__(X,Y),Z)) -> mark#(__(X,__(Y,Z))) -> mark#(nil()) -> active#(nil()) 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#(__(X1,X2)) -> __#(mark(X1),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#(X2) active#(__(__(X,Y),Z)) -> __#(Y,Z) -> __#(X1,active(X2)) -> __#(X1,X2) active#(__(__(X,Y),Z)) -> __#(Y,Z) -> __#(active(X1),X2) -> __#(X1,X2) active#(__(__(X,Y),Z)) -> __#(Y,Z) -> __#(X1,mark(X2)) -> __#(X1,X2) active#(__(__(X,Y),Z)) -> __#(Y,Z) -> __#(mark(X1),X2) -> __#(X1,X2) active#(__(__(X,Y),Z)) -> __#(X,__(Y,Z)) -> __#(X1,active(X2)) -> __#(X1,X2) active#(__(__(X,Y),Z)) -> __#(X,__(Y,Z)) -> __#(active(X1),X2) -> __#(X1,X2) active#(__(__(X,Y),Z)) -> __#(X,__(Y,Z)) -> __#(X1,mark(X2)) -> __#(X1,X2) active#(__(__(X,Y),Z)) -> __#(X,__(Y,Z)) -> __#(mark(X1),X2) -> __#(X1,X2) active#(__(X,nil())) -> mark#(X) -> mark#(isNePal(X)) -> active#(isNePal(mark(X))) active#(__(X,nil())) -> mark#(X) -> mark#(isNePal(X)) -> isNePal#(mark(X)) active#(__(X,nil())) -> mark#(X) -> mark#(isNePal(X)) -> mark#(X) active#(__(X,nil())) -> mark#(X) -> mark#(tt()) -> active#(tt()) active#(__(X,nil())) -> mark#(X) -> mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) active#(__(X,nil())) -> mark#(X) -> mark#(and(X1,X2)) -> and#(mark(X1),X2) active#(__(X,nil())) -> mark#(X) -> mark#(and(X1,X2)) -> mark#(X1) active#(__(X,nil())) -> mark#(X) -> mark#(nil()) -> active#(nil()) active#(__(X,nil())) -> mark#(X) -> mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) active#(__(X,nil())) -> mark#(X) -> mark#(__(X1,X2)) -> __#(mark(X1),mark(X2)) active#(__(X,nil())) -> mark#(X) -> mark#(__(X1,X2)) -> mark#(X1) active#(__(X,nil())) -> mark#(X) -> mark#(__(X1,X2)) -> mark#(X2) SCC Processor: #sccs: 4 #rules: 24 #arcs: 197/841 DPs: mark#(isNePal(X)) -> mark#(X) mark#(__(X1,X2)) -> mark#(X2) mark#(__(X1,X2)) -> mark#(X1) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) active#(__(__(X,Y),Z)) -> mark#(__(X,__(Y,Z))) mark#(nil()) -> active#(nil()) active#(__(X,nil())) -> mark#(X) mark#(and(X1,X2)) -> mark#(X1) mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) active#(__(nil(),X)) -> mark#(X) mark#(tt()) -> active#(tt()) active#(and(tt(),X)) -> mark#(X) mark#(isNePal(X)) -> active#(isNePal(mark(X))) active#(isNePal(__(I,__(P,I)))) -> mark#(tt()) 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(isNePal(__(I,__(P,I)))) -> 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(isNePal(X)) -> active(isNePal(mark(X))) __(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) isNePal(mark(X)) -> isNePal(X) isNePal(active(X)) -> isNePal(X) EDG Processor: DPs: mark#(isNePal(X)) -> mark#(X) mark#(__(X1,X2)) -> mark#(X2) mark#(__(X1,X2)) -> mark#(X1) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) active#(__(__(X,Y),Z)) -> mark#(__(X,__(Y,Z))) mark#(nil()) -> active#(nil()) active#(__(X,nil())) -> mark#(X) mark#(and(X1,X2)) -> mark#(X1) mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) active#(__(nil(),X)) -> mark#(X) mark#(tt()) -> active#(tt()) active#(and(tt(),X)) -> mark#(X) mark#(isNePal(X)) -> active#(isNePal(mark(X))) active#(isNePal(__(I,__(P,I)))) -> mark#(tt()) 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(isNePal(__(I,__(P,I)))) -> 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(isNePal(X)) -> active(isNePal(mark(X))) __(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) isNePal(mark(X)) -> isNePal(X) isNePal(active(X)) -> isNePal(X) graph: mark#(isNePal(X)) -> mark#(X) -> mark#(__(X1,X2)) -> mark#(X2) mark#(isNePal(X)) -> mark#(X) -> mark#(__(X1,X2)) -> mark#(X1) mark#(isNePal(X)) -> mark#(X) -> mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) mark#(isNePal(X)) -> mark#(X) -> mark#(nil()) -> active#(nil()) mark#(isNePal(X)) -> mark#(X) -> mark#(and(X1,X2)) -> mark#(X1) mark#(isNePal(X)) -> mark#(X) -> mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) mark#(isNePal(X)) -> mark#(X) -> mark#(tt()) -> active#(tt()) mark#(isNePal(X)) -> mark#(X) -> mark#(isNePal(X)) -> mark#(X) mark#(isNePal(X)) -> mark#(X) -> mark#(isNePal(X)) -> active#(isNePal(mark(X))) mark#(isNePal(X)) -> active#(isNePal(mark(X))) -> active#(__(__(X,Y),Z)) -> mark#(__(X,__(Y,Z))) mark#(isNePal(X)) -> active#(isNePal(mark(X))) -> active#(__(X,nil())) -> mark#(X) mark#(isNePal(X)) -> active#(isNePal(mark(X))) -> active#(__(nil(),X)) -> mark#(X) mark#(isNePal(X)) -> active#(isNePal(mark(X))) -> active#(and(tt(),X)) -> mark#(X) mark#(isNePal(X)) -> active#(isNePal(mark(X))) -> active#(isNePal(__(I,__(P,I)))) -> mark#(tt()) 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)) -> 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)) -> active#(and(mark(X1),X2)) mark#(and(X1,X2)) -> mark#(X1) -> mark#(tt()) -> active#(tt()) mark#(and(X1,X2)) -> mark#(X1) -> mark#(isNePal(X)) -> mark#(X) mark#(and(X1,X2)) -> mark#(X1) -> mark#(isNePal(X)) -> active#(isNePal(mark(X))) 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#(isNePal(__(I,__(P,I)))) -> 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)) -> 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)) -> active#(and(mark(X1),X2)) mark#(__(X1,X2)) -> mark#(X2) -> mark#(tt()) -> active#(tt()) mark#(__(X1,X2)) -> mark#(X2) -> mark#(isNePal(X)) -> mark#(X) mark#(__(X1,X2)) -> mark#(X2) -> mark#(isNePal(X)) -> active#(isNePal(mark(X))) 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)) -> 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)) -> active#(and(mark(X1),X2)) mark#(__(X1,X2)) -> mark#(X1) -> mark#(tt()) -> active#(tt()) mark#(__(X1,X2)) -> mark#(X1) -> mark#(isNePal(X)) -> mark#(X) mark#(__(X1,X2)) -> mark#(X1) -> mark#(isNePal(X)) -> active#(isNePal(mark(X))) 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#(isNePal(__(I,__(P,I)))) -> mark#(tt()) active#(isNePal(__(I,__(P,I)))) -> mark#(tt()) -> mark#(tt()) -> active#(tt()) 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)) -> 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)) -> active#(and(mark(X1),X2)) active#(and(tt(),X)) -> mark#(X) -> mark#(tt()) -> active#(tt()) active#(and(tt(),X)) -> mark#(X) -> mark#(isNePal(X)) -> mark#(X) active#(and(tt(),X)) -> mark#(X) -> mark#(isNePal(X)) -> active#(isNePal(mark(X))) 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)) -> 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)) -> active#(and(mark(X1),X2)) active#(__(nil(),X)) -> mark#(X) -> mark#(tt()) -> active#(tt()) active#(__(nil(),X)) -> mark#(X) -> mark#(isNePal(X)) -> mark#(X) active#(__(nil(),X)) -> mark#(X) -> mark#(isNePal(X)) -> active#(isNePal(mark(X))) 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)) -> 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)) -> active#(and(mark(X1),X2)) active#(__(__(X,Y),Z)) -> mark#(__(X,__(Y,Z))) -> mark#(isNePal(X)) -> mark#(X) active#(__(__(X,Y),Z)) -> mark#(__(X,__(Y,Z))) -> mark#(isNePal(X)) -> active#(isNePal(mark(X))) 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)) -> 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)) -> active#(and(mark(X1),X2)) active#(__(X,nil())) -> mark#(X) -> mark#(tt()) -> active#(tt()) active#(__(X,nil())) -> mark#(X) -> mark#(isNePal(X)) -> mark#(X) active#(__(X,nil())) -> mark#(X) -> mark#(isNePal(X)) -> active#(isNePal(mark(X))) SCC Processor: #sccs: 1 #rules: 11 #arcs: 86/196 DPs: mark#(isNePal(X)) -> mark#(X) mark#(isNePal(X)) -> active#(isNePal(mark(X))) active#(and(tt(),X)) -> mark#(X) mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) active#(__(nil(),X)) -> mark#(X) mark#(and(X1,X2)) -> mark#(X1) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(X2))) active#(__(X,nil())) -> mark#(X) mark#(__(X1,X2)) -> mark#(X1) mark#(__(X1,X2)) -> mark#(X2) 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(isNePal(__(I,__(P,I)))) -> 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(isNePal(X)) -> active(isNePal(mark(X))) __(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) isNePal(mark(X)) -> isNePal(X) isNePal(active(X)) -> isNePal(X) KBO Processor: argument filtering: pi(__) = [0,1] pi(active) = 0 pi(mark) = 0 pi(nil) = [] pi(tt) = [] pi(and) = [0,1] pi(isNePal) = 0 pi(active#) = 0 pi(mark#) = 0 weight function: w0 = 1 w(mark#) = w(active#) = w(isNePal) = w(tt) = w(nil) = w(mark) = w( __) = 1 w(and) = w(active) = 0 precedence: mark# ~ active# ~ isNePal ~ and ~ tt ~ nil ~ mark ~ active ~ __ problem: DPs: mark#(isNePal(X)) -> mark#(X) mark#(isNePal(X)) -> active#(isNePal(mark(X))) mark#(and(X1,X2)) -> active#(and(mark(X1),X2)) mark#(__(X1,X2)) -> active#(__(mark(X1),mark(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(isNePal(__(I,__(P,I)))) -> 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(isNePal(X)) -> active(isNePal(mark(X))) __(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) isNePal(mark(X)) -> isNePal(X) isNePal(active(X)) -> isNePal(X) SCC Processor: #sccs: 1 #rules: 1 #arcs: 68/16 DPs: mark#(isNePal(X)) -> mark#(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(isNePal(__(I,__(P,I)))) -> 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(isNePal(X)) -> active(isNePal(mark(X))) __(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) isNePal(mark(X)) -> isNePal(X) isNePal(active(X)) -> isNePal(X) Subterm Criterion Processor: simple projection: pi(mark#) = 0 problem: DPs: 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(isNePal(__(I,__(P,I)))) -> 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(isNePal(X)) -> active(isNePal(mark(X))) __(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) isNePal(mark(X)) -> isNePal(X) isNePal(active(X)) -> isNePal(X) Qed DPs: __#(mark(X1),X2) -> __#(X1,X2) __#(X1,mark(X2)) -> __#(X1,X2) __#(active(X1),X2) -> __#(X1,X2) __#(X1,active(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(isNePal(__(I,__(P,I)))) -> 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(isNePal(X)) -> active(isNePal(mark(X))) __(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) isNePal(mark(X)) -> isNePal(X) isNePal(active(X)) -> isNePal(X) Subterm Criterion Processor: simple projection: pi(__#) = 1 problem: DPs: __#(mark(X1),X2) -> __#(X1,X2) __#(active(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(isNePal(__(I,__(P,I)))) -> 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(isNePal(X)) -> active(isNePal(mark(X))) __(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) isNePal(mark(X)) -> isNePal(X) isNePal(active(X)) -> isNePal(X) Subterm Criterion Processor: simple projection: pi(__#) = 0 problem: DPs: 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(isNePal(__(I,__(P,I)))) -> 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(isNePal(X)) -> active(isNePal(mark(X))) __(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) isNePal(mark(X)) -> isNePal(X) isNePal(active(X)) -> isNePal(X) Qed DPs: 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) 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(isNePal(__(I,__(P,I)))) -> 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(isNePal(X)) -> active(isNePal(mark(X))) __(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) isNePal(mark(X)) -> isNePal(X) isNePal(active(X)) -> isNePal(X) Subterm Criterion Processor: simple projection: pi(and#) = 1 problem: DPs: and#(mark(X1),X2) -> and#(X1,X2) and#(active(X1),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(isNePal(__(I,__(P,I)))) -> 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(isNePal(X)) -> active(isNePal(mark(X))) __(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) isNePal(mark(X)) -> isNePal(X) isNePal(active(X)) -> isNePal(X) Subterm Criterion Processor: simple projection: pi(and#) = 0 problem: DPs: 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(isNePal(__(I,__(P,I)))) -> 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(isNePal(X)) -> active(isNePal(mark(X))) __(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) isNePal(mark(X)) -> isNePal(X) isNePal(active(X)) -> isNePal(X) Qed 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(isNePal(__(I,__(P,I)))) -> 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(isNePal(X)) -> active(isNePal(mark(X))) __(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) isNePal(mark(X)) -> isNePal(X) isNePal(active(X)) -> isNePal(X) Subterm Criterion Processor: simple projection: pi(isNePal#) = 0 problem: DPs: 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(isNePal(__(I,__(P,I)))) -> 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(isNePal(X)) -> active(isNePal(mark(X))) __(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) isNePal(mark(X)) -> isNePal(X) isNePal(active(X)) -> isNePal(X) Qed