YES Problem: __(__(X,Y),Z) -> __(X,__(Y,Z)) __(X,nil()) -> X __(nil(),X) -> X U11(tt()) -> tt() U21(tt(),V2) -> U22(isList(activate(V2))) U22(tt()) -> tt() U31(tt()) -> tt() U41(tt(),V2) -> U42(isNeList(activate(V2))) U42(tt()) -> tt() U51(tt(),V2) -> U52(isList(activate(V2))) U52(tt()) -> tt() U61(tt()) -> tt() U71(tt(),P) -> U72(isPal(activate(P))) U72(tt()) -> tt() U81(tt()) -> tt() isList(V) -> U11(isNeList(activate(V))) isList(n__nil()) -> tt() isList(n____(V1,V2)) -> U21(isList(activate(V1)),activate(V2)) isNeList(V) -> U31(isQid(activate(V))) isNeList(n____(V1,V2)) -> U41(isList(activate(V1)),activate(V2)) isNeList(n____(V1,V2)) -> U51(isNeList(activate(V1)),activate(V2)) isNePal(V) -> U61(isQid(activate(V))) isNePal(n____(I,n____(P,I))) -> U71(isQid(activate(I)),activate(P)) isPal(V) -> U81(isNePal(activate(V))) isPal(n__nil()) -> tt() isQid(n__a()) -> tt() isQid(n__e()) -> tt() isQid(n__i()) -> tt() isQid(n__o()) -> tt() isQid(n__u()) -> tt() nil() -> n__nil() __(X1,X2) -> n____(X1,X2) a() -> n__a() e() -> n__e() i() -> n__i() o() -> n__o() u() -> n__u() activate(n__nil()) -> nil() activate(n____(X1,X2)) -> __(activate(X1),activate(X2)) activate(n__a()) -> a() activate(n__e()) -> e() activate(n__i()) -> i() activate(n__o()) -> o() activate(n__u()) -> u() activate(X) -> X Proof: DP Processor: DPs: __#(__(X,Y),Z) -> __#(Y,Z) __#(__(X,Y),Z) -> __#(X,__(Y,Z)) U21#(tt(),V2) -> activate#(V2) U21#(tt(),V2) -> isList#(activate(V2)) U21#(tt(),V2) -> U22#(isList(activate(V2))) U41#(tt(),V2) -> activate#(V2) U41#(tt(),V2) -> isNeList#(activate(V2)) U41#(tt(),V2) -> U42#(isNeList(activate(V2))) U51#(tt(),V2) -> activate#(V2) U51#(tt(),V2) -> isList#(activate(V2)) U51#(tt(),V2) -> U52#(isList(activate(V2))) U71#(tt(),P) -> activate#(P) U71#(tt(),P) -> isPal#(activate(P)) U71#(tt(),P) -> U72#(isPal(activate(P))) isList#(V) -> activate#(V) isList#(V) -> isNeList#(activate(V)) isList#(V) -> U11#(isNeList(activate(V))) isList#(n____(V1,V2)) -> activate#(V2) isList#(n____(V1,V2)) -> activate#(V1) isList#(n____(V1,V2)) -> isList#(activate(V1)) isList#(n____(V1,V2)) -> U21#(isList(activate(V1)),activate(V2)) isNeList#(V) -> activate#(V) isNeList#(V) -> isQid#(activate(V)) isNeList#(V) -> U31#(isQid(activate(V))) isNeList#(n____(V1,V2)) -> activate#(V2) isNeList#(n____(V1,V2)) -> activate#(V1) isNeList#(n____(V1,V2)) -> isList#(activate(V1)) isNeList#(n____(V1,V2)) -> U41#(isList(activate(V1)),activate(V2)) isNeList#(n____(V1,V2)) -> isNeList#(activate(V1)) isNeList#(n____(V1,V2)) -> U51#(isNeList(activate(V1)),activate(V2)) isNePal#(V) -> activate#(V) isNePal#(V) -> isQid#(activate(V)) isNePal#(V) -> U61#(isQid(activate(V))) isNePal#(n____(I,n____(P,I))) -> activate#(P) isNePal#(n____(I,n____(P,I))) -> activate#(I) isNePal#(n____(I,n____(P,I))) -> isQid#(activate(I)) isNePal#(n____(I,n____(P,I))) -> U71#(isQid(activate(I)),activate(P)) isPal#(V) -> activate#(V) isPal#(V) -> isNePal#(activate(V)) isPal#(V) -> U81#(isNePal(activate(V))) activate#(n__nil()) -> nil#() activate#(n____(X1,X2)) -> activate#(X2) activate#(n____(X1,X2)) -> activate#(X1) activate#(n____(X1,X2)) -> __#(activate(X1),activate(X2)) activate#(n__a()) -> a#() activate#(n__e()) -> e#() activate#(n__i()) -> i#() activate#(n__o()) -> o#() activate#(n__u()) -> u#() TRS: __(__(X,Y),Z) -> __(X,__(Y,Z)) __(X,nil()) -> X __(nil(),X) -> X U11(tt()) -> tt() U21(tt(),V2) -> U22(isList(activate(V2))) U22(tt()) -> tt() U31(tt()) -> tt() U41(tt(),V2) -> U42(isNeList(activate(V2))) U42(tt()) -> tt() U51(tt(),V2) -> U52(isList(activate(V2))) U52(tt()) -> tt() U61(tt()) -> tt() U71(tt(),P) -> U72(isPal(activate(P))) U72(tt()) -> tt() U81(tt()) -> tt() isList(V) -> U11(isNeList(activate(V))) isList(n__nil()) -> tt() isList(n____(V1,V2)) -> U21(isList(activate(V1)),activate(V2)) isNeList(V) -> U31(isQid(activate(V))) isNeList(n____(V1,V2)) -> U41(isList(activate(V1)),activate(V2)) isNeList(n____(V1,V2)) -> U51(isNeList(activate(V1)),activate(V2)) isNePal(V) -> U61(isQid(activate(V))) isNePal(n____(I,n____(P,I))) -> U71(isQid(activate(I)),activate(P)) isPal(V) -> U81(isNePal(activate(V))) isPal(n__nil()) -> tt() isQid(n__a()) -> tt() isQid(n__e()) -> tt() isQid(n__i()) -> tt() isQid(n__o()) -> tt() isQid(n__u()) -> tt() nil() -> n__nil() __(X1,X2) -> n____(X1,X2) a() -> n__a() e() -> n__e() i() -> n__i() o() -> n__o() u() -> n__u() activate(n__nil()) -> nil() activate(n____(X1,X2)) -> __(activate(X1),activate(X2)) activate(n__a()) -> a() activate(n__e()) -> e() activate(n__i()) -> i() activate(n__o()) -> o() activate(n__u()) -> u() activate(X) -> X TDG Processor: DPs: __#(__(X,Y),Z) -> __#(Y,Z) __#(__(X,Y),Z) -> __#(X,__(Y,Z)) U21#(tt(),V2) -> activate#(V2) U21#(tt(),V2) -> isList#(activate(V2)) U21#(tt(),V2) -> U22#(isList(activate(V2))) U41#(tt(),V2) -> activate#(V2) U41#(tt(),V2) -> isNeList#(activate(V2)) U41#(tt(),V2) -> U42#(isNeList(activate(V2))) U51#(tt(),V2) -> activate#(V2) U51#(tt(),V2) -> isList#(activate(V2)) U51#(tt(),V2) -> U52#(isList(activate(V2))) U71#(tt(),P) -> activate#(P) U71#(tt(),P) -> isPal#(activate(P)) U71#(tt(),P) -> U72#(isPal(activate(P))) isList#(V) -> activate#(V) isList#(V) -> isNeList#(activate(V)) isList#(V) -> U11#(isNeList(activate(V))) isList#(n____(V1,V2)) -> activate#(V2) isList#(n____(V1,V2)) -> activate#(V1) isList#(n____(V1,V2)) -> isList#(activate(V1)) isList#(n____(V1,V2)) -> U21#(isList(activate(V1)),activate(V2)) isNeList#(V) -> activate#(V) isNeList#(V) -> isQid#(activate(V)) isNeList#(V) -> U31#(isQid(activate(V))) isNeList#(n____(V1,V2)) -> activate#(V2) isNeList#(n____(V1,V2)) -> activate#(V1) isNeList#(n____(V1,V2)) -> isList#(activate(V1)) isNeList#(n____(V1,V2)) -> U41#(isList(activate(V1)),activate(V2)) isNeList#(n____(V1,V2)) -> isNeList#(activate(V1)) isNeList#(n____(V1,V2)) -> U51#(isNeList(activate(V1)),activate(V2)) isNePal#(V) -> activate#(V) isNePal#(V) -> isQid#(activate(V)) isNePal#(V) -> U61#(isQid(activate(V))) isNePal#(n____(I,n____(P,I))) -> activate#(P) isNePal#(n____(I,n____(P,I))) -> activate#(I) isNePal#(n____(I,n____(P,I))) -> isQid#(activate(I)) isNePal#(n____(I,n____(P,I))) -> U71#(isQid(activate(I)),activate(P)) isPal#(V) -> activate#(V) isPal#(V) -> isNePal#(activate(V)) isPal#(V) -> U81#(isNePal(activate(V))) activate#(n__nil()) -> nil#() activate#(n____(X1,X2)) -> activate#(X2) activate#(n____(X1,X2)) -> activate#(X1) activate#(n____(X1,X2)) -> __#(activate(X1),activate(X2)) activate#(n__a()) -> a#() activate#(n__e()) -> e#() activate#(n__i()) -> i#() activate#(n__o()) -> o#() activate#(n__u()) -> u#() TRS: __(__(X,Y),Z) -> __(X,__(Y,Z)) __(X,nil()) -> X __(nil(),X) -> X U11(tt()) -> tt() U21(tt(),V2) -> U22(isList(activate(V2))) U22(tt()) -> tt() U31(tt()) -> tt() U41(tt(),V2) -> U42(isNeList(activate(V2))) U42(tt()) -> tt() U51(tt(),V2) -> U52(isList(activate(V2))) U52(tt()) -> tt() U61(tt()) -> tt() U71(tt(),P) -> U72(isPal(activate(P))) U72(tt()) -> tt() U81(tt()) -> tt() isList(V) -> U11(isNeList(activate(V))) isList(n__nil()) -> tt() isList(n____(V1,V2)) -> U21(isList(activate(V1)),activate(V2)) isNeList(V) -> U31(isQid(activate(V))) isNeList(n____(V1,V2)) -> U41(isList(activate(V1)),activate(V2)) isNeList(n____(V1,V2)) -> U51(isNeList(activate(V1)),activate(V2)) isNePal(V) -> U61(isQid(activate(V))) isNePal(n____(I,n____(P,I))) -> U71(isQid(activate(I)),activate(P)) isPal(V) -> U81(isNePal(activate(V))) isPal(n__nil()) -> tt() isQid(n__a()) -> tt() isQid(n__e()) -> tt() isQid(n__i()) -> tt() isQid(n__o()) -> tt() isQid(n__u()) -> tt() nil() -> n__nil() __(X1,X2) -> n____(X1,X2) a() -> n__a() e() -> n__e() i() -> n__i() o() -> n__o() u() -> n__u() activate(n__nil()) -> nil() activate(n____(X1,X2)) -> __(activate(X1),activate(X2)) activate(n__a()) -> a() activate(n__e()) -> e() activate(n__i()) -> i() activate(n__o()) -> o() activate(n__u()) -> u() activate(X) -> X graph: isNePal#(n____(I,n____(P,I))) -> U71#(isQid(activate(I)),activate(P)) -> U71#(tt(),P) -> U72#(isPal(activate(P))) isNePal#(n____(I,n____(P,I))) -> U71#(isQid(activate(I)),activate(P)) -> U71#(tt(),P) -> isPal#(activate(P)) isNePal#(n____(I,n____(P,I))) -> U71#(isQid(activate(I)),activate(P)) -> U71#(tt(),P) -> activate#(P) isNePal#(n____(I,n____(P,I))) -> activate#(P) -> activate#(n__u()) -> u#() isNePal#(n____(I,n____(P,I))) -> activate#(P) -> activate#(n__o()) -> o#() isNePal#(n____(I,n____(P,I))) -> activate#(P) -> activate#(n__i()) -> i#() isNePal#(n____(I,n____(P,I))) -> activate#(P) -> activate#(n__e()) -> e#() isNePal#(n____(I,n____(P,I))) -> activate#(P) -> activate#(n__a()) -> a#() isNePal#(n____(I,n____(P,I))) -> activate#(P) -> activate#(n____(X1,X2)) -> __#(activate(X1),activate(X2)) isNePal#(n____(I,n____(P,I))) -> activate#(P) -> activate#(n____(X1,X2)) -> activate#(X1) isNePal#(n____(I,n____(P,I))) -> activate#(P) -> activate#(n____(X1,X2)) -> activate#(X2) isNePal#(n____(I,n____(P,I))) -> activate#(P) -> activate#(n__nil()) -> nil#() isNePal#(n____(I,n____(P,I))) -> activate#(I) -> activate#(n__u()) -> u#() isNePal#(n____(I,n____(P,I))) -> activate#(I) -> activate#(n__o()) -> o#() isNePal#(n____(I,n____(P,I))) -> activate#(I) -> activate#(n__i()) -> i#() isNePal#(n____(I,n____(P,I))) -> activate#(I) -> activate#(n__e()) -> e#() isNePal#(n____(I,n____(P,I))) -> activate#(I) -> activate#(n__a()) -> a#() isNePal#(n____(I,n____(P,I))) -> activate#(I) -> activate#(n____(X1,X2)) -> __#(activate(X1),activate(X2)) isNePal#(n____(I,n____(P,I))) -> activate#(I) -> activate#(n____(X1,X2)) -> activate#(X1) isNePal#(n____(I,n____(P,I))) -> activate#(I) -> activate#(n____(X1,X2)) -> activate#(X2) isNePal#(n____(I,n____(P,I))) -> activate#(I) -> activate#(n__nil()) -> nil#() isNePal#(V) -> activate#(V) -> activate#(n__u()) -> u#() isNePal#(V) -> activate#(V) -> activate#(n__o()) -> o#() isNePal#(V) -> activate#(V) -> activate#(n__i()) -> i#() isNePal#(V) -> activate#(V) -> activate#(n__e()) -> e#() isNePal#(V) -> activate#(V) -> activate#(n__a()) -> a#() isNePal#(V) -> activate#(V) -> activate#(n____(X1,X2)) -> __#(activate(X1),activate(X2)) isNePal#(V) -> activate#(V) -> activate#(n____(X1,X2)) -> activate#(X1) isNePal#(V) -> activate#(V) -> activate#(n____(X1,X2)) -> activate#(X2) isNePal#(V) -> activate#(V) -> activate#(n__nil()) -> nil#() isPal#(V) -> isNePal#(activate(V)) -> isNePal#(n____(I,n____(P,I))) -> U71#(isQid(activate(I)),activate(P)) isPal#(V) -> isNePal#(activate(V)) -> isNePal#(n____(I,n____(P,I))) -> isQid#(activate(I)) isPal#(V) -> isNePal#(activate(V)) -> isNePal#(n____(I,n____(P,I))) -> activate#(I) isPal#(V) -> isNePal#(activate(V)) -> isNePal#(n____(I,n____(P,I))) -> activate#(P) isPal#(V) -> isNePal#(activate(V)) -> isNePal#(V) -> U61#(isQid(activate(V))) isPal#(V) -> isNePal#(activate(V)) -> isNePal#(V) -> isQid#(activate(V)) isPal#(V) -> isNePal#(activate(V)) -> isNePal#(V) -> activate#(V) isPal#(V) -> activate#(V) -> activate#(n__u()) -> u#() isPal#(V) -> activate#(V) -> activate#(n__o()) -> o#() isPal#(V) -> activate#(V) -> activate#(n__i()) -> i#() isPal#(V) -> activate#(V) -> activate#(n__e()) -> e#() isPal#(V) -> activate#(V) -> activate#(n__a()) -> a#() isPal#(V) -> activate#(V) -> activate#(n____(X1,X2)) -> __#(activate(X1),activate(X2)) isPal#(V) -> activate#(V) -> activate#(n____(X1,X2)) -> activate#(X1) isPal#(V) -> activate#(V) -> activate#(n____(X1,X2)) -> activate#(X2) isPal#(V) -> activate#(V) -> activate#(n__nil()) -> nil#() U71#(tt(),P) -> isPal#(activate(P)) -> isPal#(V) -> U81#(isNePal(activate(V))) U71#(tt(),P) -> isPal#(activate(P)) -> isPal#(V) -> isNePal#(activate(V)) U71#(tt(),P) -> isPal#(activate(P)) -> isPal#(V) -> activate#(V) U71#(tt(),P) -> activate#(P) -> activate#(n__u()) -> u#() U71#(tt(),P) -> activate#(P) -> activate#(n__o()) -> o#() U71#(tt(),P) -> activate#(P) -> activate#(n__i()) -> i#() U71#(tt(),P) -> activate#(P) -> activate#(n__e()) -> e#() U71#(tt(),P) -> activate#(P) -> activate#(n__a()) -> a#() U71#(tt(),P) -> activate#(P) -> activate#(n____(X1,X2)) -> __#(activate(X1),activate(X2)) U71#(tt(),P) -> activate#(P) -> activate#(n____(X1,X2)) -> activate#(X1) U71#(tt(),P) -> activate#(P) -> activate#(n____(X1,X2)) -> activate#(X2) U71#(tt(),P) -> activate#(P) -> activate#(n__nil()) -> nil#() U51#(tt(),V2) -> isList#(activate(V2)) -> isList#(n____(V1,V2)) -> U21#(isList(activate(V1)),activate(V2)) U51#(tt(),V2) -> isList#(activate(V2)) -> isList#(n____(V1,V2)) -> isList#(activate(V1)) U51#(tt(),V2) -> isList#(activate(V2)) -> isList#(n____(V1,V2)) -> activate#(V1) U51#(tt(),V2) -> isList#(activate(V2)) -> isList#(n____(V1,V2)) -> activate#(V2) U51#(tt(),V2) -> isList#(activate(V2)) -> isList#(V) -> U11#(isNeList(activate(V))) U51#(tt(),V2) -> isList#(activate(V2)) -> isList#(V) -> isNeList#(activate(V)) U51#(tt(),V2) -> isList#(activate(V2)) -> isList#(V) -> activate#(V) U51#(tt(),V2) -> activate#(V2) -> activate#(n__u()) -> u#() U51#(tt(),V2) -> activate#(V2) -> activate#(n__o()) -> o#() U51#(tt(),V2) -> activate#(V2) -> activate#(n__i()) -> i#() U51#(tt(),V2) -> activate#(V2) -> activate#(n__e()) -> e#() U51#(tt(),V2) -> activate#(V2) -> activate#(n__a()) -> a#() U51#(tt(),V2) -> activate#(V2) -> activate#(n____(X1,X2)) -> __#(activate(X1),activate(X2)) U51#(tt(),V2) -> activate#(V2) -> activate#(n____(X1,X2)) -> activate#(X1) U51#(tt(),V2) -> activate#(V2) -> activate#(n____(X1,X2)) -> activate#(X2) U51#(tt(),V2) -> activate#(V2) -> activate#(n__nil()) -> nil#() isNeList#(n____(V1,V2)) -> U51#(isNeList(activate(V1)),activate(V2)) -> U51#(tt(),V2) -> U52#(isList(activate(V2))) isNeList#(n____(V1,V2)) -> U51#(isNeList(activate(V1)),activate(V2)) -> U51#(tt(),V2) -> isList#(activate(V2)) isNeList#(n____(V1,V2)) -> U51#(isNeList(activate(V1)),activate(V2)) -> U51#(tt(),V2) -> activate#(V2) isNeList#(n____(V1,V2)) -> isNeList#(activate(V1)) -> isNeList#(n____(V1,V2)) -> U51#(isNeList(activate(V1)),activate(V2)) isNeList#(n____(V1,V2)) -> isNeList#(activate(V1)) -> isNeList#(n____(V1,V2)) -> isNeList#(activate(V1)) isNeList#(n____(V1,V2)) -> isNeList#(activate(V1)) -> isNeList#(n____(V1,V2)) -> U41#(isList(activate(V1)),activate(V2)) isNeList#(n____(V1,V2)) -> isNeList#(activate(V1)) -> isNeList#(n____(V1,V2)) -> isList#(activate(V1)) isNeList#(n____(V1,V2)) -> isNeList#(activate(V1)) -> isNeList#(n____(V1,V2)) -> activate#(V1) isNeList#(n____(V1,V2)) -> isNeList#(activate(V1)) -> isNeList#(n____(V1,V2)) -> activate#(V2) isNeList#(n____(V1,V2)) -> isNeList#(activate(V1)) -> isNeList#(V) -> U31#(isQid(activate(V))) isNeList#(n____(V1,V2)) -> isNeList#(activate(V1)) -> isNeList#(V) -> isQid#(activate(V)) isNeList#(n____(V1,V2)) -> isNeList#(activate(V1)) -> isNeList#(V) -> activate#(V) isNeList#(n____(V1,V2)) -> U41#(isList(activate(V1)),activate(V2)) -> U41#(tt(),V2) -> U42#(isNeList(activate(V2))) isNeList#(n____(V1,V2)) -> U41#(isList(activate(V1)),activate(V2)) -> U41#(tt(),V2) -> isNeList#(activate(V2)) isNeList#(n____(V1,V2)) -> U41#(isList(activate(V1)),activate(V2)) -> U41#(tt(),V2) -> activate#(V2) isNeList#(n____(V1,V2)) -> isList#(activate(V1)) -> isList#(n____(V1,V2)) -> U21#(isList(activate(V1)),activate(V2)) isNeList#(n____(V1,V2)) -> isList#(activate(V1)) -> isList#(n____(V1,V2)) -> isList#(activate(V1)) isNeList#(n____(V1,V2)) -> isList#(activate(V1)) -> isList#(n____(V1,V2)) -> activate#(V1) isNeList#(n____(V1,V2)) -> isList#(activate(V1)) -> isList#(n____(V1,V2)) -> activate#(V2) isNeList#(n____(V1,V2)) -> isList#(activate(V1)) -> isList#(V) -> U11#(isNeList(activate(V))) isNeList#(n____(V1,V2)) -> isList#(activate(V1)) -> isList#(V) -> isNeList#(activate(V)) isNeList#(n____(V1,V2)) -> isList#(activate(V1)) -> isList#(V) -> activate#(V) isNeList#(n____(V1,V2)) -> activate#(V2) -> activate#(n__u()) -> u#() isNeList#(n____(V1,V2)) -> activate#(V2) -> activate#(n__o()) -> o#() isNeList#(n____(V1,V2)) -> activate#(V2) -> activate#(n__i()) -> i#() isNeList#(n____(V1,V2)) -> activate#(V2) -> activate#(n__e()) -> e#() isNeList#(n____(V1,V2)) -> activate#(V2) -> activate#(n__a()) -> a#() isNeList#(n____(V1,V2)) -> activate#(V2) -> activate#(n____(X1,X2)) -> __#(activate(X1),activate(X2)) isNeList#(n____(V1,V2)) -> activate#(V2) -> activate#(n____(X1,X2)) -> activate#(X1) isNeList#(n____(V1,V2)) -> activate#(V2) -> activate#(n____(X1,X2)) -> activate#(X2) isNeList#(n____(V1,V2)) -> activate#(V2) -> activate#(n__nil()) -> nil#() isNeList#(n____(V1,V2)) -> activate#(V1) -> activate#(n__u()) -> u#() isNeList#(n____(V1,V2)) -> activate#(V1) -> activate#(n__o()) -> o#() isNeList#(n____(V1,V2)) -> activate#(V1) -> activate#(n__i()) -> i#() isNeList#(n____(V1,V2)) -> activate#(V1) -> activate#(n__e()) -> e#() isNeList#(n____(V1,V2)) -> activate#(V1) -> activate#(n__a()) -> a#() isNeList#(n____(V1,V2)) -> activate#(V1) -> activate#(n____(X1,X2)) -> __#(activate(X1),activate(X2)) isNeList#(n____(V1,V2)) -> activate#(V1) -> activate#(n____(X1,X2)) -> activate#(X1) isNeList#(n____(V1,V2)) -> activate#(V1) -> activate#(n____(X1,X2)) -> activate#(X2) isNeList#(n____(V1,V2)) -> activate#(V1) -> activate#(n__nil()) -> nil#() isNeList#(V) -> activate#(V) -> activate#(n__u()) -> u#() isNeList#(V) -> activate#(V) -> activate#(n__o()) -> o#() isNeList#(V) -> activate#(V) -> activate#(n__i()) -> i#() isNeList#(V) -> activate#(V) -> activate#(n__e()) -> e#() isNeList#(V) -> activate#(V) -> activate#(n__a()) -> a#() isNeList#(V) -> activate#(V) -> activate#(n____(X1,X2)) -> __#(activate(X1),activate(X2)) isNeList#(V) -> activate#(V) -> activate#(n____(X1,X2)) -> activate#(X1) isNeList#(V) -> activate#(V) -> activate#(n____(X1,X2)) -> activate#(X2) isNeList#(V) -> activate#(V) -> activate#(n__nil()) -> nil#() U41#(tt(),V2) -> isNeList#(activate(V2)) -> isNeList#(n____(V1,V2)) -> U51#(isNeList(activate(V1)),activate(V2)) U41#(tt(),V2) -> isNeList#(activate(V2)) -> isNeList#(n____(V1,V2)) -> isNeList#(activate(V1)) U41#(tt(),V2) -> isNeList#(activate(V2)) -> isNeList#(n____(V1,V2)) -> U41#(isList(activate(V1)),activate(V2)) U41#(tt(),V2) -> isNeList#(activate(V2)) -> isNeList#(n____(V1,V2)) -> isList#(activate(V1)) U41#(tt(),V2) -> isNeList#(activate(V2)) -> isNeList#(n____(V1,V2)) -> activate#(V1) U41#(tt(),V2) -> isNeList#(activate(V2)) -> isNeList#(n____(V1,V2)) -> activate#(V2) U41#(tt(),V2) -> isNeList#(activate(V2)) -> isNeList#(V) -> U31#(isQid(activate(V))) U41#(tt(),V2) -> isNeList#(activate(V2)) -> isNeList#(V) -> isQid#(activate(V)) U41#(tt(),V2) -> isNeList#(activate(V2)) -> isNeList#(V) -> activate#(V) U41#(tt(),V2) -> activate#(V2) -> activate#(n__u()) -> u#() U41#(tt(),V2) -> activate#(V2) -> activate#(n__o()) -> o#() U41#(tt(),V2) -> activate#(V2) -> activate#(n__i()) -> i#() U41#(tt(),V2) -> activate#(V2) -> activate#(n__e()) -> e#() U41#(tt(),V2) -> activate#(V2) -> activate#(n__a()) -> a#() U41#(tt(),V2) -> activate#(V2) -> activate#(n____(X1,X2)) -> __#(activate(X1),activate(X2)) U41#(tt(),V2) -> activate#(V2) -> activate#(n____(X1,X2)) -> activate#(X1) U41#(tt(),V2) -> activate#(V2) -> activate#(n____(X1,X2)) -> activate#(X2) U41#(tt(),V2) -> activate#(V2) -> activate#(n__nil()) -> nil#() isList#(n____(V1,V2)) -> isList#(activate(V1)) -> isList#(n____(V1,V2)) -> U21#(isList(activate(V1)),activate(V2)) isList#(n____(V1,V2)) -> isList#(activate(V1)) -> isList#(n____(V1,V2)) -> isList#(activate(V1)) isList#(n____(V1,V2)) -> isList#(activate(V1)) -> isList#(n____(V1,V2)) -> activate#(V1) isList#(n____(V1,V2)) -> isList#(activate(V1)) -> isList#(n____(V1,V2)) -> activate#(V2) isList#(n____(V1,V2)) -> isList#(activate(V1)) -> isList#(V) -> U11#(isNeList(activate(V))) isList#(n____(V1,V2)) -> isList#(activate(V1)) -> isList#(V) -> isNeList#(activate(V)) isList#(n____(V1,V2)) -> isList#(activate(V1)) -> isList#(V) -> activate#(V) isList#(n____(V1,V2)) -> activate#(V2) -> activate#(n__u()) -> u#() isList#(n____(V1,V2)) -> activate#(V2) -> activate#(n__o()) -> o#() isList#(n____(V1,V2)) -> activate#(V2) -> activate#(n__i()) -> i#() isList#(n____(V1,V2)) -> activate#(V2) -> activate#(n__e()) -> e#() isList#(n____(V1,V2)) -> activate#(V2) -> activate#(n__a()) -> a#() isList#(n____(V1,V2)) -> activate#(V2) -> activate#(n____(X1,X2)) -> __#(activate(X1),activate(X2)) isList#(n____(V1,V2)) -> activate#(V2) -> activate#(n____(X1,X2)) -> activate#(X1) isList#(n____(V1,V2)) -> activate#(V2) -> activate#(n____(X1,X2)) -> activate#(X2) isList#(n____(V1,V2)) -> activate#(V2) -> activate#(n__nil()) -> nil#() isList#(n____(V1,V2)) -> activate#(V1) -> activate#(n__u()) -> u#() isList#(n____(V1,V2)) -> activate#(V1) -> activate#(n__o()) -> o#() isList#(n____(V1,V2)) -> activate#(V1) -> activate#(n__i()) -> i#() isList#(n____(V1,V2)) -> activate#(V1) -> activate#(n__e()) -> e#() isList#(n____(V1,V2)) -> activate#(V1) -> activate#(n__a()) -> a#() isList#(n____(V1,V2)) -> activate#(V1) -> activate#(n____(X1,X2)) -> __#(activate(X1),activate(X2)) isList#(n____(V1,V2)) -> activate#(V1) -> activate#(n____(X1,X2)) -> activate#(X1) isList#(n____(V1,V2)) -> activate#(V1) -> activate#(n____(X1,X2)) -> activate#(X2) isList#(n____(V1,V2)) -> activate#(V1) -> activate#(n__nil()) -> nil#() isList#(n____(V1,V2)) -> U21#(isList(activate(V1)),activate(V2)) -> U21#(tt(),V2) -> U22#(isList(activate(V2))) isList#(n____(V1,V2)) -> U21#(isList(activate(V1)),activate(V2)) -> U21#(tt(),V2) -> isList#(activate(V2)) isList#(n____(V1,V2)) -> U21#(isList(activate(V1)),activate(V2)) -> U21#(tt(),V2) -> activate#(V2) isList#(V) -> isNeList#(activate(V)) -> isNeList#(n____(V1,V2)) -> U51#(isNeList(activate(V1)),activate(V2)) isList#(V) -> isNeList#(activate(V)) -> isNeList#(n____(V1,V2)) -> isNeList#(activate(V1)) isList#(V) -> isNeList#(activate(V)) -> isNeList#(n____(V1,V2)) -> U41#(isList(activate(V1)),activate(V2)) isList#(V) -> isNeList#(activate(V)) -> isNeList#(n____(V1,V2)) -> isList#(activate(V1)) isList#(V) -> isNeList#(activate(V)) -> isNeList#(n____(V1,V2)) -> activate#(V1) isList#(V) -> isNeList#(activate(V)) -> isNeList#(n____(V1,V2)) -> activate#(V2) isList#(V) -> isNeList#(activate(V)) -> isNeList#(V) -> U31#(isQid(activate(V))) isList#(V) -> isNeList#(activate(V)) -> isNeList#(V) -> isQid#(activate(V)) isList#(V) -> isNeList#(activate(V)) -> isNeList#(V) -> activate#(V) isList#(V) -> activate#(V) -> activate#(n__u()) -> u#() isList#(V) -> activate#(V) -> activate#(n__o()) -> o#() isList#(V) -> activate#(V) -> activate#(n__i()) -> i#() isList#(V) -> activate#(V) -> activate#(n__e()) -> e#() isList#(V) -> activate#(V) -> activate#(n__a()) -> a#() isList#(V) -> activate#(V) -> activate#(n____(X1,X2)) -> __#(activate(X1),activate(X2)) isList#(V) -> activate#(V) -> activate#(n____(X1,X2)) -> activate#(X1) isList#(V) -> activate#(V) -> activate#(n____(X1,X2)) -> activate#(X2) isList#(V) -> activate#(V) -> activate#(n__nil()) -> nil#() activate#(n____(X1,X2)) -> activate#(X2) -> activate#(n__u()) -> u#() activate#(n____(X1,X2)) -> activate#(X2) -> activate#(n__o()) -> o#() activate#(n____(X1,X2)) -> activate#(X2) -> activate#(n__i()) -> i#() activate#(n____(X1,X2)) -> activate#(X2) -> activate#(n__e()) -> e#() activate#(n____(X1,X2)) -> activate#(X2) -> activate#(n__a()) -> a#() activate#(n____(X1,X2)) -> activate#(X2) -> activate#(n____(X1,X2)) -> __#(activate(X1),activate(X2)) activate#(n____(X1,X2)) -> activate#(X2) -> activate#(n____(X1,X2)) -> activate#(X1) activate#(n____(X1,X2)) -> activate#(X2) -> activate#(n____(X1,X2)) -> activate#(X2) activate#(n____(X1,X2)) -> activate#(X2) -> activate#(n__nil()) -> nil#() activate#(n____(X1,X2)) -> activate#(X1) -> activate#(n__u()) -> u#() activate#(n____(X1,X2)) -> activate#(X1) -> activate#(n__o()) -> o#() activate#(n____(X1,X2)) -> activate#(X1) -> activate#(n__i()) -> i#() activate#(n____(X1,X2)) -> activate#(X1) -> activate#(n__e()) -> e#() activate#(n____(X1,X2)) -> activate#(X1) -> activate#(n__a()) -> a#() activate#(n____(X1,X2)) -> activate#(X1) -> activate#(n____(X1,X2)) -> __#(activate(X1),activate(X2)) activate#(n____(X1,X2)) -> activate#(X1) -> activate#(n____(X1,X2)) -> activate#(X1) activate#(n____(X1,X2)) -> activate#(X1) -> activate#(n____(X1,X2)) -> activate#(X2) activate#(n____(X1,X2)) -> activate#(X1) -> activate#(n__nil()) -> nil#() activate#(n____(X1,X2)) -> __#(activate(X1),activate(X2)) -> __#(__(X,Y),Z) -> __#(X,__(Y,Z)) activate#(n____(X1,X2)) -> __#(activate(X1),activate(X2)) -> __#(__(X,Y),Z) -> __#(Y,Z) U21#(tt(),V2) -> isList#(activate(V2)) -> isList#(n____(V1,V2)) -> U21#(isList(activate(V1)),activate(V2)) U21#(tt(),V2) -> isList#(activate(V2)) -> isList#(n____(V1,V2)) -> isList#(activate(V1)) U21#(tt(),V2) -> isList#(activate(V2)) -> isList#(n____(V1,V2)) -> activate#(V1) U21#(tt(),V2) -> isList#(activate(V2)) -> isList#(n____(V1,V2)) -> activate#(V2) U21#(tt(),V2) -> isList#(activate(V2)) -> isList#(V) -> U11#(isNeList(activate(V))) U21#(tt(),V2) -> isList#(activate(V2)) -> isList#(V) -> isNeList#(activate(V)) U21#(tt(),V2) -> isList#(activate(V2)) -> isList#(V) -> activate#(V) U21#(tt(),V2) -> activate#(V2) -> activate#(n__u()) -> u#() U21#(tt(),V2) -> activate#(V2) -> activate#(n__o()) -> o#() U21#(tt(),V2) -> activate#(V2) -> activate#(n__i()) -> i#() U21#(tt(),V2) -> activate#(V2) -> activate#(n__e()) -> e#() U21#(tt(),V2) -> activate#(V2) -> activate#(n__a()) -> a#() U21#(tt(),V2) -> activate#(V2) -> activate#(n____(X1,X2)) -> __#(activate(X1),activate(X2)) U21#(tt(),V2) -> activate#(V2) -> activate#(n____(X1,X2)) -> activate#(X1) U21#(tt(),V2) -> activate#(V2) -> activate#(n____(X1,X2)) -> activate#(X2) U21#(tt(),V2) -> activate#(V2) -> activate#(n__nil()) -> nil#() __#(__(X,Y),Z) -> __#(Y,Z) -> __#(__(X,Y),Z) -> __#(X,__(Y,Z)) __#(__(X,Y),Z) -> __#(Y,Z) -> __#(__(X,Y),Z) -> __#(Y,Z) __#(__(X,Y),Z) -> __#(X,__(Y,Z)) -> __#(__(X,Y),Z) -> __#(X,__(Y,Z)) __#(__(X,Y),Z) -> __#(X,__(Y,Z)) -> __#(__(X,Y),Z) -> __#(Y,Z) SCC Processor: #sccs: 4 #rules: 17 #arcs: 227/2401 DPs: U51#(tt(),V2) -> isList#(activate(V2)) isList#(V) -> isNeList#(activate(V)) isNeList#(n____(V1,V2)) -> isList#(activate(V1)) isList#(n____(V1,V2)) -> isList#(activate(V1)) isList#(n____(V1,V2)) -> U21#(isList(activate(V1)),activate(V2)) U21#(tt(),V2) -> isList#(activate(V2)) isNeList#(n____(V1,V2)) -> U41#(isList(activate(V1)),activate(V2)) U41#(tt(),V2) -> isNeList#(activate(V2)) isNeList#(n____(V1,V2)) -> isNeList#(activate(V1)) isNeList#(n____(V1,V2)) -> U51#(isNeList(activate(V1)),activate(V2)) TRS: __(__(X,Y),Z) -> __(X,__(Y,Z)) __(X,nil()) -> X __(nil(),X) -> X U11(tt()) -> tt() U21(tt(),V2) -> U22(isList(activate(V2))) U22(tt()) -> tt() U31(tt()) -> tt() U41(tt(),V2) -> U42(isNeList(activate(V2))) U42(tt()) -> tt() U51(tt(),V2) -> U52(isList(activate(V2))) U52(tt()) -> tt() U61(tt()) -> tt() U71(tt(),P) -> U72(isPal(activate(P))) U72(tt()) -> tt() U81(tt()) -> tt() isList(V) -> U11(isNeList(activate(V))) isList(n__nil()) -> tt() isList(n____(V1,V2)) -> U21(isList(activate(V1)),activate(V2)) isNeList(V) -> U31(isQid(activate(V))) isNeList(n____(V1,V2)) -> U41(isList(activate(V1)),activate(V2)) isNeList(n____(V1,V2)) -> U51(isNeList(activate(V1)),activate(V2)) isNePal(V) -> U61(isQid(activate(V))) isNePal(n____(I,n____(P,I))) -> U71(isQid(activate(I)),activate(P)) isPal(V) -> U81(isNePal(activate(V))) isPal(n__nil()) -> tt() isQid(n__a()) -> tt() isQid(n__e()) -> tt() isQid(n__i()) -> tt() isQid(n__o()) -> tt() isQid(n__u()) -> tt() nil() -> n__nil() __(X1,X2) -> n____(X1,X2) a() -> n__a() e() -> n__e() i() -> n__i() o() -> n__o() u() -> n__u() activate(n__nil()) -> nil() activate(n____(X1,X2)) -> __(activate(X1),activate(X2)) activate(n__a()) -> a() activate(n__e()) -> e() activate(n__i()) -> i() activate(n__o()) -> o() activate(n__u()) -> u() activate(X) -> X Arctic Interpretation Processor: dimension: 1 interpretation: [U51#](x0, x1) = x0 + x1 + 4, [isNeList#](x0) = x0 + 0, [U41#](x0, x1) = x0 + x1 + 0, [isList#](x0) = x0 + 4, [U21#](x0, x1) = x0 + x1 + 4, [u] = 6, [o] = 0, [i] = 2, [e] = 0, [a] = 1, [n__u] = 6, [n__o] = 0, [n__i] = 2, [n__e] = 0, [n__a] = 1, [isNePal](x0) = x0 + 0, [isQid](x0) = x0 + 0, [n____](x0, x1) = 1x0 + x1 + 4, [n__nil] = 0, [U81](x0) = x0 + 0, [U72](x0) = 0, [isPal](x0) = 7x0 + 0, [U71](x0, x1) = 1x1 + 0, [U61](x0) = 0, [U52](x0) = 0, [U51](x0, x1) = x0 + 0, [U42](x0) = x0 + 0, [isNeList](x0) = x0 + 0, [U41](x0, x1) = x0 + x1 + 0, [U31](x0) = x0 + 0, [U22](x0) = 0, [isList](x0) = x0 + 0, [activate](x0) = x0 + 0, [U21](x0, x1) = x0 + 0, [U11](x0) = 0, [tt] = 0, [nil] = 0, [__](x0, x1) = 1x0 + x1 + 4 orientation: U51#(tt(),V2) = V2 + 4 >= V2 + 4 = isList#(activate(V2)) isList#(V) = V + 4 >= V + 0 = isNeList#(activate(V)) isNeList#(n____(V1,V2)) = 1V1 + V2 + 4 >= V1 + 4 = isList#(activate(V1)) isList#(n____(V1,V2)) = 1V1 + V2 + 4 >= V1 + 4 = isList#(activate(V1)) isList#(n____(V1,V2)) = 1V1 + V2 + 4 >= V1 + V2 + 4 = U21#(isList(activate(V1)),activate(V2)) U21#(tt(),V2) = V2 + 4 >= V2 + 4 = isList#(activate(V2)) isNeList#(n____(V1,V2)) = 1V1 + V2 + 4 >= V1 + V2 + 0 = U41#(isList(activate(V1)),activate(V2)) U41#(tt(),V2) = V2 + 0 >= V2 + 0 = isNeList#(activate(V2)) isNeList#(n____(V1,V2)) = 1V1 + V2 + 4 >= V1 + 0 = isNeList#(activate(V1)) isNeList#(n____(V1,V2)) = 1V1 + V2 + 4 >= V1 + V2 + 4 = U51#(isNeList(activate(V1)),activate(V2)) __(__(X,Y),Z) = 2X + 1Y + Z + 5 >= 1X + 1Y + Z + 4 = __(X,__(Y,Z)) __(X,nil()) = 1X + 4 >= X = X __(nil(),X) = X + 4 >= X = X U11(tt()) = 0 >= 0 = tt() U21(tt(),V2) = 0 >= 0 = U22(isList(activate(V2))) U22(tt()) = 0 >= 0 = tt() U31(tt()) = 0 >= 0 = tt() U41(tt(),V2) = V2 + 0 >= V2 + 0 = U42(isNeList(activate(V2))) U42(tt()) = 0 >= 0 = tt() U51(tt(),V2) = 0 >= 0 = U52(isList(activate(V2))) U52(tt()) = 0 >= 0 = tt() U61(tt()) = 0 >= 0 = tt() U71(tt(),P) = 1P + 0 >= 0 = U72(isPal(activate(P))) U72(tt()) = 0 >= 0 = tt() U81(tt()) = 0 >= 0 = tt() isList(V) = V + 0 >= 0 = U11(isNeList(activate(V))) isList(n__nil()) = 0 >= 0 = tt() isList(n____(V1,V2)) = 1V1 + V2 + 4 >= V1 + 0 = U21(isList(activate(V1)),activate(V2)) isNeList(V) = V + 0 >= V + 0 = U31(isQid(activate(V))) isNeList(n____(V1,V2)) = 1V1 + V2 + 4 >= V1 + V2 + 0 = U41(isList(activate(V1)),activate(V2)) isNeList(n____(V1,V2)) = 1V1 + V2 + 4 >= V1 + 0 = U51(isNeList(activate(V1)),activate(V2)) isNePal(V) = V + 0 >= 0 = U61(isQid(activate(V))) isNePal(n____(I,n____(P,I))) = 1I + 1P + 4 >= 1P + 1 = U71(isQid(activate(I)),activate(P)) isPal(V) = 7V + 0 >= V + 0 = U81(isNePal(activate(V))) isPal(n__nil()) = 7 >= 0 = tt() isQid(n__a()) = 1 >= 0 = tt() isQid(n__e()) = 0 >= 0 = tt() isQid(n__i()) = 2 >= 0 = tt() isQid(n__o()) = 0 >= 0 = tt() isQid(n__u()) = 6 >= 0 = tt() nil() = 0 >= 0 = n__nil() __(X1,X2) = 1X1 + X2 + 4 >= 1X1 + X2 + 4 = n____(X1,X2) a() = 1 >= 1 = n__a() e() = 0 >= 0 = n__e() i() = 2 >= 2 = n__i() o() = 0 >= 0 = n__o() u() = 6 >= 6 = n__u() activate(n__nil()) = 0 >= 0 = nil() activate(n____(X1,X2)) = 1X1 + X2 + 4 >= 1X1 + X2 + 4 = __(activate(X1),activate(X2)) activate(n__a()) = 1 >= 1 = a() activate(n__e()) = 0 >= 0 = e() activate(n__i()) = 2 >= 2 = i() activate(n__o()) = 0 >= 0 = o() activate(n__u()) = 6 >= 6 = u() activate(X) = X + 0 >= X = X problem: DPs: U51#(tt(),V2) -> isList#(activate(V2)) isList#(V) -> isNeList#(activate(V)) isNeList#(n____(V1,V2)) -> isList#(activate(V1)) isList#(n____(V1,V2)) -> isList#(activate(V1)) isList#(n____(V1,V2)) -> U21#(isList(activate(V1)),activate(V2)) U21#(tt(),V2) -> isList#(activate(V2)) isNeList#(n____(V1,V2)) -> U41#(isList(activate(V1)),activate(V2)) U41#(tt(),V2) -> isNeList#(activate(V2)) isNeList#(n____(V1,V2)) -> U51#(isNeList(activate(V1)),activate(V2)) TRS: __(__(X,Y),Z) -> __(X,__(Y,Z)) __(X,nil()) -> X __(nil(),X) -> X U11(tt()) -> tt() U21(tt(),V2) -> U22(isList(activate(V2))) U22(tt()) -> tt() U31(tt()) -> tt() U41(tt(),V2) -> U42(isNeList(activate(V2))) U42(tt()) -> tt() U51(tt(),V2) -> U52(isList(activate(V2))) U52(tt()) -> tt() U61(tt()) -> tt() U71(tt(),P) -> U72(isPal(activate(P))) U72(tt()) -> tt() U81(tt()) -> tt() isList(V) -> U11(isNeList(activate(V))) isList(n__nil()) -> tt() isList(n____(V1,V2)) -> U21(isList(activate(V1)),activate(V2)) isNeList(V) -> U31(isQid(activate(V))) isNeList(n____(V1,V2)) -> U41(isList(activate(V1)),activate(V2)) isNeList(n____(V1,V2)) -> U51(isNeList(activate(V1)),activate(V2)) isNePal(V) -> U61(isQid(activate(V))) isNePal(n____(I,n____(P,I))) -> U71(isQid(activate(I)),activate(P)) isPal(V) -> U81(isNePal(activate(V))) isPal(n__nil()) -> tt() isQid(n__a()) -> tt() isQid(n__e()) -> tt() isQid(n__i()) -> tt() isQid(n__o()) -> tt() isQid(n__u()) -> tt() nil() -> n__nil() __(X1,X2) -> n____(X1,X2) a() -> n__a() e() -> n__e() i() -> n__i() o() -> n__o() u() -> n__u() activate(n__nil()) -> nil() activate(n____(X1,X2)) -> __(activate(X1),activate(X2)) activate(n__a()) -> a() activate(n__e()) -> e() activate(n__i()) -> i() activate(n__o()) -> o() activate(n__u()) -> u() activate(X) -> X Arctic Interpretation Processor: dimension: 1 interpretation: [U51#](x0, x1) = x0 + 5x1, [isNeList#](x0) = 5x0, [U41#](x0, x1) = 3x0 + 5x1, [isList#](x0) = 5x0 + 0, [U21#](x0, x1) = 7x0 + 5x1 + 0, [u] = 5, [o] = 0, [i] = 0, [e] = 0, [a] = 5, [n__u] = 5, [n__o] = 0, [n__i] = 0, [n__e] = 0, [n__a] = 5, [isNePal](x0) = 1x0 + 0, [isQid](x0) = x0, [n____](x0, x1) = 2x0 + x1 + 0, [n__nil] = 0, [U81](x0) = 0, [U72](x0) = 0, [isPal](x0) = 1x0 + 1, [U71](x0, x1) = 3x0 + x1 + 0, [U61](x0) = 0, [U52](x0) = x0, [U51](x0, x1) = 1x0 + x1 + 0, [U42](x0) = x0, [isNeList](x0) = x0, [U41](x0, x1) = x0 + x1 + 0, [U31](x0) = x0, [U22](x0) = x0 + 0, [isList](x0) = x0, [activate](x0) = x0, [U21](x0, x1) = x0 + x1, [U11](x0) = x0, [tt] = 0, [nil] = 0, [__](x0, x1) = 2x0 + x1 + 0 orientation: U51#(tt(),V2) = 5V2 + 0 >= 5V2 + 0 = isList#(activate(V2)) isList#(V) = 5V + 0 >= 5V = isNeList#(activate(V)) isNeList#(n____(V1,V2)) = 7V1 + 5V2 + 5 >= 5V1 + 0 = isList#(activate(V1)) isList#(n____(V1,V2)) = 7V1 + 5V2 + 5 >= 5V1 + 0 = isList#(activate(V1)) isList#(n____(V1,V2)) = 7V1 + 5V2 + 5 >= 7V1 + 5V2 + 0 = U21#(isList(activate(V1)),activate(V2)) U21#(tt(),V2) = 5V2 + 7 >= 5V2 + 0 = isList#(activate(V2)) isNeList#(n____(V1,V2)) = 7V1 + 5V2 + 5 >= 3V1 + 5V2 = U41#(isList(activate(V1)),activate(V2)) U41#(tt(),V2) = 5V2 + 3 >= 5V2 = isNeList#(activate(V2)) isNeList#(n____(V1,V2)) = 7V1 + 5V2 + 5 >= V1 + 5V2 = U51#(isNeList(activate(V1)),activate(V2)) __(__(X,Y),Z) = 4X + 2Y + Z + 2 >= 2X + 2Y + Z + 0 = __(X,__(Y,Z)) __(X,nil()) = 2X + 0 >= X = X __(nil(),X) = X + 2 >= X = X U11(tt()) = 0 >= 0 = tt() U21(tt(),V2) = V2 + 0 >= V2 + 0 = U22(isList(activate(V2))) U22(tt()) = 0 >= 0 = tt() U31(tt()) = 0 >= 0 = tt() U41(tt(),V2) = V2 + 0 >= V2 = U42(isNeList(activate(V2))) U42(tt()) = 0 >= 0 = tt() U51(tt(),V2) = V2 + 1 >= V2 = U52(isList(activate(V2))) U52(tt()) = 0 >= 0 = tt() U61(tt()) = 0 >= 0 = tt() U71(tt(),P) = P + 3 >= 0 = U72(isPal(activate(P))) U72(tt()) = 0 >= 0 = tt() U81(tt()) = 0 >= 0 = tt() isList(V) = V >= V = U11(isNeList(activate(V))) isList(n__nil()) = 0 >= 0 = tt() isList(n____(V1,V2)) = 2V1 + V2 + 0 >= V1 + V2 = U21(isList(activate(V1)),activate(V2)) isNeList(V) = V >= V = U31(isQid(activate(V))) isNeList(n____(V1,V2)) = 2V1 + V2 + 0 >= V1 + V2 + 0 = U41(isList(activate(V1)),activate(V2)) isNeList(n____(V1,V2)) = 2V1 + V2 + 0 >= 1V1 + V2 + 0 = U51(isNeList(activate(V1)),activate(V2)) isNePal(V) = 1V + 0 >= 0 = U61(isQid(activate(V))) isNePal(n____(I,n____(P,I))) = 3I + 3P + 1 >= 3I + P + 0 = U71(isQid(activate(I)),activate(P)) isPal(V) = 1V + 1 >= 0 = U81(isNePal(activate(V))) isPal(n__nil()) = 1 >= 0 = tt() isQid(n__a()) = 5 >= 0 = tt() isQid(n__e()) = 0 >= 0 = tt() isQid(n__i()) = 0 >= 0 = tt() isQid(n__o()) = 0 >= 0 = tt() isQid(n__u()) = 5 >= 0 = tt() nil() = 0 >= 0 = n__nil() __(X1,X2) = 2X1 + X2 + 0 >= 2X1 + X2 + 0 = n____(X1,X2) a() = 5 >= 5 = n__a() e() = 0 >= 0 = n__e() i() = 0 >= 0 = n__i() o() = 0 >= 0 = n__o() u() = 5 >= 5 = n__u() activate(n__nil()) = 0 >= 0 = nil() activate(n____(X1,X2)) = 2X1 + X2 + 0 >= 2X1 + X2 + 0 = __(activate(X1),activate(X2)) activate(n__a()) = 5 >= 5 = a() activate(n__e()) = 0 >= 0 = e() activate(n__i()) = 0 >= 0 = i() activate(n__o()) = 0 >= 0 = o() activate(n__u()) = 5 >= 5 = u() activate(X) = X >= X = X problem: DPs: U51#(tt(),V2) -> isList#(activate(V2)) isList#(V) -> isNeList#(activate(V)) isList#(n____(V1,V2)) -> U21#(isList(activate(V1)),activate(V2)) U21#(tt(),V2) -> isList#(activate(V2)) isNeList#(n____(V1,V2)) -> U41#(isList(activate(V1)),activate(V2)) U41#(tt(),V2) -> isNeList#(activate(V2)) isNeList#(n____(V1,V2)) -> U51#(isNeList(activate(V1)),activate(V2)) TRS: __(__(X,Y),Z) -> __(X,__(Y,Z)) __(X,nil()) -> X __(nil(),X) -> X U11(tt()) -> tt() U21(tt(),V2) -> U22(isList(activate(V2))) U22(tt()) -> tt() U31(tt()) -> tt() U41(tt(),V2) -> U42(isNeList(activate(V2))) U42(tt()) -> tt() U51(tt(),V2) -> U52(isList(activate(V2))) U52(tt()) -> tt() U61(tt()) -> tt() U71(tt(),P) -> U72(isPal(activate(P))) U72(tt()) -> tt() U81(tt()) -> tt() isList(V) -> U11(isNeList(activate(V))) isList(n__nil()) -> tt() isList(n____(V1,V2)) -> U21(isList(activate(V1)),activate(V2)) isNeList(V) -> U31(isQid(activate(V))) isNeList(n____(V1,V2)) -> U41(isList(activate(V1)),activate(V2)) isNeList(n____(V1,V2)) -> U51(isNeList(activate(V1)),activate(V2)) isNePal(V) -> U61(isQid(activate(V))) isNePal(n____(I,n____(P,I))) -> U71(isQid(activate(I)),activate(P)) isPal(V) -> U81(isNePal(activate(V))) isPal(n__nil()) -> tt() isQid(n__a()) -> tt() isQid(n__e()) -> tt() isQid(n__i()) -> tt() isQid(n__o()) -> tt() isQid(n__u()) -> tt() nil() -> n__nil() __(X1,X2) -> n____(X1,X2) a() -> n__a() e() -> n__e() i() -> n__i() o() -> n__o() u() -> n__u() activate(n__nil()) -> nil() activate(n____(X1,X2)) -> __(activate(X1),activate(X2)) activate(n__a()) -> a() activate(n__e()) -> e() activate(n__i()) -> i() activate(n__o()) -> o() activate(n__u()) -> u() activate(X) -> X Matrix Interpretation Processor: dim=1 interpretation: [U51#](x0, x1) = 4x0 + 4x1, [isNeList#](x0) = 4x0, [U41#](x0, x1) = 4x0 + 4x1, [isList#](x0) = 4x0, [U21#](x0, x1) = 4x1, [u] = 0, [o] = 2, [i] = 0, [e] = 0, [a] = 1, [n__u] = 0, [n__o] = 2, [n__i] = 0, [n__e] = 0, [n__a] = 1, [isNePal](x0) = 1, [isQid](x0) = 1, [n____](x0, x1) = 4x0 + x1 + 4, [n__nil] = 0, [U81](x0) = 4x0 + 1, [U72](x0) = 1, [isPal](x0) = 4x0 + 5, [U71](x0, x1) = 1, [U61](x0) = 1, [U52](x0) = 1, [U51](x0, x1) = x0 + x1 + 1, [U42](x0) = x0 + 4, [isNeList](x0) = 2x0 + 3, [U41](x0, x1) = 2x1 + 7, [U31](x0) = 2x0 + 1, [U22](x0) = 0, [isList](x0) = 4, [activate](x0) = x0, [U21](x0, x1) = x0, [U11](x0) = 4, [tt] = 0, [nil] = 0, [__](x0, x1) = 4x0 + x1 + 4 orientation: U51#(tt(),V2) = 4V2 >= 4V2 = isList#(activate(V2)) isList#(V) = 4V >= 4V = isNeList#(activate(V)) isList#(n____(V1,V2)) = 16V1 + 4V2 + 16 >= 4V2 = U21#(isList(activate(V1)),activate(V2)) U21#(tt(),V2) = 4V2 >= 4V2 = isList#(activate(V2)) isNeList#(n____(V1,V2)) = 16V1 + 4V2 + 16 >= 4V2 + 16 = U41#(isList(activate(V1)),activate(V2)) U41#(tt(),V2) = 4V2 >= 4V2 = isNeList#(activate(V2)) isNeList#(n____(V1,V2)) = 16V1 + 4V2 + 16 >= 8V1 + 4V2 + 12 = U51#(isNeList(activate(V1)),activate(V2)) __(__(X,Y),Z) = 16X + 4Y + Z + 20 >= 4X + 4Y + Z + 8 = __(X,__(Y,Z)) __(X,nil()) = 4X + 4 >= X = X __(nil(),X) = X + 4 >= X = X U11(tt()) = 4 >= 0 = tt() U21(tt(),V2) = 0 >= 0 = U22(isList(activate(V2))) U22(tt()) = 0 >= 0 = tt() U31(tt()) = 1 >= 0 = tt() U41(tt(),V2) = 2V2 + 7 >= 2V2 + 7 = U42(isNeList(activate(V2))) U42(tt()) = 4 >= 0 = tt() U51(tt(),V2) = V2 + 1 >= 1 = U52(isList(activate(V2))) U52(tt()) = 1 >= 0 = tt() U61(tt()) = 1 >= 0 = tt() U71(tt(),P) = 1 >= 1 = U72(isPal(activate(P))) U72(tt()) = 1 >= 0 = tt() U81(tt()) = 1 >= 0 = tt() isList(V) = 4 >= 4 = U11(isNeList(activate(V))) isList(n__nil()) = 4 >= 0 = tt() isList(n____(V1,V2)) = 4 >= 4 = U21(isList(activate(V1)),activate(V2)) isNeList(V) = 2V + 3 >= 3 = U31(isQid(activate(V))) isNeList(n____(V1,V2)) = 8V1 + 2V2 + 11 >= 2V2 + 7 = U41(isList(activate(V1)),activate(V2)) isNeList(n____(V1,V2)) = 8V1 + 2V2 + 11 >= 2V1 + V2 + 4 = U51(isNeList(activate(V1)),activate(V2)) isNePal(V) = 1 >= 1 = U61(isQid(activate(V))) isNePal(n____(I,n____(P,I))) = 1 >= 1 = U71(isQid(activate(I)),activate(P)) isPal(V) = 4V + 5 >= 5 = U81(isNePal(activate(V))) isPal(n__nil()) = 5 >= 0 = tt() isQid(n__a()) = 1 >= 0 = tt() isQid(n__e()) = 1 >= 0 = tt() isQid(n__i()) = 1 >= 0 = tt() isQid(n__o()) = 1 >= 0 = tt() isQid(n__u()) = 1 >= 0 = tt() nil() = 0 >= 0 = n__nil() __(X1,X2) = 4X1 + X2 + 4 >= 4X1 + X2 + 4 = n____(X1,X2) a() = 1 >= 1 = n__a() e() = 0 >= 0 = n__e() i() = 0 >= 0 = n__i() o() = 2 >= 2 = n__o() u() = 0 >= 0 = n__u() activate(n__nil()) = 0 >= 0 = nil() activate(n____(X1,X2)) = 4X1 + X2 + 4 >= 4X1 + X2 + 4 = __(activate(X1),activate(X2)) activate(n__a()) = 1 >= 1 = a() activate(n__e()) = 0 >= 0 = e() activate(n__i()) = 0 >= 0 = i() activate(n__o()) = 2 >= 2 = o() activate(n__u()) = 0 >= 0 = u() activate(X) = X >= X = X problem: DPs: U51#(tt(),V2) -> isList#(activate(V2)) isList#(V) -> isNeList#(activate(V)) U21#(tt(),V2) -> isList#(activate(V2)) isNeList#(n____(V1,V2)) -> U41#(isList(activate(V1)),activate(V2)) U41#(tt(),V2) -> isNeList#(activate(V2)) TRS: __(__(X,Y),Z) -> __(X,__(Y,Z)) __(X,nil()) -> X __(nil(),X) -> X U11(tt()) -> tt() U21(tt(),V2) -> U22(isList(activate(V2))) U22(tt()) -> tt() U31(tt()) -> tt() U41(tt(),V2) -> U42(isNeList(activate(V2))) U42(tt()) -> tt() U51(tt(),V2) -> U52(isList(activate(V2))) U52(tt()) -> tt() U61(tt()) -> tt() U71(tt(),P) -> U72(isPal(activate(P))) U72(tt()) -> tt() U81(tt()) -> tt() isList(V) -> U11(isNeList(activate(V))) isList(n__nil()) -> tt() isList(n____(V1,V2)) -> U21(isList(activate(V1)),activate(V2)) isNeList(V) -> U31(isQid(activate(V))) isNeList(n____(V1,V2)) -> U41(isList(activate(V1)),activate(V2)) isNeList(n____(V1,V2)) -> U51(isNeList(activate(V1)),activate(V2)) isNePal(V) -> U61(isQid(activate(V))) isNePal(n____(I,n____(P,I))) -> U71(isQid(activate(I)),activate(P)) isPal(V) -> U81(isNePal(activate(V))) isPal(n__nil()) -> tt() isQid(n__a()) -> tt() isQid(n__e()) -> tt() isQid(n__i()) -> tt() isQid(n__o()) -> tt() isQid(n__u()) -> tt() nil() -> n__nil() __(X1,X2) -> n____(X1,X2) a() -> n__a() e() -> n__e() i() -> n__i() o() -> n__o() u() -> n__u() activate(n__nil()) -> nil() activate(n____(X1,X2)) -> __(activate(X1),activate(X2)) activate(n__a()) -> a() activate(n__e()) -> e() activate(n__i()) -> i() activate(n__o()) -> o() activate(n__u()) -> u() activate(X) -> X SCC Processor: #sccs: 1 #rules: 2 #arcs: 27/25 DPs: isNeList#(n____(V1,V2)) -> U41#(isList(activate(V1)),activate(V2)) U41#(tt(),V2) -> isNeList#(activate(V2)) TRS: __(__(X,Y),Z) -> __(X,__(Y,Z)) __(X,nil()) -> X __(nil(),X) -> X U11(tt()) -> tt() U21(tt(),V2) -> U22(isList(activate(V2))) U22(tt()) -> tt() U31(tt()) -> tt() U41(tt(),V2) -> U42(isNeList(activate(V2))) U42(tt()) -> tt() U51(tt(),V2) -> U52(isList(activate(V2))) U52(tt()) -> tt() U61(tt()) -> tt() U71(tt(),P) -> U72(isPal(activate(P))) U72(tt()) -> tt() U81(tt()) -> tt() isList(V) -> U11(isNeList(activate(V))) isList(n__nil()) -> tt() isList(n____(V1,V2)) -> U21(isList(activate(V1)),activate(V2)) isNeList(V) -> U31(isQid(activate(V))) isNeList(n____(V1,V2)) -> U41(isList(activate(V1)),activate(V2)) isNeList(n____(V1,V2)) -> U51(isNeList(activate(V1)),activate(V2)) isNePal(V) -> U61(isQid(activate(V))) isNePal(n____(I,n____(P,I))) -> U71(isQid(activate(I)),activate(P)) isPal(V) -> U81(isNePal(activate(V))) isPal(n__nil()) -> tt() isQid(n__a()) -> tt() isQid(n__e()) -> tt() isQid(n__i()) -> tt() isQid(n__o()) -> tt() isQid(n__u()) -> tt() nil() -> n__nil() __(X1,X2) -> n____(X1,X2) a() -> n__a() e() -> n__e() i() -> n__i() o() -> n__o() u() -> n__u() activate(n__nil()) -> nil() activate(n____(X1,X2)) -> __(activate(X1),activate(X2)) activate(n__a()) -> a() activate(n__e()) -> e() activate(n__i()) -> i() activate(n__o()) -> o() activate(n__u()) -> u() activate(X) -> X Matrix Interpretation Processor: dim=1 interpretation: [isNeList#](x0) = 4x0, [U41#](x0, x1) = 2x0 + 4x1, [u] = 0, [o] = 0, [i] = 2, [e] = 1, [a] = 0, [n__u] = 0, [n__o] = 0, [n__i] = 2, [n__e] = 1, [n__a] = 0, [isNePal](x0) = 6, [isQid](x0) = 1, [n____](x0, x1) = 4x0 + x1 + 2, [n__nil] = 0, [U81](x0) = 1, [U72](x0) = 2, [isPal](x0) = 1, [U71](x0, x1) = 2x0, [U61](x0) = 6, [U52](x0) = 4, [U51](x0, x1) = 4, [U42](x0) = 2, [isNeList](x0) = 6, [U41](x0, x1) = 2, [U31](x0) = 6, [U22](x0) = 1, [isList](x0) = 2x0 + 4, [activate](x0) = x0, [U21](x0, x1) = x1 + 1, [U11](x0) = 4, [tt] = 1, [nil] = 0, [__](x0, x1) = 4x0 + x1 + 2 orientation: isNeList#(n____(V1,V2)) = 16V1 + 4V2 + 8 >= 4V1 + 4V2 + 8 = U41#(isList(activate(V1)),activate(V2)) U41#(tt(),V2) = 4V2 + 2 >= 4V2 = isNeList#(activate(V2)) __(__(X,Y),Z) = 16X + 4Y + Z + 10 >= 4X + 4Y + Z + 4 = __(X,__(Y,Z)) __(X,nil()) = 4X + 2 >= X = X __(nil(),X) = X + 2 >= X = X U11(tt()) = 4 >= 1 = tt() U21(tt(),V2) = V2 + 1 >= 1 = U22(isList(activate(V2))) U22(tt()) = 1 >= 1 = tt() U31(tt()) = 6 >= 1 = tt() U41(tt(),V2) = 2 >= 2 = U42(isNeList(activate(V2))) U42(tt()) = 2 >= 1 = tt() U51(tt(),V2) = 4 >= 4 = U52(isList(activate(V2))) U52(tt()) = 4 >= 1 = tt() U61(tt()) = 6 >= 1 = tt() U71(tt(),P) = 2 >= 2 = U72(isPal(activate(P))) U72(tt()) = 2 >= 1 = tt() U81(tt()) = 1 >= 1 = tt() isList(V) = 2V + 4 >= 4 = U11(isNeList(activate(V))) isList(n__nil()) = 4 >= 1 = tt() isList(n____(V1,V2)) = 8V1 + 2V2 + 8 >= V2 + 1 = U21(isList(activate(V1)),activate(V2)) isNeList(V) = 6 >= 6 = U31(isQid(activate(V))) isNeList(n____(V1,V2)) = 6 >= 2 = U41(isList(activate(V1)),activate(V2)) isNeList(n____(V1,V2)) = 6 >= 4 = U51(isNeList(activate(V1)),activate(V2)) isNePal(V) = 6 >= 6 = U61(isQid(activate(V))) isNePal(n____(I,n____(P,I))) = 6 >= 2 = U71(isQid(activate(I)),activate(P)) isPal(V) = 1 >= 1 = U81(isNePal(activate(V))) isPal(n__nil()) = 1 >= 1 = tt() isQid(n__a()) = 1 >= 1 = tt() isQid(n__e()) = 1 >= 1 = tt() isQid(n__i()) = 1 >= 1 = tt() isQid(n__o()) = 1 >= 1 = tt() isQid(n__u()) = 1 >= 1 = tt() nil() = 0 >= 0 = n__nil() __(X1,X2) = 4X1 + X2 + 2 >= 4X1 + X2 + 2 = n____(X1,X2) a() = 0 >= 0 = n__a() e() = 1 >= 1 = n__e() i() = 2 >= 2 = n__i() o() = 0 >= 0 = n__o() u() = 0 >= 0 = n__u() activate(n__nil()) = 0 >= 0 = nil() activate(n____(X1,X2)) = 4X1 + X2 + 2 >= 4X1 + X2 + 2 = __(activate(X1),activate(X2)) activate(n__a()) = 0 >= 0 = a() activate(n__e()) = 1 >= 1 = e() activate(n__i()) = 2 >= 2 = i() activate(n__o()) = 0 >= 0 = o() activate(n__u()) = 0 >= 0 = u() activate(X) = X >= X = X problem: DPs: isNeList#(n____(V1,V2)) -> U41#(isList(activate(V1)),activate(V2)) TRS: __(__(X,Y),Z) -> __(X,__(Y,Z)) __(X,nil()) -> X __(nil(),X) -> X U11(tt()) -> tt() U21(tt(),V2) -> U22(isList(activate(V2))) U22(tt()) -> tt() U31(tt()) -> tt() U41(tt(),V2) -> U42(isNeList(activate(V2))) U42(tt()) -> tt() U51(tt(),V2) -> U52(isList(activate(V2))) U52(tt()) -> tt() U61(tt()) -> tt() U71(tt(),P) -> U72(isPal(activate(P))) U72(tt()) -> tt() U81(tt()) -> tt() isList(V) -> U11(isNeList(activate(V))) isList(n__nil()) -> tt() isList(n____(V1,V2)) -> U21(isList(activate(V1)),activate(V2)) isNeList(V) -> U31(isQid(activate(V))) isNeList(n____(V1,V2)) -> U41(isList(activate(V1)),activate(V2)) isNeList(n____(V1,V2)) -> U51(isNeList(activate(V1)),activate(V2)) isNePal(V) -> U61(isQid(activate(V))) isNePal(n____(I,n____(P,I))) -> U71(isQid(activate(I)),activate(P)) isPal(V) -> U81(isNePal(activate(V))) isPal(n__nil()) -> tt() isQid(n__a()) -> tt() isQid(n__e()) -> tt() isQid(n__i()) -> tt() isQid(n__o()) -> tt() isQid(n__u()) -> tt() nil() -> n__nil() __(X1,X2) -> n____(X1,X2) a() -> n__a() e() -> n__e() i() -> n__i() o() -> n__o() u() -> n__u() activate(n__nil()) -> nil() activate(n____(X1,X2)) -> __(activate(X1),activate(X2)) activate(n__a()) -> a() activate(n__e()) -> e() activate(n__i()) -> i() activate(n__o()) -> o() activate(n__u()) -> u() activate(X) -> X SCC Processor: #sccs: 0 #rules: 0 #arcs: 2/1 DPs: isNePal#(n____(I,n____(P,I))) -> U71#(isQid(activate(I)),activate(P)) U71#(tt(),P) -> isPal#(activate(P)) isPal#(V) -> isNePal#(activate(V)) TRS: __(__(X,Y),Z) -> __(X,__(Y,Z)) __(X,nil()) -> X __(nil(),X) -> X U11(tt()) -> tt() U21(tt(),V2) -> U22(isList(activate(V2))) U22(tt()) -> tt() U31(tt()) -> tt() U41(tt(),V2) -> U42(isNeList(activate(V2))) U42(tt()) -> tt() U51(tt(),V2) -> U52(isList(activate(V2))) U52(tt()) -> tt() U61(tt()) -> tt() U71(tt(),P) -> U72(isPal(activate(P))) U72(tt()) -> tt() U81(tt()) -> tt() isList(V) -> U11(isNeList(activate(V))) isList(n__nil()) -> tt() isList(n____(V1,V2)) -> U21(isList(activate(V1)),activate(V2)) isNeList(V) -> U31(isQid(activate(V))) isNeList(n____(V1,V2)) -> U41(isList(activate(V1)),activate(V2)) isNeList(n____(V1,V2)) -> U51(isNeList(activate(V1)),activate(V2)) isNePal(V) -> U61(isQid(activate(V))) isNePal(n____(I,n____(P,I))) -> U71(isQid(activate(I)),activate(P)) isPal(V) -> U81(isNePal(activate(V))) isPal(n__nil()) -> tt() isQid(n__a()) -> tt() isQid(n__e()) -> tt() isQid(n__i()) -> tt() isQid(n__o()) -> tt() isQid(n__u()) -> tt() nil() -> n__nil() __(X1,X2) -> n____(X1,X2) a() -> n__a() e() -> n__e() i() -> n__i() o() -> n__o() u() -> n__u() activate(n__nil()) -> nil() activate(n____(X1,X2)) -> __(activate(X1),activate(X2)) activate(n__a()) -> a() activate(n__e()) -> e() activate(n__i()) -> i() activate(n__o()) -> o() activate(n__u()) -> u() activate(X) -> X Arctic Interpretation Processor: dimension: 1 interpretation: [isNePal#](x0) = 1x0, [isPal#](x0) = 4x0 + 0, [U71#](x0, x1) = x0 + 4x1 + 1, [u] = 0, [o] = 0, [i] = 6, [e] = 3, [a] = 0, [n__u] = 0, [n__o] = 0, [n__i] = 6, [n__e] = 3, [n__a] = 0, [isNePal](x0) = x0 + 4, [isQid](x0) = x0 + 4, [n____](x0, x1) = 3x0 + x1 + 4, [n__nil] = 0, [U81](x0) = 0, [U72](x0) = x0 + 0, [isPal](x0) = x0 + 0, [U71](x0, x1) = x1 + 0, [U61](x0) = x0 + 1, [U52](x0) = 0, [U51](x0, x1) = x0 + x1 + 0, [U42](x0) = 0, [isNeList](x0) = x0 + 0, [U41](x0, x1) = 4, [U31](x0) = 0, [U22](x0) = x0 + 0, [isList](x0) = 2x0 + 2, [activate](x0) = x0, [U21](x0, x1) = 2x1 + 2, [U11](x0) = 2x0 + 0, [tt] = 0, [nil] = 0, [__](x0, x1) = 3x0 + x1 + 4 orientation: isNePal#(n____(I,n____(P,I))) = 4I + 4P + 5 >= I + 4P + 4 = U71#(isQid(activate(I)),activate(P)) U71#(tt(),P) = 4P + 1 >= 4P + 0 = isPal#(activate(P)) isPal#(V) = 4V + 0 >= 1V = isNePal#(activate(V)) __(__(X,Y),Z) = 6X + 3Y + Z + 7 >= 3X + 3Y + Z + 4 = __(X,__(Y,Z)) __(X,nil()) = 3X + 4 >= X = X __(nil(),X) = X + 4 >= X = X U11(tt()) = 2 >= 0 = tt() U21(tt(),V2) = 2V2 + 2 >= 2V2 + 2 = U22(isList(activate(V2))) U22(tt()) = 0 >= 0 = tt() U31(tt()) = 0 >= 0 = tt() U41(tt(),V2) = 4 >= 0 = U42(isNeList(activate(V2))) U42(tt()) = 0 >= 0 = tt() U51(tt(),V2) = V2 + 0 >= 0 = U52(isList(activate(V2))) U52(tt()) = 0 >= 0 = tt() U61(tt()) = 1 >= 0 = tt() U71(tt(),P) = P + 0 >= P + 0 = U72(isPal(activate(P))) U72(tt()) = 0 >= 0 = tt() U81(tt()) = 0 >= 0 = tt() isList(V) = 2V + 2 >= 2V + 2 = U11(isNeList(activate(V))) isList(n__nil()) = 2 >= 0 = tt() isList(n____(V1,V2)) = 5V1 + 2V2 + 6 >= 2V2 + 2 = U21(isList(activate(V1)),activate(V2)) isNeList(V) = V + 0 >= 0 = U31(isQid(activate(V))) isNeList(n____(V1,V2)) = 3V1 + V2 + 4 >= 4 = U41(isList(activate(V1)),activate(V2)) isNeList(n____(V1,V2)) = 3V1 + V2 + 4 >= V1 + V2 + 0 = U51(isNeList(activate(V1)),activate(V2)) isNePal(V) = V + 4 >= V + 4 = U61(isQid(activate(V))) isNePal(n____(I,n____(P,I))) = 3I + 3P + 4 >= P + 0 = U71(isQid(activate(I)),activate(P)) isPal(V) = V + 0 >= 0 = U81(isNePal(activate(V))) isPal(n__nil()) = 0 >= 0 = tt() isQid(n__a()) = 4 >= 0 = tt() isQid(n__e()) = 4 >= 0 = tt() isQid(n__i()) = 6 >= 0 = tt() isQid(n__o()) = 4 >= 0 = tt() isQid(n__u()) = 4 >= 0 = tt() nil() = 0 >= 0 = n__nil() __(X1,X2) = 3X1 + X2 + 4 >= 3X1 + X2 + 4 = n____(X1,X2) a() = 0 >= 0 = n__a() e() = 3 >= 3 = n__e() i() = 6 >= 6 = n__i() o() = 0 >= 0 = n__o() u() = 0 >= 0 = n__u() activate(n__nil()) = 0 >= 0 = nil() activate(n____(X1,X2)) = 3X1 + X2 + 4 >= 3X1 + X2 + 4 = __(activate(X1),activate(X2)) activate(n__a()) = 0 >= 0 = a() activate(n__e()) = 3 >= 3 = e() activate(n__i()) = 6 >= 6 = i() activate(n__o()) = 0 >= 0 = o() activate(n__u()) = 0 >= 0 = u() activate(X) = X >= X = X problem: DPs: isNePal#(n____(I,n____(P,I))) -> U71#(isQid(activate(I)),activate(P)) U71#(tt(),P) -> isPal#(activate(P)) TRS: __(__(X,Y),Z) -> __(X,__(Y,Z)) __(X,nil()) -> X __(nil(),X) -> X U11(tt()) -> tt() U21(tt(),V2) -> U22(isList(activate(V2))) U22(tt()) -> tt() U31(tt()) -> tt() U41(tt(),V2) -> U42(isNeList(activate(V2))) U42(tt()) -> tt() U51(tt(),V2) -> U52(isList(activate(V2))) U52(tt()) -> tt() U61(tt()) -> tt() U71(tt(),P) -> U72(isPal(activate(P))) U72(tt()) -> tt() U81(tt()) -> tt() isList(V) -> U11(isNeList(activate(V))) isList(n__nil()) -> tt() isList(n____(V1,V2)) -> U21(isList(activate(V1)),activate(V2)) isNeList(V) -> U31(isQid(activate(V))) isNeList(n____(V1,V2)) -> U41(isList(activate(V1)),activate(V2)) isNeList(n____(V1,V2)) -> U51(isNeList(activate(V1)),activate(V2)) isNePal(V) -> U61(isQid(activate(V))) isNePal(n____(I,n____(P,I))) -> U71(isQid(activate(I)),activate(P)) isPal(V) -> U81(isNePal(activate(V))) isPal(n__nil()) -> tt() isQid(n__a()) -> tt() isQid(n__e()) -> tt() isQid(n__i()) -> tt() isQid(n__o()) -> tt() isQid(n__u()) -> tt() nil() -> n__nil() __(X1,X2) -> n____(X1,X2) a() -> n__a() e() -> n__e() i() -> n__i() o() -> n__o() u() -> n__u() activate(n__nil()) -> nil() activate(n____(X1,X2)) -> __(activate(X1),activate(X2)) activate(n__a()) -> a() activate(n__e()) -> e() activate(n__i()) -> i() activate(n__o()) -> o() activate(n__u()) -> u() activate(X) -> X SCC Processor: #sccs: 0 #rules: 0 #arcs: 3/4 DPs: activate#(n____(X1,X2)) -> activate#(X2) activate#(n____(X1,X2)) -> activate#(X1) TRS: __(__(X,Y),Z) -> __(X,__(Y,Z)) __(X,nil()) -> X __(nil(),X) -> X U11(tt()) -> tt() U21(tt(),V2) -> U22(isList(activate(V2))) U22(tt()) -> tt() U31(tt()) -> tt() U41(tt(),V2) -> U42(isNeList(activate(V2))) U42(tt()) -> tt() U51(tt(),V2) -> U52(isList(activate(V2))) U52(tt()) -> tt() U61(tt()) -> tt() U71(tt(),P) -> U72(isPal(activate(P))) U72(tt()) -> tt() U81(tt()) -> tt() isList(V) -> U11(isNeList(activate(V))) isList(n__nil()) -> tt() isList(n____(V1,V2)) -> U21(isList(activate(V1)),activate(V2)) isNeList(V) -> U31(isQid(activate(V))) isNeList(n____(V1,V2)) -> U41(isList(activate(V1)),activate(V2)) isNeList(n____(V1,V2)) -> U51(isNeList(activate(V1)),activate(V2)) isNePal(V) -> U61(isQid(activate(V))) isNePal(n____(I,n____(P,I))) -> U71(isQid(activate(I)),activate(P)) isPal(V) -> U81(isNePal(activate(V))) isPal(n__nil()) -> tt() isQid(n__a()) -> tt() isQid(n__e()) -> tt() isQid(n__i()) -> tt() isQid(n__o()) -> tt() isQid(n__u()) -> tt() nil() -> n__nil() __(X1,X2) -> n____(X1,X2) a() -> n__a() e() -> n__e() i() -> n__i() o() -> n__o() u() -> n__u() activate(n__nil()) -> nil() activate(n____(X1,X2)) -> __(activate(X1),activate(X2)) activate(n__a()) -> a() activate(n__e()) -> e() activate(n__i()) -> i() activate(n__o()) -> o() activate(n__u()) -> u() activate(X) -> X Subterm Criterion Processor: simple projection: pi(activate#) = 0 problem: DPs: TRS: __(__(X,Y),Z) -> __(X,__(Y,Z)) __(X,nil()) -> X __(nil(),X) -> X U11(tt()) -> tt() U21(tt(),V2) -> U22(isList(activate(V2))) U22(tt()) -> tt() U31(tt()) -> tt() U41(tt(),V2) -> U42(isNeList(activate(V2))) U42(tt()) -> tt() U51(tt(),V2) -> U52(isList(activate(V2))) U52(tt()) -> tt() U61(tt()) -> tt() U71(tt(),P) -> U72(isPal(activate(P))) U72(tt()) -> tt() U81(tt()) -> tt() isList(V) -> U11(isNeList(activate(V))) isList(n__nil()) -> tt() isList(n____(V1,V2)) -> U21(isList(activate(V1)),activate(V2)) isNeList(V) -> U31(isQid(activate(V))) isNeList(n____(V1,V2)) -> U41(isList(activate(V1)),activate(V2)) isNeList(n____(V1,V2)) -> U51(isNeList(activate(V1)),activate(V2)) isNePal(V) -> U61(isQid(activate(V))) isNePal(n____(I,n____(P,I))) -> U71(isQid(activate(I)),activate(P)) isPal(V) -> U81(isNePal(activate(V))) isPal(n__nil()) -> tt() isQid(n__a()) -> tt() isQid(n__e()) -> tt() isQid(n__i()) -> tt() isQid(n__o()) -> tt() isQid(n__u()) -> tt() nil() -> n__nil() __(X1,X2) -> n____(X1,X2) a() -> n__a() e() -> n__e() i() -> n__i() o() -> n__o() u() -> n__u() activate(n__nil()) -> nil() activate(n____(X1,X2)) -> __(activate(X1),activate(X2)) activate(n__a()) -> a() activate(n__e()) -> e() activate(n__i()) -> i() activate(n__o()) -> o() activate(n__u()) -> u() activate(X) -> X Qed DPs: __#(__(X,Y),Z) -> __#(Y,Z) __#(__(X,Y),Z) -> __#(X,__(Y,Z)) TRS: __(__(X,Y),Z) -> __(X,__(Y,Z)) __(X,nil()) -> X __(nil(),X) -> X U11(tt()) -> tt() U21(tt(),V2) -> U22(isList(activate(V2))) U22(tt()) -> tt() U31(tt()) -> tt() U41(tt(),V2) -> U42(isNeList(activate(V2))) U42(tt()) -> tt() U51(tt(),V2) -> U52(isList(activate(V2))) U52(tt()) -> tt() U61(tt()) -> tt() U71(tt(),P) -> U72(isPal(activate(P))) U72(tt()) -> tt() U81(tt()) -> tt() isList(V) -> U11(isNeList(activate(V))) isList(n__nil()) -> tt() isList(n____(V1,V2)) -> U21(isList(activate(V1)),activate(V2)) isNeList(V) -> U31(isQid(activate(V))) isNeList(n____(V1,V2)) -> U41(isList(activate(V1)),activate(V2)) isNeList(n____(V1,V2)) -> U51(isNeList(activate(V1)),activate(V2)) isNePal(V) -> U61(isQid(activate(V))) isNePal(n____(I,n____(P,I))) -> U71(isQid(activate(I)),activate(P)) isPal(V) -> U81(isNePal(activate(V))) isPal(n__nil()) -> tt() isQid(n__a()) -> tt() isQid(n__e()) -> tt() isQid(n__i()) -> tt() isQid(n__o()) -> tt() isQid(n__u()) -> tt() nil() -> n__nil() __(X1,X2) -> n____(X1,X2) a() -> n__a() e() -> n__e() i() -> n__i() o() -> n__o() u() -> n__u() activate(n__nil()) -> nil() activate(n____(X1,X2)) -> __(activate(X1),activate(X2)) activate(n__a()) -> a() activate(n__e()) -> e() activate(n__i()) -> i() activate(n__o()) -> o() activate(n__u()) -> u() activate(X) -> X Subterm Criterion Processor: simple projection: pi(__#) = 0 problem: DPs: TRS: __(__(X,Y),Z) -> __(X,__(Y,Z)) __(X,nil()) -> X __(nil(),X) -> X U11(tt()) -> tt() U21(tt(),V2) -> U22(isList(activate(V2))) U22(tt()) -> tt() U31(tt()) -> tt() U41(tt(),V2) -> U42(isNeList(activate(V2))) U42(tt()) -> tt() U51(tt(),V2) -> U52(isList(activate(V2))) U52(tt()) -> tt() U61(tt()) -> tt() U71(tt(),P) -> U72(isPal(activate(P))) U72(tt()) -> tt() U81(tt()) -> tt() isList(V) -> U11(isNeList(activate(V))) isList(n__nil()) -> tt() isList(n____(V1,V2)) -> U21(isList(activate(V1)),activate(V2)) isNeList(V) -> U31(isQid(activate(V))) isNeList(n____(V1,V2)) -> U41(isList(activate(V1)),activate(V2)) isNeList(n____(V1,V2)) -> U51(isNeList(activate(V1)),activate(V2)) isNePal(V) -> U61(isQid(activate(V))) isNePal(n____(I,n____(P,I))) -> U71(isQid(activate(I)),activate(P)) isPal(V) -> U81(isNePal(activate(V))) isPal(n__nil()) -> tt() isQid(n__a()) -> tt() isQid(n__e()) -> tt() isQid(n__i()) -> tt() isQid(n__o()) -> tt() isQid(n__u()) -> tt() nil() -> n__nil() __(X1,X2) -> n____(X1,X2) a() -> n__a() e() -> n__e() i() -> n__i() o() -> n__o() u() -> n__u() activate(n__nil()) -> nil() activate(n____(X1,X2)) -> __(activate(X1),activate(X2)) activate(n__a()) -> a() activate(n__e()) -> e() activate(n__i()) -> i() activate(n__o()) -> o() activate(n__u()) -> u() activate(X) -> X Qed