0.00/0.02 YES 0.00/0.02 0.00/0.02 Problem 1: 0.00/0.02 0.00/0.02 (VAR N X XS Y YS ZS) 0.00/0.02 (STRATEGY CONTEXTSENSITIVE 0.00/0.02 (U11 1) 0.00/0.02 (U12 1) 0.00/0.02 (U21 1) 0.00/0.02 (U22 1) 0.00/0.02 (U31 1) 0.00/0.02 (U32 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 (U62 1) 0.00/0.02 (U63 1) 0.00/0.02 (U64 1) 0.00/0.02 (U71 1) 0.00/0.02 (U72 1) 0.00/0.02 (U81 1) 0.00/0.02 (U82 1) 0.00/0.02 (afterNth 1 2) 0.00/0.02 (fst 1) 0.00/0.02 (head 1) 0.00/0.02 (natsFrom 1) 0.00/0.02 (sel 1 2) 0.00/0.02 (snd 1) 0.00/0.02 (splitAt 1 2) 0.00/0.02 (tail 1) 0.00/0.02 (take 1 2) 0.00/0.02 (0) 0.00/0.02 (cons 1) 0.00/0.02 (nil) 0.00/0.02 (pair 1 2) 0.00/0.02 (s 1) 0.00/0.02 (tt) 0.00/0.02 ) 0.00/0.02 (RULES 0.00/0.02 U11(tt,N,XS) -> U12(tt,N,XS) 0.00/0.02 U12(tt,N,XS) -> snd(splitAt(N,XS)) 0.00/0.02 U21(tt,X) -> U22(tt,X) 0.00/0.02 U22(tt,X) -> X 0.00/0.02 U31(tt,N) -> U32(tt,N) 0.00/0.02 U32(tt,N) -> N 0.00/0.02 U41(tt,N,XS) -> U42(tt,N,XS) 0.00/0.02 U42(tt,N,XS) -> head(afterNth(N,XS)) 0.00/0.02 U51(tt,Y) -> U52(tt,Y) 0.00/0.02 U52(tt,Y) -> Y 0.00/0.02 U61(tt,N,X,XS) -> U62(tt,N,X,XS) 0.00/0.02 U62(tt,N,X,XS) -> U63(tt,N,X,XS) 0.00/0.02 U63(tt,N,X,XS) -> U64(splitAt(N,XS),X) 0.00/0.02 U64(pair(YS,ZS),X) -> pair(cons(X,YS),ZS) 0.00/0.02 U71(tt,XS) -> U72(tt,XS) 0.00/0.02 U72(tt,XS) -> XS 0.00/0.02 U81(tt,N,XS) -> U82(tt,N,XS) 0.00/0.02 U82(tt,N,XS) -> fst(splitAt(N,XS)) 0.00/0.02 afterNth(N,XS) -> U11(tt,N,XS) 0.00/0.02 fst(pair(X,Y)) -> U21(tt,X) 0.00/0.02 head(cons(N,XS)) -> U31(tt,N) 0.00/0.02 natsFrom(N) -> cons(N,natsFrom(s(N))) 0.00/0.02 sel(N,XS) -> U41(tt,N,XS) 0.00/0.02 snd(pair(X,Y)) -> U51(tt,Y) 0.00/0.02 splitAt(0,XS) -> pair(nil,XS) 0.00/0.02 splitAt(s(N),cons(X,XS)) -> U61(tt,N,X,XS) 0.00/0.02 tail(cons(N,XS)) -> U71(tt,XS) 0.00/0.02 take(N,XS) -> U81(tt,N,XS) 0.00/0.02 ) 0.00/0.02 0.00/0.02 Problem 1: 0.00/0.02 0.00/0.02 Innermost Equivalent Processor: 0.00/0.02 -> Rules: 0.00/0.02 U11(tt,N,XS) -> U12(tt,N,XS) 0.00/0.02 U12(tt,N,XS) -> snd(splitAt(N,XS)) 0.00/0.02 U21(tt,X) -> U22(tt,X) 0.00/0.02 U22(tt,X) -> X 0.00/0.02 U31(tt,N) -> U32(tt,N) 0.00/0.02 U32(tt,N) -> N 0.00/0.02 U41(tt,N,XS) -> U42(tt,N,XS) 0.00/0.02 U42(tt,N,XS) -> head(afterNth(N,XS)) 0.00/0.02 U51(tt,Y) -> U52(tt,Y) 0.00/0.02 U52(tt,Y) -> Y 0.00/0.02 U61(tt,N,X,XS) -> U62(tt,N,X,XS) 0.00/0.02 U62(tt,N,X,XS) -> U63(tt,N,X,XS) 0.00/0.02 U63(tt,N,X,XS) -> U64(splitAt(N,XS),X) 0.00/0.02 U64(pair(YS,ZS),X) -> pair(cons(X,YS),ZS) 0.00/0.02 U71(tt,XS) -> U72(tt,XS) 0.00/0.02 U72(tt,XS) -> XS 0.00/0.02 U81(tt,N,XS) -> U82(tt,N,XS) 0.00/0.02 U82(tt,N,XS) -> fst(splitAt(N,XS)) 0.00/0.02 afterNth(N,XS) -> U11(tt,N,XS) 0.00/0.02 fst(pair(X,Y)) -> U21(tt,X) 0.00/0.02 head(cons(N,XS)) -> U31(tt,N) 0.00/0.02 natsFrom(N) -> cons(N,natsFrom(s(N))) 0.00/0.02 sel(N,XS) -> U41(tt,N,XS) 0.00/0.02 snd(pair(X,Y)) -> U51(tt,Y) 0.00/0.02 splitAt(0,XS) -> pair(nil,XS) 0.00/0.02 splitAt(s(N),cons(X,XS)) -> U61(tt,N,X,XS) 0.00/0.02 tail(cons(N,XS)) -> U71(tt,XS) 0.00/0.02 take(N,XS) -> U81(tt,N,XS) 0.00/0.02 -> The context-sensitive term rewriting system is an orthogonal system. Therefore, innermost cs-termination implies cs-termination. 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 U11#(tt,N,XS) -> U12#(tt,N,XS) 0.00/0.02 U12#(tt,N,XS) -> SND(splitAt(N,XS)) 0.00/0.02 U12#(tt,N,XS) -> SPLITAT(N,XS) 0.00/0.02 U12#(tt,N,XS) -> N 0.00/0.02 U12#(tt,N,XS) -> XS 0.00/0.02 U21#(tt,X) -> U22#(tt,X) 0.00/0.02 U22#(tt,X) -> X 0.00/0.02 U31#(tt,N) -> U32#(tt,N) 0.00/0.02 U32#(tt,N) -> N 0.00/0.02 U41#(tt,N,XS) -> U42#(tt,N,XS) 0.00/0.02 U42#(tt,N,XS) -> AFTERNTH(N,XS) 0.00/0.02 U42#(tt,N,XS) -> HEAD(afterNth(N,XS)) 0.00/0.02 U42#(tt,N,XS) -> N 0.00/0.02 U42#(tt,N,XS) -> XS 0.00/0.02 U51#(tt,Y) -> U52#(tt,Y) 0.00/0.02 U52#(tt,Y) -> Y 0.00/0.02 U61#(tt,N,X,XS) -> U62#(tt,N,X,XS) 0.00/0.02 U62#(tt,N,X,XS) -> U63#(tt,N,X,XS) 0.00/0.02 U63#(tt,N,X,XS) -> U64#(splitAt(N,XS),X) 0.00/0.02 U63#(tt,N,X,XS) -> SPLITAT(N,XS) 0.00/0.02 U63#(tt,N,X,XS) -> N 0.00/0.02 U63#(tt,N,X,XS) -> XS 0.00/0.02 U64#(pair(YS,ZS),X) -> X 0.00/0.02 U71#(tt,XS) -> U72#(tt,XS) 0.00/0.02 U72#(tt,XS) -> XS 0.00/0.02 U81#(tt,N,XS) -> U82#(tt,N,XS) 0.00/0.02 U82#(tt,N,XS) -> FST(splitAt(N,XS)) 0.00/0.02 U82#(tt,N,XS) -> SPLITAT(N,XS) 0.00/0.02 U82#(tt,N,XS) -> N 0.00/0.02 U82#(tt,N,XS) -> XS 0.00/0.02 AFTERNTH(N,XS) -> U11#(tt,N,XS) 0.00/0.02 FST(pair(X,Y)) -> U21#(tt,X) 0.00/0.02 HEAD(cons(N,XS)) -> U31#(tt,N) 0.00/0.02 SEL(N,XS) -> U41#(tt,N,XS) 0.00/0.02 SND(pair(X,Y)) -> U51#(tt,Y) 0.00/0.02 SPLITAT(s(N),cons(X,XS)) -> U61#(tt,N,X,XS) 0.00/0.02 TAIL(cons(N,XS)) -> U71#(tt,XS) 0.00/0.02 TAKE(N,XS) -> U81#(tt,N,XS) 0.00/0.02 -> Rules: 0.00/0.02 U11(tt,N,XS) -> U12(tt,N,XS) 0.00/0.02 U12(tt,N,XS) -> snd(splitAt(N,XS)) 0.00/0.02 U21(tt,X) -> U22(tt,X) 0.00/0.02 U22(tt,X) -> X 0.00/0.02 U31(tt,N) -> U32(tt,N) 0.00/0.02 U32(tt,N) -> N 0.00/0.02 U41(tt,N,XS) -> U42(tt,N,XS) 0.00/0.02 U42(tt,N,XS) -> head(afterNth(N,XS)) 0.00/0.02 U51(tt,Y) -> U52(tt,Y) 0.00/0.02 U52(tt,Y) -> Y 0.00/0.02 U61(tt,N,X,XS) -> U62(tt,N,X,XS) 0.00/0.02 U62(tt,N,X,XS) -> U63(tt,N,X,XS) 0.00/0.02 U63(tt,N,X,XS) -> U64(splitAt(N,XS),X) 0.00/0.02 U64(pair(YS,ZS),X) -> pair(cons(X,YS),ZS) 0.00/0.02 U71(tt,XS) -> U72(tt,XS) 0.00/0.02 U72(tt,XS) -> XS 0.00/0.02 U81(tt,N,XS) -> U82(tt,N,XS) 0.00/0.02 U82(tt,N,XS) -> fst(splitAt(N,XS)) 0.00/0.02 afterNth(N,XS) -> U11(tt,N,XS) 0.00/0.02 fst(pair(X,Y)) -> U21(tt,X) 0.00/0.02 head(cons(N,XS)) -> U31(tt,N) 0.00/0.02 natsFrom(N) -> cons(N,natsFrom(s(N))) 0.00/0.02 sel(N,XS) -> U41(tt,N,XS) 0.00/0.02 snd(pair(X,Y)) -> U51(tt,Y) 0.00/0.02 splitAt(0,XS) -> pair(nil,XS) 0.00/0.02 splitAt(s(N),cons(X,XS)) -> U61(tt,N,X,XS) 0.00/0.02 tail(cons(N,XS)) -> U71(tt,XS) 0.00/0.02 take(N,XS) -> U81(tt,N,XS) 0.00/0.02 -> Unhiding Rules: 0.00/0.02 natsFrom(s(N)) -> NATSFROM(s(N)) 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 U11#(tt,N,XS) -> U12#(tt,N,XS) 0.00/0.02 U12#(tt,N,XS) -> SND(splitAt(N,XS)) 0.00/0.02 U12#(tt,N,XS) -> SPLITAT(N,XS) 0.00/0.02 U12#(tt,N,XS) -> N 0.00/0.02 U12#(tt,N,XS) -> XS 0.00/0.02 U21#(tt,X) -> U22#(tt,X) 0.00/0.02 U22#(tt,X) -> X 0.00/0.02 U31#(tt,N) -> U32#(tt,N) 0.00/0.02 U32#(tt,N) -> N 0.00/0.02 U41#(tt,N,XS) -> U42#(tt,N,XS) 0.00/0.02 U42#(tt,N,XS) -> AFTERNTH(N,XS) 0.00/0.02 U42#(tt,N,XS) -> HEAD(afterNth(N,XS)) 0.00/0.02 U42#(tt,N,XS) -> N 0.00/0.02 U42#(tt,N,XS) -> XS 0.00/0.02 U51#(tt,Y) -> U52#(tt,Y) 0.00/0.02 U52#(tt,Y) -> Y 0.00/0.02 U61#(tt,N,X,XS) -> U62#(tt,N,X,XS) 0.00/0.02 U62#(tt,N,X,XS) -> U63#(tt,N,X,XS) 0.00/0.02 U63#(tt,N,X,XS) -> U64#(splitAt(N,XS),X) 0.00/0.02 U63#(tt,N,X,XS) -> SPLITAT(N,XS) 0.00/0.02 U63#(tt,N,X,XS) -> N 0.00/0.02 U63#(tt,N,X,XS) -> XS 0.00/0.02 U64#(pair(YS,ZS),X) -> X 0.00/0.02 U71#(tt,XS) -> U72#(tt,XS) 0.00/0.02 U72#(tt,XS) -> XS 0.00/0.02 U81#(tt,N,XS) -> U82#(tt,N,XS) 0.00/0.02 U82#(tt,N,XS) -> FST(splitAt(N,XS)) 0.00/0.02 U82#(tt,N,XS) -> SPLITAT(N,XS) 0.00/0.02 U82#(tt,N,XS) -> N 0.00/0.02 U82#(tt,N,XS) -> XS 0.00/0.02 AFTERNTH(N,XS) -> U11#(tt,N,XS) 0.00/0.02 FST(pair(X,Y)) -> U21#(tt,X) 0.00/0.02 HEAD(cons(N,XS)) -> U31#(tt,N) 0.00/0.02 SEL(N,XS) -> U41#(tt,N,XS) 0.00/0.02 SND(pair(X,Y)) -> U51#(tt,Y) 0.00/0.02 SPLITAT(s(N),cons(X,XS)) -> U61#(tt,N,X,XS) 0.00/0.02 TAIL(cons(N,XS)) -> U71#(tt,XS) 0.00/0.02 TAKE(N,XS) -> U81#(tt,N,XS) 0.00/0.02 -> Rules: 0.00/0.02 U11(tt,N,XS) -> U12(tt,N,XS) 0.00/0.02 U12(tt,N,XS) -> snd(splitAt(N,XS)) 0.00/0.02 U21(tt,X) -> U22(tt,X) 0.00/0.02 U22(tt,X) -> X 0.00/0.02 U31(tt,N) -> U32(tt,N) 0.00/0.02 U32(tt,N) -> N 0.00/0.02 U41(tt,N,XS) -> U42(tt,N,XS) 0.00/0.02 U42(tt,N,XS) -> head(afterNth(N,XS)) 0.00/0.02 U51(tt,Y) -> U52(tt,Y) 0.00/0.02 U52(tt,Y) -> Y 0.00/0.02 U61(tt,N,X,XS) -> U62(tt,N,X,XS) 0.00/0.02 U62(tt,N,X,XS) -> U63(tt,N,X,XS) 0.00/0.02 U63(tt,N,X,XS) -> U64(splitAt(N,XS),X) 0.00/0.02 U64(pair(YS,ZS),X) -> pair(cons(X,YS),ZS) 0.00/0.02 U71(tt,XS) -> U72(tt,XS) 0.00/0.02 U72(tt,XS) -> XS 0.00/0.02 U81(tt,N,XS) -> U82(tt,N,XS) 0.00/0.02 U82(tt,N,XS) -> fst(splitAt(N,XS)) 0.00/0.02 afterNth(N,XS) -> U11(tt,N,XS) 0.00/0.02 fst(pair(X,Y)) -> U21(tt,X) 0.00/0.02 head(cons(N,XS)) -> U31(tt,N) 0.00/0.02 natsFrom(N) -> cons(N,natsFrom(s(N))) 0.00/0.02 sel(N,XS) -> U41(tt,N,XS) 0.00/0.02 snd(pair(X,Y)) -> U51(tt,Y) 0.00/0.02 splitAt(0,XS) -> pair(nil,XS) 0.00/0.02 splitAt(s(N),cons(X,XS)) -> U61(tt,N,X,XS) 0.00/0.02 tail(cons(N,XS)) -> U71(tt,XS) 0.00/0.02 take(N,XS) -> U81(tt,N,XS) 0.00/0.02 -> Unhiding rules: 0.00/0.02 natsFrom(s(N)) -> NATSFROM(s(N)) 0.00/0.02 ->Strongly Connected Components: 0.00/0.02 ->->Cycle: 0.00/0.02 ->->-> Pairs: 0.00/0.02 U61#(tt,N,X,XS) -> U62#(tt,N,X,XS) 0.00/0.02 U62#(tt,N,X,XS) -> U63#(tt,N,X,XS) 0.00/0.02 U63#(tt,N,X,XS) -> SPLITAT(N,XS) 0.00/0.02 SPLITAT(s(N),cons(X,XS)) -> U61#(tt,N,X,XS) 0.00/0.02 ->->-> Rules: 0.00/0.02 U11(tt,N,XS) -> U12(tt,N,XS) 0.00/0.02 U12(tt,N,XS) -> snd(splitAt(N,XS)) 0.00/0.02 U21(tt,X) -> U22(tt,X) 0.00/0.02 U22(tt,X) -> X 0.00/0.02 U31(tt,N) -> U32(tt,N) 0.00/0.02 U32(tt,N) -> N 0.00/0.02 U41(tt,N,XS) -> U42(tt,N,XS) 0.00/0.02 U42(tt,N,XS) -> head(afterNth(N,XS)) 0.00/0.02 U51(tt,Y) -> U52(tt,Y) 0.00/0.02 U52(tt,Y) -> Y 0.00/0.02 U61(tt,N,X,XS) -> U62(tt,N,X,XS) 0.00/0.02 U62(tt,N,X,XS) -> U63(tt,N,X,XS) 0.00/0.02 U63(tt,N,X,XS) -> U64(splitAt(N,XS),X) 0.00/0.02 U64(pair(YS,ZS),X) -> pair(cons(X,YS),ZS) 0.00/0.02 U71(tt,XS) -> U72(tt,XS) 0.00/0.02 U72(tt,XS) -> XS 0.00/0.02 U81(tt,N,XS) -> U82(tt,N,XS) 0.00/0.02 U82(tt,N,XS) -> fst(splitAt(N,XS)) 0.00/0.02 afterNth(N,XS) -> U11(tt,N,XS) 0.00/0.02 fst(pair(X,Y)) -> U21(tt,X) 0.00/0.02 head(cons(N,XS)) -> U31(tt,N) 0.00/0.02 natsFrom(N) -> cons(N,natsFrom(s(N))) 0.00/0.02 sel(N,XS) -> U41(tt,N,XS) 0.00/0.02 snd(pair(X,Y)) -> U51(tt,Y) 0.00/0.02 splitAt(0,XS) -> pair(nil,XS) 0.00/0.02 splitAt(s(N),cons(X,XS)) -> U61(tt,N,X,XS) 0.00/0.02 tail(cons(N,XS)) -> U71(tt,XS) 0.00/0.02 take(N,XS) -> U81(tt,N,XS) 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 SubNColl Processor: 0.00/0.02 -> Pairs: 0.00/0.02 U61#(tt,N,X,XS) -> U62#(tt,N,X,XS) 0.00/0.02 U62#(tt,N,X,XS) -> U63#(tt,N,X,XS) 0.00/0.02 U63#(tt,N,X,XS) -> SPLITAT(N,XS) 0.00/0.02 SPLITAT(s(N),cons(X,XS)) -> U61#(tt,N,X,XS) 0.00/0.02 -> Rules: 0.00/0.02 U11(tt,N,XS) -> U12(tt,N,XS) 0.00/0.02 U12(tt,N,XS) -> snd(splitAt(N,XS)) 0.00/0.02 U21(tt,X) -> U22(tt,X) 0.00/0.02 U22(tt,X) -> X 0.00/0.02 U31(tt,N) -> U32(tt,N) 0.00/0.02 U32(tt,N) -> N 0.00/0.02 U41(tt,N,XS) -> U42(tt,N,XS) 0.00/0.02 U42(tt,N,XS) -> head(afterNth(N,XS)) 0.00/0.02 U51(tt,Y) -> U52(tt,Y) 0.00/0.02 U52(tt,Y) -> Y 0.00/0.02 U61(tt,N,X,XS) -> U62(tt,N,X,XS) 0.00/0.02 U62(tt,N,X,XS) -> U63(tt,N,X,XS) 0.00/0.02 U63(tt,N,X,XS) -> U64(splitAt(N,XS),X) 0.00/0.02 U64(pair(YS,ZS),X) -> pair(cons(X,YS),ZS) 0.00/0.02 U71(tt,XS) -> U72(tt,XS) 0.00/0.02 U72(tt,XS) -> XS 0.00/0.02 U81(tt,N,XS) -> U82(tt,N,XS) 0.00/0.02 U82(tt,N,XS) -> fst(splitAt(N,XS)) 0.00/0.02 afterNth(N,XS) -> U11(tt,N,XS) 0.00/0.02 fst(pair(X,Y)) -> U21(tt,X) 0.00/0.02 head(cons(N,XS)) -> U31(tt,N) 0.00/0.02 natsFrom(N) -> cons(N,natsFrom(s(N))) 0.00/0.02 sel(N,XS) -> U41(tt,N,XS) 0.00/0.02 snd(pair(X,Y)) -> U51(tt,Y) 0.00/0.02 splitAt(0,XS) -> pair(nil,XS) 0.00/0.02 splitAt(s(N),cons(X,XS)) -> U61(tt,N,X,XS) 0.00/0.02 tail(cons(N,XS)) -> U71(tt,XS) 0.00/0.02 take(N,XS) -> U81(tt,N,XS) 0.00/0.02 -> Unhiding rules: 0.00/0.02 Empty 0.00/0.02 ->Projection: 0.00/0.02 pi(U61#) = 2 0.00/0.02 pi(U62#) = 2 0.00/0.02 pi(U63#) = 2 0.00/0.02 pi(SPLITAT) = 1 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 U61#(tt,N,X,XS) -> U62#(tt,N,X,XS) 0.00/0.02 U62#(tt,N,X,XS) -> U63#(tt,N,X,XS) 0.00/0.02 U63#(tt,N,X,XS) -> SPLITAT(N,XS) 0.00/0.02 -> Rules: 0.00/0.02 U11(tt,N,XS) -> U12(tt,N,XS) 0.00/0.02 U12(tt,N,XS) -> snd(splitAt(N,XS)) 0.00/0.02 U21(tt,X) -> U22(tt,X) 0.00/0.02 U22(tt,X) -> X 0.00/0.02 U31(tt,N) -> U32(tt,N) 0.00/0.02 U32(tt,N) -> N 0.00/0.02 U41(tt,N,XS) -> U42(tt,N,XS) 0.00/0.02 U42(tt,N,XS) -> head(afterNth(N,XS)) 0.00/0.02 U51(tt,Y) -> U52(tt,Y) 0.00/0.02 U52(tt,Y) -> Y 0.00/0.02 U61(tt,N,X,XS) -> U62(tt,N,X,XS) 0.00/0.02 U62(tt,N,X,XS) -> U63(tt,N,X,XS) 0.00/0.02 U63(tt,N,X,XS) -> U64(splitAt(N,XS),X) 0.00/0.02 U64(pair(YS,ZS),X) -> pair(cons(X,YS),ZS) 0.00/0.02 U71(tt,XS) -> U72(tt,XS) 0.00/0.02 U72(tt,XS) -> XS 0.00/0.02 U81(tt,N,XS) -> U82(tt,N,XS) 0.00/0.02 U82(tt,N,XS) -> fst(splitAt(N,XS)) 0.00/0.02 afterNth(N,XS) -> U11(tt,N,XS) 0.00/0.02 fst(pair(X,Y)) -> U21(tt,X) 0.00/0.02 head(cons(N,XS)) -> U31(tt,N) 0.00/0.02 natsFrom(N) -> cons(N,natsFrom(s(N))) 0.00/0.02 sel(N,XS) -> U41(tt,N,XS) 0.00/0.02 snd(pair(X,Y)) -> U51(tt,Y) 0.00/0.02 splitAt(0,XS) -> pair(nil,XS) 0.00/0.02 splitAt(s(N),cons(X,XS)) -> U61(tt,N,X,XS) 0.00/0.02 tail(cons(N,XS)) -> U71(tt,XS) 0.00/0.02 take(N,XS) -> U81(tt,N,XS) 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