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()) active(__(X1,X2)) -> __(active(X1),X2) active(__(X1,X2)) -> __(X1,active(X2)) active(and(X1,X2)) -> and(active(X1),X2) active(isNePal(X)) -> isNePal(active(X)) __(mark(X1),X2) -> mark(__(X1,X2)) __(X1,mark(X2)) -> mark(__(X1,X2)) and(mark(X1),X2) -> mark(and(X1,X2)) isNePal(mark(X)) -> mark(isNePal(X)) proper(__(X1,X2)) -> __(proper(X1),proper(X2)) proper(nil()) -> ok(nil()) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(tt()) -> ok(tt()) proper(isNePal(X)) -> isNePal(proper(X)) __(ok(X1),ok(X2)) -> ok(__(X1,X2)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) isNePal(ok(X)) -> ok(isNePal(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Proof: DP Processor: DPs: active#(__(__(X,Y),Z)) -> __#(Y,Z) active#(__(__(X,Y),Z)) -> __#(X,__(Y,Z)) active#(__(X1,X2)) -> active#(X1) active#(__(X1,X2)) -> __#(active(X1),X2) active#(__(X1,X2)) -> active#(X2) active#(__(X1,X2)) -> __#(X1,active(X2)) active#(and(X1,X2)) -> active#(X1) active#(and(X1,X2)) -> and#(active(X1),X2) active#(isNePal(X)) -> active#(X) active#(isNePal(X)) -> isNePal#(active(X)) __#(mark(X1),X2) -> __#(X1,X2) __#(X1,mark(X2)) -> __#(X1,X2) and#(mark(X1),X2) -> and#(X1,X2) isNePal#(mark(X)) -> isNePal#(X) proper#(__(X1,X2)) -> proper#(X2) proper#(__(X1,X2)) -> proper#(X1) proper#(__(X1,X2)) -> __#(proper(X1),proper(X2)) proper#(and(X1,X2)) -> proper#(X2) proper#(and(X1,X2)) -> proper#(X1) proper#(and(X1,X2)) -> and#(proper(X1),proper(X2)) proper#(isNePal(X)) -> proper#(X) proper#(isNePal(X)) -> isNePal#(proper(X)) __#(ok(X1),ok(X2)) -> __#(X1,X2) and#(ok(X1),ok(X2)) -> and#(X1,X2) isNePal#(ok(X)) -> isNePal#(X) top#(mark(X)) -> proper#(X) top#(mark(X)) -> top#(proper(X)) top#(ok(X)) -> active#(X) top#(ok(X)) -> top#(active(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()) active(__(X1,X2)) -> __(active(X1),X2) active(__(X1,X2)) -> __(X1,active(X2)) active(and(X1,X2)) -> and(active(X1),X2) active(isNePal(X)) -> isNePal(active(X)) __(mark(X1),X2) -> mark(__(X1,X2)) __(X1,mark(X2)) -> mark(__(X1,X2)) and(mark(X1),X2) -> mark(and(X1,X2)) isNePal(mark(X)) -> mark(isNePal(X)) proper(__(X1,X2)) -> __(proper(X1),proper(X2)) proper(nil()) -> ok(nil()) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(tt()) -> ok(tt()) proper(isNePal(X)) -> isNePal(proper(X)) __(ok(X1),ok(X2)) -> ok(__(X1,X2)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) isNePal(ok(X)) -> ok(isNePal(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) TDG Processor: DPs: active#(__(__(X,Y),Z)) -> __#(Y,Z) active#(__(__(X,Y),Z)) -> __#(X,__(Y,Z)) active#(__(X1,X2)) -> active#(X1) active#(__(X1,X2)) -> __#(active(X1),X2) active#(__(X1,X2)) -> active#(X2) active#(__(X1,X2)) -> __#(X1,active(X2)) active#(and(X1,X2)) -> active#(X1) active#(and(X1,X2)) -> and#(active(X1),X2) active#(isNePal(X)) -> active#(X) active#(isNePal(X)) -> isNePal#(active(X)) __#(mark(X1),X2) -> __#(X1,X2) __#(X1,mark(X2)) -> __#(X1,X2) and#(mark(X1),X2) -> and#(X1,X2) isNePal#(mark(X)) -> isNePal#(X) proper#(__(X1,X2)) -> proper#(X2) proper#(__(X1,X2)) -> proper#(X1) proper#(__(X1,X2)) -> __#(proper(X1),proper(X2)) proper#(and(X1,X2)) -> proper#(X2) proper#(and(X1,X2)) -> proper#(X1) proper#(and(X1,X2)) -> and#(proper(X1),proper(X2)) proper#(isNePal(X)) -> proper#(X) proper#(isNePal(X)) -> isNePal#(proper(X)) __#(ok(X1),ok(X2)) -> __#(X1,X2) and#(ok(X1),ok(X2)) -> and#(X1,X2) isNePal#(ok(X)) -> isNePal#(X) top#(mark(X)) -> proper#(X) top#(mark(X)) -> top#(proper(X)) top#(ok(X)) -> active#(X) top#(ok(X)) -> top#(active(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()) active(__(X1,X2)) -> __(active(X1),X2) active(__(X1,X2)) -> __(X1,active(X2)) active(and(X1,X2)) -> and(active(X1),X2) active(isNePal(X)) -> isNePal(active(X)) __(mark(X1),X2) -> mark(__(X1,X2)) __(X1,mark(X2)) -> mark(__(X1,X2)) and(mark(X1),X2) -> mark(and(X1,X2)) isNePal(mark(X)) -> mark(isNePal(X)) proper(__(X1,X2)) -> __(proper(X1),proper(X2)) proper(nil()) -> ok(nil()) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(tt()) -> ok(tt()) proper(isNePal(X)) -> isNePal(proper(X)) __(ok(X1),ok(X2)) -> ok(__(X1,X2)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) isNePal(ok(X)) -> ok(isNePal(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) graph: top#(ok(X)) -> top#(active(X)) -> top#(ok(X)) -> top#(active(X)) top#(ok(X)) -> top#(active(X)) -> top#(ok(X)) -> active#(X) top#(ok(X)) -> top#(active(X)) -> top#(mark(X)) -> top#(proper(X)) top#(ok(X)) -> top#(active(X)) -> top#(mark(X)) -> proper#(X) top#(ok(X)) -> active#(X) -> active#(isNePal(X)) -> isNePal#(active(X)) top#(ok(X)) -> active#(X) -> active#(isNePal(X)) -> active#(X) top#(ok(X)) -> active#(X) -> active#(and(X1,X2)) -> and#(active(X1),X2) top#(ok(X)) -> active#(X) -> active#(and(X1,X2)) -> active#(X1) top#(ok(X)) -> active#(X) -> active#(__(X1,X2)) -> __#(X1,active(X2)) top#(ok(X)) -> active#(X) -> active#(__(X1,X2)) -> active#(X2) top#(ok(X)) -> active#(X) -> active#(__(X1,X2)) -> __#(active(X1),X2) top#(ok(X)) -> active#(X) -> active#(__(X1,X2)) -> active#(X1) top#(ok(X)) -> active#(X) -> active#(__(__(X,Y),Z)) -> __#(X,__(Y,Z)) top#(ok(X)) -> active#(X) -> active#(__(__(X,Y),Z)) -> __#(Y,Z) top#(mark(X)) -> top#(proper(X)) -> top#(ok(X)) -> top#(active(X)) top#(mark(X)) -> top#(proper(X)) -> top#(ok(X)) -> active#(X) top#(mark(X)) -> top#(proper(X)) -> top#(mark(X)) -> top#(proper(X)) top#(mark(X)) -> top#(proper(X)) -> top#(mark(X)) -> proper#(X) top#(mark(X)) -> proper#(X) -> proper#(isNePal(X)) -> isNePal#(proper(X)) top#(mark(X)) -> proper#(X) -> proper#(isNePal(X)) -> proper#(X) top#(mark(X)) -> proper#(X) -> proper#(and(X1,X2)) -> and#(proper(X1),proper(X2)) top#(mark(X)) -> proper#(X) -> proper#(and(X1,X2)) -> proper#(X1) top#(mark(X)) -> proper#(X) -> proper#(and(X1,X2)) -> proper#(X2) top#(mark(X)) -> proper#(X) -> proper#(__(X1,X2)) -> __#(proper(X1),proper(X2)) top#(mark(X)) -> proper#(X) -> proper#(__(X1,X2)) -> proper#(X1) top#(mark(X)) -> proper#(X) -> proper#(__(X1,X2)) -> proper#(X2) proper#(isNePal(X)) -> proper#(X) -> proper#(isNePal(X)) -> isNePal#(proper(X)) proper#(isNePal(X)) -> proper#(X) -> proper#(isNePal(X)) -> proper#(X) proper#(isNePal(X)) -> proper#(X) -> proper#(and(X1,X2)) -> and#(proper(X1),proper(X2)) proper#(isNePal(X)) -> proper#(X) -> proper#(and(X1,X2)) -> proper#(X1) proper#(isNePal(X)) -> proper#(X) -> proper#(and(X1,X2)) -> proper#(X2) proper#(isNePal(X)) -> proper#(X) -> proper#(__(X1,X2)) -> __#(proper(X1),proper(X2)) proper#(isNePal(X)) -> proper#(X) -> proper#(__(X1,X2)) -> proper#(X1) proper#(isNePal(X)) -> proper#(X) -> proper#(__(X1,X2)) -> proper#(X2) proper#(isNePal(X)) -> isNePal#(proper(X)) -> isNePal#(ok(X)) -> isNePal#(X) proper#(isNePal(X)) -> isNePal#(proper(X)) -> isNePal#(mark(X)) -> isNePal#(X) proper#(and(X1,X2)) -> proper#(X2) -> proper#(isNePal(X)) -> isNePal#(proper(X)) proper#(and(X1,X2)) -> proper#(X2) -> proper#(isNePal(X)) -> proper#(X) proper#(and(X1,X2)) -> proper#(X2) -> proper#(and(X1,X2)) -> and#(proper(X1),proper(X2)) proper#(and(X1,X2)) -> proper#(X2) -> proper#(and(X1,X2)) -> proper#(X1) proper#(and(X1,X2)) -> proper#(X2) -> proper#(and(X1,X2)) -> proper#(X2) proper#(and(X1,X2)) -> proper#(X2) -> proper#(__(X1,X2)) -> __#(proper(X1),proper(X2)) proper#(and(X1,X2)) -> proper#(X2) -> proper#(__(X1,X2)) -> proper#(X1) proper#(and(X1,X2)) -> proper#(X2) -> proper#(__(X1,X2)) -> proper#(X2) proper#(and(X1,X2)) -> proper#(X1) -> proper#(isNePal(X)) -> isNePal#(proper(X)) proper#(and(X1,X2)) -> proper#(X1) -> proper#(isNePal(X)) -> proper#(X) proper#(and(X1,X2)) -> proper#(X1) -> proper#(and(X1,X2)) -> and#(proper(X1),proper(X2)) proper#(and(X1,X2)) -> proper#(X1) -> proper#(and(X1,X2)) -> proper#(X1) proper#(and(X1,X2)) -> proper#(X1) -> proper#(and(X1,X2)) -> proper#(X2) proper#(and(X1,X2)) -> proper#(X1) -> proper#(__(X1,X2)) -> __#(proper(X1),proper(X2)) proper#(and(X1,X2)) -> proper#(X1) -> proper#(__(X1,X2)) -> proper#(X1) proper#(and(X1,X2)) -> proper#(X1) -> proper#(__(X1,X2)) -> proper#(X2) proper#(and(X1,X2)) -> and#(proper(X1),proper(X2)) -> and#(ok(X1),ok(X2)) -> and#(X1,X2) proper#(and(X1,X2)) -> and#(proper(X1),proper(X2)) -> and#(mark(X1),X2) -> and#(X1,X2) proper#(__(X1,X2)) -> proper#(X2) -> proper#(isNePal(X)) -> isNePal#(proper(X)) proper#(__(X1,X2)) -> proper#(X2) -> proper#(isNePal(X)) -> proper#(X) proper#(__(X1,X2)) -> proper#(X2) -> proper#(and(X1,X2)) -> and#(proper(X1),proper(X2)) proper#(__(X1,X2)) -> proper#(X2) -> proper#(and(X1,X2)) -> proper#(X1) proper#(__(X1,X2)) -> proper#(X2) -> proper#(and(X1,X2)) -> proper#(X2) proper#(__(X1,X2)) -> proper#(X2) -> proper#(__(X1,X2)) -> __#(proper(X1),proper(X2)) proper#(__(X1,X2)) -> proper#(X2) -> proper#(__(X1,X2)) -> proper#(X1) proper#(__(X1,X2)) -> proper#(X2) -> proper#(__(X1,X2)) -> proper#(X2) proper#(__(X1,X2)) -> proper#(X1) -> proper#(isNePal(X)) -> isNePal#(proper(X)) proper#(__(X1,X2)) -> proper#(X1) -> proper#(isNePal(X)) -> proper#(X) proper#(__(X1,X2)) -> proper#(X1) -> proper#(and(X1,X2)) -> and#(proper(X1),proper(X2)) proper#(__(X1,X2)) -> proper#(X1) -> proper#(and(X1,X2)) -> proper#(X1) proper#(__(X1,X2)) -> proper#(X1) -> proper#(and(X1,X2)) -> proper#(X2) proper#(__(X1,X2)) -> proper#(X1) -> proper#(__(X1,X2)) -> __#(proper(X1),proper(X2)) proper#(__(X1,X2)) -> proper#(X1) -> proper#(__(X1,X2)) -> proper#(X1) proper#(__(X1,X2)) -> proper#(X1) -> proper#(__(X1,X2)) -> proper#(X2) proper#(__(X1,X2)) -> __#(proper(X1),proper(X2)) -> __#(ok(X1),ok(X2)) -> __#(X1,X2) proper#(__(X1,X2)) -> __#(proper(X1),proper(X2)) -> __#(X1,mark(X2)) -> __#(X1,X2) proper#(__(X1,X2)) -> __#(proper(X1),proper(X2)) -> __#(mark(X1),X2) -> __#(X1,X2) isNePal#(ok(X)) -> isNePal#(X) -> isNePal#(ok(X)) -> isNePal#(X) isNePal#(ok(X)) -> isNePal#(X) -> isNePal#(mark(X)) -> isNePal#(X) isNePal#(mark(X)) -> isNePal#(X) -> isNePal#(ok(X)) -> isNePal#(X) isNePal#(mark(X)) -> isNePal#(X) -> isNePal#(mark(X)) -> isNePal#(X) and#(ok(X1),ok(X2)) -> and#(X1,X2) -> and#(ok(X1),ok(X2)) -> and#(X1,X2) and#(ok(X1),ok(X2)) -> and#(X1,X2) -> and#(mark(X1),X2) -> and#(X1,X2) and#(mark(X1),X2) -> and#(X1,X2) -> and#(ok(X1),ok(X2)) -> and#(X1,X2) and#(mark(X1),X2) -> and#(X1,X2) -> and#(mark(X1),X2) -> and#(X1,X2) __#(ok(X1),ok(X2)) -> __#(X1,X2) -> __#(ok(X1),ok(X2)) -> __#(X1,X2) __#(ok(X1),ok(X2)) -> __#(X1,X2) -> __#(X1,mark(X2)) -> __#(X1,X2) __#(ok(X1),ok(X2)) -> __#(X1,X2) -> __#(mark(X1),X2) -> __#(X1,X2) __#(mark(X1),X2) -> __#(X1,X2) -> __#(ok(X1),ok(X2)) -> __#(X1,X2) __#(mark(X1),X2) -> __#(X1,X2) -> __#(X1,mark(X2)) -> __#(X1,X2) __#(mark(X1),X2) -> __#(X1,X2) -> __#(mark(X1),X2) -> __#(X1,X2) __#(X1,mark(X2)) -> __#(X1,X2) -> __#(ok(X1),ok(X2)) -> __#(X1,X2) __#(X1,mark(X2)) -> __#(X1,X2) -> __#(X1,mark(X2)) -> __#(X1,X2) __#(X1,mark(X2)) -> __#(X1,X2) -> __#(mark(X1),X2) -> __#(X1,X2) active#(isNePal(X)) -> isNePal#(active(X)) -> isNePal#(ok(X)) -> isNePal#(X) active#(isNePal(X)) -> isNePal#(active(X)) -> isNePal#(mark(X)) -> isNePal#(X) active#(isNePal(X)) -> active#(X) -> active#(isNePal(X)) -> isNePal#(active(X)) active#(isNePal(X)) -> active#(X) -> active#(isNePal(X)) -> active#(X) active#(isNePal(X)) -> active#(X) -> active#(and(X1,X2)) -> and#(active(X1),X2) active#(isNePal(X)) -> active#(X) -> active#(and(X1,X2)) -> active#(X1) active#(isNePal(X)) -> active#(X) -> active#(__(X1,X2)) -> __#(X1,active(X2)) active#(isNePal(X)) -> active#(X) -> active#(__(X1,X2)) -> active#(X2) active#(isNePal(X)) -> active#(X) -> active#(__(X1,X2)) -> __#(active(X1),X2) active#(isNePal(X)) -> active#(X) -> active#(__(X1,X2)) -> active#(X1) active#(isNePal(X)) -> active#(X) -> active#(__(__(X,Y),Z)) -> __#(X,__(Y,Z)) active#(isNePal(X)) -> active#(X) -> active#(__(__(X,Y),Z)) -> __#(Y,Z) active#(and(X1,X2)) -> and#(active(X1),X2) -> and#(ok(X1),ok(X2)) -> and#(X1,X2) active#(and(X1,X2)) -> and#(active(X1),X2) -> and#(mark(X1),X2) -> and#(X1,X2) active#(and(X1,X2)) -> active#(X1) -> active#(isNePal(X)) -> isNePal#(active(X)) active#(and(X1,X2)) -> active#(X1) -> active#(isNePal(X)) -> active#(X) active#(and(X1,X2)) -> active#(X1) -> active#(and(X1,X2)) -> and#(active(X1),X2) active#(and(X1,X2)) -> active#(X1) -> active#(and(X1,X2)) -> active#(X1) active#(and(X1,X2)) -> active#(X1) -> active#(__(X1,X2)) -> __#(X1,active(X2)) active#(and(X1,X2)) -> active#(X1) -> active#(__(X1,X2)) -> active#(X2) active#(and(X1,X2)) -> active#(X1) -> active#(__(X1,X2)) -> __#(active(X1),X2) active#(and(X1,X2)) -> active#(X1) -> active#(__(X1,X2)) -> active#(X1) active#(and(X1,X2)) -> active#(X1) -> active#(__(__(X,Y),Z)) -> __#(X,__(Y,Z)) active#(and(X1,X2)) -> active#(X1) -> active#(__(__(X,Y),Z)) -> __#(Y,Z) active#(__(__(X,Y),Z)) -> __#(Y,Z) -> __#(ok(X1),ok(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)) -> __#(ok(X1),ok(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#(__(X1,X2)) -> __#(active(X1),X2) -> __#(ok(X1),ok(X2)) -> __#(X1,X2) active#(__(X1,X2)) -> __#(active(X1),X2) -> __#(X1,mark(X2)) -> __#(X1,X2) active#(__(X1,X2)) -> __#(active(X1),X2) -> __#(mark(X1),X2) -> __#(X1,X2) active#(__(X1,X2)) -> __#(X1,active(X2)) -> __#(ok(X1),ok(X2)) -> __#(X1,X2) active#(__(X1,X2)) -> __#(X1,active(X2)) -> __#(X1,mark(X2)) -> __#(X1,X2) active#(__(X1,X2)) -> __#(X1,active(X2)) -> __#(mark(X1),X2) -> __#(X1,X2) active#(__(X1,X2)) -> active#(X2) -> active#(isNePal(X)) -> isNePal#(active(X)) active#(__(X1,X2)) -> active#(X2) -> active#(isNePal(X)) -> active#(X) active#(__(X1,X2)) -> active#(X2) -> active#(and(X1,X2)) -> and#(active(X1),X2) active#(__(X1,X2)) -> active#(X2) -> active#(and(X1,X2)) -> active#(X1) active#(__(X1,X2)) -> active#(X2) -> active#(__(X1,X2)) -> __#(X1,active(X2)) active#(__(X1,X2)) -> active#(X2) -> active#(__(X1,X2)) -> active#(X2) active#(__(X1,X2)) -> active#(X2) -> active#(__(X1,X2)) -> __#(active(X1),X2) active#(__(X1,X2)) -> active#(X2) -> active#(__(X1,X2)) -> active#(X1) active#(__(X1,X2)) -> active#(X2) -> active#(__(__(X,Y),Z)) -> __#(X,__(Y,Z)) active#(__(X1,X2)) -> active#(X2) -> active#(__(__(X,Y),Z)) -> __#(Y,Z) active#(__(X1,X2)) -> active#(X1) -> active#(isNePal(X)) -> isNePal#(active(X)) active#(__(X1,X2)) -> active#(X1) -> active#(isNePal(X)) -> active#(X) active#(__(X1,X2)) -> active#(X1) -> active#(and(X1,X2)) -> and#(active(X1),X2) active#(__(X1,X2)) -> active#(X1) -> active#(and(X1,X2)) -> active#(X1) active#(__(X1,X2)) -> active#(X1) -> active#(__(X1,X2)) -> __#(X1,active(X2)) active#(__(X1,X2)) -> active#(X1) -> active#(__(X1,X2)) -> active#(X2) active#(__(X1,X2)) -> active#(X1) -> active#(__(X1,X2)) -> __#(active(X1),X2) active#(__(X1,X2)) -> active#(X1) -> active#(__(X1,X2)) -> active#(X1) active#(__(X1,X2)) -> active#(X1) -> active#(__(__(X,Y),Z)) -> __#(X,__(Y,Z)) active#(__(X1,X2)) -> active#(X1) -> active#(__(__(X,Y),Z)) -> __#(Y,Z) SCC Processor: #sccs: 6 #rules: 18 #arcs: 146/841 DPs: top#(ok(X)) -> top#(active(X)) top#(mark(X)) -> top#(proper(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()) active(__(X1,X2)) -> __(active(X1),X2) active(__(X1,X2)) -> __(X1,active(X2)) active(and(X1,X2)) -> and(active(X1),X2) active(isNePal(X)) -> isNePal(active(X)) __(mark(X1),X2) -> mark(__(X1,X2)) __(X1,mark(X2)) -> mark(__(X1,X2)) and(mark(X1),X2) -> mark(and(X1,X2)) isNePal(mark(X)) -> mark(isNePal(X)) proper(__(X1,X2)) -> __(proper(X1),proper(X2)) proper(nil()) -> ok(nil()) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(tt()) -> ok(tt()) proper(isNePal(X)) -> isNePal(proper(X)) __(ok(X1),ok(X2)) -> ok(__(X1,X2)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) isNePal(ok(X)) -> ok(isNePal(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) LPO Processor: argument filtering: pi(__) = [0,1] pi(active) = 0 pi(mark) = [0] pi(nil) = [] pi(tt) = [] pi(and) = [0,1] pi(isNePal) = 0 pi(proper) = 0 pi(ok) = 0 pi(top) = 0 pi(top#) = 0 precedence: and ~ __ > top# ~ top ~ ok ~ proper ~ isNePal ~ tt ~ nil ~ mark ~ active problem: DPs: top#(ok(X)) -> top#(active(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()) active(__(X1,X2)) -> __(active(X1),X2) active(__(X1,X2)) -> __(X1,active(X2)) active(and(X1,X2)) -> and(active(X1),X2) active(isNePal(X)) -> isNePal(active(X)) __(mark(X1),X2) -> mark(__(X1,X2)) __(X1,mark(X2)) -> mark(__(X1,X2)) and(mark(X1),X2) -> mark(and(X1,X2)) isNePal(mark(X)) -> mark(isNePal(X)) proper(__(X1,X2)) -> __(proper(X1),proper(X2)) proper(nil()) -> ok(nil()) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(tt()) -> ok(tt()) proper(isNePal(X)) -> isNePal(proper(X)) __(ok(X1),ok(X2)) -> ok(__(X1,X2)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) isNePal(ok(X)) -> ok(isNePal(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Arctic Interpretation Processor: dimension: 1 interpretation: [top#](x0) = 1x0, [top](x0) = 0, [ok](x0) = 2x0 + 0, [proper](x0) = 4x0, [isNePal](x0) = 2x0 + 0, [and](x0, x1) = x0 + x1, [tt] = 0, [nil] = 2, [mark](x0) = x0, [active](x0) = x0, [__](x0, x1) = x0 + x1 orientation: top#(ok(X)) = 3X + 1 >= 1X = top#(active(X)) active(__(__(X,Y),Z)) = X + Y + Z >= X + Y + Z = mark(__(X,__(Y,Z))) active(__(X,nil())) = X + 2 >= X = mark(X) active(__(nil(),X)) = X + 2 >= X = mark(X) active(and(tt(),X)) = X + 0 >= X = mark(X) active(isNePal(__(I,__(P,I)))) = 2I + 2P + 0 >= 0 = mark(tt()) active(__(X1,X2)) = X1 + X2 >= X1 + X2 = __(active(X1),X2) active(__(X1,X2)) = X1 + X2 >= X1 + X2 = __(X1,active(X2)) active(and(X1,X2)) = X1 + X2 >= X1 + X2 = and(active(X1),X2) active(isNePal(X)) = 2X + 0 >= 2X + 0 = isNePal(active(X)) __(mark(X1),X2) = X1 + X2 >= X1 + X2 = mark(__(X1,X2)) __(X1,mark(X2)) = X1 + X2 >= X1 + X2 = mark(__(X1,X2)) and(mark(X1),X2) = X1 + X2 >= X1 + X2 = mark(and(X1,X2)) isNePal(mark(X)) = 2X + 0 >= 2X + 0 = mark(isNePal(X)) proper(__(X1,X2)) = 4X1 + 4X2 >= 4X1 + 4X2 = __(proper(X1),proper(X2)) proper(nil()) = 6 >= 4 = ok(nil()) proper(and(X1,X2)) = 4X1 + 4X2 >= 4X1 + 4X2 = and(proper(X1),proper(X2)) proper(tt()) = 4 >= 2 = ok(tt()) proper(isNePal(X)) = 6X + 4 >= 6X + 0 = isNePal(proper(X)) __(ok(X1),ok(X2)) = 2X1 + 2X2 + 0 >= 2X1 + 2X2 + 0 = ok(__(X1,X2)) and(ok(X1),ok(X2)) = 2X1 + 2X2 + 0 >= 2X1 + 2X2 + 0 = ok(and(X1,X2)) isNePal(ok(X)) = 4X + 2 >= 4X + 2 = ok(isNePal(X)) top(mark(X)) = 0 >= 0 = top(proper(X)) top(ok(X)) = 0 >= 0 = top(active(X)) 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()) active(__(X1,X2)) -> __(active(X1),X2) active(__(X1,X2)) -> __(X1,active(X2)) active(and(X1,X2)) -> and(active(X1),X2) active(isNePal(X)) -> isNePal(active(X)) __(mark(X1),X2) -> mark(__(X1,X2)) __(X1,mark(X2)) -> mark(__(X1,X2)) and(mark(X1),X2) -> mark(and(X1,X2)) isNePal(mark(X)) -> mark(isNePal(X)) proper(__(X1,X2)) -> __(proper(X1),proper(X2)) proper(nil()) -> ok(nil()) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(tt()) -> ok(tt()) proper(isNePal(X)) -> isNePal(proper(X)) __(ok(X1),ok(X2)) -> ok(__(X1,X2)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) isNePal(ok(X)) -> ok(isNePal(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Qed DPs: active#(__(X1,X2)) -> active#(X1) active#(__(X1,X2)) -> active#(X2) active#(and(X1,X2)) -> active#(X1) active#(isNePal(X)) -> active#(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()) active(__(X1,X2)) -> __(active(X1),X2) active(__(X1,X2)) -> __(X1,active(X2)) active(and(X1,X2)) -> and(active(X1),X2) active(isNePal(X)) -> isNePal(active(X)) __(mark(X1),X2) -> mark(__(X1,X2)) __(X1,mark(X2)) -> mark(__(X1,X2)) and(mark(X1),X2) -> mark(and(X1,X2)) isNePal(mark(X)) -> mark(isNePal(X)) proper(__(X1,X2)) -> __(proper(X1),proper(X2)) proper(nil()) -> ok(nil()) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(tt()) -> ok(tt()) proper(isNePal(X)) -> isNePal(proper(X)) __(ok(X1),ok(X2)) -> ok(__(X1,X2)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) isNePal(ok(X)) -> ok(isNePal(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Subterm Criterion Processor: simple projection: pi(active#) = 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()) active(__(X1,X2)) -> __(active(X1),X2) active(__(X1,X2)) -> __(X1,active(X2)) active(and(X1,X2)) -> and(active(X1),X2) active(isNePal(X)) -> isNePal(active(X)) __(mark(X1),X2) -> mark(__(X1,X2)) __(X1,mark(X2)) -> mark(__(X1,X2)) and(mark(X1),X2) -> mark(and(X1,X2)) isNePal(mark(X)) -> mark(isNePal(X)) proper(__(X1,X2)) -> __(proper(X1),proper(X2)) proper(nil()) -> ok(nil()) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(tt()) -> ok(tt()) proper(isNePal(X)) -> isNePal(proper(X)) __(ok(X1),ok(X2)) -> ok(__(X1,X2)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) isNePal(ok(X)) -> ok(isNePal(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Qed DPs: proper#(__(X1,X2)) -> proper#(X2) proper#(__(X1,X2)) -> proper#(X1) proper#(and(X1,X2)) -> proper#(X2) proper#(and(X1,X2)) -> proper#(X1) proper#(isNePal(X)) -> proper#(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()) active(__(X1,X2)) -> __(active(X1),X2) active(__(X1,X2)) -> __(X1,active(X2)) active(and(X1,X2)) -> and(active(X1),X2) active(isNePal(X)) -> isNePal(active(X)) __(mark(X1),X2) -> mark(__(X1,X2)) __(X1,mark(X2)) -> mark(__(X1,X2)) and(mark(X1),X2) -> mark(and(X1,X2)) isNePal(mark(X)) -> mark(isNePal(X)) proper(__(X1,X2)) -> __(proper(X1),proper(X2)) proper(nil()) -> ok(nil()) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(tt()) -> ok(tt()) proper(isNePal(X)) -> isNePal(proper(X)) __(ok(X1),ok(X2)) -> ok(__(X1,X2)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) isNePal(ok(X)) -> ok(isNePal(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Subterm Criterion Processor: simple projection: pi(proper#) = 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()) active(__(X1,X2)) -> __(active(X1),X2) active(__(X1,X2)) -> __(X1,active(X2)) active(and(X1,X2)) -> and(active(X1),X2) active(isNePal(X)) -> isNePal(active(X)) __(mark(X1),X2) -> mark(__(X1,X2)) __(X1,mark(X2)) -> mark(__(X1,X2)) and(mark(X1),X2) -> mark(and(X1,X2)) isNePal(mark(X)) -> mark(isNePal(X)) proper(__(X1,X2)) -> __(proper(X1),proper(X2)) proper(nil()) -> ok(nil()) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(tt()) -> ok(tt()) proper(isNePal(X)) -> isNePal(proper(X)) __(ok(X1),ok(X2)) -> ok(__(X1,X2)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) isNePal(ok(X)) -> ok(isNePal(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Qed DPs: isNePal#(mark(X)) -> isNePal#(X) isNePal#(ok(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()) active(__(X1,X2)) -> __(active(X1),X2) active(__(X1,X2)) -> __(X1,active(X2)) active(and(X1,X2)) -> and(active(X1),X2) active(isNePal(X)) -> isNePal(active(X)) __(mark(X1),X2) -> mark(__(X1,X2)) __(X1,mark(X2)) -> mark(__(X1,X2)) and(mark(X1),X2) -> mark(and(X1,X2)) isNePal(mark(X)) -> mark(isNePal(X)) proper(__(X1,X2)) -> __(proper(X1),proper(X2)) proper(nil()) -> ok(nil()) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(tt()) -> ok(tt()) proper(isNePal(X)) -> isNePal(proper(X)) __(ok(X1),ok(X2)) -> ok(__(X1,X2)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) isNePal(ok(X)) -> ok(isNePal(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(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()) active(__(X1,X2)) -> __(active(X1),X2) active(__(X1,X2)) -> __(X1,active(X2)) active(and(X1,X2)) -> and(active(X1),X2) active(isNePal(X)) -> isNePal(active(X)) __(mark(X1),X2) -> mark(__(X1,X2)) __(X1,mark(X2)) -> mark(__(X1,X2)) and(mark(X1),X2) -> mark(and(X1,X2)) isNePal(mark(X)) -> mark(isNePal(X)) proper(__(X1,X2)) -> __(proper(X1),proper(X2)) proper(nil()) -> ok(nil()) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(tt()) -> ok(tt()) proper(isNePal(X)) -> isNePal(proper(X)) __(ok(X1),ok(X2)) -> ok(__(X1,X2)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) isNePal(ok(X)) -> ok(isNePal(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Qed DPs: and#(mark(X1),X2) -> and#(X1,X2) and#(ok(X1),ok(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()) active(__(X1,X2)) -> __(active(X1),X2) active(__(X1,X2)) -> __(X1,active(X2)) active(and(X1,X2)) -> and(active(X1),X2) active(isNePal(X)) -> isNePal(active(X)) __(mark(X1),X2) -> mark(__(X1,X2)) __(X1,mark(X2)) -> mark(__(X1,X2)) and(mark(X1),X2) -> mark(and(X1,X2)) isNePal(mark(X)) -> mark(isNePal(X)) proper(__(X1,X2)) -> __(proper(X1),proper(X2)) proper(nil()) -> ok(nil()) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(tt()) -> ok(tt()) proper(isNePal(X)) -> isNePal(proper(X)) __(ok(X1),ok(X2)) -> ok(__(X1,X2)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) isNePal(ok(X)) -> ok(isNePal(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Subterm Criterion Processor: simple projection: pi(and#) = 1 problem: DPs: and#(mark(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()) active(__(X1,X2)) -> __(active(X1),X2) active(__(X1,X2)) -> __(X1,active(X2)) active(and(X1,X2)) -> and(active(X1),X2) active(isNePal(X)) -> isNePal(active(X)) __(mark(X1),X2) -> mark(__(X1,X2)) __(X1,mark(X2)) -> mark(__(X1,X2)) and(mark(X1),X2) -> mark(and(X1,X2)) isNePal(mark(X)) -> mark(isNePal(X)) proper(__(X1,X2)) -> __(proper(X1),proper(X2)) proper(nil()) -> ok(nil()) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(tt()) -> ok(tt()) proper(isNePal(X)) -> isNePal(proper(X)) __(ok(X1),ok(X2)) -> ok(__(X1,X2)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) isNePal(ok(X)) -> ok(isNePal(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(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()) active(__(X1,X2)) -> __(active(X1),X2) active(__(X1,X2)) -> __(X1,active(X2)) active(and(X1,X2)) -> and(active(X1),X2) active(isNePal(X)) -> isNePal(active(X)) __(mark(X1),X2) -> mark(__(X1,X2)) __(X1,mark(X2)) -> mark(__(X1,X2)) and(mark(X1),X2) -> mark(and(X1,X2)) isNePal(mark(X)) -> mark(isNePal(X)) proper(__(X1,X2)) -> __(proper(X1),proper(X2)) proper(nil()) -> ok(nil()) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(tt()) -> ok(tt()) proper(isNePal(X)) -> isNePal(proper(X)) __(ok(X1),ok(X2)) -> ok(__(X1,X2)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) isNePal(ok(X)) -> ok(isNePal(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Qed DPs: __#(mark(X1),X2) -> __#(X1,X2) __#(X1,mark(X2)) -> __#(X1,X2) __#(ok(X1),ok(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()) active(__(X1,X2)) -> __(active(X1),X2) active(__(X1,X2)) -> __(X1,active(X2)) active(and(X1,X2)) -> and(active(X1),X2) active(isNePal(X)) -> isNePal(active(X)) __(mark(X1),X2) -> mark(__(X1,X2)) __(X1,mark(X2)) -> mark(__(X1,X2)) and(mark(X1),X2) -> mark(and(X1,X2)) isNePal(mark(X)) -> mark(isNePal(X)) proper(__(X1,X2)) -> __(proper(X1),proper(X2)) proper(nil()) -> ok(nil()) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(tt()) -> ok(tt()) proper(isNePal(X)) -> isNePal(proper(X)) __(ok(X1),ok(X2)) -> ok(__(X1,X2)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) isNePal(ok(X)) -> ok(isNePal(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Subterm Criterion Processor: simple projection: pi(__#) = 1 problem: DPs: __#(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(isNePal(__(I,__(P,I)))) -> mark(tt()) active(__(X1,X2)) -> __(active(X1),X2) active(__(X1,X2)) -> __(X1,active(X2)) active(and(X1,X2)) -> and(active(X1),X2) active(isNePal(X)) -> isNePal(active(X)) __(mark(X1),X2) -> mark(__(X1,X2)) __(X1,mark(X2)) -> mark(__(X1,X2)) and(mark(X1),X2) -> mark(and(X1,X2)) isNePal(mark(X)) -> mark(isNePal(X)) proper(__(X1,X2)) -> __(proper(X1),proper(X2)) proper(nil()) -> ok(nil()) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(tt()) -> ok(tt()) proper(isNePal(X)) -> isNePal(proper(X)) __(ok(X1),ok(X2)) -> ok(__(X1,X2)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) isNePal(ok(X)) -> ok(isNePal(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(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()) active(__(X1,X2)) -> __(active(X1),X2) active(__(X1,X2)) -> __(X1,active(X2)) active(and(X1,X2)) -> and(active(X1),X2) active(isNePal(X)) -> isNePal(active(X)) __(mark(X1),X2) -> mark(__(X1,X2)) __(X1,mark(X2)) -> mark(__(X1,X2)) and(mark(X1),X2) -> mark(and(X1,X2)) isNePal(mark(X)) -> mark(isNePal(X)) proper(__(X1,X2)) -> __(proper(X1),proper(X2)) proper(nil()) -> ok(nil()) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(tt()) -> ok(tt()) proper(isNePal(X)) -> isNePal(proper(X)) __(ok(X1),ok(X2)) -> ok(__(X1,X2)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) isNePal(ok(X)) -> ok(isNePal(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Qed