0.00/0.05 YES 0.00/0.05 0.00/0.05 Problem 1: 0.00/0.05 0.00/0.05 (VAR I P V V1 V2 X Y Z) 0.00/0.05 (STRATEGY CONTEXTSENSITIVE 0.00/0.05 (__ 1 2) 0.00/0.05 (and 1) 0.00/0.05 (isList) 0.00/0.05 (isNeList) 0.00/0.05 (isNePal) 0.00/0.05 (isPal) 0.00/0.05 (isQid) 0.00/0.05 (a) 0.00/0.05 (e) 0.00/0.05 (i) 0.00/0.05 (nil) 0.00/0.05 (o) 0.00/0.05 (tt) 0.00/0.05 (u) 0.00/0.05 ) 0.00/0.05 (RULES 0.00/0.05 __(__(X,Y),Z) -> __(X,__(Y,Z)) 0.00/0.05 __(nil,X) -> X 0.00/0.05 __(X,nil) -> X 0.00/0.05 and(tt,X) -> X 0.00/0.05 isList(__(V1,V2)) -> and(isList(V1),isList(V2)) 0.00/0.05 isList(nil) -> tt 0.00/0.05 isList(V) -> isNeList(V) 0.00/0.05 isNeList(__(V1,V2)) -> and(isList(V1),isNeList(V2)) 0.00/0.05 isNeList(__(V1,V2)) -> and(isNeList(V1),isList(V2)) 0.00/0.05 isNeList(V) -> isQid(V) 0.00/0.05 isNePal(__(I,__(P,I))) -> and(isQid(I),isPal(P)) 0.00/0.05 isNePal(V) -> isQid(V) 0.00/0.05 isPal(nil) -> tt 0.00/0.05 isPal(V) -> isNePal(V) 0.00/0.05 isQid(a) -> tt 0.00/0.05 isQid(e) -> tt 0.00/0.05 isQid(i) -> tt 0.00/0.05 isQid(o) -> tt 0.00/0.05 isQid(u) -> tt 0.00/0.05 ) 0.00/0.05 0.00/0.05 Problem 1: 0.00/0.05 0.00/0.05 Dependency Pairs Processor: 0.00/0.05 -> Pairs: 0.00/0.05 __#(__(X,Y),Z) -> __#(X,__(Y,Z)) 0.00/0.05 __#(__(X,Y),Z) -> __#(Y,Z) 0.00/0.05 AND(tt,X) -> X 0.00/0.05 ISLIST(__(V1,V2)) -> AND(isList(V1),isList(V2)) 0.00/0.05 ISLIST(__(V1,V2)) -> ISLIST(V1) 0.00/0.05 ISLIST(V) -> ISNELIST(V) 0.00/0.05 ISNELIST(__(V1,V2)) -> AND(isList(V1),isNeList(V2)) 0.00/0.05 ISNELIST(__(V1,V2)) -> AND(isNeList(V1),isList(V2)) 0.00/0.05 ISNELIST(__(V1,V2)) -> ISLIST(V1) 0.00/0.05 ISNELIST(__(V1,V2)) -> ISNELIST(V1) 0.00/0.05 ISNELIST(V) -> ISQID(V) 0.00/0.05 ISNEPAL(__(I,__(P,I))) -> AND(isQid(I),isPal(P)) 0.00/0.05 ISNEPAL(__(I,__(P,I))) -> ISQID(I) 0.00/0.05 ISNEPAL(V) -> ISQID(V) 0.00/0.05 ISPAL(V) -> ISNEPAL(V) 0.00/0.05 -> Rules: 0.00/0.05 __(__(X,Y),Z) -> __(X,__(Y,Z)) 0.00/0.05 __(nil,X) -> X 0.00/0.05 __(X,nil) -> X 0.00/0.05 and(tt,X) -> X 0.00/0.05 isList(__(V1,V2)) -> and(isList(V1),isList(V2)) 0.00/0.05 isList(nil) -> tt 0.00/0.05 isList(V) -> isNeList(V) 0.00/0.05 isNeList(__(V1,V2)) -> and(isList(V1),isNeList(V2)) 0.00/0.05 isNeList(__(V1,V2)) -> and(isNeList(V1),isList(V2)) 0.00/0.05 isNeList(V) -> isQid(V) 0.00/0.05 isNePal(__(I,__(P,I))) -> and(isQid(I),isPal(P)) 0.00/0.05 isNePal(V) -> isQid(V) 0.00/0.05 isPal(nil) -> tt 0.00/0.05 isPal(V) -> isNePal(V) 0.00/0.05 isQid(a) -> tt 0.00/0.05 isQid(e) -> tt 0.00/0.05 isQid(i) -> tt 0.00/0.05 isQid(o) -> tt 0.00/0.05 isQid(u) -> tt 0.00/0.05 -> Unhiding Rules: 0.00/0.05 isList(V2) -> ISLIST(V2) 0.00/0.05 isNeList(V2) -> ISNELIST(V2) 0.00/0.05 isPal(P) -> ISPAL(P) 0.00/0.05 0.00/0.05 Problem 1: 0.00/0.05 0.00/0.05 SCC Processor: 0.00/0.05 -> Pairs: 0.00/0.05 __#(__(X,Y),Z) -> __#(X,__(Y,Z)) 0.00/0.05 __#(__(X,Y),Z) -> __#(Y,Z) 0.00/0.05 AND(tt,X) -> X 0.00/0.05 ISLIST(__(V1,V2)) -> AND(isList(V1),isList(V2)) 0.00/0.05 ISLIST(__(V1,V2)) -> ISLIST(V1) 0.00/0.05 ISLIST(V) -> ISNELIST(V) 0.00/0.05 ISNELIST(__(V1,V2)) -> AND(isList(V1),isNeList(V2)) 0.00/0.05 ISNELIST(__(V1,V2)) -> AND(isNeList(V1),isList(V2)) 0.00/0.05 ISNELIST(__(V1,V2)) -> ISLIST(V1) 0.00/0.05 ISNELIST(__(V1,V2)) -> ISNELIST(V1) 0.00/0.05 ISNELIST(V) -> ISQID(V) 0.00/0.05 ISNEPAL(__(I,__(P,I))) -> AND(isQid(I),isPal(P)) 0.00/0.05 ISNEPAL(__(I,__(P,I))) -> ISQID(I) 0.00/0.05 ISNEPAL(V) -> ISQID(V) 0.00/0.05 ISPAL(V) -> ISNEPAL(V) 0.00/0.05 -> Rules: 0.00/0.05 __(__(X,Y),Z) -> __(X,__(Y,Z)) 0.00/0.05 __(nil,X) -> X 0.00/0.05 __(X,nil) -> X 0.00/0.05 and(tt,X) -> X 0.00/0.05 isList(__(V1,V2)) -> and(isList(V1),isList(V2)) 0.00/0.05 isList(nil) -> tt 0.00/0.05 isList(V) -> isNeList(V) 0.00/0.05 isNeList(__(V1,V2)) -> and(isList(V1),isNeList(V2)) 0.00/0.05 isNeList(__(V1,V2)) -> and(isNeList(V1),isList(V2)) 0.00/0.05 isNeList(V) -> isQid(V) 0.00/0.05 isNePal(__(I,__(P,I))) -> and(isQid(I),isPal(P)) 0.00/0.05 isNePal(V) -> isQid(V) 0.00/0.05 isPal(nil) -> tt 0.00/0.05 isPal(V) -> isNePal(V) 0.00/0.05 isQid(a) -> tt 0.00/0.05 isQid(e) -> tt 0.00/0.05 isQid(i) -> tt 0.00/0.05 isQid(o) -> tt 0.00/0.05 isQid(u) -> tt 0.00/0.05 -> Unhiding rules: 0.00/0.05 isList(V2) -> ISLIST(V2) 0.00/0.05 isNeList(V2) -> ISNELIST(V2) 0.00/0.05 isPal(P) -> ISPAL(P) 0.00/0.05 ->Strongly Connected Components: 0.00/0.05 ->->Cycle: 0.00/0.05 ->->-> Pairs: 0.00/0.05 AND(tt,X) -> X 0.00/0.05 ISLIST(__(V1,V2)) -> AND(isList(V1),isList(V2)) 0.00/0.05 ISLIST(__(V1,V2)) -> ISLIST(V1) 0.00/0.05 ISLIST(V) -> ISNELIST(V) 0.00/0.05 ISNELIST(__(V1,V2)) -> AND(isList(V1),isNeList(V2)) 0.00/0.05 ISNELIST(__(V1,V2)) -> AND(isNeList(V1),isList(V2)) 0.00/0.05 ISNELIST(__(V1,V2)) -> ISLIST(V1) 0.00/0.05 ISNELIST(__(V1,V2)) -> ISNELIST(V1) 0.00/0.05 ISNEPAL(__(I,__(P,I))) -> AND(isQid(I),isPal(P)) 0.00/0.05 ISPAL(V) -> ISNEPAL(V) 0.00/0.05 ->->-> Rules: 0.00/0.05 __(__(X,Y),Z) -> __(X,__(Y,Z)) 0.00/0.05 __(nil,X) -> X 0.00/0.05 __(X,nil) -> X 0.00/0.05 and(tt,X) -> X 0.00/0.05 isList(__(V1,V2)) -> and(isList(V1),isList(V2)) 0.00/0.05 isList(nil) -> tt 0.00/0.05 isList(V) -> isNeList(V) 0.00/0.05 isNeList(__(V1,V2)) -> and(isList(V1),isNeList(V2)) 0.00/0.05 isNeList(__(V1,V2)) -> and(isNeList(V1),isList(V2)) 0.00/0.05 isNeList(V) -> isQid(V) 0.00/0.05 isNePal(__(I,__(P,I))) -> and(isQid(I),isPal(P)) 0.00/0.05 isNePal(V) -> isQid(V) 0.00/0.05 isPal(nil) -> tt 0.00/0.05 isPal(V) -> isNePal(V) 0.00/0.05 isQid(a) -> tt 0.00/0.05 isQid(e) -> tt 0.00/0.05 isQid(i) -> tt 0.00/0.05 isQid(o) -> tt 0.00/0.05 isQid(u) -> tt 0.00/0.05 ->->-> Unhiding rules: 0.00/0.05 isList(V2) -> ISLIST(V2) 0.00/0.05 isNeList(V2) -> ISNELIST(V2) 0.00/0.05 isPal(P) -> ISPAL(P) 0.00/0.05 ->->Cycle: 0.00/0.05 ->->-> Pairs: 0.00/0.05 __#(__(X,Y),Z) -> __#(X,__(Y,Z)) 0.00/0.05 __#(__(X,Y),Z) -> __#(Y,Z) 0.00/0.05 ->->-> Rules: 0.00/0.05 __(__(X,Y),Z) -> __(X,__(Y,Z)) 0.00/0.05 __(nil,X) -> X 0.00/0.05 __(X,nil) -> X 0.00/0.05 and(tt,X) -> X 0.00/0.05 isList(__(V1,V2)) -> and(isList(V1),isList(V2)) 0.00/0.05 isList(nil) -> tt 0.00/0.05 isList(V) -> isNeList(V) 0.00/0.05 isNeList(__(V1,V2)) -> and(isList(V1),isNeList(V2)) 0.00/0.05 isNeList(__(V1,V2)) -> and(isNeList(V1),isList(V2)) 0.00/0.05 isNeList(V) -> isQid(V) 0.00/0.05 isNePal(__(I,__(P,I))) -> and(isQid(I),isPal(P)) 0.00/0.05 isNePal(V) -> isQid(V) 0.00/0.05 isPal(nil) -> tt 0.00/0.05 isPal(V) -> isNePal(V) 0.00/0.05 isQid(a) -> tt 0.00/0.05 isQid(e) -> tt 0.00/0.05 isQid(i) -> tt 0.00/0.05 isQid(o) -> tt 0.00/0.05 isQid(u) -> tt 0.00/0.05 ->->-> Unhiding rules: 0.00/0.05 Empty 0.00/0.05 0.00/0.05 0.00/0.05 The problem is decomposed in 2 subproblems. 0.00/0.05 0.00/0.05 Problem 1.1: 0.00/0.05 0.00/0.05 Reduction Pairs Processor: 0.00/0.05 -> Pairs: 0.00/0.05 AND(tt,X) -> X 0.00/0.05 ISLIST(__(V1,V2)) -> AND(isList(V1),isList(V2)) 0.00/0.05 ISLIST(__(V1,V2)) -> ISLIST(V1) 0.00/0.05 ISLIST(V) -> ISNELIST(V) 0.00/0.05 ISNELIST(__(V1,V2)) -> AND(isList(V1),isNeList(V2)) 0.00/0.05 ISNELIST(__(V1,V2)) -> AND(isNeList(V1),isList(V2)) 0.00/0.05 ISNELIST(__(V1,V2)) -> ISLIST(V1) 0.00/0.05 ISNELIST(__(V1,V2)) -> ISNELIST(V1) 0.00/0.05 ISNEPAL(__(I,__(P,I))) -> AND(isQid(I),isPal(P)) 0.00/0.05 ISPAL(V) -> ISNEPAL(V) 0.00/0.05 -> Rules: 0.00/0.05 __(__(X,Y),Z) -> __(X,__(Y,Z)) 0.00/0.05 __(nil,X) -> X 0.00/0.05 __(X,nil) -> X 0.00/0.05 and(tt,X) -> X 0.00/0.05 isList(__(V1,V2)) -> and(isList(V1),isList(V2)) 0.00/0.05 isList(nil) -> tt 0.00/0.05 isList(V) -> isNeList(V) 0.00/0.05 isNeList(__(V1,V2)) -> and(isList(V1),isNeList(V2)) 0.00/0.05 isNeList(__(V1,V2)) -> and(isNeList(V1),isList(V2)) 0.00/0.05 isNeList(V) -> isQid(V) 0.00/0.05 isNePal(__(I,__(P,I))) -> and(isQid(I),isPal(P)) 0.00/0.05 isNePal(V) -> isQid(V) 0.00/0.05 isPal(nil) -> tt 0.00/0.05 isPal(V) -> isNePal(V) 0.00/0.05 isQid(a) -> tt 0.00/0.05 isQid(e) -> tt 0.00/0.05 isQid(i) -> tt 0.00/0.05 isQid(o) -> tt 0.00/0.05 isQid(u) -> tt 0.00/0.05 -> Unhiding rules: 0.00/0.05 isList(V2) -> ISLIST(V2) 0.00/0.05 isNeList(V2) -> ISNELIST(V2) 0.00/0.05 isPal(P) -> ISPAL(P) 0.00/0.05 -> Usable rules: 0.00/0.05 __(__(X,Y),Z) -> __(X,__(Y,Z)) 0.00/0.05 __(nil,X) -> X 0.00/0.05 __(X,nil) -> X 0.00/0.05 and(tt,X) -> X 0.00/0.05 isList(__(V1,V2)) -> and(isList(V1),isList(V2)) 0.00/0.05 isList(nil) -> tt 0.00/0.05 isList(V) -> isNeList(V) 0.00/0.05 isNeList(__(V1,V2)) -> and(isList(V1),isNeList(V2)) 0.00/0.05 isNeList(__(V1,V2)) -> and(isNeList(V1),isList(V2)) 0.00/0.05 isNeList(V) -> isQid(V) 0.00/0.05 isNePal(__(I,__(P,I))) -> and(isQid(I),isPal(P)) 0.00/0.05 isNePal(V) -> isQid(V) 0.00/0.05 isPal(nil) -> tt 0.00/0.05 isPal(V) -> isNePal(V) 0.00/0.05 isQid(a) -> tt 0.00/0.05 isQid(e) -> tt 0.00/0.05 isQid(i) -> tt 0.00/0.05 isQid(o) -> tt 0.00/0.05 isQid(u) -> tt 0.00/0.05 ->Interpretation type: 0.00/0.05 Linear 0.00/0.05 ->Coefficients: 0.00/0.05 Natural Numbers 0.00/0.05 ->Dimension: 0.00/0.05 1 0.00/0.05 ->Bound: 0.00/0.05 2 0.00/0.05 ->Interpretation: 0.00/0.05 0.00/0.05 [__](X1,X2) = 2.X1 + X2 + 2 0.00/0.05 [and](X1,X2) = X1 + X2 + 2 0.00/0.05 [isList](X) = 2.X + 2 0.00/0.05 [isNeList](X) = 2.X + 2 0.00/0.05 [isNePal](X) = 2.X + 2 0.00/0.05 [isPal](X) = 2.X + 2 0.00/0.05 [isQid](X) = 2.X + 2 0.00/0.05 [a] = 2 0.00/0.05 [e] = 2 0.00/0.05 [i] = 2 0.00/0.05 [nil] = 2 0.00/0.05 [o] = 2 0.00/0.05 [tt] = 0 0.00/0.05 [u] = 0 0.00/0.05 [AND](X1,X2) = X2 + 1 0.00/0.05 [ISLIST](X) = 2.X + 2 0.00/0.05 [ISNELIST](X) = 2.X + 2 0.00/0.05 [ISNEPAL](X) = 2.X + 2 0.00/0.05 [ISPAL](X) = 2.X + 2 0.00/0.05 0.00/0.05 Problem 1.1: 0.00/0.05 0.00/0.05 SCC Processor: 0.00/0.05 -> Pairs: 0.00/0.05 ISLIST(__(V1,V2)) -> AND(isList(V1),isList(V2)) 0.00/0.05 ISLIST(__(V1,V2)) -> ISLIST(V1) 0.00/0.05 ISLIST(V) -> ISNELIST(V) 0.00/0.05 ISNELIST(__(V1,V2)) -> AND(isList(V1),isNeList(V2)) 0.00/0.05 ISNELIST(__(V1,V2)) -> AND(isNeList(V1),isList(V2)) 0.00/0.05 ISNELIST(__(V1,V2)) -> ISLIST(V1) 0.00/0.05 ISNELIST(__(V1,V2)) -> ISNELIST(V1) 0.00/0.05 ISNEPAL(__(I,__(P,I))) -> AND(isQid(I),isPal(P)) 0.00/0.05 ISPAL(V) -> ISNEPAL(V) 0.00/0.05 -> Rules: 0.00/0.05 __(__(X,Y),Z) -> __(X,__(Y,Z)) 0.00/0.05 __(nil,X) -> X 0.00/0.05 __(X,nil) -> X 0.00/0.05 and(tt,X) -> X 0.00/0.05 isList(__(V1,V2)) -> and(isList(V1),isList(V2)) 0.00/0.05 isList(nil) -> tt 0.00/0.05 isList(V) -> isNeList(V) 0.00/0.05 isNeList(__(V1,V2)) -> and(isList(V1),isNeList(V2)) 0.00/0.05 isNeList(__(V1,V2)) -> and(isNeList(V1),isList(V2)) 0.00/0.05 isNeList(V) -> isQid(V) 0.00/0.05 isNePal(__(I,__(P,I))) -> and(isQid(I),isPal(P)) 0.00/0.05 isNePal(V) -> isQid(V) 0.00/0.05 isPal(nil) -> tt 0.00/0.05 isPal(V) -> isNePal(V) 0.00/0.05 isQid(a) -> tt 0.00/0.05 isQid(e) -> tt 0.00/0.05 isQid(i) -> tt 0.00/0.05 isQid(o) -> tt 0.00/0.05 isQid(u) -> tt 0.00/0.05 -> Unhiding rules: 0.00/0.05 isList(V2) -> ISLIST(V2) 0.00/0.05 isNeList(V2) -> ISNELIST(V2) 0.00/0.05 isPal(P) -> ISPAL(P) 0.00/0.05 ->Strongly Connected Components: 0.00/0.05 ->->Cycle: 0.00/0.05 ->->-> Pairs: 0.00/0.05 ISLIST(__(V1,V2)) -> ISLIST(V1) 0.00/0.05 ISLIST(V) -> ISNELIST(V) 0.00/0.05 ISNELIST(__(V1,V2)) -> ISLIST(V1) 0.00/0.05 ISNELIST(__(V1,V2)) -> ISNELIST(V1) 0.00/0.05 ->->-> Rules: 0.00/0.05 __(__(X,Y),Z) -> __(X,__(Y,Z)) 0.00/0.05 __(nil,X) -> X 0.00/0.05 __(X,nil) -> X 0.00/0.05 and(tt,X) -> X 0.00/0.05 isList(__(V1,V2)) -> and(isList(V1),isList(V2)) 0.00/0.05 isList(nil) -> tt 0.00/0.05 isList(V) -> isNeList(V) 0.00/0.05 isNeList(__(V1,V2)) -> and(isList(V1),isNeList(V2)) 0.00/0.05 isNeList(__(V1,V2)) -> and(isNeList(V1),isList(V2)) 0.00/0.06 isNeList(V) -> isQid(V) 0.00/0.06 isNePal(__(I,__(P,I))) -> and(isQid(I),isPal(P)) 0.00/0.06 isNePal(V) -> isQid(V) 0.00/0.06 isPal(nil) -> tt 0.00/0.06 isPal(V) -> isNePal(V) 0.00/0.06 isQid(a) -> tt 0.00/0.06 isQid(e) -> tt 0.00/0.06 isQid(i) -> tt 0.00/0.06 isQid(o) -> tt 0.00/0.06 isQid(u) -> tt 0.00/0.06 ->->-> Unhiding rules: 0.00/0.06 Empty 0.00/0.06 0.00/0.06 Problem 1.1: 0.00/0.06 0.00/0.06 SubNColl Processor: 0.00/0.06 -> Pairs: 0.00/0.06 ISLIST(__(V1,V2)) -> ISLIST(V1) 0.00/0.06 ISLIST(V) -> ISNELIST(V) 0.00/0.06 ISNELIST(__(V1,V2)) -> ISLIST(V1) 0.00/0.06 ISNELIST(__(V1,V2)) -> ISNELIST(V1) 0.00/0.06 -> Rules: 0.00/0.06 __(__(X,Y),Z) -> __(X,__(Y,Z)) 0.00/0.06 __(nil,X) -> X 0.00/0.06 __(X,nil) -> X 0.00/0.06 and(tt,X) -> X 0.00/0.06 isList(__(V1,V2)) -> and(isList(V1),isList(V2)) 0.00/0.06 isList(nil) -> tt 0.00/0.06 isList(V) -> isNeList(V) 0.00/0.06 isNeList(__(V1,V2)) -> and(isList(V1),isNeList(V2)) 0.00/0.06 isNeList(__(V1,V2)) -> and(isNeList(V1),isList(V2)) 0.00/0.06 isNeList(V) -> isQid(V) 0.00/0.06 isNePal(__(I,__(P,I))) -> and(isQid(I),isPal(P)) 0.00/0.06 isNePal(V) -> isQid(V) 0.00/0.06 isPal(nil) -> tt 0.00/0.06 isPal(V) -> isNePal(V) 0.00/0.06 isQid(a) -> tt 0.00/0.06 isQid(e) -> tt 0.00/0.06 isQid(i) -> tt 0.00/0.06 isQid(o) -> tt 0.00/0.06 isQid(u) -> tt 0.00/0.06 -> Unhiding rules: 0.00/0.06 Empty 0.00/0.06 ->Projection: 0.00/0.06 pi(ISLIST) = 1 0.00/0.06 pi(ISNELIST) = 1 0.00/0.06 0.00/0.06 Problem 1.1: 0.00/0.06 0.00/0.06 SCC Processor: 0.00/0.06 -> Pairs: 0.00/0.06 ISLIST(V) -> ISNELIST(V) 0.00/0.06 -> Rules: 0.00/0.06 __(__(X,Y),Z) -> __(X,__(Y,Z)) 0.00/0.06 __(nil,X) -> X 0.00/0.06 __(X,nil) -> X 0.00/0.06 and(tt,X) -> X 0.00/0.06 isList(__(V1,V2)) -> and(isList(V1),isList(V2)) 0.00/0.06 isList(nil) -> tt 0.00/0.06 isList(V) -> isNeList(V) 0.00/0.06 isNeList(__(V1,V2)) -> and(isList(V1),isNeList(V2)) 0.00/0.06 isNeList(__(V1,V2)) -> and(isNeList(V1),isList(V2)) 0.00/0.06 isNeList(V) -> isQid(V) 0.00/0.06 isNePal(__(I,__(P,I))) -> and(isQid(I),isPal(P)) 0.00/0.06 isNePal(V) -> isQid(V) 0.00/0.06 isPal(nil) -> tt 0.00/0.06 isPal(V) -> isNePal(V) 0.00/0.06 isQid(a) -> tt 0.00/0.06 isQid(e) -> tt 0.00/0.06 isQid(i) -> tt 0.00/0.06 isQid(o) -> tt 0.00/0.06 isQid(u) -> tt 0.00/0.06 -> Unhiding rules: 0.00/0.06 Empty 0.00/0.06 ->Strongly Connected Components: 0.00/0.06 There is no strongly connected component 0.00/0.06 0.00/0.06 The problem is finite. 0.00/0.06 0.00/0.06 Problem 1.2: 0.00/0.06 0.00/0.06 SubNColl Processor: 0.00/0.06 -> Pairs: 0.00/0.06 __#(__(X,Y),Z) -> __#(X,__(Y,Z)) 0.00/0.06 __#(__(X,Y),Z) -> __#(Y,Z) 0.00/0.06 -> Rules: 0.00/0.06 __(__(X,Y),Z) -> __(X,__(Y,Z)) 0.00/0.06 __(nil,X) -> X 0.00/0.06 __(X,nil) -> X 0.00/0.06 and(tt,X) -> X 0.00/0.06 isList(__(V1,V2)) -> and(isList(V1),isList(V2)) 0.00/0.06 isList(nil) -> tt 0.00/0.06 isList(V) -> isNeList(V) 0.00/0.06 isNeList(__(V1,V2)) -> and(isList(V1),isNeList(V2)) 0.00/0.06 isNeList(__(V1,V2)) -> and(isNeList(V1),isList(V2)) 0.00/0.06 isNeList(V) -> isQid(V) 0.00/0.06 isNePal(__(I,__(P,I))) -> and(isQid(I),isPal(P)) 0.00/0.06 isNePal(V) -> isQid(V) 0.00/0.06 isPal(nil) -> tt 0.00/0.06 isPal(V) -> isNePal(V) 0.00/0.06 isQid(a) -> tt 0.00/0.06 isQid(e) -> tt 0.00/0.06 isQid(i) -> tt 0.00/0.06 isQid(o) -> tt 0.00/0.06 isQid(u) -> tt 0.00/0.06 -> Unhiding rules: 0.00/0.06 Empty 0.00/0.06 ->Projection: 0.00/0.06 pi(__#) = 1 0.00/0.06 0.00/0.06 Problem 1.2: 0.00/0.06 0.00/0.06 Basic Processor: 0.00/0.06 -> Pairs: 0.00/0.06 Empty 0.00/0.06 -> Rules: 0.00/0.06 __(__(X,Y),Z) -> __(X,__(Y,Z)) 0.00/0.06 __(nil,X) -> X 0.00/0.06 __(X,nil) -> X 0.00/0.06 and(tt,X) -> X 0.00/0.06 isList(__(V1,V2)) -> and(isList(V1),isList(V2)) 0.00/0.06 isList(nil) -> tt 0.00/0.06 isList(V) -> isNeList(V) 0.00/0.06 isNeList(__(V1,V2)) -> and(isList(V1),isNeList(V2)) 0.00/0.06 isNeList(__(V1,V2)) -> and(isNeList(V1),isList(V2)) 0.00/0.06 isNeList(V) -> isQid(V) 0.00/0.06 isNePal(__(I,__(P,I))) -> and(isQid(I),isPal(P)) 0.00/0.06 isNePal(V) -> isQid(V) 0.00/0.06 isPal(nil) -> tt 0.00/0.06 isPal(V) -> isNePal(V) 0.00/0.06 isQid(a) -> tt 0.00/0.06 isQid(e) -> tt 0.00/0.06 isQid(i) -> tt 0.00/0.06 isQid(o) -> tt 0.00/0.06 isQid(u) -> tt 0.00/0.06 -> Unhiding rules: 0.00/0.06 Empty 0.00/0.06 -> Result: 0.00/0.06 Set P is empty 0.00/0.06 0.00/0.06 The problem is finite. 0.00/0.06 EOF