YES Problem: a____(__(X,Y),Z) -> a____(mark(X),a____(mark(Y),mark(Z))) a____(X,nil()) -> mark(X) a____(nil(),X) -> mark(X) a__and(tt(),X) -> mark(X) a__isList(V) -> a__isNeList(V) a__isList(nil()) -> tt() a__isList(__(V1,V2)) -> a__and(a__isList(V1),isList(V2)) a__isNeList(V) -> a__isQid(V) a__isNeList(__(V1,V2)) -> a__and(a__isList(V1),isNeList(V2)) a__isNeList(__(V1,V2)) -> a__and(a__isNeList(V1),isList(V2)) a__isNePal(V) -> a__isQid(V) a__isNePal(__(I,__(P,I))) -> a__and(a__isQid(I),isPal(P)) a__isPal(V) -> a__isNePal(V) a__isPal(nil()) -> tt() a__isQid(a()) -> tt() a__isQid(e()) -> tt() a__isQid(i()) -> tt() a__isQid(o()) -> tt() a__isQid(u()) -> tt() mark(__(X1,X2)) -> a____(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isList(X)) -> a__isList(X) mark(isNeList(X)) -> a__isNeList(X) mark(isQid(X)) -> a__isQid(X) mark(isNePal(X)) -> a__isNePal(X) mark(isPal(X)) -> a__isPal(X) mark(nil()) -> nil() mark(tt()) -> tt() mark(a()) -> a() mark(e()) -> e() mark(i()) -> i() mark(o()) -> o() mark(u()) -> u() a____(X1,X2) -> __(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isList(X) -> isList(X) a__isNeList(X) -> isNeList(X) a__isQid(X) -> isQid(X) a__isNePal(X) -> isNePal(X) a__isPal(X) -> isPal(X) Proof: DP Processor: DPs: a____#(__(X,Y),Z) -> mark#(Z) a____#(__(X,Y),Z) -> mark#(Y) a____#(__(X,Y),Z) -> a____#(mark(Y),mark(Z)) a____#(__(X,Y),Z) -> mark#(X) a____#(__(X,Y),Z) -> a____#(mark(X),a____(mark(Y),mark(Z))) a____#(X,nil()) -> mark#(X) a____#(nil(),X) -> mark#(X) a__and#(tt(),X) -> mark#(X) a__isList#(V) -> a__isNeList#(V) a__isList#(__(V1,V2)) -> a__isList#(V1) a__isList#(__(V1,V2)) -> a__and#(a__isList(V1),isList(V2)) a__isNeList#(V) -> a__isQid#(V) a__isNeList#(__(V1,V2)) -> a__isList#(V1) a__isNeList#(__(V1,V2)) -> a__and#(a__isList(V1),isNeList(V2)) a__isNeList#(__(V1,V2)) -> a__isNeList#(V1) a__isNeList#(__(V1,V2)) -> a__and#(a__isNeList(V1),isList(V2)) a__isNePal#(V) -> a__isQid#(V) a__isNePal#(__(I,__(P,I))) -> a__isQid#(I) a__isNePal#(__(I,__(P,I))) -> a__and#(a__isQid(I),isPal(P)) a__isPal#(V) -> a__isNePal#(V) mark#(__(X1,X2)) -> mark#(X2) mark#(__(X1,X2)) -> mark#(X1) mark#(__(X1,X2)) -> a____#(mark(X1),mark(X2)) mark#(and(X1,X2)) -> mark#(X1) mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(isList(X)) -> a__isList#(X) mark#(isNeList(X)) -> a__isNeList#(X) mark#(isQid(X)) -> a__isQid#(X) mark#(isNePal(X)) -> a__isNePal#(X) mark#(isPal(X)) -> a__isPal#(X) TRS: a____(__(X,Y),Z) -> a____(mark(X),a____(mark(Y),mark(Z))) a____(X,nil()) -> mark(X) a____(nil(),X) -> mark(X) a__and(tt(),X) -> mark(X) a__isList(V) -> a__isNeList(V) a__isList(nil()) -> tt() a__isList(__(V1,V2)) -> a__and(a__isList(V1),isList(V2)) a__isNeList(V) -> a__isQid(V) a__isNeList(__(V1,V2)) -> a__and(a__isList(V1),isNeList(V2)) a__isNeList(__(V1,V2)) -> a__and(a__isNeList(V1),isList(V2)) a__isNePal(V) -> a__isQid(V) a__isNePal(__(I,__(P,I))) -> a__and(a__isQid(I),isPal(P)) a__isPal(V) -> a__isNePal(V) a__isPal(nil()) -> tt() a__isQid(a()) -> tt() a__isQid(e()) -> tt() a__isQid(i()) -> tt() a__isQid(o()) -> tt() a__isQid(u()) -> tt() mark(__(X1,X2)) -> a____(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isList(X)) -> a__isList(X) mark(isNeList(X)) -> a__isNeList(X) mark(isQid(X)) -> a__isQid(X) mark(isNePal(X)) -> a__isNePal(X) mark(isPal(X)) -> a__isPal(X) mark(nil()) -> nil() mark(tt()) -> tt() mark(a()) -> a() mark(e()) -> e() mark(i()) -> i() mark(o()) -> o() mark(u()) -> u() a____(X1,X2) -> __(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isList(X) -> isList(X) a__isNeList(X) -> isNeList(X) a__isQid(X) -> isQid(X) a__isNePal(X) -> isNePal(X) a__isPal(X) -> isPal(X) TDG Processor: DPs: a____#(__(X,Y),Z) -> mark#(Z) a____#(__(X,Y),Z) -> mark#(Y) a____#(__(X,Y),Z) -> a____#(mark(Y),mark(Z)) a____#(__(X,Y),Z) -> mark#(X) a____#(__(X,Y),Z) -> a____#(mark(X),a____(mark(Y),mark(Z))) a____#(X,nil()) -> mark#(X) a____#(nil(),X) -> mark#(X) a__and#(tt(),X) -> mark#(X) a__isList#(V) -> a__isNeList#(V) a__isList#(__(V1,V2)) -> a__isList#(V1) a__isList#(__(V1,V2)) -> a__and#(a__isList(V1),isList(V2)) a__isNeList#(V) -> a__isQid#(V) a__isNeList#(__(V1,V2)) -> a__isList#(V1) a__isNeList#(__(V1,V2)) -> a__and#(a__isList(V1),isNeList(V2)) a__isNeList#(__(V1,V2)) -> a__isNeList#(V1) a__isNeList#(__(V1,V2)) -> a__and#(a__isNeList(V1),isList(V2)) a__isNePal#(V) -> a__isQid#(V) a__isNePal#(__(I,__(P,I))) -> a__isQid#(I) a__isNePal#(__(I,__(P,I))) -> a__and#(a__isQid(I),isPal(P)) a__isPal#(V) -> a__isNePal#(V) mark#(__(X1,X2)) -> mark#(X2) mark#(__(X1,X2)) -> mark#(X1) mark#(__(X1,X2)) -> a____#(mark(X1),mark(X2)) mark#(and(X1,X2)) -> mark#(X1) mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(isList(X)) -> a__isList#(X) mark#(isNeList(X)) -> a__isNeList#(X) mark#(isQid(X)) -> a__isQid#(X) mark#(isNePal(X)) -> a__isNePal#(X) mark#(isPal(X)) -> a__isPal#(X) TRS: a____(__(X,Y),Z) -> a____(mark(X),a____(mark(Y),mark(Z))) a____(X,nil()) -> mark(X) a____(nil(),X) -> mark(X) a__and(tt(),X) -> mark(X) a__isList(V) -> a__isNeList(V) a__isList(nil()) -> tt() a__isList(__(V1,V2)) -> a__and(a__isList(V1),isList(V2)) a__isNeList(V) -> a__isQid(V) a__isNeList(__(V1,V2)) -> a__and(a__isList(V1),isNeList(V2)) a__isNeList(__(V1,V2)) -> a__and(a__isNeList(V1),isList(V2)) a__isNePal(V) -> a__isQid(V) a__isNePal(__(I,__(P,I))) -> a__and(a__isQid(I),isPal(P)) a__isPal(V) -> a__isNePal(V) a__isPal(nil()) -> tt() a__isQid(a()) -> tt() a__isQid(e()) -> tt() a__isQid(i()) -> tt() a__isQid(o()) -> tt() a__isQid(u()) -> tt() mark(__(X1,X2)) -> a____(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isList(X)) -> a__isList(X) mark(isNeList(X)) -> a__isNeList(X) mark(isQid(X)) -> a__isQid(X) mark(isNePal(X)) -> a__isNePal(X) mark(isPal(X)) -> a__isPal(X) mark(nil()) -> nil() mark(tt()) -> tt() mark(a()) -> a() mark(e()) -> e() mark(i()) -> i() mark(o()) -> o() mark(u()) -> u() a____(X1,X2) -> __(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isList(X) -> isList(X) a__isNeList(X) -> isNeList(X) a__isQid(X) -> isQid(X) a__isNePal(X) -> isNePal(X) a__isPal(X) -> isPal(X) graph: a__isPal#(V) -> a__isNePal#(V) -> a__isNePal#(__(I,__(P,I))) -> a__and#(a__isQid(I),isPal(P)) a__isPal#(V) -> a__isNePal#(V) -> a__isNePal#(__(I,__(P,I))) -> a__isQid#(I) a__isPal#(V) -> a__isNePal#(V) -> a__isNePal#(V) -> a__isQid#(V) a__isNePal#(__(I,__(P,I))) -> a__and#(a__isQid(I),isPal(P)) -> a__and#(tt(),X) -> mark#(X) a__isNeList#(__(V1,V2)) -> a__isNeList#(V1) -> a__isNeList#(__(V1,V2)) -> a__and#(a__isNeList(V1),isList(V2)) a__isNeList#(__(V1,V2)) -> a__isNeList#(V1) -> a__isNeList#(__(V1,V2)) -> a__isNeList#(V1) a__isNeList#(__(V1,V2)) -> a__isNeList#(V1) -> a__isNeList#(__(V1,V2)) -> a__and#(a__isList(V1),isNeList(V2)) a__isNeList#(__(V1,V2)) -> a__isNeList#(V1) -> a__isNeList#(__(V1,V2)) -> a__isList#(V1) a__isNeList#(__(V1,V2)) -> a__isNeList#(V1) -> a__isNeList#(V) -> a__isQid#(V) a__isNeList#(__(V1,V2)) -> a__isList#(V1) -> a__isList#(__(V1,V2)) -> a__and#(a__isList(V1),isList(V2)) a__isNeList#(__(V1,V2)) -> a__isList#(V1) -> a__isList#(__(V1,V2)) -> a__isList#(V1) a__isNeList#(__(V1,V2)) -> a__isList#(V1) -> a__isList#(V) -> a__isNeList#(V) a__isNeList#(__(V1,V2)) -> a__and#(a__isNeList(V1),isList(V2)) -> a__and#(tt(),X) -> mark#(X) a__isNeList#(__(V1,V2)) -> a__and#(a__isList(V1),isNeList(V2)) -> a__and#(tt(),X) -> mark#(X) a__isList#(__(V1,V2)) -> a__isList#(V1) -> a__isList#(__(V1,V2)) -> a__and#(a__isList(V1),isList(V2)) a__isList#(__(V1,V2)) -> a__isList#(V1) -> a__isList#(__(V1,V2)) -> a__isList#(V1) a__isList#(__(V1,V2)) -> a__isList#(V1) -> a__isList#(V) -> a__isNeList#(V) a__isList#(__(V1,V2)) -> a__and#(a__isList(V1),isList(V2)) -> a__and#(tt(),X) -> mark#(X) a__isList#(V) -> a__isNeList#(V) -> a__isNeList#(__(V1,V2)) -> a__and#(a__isNeList(V1),isList(V2)) a__isList#(V) -> a__isNeList#(V) -> a__isNeList#(__(V1,V2)) -> a__isNeList#(V1) a__isList#(V) -> a__isNeList#(V) -> a__isNeList#(__(V1,V2)) -> a__and#(a__isList(V1),isNeList(V2)) a__isList#(V) -> a__isNeList#(V) -> a__isNeList#(__(V1,V2)) -> a__isList#(V1) a__isList#(V) -> a__isNeList#(V) -> a__isNeList#(V) -> a__isQid#(V) a__and#(tt(),X) -> mark#(X) -> mark#(isPal(X)) -> a__isPal#(X) a__and#(tt(),X) -> mark#(X) -> mark#(isNePal(X)) -> a__isNePal#(X) a__and#(tt(),X) -> mark#(X) -> mark#(isQid(X)) -> a__isQid#(X) a__and#(tt(),X) -> mark#(X) -> mark#(isNeList(X)) -> a__isNeList#(X) a__and#(tt(),X) -> mark#(X) -> mark#(isList(X)) -> a__isList#(X) a__and#(tt(),X) -> mark#(X) -> mark#(and(X1,X2)) -> a__and#(mark(X1),X2) a__and#(tt(),X) -> mark#(X) -> mark#(and(X1,X2)) -> mark#(X1) a__and#(tt(),X) -> mark#(X) -> mark#(__(X1,X2)) -> a____#(mark(X1),mark(X2)) a__and#(tt(),X) -> mark#(X) -> mark#(__(X1,X2)) -> mark#(X1) a__and#(tt(),X) -> mark#(X) -> mark#(__(X1,X2)) -> mark#(X2) mark#(isNePal(X)) -> a__isNePal#(X) -> a__isNePal#(__(I,__(P,I))) -> a__and#(a__isQid(I),isPal(P)) mark#(isNePal(X)) -> a__isNePal#(X) -> a__isNePal#(__(I,__(P,I))) -> a__isQid#(I) mark#(isNePal(X)) -> a__isNePal#(X) -> a__isNePal#(V) -> a__isQid#(V) mark#(and(X1,X2)) -> a__and#(mark(X1),X2) -> a__and#(tt(),X) -> mark#(X) mark#(and(X1,X2)) -> mark#(X1) -> mark#(isPal(X)) -> a__isPal#(X) mark#(and(X1,X2)) -> mark#(X1) -> mark#(isNePal(X)) -> a__isNePal#(X) mark#(and(X1,X2)) -> mark#(X1) -> mark#(isQid(X)) -> a__isQid#(X) mark#(and(X1,X2)) -> mark#(X1) -> mark#(isNeList(X)) -> a__isNeList#(X) mark#(and(X1,X2)) -> mark#(X1) -> mark#(isList(X)) -> a__isList#(X) mark#(and(X1,X2)) -> mark#(X1) -> mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(and(X1,X2)) -> mark#(X1) -> mark#(and(X1,X2)) -> mark#(X1) mark#(and(X1,X2)) -> mark#(X1) -> mark#(__(X1,X2)) -> a____#(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#(isPal(X)) -> a__isPal#(X) -> a__isPal#(V) -> a__isNePal#(V) mark#(isNeList(X)) -> a__isNeList#(X) -> a__isNeList#(__(V1,V2)) -> a__and#(a__isNeList(V1),isList(V2)) mark#(isNeList(X)) -> a__isNeList#(X) -> a__isNeList#(__(V1,V2)) -> a__isNeList#(V1) mark#(isNeList(X)) -> a__isNeList#(X) -> a__isNeList#(__(V1,V2)) -> a__and#(a__isList(V1),isNeList(V2)) mark#(isNeList(X)) -> a__isNeList#(X) -> a__isNeList#(__(V1,V2)) -> a__isList#(V1) mark#(isNeList(X)) -> a__isNeList#(X) -> a__isNeList#(V) -> a__isQid#(V) mark#(isList(X)) -> a__isList#(X) -> a__isList#(__(V1,V2)) -> a__and#(a__isList(V1),isList(V2)) mark#(isList(X)) -> a__isList#(X) -> a__isList#(__(V1,V2)) -> a__isList#(V1) mark#(isList(X)) -> a__isList#(X) -> a__isList#(V) -> a__isNeList#(V) mark#(__(X1,X2)) -> mark#(X2) -> mark#(isPal(X)) -> a__isPal#(X) mark#(__(X1,X2)) -> mark#(X2) -> mark#(isNePal(X)) -> a__isNePal#(X) mark#(__(X1,X2)) -> mark#(X2) -> mark#(isQid(X)) -> a__isQid#(X) mark#(__(X1,X2)) -> mark#(X2) -> mark#(isNeList(X)) -> a__isNeList#(X) mark#(__(X1,X2)) -> mark#(X2) -> mark#(isList(X)) -> a__isList#(X) mark#(__(X1,X2)) -> mark#(X2) -> mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(__(X1,X2)) -> mark#(X2) -> mark#(and(X1,X2)) -> mark#(X1) mark#(__(X1,X2)) -> mark#(X2) -> mark#(__(X1,X2)) -> a____#(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#(isPal(X)) -> a__isPal#(X) mark#(__(X1,X2)) -> mark#(X1) -> mark#(isNePal(X)) -> a__isNePal#(X) mark#(__(X1,X2)) -> mark#(X1) -> mark#(isQid(X)) -> a__isQid#(X) mark#(__(X1,X2)) -> mark#(X1) -> mark#(isNeList(X)) -> a__isNeList#(X) mark#(__(X1,X2)) -> mark#(X1) -> mark#(isList(X)) -> a__isList#(X) mark#(__(X1,X2)) -> mark#(X1) -> mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(__(X1,X2)) -> mark#(X1) -> mark#(and(X1,X2)) -> mark#(X1) mark#(__(X1,X2)) -> mark#(X1) -> mark#(__(X1,X2)) -> a____#(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)) -> a____#(mark(X1),mark(X2)) -> a____#(nil(),X) -> mark#(X) mark#(__(X1,X2)) -> a____#(mark(X1),mark(X2)) -> a____#(X,nil()) -> mark#(X) mark#(__(X1,X2)) -> a____#(mark(X1),mark(X2)) -> a____#(__(X,Y),Z) -> a____#(mark(X),a____(mark(Y),mark(Z))) mark#(__(X1,X2)) -> a____#(mark(X1),mark(X2)) -> a____#(__(X,Y),Z) -> mark#(X) mark#(__(X1,X2)) -> a____#(mark(X1),mark(X2)) -> a____#(__(X,Y),Z) -> a____#(mark(Y),mark(Z)) mark#(__(X1,X2)) -> a____#(mark(X1),mark(X2)) -> a____#(__(X,Y),Z) -> mark#(Y) mark#(__(X1,X2)) -> a____#(mark(X1),mark(X2)) -> a____#(__(X,Y),Z) -> mark#(Z) a____#(nil(),X) -> mark#(X) -> mark#(isPal(X)) -> a__isPal#(X) a____#(nil(),X) -> mark#(X) -> mark#(isNePal(X)) -> a__isNePal#(X) a____#(nil(),X) -> mark#(X) -> mark#(isQid(X)) -> a__isQid#(X) a____#(nil(),X) -> mark#(X) -> mark#(isNeList(X)) -> a__isNeList#(X) a____#(nil(),X) -> mark#(X) -> mark#(isList(X)) -> a__isList#(X) a____#(nil(),X) -> mark#(X) -> mark#(and(X1,X2)) -> a__and#(mark(X1),X2) a____#(nil(),X) -> mark#(X) -> mark#(and(X1,X2)) -> mark#(X1) a____#(nil(),X) -> mark#(X) -> mark#(__(X1,X2)) -> a____#(mark(X1),mark(X2)) a____#(nil(),X) -> mark#(X) -> mark#(__(X1,X2)) -> mark#(X1) a____#(nil(),X) -> mark#(X) -> mark#(__(X1,X2)) -> mark#(X2) a____#(__(X,Y),Z) -> mark#(Z) -> mark#(isPal(X)) -> a__isPal#(X) a____#(__(X,Y),Z) -> mark#(Z) -> mark#(isNePal(X)) -> a__isNePal#(X) a____#(__(X,Y),Z) -> mark#(Z) -> mark#(isQid(X)) -> a__isQid#(X) a____#(__(X,Y),Z) -> mark#(Z) -> mark#(isNeList(X)) -> a__isNeList#(X) a____#(__(X,Y),Z) -> mark#(Z) -> mark#(isList(X)) -> a__isList#(X) a____#(__(X,Y),Z) -> mark#(Z) -> mark#(and(X1,X2)) -> a__and#(mark(X1),X2) a____#(__(X,Y),Z) -> mark#(Z) -> mark#(and(X1,X2)) -> mark#(X1) a____#(__(X,Y),Z) -> mark#(Z) -> mark#(__(X1,X2)) -> a____#(mark(X1),mark(X2)) a____#(__(X,Y),Z) -> mark#(Z) -> mark#(__(X1,X2)) -> mark#(X1) a____#(__(X,Y),Z) -> mark#(Z) -> mark#(__(X1,X2)) -> mark#(X2) a____#(__(X,Y),Z) -> mark#(Y) -> mark#(isPal(X)) -> a__isPal#(X) a____#(__(X,Y),Z) -> mark#(Y) -> mark#(isNePal(X)) -> a__isNePal#(X) a____#(__(X,Y),Z) -> mark#(Y) -> mark#(isQid(X)) -> a__isQid#(X) a____#(__(X,Y),Z) -> mark#(Y) -> mark#(isNeList(X)) -> a__isNeList#(X) a____#(__(X,Y),Z) -> mark#(Y) -> mark#(isList(X)) -> a__isList#(X) a____#(__(X,Y),Z) -> mark#(Y) -> mark#(and(X1,X2)) -> a__and#(mark(X1),X2) a____#(__(X,Y),Z) -> mark#(Y) -> mark#(and(X1,X2)) -> mark#(X1) a____#(__(X,Y),Z) -> mark#(Y) -> mark#(__(X1,X2)) -> a____#(mark(X1),mark(X2)) a____#(__(X,Y),Z) -> mark#(Y) -> mark#(__(X1,X2)) -> mark#(X1) a____#(__(X,Y),Z) -> mark#(Y) -> mark#(__(X1,X2)) -> mark#(X2) a____#(__(X,Y),Z) -> mark#(X) -> mark#(isPal(X)) -> a__isPal#(X) a____#(__(X,Y),Z) -> mark#(X) -> mark#(isNePal(X)) -> a__isNePal#(X) a____#(__(X,Y),Z) -> mark#(X) -> mark#(isQid(X)) -> a__isQid#(X) a____#(__(X,Y),Z) -> mark#(X) -> mark#(isNeList(X)) -> a__isNeList#(X) a____#(__(X,Y),Z) -> mark#(X) -> mark#(isList(X)) -> a__isList#(X) a____#(__(X,Y),Z) -> mark#(X) -> mark#(and(X1,X2)) -> a__and#(mark(X1),X2) a____#(__(X,Y),Z) -> mark#(X) -> mark#(and(X1,X2)) -> mark#(X1) a____#(__(X,Y),Z) -> mark#(X) -> mark#(__(X1,X2)) -> a____#(mark(X1),mark(X2)) a____#(__(X,Y),Z) -> mark#(X) -> mark#(__(X1,X2)) -> mark#(X1) a____#(__(X,Y),Z) -> mark#(X) -> mark#(__(X1,X2)) -> mark#(X2) a____#(__(X,Y),Z) -> a____#(mark(Y),mark(Z)) -> a____#(nil(),X) -> mark#(X) a____#(__(X,Y),Z) -> a____#(mark(Y),mark(Z)) -> a____#(X,nil()) -> mark#(X) a____#(__(X,Y),Z) -> a____#(mark(Y),mark(Z)) -> a____#(__(X,Y),Z) -> a____#(mark(X),a____(mark(Y),mark(Z))) a____#(__(X,Y),Z) -> a____#(mark(Y),mark(Z)) -> a____#(__(X,Y),Z) -> mark#(X) a____#(__(X,Y),Z) -> a____#(mark(Y),mark(Z)) -> a____#(__(X,Y),Z) -> a____#(mark(Y),mark(Z)) a____#(__(X,Y),Z) -> a____#(mark(Y),mark(Z)) -> a____#(__(X,Y),Z) -> mark#(Y) a____#(__(X,Y),Z) -> a____#(mark(Y),mark(Z)) -> a____#(__(X,Y),Z) -> mark#(Z) a____#(__(X,Y),Z) -> a____#(mark(X),a____(mark(Y),mark(Z))) -> a____#(nil(),X) -> mark#(X) a____#(__(X,Y),Z) -> a____#(mark(X),a____(mark(Y),mark(Z))) -> a____#(X,nil()) -> mark#(X) a____#(__(X,Y),Z) -> a____#(mark(X),a____(mark(Y),mark(Z))) -> a____#(__(X,Y),Z) -> a____#(mark(X),a____(mark(Y),mark(Z))) a____#(__(X,Y),Z) -> a____#(mark(X),a____(mark(Y),mark(Z))) -> a____#(__(X,Y),Z) -> mark#(X) a____#(__(X,Y),Z) -> a____#(mark(X),a____(mark(Y),mark(Z))) -> a____#(__(X,Y),Z) -> a____#(mark(Y),mark(Z)) a____#(__(X,Y),Z) -> a____#(mark(X),a____(mark(Y),mark(Z))) -> a____#(__(X,Y),Z) -> mark#(Y) a____#(__(X,Y),Z) -> a____#(mark(X),a____(mark(Y),mark(Z))) -> a____#(__(X,Y),Z) -> mark#(Z) a____#(X,nil()) -> mark#(X) -> mark#(isPal(X)) -> a__isPal#(X) a____#(X,nil()) -> mark#(X) -> mark#(isNePal(X)) -> a__isNePal#(X) a____#(X,nil()) -> mark#(X) -> mark#(isQid(X)) -> a__isQid#(X) a____#(X,nil()) -> mark#(X) -> mark#(isNeList(X)) -> a__isNeList#(X) a____#(X,nil()) -> mark#(X) -> mark#(isList(X)) -> a__isList#(X) a____#(X,nil()) -> mark#(X) -> mark#(and(X1,X2)) -> a__and#(mark(X1),X2) a____#(X,nil()) -> mark#(X) -> mark#(and(X1,X2)) -> mark#(X1) a____#(X,nil()) -> mark#(X) -> mark#(__(X1,X2)) -> a____#(mark(X1),mark(X2)) a____#(X,nil()) -> mark#(X) -> mark#(__(X1,X2)) -> mark#(X1) a____#(X,nil()) -> mark#(X) -> mark#(__(X1,X2)) -> mark#(X2) SCC Processor: #sccs: 1 #rules: 26 #arcs: 147/900 DPs: a__isPal#(V) -> a__isNePal#(V) a__isNePal#(__(I,__(P,I))) -> a__and#(a__isQid(I),isPal(P)) a__and#(tt(),X) -> mark#(X) mark#(__(X1,X2)) -> mark#(X2) mark#(__(X1,X2)) -> mark#(X1) mark#(__(X1,X2)) -> a____#(mark(X1),mark(X2)) a____#(__(X,Y),Z) -> mark#(Z) mark#(and(X1,X2)) -> mark#(X1) mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(isList(X)) -> a__isList#(X) a__isList#(V) -> a__isNeList#(V) a__isNeList#(__(V1,V2)) -> a__isList#(V1) a__isList#(__(V1,V2)) -> a__isList#(V1) a__isList#(__(V1,V2)) -> a__and#(a__isList(V1),isList(V2)) a__isNeList#(__(V1,V2)) -> a__and#(a__isList(V1),isNeList(V2)) a__isNeList#(__(V1,V2)) -> a__isNeList#(V1) a__isNeList#(__(V1,V2)) -> a__and#(a__isNeList(V1),isList(V2)) mark#(isNeList(X)) -> a__isNeList#(X) mark#(isNePal(X)) -> a__isNePal#(X) mark#(isPal(X)) -> a__isPal#(X) a____#(__(X,Y),Z) -> mark#(Y) a____#(__(X,Y),Z) -> a____#(mark(Y),mark(Z)) a____#(__(X,Y),Z) -> mark#(X) a____#(__(X,Y),Z) -> a____#(mark(X),a____(mark(Y),mark(Z))) a____#(X,nil()) -> mark#(X) a____#(nil(),X) -> mark#(X) TRS: a____(__(X,Y),Z) -> a____(mark(X),a____(mark(Y),mark(Z))) a____(X,nil()) -> mark(X) a____(nil(),X) -> mark(X) a__and(tt(),X) -> mark(X) a__isList(V) -> a__isNeList(V) a__isList(nil()) -> tt() a__isList(__(V1,V2)) -> a__and(a__isList(V1),isList(V2)) a__isNeList(V) -> a__isQid(V) a__isNeList(__(V1,V2)) -> a__and(a__isList(V1),isNeList(V2)) a__isNeList(__(V1,V2)) -> a__and(a__isNeList(V1),isList(V2)) a__isNePal(V) -> a__isQid(V) a__isNePal(__(I,__(P,I))) -> a__and(a__isQid(I),isPal(P)) a__isPal(V) -> a__isNePal(V) a__isPal(nil()) -> tt() a__isQid(a()) -> tt() a__isQid(e()) -> tt() a__isQid(i()) -> tt() a__isQid(o()) -> tt() a__isQid(u()) -> tt() mark(__(X1,X2)) -> a____(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isList(X)) -> a__isList(X) mark(isNeList(X)) -> a__isNeList(X) mark(isQid(X)) -> a__isQid(X) mark(isNePal(X)) -> a__isNePal(X) mark(isPal(X)) -> a__isPal(X) mark(nil()) -> nil() mark(tt()) -> tt() mark(a()) -> a() mark(e()) -> e() mark(i()) -> i() mark(o()) -> o() mark(u()) -> u() a____(X1,X2) -> __(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isList(X) -> isList(X) a__isNeList(X) -> isNeList(X) a__isQid(X) -> isQid(X) a__isNePal(X) -> isNePal(X) a__isPal(X) -> isPal(X) Arctic Interpretation Processor: dimension: 1 interpretation: [a__isPal#](x0) = 5x0, [a__isNePal#](x0) = 4x0, [a__isNeList#](x0) = 4x0, [a__isList#](x0) = 4x0, [a__and#](x0, x1) = 2x0 + 4x1 + 0, [mark#](x0) = 4x0 + 0, [a____#](x0, x1) = 5x0 + 4x1 + 0, [isNePal](x0) = x0, [isQid](x0) = x0, [and](x0, x1) = x0 + x1 + 1, [u] = 7, [o] = 4, [i] = 1, [e] = 2, [a] = 2, [a__isPal](x0) = 1x0, [isPal](x0) = 1x0, [a__isNePal](x0) = x0, [isNeList](x0) = x0, [a__isQid](x0) = x0, [isList](x0) = x0 + 0, [a__isNeList](x0) = x0, [a__isList](x0) = x0 + 0, [a__and](x0, x1) = x0 + x1 + 1, [tt] = 1, [nil] = 2, [mark](x0) = x0 + 0, [a____](x0, x1) = 1x0 + x1 + 1, [__](x0, x1) = 1x0 + x1 + 1 orientation: a__isPal#(V) = 5V >= 4V = a__isNePal#(V) a__isNePal#(__(I,__(P,I))) = 5I + 5P + 5 >= 2I + 5P + 0 = a__and#(a__isQid(I),isPal(P)) a__and#(tt(),X) = 4X + 3 >= 4X + 0 = mark#(X) mark#(__(X1,X2)) = 5X1 + 4X2 + 5 >= 4X2 + 0 = mark#(X2) mark#(__(X1,X2)) = 5X1 + 4X2 + 5 >= 4X1 + 0 = mark#(X1) mark#(__(X1,X2)) = 5X1 + 4X2 + 5 >= 5X1 + 4X2 + 5 = a____#(mark(X1),mark(X2)) a____#(__(X,Y),Z) = 6X + 5Y + 4Z + 6 >= 4Z + 0 = mark#(Z) mark#(and(X1,X2)) = 4X1 + 4X2 + 5 >= 4X1 + 0 = mark#(X1) mark#(and(X1,X2)) = 4X1 + 4X2 + 5 >= 2X1 + 4X2 + 2 = a__and#(mark(X1),X2) mark#(isList(X)) = 4X + 4 >= 4X = a__isList#(X) a__isList#(V) = 4V >= 4V = a__isNeList#(V) a__isNeList#(__(V1,V2)) = 5V1 + 4V2 + 5 >= 4V1 = a__isList#(V1) a__isList#(__(V1,V2)) = 5V1 + 4V2 + 5 >= 4V1 = a__isList#(V1) a__isList#(__(V1,V2)) = 5V1 + 4V2 + 5 >= 2V1 + 4V2 + 4 = a__and#(a__isList(V1),isList(V2)) a__isNeList#(__(V1,V2)) = 5V1 + 4V2 + 5 >= 2V1 + 4V2 + 2 = a__and#(a__isList(V1),isNeList(V2)) a__isNeList#(__(V1,V2)) = 5V1 + 4V2 + 5 >= 4V1 = a__isNeList#(V1) a__isNeList#(__(V1,V2)) = 5V1 + 4V2 + 5 >= 2V1 + 4V2 + 4 = a__and#(a__isNeList(V1),isList(V2)) mark#(isNeList(X)) = 4X + 0 >= 4X = a__isNeList#(X) mark#(isNePal(X)) = 4X + 0 >= 4X = a__isNePal#(X) mark#(isPal(X)) = 5X + 0 >= 5X = a__isPal#(X) a____#(__(X,Y),Z) = 6X + 5Y + 4Z + 6 >= 4Y + 0 = mark#(Y) a____#(__(X,Y),Z) = 6X + 5Y + 4Z + 6 >= 5Y + 4Z + 5 = a____#(mark(Y),mark(Z)) a____#(__(X,Y),Z) = 6X + 5Y + 4Z + 6 >= 4X + 0 = mark#(X) a____#(__(X,Y),Z) = 6X + 5Y + 4Z + 6 >= 5X + 5Y + 4Z + 5 = a____#(mark(X),a____(mark(Y),mark(Z))) a____#(X,nil()) = 5X + 6 >= 4X + 0 = mark#(X) a____#(nil(),X) = 4X + 7 >= 4X + 0 = mark#(X) a____(__(X,Y),Z) = 2X + 1Y + Z + 2 >= 1X + 1Y + Z + 1 = a____(mark(X),a____(mark(Y),mark(Z))) a____(X,nil()) = 1X + 2 >= X + 0 = mark(X) a____(nil(),X) = X + 3 >= X + 0 = mark(X) a__and(tt(),X) = X + 1 >= X + 0 = mark(X) a__isList(V) = V + 0 >= V = a__isNeList(V) a__isList(nil()) = 2 >= 1 = tt() a__isList(__(V1,V2)) = 1V1 + V2 + 1 >= V1 + V2 + 1 = a__and(a__isList(V1),isList(V2)) a__isNeList(V) = V >= V = a__isQid(V) a__isNeList(__(V1,V2)) = 1V1 + V2 + 1 >= V1 + V2 + 1 = a__and(a__isList(V1),isNeList(V2)) a__isNeList(__(V1,V2)) = 1V1 + V2 + 1 >= V1 + V2 + 1 = a__and(a__isNeList(V1),isList(V2)) a__isNePal(V) = V >= V = a__isQid(V) a__isNePal(__(I,__(P,I))) = 1I + 1P + 1 >= I + 1P + 1 = a__and(a__isQid(I),isPal(P)) a__isPal(V) = 1V >= V = a__isNePal(V) a__isPal(nil()) = 3 >= 1 = tt() a__isQid(a()) = 2 >= 1 = tt() a__isQid(e()) = 2 >= 1 = tt() a__isQid(i()) = 1 >= 1 = tt() a__isQid(o()) = 4 >= 1 = tt() a__isQid(u()) = 7 >= 1 = tt() mark(__(X1,X2)) = 1X1 + X2 + 1 >= 1X1 + X2 + 1 = a____(mark(X1),mark(X2)) mark(and(X1,X2)) = X1 + X2 + 1 >= X1 + X2 + 1 = a__and(mark(X1),X2) mark(isList(X)) = X + 0 >= X + 0 = a__isList(X) mark(isNeList(X)) = X + 0 >= X = a__isNeList(X) mark(isQid(X)) = X + 0 >= X = a__isQid(X) mark(isNePal(X)) = X + 0 >= X = a__isNePal(X) mark(isPal(X)) = 1X + 0 >= 1X = a__isPal(X) mark(nil()) = 2 >= 2 = nil() mark(tt()) = 1 >= 1 = tt() mark(a()) = 2 >= 2 = a() mark(e()) = 2 >= 2 = e() mark(i()) = 1 >= 1 = i() mark(o()) = 4 >= 4 = o() mark(u()) = 7 >= 7 = u() a____(X1,X2) = 1X1 + X2 + 1 >= 1X1 + X2 + 1 = __(X1,X2) a__and(X1,X2) = X1 + X2 + 1 >= X1 + X2 + 1 = and(X1,X2) a__isList(X) = X + 0 >= X + 0 = isList(X) a__isNeList(X) = X >= X = isNeList(X) a__isQid(X) = X >= X = isQid(X) a__isNePal(X) = X >= X = isNePal(X) a__isPal(X) = 1X >= 1X = isPal(X) problem: DPs: a__isNePal#(__(I,__(P,I))) -> a__and#(a__isQid(I),isPal(P)) a__and#(tt(),X) -> mark#(X) mark#(__(X1,X2)) -> mark#(X2) mark#(__(X1,X2)) -> a____#(mark(X1),mark(X2)) a____#(__(X,Y),Z) -> mark#(Z) mark#(and(X1,X2)) -> mark#(X1) mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(isList(X)) -> a__isList#(X) a__isList#(V) -> a__isNeList#(V) a__isList#(__(V1,V2)) -> a__and#(a__isList(V1),isList(V2)) a__isNeList#(__(V1,V2)) -> a__and#(a__isList(V1),isNeList(V2)) a__isNeList#(__(V1,V2)) -> a__and#(a__isNeList(V1),isList(V2)) mark#(isNeList(X)) -> a__isNeList#(X) mark#(isNePal(X)) -> a__isNePal#(X) mark#(isPal(X)) -> a__isPal#(X) a____#(__(X,Y),Z) -> a____#(mark(Y),mark(Z)) a____#(__(X,Y),Z) -> a____#(mark(X),a____(mark(Y),mark(Z))) a____#(nil(),X) -> mark#(X) TRS: a____(__(X,Y),Z) -> a____(mark(X),a____(mark(Y),mark(Z))) a____(X,nil()) -> mark(X) a____(nil(),X) -> mark(X) a__and(tt(),X) -> mark(X) a__isList(V) -> a__isNeList(V) a__isList(nil()) -> tt() a__isList(__(V1,V2)) -> a__and(a__isList(V1),isList(V2)) a__isNeList(V) -> a__isQid(V) a__isNeList(__(V1,V2)) -> a__and(a__isList(V1),isNeList(V2)) a__isNeList(__(V1,V2)) -> a__and(a__isNeList(V1),isList(V2)) a__isNePal(V) -> a__isQid(V) a__isNePal(__(I,__(P,I))) -> a__and(a__isQid(I),isPal(P)) a__isPal(V) -> a__isNePal(V) a__isPal(nil()) -> tt() a__isQid(a()) -> tt() a__isQid(e()) -> tt() a__isQid(i()) -> tt() a__isQid(o()) -> tt() a__isQid(u()) -> tt() mark(__(X1,X2)) -> a____(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isList(X)) -> a__isList(X) mark(isNeList(X)) -> a__isNeList(X) mark(isQid(X)) -> a__isQid(X) mark(isNePal(X)) -> a__isNePal(X) mark(isPal(X)) -> a__isPal(X) mark(nil()) -> nil() mark(tt()) -> tt() mark(a()) -> a() mark(e()) -> e() mark(i()) -> i() mark(o()) -> o() mark(u()) -> u() a____(X1,X2) -> __(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isList(X) -> isList(X) a__isNeList(X) -> isNeList(X) a__isQid(X) -> isQid(X) a__isNePal(X) -> isNePal(X) a__isPal(X) -> isPal(X) SCC Processor: #sccs: 1 #rules: 17 #arcs: 131/324 DPs: a__isNePal#(__(I,__(P,I))) -> a__and#(a__isQid(I),isPal(P)) a__and#(tt(),X) -> mark#(X) mark#(__(X1,X2)) -> mark#(X2) mark#(__(X1,X2)) -> a____#(mark(X1),mark(X2)) a____#(__(X,Y),Z) -> mark#(Z) mark#(and(X1,X2)) -> mark#(X1) mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(isList(X)) -> a__isList#(X) a__isList#(V) -> a__isNeList#(V) a__isNeList#(__(V1,V2)) -> a__and#(a__isList(V1),isNeList(V2)) a__isNeList#(__(V1,V2)) -> a__and#(a__isNeList(V1),isList(V2)) a__isList#(__(V1,V2)) -> a__and#(a__isList(V1),isList(V2)) mark#(isNeList(X)) -> a__isNeList#(X) mark#(isNePal(X)) -> a__isNePal#(X) a____#(__(X,Y),Z) -> a____#(mark(Y),mark(Z)) a____#(__(X,Y),Z) -> a____#(mark(X),a____(mark(Y),mark(Z))) a____#(nil(),X) -> mark#(X) TRS: a____(__(X,Y),Z) -> a____(mark(X),a____(mark(Y),mark(Z))) a____(X,nil()) -> mark(X) a____(nil(),X) -> mark(X) a__and(tt(),X) -> mark(X) a__isList(V) -> a__isNeList(V) a__isList(nil()) -> tt() a__isList(__(V1,V2)) -> a__and(a__isList(V1),isList(V2)) a__isNeList(V) -> a__isQid(V) a__isNeList(__(V1,V2)) -> a__and(a__isList(V1),isNeList(V2)) a__isNeList(__(V1,V2)) -> a__and(a__isNeList(V1),isList(V2)) a__isNePal(V) -> a__isQid(V) a__isNePal(__(I,__(P,I))) -> a__and(a__isQid(I),isPal(P)) a__isPal(V) -> a__isNePal(V) a__isPal(nil()) -> tt() a__isQid(a()) -> tt() a__isQid(e()) -> tt() a__isQid(i()) -> tt() a__isQid(o()) -> tt() a__isQid(u()) -> tt() mark(__(X1,X2)) -> a____(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isList(X)) -> a__isList(X) mark(isNeList(X)) -> a__isNeList(X) mark(isQid(X)) -> a__isQid(X) mark(isNePal(X)) -> a__isNePal(X) mark(isPal(X)) -> a__isPal(X) mark(nil()) -> nil() mark(tt()) -> tt() mark(a()) -> a() mark(e()) -> e() mark(i()) -> i() mark(o()) -> o() mark(u()) -> u() a____(X1,X2) -> __(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isList(X) -> isList(X) a__isNeList(X) -> isNeList(X) a__isQid(X) -> isQid(X) a__isNePal(X) -> isNePal(X) a__isPal(X) -> isPal(X) Matrix Interpretation Processor: dim=1 interpretation: [a__isNePal#](x0) = 1/2, [a__isNeList#](x0) = 1/2, [a__isList#](x0) = 1/2, [a__and#](x0, x1) = x0 + x1 + 1/2, [mark#](x0) = x0 + 1/2, [a____#](x0, x1) = 2x0 + x1 + 1/2, [isNePal](x0) = 0, [isQid](x0) = 0, [and](x0, x1) = x0 + x1, [u] = 1, [o] = 1, [i] = 3, [e] = 2, [a] = 2, [a__isPal](x0) = 0, [isPal](x0) = 0, [a__isNePal](x0) = 0, [isNeList](x0) = 0, [a__isQid](x0) = 0, [isList](x0) = 0, [a__isNeList](x0) = 0, [a__isList](x0) = 0, [a__and](x0, x1) = x0 + x1, [tt] = 0, [nil] = 3, [mark](x0) = x0, [a____](x0, x1) = 2x0 + x1, [__](x0, x1) = 2x0 + x1 orientation: a__isNePal#(__(I,__(P,I))) = 1/2 >= 1/2 = a__and#(a__isQid(I),isPal(P)) a__and#(tt(),X) = X + 1/2 >= X + 1/2 = mark#(X) mark#(__(X1,X2)) = 2X1 + X2 + 1/2 >= X2 + 1/2 = mark#(X2) mark#(__(X1,X2)) = 2X1 + X2 + 1/2 >= 2X1 + X2 + 1/2 = a____#(mark(X1),mark(X2)) a____#(__(X,Y),Z) = 4X + 2Y + Z + 1/2 >= Z + 1/2 = mark#(Z) mark#(and(X1,X2)) = X1 + X2 + 1/2 >= X1 + 1/2 = mark#(X1) mark#(and(X1,X2)) = X1 + X2 + 1/2 >= X1 + X2 + 1/2 = a__and#(mark(X1),X2) mark#(isList(X)) = 1/2 >= 1/2 = a__isList#(X) a__isList#(V) = 1/2 >= 1/2 = a__isNeList#(V) a__isNeList#(__(V1,V2)) = 1/2 >= 1/2 = a__and#(a__isList(V1),isNeList(V2)) a__isNeList#(__(V1,V2)) = 1/2 >= 1/2 = a__and#(a__isNeList(V1),isList(V2)) a__isList#(__(V1,V2)) = 1/2 >= 1/2 = a__and#(a__isList(V1),isList(V2)) mark#(isNeList(X)) = 1/2 >= 1/2 = a__isNeList#(X) mark#(isNePal(X)) = 1/2 >= 1/2 = a__isNePal#(X) a____#(__(X,Y),Z) = 4X + 2Y + Z + 1/2 >= 2Y + Z + 1/2 = a____#(mark(Y),mark(Z)) a____#(__(X,Y),Z) = 4X + 2Y + Z + 1/2 >= 2X + 2Y + Z + 1/2 = a____#(mark(X),a____(mark(Y),mark(Z))) a____#(nil(),X) = X + 13/2 >= X + 1/2 = mark#(X) a____(__(X,Y),Z) = 4X + 2Y + Z >= 2X + 2Y + Z = a____(mark(X),a____(mark(Y),mark(Z))) a____(X,nil()) = 2X + 3 >= X = mark(X) a____(nil(),X) = X + 6 >= X = mark(X) a__and(tt(),X) = X >= X = mark(X) a__isList(V) = 0 >= 0 = a__isNeList(V) a__isList(nil()) = 0 >= 0 = tt() a__isList(__(V1,V2)) = 0 >= 0 = a__and(a__isList(V1),isList(V2)) a__isNeList(V) = 0 >= 0 = a__isQid(V) a__isNeList(__(V1,V2)) = 0 >= 0 = a__and(a__isList(V1),isNeList(V2)) a__isNeList(__(V1,V2)) = 0 >= 0 = a__and(a__isNeList(V1),isList(V2)) a__isNePal(V) = 0 >= 0 = a__isQid(V) a__isNePal(__(I,__(P,I))) = 0 >= 0 = a__and(a__isQid(I),isPal(P)) a__isPal(V) = 0 >= 0 = a__isNePal(V) a__isPal(nil()) = 0 >= 0 = tt() a__isQid(a()) = 0 >= 0 = tt() a__isQid(e()) = 0 >= 0 = tt() a__isQid(i()) = 0 >= 0 = tt() a__isQid(o()) = 0 >= 0 = tt() a__isQid(u()) = 0 >= 0 = tt() mark(__(X1,X2)) = 2X1 + X2 >= 2X1 + X2 = a____(mark(X1),mark(X2)) mark(and(X1,X2)) = X1 + X2 >= X1 + X2 = a__and(mark(X1),X2) mark(isList(X)) = 0 >= 0 = a__isList(X) mark(isNeList(X)) = 0 >= 0 = a__isNeList(X) mark(isQid(X)) = 0 >= 0 = a__isQid(X) mark(isNePal(X)) = 0 >= 0 = a__isNePal(X) mark(isPal(X)) = 0 >= 0 = a__isPal(X) mark(nil()) = 3 >= 3 = nil() mark(tt()) = 0 >= 0 = tt() mark(a()) = 2 >= 2 = a() mark(e()) = 2 >= 2 = e() mark(i()) = 3 >= 3 = i() mark(o()) = 1 >= 1 = o() mark(u()) = 1 >= 1 = u() a____(X1,X2) = 2X1 + X2 >= 2X1 + X2 = __(X1,X2) a__and(X1,X2) = X1 + X2 >= X1 + X2 = and(X1,X2) a__isList(X) = 0 >= 0 = isList(X) a__isNeList(X) = 0 >= 0 = isNeList(X) a__isQid(X) = 0 >= 0 = isQid(X) a__isNePal(X) = 0 >= 0 = isNePal(X) a__isPal(X) = 0 >= 0 = isPal(X) problem: DPs: a__isNePal#(__(I,__(P,I))) -> a__and#(a__isQid(I),isPal(P)) a__and#(tt(),X) -> mark#(X) mark#(__(X1,X2)) -> mark#(X2) mark#(__(X1,X2)) -> a____#(mark(X1),mark(X2)) a____#(__(X,Y),Z) -> mark#(Z) mark#(and(X1,X2)) -> mark#(X1) mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(isList(X)) -> a__isList#(X) a__isList#(V) -> a__isNeList#(V) a__isNeList#(__(V1,V2)) -> a__and#(a__isList(V1),isNeList(V2)) a__isNeList#(__(V1,V2)) -> a__and#(a__isNeList(V1),isList(V2)) a__isList#(__(V1,V2)) -> a__and#(a__isList(V1),isList(V2)) mark#(isNeList(X)) -> a__isNeList#(X) mark#(isNePal(X)) -> a__isNePal#(X) a____#(__(X,Y),Z) -> a____#(mark(Y),mark(Z)) a____#(__(X,Y),Z) -> a____#(mark(X),a____(mark(Y),mark(Z))) TRS: a____(__(X,Y),Z) -> a____(mark(X),a____(mark(Y),mark(Z))) a____(X,nil()) -> mark(X) a____(nil(),X) -> mark(X) a__and(tt(),X) -> mark(X) a__isList(V) -> a__isNeList(V) a__isList(nil()) -> tt() a__isList(__(V1,V2)) -> a__and(a__isList(V1),isList(V2)) a__isNeList(V) -> a__isQid(V) a__isNeList(__(V1,V2)) -> a__and(a__isList(V1),isNeList(V2)) a__isNeList(__(V1,V2)) -> a__and(a__isNeList(V1),isList(V2)) a__isNePal(V) -> a__isQid(V) a__isNePal(__(I,__(P,I))) -> a__and(a__isQid(I),isPal(P)) a__isPal(V) -> a__isNePal(V) a__isPal(nil()) -> tt() a__isQid(a()) -> tt() a__isQid(e()) -> tt() a__isQid(i()) -> tt() a__isQid(o()) -> tt() a__isQid(u()) -> tt() mark(__(X1,X2)) -> a____(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isList(X)) -> a__isList(X) mark(isNeList(X)) -> a__isNeList(X) mark(isQid(X)) -> a__isQid(X) mark(isNePal(X)) -> a__isNePal(X) mark(isPal(X)) -> a__isPal(X) mark(nil()) -> nil() mark(tt()) -> tt() mark(a()) -> a() mark(e()) -> e() mark(i()) -> i() mark(o()) -> o() mark(u()) -> u() a____(X1,X2) -> __(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isList(X) -> isList(X) a__isNeList(X) -> isNeList(X) a__isQid(X) -> isQid(X) a__isNePal(X) -> isNePal(X) a__isPal(X) -> isPal(X) Arctic Interpretation Processor: dimension: 1 interpretation: [a__isNePal#](x0) = x0, [a__isNeList#](x0) = 1x0 + 7, [a__isList#](x0) = 1x0 + 7, [a__and#](x0, x1) = x0 + x1 + 0, [mark#](x0) = x0 + 0, [a____#](x0, x1) = 1x0 + x1, [isNePal](x0) = 1x0, [isQid](x0) = x0, [and](x0, x1) = x0 + x1, [u] = 1, [o] = 0, [i] = 7, [e] = 4, [a] = 2, [a__isPal](x0) = 1x0, [isPal](x0) = 1x0, [a__isNePal](x0) = 1x0, [isNeList](x0) = 1x0 + 7, [a__isQid](x0) = x0, [isList](x0) = 1x0 + 7, [a__isNeList](x0) = 1x0 + 7, [a__isList](x0) = 1x0 + 7, [a__and](x0, x1) = x0 + x1, [tt] = 0, [nil] = 6, [mark](x0) = x0, [a____](x0, x1) = 1x0 + x1 + 0, [__](x0, x1) = 1x0 + x1 + 0 orientation: a__isNePal#(__(I,__(P,I))) = 1I + 1P + 0 >= I + 1P + 0 = a__and#(a__isQid(I),isPal(P)) a__and#(tt(),X) = X + 0 >= X + 0 = mark#(X) mark#(__(X1,X2)) = 1X1 + X2 + 0 >= X2 + 0 = mark#(X2) mark#(__(X1,X2)) = 1X1 + X2 + 0 >= 1X1 + X2 = a____#(mark(X1),mark(X2)) a____#(__(X,Y),Z) = 2X + 1Y + Z + 1 >= Z + 0 = mark#(Z) mark#(and(X1,X2)) = X1 + X2 + 0 >= X1 + 0 = mark#(X1) mark#(and(X1,X2)) = X1 + X2 + 0 >= X1 + X2 + 0 = a__and#(mark(X1),X2) mark#(isList(X)) = 1X + 7 >= 1X + 7 = a__isList#(X) a__isList#(V) = 1V + 7 >= 1V + 7 = a__isNeList#(V) a__isNeList#(__(V1,V2)) = 2V1 + 1V2 + 7 >= 1V1 + 1V2 + 7 = a__and#(a__isList(V1),isNeList(V2)) a__isNeList#(__(V1,V2)) = 2V1 + 1V2 + 7 >= 1V1 + 1V2 + 7 = a__and#(a__isNeList(V1),isList(V2)) a__isList#(__(V1,V2)) = 2V1 + 1V2 + 7 >= 1V1 + 1V2 + 7 = a__and#(a__isList(V1),isList(V2)) mark#(isNeList(X)) = 1X + 7 >= 1X + 7 = a__isNeList#(X) mark#(isNePal(X)) = 1X + 0 >= X = a__isNePal#(X) a____#(__(X,Y),Z) = 2X + 1Y + Z + 1 >= 1Y + Z = a____#(mark(Y),mark(Z)) a____#(__(X,Y),Z) = 2X + 1Y + Z + 1 >= 1X + 1Y + Z + 0 = a____#(mark(X),a____(mark(Y),mark(Z))) a____(__(X,Y),Z) = 2X + 1Y + Z + 1 >= 1X + 1Y + Z + 0 = a____(mark(X),a____(mark(Y),mark(Z))) a____(X,nil()) = 1X + 6 >= X = mark(X) a____(nil(),X) = X + 7 >= X = mark(X) a__and(tt(),X) = X + 0 >= X = mark(X) a__isList(V) = 1V + 7 >= 1V + 7 = a__isNeList(V) a__isList(nil()) = 7 >= 0 = tt() a__isList(__(V1,V2)) = 2V1 + 1V2 + 7 >= 1V1 + 1V2 + 7 = a__and(a__isList(V1),isList(V2)) a__isNeList(V) = 1V + 7 >= V = a__isQid(V) a__isNeList(__(V1,V2)) = 2V1 + 1V2 + 7 >= 1V1 + 1V2 + 7 = a__and(a__isList(V1),isNeList(V2)) a__isNeList(__(V1,V2)) = 2V1 + 1V2 + 7 >= 1V1 + 1V2 + 7 = a__and(a__isNeList(V1),isList(V2)) a__isNePal(V) = 1V >= V = a__isQid(V) a__isNePal(__(I,__(P,I))) = 2I + 2P + 1 >= I + 1P = a__and(a__isQid(I),isPal(P)) a__isPal(V) = 1V >= 1V = a__isNePal(V) a__isPal(nil()) = 7 >= 0 = tt() a__isQid(a()) = 2 >= 0 = tt() a__isQid(e()) = 4 >= 0 = tt() a__isQid(i()) = 7 >= 0 = tt() a__isQid(o()) = 0 >= 0 = tt() a__isQid(u()) = 1 >= 0 = tt() mark(__(X1,X2)) = 1X1 + X2 + 0 >= 1X1 + X2 + 0 = a____(mark(X1),mark(X2)) mark(and(X1,X2)) = X1 + X2 >= X1 + X2 = a__and(mark(X1),X2) mark(isList(X)) = 1X + 7 >= 1X + 7 = a__isList(X) mark(isNeList(X)) = 1X + 7 >= 1X + 7 = a__isNeList(X) mark(isQid(X)) = X >= X = a__isQid(X) mark(isNePal(X)) = 1X >= 1X = a__isNePal(X) mark(isPal(X)) = 1X >= 1X = a__isPal(X) mark(nil()) = 6 >= 6 = nil() mark(tt()) = 0 >= 0 = tt() mark(a()) = 2 >= 2 = a() mark(e()) = 4 >= 4 = e() mark(i()) = 7 >= 7 = i() mark(o()) = 0 >= 0 = o() mark(u()) = 1 >= 1 = u() a____(X1,X2) = 1X1 + X2 + 0 >= 1X1 + X2 + 0 = __(X1,X2) a__and(X1,X2) = X1 + X2 >= X1 + X2 = and(X1,X2) a__isList(X) = 1X + 7 >= 1X + 7 = isList(X) a__isNeList(X) = 1X + 7 >= 1X + 7 = isNeList(X) a__isQid(X) = X >= X = isQid(X) a__isNePal(X) = 1X >= 1X = isNePal(X) a__isPal(X) = 1X >= 1X = isPal(X) problem: DPs: a__isNePal#(__(I,__(P,I))) -> a__and#(a__isQid(I),isPal(P)) a__and#(tt(),X) -> mark#(X) mark#(__(X1,X2)) -> mark#(X2) mark#(__(X1,X2)) -> a____#(mark(X1),mark(X2)) a____#(__(X,Y),Z) -> mark#(Z) mark#(and(X1,X2)) -> mark#(X1) mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(isList(X)) -> a__isList#(X) a__isList#(V) -> a__isNeList#(V) a__isNeList#(__(V1,V2)) -> a__and#(a__isList(V1),isNeList(V2)) a__isNeList#(__(V1,V2)) -> a__and#(a__isNeList(V1),isList(V2)) a__isList#(__(V1,V2)) -> a__and#(a__isList(V1),isList(V2)) mark#(isNeList(X)) -> a__isNeList#(X) a____#(__(X,Y),Z) -> a____#(mark(Y),mark(Z)) a____#(__(X,Y),Z) -> a____#(mark(X),a____(mark(Y),mark(Z))) TRS: a____(__(X,Y),Z) -> a____(mark(X),a____(mark(Y),mark(Z))) a____(X,nil()) -> mark(X) a____(nil(),X) -> mark(X) a__and(tt(),X) -> mark(X) a__isList(V) -> a__isNeList(V) a__isList(nil()) -> tt() a__isList(__(V1,V2)) -> a__and(a__isList(V1),isList(V2)) a__isNeList(V) -> a__isQid(V) a__isNeList(__(V1,V2)) -> a__and(a__isList(V1),isNeList(V2)) a__isNeList(__(V1,V2)) -> a__and(a__isNeList(V1),isList(V2)) a__isNePal(V) -> a__isQid(V) a__isNePal(__(I,__(P,I))) -> a__and(a__isQid(I),isPal(P)) a__isPal(V) -> a__isNePal(V) a__isPal(nil()) -> tt() a__isQid(a()) -> tt() a__isQid(e()) -> tt() a__isQid(i()) -> tt() a__isQid(o()) -> tt() a__isQid(u()) -> tt() mark(__(X1,X2)) -> a____(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isList(X)) -> a__isList(X) mark(isNeList(X)) -> a__isNeList(X) mark(isQid(X)) -> a__isQid(X) mark(isNePal(X)) -> a__isNePal(X) mark(isPal(X)) -> a__isPal(X) mark(nil()) -> nil() mark(tt()) -> tt() mark(a()) -> a() mark(e()) -> e() mark(i()) -> i() mark(o()) -> o() mark(u()) -> u() a____(X1,X2) -> __(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isList(X) -> isList(X) a__isNeList(X) -> isNeList(X) a__isQid(X) -> isQid(X) a__isNePal(X) -> isNePal(X) a__isPal(X) -> isPal(X) SCC Processor: #sccs: 1 #rules: 14 #arcs: 59/225 DPs: a__and#(tt(),X) -> mark#(X) mark#(__(X1,X2)) -> mark#(X2) mark#(__(X1,X2)) -> a____#(mark(X1),mark(X2)) a____#(__(X,Y),Z) -> mark#(Z) mark#(and(X1,X2)) -> mark#(X1) mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(isList(X)) -> a__isList#(X) a__isList#(V) -> a__isNeList#(V) a__isNeList#(__(V1,V2)) -> a__and#(a__isList(V1),isNeList(V2)) a__isNeList#(__(V1,V2)) -> a__and#(a__isNeList(V1),isList(V2)) a__isList#(__(V1,V2)) -> a__and#(a__isList(V1),isList(V2)) mark#(isNeList(X)) -> a__isNeList#(X) a____#(__(X,Y),Z) -> a____#(mark(Y),mark(Z)) a____#(__(X,Y),Z) -> a____#(mark(X),a____(mark(Y),mark(Z))) TRS: a____(__(X,Y),Z) -> a____(mark(X),a____(mark(Y),mark(Z))) a____(X,nil()) -> mark(X) a____(nil(),X) -> mark(X) a__and(tt(),X) -> mark(X) a__isList(V) -> a__isNeList(V) a__isList(nil()) -> tt() a__isList(__(V1,V2)) -> a__and(a__isList(V1),isList(V2)) a__isNeList(V) -> a__isQid(V) a__isNeList(__(V1,V2)) -> a__and(a__isList(V1),isNeList(V2)) a__isNeList(__(V1,V2)) -> a__and(a__isNeList(V1),isList(V2)) a__isNePal(V) -> a__isQid(V) a__isNePal(__(I,__(P,I))) -> a__and(a__isQid(I),isPal(P)) a__isPal(V) -> a__isNePal(V) a__isPal(nil()) -> tt() a__isQid(a()) -> tt() a__isQid(e()) -> tt() a__isQid(i()) -> tt() a__isQid(o()) -> tt() a__isQid(u()) -> tt() mark(__(X1,X2)) -> a____(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isList(X)) -> a__isList(X) mark(isNeList(X)) -> a__isNeList(X) mark(isQid(X)) -> a__isQid(X) mark(isNePal(X)) -> a__isNePal(X) mark(isPal(X)) -> a__isPal(X) mark(nil()) -> nil() mark(tt()) -> tt() mark(a()) -> a() mark(e()) -> e() mark(i()) -> i() mark(o()) -> o() mark(u()) -> u() a____(X1,X2) -> __(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isList(X) -> isList(X) a__isNeList(X) -> isNeList(X) a__isQid(X) -> isQid(X) a__isNePal(X) -> isNePal(X) a__isPal(X) -> isPal(X) Matrix Interpretation Processor: dim=1 interpretation: [a__isNeList#](x0) = 2x0, [a__isList#](x0) = 2x0 + 2, [a__and#](x0, x1) = x1, [mark#](x0) = x0, [a____#](x0, x1) = 3x0 + x1, [isNePal](x0) = 5/2x0, [isQid](x0) = 2x0, [and](x0, x1) = 2x0 + x1, [u] = 2, [o] = 1, [i] = 5/2, [e] = 5/2, [a] = 2, [a__isPal](x0) = 3x0 + 3, [isPal](x0) = 3x0 + 3, [a__isNePal](x0) = 5/2x0, [isNeList](x0) = 2x0, [a__isQid](x0) = 2x0, [isList](x0) = 2x0 + 2, [a__isNeList](x0) = 2x0, [a__isList](x0) = 2x0 + 2, [a__and](x0, x1) = 2x0 + x1, [tt] = 2, [nil] = 0, [mark](x0) = x0, [a____](x0, x1) = 3x0 + x1 + 2, [__](x0, x1) = 3x0 + x1 + 2 orientation: a__and#(tt(),X) = X >= X = mark#(X) mark#(__(X1,X2)) = 3X1 + X2 + 2 >= X2 = mark#(X2) mark#(__(X1,X2)) = 3X1 + X2 + 2 >= 3X1 + X2 = a____#(mark(X1),mark(X2)) a____#(__(X,Y),Z) = 9X + 3Y + Z + 6 >= Z = mark#(Z) mark#(and(X1,X2)) = 2X1 + X2 >= X1 = mark#(X1) mark#(and(X1,X2)) = 2X1 + X2 >= X2 = a__and#(mark(X1),X2) mark#(isList(X)) = 2X + 2 >= 2X + 2 = a__isList#(X) a__isList#(V) = 2V + 2 >= 2V = a__isNeList#(V) a__isNeList#(__(V1,V2)) = 6V1 + 2V2 + 4 >= 2V2 = a__and#(a__isList(V1),isNeList(V2)) a__isNeList#(__(V1,V2)) = 6V1 + 2V2 + 4 >= 2V2 + 2 = a__and#(a__isNeList(V1),isList(V2)) a__isList#(__(V1,V2)) = 6V1 + 2V2 + 6 >= 2V2 + 2 = a__and#(a__isList(V1),isList(V2)) mark#(isNeList(X)) = 2X >= 2X = a__isNeList#(X) a____#(__(X,Y),Z) = 9X + 3Y + Z + 6 >= 3Y + Z = a____#(mark(Y),mark(Z)) a____#(__(X,Y),Z) = 9X + 3Y + Z + 6 >= 3X + 3Y + Z + 2 = a____#(mark(X),a____(mark(Y),mark(Z))) a____(__(X,Y),Z) = 9X + 3Y + Z + 8 >= 3X + 3Y + Z + 4 = a____(mark(X),a____(mark(Y),mark(Z))) a____(X,nil()) = 3X + 2 >= X = mark(X) a____(nil(),X) = X + 2 >= X = mark(X) a__and(tt(),X) = X + 4 >= X = mark(X) a__isList(V) = 2V + 2 >= 2V = a__isNeList(V) a__isList(nil()) = 2 >= 2 = tt() a__isList(__(V1,V2)) = 6V1 + 2V2 + 6 >= 4V1 + 2V2 + 6 = a__and(a__isList(V1),isList(V2)) a__isNeList(V) = 2V >= 2V = a__isQid(V) a__isNeList(__(V1,V2)) = 6V1 + 2V2 + 4 >= 4V1 + 2V2 + 4 = a__and(a__isList(V1),isNeList(V2)) a__isNeList(__(V1,V2)) = 6V1 + 2V2 + 4 >= 4V1 + 2V2 + 2 = a__and(a__isNeList(V1),isList(V2)) a__isNePal(V) = 5/2V >= 2V = a__isQid(V) a__isNePal(__(I,__(P,I))) = 10I + 15/2P + 10 >= 4I + 3P + 3 = a__and(a__isQid(I),isPal(P)) a__isPal(V) = 3V + 3 >= 5/2V = a__isNePal(V) a__isPal(nil()) = 3 >= 2 = tt() a__isQid(a()) = 4 >= 2 = tt() a__isQid(e()) = 5 >= 2 = tt() a__isQid(i()) = 5 >= 2 = tt() a__isQid(o()) = 2 >= 2 = tt() a__isQid(u()) = 4 >= 2 = tt() mark(__(X1,X2)) = 3X1 + X2 + 2 >= 3X1 + X2 + 2 = a____(mark(X1),mark(X2)) mark(and(X1,X2)) = 2X1 + X2 >= 2X1 + X2 = a__and(mark(X1),X2) mark(isList(X)) = 2X + 2 >= 2X + 2 = a__isList(X) mark(isNeList(X)) = 2X >= 2X = a__isNeList(X) mark(isQid(X)) = 2X >= 2X = a__isQid(X) mark(isNePal(X)) = 5/2X >= 5/2X = a__isNePal(X) mark(isPal(X)) = 3X + 3 >= 3X + 3 = a__isPal(X) mark(nil()) = 0 >= 0 = nil() mark(tt()) = 2 >= 2 = tt() mark(a()) = 2 >= 2 = a() mark(e()) = 5/2 >= 5/2 = e() mark(i()) = 5/2 >= 5/2 = i() mark(o()) = 1 >= 1 = o() mark(u()) = 2 >= 2 = u() a____(X1,X2) = 3X1 + X2 + 2 >= 3X1 + X2 + 2 = __(X1,X2) a__and(X1,X2) = 2X1 + X2 >= 2X1 + X2 = and(X1,X2) a__isList(X) = 2X + 2 >= 2X + 2 = isList(X) a__isNeList(X) = 2X >= 2X = isNeList(X) a__isQid(X) = 2X >= 2X = isQid(X) a__isNePal(X) = 5/2X >= 5/2X = isNePal(X) a__isPal(X) = 3X + 3 >= 3X + 3 = isPal(X) problem: DPs: a__and#(tt(),X) -> mark#(X) mark#(and(X1,X2)) -> mark#(X1) mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(isList(X)) -> a__isList#(X) mark#(isNeList(X)) -> a__isNeList#(X) TRS: a____(__(X,Y),Z) -> a____(mark(X),a____(mark(Y),mark(Z))) a____(X,nil()) -> mark(X) a____(nil(),X) -> mark(X) a__and(tt(),X) -> mark(X) a__isList(V) -> a__isNeList(V) a__isList(nil()) -> tt() a__isList(__(V1,V2)) -> a__and(a__isList(V1),isList(V2)) a__isNeList(V) -> a__isQid(V) a__isNeList(__(V1,V2)) -> a__and(a__isList(V1),isNeList(V2)) a__isNeList(__(V1,V2)) -> a__and(a__isNeList(V1),isList(V2)) a__isNePal(V) -> a__isQid(V) a__isNePal(__(I,__(P,I))) -> a__and(a__isQid(I),isPal(P)) a__isPal(V) -> a__isNePal(V) a__isPal(nil()) -> tt() a__isQid(a()) -> tt() a__isQid(e()) -> tt() a__isQid(i()) -> tt() a__isQid(o()) -> tt() a__isQid(u()) -> tt() mark(__(X1,X2)) -> a____(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isList(X)) -> a__isList(X) mark(isNeList(X)) -> a__isNeList(X) mark(isQid(X)) -> a__isQid(X) mark(isNePal(X)) -> a__isNePal(X) mark(isPal(X)) -> a__isPal(X) mark(nil()) -> nil() mark(tt()) -> tt() mark(a()) -> a() mark(e()) -> e() mark(i()) -> i() mark(o()) -> o() mark(u()) -> u() a____(X1,X2) -> __(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isList(X) -> isList(X) a__isNeList(X) -> isNeList(X) a__isQid(X) -> isQid(X) a__isNePal(X) -> isNePal(X) a__isPal(X) -> isPal(X) SCC Processor: #sccs: 1 #rules: 3 #arcs: 43/25 DPs: a__and#(tt(),X) -> mark#(X) mark#(and(X1,X2)) -> mark#(X1) mark#(and(X1,X2)) -> a__and#(mark(X1),X2) TRS: a____(__(X,Y),Z) -> a____(mark(X),a____(mark(Y),mark(Z))) a____(X,nil()) -> mark(X) a____(nil(),X) -> mark(X) a__and(tt(),X) -> mark(X) a__isList(V) -> a__isNeList(V) a__isList(nil()) -> tt() a__isList(__(V1,V2)) -> a__and(a__isList(V1),isList(V2)) a__isNeList(V) -> a__isQid(V) a__isNeList(__(V1,V2)) -> a__and(a__isList(V1),isNeList(V2)) a__isNeList(__(V1,V2)) -> a__and(a__isNeList(V1),isList(V2)) a__isNePal(V) -> a__isQid(V) a__isNePal(__(I,__(P,I))) -> a__and(a__isQid(I),isPal(P)) a__isPal(V) -> a__isNePal(V) a__isPal(nil()) -> tt() a__isQid(a()) -> tt() a__isQid(e()) -> tt() a__isQid(i()) -> tt() a__isQid(o()) -> tt() a__isQid(u()) -> tt() mark(__(X1,X2)) -> a____(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isList(X)) -> a__isList(X) mark(isNeList(X)) -> a__isNeList(X) mark(isQid(X)) -> a__isQid(X) mark(isNePal(X)) -> a__isNePal(X) mark(isPal(X)) -> a__isPal(X) mark(nil()) -> nil() mark(tt()) -> tt() mark(a()) -> a() mark(e()) -> e() mark(i()) -> i() mark(o()) -> o() mark(u()) -> u() a____(X1,X2) -> __(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isList(X) -> isList(X) a__isNeList(X) -> isNeList(X) a__isQid(X) -> isQid(X) a__isNePal(X) -> isNePal(X) a__isPal(X) -> isPal(X) Subterm Criterion Processor: simple projection: pi(mark#) = 0 pi(a__and#) = 1 problem: DPs: a__and#(tt(),X) -> mark#(X) TRS: a____(__(X,Y),Z) -> a____(mark(X),a____(mark(Y),mark(Z))) a____(X,nil()) -> mark(X) a____(nil(),X) -> mark(X) a__and(tt(),X) -> mark(X) a__isList(V) -> a__isNeList(V) a__isList(nil()) -> tt() a__isList(__(V1,V2)) -> a__and(a__isList(V1),isList(V2)) a__isNeList(V) -> a__isQid(V) a__isNeList(__(V1,V2)) -> a__and(a__isList(V1),isNeList(V2)) a__isNeList(__(V1,V2)) -> a__and(a__isNeList(V1),isList(V2)) a__isNePal(V) -> a__isQid(V) a__isNePal(__(I,__(P,I))) -> a__and(a__isQid(I),isPal(P)) a__isPal(V) -> a__isNePal(V) a__isPal(nil()) -> tt() a__isQid(a()) -> tt() a__isQid(e()) -> tt() a__isQid(i()) -> tt() a__isQid(o()) -> tt() a__isQid(u()) -> tt() mark(__(X1,X2)) -> a____(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isList(X)) -> a__isList(X) mark(isNeList(X)) -> a__isNeList(X) mark(isQid(X)) -> a__isQid(X) mark(isNePal(X)) -> a__isNePal(X) mark(isPal(X)) -> a__isPal(X) mark(nil()) -> nil() mark(tt()) -> tt() mark(a()) -> a() mark(e()) -> e() mark(i()) -> i() mark(o()) -> o() mark(u()) -> u() a____(X1,X2) -> __(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isList(X) -> isList(X) a__isNeList(X) -> isNeList(X) a__isQid(X) -> isQid(X) a__isNePal(X) -> isNePal(X) a__isPal(X) -> isPal(X) SCC Processor: #sccs: 0 #rules: 0 #arcs: 5/1