0.00/0.02 YES 0.00/0.02 0.00/0.02 Problem 1: 0.00/0.02 0.00/0.02 (VAR I P V V1 V2 X Y Z) 0.00/0.02 (STRATEGY CONTEXTSENSITIVE 0.00/0.02 (U11 1) 0.00/0.02 (U21 1) 0.00/0.02 (U22 1) 0.00/0.02 (U31 1) 0.00/0.02 (U41 1) 0.00/0.02 (U42 1) 0.00/0.02 (U51 1) 0.00/0.02 (U52 1) 0.00/0.02 (U61 1) 0.00/0.02 (U71 1) 0.00/0.02 (U72 1) 0.00/0.02 (U81 1) 0.00/0.02 (__ 1 2) 0.00/0.02 (isList) 0.00/0.02 (isNeList) 0.00/0.02 (isNePal) 0.00/0.02 (isPal) 0.00/0.02 (isQid) 0.00/0.02 (a) 0.00/0.02 (e) 0.00/0.02 (i) 0.00/0.02 (nil) 0.00/0.02 (o) 0.00/0.02 (tt) 0.00/0.02 (u) 0.00/0.02 ) 0.00/0.02 (RULES 0.00/0.02 U11(tt) -> tt 0.00/0.02 U21(tt,V2) -> U22(isList(V2)) 0.00/0.02 U22(tt) -> tt 0.00/0.02 U31(tt) -> tt 0.00/0.02 U41(tt,V2) -> U42(isNeList(V2)) 0.00/0.02 U42(tt) -> tt 0.00/0.02 U51(tt,V2) -> U52(isList(V2)) 0.00/0.02 U52(tt) -> tt 0.00/0.02 U61(tt) -> tt 0.00/0.02 U71(tt,P) -> U72(isPal(P)) 0.00/0.02 U72(tt) -> tt 0.00/0.02 U81(tt) -> tt 0.00/0.02 __(__(X,Y),Z) -> __(X,__(Y,Z)) 0.00/0.02 __(nil,X) -> X 0.00/0.02 __(X,nil) -> X 0.00/0.02 isList(__(V1,V2)) -> U21(isList(V1),V2) 0.00/0.02 isList(nil) -> tt 0.00/0.02 isList(V) -> U11(isNeList(V)) 0.00/0.02 isNeList(__(V1,V2)) -> U41(isList(V1),V2) 0.00/0.02 isNeList(__(V1,V2)) -> U51(isNeList(V1),V2) 0.00/0.02 isNeList(V) -> U31(isQid(V)) 0.00/0.02 isNePal(__(I,__(P,I))) -> U71(isQid(I),P) 0.00/0.02 isNePal(V) -> U61(isQid(V)) 0.00/0.02 isPal(nil) -> tt 0.00/0.02 isPal(V) -> U81(isNePal(V)) 0.00/0.02 isQid(a) -> tt 0.00/0.02 isQid(e) -> tt 0.00/0.02 isQid(i) -> tt 0.00/0.02 isQid(o) -> tt 0.00/0.02 isQid(u) -> tt 0.00/0.02 ) 0.00/0.02 0.00/0.02 Problem 1: 0.00/0.02 0.00/0.02 Dependency Pairs Processor: 0.00/0.02 -> Pairs: 0.00/0.02 U21#(tt,V2) -> U22#(isList(V2)) 0.00/0.02 U21#(tt,V2) -> ISLIST(V2) 0.00/0.02 U41#(tt,V2) -> U42#(isNeList(V2)) 0.00/0.02 U41#(tt,V2) -> ISNELIST(V2) 0.00/0.02 U51#(tt,V2) -> U52#(isList(V2)) 0.00/0.02 U51#(tt,V2) -> ISLIST(V2) 0.00/0.02 U71#(tt,P) -> U72#(isPal(P)) 0.00/0.02 U71#(tt,P) -> ISPAL(P) 0.00/0.02 __#(__(X,Y),Z) -> __#(X,__(Y,Z)) 0.00/0.02 __#(__(X,Y),Z) -> __#(Y,Z) 0.00/0.02 ISLIST(__(V1,V2)) -> U21#(isList(V1),V2) 0.00/0.02 ISLIST(__(V1,V2)) -> ISLIST(V1) 0.00/0.02 ISLIST(V) -> U11#(isNeList(V)) 0.00/0.02 ISLIST(V) -> ISNELIST(V) 0.00/0.02 ISNELIST(__(V1,V2)) -> U41#(isList(V1),V2) 0.00/0.02 ISNELIST(__(V1,V2)) -> U51#(isNeList(V1),V2) 0.00/0.02 ISNELIST(__(V1,V2)) -> ISLIST(V1) 0.00/0.02 ISNELIST(__(V1,V2)) -> ISNELIST(V1) 0.00/0.02 ISNELIST(V) -> U31#(isQid(V)) 0.00/0.02 ISNELIST(V) -> ISQID(V) 0.00/0.02 ISNEPAL(__(I,__(P,I))) -> U71#(isQid(I),P) 0.00/0.02 ISNEPAL(__(I,__(P,I))) -> ISQID(I) 0.00/0.02 ISNEPAL(V) -> U61#(isQid(V)) 0.00/0.02 ISNEPAL(V) -> ISQID(V) 0.00/0.02 ISPAL(V) -> U81#(isNePal(V)) 0.00/0.02 ISPAL(V) -> ISNEPAL(V) 0.00/0.02 -> Rules: 0.00/0.02 U11(tt) -> tt 0.00/0.02 U21(tt,V2) -> U22(isList(V2)) 0.00/0.02 U22(tt) -> tt 0.00/0.02 U31(tt) -> tt 0.00/0.02 U41(tt,V2) -> U42(isNeList(V2)) 0.00/0.02 U42(tt) -> tt 0.00/0.02 U51(tt,V2) -> U52(isList(V2)) 0.00/0.02 U52(tt) -> tt 0.00/0.02 U61(tt) -> tt 0.00/0.02 U71(tt,P) -> U72(isPal(P)) 0.00/0.02 U72(tt) -> tt 0.00/0.02 U81(tt) -> tt 0.00/0.02 __(__(X,Y),Z) -> __(X,__(Y,Z)) 0.00/0.02 __(nil,X) -> X 0.00/0.02 __(X,nil) -> X 0.00/0.02 isList(__(V1,V2)) -> U21(isList(V1),V2) 0.00/0.02 isList(nil) -> tt 0.00/0.02 isList(V) -> U11(isNeList(V)) 0.00/0.02 isNeList(__(V1,V2)) -> U41(isList(V1),V2) 0.00/0.02 isNeList(__(V1,V2)) -> U51(isNeList(V1),V2) 0.00/0.02 isNeList(V) -> U31(isQid(V)) 0.00/0.02 isNePal(__(I,__(P,I))) -> U71(isQid(I),P) 0.00/0.02 isNePal(V) -> U61(isQid(V)) 0.00/0.02 isPal(nil) -> tt 0.00/0.02 isPal(V) -> U81(isNePal(V)) 0.00/0.02 isQid(a) -> tt 0.00/0.02 isQid(e) -> tt 0.00/0.02 isQid(i) -> tt 0.00/0.02 isQid(o) -> tt 0.00/0.02 isQid(u) -> tt 0.00/0.02 -> Unhiding Rules: 0.00/0.02 Empty 0.00/0.02 0.00/0.02 Problem 1: 0.00/0.02 0.00/0.02 SCC Processor: 0.00/0.02 -> Pairs: 0.00/0.02 U21#(tt,V2) -> U22#(isList(V2)) 0.00/0.02 U21#(tt,V2) -> ISLIST(V2) 0.00/0.02 U41#(tt,V2) -> U42#(isNeList(V2)) 0.00/0.02 U41#(tt,V2) -> ISNELIST(V2) 0.00/0.02 U51#(tt,V2) -> U52#(isList(V2)) 0.00/0.02 U51#(tt,V2) -> ISLIST(V2) 0.00/0.02 U71#(tt,P) -> U72#(isPal(P)) 0.00/0.02 U71#(tt,P) -> ISPAL(P) 0.00/0.02 __#(__(X,Y),Z) -> __#(X,__(Y,Z)) 0.00/0.02 __#(__(X,Y),Z) -> __#(Y,Z) 0.00/0.02 ISLIST(__(V1,V2)) -> U21#(isList(V1),V2) 0.00/0.02 ISLIST(__(V1,V2)) -> ISLIST(V1) 0.00/0.02 ISLIST(V) -> U11#(isNeList(V)) 0.00/0.02 ISLIST(V) -> ISNELIST(V) 0.00/0.02 ISNELIST(__(V1,V2)) -> U41#(isList(V1),V2) 0.00/0.02 ISNELIST(__(V1,V2)) -> U51#(isNeList(V1),V2) 0.00/0.02 ISNELIST(__(V1,V2)) -> ISLIST(V1) 0.00/0.02 ISNELIST(__(V1,V2)) -> ISNELIST(V1) 0.00/0.02 ISNELIST(V) -> U31#(isQid(V)) 0.00/0.02 ISNELIST(V) -> ISQID(V) 0.00/0.02 ISNEPAL(__(I,__(P,I))) -> U71#(isQid(I),P) 0.00/0.02 ISNEPAL(__(I,__(P,I))) -> ISQID(I) 0.00/0.02 ISNEPAL(V) -> U61#(isQid(V)) 0.00/0.02 ISNEPAL(V) -> ISQID(V) 0.00/0.02 ISPAL(V) -> U81#(isNePal(V)) 0.00/0.02 ISPAL(V) -> ISNEPAL(V) 0.00/0.02 -> Rules: 0.00/0.02 U11(tt) -> tt 0.00/0.02 U21(tt,V2) -> U22(isList(V2)) 0.00/0.02 U22(tt) -> tt 0.00/0.02 U31(tt) -> tt 0.00/0.02 U41(tt,V2) -> U42(isNeList(V2)) 0.00/0.02 U42(tt) -> tt 0.00/0.02 U51(tt,V2) -> U52(isList(V2)) 0.00/0.02 U52(tt) -> tt 0.00/0.02 U61(tt) -> tt 0.00/0.02 U71(tt,P) -> U72(isPal(P)) 0.00/0.02 U72(tt) -> tt 0.00/0.02 U81(tt) -> tt 0.00/0.02 __(__(X,Y),Z) -> __(X,__(Y,Z)) 0.00/0.02 __(nil,X) -> X 0.00/0.02 __(X,nil) -> X 0.00/0.02 isList(__(V1,V2)) -> U21(isList(V1),V2) 0.00/0.02 isList(nil) -> tt 0.00/0.02 isList(V) -> U11(isNeList(V)) 0.00/0.02 isNeList(__(V1,V2)) -> U41(isList(V1),V2) 0.00/0.02 isNeList(__(V1,V2)) -> U51(isNeList(V1),V2) 0.00/0.02 isNeList(V) -> U31(isQid(V)) 0.00/0.02 isNePal(__(I,__(P,I))) -> U71(isQid(I),P) 0.00/0.02 isNePal(V) -> U61(isQid(V)) 0.00/0.02 isPal(nil) -> tt 0.00/0.02 isPal(V) -> U81(isNePal(V)) 0.00/0.02 isQid(a) -> tt 0.00/0.02 isQid(e) -> tt 0.00/0.02 isQid(i) -> tt 0.00/0.02 isQid(o) -> tt 0.00/0.02 isQid(u) -> tt 0.00/0.02 -> Unhiding rules: 0.00/0.02 Empty 0.00/0.02 ->Strongly Connected Components: 0.00/0.02 ->->Cycle: 0.00/0.02 ->->-> Pairs: 0.00/0.02 __#(__(X,Y),Z) -> __#(X,__(Y,Z)) 0.00/0.02 __#(__(X,Y),Z) -> __#(Y,Z) 0.00/0.02 ->->-> Rules: 0.00/0.02 U11(tt) -> tt 0.00/0.02 U21(tt,V2) -> U22(isList(V2)) 0.00/0.02 U22(tt) -> tt 0.00/0.02 U31(tt) -> tt 0.00/0.02 U41(tt,V2) -> U42(isNeList(V2)) 0.00/0.02 U42(tt) -> tt 0.00/0.02 U51(tt,V2) -> U52(isList(V2)) 0.00/0.02 U52(tt) -> tt 0.00/0.02 U61(tt) -> tt 0.00/0.02 U71(tt,P) -> U72(isPal(P)) 0.00/0.02 U72(tt) -> tt 0.00/0.02 U81(tt) -> tt 0.00/0.02 __(__(X,Y),Z) -> __(X,__(Y,Z)) 0.00/0.02 __(nil,X) -> X 0.00/0.02 __(X,nil) -> X 0.00/0.02 isList(__(V1,V2)) -> U21(isList(V1),V2) 0.00/0.02 isList(nil) -> tt 0.00/0.02 isList(V) -> U11(isNeList(V)) 0.00/0.02 isNeList(__(V1,V2)) -> U41(isList(V1),V2) 0.00/0.02 isNeList(__(V1,V2)) -> U51(isNeList(V1),V2) 0.00/0.02 isNeList(V) -> U31(isQid(V)) 0.00/0.02 isNePal(__(I,__(P,I))) -> U71(isQid(I),P) 0.00/0.02 isNePal(V) -> U61(isQid(V)) 0.00/0.02 isPal(nil) -> tt 0.00/0.02 isPal(V) -> U81(isNePal(V)) 0.00/0.02 isQid(a) -> tt 0.00/0.02 isQid(e) -> tt 0.00/0.02 isQid(i) -> tt 0.00/0.02 isQid(o) -> tt 0.00/0.02 isQid(u) -> tt 0.00/0.02 ->->-> Unhiding rules: 0.00/0.02 Empty 0.00/0.02 ->->Cycle: 0.00/0.02 ->->-> Pairs: 0.00/0.02 U71#(tt,P) -> ISPAL(P) 0.00/0.02 ISNEPAL(__(I,__(P,I))) -> U71#(isQid(I),P) 0.00/0.02 ISPAL(V) -> ISNEPAL(V) 0.00/0.02 ->->-> Rules: 0.00/0.02 U11(tt) -> tt 0.00/0.02 U21(tt,V2) -> U22(isList(V2)) 0.00/0.02 U22(tt) -> tt 0.00/0.02 U31(tt) -> tt 0.00/0.02 U41(tt,V2) -> U42(isNeList(V2)) 0.00/0.02 U42(tt) -> tt 0.00/0.02 U51(tt,V2) -> U52(isList(V2)) 0.00/0.02 U52(tt) -> tt 0.00/0.02 U61(tt) -> tt 0.00/0.02 U71(tt,P) -> U72(isPal(P)) 0.00/0.02 U72(tt) -> tt 0.00/0.02 U81(tt) -> tt 0.00/0.02 __(__(X,Y),Z) -> __(X,__(Y,Z)) 0.00/0.02 __(nil,X) -> X 0.00/0.02 __(X,nil) -> X 0.00/0.02 isList(__(V1,V2)) -> U21(isList(V1),V2) 0.00/0.02 isList(nil) -> tt 0.00/0.02 isList(V) -> U11(isNeList(V)) 0.00/0.02 isNeList(__(V1,V2)) -> U41(isList(V1),V2) 0.00/0.02 isNeList(__(V1,V2)) -> U51(isNeList(V1),V2) 0.00/0.02 isNeList(V) -> U31(isQid(V)) 0.00/0.02 isNePal(__(I,__(P,I))) -> U71(isQid(I),P) 0.00/0.02 isNePal(V) -> U61(isQid(V)) 0.00/0.02 isPal(nil) -> tt 0.00/0.02 isPal(V) -> U81(isNePal(V)) 0.00/0.02 isQid(a) -> tt 0.00/0.02 isQid(e) -> tt 0.00/0.02 isQid(i) -> tt 0.00/0.02 isQid(o) -> tt 0.00/0.02 isQid(u) -> tt 0.00/0.02 ->->-> Unhiding rules: 0.00/0.02 Empty 0.00/0.02 ->->Cycle: 0.00/0.02 ->->-> Pairs: 0.00/0.02 U21#(tt,V2) -> ISLIST(V2) 0.00/0.02 U41#(tt,V2) -> ISNELIST(V2) 0.00/0.02 U51#(tt,V2) -> ISLIST(V2) 0.00/0.02 ISLIST(__(V1,V2)) -> U21#(isList(V1),V2) 0.00/0.02 ISLIST(__(V1,V2)) -> ISLIST(V1) 0.00/0.02 ISLIST(V) -> ISNELIST(V) 0.00/0.02 ISNELIST(__(V1,V2)) -> U41#(isList(V1),V2) 0.00/0.02 ISNELIST(__(V1,V2)) -> U51#(isNeList(V1),V2) 0.00/0.02 ISNELIST(__(V1,V2)) -> ISLIST(V1) 0.00/0.02 ISNELIST(__(V1,V2)) -> ISNELIST(V1) 0.00/0.02 ->->-> Rules: 0.00/0.02 U11(tt) -> tt 0.00/0.02 U21(tt,V2) -> U22(isList(V2)) 0.00/0.02 U22(tt) -> tt 0.00/0.02 U31(tt) -> tt 0.00/0.02 U41(tt,V2) -> U42(isNeList(V2)) 0.00/0.02 U42(tt) -> tt 0.00/0.02 U51(tt,V2) -> U52(isList(V2)) 0.00/0.02 U52(tt) -> tt 0.00/0.02 U61(tt) -> tt 0.00/0.02 U71(tt,P) -> U72(isPal(P)) 0.00/0.02 U72(tt) -> tt 0.00/0.02 U81(tt) -> tt 0.00/0.02 __(__(X,Y),Z) -> __(X,__(Y,Z)) 0.00/0.02 __(nil,X) -> X 0.00/0.02 __(X,nil) -> X 0.00/0.02 isList(__(V1,V2)) -> U21(isList(V1),V2) 0.00/0.02 isList(nil) -> tt 0.00/0.02 isList(V) -> U11(isNeList(V)) 0.00/0.02 isNeList(__(V1,V2)) -> U41(isList(V1),V2) 0.00/0.02 isNeList(__(V1,V2)) -> U51(isNeList(V1),V2) 0.00/0.02 isNeList(V) -> U31(isQid(V)) 0.00/0.02 isNePal(__(I,__(P,I))) -> U71(isQid(I),P) 0.00/0.02 isNePal(V) -> U61(isQid(V)) 0.00/0.02 isPal(nil) -> tt 0.00/0.02 isPal(V) -> U81(isNePal(V)) 0.00/0.02 isQid(a) -> tt 0.00/0.02 isQid(e) -> tt 0.00/0.02 isQid(i) -> tt 0.00/0.02 isQid(o) -> tt 0.00/0.02 isQid(u) -> tt 0.00/0.02 ->->-> Unhiding rules: 0.00/0.02 Empty 0.00/0.02 0.00/0.02 0.00/0.02 The problem is decomposed in 3 subproblems. 0.00/0.02 0.00/0.02 Problem 1.1: 0.00/0.02 0.00/0.02 SubNColl Processor: 0.00/0.02 -> Pairs: 0.00/0.02 __#(__(X,Y),Z) -> __#(X,__(Y,Z)) 0.00/0.02 __#(__(X,Y),Z) -> __#(Y,Z) 0.00/0.02 -> Rules: 0.00/0.02 U11(tt) -> tt 0.00/0.02 U21(tt,V2) -> U22(isList(V2)) 0.00/0.02 U22(tt) -> tt 0.00/0.02 U31(tt) -> tt 0.00/0.02 U41(tt,V2) -> U42(isNeList(V2)) 0.00/0.02 U42(tt) -> tt 0.00/0.02 U51(tt,V2) -> U52(isList(V2)) 0.00/0.02 U52(tt) -> tt 0.00/0.02 U61(tt) -> tt 0.00/0.02 U71(tt,P) -> U72(isPal(P)) 0.00/0.02 U72(tt) -> tt 0.00/0.02 U81(tt) -> tt 0.00/0.02 __(__(X,Y),Z) -> __(X,__(Y,Z)) 0.00/0.02 __(nil,X) -> X 0.00/0.02 __(X,nil) -> X 0.00/0.02 isList(__(V1,V2)) -> U21(isList(V1),V2) 0.00/0.02 isList(nil) -> tt 0.00/0.02 isList(V) -> U11(isNeList(V)) 0.00/0.02 isNeList(__(V1,V2)) -> U41(isList(V1),V2) 0.00/0.02 isNeList(__(V1,V2)) -> U51(isNeList(V1),V2) 0.00/0.02 isNeList(V) -> U31(isQid(V)) 0.00/0.02 isNePal(__(I,__(P,I))) -> U71(isQid(I),P) 0.00/0.02 isNePal(V) -> U61(isQid(V)) 0.00/0.02 isPal(nil) -> tt 0.00/0.02 isPal(V) -> U81(isNePal(V)) 0.00/0.02 isQid(a) -> tt 0.00/0.02 isQid(e) -> tt 0.00/0.02 isQid(i) -> tt 0.00/0.02 isQid(o) -> tt 0.00/0.02 isQid(u) -> tt 0.00/0.02 -> Unhiding rules: 0.00/0.02 Empty 0.00/0.02 ->Projection: 0.00/0.02 pi(__#) = 1 0.00/0.02 0.00/0.02 Problem 1.1: 0.00/0.02 0.00/0.02 Basic Processor: 0.00/0.02 -> Pairs: 0.00/0.02 Empty 0.00/0.02 -> Rules: 0.00/0.02 U11(tt) -> tt 0.00/0.02 U21(tt,V2) -> U22(isList(V2)) 0.00/0.02 U22(tt) -> tt 0.00/0.02 U31(tt) -> tt 0.00/0.02 U41(tt,V2) -> U42(isNeList(V2)) 0.00/0.02 U42(tt) -> tt 0.00/0.02 U51(tt,V2) -> U52(isList(V2)) 0.00/0.02 U52(tt) -> tt 0.00/0.02 U61(tt) -> tt 0.00/0.02 U71(tt,P) -> U72(isPal(P)) 0.00/0.02 U72(tt) -> tt 0.00/0.02 U81(tt) -> tt 0.00/0.02 __(__(X,Y),Z) -> __(X,__(Y,Z)) 0.00/0.02 __(nil,X) -> X 0.00/0.02 __(X,nil) -> X 0.00/0.02 isList(__(V1,V2)) -> U21(isList(V1),V2) 0.00/0.02 isList(nil) -> tt 0.00/0.02 isList(V) -> U11(isNeList(V)) 0.00/0.02 isNeList(__(V1,V2)) -> U41(isList(V1),V2) 0.00/0.02 isNeList(__(V1,V2)) -> U51(isNeList(V1),V2) 0.00/0.02 isNeList(V) -> U31(isQid(V)) 0.00/0.02 isNePal(__(I,__(P,I))) -> U71(isQid(I),P) 0.00/0.02 isNePal(V) -> U61(isQid(V)) 0.00/0.02 isPal(nil) -> tt 0.00/0.02 isPal(V) -> U81(isNePal(V)) 0.00/0.02 isQid(a) -> tt 0.00/0.02 isQid(e) -> tt 0.00/0.02 isQid(i) -> tt 0.00/0.02 isQid(o) -> tt 0.00/0.02 isQid(u) -> tt 0.00/0.02 -> Unhiding rules: 0.00/0.02 Empty 0.00/0.02 -> Result: 0.00/0.02 Set P is empty 0.00/0.02 0.00/0.02 The problem is finite. 0.00/0.02 0.00/0.02 Problem 1.2: 0.00/0.02 0.00/0.02 SubNColl Processor: 0.00/0.02 -> Pairs: 0.00/0.02 U71#(tt,P) -> ISPAL(P) 0.00/0.02 ISNEPAL(__(I,__(P,I))) -> U71#(isQid(I),P) 0.00/0.02 ISPAL(V) -> ISNEPAL(V) 0.00/0.02 -> Rules: 0.00/0.02 U11(tt) -> tt 0.00/0.02 U21(tt,V2) -> U22(isList(V2)) 0.00/0.02 U22(tt) -> tt 0.00/0.02 U31(tt) -> tt 0.00/0.02 U41(tt,V2) -> U42(isNeList(V2)) 0.00/0.02 U42(tt) -> tt 0.00/0.02 U51(tt,V2) -> U52(isList(V2)) 0.00/0.02 U52(tt) -> tt 0.00/0.02 U61(tt) -> tt 0.00/0.02 U71(tt,P) -> U72(isPal(P)) 0.00/0.02 U72(tt) -> tt 0.00/0.02 U81(tt) -> tt 0.00/0.02 __(__(X,Y),Z) -> __(X,__(Y,Z)) 0.00/0.02 __(nil,X) -> X 0.00/0.02 __(X,nil) -> X 0.00/0.02 isList(__(V1,V2)) -> U21(isList(V1),V2) 0.00/0.02 isList(nil) -> tt 0.00/0.02 isList(V) -> U11(isNeList(V)) 0.00/0.02 isNeList(__(V1,V2)) -> U41(isList(V1),V2) 0.00/0.02 isNeList(__(V1,V2)) -> U51(isNeList(V1),V2) 0.00/0.02 isNeList(V) -> U31(isQid(V)) 0.00/0.02 isNePal(__(I,__(P,I))) -> U71(isQid(I),P) 0.00/0.02 isNePal(V) -> U61(isQid(V)) 0.00/0.02 isPal(nil) -> tt 0.00/0.02 isPal(V) -> U81(isNePal(V)) 0.00/0.02 isQid(a) -> tt 0.00/0.02 isQid(e) -> tt 0.00/0.02 isQid(i) -> tt 0.00/0.02 isQid(o) -> tt 0.00/0.02 isQid(u) -> tt 0.00/0.02 -> Unhiding rules: 0.00/0.02 Empty 0.00/0.02 ->Projection: 0.00/0.02 pi(U71#) = 2 0.00/0.02 pi(ISNEPAL) = 1 0.00/0.02 pi(ISPAL) = 1 0.00/0.02 0.00/0.02 Problem 1.2: 0.00/0.02 0.00/0.02 SCC Processor: 0.00/0.02 -> Pairs: 0.00/0.02 U71#(tt,P) -> ISPAL(P) 0.00/0.02 ISPAL(V) -> ISNEPAL(V) 0.00/0.02 -> Rules: 0.00/0.02 U11(tt) -> tt 0.00/0.02 U21(tt,V2) -> U22(isList(V2)) 0.00/0.02 U22(tt) -> tt 0.00/0.02 U31(tt) -> tt 0.00/0.02 U41(tt,V2) -> U42(isNeList(V2)) 0.00/0.02 U42(tt) -> tt 0.00/0.02 U51(tt,V2) -> U52(isList(V2)) 0.00/0.02 U52(tt) -> tt 0.00/0.02 U61(tt) -> tt 0.00/0.02 U71(tt,P) -> U72(isPal(P)) 0.00/0.02 U72(tt) -> tt 0.00/0.02 U81(tt) -> tt 0.00/0.02 __(__(X,Y),Z) -> __(X,__(Y,Z)) 0.00/0.02 __(nil,X) -> X 0.00/0.02 __(X,nil) -> X 0.00/0.02 isList(__(V1,V2)) -> U21(isList(V1),V2) 0.00/0.02 isList(nil) -> tt 0.00/0.02 isList(V) -> U11(isNeList(V)) 0.00/0.02 isNeList(__(V1,V2)) -> U41(isList(V1),V2) 0.00/0.02 isNeList(__(V1,V2)) -> U51(isNeList(V1),V2) 0.00/0.02 isNeList(V) -> U31(isQid(V)) 0.00/0.02 isNePal(__(I,__(P,I))) -> U71(isQid(I),P) 0.00/0.02 isNePal(V) -> U61(isQid(V)) 0.00/0.02 isPal(nil) -> tt 0.00/0.02 isPal(V) -> U81(isNePal(V)) 0.00/0.02 isQid(a) -> tt 0.00/0.02 isQid(e) -> tt 0.00/0.02 isQid(i) -> tt 0.00/0.02 isQid(o) -> tt 0.00/0.02 isQid(u) -> tt 0.00/0.02 -> Unhiding rules: 0.00/0.02 Empty 0.00/0.02 ->Strongly Connected Components: 0.00/0.02 There is no strongly connected component 0.00/0.02 0.00/0.02 The problem is finite. 0.00/0.02 0.00/0.02 Problem 1.3: 0.00/0.02 0.00/0.02 SubNColl Processor: 0.00/0.02 -> Pairs: 0.00/0.02 U21#(tt,V2) -> ISLIST(V2) 0.00/0.02 U41#(tt,V2) -> ISNELIST(V2) 0.00/0.02 U51#(tt,V2) -> ISLIST(V2) 0.00/0.02 ISLIST(__(V1,V2)) -> U21#(isList(V1),V2) 0.00/0.02 ISLIST(__(V1,V2)) -> ISLIST(V1) 0.00/0.02 ISLIST(V) -> ISNELIST(V) 0.00/0.02 ISNELIST(__(V1,V2)) -> U41#(isList(V1),V2) 0.00/0.02 ISNELIST(__(V1,V2)) -> U51#(isNeList(V1),V2) 0.00/0.02 ISNELIST(__(V1,V2)) -> ISLIST(V1) 0.00/0.02 ISNELIST(__(V1,V2)) -> ISNELIST(V1) 0.00/0.02 -> Rules: 0.00/0.02 U11(tt) -> tt 0.00/0.02 U21(tt,V2) -> U22(isList(V2)) 0.00/0.02 U22(tt) -> tt 0.00/0.02 U31(tt) -> tt 0.00/0.02 U41(tt,V2) -> U42(isNeList(V2)) 0.00/0.02 U42(tt) -> tt 0.00/0.02 U51(tt,V2) -> U52(isList(V2)) 0.00/0.02 U52(tt) -> tt 0.00/0.02 U61(tt) -> tt 0.00/0.02 U71(tt,P) -> U72(isPal(P)) 0.00/0.02 U72(tt) -> tt 0.00/0.02 U81(tt) -> tt 0.00/0.02 __(__(X,Y),Z) -> __(X,__(Y,Z)) 0.00/0.02 __(nil,X) -> X 0.00/0.02 __(X,nil) -> X 0.00/0.02 isList(__(V1,V2)) -> U21(isList(V1),V2) 0.00/0.02 isList(nil) -> tt 0.00/0.02 isList(V) -> U11(isNeList(V)) 0.00/0.02 isNeList(__(V1,V2)) -> U41(isList(V1),V2) 0.00/0.02 isNeList(__(V1,V2)) -> U51(isNeList(V1),V2) 0.00/0.02 isNeList(V) -> U31(isQid(V)) 0.00/0.02 isNePal(__(I,__(P,I))) -> U71(isQid(I),P) 0.00/0.02 isNePal(V) -> U61(isQid(V)) 0.00/0.02 isPal(nil) -> tt 0.00/0.02 isPal(V) -> U81(isNePal(V)) 0.00/0.02 isQid(a) -> tt 0.00/0.02 isQid(e) -> tt 0.00/0.02 isQid(i) -> tt 0.00/0.02 isQid(o) -> tt 0.00/0.02 isQid(u) -> tt 0.00/0.02 -> Unhiding rules: 0.00/0.02 Empty 0.00/0.02 ->Projection: 0.00/0.02 pi(U21#) = 2 0.00/0.02 pi(U41#) = 2 0.00/0.02 pi(U51#) = 2 0.00/0.02 pi(ISLIST) = 1 0.00/0.02 pi(ISNELIST) = 1 0.00/0.02 0.00/0.02 Problem 1.3: 0.00/0.02 0.00/0.02 SCC Processor: 0.00/0.02 -> Pairs: 0.00/0.02 U21#(tt,V2) -> ISLIST(V2) 0.00/0.02 U41#(tt,V2) -> ISNELIST(V2) 0.00/0.02 U51#(tt,V2) -> ISLIST(V2) 0.00/0.02 ISLIST(V) -> ISNELIST(V) 0.00/0.02 -> Rules: 0.00/0.02 U11(tt) -> tt 0.00/0.02 U21(tt,V2) -> U22(isList(V2)) 0.00/0.02 U22(tt) -> tt 0.00/0.02 U31(tt) -> tt 0.00/0.02 U41(tt,V2) -> U42(isNeList(V2)) 0.00/0.02 U42(tt) -> tt 0.00/0.02 U51(tt,V2) -> U52(isList(V2)) 0.00/0.02 U52(tt) -> tt 0.00/0.02 U61(tt) -> tt 0.00/0.02 U71(tt,P) -> U72(isPal(P)) 0.00/0.02 U72(tt) -> tt 0.00/0.02 U81(tt) -> tt 0.00/0.02 __(__(X,Y),Z) -> __(X,__(Y,Z)) 0.00/0.02 __(nil,X) -> X 0.00/0.02 __(X,nil) -> X 0.00/0.02 isList(__(V1,V2)) -> U21(isList(V1),V2) 0.00/0.02 isList(nil) -> tt 0.00/0.02 isList(V) -> U11(isNeList(V)) 0.00/0.02 isNeList(__(V1,V2)) -> U41(isList(V1),V2) 0.00/0.02 isNeList(__(V1,V2)) -> U51(isNeList(V1),V2) 0.00/0.02 isNeList(V) -> U31(isQid(V)) 0.00/0.02 isNePal(__(I,__(P,I))) -> U71(isQid(I),P) 0.00/0.02 isNePal(V) -> U61(isQid(V)) 0.00/0.02 isPal(nil) -> tt 0.00/0.02 isPal(V) -> U81(isNePal(V)) 0.00/0.02 isQid(a) -> tt 0.00/0.02 isQid(e) -> tt 0.00/0.02 isQid(i) -> tt 0.00/0.02 isQid(o) -> tt 0.00/0.02 isQid(u) -> tt 0.00/0.02 -> Unhiding rules: 0.00/0.02 Empty 0.00/0.02 ->Strongly Connected Components: 0.00/0.02 There is no strongly connected component 0.00/0.02 0.00/0.02 The problem is finite. 0.00/0.02 EOF