MAYBE Time: 0.222003 TRS: { cons(mark X1, X2) -> mark cons(X1, X2), cons(ok X1, ok X2) -> ok cons(X1, X2), natsFrom mark X -> mark natsFrom X, natsFrom ok X -> ok natsFrom X, s mark X -> mark s X, s ok X -> ok s X, active cons(X1, X2) -> cons(active X1, X2), active natsFrom N -> mark cons(N, natsFrom s N), active natsFrom X -> natsFrom active X, active s X -> s active X, active fst X -> fst active X, active fst pair(XS, YS) -> mark XS, active pair(X1, X2) -> pair(X1, active X2), active pair(X1, X2) -> pair(active X1, X2), active snd X -> snd active X, active snd pair(XS, YS) -> mark YS, active splitAt(X1, X2) -> splitAt(X1, active X2), active splitAt(X1, X2) -> splitAt(active X1, X2), active splitAt(s N, cons(X, XS)) -> mark u(splitAt(N, XS), N, X, XS), active splitAt(0(), XS) -> mark pair(nil(), XS), active u(X1, X2, X3, X4) -> u(active X1, X2, X3, X4), active u(pair(YS, ZS), N, X, XS) -> mark pair(cons(X, YS), ZS), active head X -> head active X, active head cons(N, XS) -> mark N, active tail X -> tail active X, active tail cons(N, XS) -> mark XS, active afterNth(N, XS) -> mark snd splitAt(N, XS), active afterNth(X1, X2) -> afterNth(X1, active X2), active afterNth(X1, X2) -> afterNth(active X1, X2), active sel(N, XS) -> mark head afterNth(N, XS), active sel(X1, X2) -> sel(X1, active X2), active sel(X1, X2) -> sel(active X1, X2), active take(N, XS) -> mark fst splitAt(N, XS), active take(X1, X2) -> take(X1, active X2), active take(X1, X2) -> take(active X1, X2), fst mark X -> mark fst X, fst ok X -> ok fst X, pair(X1, mark X2) -> mark pair(X1, X2), pair(mark X1, X2) -> mark pair(X1, X2), pair(ok X1, ok X2) -> ok pair(X1, X2), snd mark X -> mark snd X, snd ok X -> ok snd X, splitAt(X1, mark X2) -> mark splitAt(X1, X2), splitAt(mark X1, X2) -> mark splitAt(X1, X2), splitAt(ok X1, ok X2) -> ok splitAt(X1, X2), u(mark X1, X2, X3, X4) -> mark u(X1, X2, X3, X4), u(ok X1, ok X2, ok X3, ok X4) -> ok u(X1, X2, X3, X4), head mark X -> mark head X, head ok X -> ok head X, tail mark X -> mark tail X, tail ok X -> ok tail X, afterNth(X1, mark X2) -> mark afterNth(X1, X2), afterNth(mark X1, X2) -> mark afterNth(X1, X2), afterNth(ok X1, ok X2) -> ok afterNth(X1, X2), sel(X1, mark X2) -> mark sel(X1, X2), sel(mark X1, X2) -> mark sel(X1, X2), sel(ok X1, ok X2) -> ok sel(X1, X2), take(X1, mark X2) -> mark take(X1, X2), take(mark X1, X2) -> mark take(X1, X2), take(ok X1, ok X2) -> ok take(X1, X2), proper cons(X1, X2) -> cons(proper X1, proper X2), proper natsFrom X -> natsFrom proper X, proper s X -> s proper X, proper fst X -> fst proper X, proper pair(X1, X2) -> pair(proper X1, proper X2), proper snd X -> snd proper X, proper nil() -> ok nil(), proper splitAt(X1, X2) -> splitAt(proper X1, proper X2), proper 0() -> ok 0(), proper u(X1, X2, X3, X4) -> u(proper X1, proper X2, proper X3, proper X4), proper head X -> head proper X, proper tail X -> tail proper X, proper afterNth(X1, X2) -> afterNth(proper X1, proper X2), proper sel(X1, X2) -> sel(proper X1, proper X2), proper take(X1, X2) -> take(proper X1, proper X2), top mark X -> top proper X, top ok X -> top active X} DP: DP: { cons#(mark X1, X2) -> cons#(X1, X2), cons#(ok X1, ok X2) -> cons#(X1, X2), natsFrom# mark X -> natsFrom# X, natsFrom# ok X -> natsFrom# X, s# mark X -> s# X, s# ok X -> s# X, active# cons(X1, X2) -> cons#(active X1, X2), active# cons(X1, X2) -> active# X1, active# natsFrom N -> cons#(N, natsFrom s N), active# natsFrom N -> natsFrom# s N, active# natsFrom N -> s# N, active# natsFrom X -> natsFrom# active X, active# natsFrom X -> active# X, active# s X -> s# active X, active# s X -> active# X, active# fst X -> active# X, active# fst X -> fst# active X, active# pair(X1, X2) -> active# X1, active# pair(X1, X2) -> active# X2, active# pair(X1, X2) -> pair#(X1, active X2), active# pair(X1, X2) -> pair#(active X1, X2), active# snd X -> active# X, active# snd X -> snd# active X, active# splitAt(X1, X2) -> active# X1, active# splitAt(X1, X2) -> active# X2, active# splitAt(X1, X2) -> splitAt#(X1, active X2), active# splitAt(X1, X2) -> splitAt#(active X1, X2), active# splitAt(s N, cons(X, XS)) -> splitAt#(N, XS), active# splitAt(s N, cons(X, XS)) -> u#(splitAt(N, XS), N, X, XS), active# splitAt(0(), XS) -> pair#(nil(), XS), active# u(X1, X2, X3, X4) -> active# X1, active# u(X1, X2, X3, X4) -> u#(active X1, X2, X3, X4), active# u(pair(YS, ZS), N, X, XS) -> cons#(X, YS), active# u(pair(YS, ZS), N, X, XS) -> pair#(cons(X, YS), ZS), active# head X -> active# X, active# head X -> head# active X, active# tail X -> active# X, active# tail X -> tail# active X, active# afterNth(N, XS) -> snd# splitAt(N, XS), active# afterNth(N, XS) -> splitAt#(N, XS), active# afterNth(X1, X2) -> active# X1, active# afterNth(X1, X2) -> active# X2, active# afterNth(X1, X2) -> afterNth#(X1, active X2), active# afterNth(X1, X2) -> afterNth#(active X1, X2), active# sel(N, XS) -> head# afterNth(N, XS), active# sel(N, XS) -> afterNth#(N, XS), active# sel(X1, X2) -> active# X1, active# sel(X1, X2) -> active# X2, active# sel(X1, X2) -> sel#(X1, active X2), active# sel(X1, X2) -> sel#(active X1, X2), active# take(N, XS) -> fst# splitAt(N, XS), active# take(N, XS) -> splitAt#(N, XS), active# take(X1, X2) -> active# X1, active# take(X1, X2) -> active# X2, active# take(X1, X2) -> take#(X1, active X2), active# take(X1, X2) -> take#(active X1, X2), fst# mark X -> fst# X, fst# ok X -> fst# X, pair#(X1, mark X2) -> pair#(X1, X2), pair#(mark X1, X2) -> pair#(X1, X2), pair#(ok X1, ok X2) -> pair#(X1, X2), snd# mark X -> snd# X, snd# ok X -> snd# X, splitAt#(X1, mark X2) -> splitAt#(X1, X2), splitAt#(mark X1, X2) -> splitAt#(X1, X2), splitAt#(ok X1, ok X2) -> splitAt#(X1, X2), u#(mark X1, X2, X3, X4) -> u#(X1, X2, X3, X4), u#(ok X1, ok X2, ok X3, ok X4) -> u#(X1, X2, X3, X4), head# mark X -> head# X, head# ok X -> head# X, tail# mark X -> tail# X, tail# ok X -> tail# X, afterNth#(X1, mark X2) -> afterNth#(X1, X2), afterNth#(mark X1, X2) -> afterNth#(X1, X2), afterNth#(ok X1, ok X2) -> afterNth#(X1, X2), sel#(X1, mark X2) -> sel#(X1, X2), sel#(mark X1, X2) -> sel#(X1, X2), sel#(ok X1, ok X2) -> sel#(X1, X2), take#(X1, mark X2) -> take#(X1, X2), take#(mark X1, X2) -> take#(X1, X2), take#(ok X1, ok X2) -> take#(X1, X2), proper# cons(X1, X2) -> cons#(proper X1, proper X2), proper# cons(X1, X2) -> proper# X1, proper# cons(X1, X2) -> proper# X2, proper# natsFrom X -> natsFrom# proper X, proper# natsFrom X -> proper# X, proper# s X -> s# proper X, proper# s X -> proper# X, proper# fst X -> fst# proper X, proper# fst X -> proper# X, proper# pair(X1, X2) -> pair#(proper X1, proper X2), proper# pair(X1, X2) -> proper# X1, proper# pair(X1, X2) -> proper# X2, proper# snd X -> snd# proper X, proper# snd X -> proper# X, proper# splitAt(X1, X2) -> splitAt#(proper X1, proper X2), proper# splitAt(X1, X2) -> proper# X1, proper# splitAt(X1, X2) -> proper# X2, proper# u(X1, X2, X3, X4) -> u#(proper X1, proper X2, proper X3, proper X4), proper# u(X1, X2, X3, X4) -> proper# X1, proper# u(X1, X2, X3, X4) -> proper# X2, proper# u(X1, X2, X3, X4) -> proper# X3, proper# u(X1, X2, X3, X4) -> proper# X4, proper# head X -> head# proper X, proper# head X -> proper# X, proper# tail X -> tail# proper X, proper# tail X -> proper# X, proper# afterNth(X1, X2) -> afterNth#(proper X1, proper X2), proper# afterNth(X1, X2) -> proper# X1, proper# afterNth(X1, X2) -> proper# X2, proper# sel(X1, X2) -> sel#(proper X1, proper X2), proper# sel(X1, X2) -> proper# X1, proper# sel(X1, X2) -> proper# X2, proper# take(X1, X2) -> take#(proper X1, proper X2), proper# take(X1, X2) -> proper# X1, proper# take(X1, X2) -> proper# X2, top# mark X -> proper# X, top# mark X -> top# proper X, top# ok X -> active# X, top# ok X -> top# active X} TRS: { cons(mark X1, X2) -> mark cons(X1, X2), cons(ok X1, ok X2) -> ok cons(X1, X2), natsFrom mark X -> mark natsFrom X, natsFrom ok X -> ok natsFrom X, s mark X -> mark s X, s ok X -> ok s X, active cons(X1, X2) -> cons(active X1, X2), active natsFrom N -> mark cons(N, natsFrom s N), active natsFrom X -> natsFrom active X, active s X -> s active X, active fst X -> fst active X, active fst pair(XS, YS) -> mark XS, active pair(X1, X2) -> pair(X1, active X2), active pair(X1, X2) -> pair(active X1, X2), active snd X -> snd active X, active snd pair(XS, YS) -> mark YS, active splitAt(X1, X2) -> splitAt(X1, active X2), active splitAt(X1, X2) -> splitAt(active X1, X2), active splitAt(s N, cons(X, XS)) -> mark u(splitAt(N, XS), N, X, XS), active splitAt(0(), XS) -> mark pair(nil(), XS), active u(X1, X2, X3, X4) -> u(active X1, X2, X3, X4), active u(pair(YS, ZS), N, X, XS) -> mark pair(cons(X, YS), ZS), active head X -> head active X, active head cons(N, XS) -> mark N, active tail X -> tail active X, active tail cons(N, XS) -> mark XS, active afterNth(N, XS) -> mark snd splitAt(N, XS), active afterNth(X1, X2) -> afterNth(X1, active X2), active afterNth(X1, X2) -> afterNth(active X1, X2), active sel(N, XS) -> mark head afterNth(N, XS), active sel(X1, X2) -> sel(X1, active X2), active sel(X1, X2) -> sel(active X1, X2), active take(N, XS) -> mark fst splitAt(N, XS), active take(X1, X2) -> take(X1, active X2), active take(X1, X2) -> take(active X1, X2), fst mark X -> mark fst X, fst ok X -> ok fst X, pair(X1, mark X2) -> mark pair(X1, X2), pair(mark X1, X2) -> mark pair(X1, X2), pair(ok X1, ok X2) -> ok pair(X1, X2), snd mark X -> mark snd X, snd ok X -> ok snd X, splitAt(X1, mark X2) -> mark splitAt(X1, X2), splitAt(mark X1, X2) -> mark splitAt(X1, X2), splitAt(ok X1, ok X2) -> ok splitAt(X1, X2), u(mark X1, X2, X3, X4) -> mark u(X1, X2, X3, X4), u(ok X1, ok X2, ok X3, ok X4) -> ok u(X1, X2, X3, X4), head mark X -> mark head X, head ok X -> ok head X, tail mark X -> mark tail X, tail ok X -> ok tail X, afterNth(X1, mark X2) -> mark afterNth(X1, X2), afterNth(mark X1, X2) -> mark afterNth(X1, X2), afterNth(ok X1, ok X2) -> ok afterNth(X1, X2), sel(X1, mark X2) -> mark sel(X1, X2), sel(mark X1, X2) -> mark sel(X1, X2), sel(ok X1, ok X2) -> ok sel(X1, X2), take(X1, mark X2) -> mark take(X1, X2), take(mark X1, X2) -> mark take(X1, X2), take(ok X1, ok X2) -> ok take(X1, X2), proper cons(X1, X2) -> cons(proper X1, proper X2), proper natsFrom X -> natsFrom proper X, proper s X -> s proper X, proper fst X -> fst proper X, proper pair(X1, X2) -> pair(proper X1, proper X2), proper snd X -> snd proper X, proper nil() -> ok nil(), proper splitAt(X1, X2) -> splitAt(proper X1, proper X2), proper 0() -> ok 0(), proper u(X1, X2, X3, X4) -> u(proper X1, proper X2, proper X3, proper X4), proper head X -> head proper X, proper tail X -> tail proper X, proper afterNth(X1, X2) -> afterNth(proper X1, proper X2), proper sel(X1, X2) -> sel(proper X1, proper X2), proper take(X1, X2) -> take(proper X1, proper X2), top mark X -> top proper X, top ok X -> top active X} UR: { cons(mark X1, X2) -> mark cons(X1, X2), cons(ok X1, ok X2) -> ok cons(X1, X2), natsFrom mark X -> mark natsFrom X, natsFrom ok X -> ok natsFrom X, s mark X -> mark s X, s ok X -> ok s X, active cons(X1, X2) -> cons(active X1, X2), active natsFrom N -> mark cons(N, natsFrom s N), active natsFrom X -> natsFrom active X, active s X -> s active X, active fst X -> fst active X, active fst pair(XS, YS) -> mark XS, active pair(X1, X2) -> pair(X1, active X2), active pair(X1, X2) -> pair(active X1, X2), active snd X -> snd active X, active snd pair(XS, YS) -> mark YS, active splitAt(X1, X2) -> splitAt(X1, active X2), active splitAt(X1, X2) -> splitAt(active X1, X2), active splitAt(s N, cons(X, XS)) -> mark u(splitAt(N, XS), N, X, XS), active splitAt(0(), XS) -> mark pair(nil(), XS), active u(X1, X2, X3, X4) -> u(active X1, X2, X3, X4), active u(pair(YS, ZS), N, X, XS) -> mark pair(cons(X, YS), ZS), active head X -> head active X, active head cons(N, XS) -> mark N, active tail X -> tail active X, active tail cons(N, XS) -> mark XS, active afterNth(N, XS) -> mark snd splitAt(N, XS), active afterNth(X1, X2) -> afterNth(X1, active X2), active afterNth(X1, X2) -> afterNth(active X1, X2), active sel(N, XS) -> mark head afterNth(N, XS), active sel(X1, X2) -> sel(X1, active X2), active sel(X1, X2) -> sel(active X1, X2), active take(N, XS) -> mark fst splitAt(N, XS), active take(X1, X2) -> take(X1, active X2), active take(X1, X2) -> take(active X1, X2), fst mark X -> mark fst X, fst ok X -> ok fst X, pair(X1, mark X2) -> mark pair(X1, X2), pair(mark X1, X2) -> mark pair(X1, X2), pair(ok X1, ok X2) -> ok pair(X1, X2), snd mark X -> mark snd X, snd ok X -> ok snd X, splitAt(X1, mark X2) -> mark splitAt(X1, X2), splitAt(mark X1, X2) -> mark splitAt(X1, X2), splitAt(ok X1, ok X2) -> ok splitAt(X1, X2), u(mark X1, X2, X3, X4) -> mark u(X1, X2, X3, X4), u(ok X1, ok X2, ok X3, ok X4) -> ok u(X1, X2, X3, X4), head mark X -> mark head X, head ok X -> ok head X, tail mark X -> mark tail X, tail ok X -> ok tail X, afterNth(X1, mark X2) -> mark afterNth(X1, X2), afterNth(mark X1, X2) -> mark afterNth(X1, X2), afterNth(ok X1, ok X2) -> ok afterNth(X1, X2), sel(X1, mark X2) -> mark sel(X1, X2), sel(mark X1, X2) -> mark sel(X1, X2), sel(ok X1, ok X2) -> ok sel(X1, X2), take(X1, mark X2) -> mark take(X1, X2), take(mark X1, X2) -> mark take(X1, X2), take(ok X1, ok X2) -> ok take(X1, X2), proper cons(X1, X2) -> cons(proper X1, proper X2), proper natsFrom X -> natsFrom proper X, proper s X -> s proper X, proper fst X -> fst proper X, proper pair(X1, X2) -> pair(proper X1, proper X2), proper snd X -> snd proper X, proper nil() -> ok nil(), proper splitAt(X1, X2) -> splitAt(proper X1, proper X2), proper 0() -> ok 0(), proper u(X1, X2, X3, X4) -> u(proper X1, proper X2, proper X3, proper X4), proper head X -> head proper X, proper tail X -> tail proper X, proper afterNth(X1, X2) -> afterNth(proper X1, proper X2), proper sel(X1, X2) -> sel(proper X1, proper X2), proper take(X1, X2) -> take(proper X1, proper X2)} EDG: { (active# splitAt(0(), XS) -> pair#(nil(), XS), pair#(ok X1, ok X2) -> pair#(X1, X2)) (active# splitAt(0(), XS) -> pair#(nil(), XS), pair#(mark X1, X2) -> pair#(X1, X2)) (active# splitAt(0(), XS) -> pair#(nil(), XS), pair#(X1, mark X2) -> pair#(X1, X2)) (active# splitAt(X1, X2) -> active# X2, active# take(X1, X2) -> take#(active X1, X2)) (active# splitAt(X1, X2) -> active# X2, active# take(X1, X2) -> take#(X1, active X2)) (active# splitAt(X1, X2) -> active# X2, active# take(X1, X2) -> active# X2) (active# splitAt(X1, X2) -> active# X2, active# take(X1, X2) -> active# X1) (active# splitAt(X1, X2) -> active# X2, active# take(N, XS) -> splitAt#(N, XS)) (active# splitAt(X1, X2) -> active# X2, active# take(N, XS) -> fst# splitAt(N, XS)) (active# splitAt(X1, X2) -> active# X2, active# sel(X1, X2) -> sel#(active X1, X2)) (active# splitAt(X1, X2) -> active# X2, active# sel(X1, X2) -> sel#(X1, active X2)) (active# splitAt(X1, X2) -> active# X2, active# sel(X1, X2) -> active# X2) (active# splitAt(X1, X2) -> active# X2, active# sel(X1, X2) -> active# X1) (active# splitAt(X1, X2) -> active# X2, active# sel(N, XS) -> afterNth#(N, XS)) (active# splitAt(X1, X2) -> active# X2, active# sel(N, XS) -> head# afterNth(N, XS)) (active# splitAt(X1, X2) -> active# X2, active# afterNth(X1, X2) -> afterNth#(active X1, X2)) (active# splitAt(X1, X2) -> active# X2, active# afterNth(X1, X2) -> afterNth#(X1, active X2)) (active# splitAt(X1, X2) -> active# X2, active# afterNth(X1, X2) -> active# X2) (active# splitAt(X1, X2) -> active# X2, active# afterNth(X1, X2) -> active# X1) (active# splitAt(X1, X2) -> active# X2, active# afterNth(N, XS) -> splitAt#(N, XS)) (active# splitAt(X1, X2) -> active# X2, active# afterNth(N, XS) -> snd# splitAt(N, XS)) (active# splitAt(X1, X2) -> active# X2, active# tail X -> tail# active X) (active# splitAt(X1, X2) -> active# X2, active# tail X -> active# X) (active# splitAt(X1, X2) -> active# X2, active# head X -> head# active X) (active# splitAt(X1, X2) -> active# X2, active# head X -> active# X) (active# splitAt(X1, X2) -> active# X2, active# u(pair(YS, ZS), N, X, XS) -> pair#(cons(X, YS), ZS)) (active# splitAt(X1, X2) -> active# X2, active# u(pair(YS, ZS), N, X, XS) -> cons#(X, YS)) (active# splitAt(X1, X2) -> active# X2, active# u(X1, X2, X3, X4) -> u#(active X1, X2, X3, X4)) (active# splitAt(X1, X2) -> active# X2, active# u(X1, X2, X3, X4) -> active# X1) (active# splitAt(X1, X2) -> active# X2, active# splitAt(0(), XS) -> pair#(nil(), XS)) (active# splitAt(X1, X2) -> active# X2, active# splitAt(s N, cons(X, XS)) -> u#(splitAt(N, XS), N, X, XS)) (active# splitAt(X1, X2) -> active# X2, active# splitAt(s N, cons(X, XS)) -> splitAt#(N, XS)) (active# splitAt(X1, X2) -> active# X2, active# splitAt(X1, X2) -> splitAt#(active X1, X2)) (active# splitAt(X1, X2) -> active# X2, active# splitAt(X1, X2) -> splitAt#(X1, active X2)) (active# splitAt(X1, X2) -> active# X2, active# splitAt(X1, X2) -> active# X2) (active# splitAt(X1, X2) -> active# X2, active# splitAt(X1, X2) -> active# X1) (active# splitAt(X1, X2) -> active# X2, active# snd X -> snd# active X) (active# splitAt(X1, X2) -> active# X2, active# snd X -> active# X) (active# splitAt(X1, X2) -> active# X2, active# pair(X1, X2) -> pair#(active X1, X2)) (active# splitAt(X1, X2) -> active# X2, active# pair(X1, X2) -> pair#(X1, active X2)) (active# splitAt(X1, X2) -> active# X2, active# pair(X1, X2) -> active# X2) (active# splitAt(X1, X2) -> active# X2, active# pair(X1, X2) -> active# X1) (active# splitAt(X1, X2) -> active# X2, active# fst X -> fst# active X) (active# splitAt(X1, X2) -> active# X2, active# fst X -> active# X) (active# splitAt(X1, X2) -> active# X2, active# s X -> active# X) (active# splitAt(X1, X2) -> active# X2, active# s X -> s# active X) (active# splitAt(X1, X2) -> active# X2, active# natsFrom X -> active# X) (active# splitAt(X1, X2) -> active# X2, active# natsFrom X -> natsFrom# active X) (active# splitAt(X1, X2) -> active# X2, active# natsFrom N -> s# N) (active# splitAt(X1, X2) -> active# X2, active# natsFrom N -> natsFrom# s N) (active# splitAt(X1, X2) -> active# X2, active# natsFrom N -> cons#(N, natsFrom s N)) (active# splitAt(X1, X2) -> active# X2, active# cons(X1, X2) -> active# X1) (active# splitAt(X1, X2) -> active# X2, active# cons(X1, X2) -> cons#(active X1, X2)) (active# sel(X1, X2) -> active# X2, active# take(X1, X2) -> take#(active X1, X2)) (active# sel(X1, X2) -> active# X2, active# take(X1, X2) -> take#(X1, active X2)) (active# sel(X1, X2) -> active# X2, active# take(X1, X2) -> active# X2) (active# sel(X1, X2) -> active# X2, active# take(X1, X2) -> active# X1) (active# sel(X1, X2) -> active# X2, active# take(N, XS) -> splitAt#(N, XS)) (active# sel(X1, X2) -> active# X2, active# take(N, XS) -> fst# splitAt(N, XS)) (active# sel(X1, X2) -> active# X2, active# sel(X1, X2) -> sel#(active X1, X2)) (active# sel(X1, X2) -> active# X2, active# sel(X1, X2) -> sel#(X1, active X2)) (active# sel(X1, X2) -> active# X2, active# sel(X1, X2) -> active# X2) (active# sel(X1, X2) -> active# X2, active# sel(X1, X2) -> active# X1) (active# sel(X1, X2) -> active# X2, active# sel(N, XS) -> afterNth#(N, XS)) (active# sel(X1, X2) -> active# X2, active# sel(N, XS) -> head# afterNth(N, XS)) (active# sel(X1, X2) -> active# X2, active# afterNth(X1, X2) -> afterNth#(active X1, X2)) (active# sel(X1, X2) -> active# X2, active# afterNth(X1, X2) -> afterNth#(X1, active X2)) (active# sel(X1, X2) -> active# X2, active# afterNth(X1, X2) -> active# X2) (active# sel(X1, X2) -> active# X2, active# afterNth(X1, X2) -> active# X1) (active# sel(X1, X2) -> active# X2, active# afterNth(N, XS) -> splitAt#(N, XS)) (active# sel(X1, X2) -> active# X2, active# afterNth(N, XS) -> snd# splitAt(N, XS)) (active# sel(X1, X2) -> active# X2, active# tail X -> tail# active X) (active# sel(X1, X2) -> active# X2, active# tail X -> active# X) (active# sel(X1, X2) -> active# X2, active# head X -> head# active X) (active# sel(X1, X2) -> active# X2, active# head X -> active# X) (active# sel(X1, X2) -> active# X2, active# u(pair(YS, ZS), N, X, XS) -> pair#(cons(X, YS), ZS)) (active# sel(X1, X2) -> active# X2, active# u(pair(YS, ZS), N, X, XS) -> cons#(X, YS)) (active# sel(X1, X2) -> active# X2, active# u(X1, X2, X3, X4) -> u#(active X1, X2, X3, X4)) (active# sel(X1, X2) -> active# X2, active# u(X1, X2, X3, X4) -> active# X1) (active# sel(X1, X2) -> active# X2, active# splitAt(0(), XS) -> pair#(nil(), XS)) (active# sel(X1, X2) -> active# X2, active# splitAt(s N, cons(X, XS)) -> u#(splitAt(N, XS), N, X, XS)) (active# sel(X1, X2) -> active# X2, active# splitAt(s N, cons(X, XS)) -> splitAt#(N, XS)) (active# sel(X1, X2) -> active# X2, active# splitAt(X1, X2) -> splitAt#(active X1, X2)) (active# sel(X1, X2) -> active# X2, active# splitAt(X1, X2) -> splitAt#(X1, active X2)) (active# sel(X1, X2) -> active# X2, active# splitAt(X1, X2) -> active# X2) (active# sel(X1, X2) -> active# X2, active# splitAt(X1, X2) -> active# X1) (active# sel(X1, X2) -> active# X2, active# snd X -> snd# active X) (active# sel(X1, X2) -> active# X2, active# snd X -> active# X) (active# sel(X1, X2) -> active# X2, active# pair(X1, X2) -> pair#(active X1, X2)) (active# sel(X1, X2) -> active# X2, active# pair(X1, X2) -> pair#(X1, active X2)) (active# sel(X1, X2) -> active# X2, active# pair(X1, X2) -> active# X2) (active# sel(X1, X2) -> active# X2, active# pair(X1, X2) -> active# X1) (active# sel(X1, X2) -> active# X2, active# fst X -> fst# active X) (active# sel(X1, X2) -> active# X2, active# fst X -> active# X) (active# sel(X1, X2) -> active# X2, active# s X -> active# X) (active# sel(X1, X2) -> active# X2, active# s X -> s# active X) (active# sel(X1, X2) -> active# X2, active# natsFrom X -> active# X) (active# sel(X1, X2) -> active# X2, active# natsFrom X -> natsFrom# active X) (active# sel(X1, X2) -> active# X2, active# natsFrom N -> s# N) (active# sel(X1, X2) -> active# X2, active# natsFrom N -> natsFrom# s N) (active# sel(X1, X2) -> active# X2, active# natsFrom N -> cons#(N, natsFrom s N)) (active# sel(X1, X2) -> active# X2, active# cons(X1, X2) -> active# X1) (active# sel(X1, X2) -> active# X2, active# cons(X1, X2) -> cons#(active X1, X2)) (proper# cons(X1, X2) -> proper# X2, proper# take(X1, X2) -> proper# X2) (proper# cons(X1, X2) -> proper# X2, proper# take(X1, X2) -> proper# X1) (proper# cons(X1, X2) -> proper# X2, proper# take(X1, X2) -> take#(proper X1, proper X2)) (proper# cons(X1, X2) -> proper# X2, proper# sel(X1, X2) -> proper# X2) (proper# cons(X1, X2) -> proper# X2, proper# sel(X1, X2) -> proper# X1) (proper# cons(X1, X2) -> proper# X2, proper# sel(X1, X2) -> sel#(proper X1, proper X2)) (proper# cons(X1, X2) -> proper# X2, proper# afterNth(X1, X2) -> proper# X2) (proper# cons(X1, X2) -> proper# X2, proper# afterNth(X1, X2) -> proper# X1) (proper# cons(X1, X2) -> proper# X2, proper# afterNth(X1, X2) -> afterNth#(proper X1, proper X2)) (proper# cons(X1, X2) -> proper# X2, proper# tail X -> proper# X) (proper# cons(X1, X2) -> proper# X2, proper# tail X -> tail# proper X) (proper# cons(X1, X2) -> proper# X2, proper# head X -> proper# X) (proper# cons(X1, X2) -> proper# X2, proper# head X -> head# proper X) (proper# cons(X1, X2) -> proper# X2, proper# u(X1, X2, X3, X4) -> proper# X4) (proper# cons(X1, X2) -> proper# X2, proper# u(X1, X2, X3, X4) -> proper# X3) (proper# cons(X1, X2) -> proper# X2, proper# u(X1, X2, X3, X4) -> proper# X2) (proper# cons(X1, X2) -> proper# X2, proper# u(X1, X2, X3, X4) -> proper# X1) (proper# cons(X1, X2) -> proper# X2, proper# u(X1, X2, X3, X4) -> u#(proper X1, proper X2, proper X3, proper X4)) (proper# cons(X1, X2) -> proper# X2, proper# splitAt(X1, X2) -> proper# X2) (proper# cons(X1, X2) -> proper# X2, proper# splitAt(X1, X2) -> proper# X1) (proper# cons(X1, X2) -> proper# X2, proper# splitAt(X1, X2) -> splitAt#(proper X1, proper X2)) (proper# cons(X1, X2) -> proper# X2, proper# snd X -> proper# X) (proper# cons(X1, X2) -> proper# X2, proper# snd X -> snd# proper X) (proper# cons(X1, X2) -> proper# X2, proper# pair(X1, X2) -> proper# X2) (proper# cons(X1, X2) -> proper# X2, proper# pair(X1, X2) -> proper# X1) (proper# cons(X1, X2) -> proper# X2, proper# pair(X1, X2) -> pair#(proper X1, proper X2)) (proper# cons(X1, X2) -> proper# X2, proper# fst X -> proper# X) (proper# cons(X1, X2) -> proper# X2, proper# fst X -> fst# proper X) (proper# cons(X1, X2) -> proper# X2, proper# s X -> proper# X) (proper# cons(X1, X2) -> proper# X2, proper# s X -> s# proper X) (proper# cons(X1, X2) -> proper# X2, proper# natsFrom X -> proper# X) (proper# cons(X1, X2) -> proper# X2, proper# natsFrom X -> natsFrom# proper X) (proper# cons(X1, X2) -> proper# X2, proper# cons(X1, X2) -> proper# X2) (proper# cons(X1, X2) -> proper# X2, proper# cons(X1, X2) -> proper# X1) (proper# cons(X1, X2) -> proper# X2, proper# cons(X1, X2) -> cons#(proper X1, proper X2)) (proper# splitAt(X1, X2) -> proper# X2, proper# take(X1, X2) -> proper# X2) (proper# splitAt(X1, X2) -> proper# X2, proper# take(X1, X2) -> proper# X1) (proper# splitAt(X1, X2) -> proper# X2, proper# take(X1, X2) -> take#(proper X1, proper X2)) (proper# splitAt(X1, X2) -> proper# X2, proper# sel(X1, X2) -> proper# X2) (proper# splitAt(X1, X2) -> proper# X2, proper# sel(X1, X2) -> proper# X1) (proper# splitAt(X1, X2) -> proper# X2, proper# sel(X1, X2) -> sel#(proper X1, proper X2)) (proper# splitAt(X1, X2) -> proper# X2, proper# afterNth(X1, X2) -> proper# X2) (proper# splitAt(X1, X2) -> proper# X2, proper# afterNth(X1, X2) -> proper# X1) (proper# splitAt(X1, X2) -> proper# X2, proper# afterNth(X1, X2) -> afterNth#(proper X1, proper X2)) (proper# splitAt(X1, X2) -> proper# X2, proper# tail X -> proper# X) (proper# splitAt(X1, X2) -> proper# X2, proper# tail X -> tail# proper X) (proper# splitAt(X1, X2) -> proper# X2, proper# head X -> proper# X) (proper# splitAt(X1, X2) -> proper# X2, proper# head X -> head# proper X) (proper# splitAt(X1, X2) -> proper# X2, proper# u(X1, X2, X3, X4) -> proper# X4) (proper# splitAt(X1, X2) -> proper# X2, proper# u(X1, X2, X3, X4) -> proper# X3) (proper# splitAt(X1, X2) -> proper# X2, proper# u(X1, X2, X3, X4) -> proper# X2) (proper# splitAt(X1, X2) -> proper# X2, proper# u(X1, X2, X3, X4) -> proper# X1) (proper# splitAt(X1, X2) -> proper# X2, proper# u(X1, X2, X3, X4) -> u#(proper X1, proper X2, proper X3, proper X4)) (proper# splitAt(X1, X2) -> proper# X2, proper# splitAt(X1, X2) -> proper# X2) (proper# splitAt(X1, X2) -> proper# X2, proper# splitAt(X1, X2) -> proper# X1) (proper# splitAt(X1, X2) -> proper# X2, proper# splitAt(X1, X2) -> splitAt#(proper X1, proper X2)) (proper# splitAt(X1, X2) -> proper# X2, proper# snd X -> proper# X) (proper# splitAt(X1, X2) -> proper# X2, proper# snd X -> snd# proper X) (proper# splitAt(X1, X2) -> proper# X2, proper# pair(X1, X2) -> proper# X2) (proper# splitAt(X1, X2) -> proper# X2, proper# pair(X1, X2) -> proper# X1) (proper# splitAt(X1, X2) -> proper# X2, proper# pair(X1, X2) -> pair#(proper X1, proper X2)) (proper# splitAt(X1, X2) -> proper# X2, proper# fst X -> proper# X) (proper# splitAt(X1, X2) -> proper# X2, proper# fst X -> fst# proper X) (proper# splitAt(X1, X2) -> proper# X2, proper# s X -> proper# X) (proper# splitAt(X1, X2) -> proper# X2, proper# s X -> s# proper X) (proper# splitAt(X1, X2) -> proper# X2, proper# natsFrom X -> proper# X) (proper# splitAt(X1, X2) -> proper# X2, proper# natsFrom X -> natsFrom# proper X) (proper# splitAt(X1, X2) -> proper# X2, proper# cons(X1, X2) -> proper# X2) (proper# splitAt(X1, X2) -> proper# X2, proper# cons(X1, X2) -> proper# X1) (proper# splitAt(X1, X2) -> proper# X2, proper# cons(X1, X2) -> cons#(proper X1, proper X2)) (proper# afterNth(X1, X2) -> proper# X2, proper# take(X1, X2) -> proper# X2) (proper# afterNth(X1, X2) -> proper# X2, proper# take(X1, X2) -> proper# X1) (proper# afterNth(X1, X2) -> proper# X2, proper# take(X1, X2) -> take#(proper X1, proper X2)) (proper# afterNth(X1, X2) -> proper# X2, proper# sel(X1, X2) -> proper# X2) (proper# afterNth(X1, X2) -> proper# X2, proper# sel(X1, X2) -> proper# X1) (proper# afterNth(X1, X2) -> proper# X2, proper# sel(X1, X2) -> sel#(proper X1, proper X2)) (proper# afterNth(X1, X2) -> proper# X2, proper# afterNth(X1, X2) -> proper# X2) (proper# afterNth(X1, X2) -> proper# X2, proper# afterNth(X1, X2) -> proper# X1) (proper# afterNth(X1, X2) -> proper# X2, proper# afterNth(X1, X2) -> afterNth#(proper X1, proper X2)) (proper# afterNth(X1, X2) -> proper# X2, proper# tail X -> proper# X) (proper# afterNth(X1, X2) -> proper# X2, proper# tail X -> tail# proper X) (proper# afterNth(X1, X2) -> proper# X2, proper# head X -> proper# X) (proper# afterNth(X1, X2) -> proper# X2, proper# head X -> head# proper X) (proper# afterNth(X1, X2) -> proper# X2, proper# u(X1, X2, X3, X4) -> proper# X4) (proper# afterNth(X1, X2) -> proper# X2, proper# u(X1, X2, X3, X4) -> proper# X3) (proper# afterNth(X1, X2) -> proper# X2, proper# u(X1, X2, X3, X4) -> proper# X2) (proper# afterNth(X1, X2) -> proper# X2, proper# u(X1, X2, X3, X4) -> proper# X1) (proper# afterNth(X1, X2) -> proper# X2, proper# u(X1, X2, X3, X4) -> u#(proper X1, proper X2, proper X3, proper X4)) (proper# afterNth(X1, X2) -> proper# X2, proper# splitAt(X1, X2) -> proper# X2) (proper# afterNth(X1, X2) -> proper# X2, proper# splitAt(X1, X2) -> proper# X1) (proper# afterNth(X1, X2) -> proper# X2, proper# splitAt(X1, X2) -> splitAt#(proper X1, proper X2)) (proper# afterNth(X1, X2) -> proper# X2, proper# snd X -> proper# X) (proper# afterNth(X1, X2) -> proper# X2, proper# snd X -> snd# proper X) (proper# afterNth(X1, X2) -> proper# X2, proper# pair(X1, X2) -> proper# X2) (proper# afterNth(X1, X2) -> proper# X2, proper# pair(X1, X2) -> proper# X1) (proper# afterNth(X1, X2) -> proper# X2, proper# pair(X1, X2) -> pair#(proper X1, proper X2)) (proper# afterNth(X1, X2) -> proper# X2, proper# fst X -> proper# X) (proper# afterNth(X1, X2) -> proper# X2, proper# fst X -> fst# proper X) (proper# afterNth(X1, X2) -> proper# X2, proper# s X -> proper# X) (proper# afterNth(X1, X2) -> proper# X2, proper# s X -> s# proper X) (proper# afterNth(X1, X2) -> proper# X2, proper# natsFrom X -> proper# X) (proper# afterNth(X1, X2) -> proper# X2, proper# natsFrom X -> natsFrom# proper X) (proper# afterNth(X1, X2) -> proper# X2, proper# cons(X1, X2) -> proper# X2) (proper# afterNth(X1, X2) -> proper# X2, proper# cons(X1, X2) -> proper# X1) (proper# afterNth(X1, X2) -> proper# X2, proper# cons(X1, X2) -> cons#(proper X1, proper X2)) (proper# take(X1, X2) -> proper# X2, proper# take(X1, X2) -> proper# X2) (proper# take(X1, X2) -> proper# X2, proper# take(X1, X2) -> proper# X1) (proper# take(X1, X2) -> proper# X2, proper# take(X1, X2) -> take#(proper X1, proper X2)) (proper# take(X1, X2) -> proper# X2, proper# sel(X1, X2) -> proper# X2) (proper# take(X1, X2) -> proper# X2, proper# sel(X1, X2) -> proper# X1) (proper# take(X1, X2) -> proper# X2, proper# sel(X1, X2) -> sel#(proper X1, proper X2)) (proper# take(X1, X2) -> proper# X2, proper# afterNth(X1, X2) -> proper# X2) (proper# take(X1, X2) -> proper# X2, proper# afterNth(X1, X2) -> proper# X1) (proper# take(X1, X2) -> proper# X2, proper# afterNth(X1, X2) -> afterNth#(proper X1, proper X2)) (proper# take(X1, X2) -> proper# X2, proper# tail X -> proper# X) (proper# take(X1, X2) -> proper# X2, proper# tail X -> tail# proper X) (proper# take(X1, X2) -> proper# X2, proper# head X -> proper# X) (proper# take(X1, X2) -> proper# X2, proper# head X -> head# proper X) (proper# take(X1, X2) -> proper# X2, proper# u(X1, X2, X3, X4) -> proper# X4) (proper# take(X1, X2) -> proper# X2, proper# u(X1, X2, X3, X4) -> proper# X3) (proper# take(X1, X2) -> proper# X2, proper# u(X1, X2, X3, X4) -> proper# X2) (proper# take(X1, X2) -> proper# X2, proper# u(X1, X2, X3, X4) -> proper# X1) (proper# take(X1, X2) -> proper# X2, proper# u(X1, X2, X3, X4) -> u#(proper X1, proper X2, proper X3, proper X4)) (proper# take(X1, X2) -> proper# X2, proper# splitAt(X1, X2) -> proper# X2) (proper# take(X1, X2) -> proper# X2, proper# splitAt(X1, X2) -> proper# X1) (proper# take(X1, X2) -> proper# X2, proper# splitAt(X1, X2) -> splitAt#(proper X1, proper X2)) (proper# take(X1, X2) -> proper# X2, proper# snd X -> proper# X) (proper# take(X1, X2) -> proper# X2, proper# snd X -> snd# proper X) (proper# take(X1, X2) -> proper# X2, proper# pair(X1, X2) -> proper# X2) (proper# take(X1, X2) -> proper# X2, proper# pair(X1, X2) -> proper# X1) (proper# take(X1, X2) -> proper# X2, proper# pair(X1, X2) -> pair#(proper X1, proper X2)) (proper# take(X1, X2) -> proper# X2, proper# fst X -> proper# X) (proper# take(X1, X2) -> proper# X2, proper# fst X -> fst# proper X) (proper# take(X1, X2) -> proper# X2, proper# s X -> proper# X) (proper# take(X1, X2) -> proper# X2, proper# s X -> s# proper X) (proper# take(X1, X2) -> proper# X2, proper# natsFrom X -> proper# X) (proper# take(X1, X2) -> proper# X2, proper# natsFrom X -> natsFrom# proper X) (proper# take(X1, X2) -> proper# X2, proper# cons(X1, X2) -> proper# X2) (proper# take(X1, X2) -> proper# X2, proper# cons(X1, X2) -> proper# X1) (proper# take(X1, X2) -> proper# X2, proper# cons(X1, X2) -> cons#(proper X1, proper X2)) (active# afterNth(N, XS) -> snd# splitAt(N, XS), snd# ok X -> snd# X) (active# afterNth(N, XS) -> snd# splitAt(N, XS), snd# mark X -> snd# X) (active# take(N, XS) -> fst# splitAt(N, XS), fst# ok X -> fst# X) (active# take(N, XS) -> fst# splitAt(N, XS), fst# mark X -> fst# X) (proper# u(X1, X2, X3, X4) -> proper# X3, proper# take(X1, X2) -> proper# X2) (proper# u(X1, X2, X3, X4) -> proper# X3, proper# take(X1, X2) -> proper# X1) (proper# u(X1, X2, X3, X4) -> proper# X3, proper# take(X1, X2) -> take#(proper X1, proper X2)) (proper# u(X1, X2, X3, X4) -> proper# X3, proper# sel(X1, X2) -> proper# X2) (proper# u(X1, X2, X3, X4) -> proper# X3, proper# sel(X1, X2) -> proper# X1) (proper# u(X1, X2, X3, X4) -> proper# X3, proper# sel(X1, X2) -> sel#(proper X1, proper X2)) (proper# u(X1, X2, X3, X4) -> proper# X3, proper# afterNth(X1, X2) -> proper# X2) (proper# u(X1, X2, X3, X4) -> proper# X3, proper# afterNth(X1, X2) -> proper# X1) (proper# u(X1, X2, X3, X4) -> proper# X3, proper# afterNth(X1, X2) -> afterNth#(proper X1, proper X2)) (proper# u(X1, X2, X3, X4) -> proper# X3, proper# tail X -> proper# X) (proper# u(X1, X2, X3, X4) -> proper# X3, proper# tail X -> tail# proper X) (proper# u(X1, X2, X3, X4) -> proper# X3, proper# head X -> proper# X) (proper# u(X1, X2, X3, X4) -> proper# X3, proper# head X -> head# proper X) (proper# u(X1, X2, X3, X4) -> proper# X3, proper# u(X1, X2, X3, X4) -> proper# X4) (proper# u(X1, X2, X3, X4) -> proper# X3, proper# u(X1, X2, X3, X4) -> proper# X3) (proper# u(X1, X2, X3, X4) -> proper# X3, proper# u(X1, X2, X3, X4) -> proper# X2) (proper# u(X1, X2, X3, X4) -> proper# X3, proper# u(X1, X2, X3, X4) -> proper# X1) (proper# u(X1, X2, X3, X4) -> proper# X3, proper# u(X1, X2, X3, X4) -> u#(proper X1, proper X2, proper X3, proper X4)) (proper# u(X1, X2, X3, X4) -> proper# X3, proper# splitAt(X1, X2) -> proper# X2) (proper# u(X1, X2, X3, X4) -> proper# X3, proper# splitAt(X1, X2) -> proper# X1) (proper# u(X1, X2, X3, X4) -> proper# X3, proper# splitAt(X1, X2) -> splitAt#(proper X1, proper X2)) (proper# u(X1, X2, X3, X4) -> proper# X3, proper# snd X -> proper# X) (proper# u(X1, X2, X3, X4) -> proper# X3, proper# snd X -> snd# proper X) (proper# u(X1, X2, X3, X4) -> proper# X3, proper# pair(X1, X2) -> proper# X2) (proper# u(X1, X2, X3, X4) -> proper# X3, proper# pair(X1, X2) -> proper# X1) (proper# u(X1, X2, X3, X4) -> proper# X3, proper# pair(X1, X2) -> pair#(proper X1, proper X2)) (proper# u(X1, X2, X3, X4) -> proper# X3, proper# fst X -> proper# X) (proper# u(X1, X2, X3, X4) -> proper# X3, proper# fst X -> fst# proper X) (proper# u(X1, X2, X3, X4) -> proper# X3, proper# s X -> proper# X) (proper# u(X1, X2, X3, X4) -> proper# X3, proper# s X -> s# proper X) (proper# u(X1, X2, X3, X4) -> proper# X3, proper# natsFrom X -> proper# X) (proper# u(X1, X2, X3, X4) -> proper# X3, proper# natsFrom X -> natsFrom# proper X) (proper# u(X1, X2, X3, X4) -> proper# X3, proper# cons(X1, X2) -> proper# X2) (proper# u(X1, X2, X3, X4) -> proper# X3, proper# cons(X1, X2) -> proper# X1) (proper# u(X1, X2, X3, X4) -> proper# X3, proper# cons(X1, X2) -> cons#(proper X1, proper X2)) (active# pair(X1, X2) -> pair#(active X1, X2), pair#(ok X1, ok X2) -> pair#(X1, X2)) (active# pair(X1, X2) -> pair#(active X1, X2), pair#(mark X1, X2) -> pair#(X1, X2)) (active# pair(X1, X2) -> pair#(active X1, X2), pair#(X1, mark X2) -> pair#(X1, X2)) (active# afterNth(X1, X2) -> afterNth#(active X1, X2), afterNth#(ok X1, ok X2) -> afterNth#(X1, X2)) (active# afterNth(X1, X2) -> afterNth#(active X1, X2), afterNth#(mark X1, X2) -> afterNth#(X1, X2)) (active# afterNth(X1, X2) -> afterNth#(active X1, X2), afterNth#(X1, mark X2) -> afterNth#(X1, X2)) (active# take(X1, X2) -> take#(active X1, X2), take#(ok X1, ok X2) -> take#(X1, X2)) (active# take(X1, X2) -> take#(active X1, X2), take#(mark X1, X2) -> take#(X1, X2)) (active# take(X1, X2) -> take#(active X1, X2), take#(X1, mark X2) -> take#(X1, X2)) (cons#(mark X1, X2) -> cons#(X1, X2), cons#(ok X1, ok X2) -> cons#(X1, X2)) (cons#(mark X1, X2) -> cons#(X1, X2), cons#(mark X1, X2) -> cons#(X1, X2)) (pair#(X1, mark X2) -> pair#(X1, X2), pair#(ok X1, ok X2) -> pair#(X1, X2)) (pair#(X1, mark X2) -> pair#(X1, X2), pair#(mark X1, X2) -> pair#(X1, X2)) (pair#(X1, mark X2) -> pair#(X1, X2), pair#(X1, mark X2) -> pair#(X1, X2)) (pair#(ok X1, ok X2) -> pair#(X1, X2), pair#(ok X1, ok X2) -> pair#(X1, X2)) (pair#(ok X1, ok X2) -> pair#(X1, X2), pair#(mark X1, X2) -> pair#(X1, X2)) (pair#(ok X1, ok X2) -> pair#(X1, X2), pair#(X1, mark X2) -> pair#(X1, X2)) (splitAt#(mark X1, X2) -> splitAt#(X1, X2), splitAt#(ok X1, ok X2) -> splitAt#(X1, X2)) (splitAt#(mark X1, X2) -> splitAt#(X1, X2), splitAt#(mark X1, X2) -> splitAt#(X1, X2)) (splitAt#(mark X1, X2) -> splitAt#(X1, X2), splitAt#(X1, mark X2) -> splitAt#(X1, X2)) (afterNth#(X1, mark X2) -> afterNth#(X1, X2), afterNth#(ok X1, ok X2) -> afterNth#(X1, X2)) (afterNth#(X1, mark X2) -> afterNth#(X1, X2), afterNth#(mark X1, X2) -> afterNth#(X1, X2)) (afterNth#(X1, mark X2) -> afterNth#(X1, X2), afterNth#(X1, mark X2) -> afterNth#(X1, X2)) (afterNth#(ok X1, ok X2) -> afterNth#(X1, X2), afterNth#(ok X1, ok X2) -> afterNth#(X1, X2)) (afterNth#(ok X1, ok X2) -> afterNth#(X1, X2), afterNth#(mark X1, X2) -> afterNth#(X1, X2)) (afterNth#(ok X1, ok X2) -> afterNth#(X1, X2), afterNth#(X1, mark X2) -> afterNth#(X1, X2)) (sel#(mark X1, X2) -> sel#(X1, X2), sel#(ok X1, ok X2) -> sel#(X1, X2)) (sel#(mark X1, X2) -> sel#(X1, X2), sel#(mark X1, X2) -> sel#(X1, X2)) (sel#(mark X1, X2) -> sel#(X1, X2), sel#(X1, mark X2) -> sel#(X1, X2)) (take#(X1, mark X2) -> take#(X1, X2), take#(ok X1, ok X2) -> take#(X1, X2)) (take#(X1, mark X2) -> take#(X1, X2), take#(mark X1, X2) -> take#(X1, X2)) (take#(X1, mark X2) -> take#(X1, X2), take#(X1, mark X2) -> take#(X1, X2)) (take#(ok X1, ok X2) -> take#(X1, X2), take#(ok X1, ok X2) -> take#(X1, X2)) (take#(ok X1, ok X2) -> take#(X1, X2), take#(mark X1, X2) -> take#(X1, X2)) (take#(ok X1, ok X2) -> take#(X1, X2), take#(X1, mark X2) -> take#(X1, X2)) (active# u(pair(YS, ZS), N, X, XS) -> cons#(X, YS), cons#(ok X1, ok X2) -> cons#(X1, X2)) (active# u(pair(YS, ZS), N, X, XS) -> cons#(X, YS), cons#(mark X1, X2) -> cons#(X1, X2)) (active# splitAt(X1, X2) -> splitAt#(X1, active X2), splitAt#(ok X1, ok X2) -> splitAt#(X1, X2)) (active# splitAt(X1, X2) -> splitAt#(X1, active X2), splitAt#(mark X1, X2) -> splitAt#(X1, X2)) (active# splitAt(X1, X2) -> splitAt#(X1, active X2), splitAt#(X1, mark X2) -> splitAt#(X1, X2)) (active# sel(X1, X2) -> sel#(X1, active X2), sel#(ok X1, ok X2) -> sel#(X1, X2)) (active# sel(X1, X2) -> sel#(X1, active X2), sel#(mark X1, X2) -> sel#(X1, X2)) (active# sel(X1, X2) -> sel#(X1, active X2), sel#(X1, mark X2) -> sel#(X1, X2)) (proper# cons(X1, X2) -> cons#(proper X1, proper X2), cons#(ok X1, ok X2) -> cons#(X1, X2)) (proper# cons(X1, X2) -> cons#(proper X1, proper X2), cons#(mark X1, X2) -> cons#(X1, X2)) (proper# splitAt(X1, X2) -> splitAt#(proper X1, proper X2), splitAt#(ok X1, ok X2) -> splitAt#(X1, X2)) (proper# splitAt(X1, X2) -> splitAt#(proper X1, proper X2), splitAt#(mark X1, X2) -> splitAt#(X1, X2)) (proper# splitAt(X1, X2) -> splitAt#(proper X1, proper X2), splitAt#(X1, mark X2) -> splitAt#(X1, X2)) (proper# sel(X1, X2) -> sel#(proper X1, proper X2), sel#(ok X1, ok X2) -> sel#(X1, X2)) (proper# sel(X1, X2) -> sel#(proper X1, proper X2), sel#(mark X1, X2) -> sel#(X1, X2)) (proper# sel(X1, X2) -> sel#(proper X1, proper X2), sel#(X1, mark X2) -> sel#(X1, X2)) (natsFrom# mark X -> natsFrom# X, natsFrom# ok X -> natsFrom# X) (natsFrom# mark X -> natsFrom# X, natsFrom# mark X -> natsFrom# X) (s# mark X -> s# X, s# ok X -> s# X) (s# mark X -> s# X, s# mark X -> s# X) (active# natsFrom X -> active# X, active# take(X1, X2) -> take#(active X1, X2)) (active# natsFrom X -> active# X, active# take(X1, X2) -> take#(X1, active X2)) (active# natsFrom X -> active# X, active# take(X1, X2) -> active# X2) (active# natsFrom X -> active# X, active# take(X1, X2) -> active# X1) (active# natsFrom X -> active# X, active# take(N, XS) -> splitAt#(N, XS)) (active# natsFrom X -> active# X, active# take(N, XS) -> fst# splitAt(N, XS)) (active# natsFrom X -> active# X, active# sel(X1, X2) -> sel#(active X1, X2)) (active# natsFrom X -> active# X, active# sel(X1, X2) -> sel#(X1, active X2)) (active# natsFrom X -> active# X, active# sel(X1, X2) -> active# X2) (active# natsFrom X -> active# X, active# sel(X1, X2) -> active# X1) (active# natsFrom X -> active# X, active# sel(N, XS) -> afterNth#(N, XS)) (active# natsFrom X -> active# X, active# sel(N, XS) -> head# afterNth(N, XS)) (active# natsFrom X -> active# X, active# afterNth(X1, X2) -> afterNth#(active X1, X2)) (active# natsFrom X -> active# X, active# afterNth(X1, X2) -> afterNth#(X1, active X2)) (active# natsFrom X -> active# X, active# afterNth(X1, X2) -> active# X2) (active# natsFrom X -> active# X, active# afterNth(X1, X2) -> active# X1) (active# natsFrom X -> active# X, active# afterNth(N, XS) -> splitAt#(N, XS)) (active# natsFrom X -> active# X, active# afterNth(N, XS) -> snd# splitAt(N, XS)) (active# natsFrom X -> active# X, active# tail X -> tail# active X) (active# natsFrom X -> active# X, active# tail X -> active# X) (active# natsFrom X -> active# X, active# head X -> head# active X) (active# natsFrom X -> active# X, active# head X -> active# X) (active# natsFrom X -> active# X, active# u(pair(YS, ZS), N, X, XS) -> pair#(cons(X, YS), ZS)) (active# natsFrom X -> active# X, active# u(pair(YS, ZS), N, X, XS) -> cons#(X, YS)) (active# natsFrom X -> active# X, active# u(X1, X2, X3, X4) -> u#(active X1, X2, X3, X4)) (active# natsFrom X -> active# X, active# u(X1, X2, X3, X4) -> active# X1) (active# natsFrom X -> active# X, active# splitAt(0(), XS) -> pair#(nil(), XS)) (active# natsFrom X -> active# X, active# splitAt(s N, cons(X, XS)) -> u#(splitAt(N, XS), N, X, XS)) (active# natsFrom X -> active# X, active# splitAt(s N, cons(X, XS)) -> splitAt#(N, XS)) (active# natsFrom X -> active# X, active# splitAt(X1, X2) -> splitAt#(active X1, X2)) (active# natsFrom X -> active# X, active# splitAt(X1, X2) -> splitAt#(X1, active X2)) (active# natsFrom X -> active# X, active# splitAt(X1, X2) -> active# X2) (active# natsFrom X -> active# X, active# splitAt(X1, X2) -> active# X1) (active# natsFrom X -> active# X, active# snd X -> snd# active X) (active# natsFrom X -> active# X, active# snd X -> active# X) (active# natsFrom X -> active# X, active# pair(X1, X2) -> pair#(active X1, X2)) (active# natsFrom X -> active# X, active# pair(X1, X2) -> pair#(X1, active X2)) (active# natsFrom X -> active# X, active# pair(X1, X2) -> active# X2) (active# natsFrom X -> active# X, active# pair(X1, X2) -> active# X1) (active# natsFrom X -> active# X, active# fst X -> fst# active X) (active# natsFrom X -> active# X, active# fst X -> active# X) (active# natsFrom X -> active# X, active# s X -> active# X) (active# natsFrom X -> active# X, active# s X -> s# active X) (active# natsFrom X -> active# X, active# natsFrom X -> active# X) (active# natsFrom X -> active# X, active# natsFrom X -> natsFrom# active X) (active# natsFrom X -> active# X, active# natsFrom N -> s# N) (active# natsFrom X -> active# X, active# natsFrom N -> natsFrom# s N) (active# natsFrom X -> active# X, active# natsFrom N -> cons#(N, natsFrom s N)) (active# natsFrom X -> active# X, active# cons(X1, X2) -> active# X1) (active# natsFrom X -> active# X, active# cons(X1, X2) -> cons#(active X1, X2)) (active# fst X -> active# X, active# take(X1, X2) -> take#(active X1, X2)) (active# fst X -> active# X, active# take(X1, X2) -> take#(X1, active X2)) (active# fst X -> active# X, active# take(X1, X2) -> active# X2) (active# fst X -> active# X, active# take(X1, X2) -> active# X1) (active# fst X -> active# X, active# take(N, XS) -> splitAt#(N, XS)) (active# fst X -> active# X, active# take(N, XS) -> fst# splitAt(N, XS)) (active# fst X -> active# X, active# sel(X1, X2) -> sel#(active X1, X2)) (active# fst X -> active# X, active# sel(X1, X2) -> sel#(X1, active X2)) (active# fst X -> active# X, active# sel(X1, X2) -> active# X2) (active# fst X -> active# X, active# sel(X1, X2) -> active# X1) (active# fst X -> active# X, active# sel(N, XS) -> afterNth#(N, XS)) (active# fst X -> active# X, active# sel(N, XS) -> head# afterNth(N, XS)) (active# fst X -> active# X, active# afterNth(X1, X2) -> afterNth#(active X1, X2)) (active# fst X -> active# X, active# afterNth(X1, X2) -> afterNth#(X1, active X2)) (active# fst X -> active# X, active# afterNth(X1, X2) -> active# X2) (active# fst X -> active# X, active# afterNth(X1, X2) -> active# X1) (active# fst X -> active# X, active# afterNth(N, XS) -> splitAt#(N, XS)) (active# fst X -> active# X, active# afterNth(N, XS) -> snd# splitAt(N, XS)) (active# fst X -> active# X, active# tail X -> tail# active X) (active# fst X -> active# X, active# tail X -> active# X) (active# fst X -> active# X, active# head X -> head# active X) (active# fst X -> active# X, active# head X -> active# X) (active# fst X -> active# X, active# u(pair(YS, ZS), N, X, XS) -> pair#(cons(X, YS), ZS)) (active# fst X -> active# X, active# u(pair(YS, ZS), N, X, XS) -> cons#(X, YS)) (active# fst X -> active# X, active# u(X1, X2, X3, X4) -> u#(active X1, X2, X3, X4)) (active# fst X -> active# X, active# u(X1, X2, X3, X4) -> active# X1) (active# fst X -> active# X, active# splitAt(0(), XS) -> pair#(nil(), XS)) (active# fst X -> active# X, active# splitAt(s N, cons(X, XS)) -> u#(splitAt(N, XS), N, X, XS)) (active# fst X -> active# X, active# splitAt(s N, cons(X, XS)) -> splitAt#(N, XS)) (active# fst X -> active# X, active# splitAt(X1, X2) -> splitAt#(active X1, X2)) (active# fst X -> active# X, active# splitAt(X1, X2) -> splitAt#(X1, active X2)) (active# fst X -> active# X, active# splitAt(X1, X2) -> active# X2) (active# fst X -> active# X, active# splitAt(X1, X2) -> active# X1) (active# fst X -> active# X, active# snd X -> snd# active X) (active# fst X -> active# X, active# snd X -> active# X) (active# fst X -> active# X, active# pair(X1, X2) -> pair#(active X1, X2)) (active# fst X -> active# X, active# pair(X1, X2) -> pair#(X1, active X2)) (active# fst X -> active# X, active# pair(X1, X2) -> active# X2) (active# fst X -> active# X, active# pair(X1, X2) -> active# X1) (active# fst X -> active# X, active# fst X -> fst# active X) (active# fst X -> active# X, active# fst X -> active# X) (active# fst X -> active# X, active# s X -> active# X) (active# fst X -> active# X, active# s X -> s# active X) (active# fst X -> active# X, active# natsFrom X -> active# X) (active# fst X -> active# X, active# natsFrom X -> natsFrom# active X) (active# fst X -> active# X, active# natsFrom N -> s# N) (active# fst X -> active# X, active# natsFrom N -> natsFrom# s N) (active# fst X -> active# X, active# natsFrom N -> cons#(N, natsFrom s N)) (active# fst X -> active# X, active# cons(X1, X2) -> active# X1) (active# fst X -> active# X, active# cons(X1, X2) -> cons#(active X1, X2)) (active# head X -> active# X, active# take(X1, X2) -> take#(active X1, X2)) (active# head X -> active# X, active# take(X1, X2) -> take#(X1, active X2)) (active# head X -> active# X, active# take(X1, X2) -> active# X2) (active# head X -> active# X, active# take(X1, X2) -> active# X1) (active# head X -> active# X, active# take(N, XS) -> splitAt#(N, XS)) (active# head X -> active# X, active# take(N, XS) -> fst# splitAt(N, XS)) (active# head X -> active# X, active# sel(X1, X2) -> sel#(active X1, X2)) (active# head X -> active# X, active# sel(X1, X2) -> sel#(X1, active X2)) (active# head X -> active# X, active# sel(X1, X2) -> active# X2) (active# head X -> active# X, active# sel(X1, X2) -> active# X1) (active# head X -> active# X, active# sel(N, XS) -> afterNth#(N, XS)) (active# head X -> active# X, active# sel(N, XS) -> head# afterNth(N, XS)) (active# head X -> active# X, active# afterNth(X1, X2) -> afterNth#(active X1, X2)) (active# head X -> active# X, active# afterNth(X1, X2) -> afterNth#(X1, active X2)) (active# head X -> active# X, active# afterNth(X1, X2) -> active# X2) (active# head X -> active# X, active# afterNth(X1, X2) -> active# X1) (active# head X -> active# X, active# afterNth(N, XS) -> splitAt#(N, XS)) (active# head X -> active# X, active# afterNth(N, XS) -> snd# splitAt(N, XS)) (active# head X -> active# X, active# tail X -> tail# active X) (active# head X -> active# X, active# tail X -> active# X) (active# head X -> active# X, active# head X -> head# active X) (active# head X -> active# X, active# head X -> active# X) (active# head X -> active# X, active# u(pair(YS, ZS), N, X, XS) -> pair#(cons(X, YS), ZS)) (active# head X -> active# X, active# u(pair(YS, ZS), N, X, XS) -> cons#(X, YS)) (active# head X -> active# X, active# u(X1, X2, X3, X4) -> u#(active X1, X2, X3, X4)) (active# head X -> active# X, active# u(X1, X2, X3, X4) -> active# X1) (active# head X -> active# X, active# splitAt(0(), XS) -> pair#(nil(), XS)) (active# head X -> active# X, active# splitAt(s N, cons(X, XS)) -> u#(splitAt(N, XS), N, X, XS)) (active# head X -> active# X, active# splitAt(s N, cons(X, XS)) -> splitAt#(N, XS)) (active# head X -> active# X, active# splitAt(X1, X2) -> splitAt#(active X1, X2)) (active# head X -> active# X, active# splitAt(X1, X2) -> splitAt#(X1, active X2)) (active# head X -> active# X, active# splitAt(X1, X2) -> active# X2) (active# head X -> active# X, active# splitAt(X1, X2) -> active# X1) (active# head X -> active# X, active# snd X -> snd# active X) (active# head X -> active# X, active# snd X -> active# X) (active# head X -> active# X, active# pair(X1, X2) -> pair#(active X1, X2)) (active# head X -> active# X, active# pair(X1, X2) -> pair#(X1, active X2)) (active# head X -> active# X, active# pair(X1, X2) -> active# X2) (active# head X -> active# X, active# pair(X1, X2) -> active# X1) (active# head X -> active# X, active# fst X -> fst# active X) (active# head X -> active# X, active# fst X -> active# X) (active# head X -> active# X, active# s X -> active# X) (active# head X -> active# X, active# s X -> s# active X) (active# head X -> active# X, active# natsFrom X -> active# X) (active# head X -> active# X, active# natsFrom X -> natsFrom# active X) (active# head X -> active# X, active# natsFrom N -> s# N) (active# head X -> active# X, active# natsFrom N -> natsFrom# s N) (active# head X -> active# X, active# natsFrom N -> cons#(N, natsFrom s N)) (active# head X -> active# X, active# cons(X1, X2) -> active# X1) (active# head X -> active# X, active# cons(X1, X2) -> cons#(active X1, X2)) (fst# mark X -> fst# X, fst# ok X -> fst# X) (fst# mark X -> fst# X, fst# mark X -> fst# X) (snd# mark X -> snd# X, snd# ok X -> snd# X) (snd# mark X -> snd# X, snd# mark X -> snd# X) (head# mark X -> head# X, head# ok X -> head# X) (head# mark X -> head# X, head# mark X -> head# X) (tail# mark X -> tail# X, tail# ok X -> tail# X) (tail# mark X -> tail# X, tail# mark X -> tail# X) (proper# natsFrom X -> proper# X, proper# take(X1, X2) -> proper# X2) (proper# natsFrom X -> proper# X, proper# take(X1, X2) -> proper# X1) (proper# natsFrom X -> proper# X, proper# take(X1, X2) -> take#(proper X1, proper X2)) (proper# natsFrom X -> proper# X, proper# sel(X1, X2) -> proper# X2) (proper# natsFrom X -> proper# X, proper# sel(X1, X2) -> proper# X1) (proper# natsFrom X -> proper# X, proper# sel(X1, X2) -> sel#(proper X1, proper X2)) (proper# natsFrom X -> proper# X, proper# afterNth(X1, X2) -> proper# X2) (proper# natsFrom X -> proper# X, proper# afterNth(X1, X2) -> proper# X1) (proper# natsFrom X -> proper# X, proper# afterNth(X1, X2) -> afterNth#(proper X1, proper X2)) (proper# natsFrom X -> proper# X, proper# tail X -> proper# X) (proper# natsFrom X -> proper# X, proper# tail X -> tail# proper X) (proper# natsFrom X -> proper# X, proper# head X -> proper# X) (proper# natsFrom X -> proper# X, proper# head X -> head# proper X) (proper# natsFrom X -> proper# X, proper# u(X1, X2, X3, X4) -> proper# X4) (proper# natsFrom X -> proper# X, proper# u(X1, X2, X3, X4) -> proper# X3) (proper# natsFrom X -> proper# X, proper# u(X1, X2, X3, X4) -> proper# X2) (proper# natsFrom X -> proper# X, proper# u(X1, X2, X3, X4) -> proper# X1) (proper# natsFrom X -> proper# X, proper# u(X1, X2, X3, X4) -> u#(proper X1, proper X2, proper X3, proper X4)) (proper# natsFrom X -> proper# X, proper# splitAt(X1, X2) -> proper# X2) (proper# natsFrom X -> proper# X, proper# splitAt(X1, X2) -> proper# X1) (proper# natsFrom X -> proper# X, proper# splitAt(X1, X2) -> splitAt#(proper X1, proper X2)) (proper# natsFrom X -> proper# X, proper# snd X -> proper# X) (proper# natsFrom X -> proper# X, proper# snd X -> snd# proper X) (proper# natsFrom X -> proper# X, proper# pair(X1, X2) -> proper# X2) (proper# natsFrom X -> proper# X, proper# pair(X1, X2) -> proper# X1) (proper# natsFrom X -> proper# X, proper# pair(X1, X2) -> pair#(proper X1, proper X2)) (proper# natsFrom X -> proper# X, proper# fst X -> proper# X) (proper# natsFrom X -> proper# X, proper# fst X -> fst# proper X) (proper# natsFrom X -> proper# X, proper# s X -> proper# X) (proper# natsFrom X -> proper# X, proper# s X -> s# proper X) (proper# natsFrom X -> proper# X, proper# natsFrom X -> proper# X) (proper# natsFrom X -> proper# X, proper# natsFrom X -> natsFrom# proper X) (proper# natsFrom X -> proper# X, proper# cons(X1, X2) -> proper# X2) (proper# natsFrom X -> proper# X, proper# cons(X1, X2) -> proper# X1) (proper# natsFrom X -> proper# X, proper# cons(X1, X2) -> cons#(proper X1, proper X2)) (proper# fst X -> proper# X, proper# take(X1, X2) -> proper# X2) (proper# fst X -> proper# X, proper# take(X1, X2) -> proper# X1) (proper# fst X -> proper# X, proper# take(X1, X2) -> take#(proper X1, proper X2)) (proper# fst X -> proper# X, proper# sel(X1, X2) -> proper# X2) (proper# fst X -> proper# X, proper# sel(X1, X2) -> proper# X1) (proper# fst X -> proper# X, proper# sel(X1, X2) -> sel#(proper X1, proper X2)) (proper# fst X -> proper# X, proper# afterNth(X1, X2) -> proper# X2) (proper# fst X -> proper# X, proper# afterNth(X1, X2) -> proper# X1) (proper# fst X -> proper# X, proper# afterNth(X1, X2) -> afterNth#(proper X1, proper X2)) (proper# fst X -> proper# X, proper# tail X -> proper# X) (proper# fst X -> proper# X, proper# tail X -> tail# proper X) (proper# fst X -> proper# X, proper# head X -> proper# X) (proper# fst X -> proper# X, proper# head X -> head# proper X) (proper# fst X -> proper# X, proper# u(X1, X2, X3, X4) -> proper# X4) (proper# fst X -> proper# X, proper# u(X1, X2, X3, X4) -> proper# X3) (proper# fst X -> proper# X, proper# u(X1, X2, X3, X4) -> proper# X2) (proper# fst X -> proper# X, proper# u(X1, X2, X3, X4) -> proper# X1) (proper# fst X -> proper# X, proper# u(X1, X2, X3, X4) -> u#(proper X1, proper X2, proper X3, proper X4)) (proper# fst X -> proper# X, proper# splitAt(X1, X2) -> proper# X2) (proper# fst X -> proper# X, proper# splitAt(X1, X2) -> proper# X1) (proper# fst X -> proper# X, proper# splitAt(X1, X2) -> splitAt#(proper X1, proper X2)) (proper# fst X -> proper# X, proper# snd X -> proper# X) (proper# fst X -> proper# X, proper# snd X -> snd# proper X) (proper# fst X -> proper# X, proper# pair(X1, X2) -> proper# X2) (proper# fst X -> proper# X, proper# pair(X1, X2) -> proper# X1) (proper# fst X -> proper# X, proper# pair(X1, X2) -> pair#(proper X1, proper X2)) (proper# fst X -> proper# X, proper# fst X -> proper# X) (proper# fst X -> proper# X, proper# fst X -> fst# proper X) (proper# fst X -> proper# X, proper# s X -> proper# X) (proper# fst X -> proper# X, proper# s X -> s# proper X) (proper# fst X -> proper# X, proper# natsFrom X -> proper# X) (proper# fst X -> proper# X, proper# natsFrom X -> natsFrom# proper X) (proper# fst X -> proper# X, proper# cons(X1, X2) -> proper# X2) (proper# fst X -> proper# X, proper# cons(X1, X2) -> proper# X1) (proper# fst X -> proper# X, proper# cons(X1, X2) -> cons#(proper X1, proper X2)) (proper# head X -> proper# X, proper# take(X1, X2) -> proper# X2) (proper# head X -> proper# X, proper# take(X1, X2) -> proper# X1) (proper# head X -> proper# X, proper# take(X1, X2) -> take#(proper X1, proper X2)) (proper# head X -> proper# X, proper# sel(X1, X2) -> proper# X2) (proper# head X -> proper# X, proper# sel(X1, X2) -> proper# X1) (proper# head X -> proper# X, proper# sel(X1, X2) -> sel#(proper X1, proper X2)) (proper# head X -> proper# X, proper# afterNth(X1, X2) -> proper# X2) (proper# head X -> proper# X, proper# afterNth(X1, X2) -> proper# X1) (proper# head X -> proper# X, proper# afterNth(X1, X2) -> afterNth#(proper X1, proper X2)) (proper# head X -> proper# X, proper# tail X -> proper# X) (proper# head X -> proper# X, proper# tail X -> tail# proper X) (proper# head X -> proper# X, proper# head X -> proper# X) (proper# head X -> proper# X, proper# head X -> head# proper X) (proper# head X -> proper# X, proper# u(X1, X2, X3, X4) -> proper# X4) (proper# head X -> proper# X, proper# u(X1, X2, X3, X4) -> proper# X3) (proper# head X -> proper# X, proper# u(X1, X2, X3, X4) -> proper# X2) (proper# head X -> proper# X, proper# u(X1, X2, X3, X4) -> proper# X1) (proper# head X -> proper# X, proper# u(X1, X2, X3, X4) -> u#(proper X1, proper X2, proper X3, proper X4)) (proper# head X -> proper# X, proper# splitAt(X1, X2) -> proper# X2) (proper# head X -> proper# X, proper# splitAt(X1, X2) -> proper# X1) (proper# head X -> proper# X, proper# splitAt(X1, X2) -> splitAt#(proper X1, proper X2)) (proper# head X -> proper# X, proper# snd X -> proper# X) (proper# head X -> proper# X, proper# snd X -> snd# proper X) (proper# head X -> proper# X, proper# pair(X1, X2) -> proper# X2) (proper# head X -> proper# X, proper# pair(X1, X2) -> proper# X1) (proper# head X -> proper# X, proper# pair(X1, X2) -> pair#(proper X1, proper X2)) (proper# head X -> proper# X, proper# fst X -> proper# X) (proper# head X -> proper# X, proper# fst X -> fst# proper X) (proper# head X -> proper# X, proper# s X -> proper# X) (proper# head X -> proper# X, proper# s X -> s# proper X) (proper# head X -> proper# X, proper# natsFrom X -> proper# X) (proper# head X -> proper# X, proper# natsFrom X -> natsFrom# proper X) (proper# head X -> proper# X, proper# cons(X1, X2) -> proper# X2) (proper# head X -> proper# X, proper# cons(X1, X2) -> proper# X1) (proper# head X -> proper# X, proper# cons(X1, X2) -> cons#(proper X1, proper X2)) (top# mark X -> proper# X, proper# take(X1, X2) -> proper# X2) (top# mark X -> proper# X, proper# take(X1, X2) -> proper# X1) (top# mark X -> proper# X, proper# take(X1, X2) -> take#(proper X1, proper X2)) (top# mark X -> proper# X, proper# sel(X1, X2) -> proper# X2) (top# mark X -> proper# X, proper# sel(X1, X2) -> proper# X1) (top# mark X -> proper# X, proper# sel(X1, X2) -> sel#(proper X1, proper X2)) (top# mark X -> proper# X, proper# afterNth(X1, X2) -> proper# X2) (top# mark X -> proper# X, proper# afterNth(X1, X2) -> proper# X1) (top# mark X -> proper# X, proper# afterNth(X1, X2) -> afterNth#(proper X1, proper X2)) (top# mark X -> proper# X, proper# tail X -> proper# X) (top# mark X -> proper# X, proper# tail X -> tail# proper X) (top# mark X -> proper# X, proper# head X -> proper# X) (top# mark X -> proper# X, proper# head X -> head# proper X) (top# mark X -> proper# X, proper# u(X1, X2, X3, X4) -> proper# X4) (top# mark X -> proper# X, proper# u(X1, X2, X3, X4) -> proper# X3) (top# mark X -> proper# X, proper# u(X1, X2, X3, X4) -> proper# X2) (top# mark X -> proper# X, proper# u(X1, X2, X3, X4) -> proper# X1) (top# mark X -> proper# X, proper# u(X1, X2, X3, X4) -> u#(proper X1, proper X2, proper X3, proper X4)) (top# mark X -> proper# X, proper# splitAt(X1, X2) -> proper# X2) (top# mark X -> proper# X, proper# splitAt(X1, X2) -> proper# X1) (top# mark X -> proper# X, proper# splitAt(X1, X2) -> splitAt#(proper X1, proper X2)) (top# mark X -> proper# X, proper# snd X -> proper# X) (top# mark X -> proper# X, proper# snd X -> snd# proper X) (top# mark X -> proper# X, proper# pair(X1, X2) -> proper# X2) (top# mark X -> proper# X, proper# pair(X1, X2) -> proper# X1) (top# mark X -> proper# X, proper# pair(X1, X2) -> pair#(proper X1, proper X2)) (top# mark X -> proper# X, proper# fst X -> proper# X) (top# mark X -> proper# X, proper# fst X -> fst# proper X) (top# mark X -> proper# X, proper# s X -> proper# X) (top# mark X -> proper# X, proper# s X -> s# proper X) (top# mark X -> proper# X, proper# natsFrom X -> proper# X) (top# mark X -> proper# X, proper# natsFrom X -> natsFrom# proper X) (top# mark X -> proper# X, proper# cons(X1, X2) -> proper# X2) (top# mark X -> proper# X, proper# cons(X1, X2) -> proper# X1) (top# mark X -> proper# X, proper# cons(X1, X2) -> cons#(proper X1, proper X2)) (active# natsFrom X -> natsFrom# active X, natsFrom# ok X -> natsFrom# X) (active# natsFrom X -> natsFrom# active X, natsFrom# mark X -> natsFrom# X) (active# fst X -> fst# active X, fst# ok X -> fst# X) (active# fst X -> fst# active X, fst# mark X -> fst# X) (active# head X -> head# active X, head# ok X -> head# X) (active# head X -> head# active X, head# mark X -> head# X) (proper# natsFrom X -> natsFrom# proper X, natsFrom# ok X -> natsFrom# X) (proper# natsFrom X -> natsFrom# proper X, natsFrom# mark X -> natsFrom# X) (proper# fst X -> fst# proper X, fst# ok X -> fst# X) (proper# fst X -> fst# proper X, fst# mark X -> fst# X) (proper# head X -> head# proper X, head# ok X -> head# X) (proper# head X -> head# proper X, head# mark X -> head# X) (top# mark X -> top# proper X, top# ok X -> top# active X) (top# mark X -> top# proper X, top# ok X -> active# X) (top# mark X -> top# proper X, top# mark X -> top# proper X) (top# mark X -> top# proper X, top# mark X -> proper# X) (active# natsFrom N -> natsFrom# s N, natsFrom# ok X -> natsFrom# X) (active# natsFrom N -> natsFrom# s N, natsFrom# mark X -> natsFrom# X) (u#(mark X1, X2, X3, X4) -> u#(X1, X2, X3, X4), u#(ok X1, ok X2, ok X3, ok X4) -> u#(X1, X2, X3, X4)) (u#(mark X1, X2, X3, X4) -> u#(X1, X2, X3, X4), u#(mark X1, X2, X3, X4) -> u#(X1, X2, X3, X4)) (active# cons(X1, X2) -> active# X1, active# take(X1, X2) -> take#(active X1, X2)) (active# cons(X1, X2) -> active# X1, active# take(X1, X2) -> take#(X1, active X2)) (active# cons(X1, X2) -> active# X1, active# take(X1, X2) -> active# X2) (active# cons(X1, X2) -> active# X1, active# take(X1, X2) -> active# X1) (active# cons(X1, X2) -> active# X1, active# take(N, XS) -> splitAt#(N, XS)) (active# cons(X1, X2) -> active# X1, active# take(N, XS) -> fst# splitAt(N, XS)) (active# cons(X1, X2) -> active# X1, active# sel(X1, X2) -> sel#(active X1, X2)) (active# cons(X1, X2) -> active# X1, active# sel(X1, X2) -> sel#(X1, active X2)) (active# cons(X1, X2) -> active# X1, active# sel(X1, X2) -> active# X2) (active# cons(X1, X2) -> active# X1, active# sel(X1, X2) -> active# X1) (active# cons(X1, X2) -> active# X1, active# sel(N, XS) -> afterNth#(N, XS)) (active# cons(X1, X2) -> active# X1, active# sel(N, XS) -> head# afterNth(N, XS)) (active# cons(X1, X2) -> active# X1, active# afterNth(X1, X2) -> afterNth#(active X1, X2)) (active# cons(X1, X2) -> active# X1, active# afterNth(X1, X2) -> afterNth#(X1, active X2)) (active# cons(X1, X2) -> active# X1, active# afterNth(X1, X2) -> active# X2) (active# cons(X1, X2) -> active# X1, active# afterNth(X1, X2) -> active# X1) (active# cons(X1, X2) -> active# X1, active# afterNth(N, XS) -> splitAt#(N, XS)) (active# cons(X1, X2) -> active# X1, active# afterNth(N, XS) -> snd# splitAt(N, XS)) (active# cons(X1, X2) -> active# X1, active# tail X -> tail# active X) (active# cons(X1, X2) -> active# X1, active# tail X -> active# X) (active# cons(X1, X2) -> active# X1, active# head X -> head# active X) (active# cons(X1, X2) -> active# X1, active# head X -> active# X) (active# cons(X1, X2) -> active# X1, active# u(pair(YS, ZS), N, X, XS) -> pair#(cons(X, YS), ZS)) (active# cons(X1, X2) -> active# X1, active# u(pair(YS, ZS), N, X, XS) -> cons#(X, YS)) (active# cons(X1, X2) -> active# X1, active# u(X1, X2, X3, X4) -> u#(active X1, X2, X3, X4)) (active# cons(X1, X2) -> active# X1, active# u(X1, X2, X3, X4) -> active# X1) (active# cons(X1, X2) -> active# X1, active# splitAt(0(), XS) -> pair#(nil(), XS)) (active# cons(X1, X2) -> active# X1, active# splitAt(s N, cons(X, XS)) -> u#(splitAt(N, XS), N, X, XS)) (active# cons(X1, X2) -> active# X1, active# splitAt(s N, cons(X, XS)) -> splitAt#(N, XS)) (active# cons(X1, X2) -> active# X1, active# splitAt(X1, X2) -> splitAt#(active X1, X2)) (active# cons(X1, X2) -> active# X1, active# splitAt(X1, X2) -> splitAt#(X1, active X2)) (active# cons(X1, X2) -> active# X1, active# splitAt(X1, X2) -> active# X2) (active# cons(X1, X2) -> active# X1, active# splitAt(X1, X2) -> active# X1) (active# cons(X1, X2) -> active# X1, active# snd X -> snd# active X) (active# cons(X1, X2) -> active# X1, active# snd X -> active# X) (active# cons(X1, X2) -> active# X1, active# pair(X1, X2) -> pair#(active X1, X2)) (active# cons(X1, X2) -> active# X1, active# pair(X1, X2) -> pair#(X1, active X2)) (active# cons(X1, X2) -> active# X1, active# pair(X1, X2) -> active# X2) (active# cons(X1, X2) -> active# X1, active# pair(X1, X2) -> active# X1) (active# cons(X1, X2) -> active# X1, active# fst X -> fst# active X) (active# cons(X1, X2) -> active# X1, active# fst X -> active# X) (active# cons(X1, X2) -> active# X1, active# s X -> active# X) (active# cons(X1, X2) -> active# X1, active# s X -> s# active X) (active# cons(X1, X2) -> active# X1, active# natsFrom X -> active# X) (active# cons(X1, X2) -> active# X1, active# natsFrom X -> natsFrom# active X) (active# cons(X1, X2) -> active# X1, active# natsFrom N -> s# N) (active# cons(X1, X2) -> active# X1, active# natsFrom N -> natsFrom# s N) (active# cons(X1, X2) -> active# X1, active# natsFrom N -> cons#(N, natsFrom s N)) (active# cons(X1, X2) -> active# X1, active# cons(X1, X2) -> active# X1) (active# cons(X1, X2) -> active# X1, active# cons(X1, X2) -> cons#(active X1, X2)) (active# splitAt(X1, X2) -> active# X1, active# take(X1, X2) -> take#(active X1, X2)) (active# splitAt(X1, X2) -> active# X1, active# take(X1, X2) -> take#(X1, active X2)) (active# splitAt(X1, X2) -> active# X1, active# take(X1, X2) -> active# X2) (active# splitAt(X1, X2) -> active# X1, active# take(X1, X2) -> active# X1) (active# splitAt(X1, X2) -> active# X1, active# take(N, XS) -> splitAt#(N, XS)) (active# splitAt(X1, X2) -> active# X1, active# take(N, XS) -> fst# splitAt(N, XS)) (active# splitAt(X1, X2) -> active# X1, active# sel(X1, X2) -> sel#(active X1, X2)) (active# splitAt(X1, X2) -> active# X1, active# sel(X1, X2) -> sel#(X1, active X2)) (active# splitAt(X1, X2) -> active# X1, active# sel(X1, X2) -> active# X2) (active# splitAt(X1, X2) -> active# X1, active# sel(X1, X2) -> active# X1) (active# splitAt(X1, X2) -> active# X1, active# sel(N, XS) -> afterNth#(N, XS)) (active# splitAt(X1, X2) -> active# X1, active# sel(N, XS) -> head# afterNth(N, XS)) (active# splitAt(X1, X2) -> active# X1, active# afterNth(X1, X2) -> afterNth#(active X1, X2)) (active# splitAt(X1, X2) -> active# X1, active# afterNth(X1, X2) -> afterNth#(X1, active X2)) (active# splitAt(X1, X2) -> active# X1, active# afterNth(X1, X2) -> active# X2) (active# splitAt(X1, X2) -> active# X1, active# afterNth(X1, X2) -> active# X1) (active# splitAt(X1, X2) -> active# X1, active# afterNth(N, XS) -> splitAt#(N, XS)) (active# splitAt(X1, X2) -> active# X1, active# afterNth(N, XS) -> snd# splitAt(N, XS)) (active# splitAt(X1, X2) -> active# X1, active# tail X -> tail# active X) (active# splitAt(X1, X2) -> active# X1, active# tail X -> active# X) (active# splitAt(X1, X2) -> active# X1, active# head X -> head# active X) (active# splitAt(X1, X2) -> active# X1, active# head X -> active# X) (active# splitAt(X1, X2) -> active# X1, active# u(pair(YS, ZS), N, X, XS) -> pair#(cons(X, YS), ZS)) (active# splitAt(X1, X2) -> active# X1, active# u(pair(YS, ZS), N, X, XS) -> cons#(X, YS)) (active# splitAt(X1, X2) -> active# X1, active# u(X1, X2, X3, X4) -> u#(active X1, X2, X3, X4)) (active# splitAt(X1, X2) -> active# X1, active# u(X1, X2, X3, X4) -> active# X1) (active# splitAt(X1, X2) -> active# X1, active# splitAt(0(), XS) -> pair#(nil(), XS)) (active# splitAt(X1, X2) -> active# X1, active# splitAt(s N, cons(X, XS)) -> u#(splitAt(N, XS), N, X, XS)) (active# splitAt(X1, X2) -> active# X1, active# splitAt(s N, cons(X, XS)) -> splitAt#(N, XS)) (active# splitAt(X1, X2) -> active# X1, active# splitAt(X1, X2) -> splitAt#(active X1, X2)) (active# splitAt(X1, X2) -> active# X1, active# splitAt(X1, X2) -> splitAt#(X1, active X2)) (active# splitAt(X1, X2) -> active# X1, active# splitAt(X1, X2) -> active# X2) (active# splitAt(X1, X2) -> active# X1, active# splitAt(X1, X2) -> active# X1) (active# splitAt(X1, X2) -> active# X1, active# snd X -> snd# active X) (active# splitAt(X1, X2) -> active# X1, active# snd X -> active# X) (active# splitAt(X1, X2) -> active# X1, active# pair(X1, X2) -> pair#(active X1, X2)) (active# splitAt(X1, X2) -> active# X1, active# pair(X1, X2) -> pair#(X1, active X2)) (active# splitAt(X1, X2) -> active# X1, active# pair(X1, X2) -> active# X2) (active# splitAt(X1, X2) -> active# X1, active# pair(X1, X2) -> active# X1) (active# splitAt(X1, X2) -> active# X1, active# fst X -> fst# active X) (active# splitAt(X1, X2) -> active# X1, active# fst X -> active# X) (active# splitAt(X1, X2) -> active# X1, active# s X -> active# X) (active# splitAt(X1, X2) -> active# X1, active# s X -> s# active X) (active# splitAt(X1, X2) -> active# X1, active# natsFrom X -> active# X) (active# splitAt(X1, X2) -> active# X1, active# natsFrom X -> natsFrom# active X) (active# splitAt(X1, X2) -> active# X1, active# natsFrom N -> s# N) (active# splitAt(X1, X2) -> active# X1, active# natsFrom N -> natsFrom# s N) (active# splitAt(X1, X2) -> active# X1, active# natsFrom N -> cons#(N, natsFrom s N)) (active# splitAt(X1, X2) -> active# X1, active# cons(X1, X2) -> active# X1) (active# splitAt(X1, X2) -> active# X1, active# cons(X1, X2) -> cons#(active X1, X2)) (active# afterNth(X1, X2) -> active# X1, active# take(X1, X2) -> take#(active X1, X2)) (active# afterNth(X1, X2) -> active# X1, active# take(X1, X2) -> take#(X1, active X2)) (active# afterNth(X1, X2) -> active# X1, active# take(X1, X2) -> active# X2) (active# afterNth(X1, X2) -> active# X1, active# take(X1, X2) -> active# X1) (active# afterNth(X1, X2) -> active# X1, active# take(N, XS) -> splitAt#(N, XS)) (active# afterNth(X1, X2) -> active# X1, active# take(N, XS) -> fst# splitAt(N, XS)) (active# afterNth(X1, X2) -> active# X1, active# sel(X1, X2) -> sel#(active X1, X2)) (active# afterNth(X1, X2) -> active# X1, active# sel(X1, X2) -> sel#(X1, active X2)) (active# afterNth(X1, X2) -> active# X1, active# sel(X1, X2) -> active# X2) (active# afterNth(X1, X2) -> active# X1, active# sel(X1, X2) -> active# X1) (active# afterNth(X1, X2) -> active# X1, active# sel(N, XS) -> afterNth#(N, XS)) (active# afterNth(X1, X2) -> active# X1, active# sel(N, XS) -> head# afterNth(N, XS)) (active# afterNth(X1, X2) -> active# X1, active# afterNth(X1, X2) -> afterNth#(active X1, X2)) (active# afterNth(X1, X2) -> active# X1, active# afterNth(X1, X2) -> afterNth#(X1, active X2)) (active# afterNth(X1, X2) -> active# X1, active# afterNth(X1, X2) -> active# X2) (active# afterNth(X1, X2) -> active# X1, active# afterNth(X1, X2) -> active# X1) (active# afterNth(X1, X2) -> active# X1, active# afterNth(N, XS) -> splitAt#(N, XS)) (active# afterNth(X1, X2) -> active# X1, active# afterNth(N, XS) -> snd# splitAt(N, XS)) (active# afterNth(X1, X2) -> active# X1, active# tail X -> tail# active X) (active# afterNth(X1, X2) -> active# X1, active# tail X -> active# X) (active# afterNth(X1, X2) -> active# X1, active# head X -> head# active X) (active# afterNth(X1, X2) -> active# X1, active# head X -> active# X) (active# afterNth(X1, X2) -> active# X1, active# u(pair(YS, ZS), N, X, XS) -> pair#(cons(X, YS), ZS)) (active# afterNth(X1, X2) -> active# X1, active# u(pair(YS, ZS), N, X, XS) -> cons#(X, YS)) (active# afterNth(X1, X2) -> active# X1, active# u(X1, X2, X3, X4) -> u#(active X1, X2, X3, X4)) (active# afterNth(X1, X2) -> active# X1, active# u(X1, X2, X3, X4) -> active# X1) (active# afterNth(X1, X2) -> active# X1, active# splitAt(0(), XS) -> pair#(nil(), XS)) (active# afterNth(X1, X2) -> active# X1, active# splitAt(s N, cons(X, XS)) -> u#(splitAt(N, XS), N, X, XS)) (active# afterNth(X1, X2) -> active# X1, active# splitAt(s N, cons(X, XS)) -> splitAt#(N, XS)) (active# afterNth(X1, X2) -> active# X1, active# splitAt(X1, X2) -> splitAt#(active X1, X2)) (active# afterNth(X1, X2) -> active# X1, active# splitAt(X1, X2) -> splitAt#(X1, active X2)) (active# afterNth(X1, X2) -> active# X1, active# splitAt(X1, X2) -> active# X2) (active# afterNth(X1, X2) -> active# X1, active# splitAt(X1, X2) -> active# X1) (active# afterNth(X1, X2) -> active# X1, active# snd X -> snd# active X) (active# afterNth(X1, X2) -> active# X1, active# snd X -> active# X) (active# afterNth(X1, X2) -> active# X1, active# pair(X1, X2) -> pair#(active X1, X2)) (active# afterNth(X1, X2) -> active# X1, active# pair(X1, X2) -> pair#(X1, active X2)) (active# afterNth(X1, X2) -> active# X1, active# pair(X1, X2) -> active# X2) (active# afterNth(X1, X2) -> active# X1, active# pair(X1, X2) -> active# X1) (active# afterNth(X1, X2) -> active# X1, active# fst X -> fst# active X) (active# afterNth(X1, X2) -> active# X1, active# fst X -> active# X) (active# afterNth(X1, X2) -> active# X1, active# s X -> active# X) (active# afterNth(X1, X2) -> active# X1, active# s X -> s# active X) (active# afterNth(X1, X2) -> active# X1, active# natsFrom X -> active# X) (active# afterNth(X1, X2) -> active# X1, active# natsFrom X -> natsFrom# active X) (active# afterNth(X1, X2) -> active# X1, active# natsFrom N -> s# N) (active# afterNth(X1, X2) -> active# X1, active# natsFrom N -> natsFrom# s N) (active# afterNth(X1, X2) -> active# X1, active# natsFrom N -> cons#(N, natsFrom s N)) (active# afterNth(X1, X2) -> active# X1, active# cons(X1, X2) -> active# X1) (active# afterNth(X1, X2) -> active# X1, active# cons(X1, X2) -> cons#(active X1, X2)) (active# take(X1, X2) -> active# X1, active# take(X1, X2) -> take#(active X1, X2)) (active# take(X1, X2) -> active# X1, active# take(X1, X2) -> take#(X1, active X2)) (active# take(X1, X2) -> active# X1, active# take(X1, X2) -> active# X2) (active# take(X1, X2) -> active# X1, active# take(X1, X2) -> active# X1) (active# take(X1, X2) -> active# X1, active# take(N, XS) -> splitAt#(N, XS)) (active# take(X1, X2) -> active# X1, active# take(N, XS) -> fst# splitAt(N, XS)) (active# take(X1, X2) -> active# X1, active# sel(X1, X2) -> sel#(active X1, X2)) (active# take(X1, X2) -> active# X1, active# sel(X1, X2) -> sel#(X1, active X2)) (active# take(X1, X2) -> active# X1, active# sel(X1, X2) -> active# X2) (active# take(X1, X2) -> active# X1, active# sel(X1, X2) -> active# X1) (active# take(X1, X2) -> active# X1, active# sel(N, XS) -> afterNth#(N, XS)) (active# take(X1, X2) -> active# X1, active# sel(N, XS) -> head# afterNth(N, XS)) (active# take(X1, X2) -> active# X1, active# afterNth(X1, X2) -> afterNth#(active X1, X2)) (active# take(X1, X2) -> active# X1, active# afterNth(X1, X2) -> afterNth#(X1, active X2)) (active# take(X1, X2) -> active# X1, active# afterNth(X1, X2) -> active# X2) (active# take(X1, X2) -> active# X1, active# afterNth(X1, X2) -> active# X1) (active# take(X1, X2) -> active# X1, active# afterNth(N, XS) -> splitAt#(N, XS)) (active# take(X1, X2) -> active# X1, active# afterNth(N, XS) -> snd# splitAt(N, XS)) (active# take(X1, X2) -> active# X1, active# tail X -> tail# active X) (active# take(X1, X2) -> active# X1, active# tail X -> active# X) (active# take(X1, X2) -> active# X1, active# head X -> head# active X) (active# take(X1, X2) -> active# X1, active# head X -> active# X) (active# take(X1, X2) -> active# X1, active# u(pair(YS, ZS), N, X, XS) -> pair#(cons(X, YS), ZS)) (active# take(X1, X2) -> active# X1, active# u(pair(YS, ZS), N, X, XS) -> cons#(X, YS)) (active# take(X1, X2) -> active# X1, active# u(X1, X2, X3, X4) -> u#(active X1, X2, X3, X4)) (active# take(X1, X2) -> active# X1, active# u(X1, X2, X3, X4) -> active# X1) (active# take(X1, X2) -> active# X1, active# splitAt(0(), XS) -> pair#(nil(), XS)) (active# take(X1, X2) -> active# X1, active# splitAt(s N, cons(X, XS)) -> u#(splitAt(N, XS), N, X, XS)) (active# take(X1, X2) -> active# X1, active# splitAt(s N, cons(X, XS)) -> splitAt#(N, XS)) (active# take(X1, X2) -> active# X1, active# splitAt(X1, X2) -> splitAt#(active X1, X2)) (active# take(X1, X2) -> active# X1, active# splitAt(X1, X2) -> splitAt#(X1, active X2)) (active# take(X1, X2) -> active# X1, active# splitAt(X1, X2) -> active# X2) (active# take(X1, X2) -> active# X1, active# splitAt(X1, X2) -> active# X1) (active# take(X1, X2) -> active# X1, active# snd X -> snd# active X) (active# take(X1, X2) -> active# X1, active# snd X -> active# X) (active# take(X1, X2) -> active# X1, active# pair(X1, X2) -> pair#(active X1, X2)) (active# take(X1, X2) -> active# X1, active# pair(X1, X2) -> pair#(X1, active X2)) (active# take(X1, X2) -> active# X1, active# pair(X1, X2) -> active# X2) (active# take(X1, X2) -> active# X1, active# pair(X1, X2) -> active# X1) (active# take(X1, X2) -> active# X1, active# fst X -> fst# active X) (active# take(X1, X2) -> active# X1, active# fst X -> active# X) (active# take(X1, X2) -> active# X1, active# s X -> active# X) (active# take(X1, X2) -> active# X1, active# s X -> s# active X) (active# take(X1, X2) -> active# X1, active# natsFrom X -> active# X) (active# take(X1, X2) -> active# X1, active# natsFrom X -> natsFrom# active X) (active# take(X1, X2) -> active# X1, active# natsFrom N -> s# N) (active# take(X1, X2) -> active# X1, active# natsFrom N -> natsFrom# s N) (active# take(X1, X2) -> active# X1, active# natsFrom N -> cons#(N, natsFrom s N)) (active# take(X1, X2) -> active# X1, active# cons(X1, X2) -> active# X1) (active# take(X1, X2) -> active# X1, active# cons(X1, X2) -> cons#(active X1, X2)) (proper# pair(X1, X2) -> proper# X1, proper# take(X1, X2) -> proper# X2) (proper# pair(X1, X2) -> proper# X1, proper# take(X1, X2) -> proper# X1) (proper# pair(X1, X2) -> proper# X1, proper# take(X1, X2) -> take#(proper X1, proper X2)) (proper# pair(X1, X2) -> proper# X1, proper# sel(X1, X2) -> proper# X2) (proper# pair(X1, X2) -> proper# X1, proper# sel(X1, X2) -> proper# X1) (proper# pair(X1, X2) -> proper# X1, proper# sel(X1, X2) -> sel#(proper X1, proper X2)) (proper# pair(X1, X2) -> proper# X1, proper# afterNth(X1, X2) -> proper# X2) (proper# pair(X1, X2) -> proper# X1, proper# afterNth(X1, X2) -> proper# X1) (proper# pair(X1, X2) -> proper# X1, proper# afterNth(X1, X2) -> afterNth#(proper X1, proper X2)) (proper# pair(X1, X2) -> proper# X1, proper# tail X -> proper# X) (proper# pair(X1, X2) -> proper# X1, proper# tail X -> tail# proper X) (proper# pair(X1, X2) -> proper# X1, proper# head X -> proper# X) (proper# pair(X1, X2) -> proper# X1, proper# head X -> head# proper X) (proper# pair(X1, X2) -> proper# X1, proper# u(X1, X2, X3, X4) -> proper# X4) (proper# pair(X1, X2) -> proper# X1, proper# u(X1, X2, X3, X4) -> proper# X3) (proper# pair(X1, X2) -> proper# X1, proper# u(X1, X2, X3, X4) -> proper# X2) (proper# pair(X1, X2) -> proper# X1, proper# u(X1, X2, X3, X4) -> proper# X1) (proper# pair(X1, X2) -> proper# X1, proper# u(X1, X2, X3, X4) -> u#(proper X1, proper X2, proper X3, proper X4)) (proper# pair(X1, X2) -> proper# X1, proper# splitAt(X1, X2) -> proper# X2) (proper# pair(X1, X2) -> proper# X1, proper# splitAt(X1, X2) -> proper# X1) (proper# pair(X1, X2) -> proper# X1, proper# splitAt(X1, X2) -> splitAt#(proper X1, proper X2)) (proper# pair(X1, X2) -> proper# X1, proper# snd X -> proper# X) (proper# pair(X1, X2) -> proper# X1, proper# snd X -> snd# proper X) (proper# pair(X1, X2) -> proper# X1, proper# pair(X1, X2) -> proper# X2) (proper# pair(X1, X2) -> proper# X1, proper# pair(X1, X2) -> proper# X1) (proper# pair(X1, X2) -> proper# X1, proper# pair(X1, X2) -> pair#(proper X1, proper X2)) (proper# pair(X1, X2) -> proper# X1, proper# fst X -> proper# X) (proper# pair(X1, X2) -> proper# X1, proper# fst X -> fst# proper X) (proper# pair(X1, X2) -> proper# X1, proper# s X -> proper# X) (proper# pair(X1, X2) -> proper# X1, proper# s X -> s# proper X) (proper# pair(X1, X2) -> proper# X1, proper# natsFrom X -> proper# X) (proper# pair(X1, X2) -> proper# X1, proper# natsFrom X -> natsFrom# proper X) (proper# pair(X1, X2) -> proper# X1, proper# cons(X1, X2) -> proper# X2) (proper# pair(X1, X2) -> proper# X1, proper# cons(X1, X2) -> proper# X1) (proper# pair(X1, X2) -> proper# X1, proper# cons(X1, X2) -> cons#(proper X1, proper X2)) (proper# u(X1, X2, X3, X4) -> proper# X1, proper# take(X1, X2) -> proper# X2) (proper# u(X1, X2, X3, X4) -> proper# X1, proper# take(X1, X2) -> proper# X1) (proper# u(X1, X2, X3, X4) -> proper# X1, proper# take(X1, X2) -> take#(proper X1, proper X2)) (proper# u(X1, X2, X3, X4) -> proper# X1, proper# sel(X1, X2) -> proper# X2) (proper# u(X1, X2, X3, X4) -> proper# X1, proper# sel(X1, X2) -> proper# X1) (proper# u(X1, X2, X3, X4) -> proper# X1, proper# sel(X1, X2) -> sel#(proper X1, proper X2)) (proper# u(X1, X2, X3, X4) -> proper# X1, proper# afterNth(X1, X2) -> proper# X2) (proper# u(X1, X2, X3, X4) -> proper# X1, proper# afterNth(X1, X2) -> proper# X1) (proper# u(X1, X2, X3, X4) -> proper# X1, proper# afterNth(X1, X2) -> afterNth#(proper X1, proper X2)) (proper# u(X1, X2, X3, X4) -> proper# X1, proper# tail X -> proper# X) (proper# u(X1, X2, X3, X4) -> proper# X1, proper# tail X -> tail# proper X) (proper# u(X1, X2, X3, X4) -> proper# X1, proper# head X -> proper# X) (proper# u(X1, X2, X3, X4) -> proper# X1, proper# head X -> head# proper X) (proper# u(X1, X2, X3, X4) -> proper# X1, proper# u(X1, X2, X3, X4) -> proper# X4) (proper# u(X1, X2, X3, X4) -> proper# X1, proper# u(X1, X2, X3, X4) -> proper# X3) (proper# u(X1, X2, X3, X4) -> proper# X1, proper# u(X1, X2, X3, X4) -> proper# X2) (proper# u(X1, X2, X3, X4) -> proper# X1, proper# u(X1, X2, X3, X4) -> proper# X1) (proper# u(X1, X2, X3, X4) -> proper# X1, proper# u(X1, X2, X3, X4) -> u#(proper X1, proper X2, proper X3, proper X4)) (proper# u(X1, X2, X3, X4) -> proper# X1, proper# splitAt(X1, X2) -> proper# X2) (proper# u(X1, X2, X3, X4) -> proper# X1, proper# splitAt(X1, X2) -> proper# X1) (proper# u(X1, X2, X3, X4) -> proper# X1, proper# splitAt(X1, X2) -> splitAt#(proper X1, proper X2)) (proper# u(X1, X2, X3, X4) -> proper# X1, proper# snd X -> proper# X) (proper# u(X1, X2, X3, X4) -> proper# X1, proper# snd X -> snd# proper X) (proper# u(X1, X2, X3, X4) -> proper# X1, proper# pair(X1, X2) -> proper# X2) (proper# u(X1, X2, X3, X4) -> proper# X1, proper# pair(X1, X2) -> proper# X1) (proper# u(X1, X2, X3, X4) -> proper# X1, proper# pair(X1, X2) -> pair#(proper X1, proper X2)) (proper# u(X1, X2, X3, X4) -> proper# X1, proper# fst X -> proper# X) (proper# u(X1, X2, X3, X4) -> proper# X1, proper# fst X -> fst# proper X) (proper# u(X1, X2, X3, X4) -> proper# X1, proper# s X -> proper# X) (proper# u(X1, X2, X3, X4) -> proper# X1, proper# s X -> s# proper X) (proper# u(X1, X2, X3, X4) -> proper# X1, proper# natsFrom X -> proper# X) (proper# u(X1, X2, X3, X4) -> proper# X1, proper# natsFrom X -> natsFrom# proper X) (proper# u(X1, X2, X3, X4) -> proper# X1, proper# cons(X1, X2) -> proper# X2) (proper# u(X1, X2, X3, X4) -> proper# X1, proper# cons(X1, X2) -> proper# X1) (proper# u(X1, X2, X3, X4) -> proper# X1, proper# cons(X1, X2) -> cons#(proper X1, proper X2)) (proper# sel(X1, X2) -> proper# X1, proper# take(X1, X2) -> proper# X2) (proper# sel(X1, X2) -> proper# X1, proper# take(X1, X2) -> proper# X1) (proper# sel(X1, X2) -> proper# X1, proper# take(X1, X2) -> take#(proper X1, proper X2)) (proper# sel(X1, X2) -> proper# X1, proper# sel(X1, X2) -> proper# X2) (proper# sel(X1, X2) -> proper# X1, proper# sel(X1, X2) -> proper# X1) (proper# sel(X1, X2) -> proper# X1, proper# sel(X1, X2) -> sel#(proper X1, proper X2)) (proper# sel(X1, X2) -> proper# X1, proper# afterNth(X1, X2) -> proper# X2) (proper# sel(X1, X2) -> proper# X1, proper# afterNth(X1, X2) -> proper# X1) (proper# sel(X1, X2) -> proper# X1, proper# afterNth(X1, X2) -> afterNth#(proper X1, proper X2)) (proper# sel(X1, X2) -> proper# X1, proper# tail X -> proper# X) (proper# sel(X1, X2) -> proper# X1, proper# tail X -> tail# proper X) (proper# sel(X1, X2) -> proper# X1, proper# head X -> proper# X) (proper# sel(X1, X2) -> proper# X1, proper# head X -> head# proper X) (proper# sel(X1, X2) -> proper# X1, proper# u(X1, X2, X3, X4) -> proper# X4) (proper# sel(X1, X2) -> proper# X1, proper# u(X1, X2, X3, X4) -> proper# X3) (proper# sel(X1, X2) -> proper# X1, proper# u(X1, X2, X3, X4) -> proper# X2) (proper# sel(X1, X2) -> proper# X1, proper# u(X1, X2, X3, X4) -> proper# X1) (proper# sel(X1, X2) -> proper# X1, proper# u(X1, X2, X3, X4) -> u#(proper X1, proper X2, proper X3, proper X4)) (proper# sel(X1, X2) -> proper# X1, proper# splitAt(X1, X2) -> proper# X2) (proper# sel(X1, X2) -> proper# X1, proper# splitAt(X1, X2) -> proper# X1) (proper# sel(X1, X2) -> proper# X1, proper# splitAt(X1, X2) -> splitAt#(proper X1, proper X2)) (proper# sel(X1, X2) -> proper# X1, proper# snd X -> proper# X) (proper# sel(X1, X2) -> proper# X1, proper# snd X -> snd# proper X) (proper# sel(X1, X2) -> proper# X1, proper# pair(X1, X2) -> proper# X2) (proper# sel(X1, X2) -> proper# X1, proper# pair(X1, X2) -> proper# X1) (proper# sel(X1, X2) -> proper# X1, proper# pair(X1, X2) -> pair#(proper X1, proper X2)) (proper# sel(X1, X2) -> proper# X1, proper# fst X -> proper# X) (proper# sel(X1, X2) -> proper# X1, proper# fst X -> fst# proper X) (proper# sel(X1, X2) -> proper# X1, proper# s X -> proper# X) (proper# sel(X1, X2) -> proper# X1, proper# s X -> s# proper X) (proper# sel(X1, X2) -> proper# X1, proper# natsFrom X -> proper# X) (proper# sel(X1, X2) -> proper# X1, proper# natsFrom X -> natsFrom# proper X) (proper# sel(X1, X2) -> proper# X1, proper# cons(X1, X2) -> proper# X2) (proper# sel(X1, X2) -> proper# X1, proper# cons(X1, X2) -> proper# X1) (proper# sel(X1, X2) -> proper# X1, proper# cons(X1, X2) -> cons#(proper X1, proper X2)) (active# splitAt(s N, cons(X, XS)) -> splitAt#(N, XS), splitAt#(ok X1, ok X2) -> splitAt#(X1, X2)) (active# splitAt(s N, cons(X, XS)) -> splitAt#(N, XS), splitAt#(mark X1, X2) -> splitAt#(X1, X2)) (active# splitAt(s N, cons(X, XS)) -> splitAt#(N, XS), splitAt#(X1, mark X2) -> splitAt#(X1, X2)) (active# afterNth(N, XS) -> splitAt#(N, XS), splitAt#(ok X1, ok X2) -> splitAt#(X1, X2)) (active# afterNth(N, XS) -> splitAt#(N, XS), splitAt#(mark X1, X2) -> splitAt#(X1, X2)) (active# afterNth(N, XS) -> splitAt#(N, XS), splitAt#(X1, mark X2) -> splitAt#(X1, X2)) (active# take(N, XS) -> splitAt#(N, XS), splitAt#(ok X1, ok X2) -> splitAt#(X1, X2)) (active# take(N, XS) -> splitAt#(N, XS), splitAt#(mark X1, X2) -> splitAt#(X1, X2)) (active# take(N, XS) -> splitAt#(N, XS), splitAt#(X1, mark X2) -> splitAt#(X1, X2)) (active# sel(N, XS) -> afterNth#(N, XS), afterNth#(X1, mark X2) -> afterNth#(X1, X2)) (active# sel(N, XS) -> afterNth#(N, XS), afterNth#(mark X1, X2) -> afterNth#(X1, X2)) (active# sel(N, XS) -> afterNth#(N, XS), afterNth#(ok X1, ok X2) -> afterNth#(X1, X2)) (active# splitAt(s N, cons(X, XS)) -> u#(splitAt(N, XS), N, X, XS), u#(mark X1, X2, X3, X4) -> u#(X1, X2, X3, X4)) (active# splitAt(s N, cons(X, XS)) -> u#(splitAt(N, XS), N, X, XS), u#(ok X1, ok X2, ok X3, ok X4) -> u#(X1, X2, X3, X4)) (proper# take(X1, X2) -> proper# X1, proper# cons(X1, X2) -> cons#(proper X1, proper X2)) (proper# take(X1, X2) -> proper# X1, proper# cons(X1, X2) -> proper# X1) (proper# take(X1, X2) -> proper# X1, proper# cons(X1, X2) -> proper# X2) (proper# take(X1, X2) -> proper# X1, proper# natsFrom X -> natsFrom# proper X) (proper# take(X1, X2) -> proper# X1, proper# natsFrom X -> proper# X) (proper# take(X1, X2) -> proper# X1, proper# s X -> s# proper X) (proper# take(X1, X2) -> proper# X1, proper# s X -> proper# X) (proper# take(X1, X2) -> proper# X1, proper# fst X -> fst# proper X) (proper# take(X1, X2) -> proper# X1, proper# fst X -> proper# X) (proper# take(X1, X2) -> proper# X1, proper# pair(X1, X2) -> pair#(proper X1, proper X2)) (proper# take(X1, X2) -> proper# X1, proper# pair(X1, X2) -> proper# X1) (proper# take(X1, X2) -> proper# X1, proper# pair(X1, X2) -> proper# X2) (proper# take(X1, X2) -> proper# X1, proper# snd X -> snd# proper X) (proper# take(X1, X2) -> proper# X1, proper# snd X -> proper# X) (proper# take(X1, X2) -> proper# X1, proper# splitAt(X1, X2) -> splitAt#(proper X1, proper X2)) (proper# take(X1, X2) -> proper# X1, proper# splitAt(X1, X2) -> proper# X1) (proper# take(X1, X2) -> proper# X1, proper# splitAt(X1, X2) -> proper# X2) (proper# take(X1, X2) -> proper# X1, proper# u(X1, X2, X3, X4) -> u#(proper X1, proper X2, proper X3, proper X4)) (proper# take(X1, X2) -> proper# X1, proper# u(X1, X2, X3, X4) -> proper# X1) (proper# take(X1, X2) -> proper# X1, proper# u(X1, X2, X3, X4) -> proper# X2) (proper# take(X1, X2) -> proper# X1, proper# u(X1, X2, X3, X4) -> proper# X3) (proper# take(X1, X2) -> proper# X1, proper# u(X1, X2, X3, X4) -> proper# X4) (proper# take(X1, X2) -> proper# X1, proper# head X -> head# proper X) (proper# take(X1, X2) -> proper# X1, proper# head X -> proper# X) (proper# take(X1, X2) -> proper# X1, proper# tail X -> tail# proper X) (proper# take(X1, X2) -> proper# X1, proper# tail X -> proper# X) (proper# take(X1, X2) -> proper# X1, proper# afterNth(X1, X2) -> afterNth#(proper X1, proper X2)) (proper# take(X1, X2) -> proper# X1, proper# afterNth(X1, X2) -> proper# X1) (proper# take(X1, X2) -> proper# X1, proper# afterNth(X1, X2) -> proper# X2) (proper# take(X1, X2) -> proper# X1, proper# sel(X1, X2) -> sel#(proper X1, proper X2)) (proper# take(X1, X2) -> proper# X1, proper# sel(X1, X2) -> proper# X1) (proper# take(X1, X2) -> proper# X1, proper# sel(X1, X2) -> proper# X2) (proper# take(X1, X2) -> proper# X1, proper# take(X1, X2) -> take#(proper X1, proper X2)) (proper# take(X1, X2) -> proper# X1, proper# take(X1, X2) -> proper# X1) (proper# take(X1, X2) -> proper# X1, proper# take(X1, X2) -> proper# X2) (proper# afterNth(X1, X2) -> proper# X1, proper# cons(X1, X2) -> cons#(proper X1, proper X2)) (proper# afterNth(X1, X2) -> proper# X1, proper# cons(X1, X2) -> proper# X1) (proper# afterNth(X1, X2) -> proper# X1, proper# cons(X1, X2) -> proper# X2) (proper# afterNth(X1, X2) -> proper# X1, proper# natsFrom X -> natsFrom# proper X) (proper# afterNth(X1, X2) -> proper# X1, proper# natsFrom X -> proper# X) (proper# afterNth(X1, X2) -> proper# X1, proper# s X -> s# proper X) (proper# afterNth(X1, X2) -> proper# X1, proper# s X -> proper# X) (proper# afterNth(X1, X2) -> proper# X1, proper# fst X -> fst# proper X) (proper# afterNth(X1, X2) -> proper# X1, proper# fst X -> proper# X) (proper# afterNth(X1, X2) -> proper# X1, proper# pair(X1, X2) -> pair#(proper X1, proper X2)) (proper# afterNth(X1, X2) -> proper# X1, proper# pair(X1, X2) -> proper# X1) (proper# afterNth(X1, X2) -> proper# X1, proper# pair(X1, X2) -> proper# X2) (proper# afterNth(X1, X2) -> proper# X1, proper# snd X -> snd# proper X) (proper# afterNth(X1, X2) -> proper# X1, proper# snd X -> proper# X) (proper# afterNth(X1, X2) -> proper# X1, proper# splitAt(X1, X2) -> splitAt#(proper X1, proper X2)) (proper# afterNth(X1, X2) -> proper# X1, proper# splitAt(X1, X2) -> proper# X1) (proper# afterNth(X1, X2) -> proper# X1, proper# splitAt(X1, X2) -> proper# X2) (proper# afterNth(X1, X2) -> proper# X1, proper# u(X1, X2, X3, X4) -> u#(proper X1, proper X2, proper X3, proper X4)) (proper# afterNth(X1, X2) -> proper# X1, proper# u(X1, X2, X3, X4) -> proper# X1) (proper# afterNth(X1, X2) -> proper# X1, proper# u(X1, X2, X3, X4) -> proper# X2) (proper# afterNth(X1, X2) -> proper# X1, proper# u(X1, X2, X3, X4) -> proper# X3) (proper# afterNth(X1, X2) -> proper# X1, proper# u(X1, X2, X3, X4) -> proper# X4) (proper# afterNth(X1, X2) -> proper# X1, proper# head X -> head# proper X) (proper# afterNth(X1, X2) -> proper# X1, proper# head X -> proper# X) (proper# afterNth(X1, X2) -> proper# X1, proper# tail X -> tail# proper X) (proper# afterNth(X1, X2) -> proper# X1, proper# tail X -> proper# X) (proper# afterNth(X1, X2) -> proper# X1, proper# afterNth(X1, X2) -> afterNth#(proper X1, proper X2)) (proper# afterNth(X1, X2) -> proper# X1, proper# afterNth(X1, X2) -> proper# X1) (proper# afterNth(X1, X2) -> proper# X1, proper# afterNth(X1, X2) -> proper# X2) (proper# afterNth(X1, X2) -> proper# X1, proper# sel(X1, X2) -> sel#(proper X1, proper X2)) (proper# afterNth(X1, X2) -> proper# X1, proper# sel(X1, X2) -> proper# X1) (proper# afterNth(X1, X2) -> proper# X1, proper# sel(X1, X2) -> proper# X2) (proper# afterNth(X1, X2) -> proper# X1, proper# take(X1, X2) -> take#(proper X1, proper X2)) (proper# afterNth(X1, X2) -> proper# X1, proper# take(X1, X2) -> proper# X1) (proper# afterNth(X1, X2) -> proper# X1, proper# take(X1, X2) -> proper# X2) (proper# splitAt(X1, X2) -> proper# X1, proper# cons(X1, X2) -> cons#(proper X1, proper X2)) (proper# splitAt(X1, X2) -> proper# X1, proper# cons(X1, X2) -> proper# X1) (proper# splitAt(X1, X2) -> proper# X1, proper# cons(X1, X2) -> proper# X2) (proper# splitAt(X1, X2) -> proper# X1, proper# natsFrom X -> natsFrom# proper X) (proper# splitAt(X1, X2) -> proper# X1, proper# natsFrom X -> proper# X) (proper# splitAt(X1, X2) -> proper# X1, proper# s X -> s# proper X) (proper# splitAt(X1, X2) -> proper# X1, proper# s X -> proper# X) (proper# splitAt(X1, X2) -> proper# X1, proper# fst X -> fst# proper X) (proper# splitAt(X1, X2) -> proper# X1, proper# fst X -> proper# X) (proper# splitAt(X1, X2) -> proper# X1, proper# pair(X1, X2) -> pair#(proper X1, proper X2)) (proper# splitAt(X1, X2) -> proper# X1, proper# pair(X1, X2) -> proper# X1) (proper# splitAt(X1, X2) -> proper# X1, proper# pair(X1, X2) -> proper# X2) (proper# splitAt(X1, X2) -> proper# X1, proper# snd X -> snd# proper X) (proper# splitAt(X1, X2) -> proper# X1, proper# snd X -> proper# X) (proper# splitAt(X1, X2) -> proper# X1, proper# splitAt(X1, X2) -> splitAt#(proper X1, proper X2)) (proper# splitAt(X1, X2) -> proper# X1, proper# splitAt(X1, X2) -> proper# X1) (proper# splitAt(X1, X2) -> proper# X1, proper# splitAt(X1, X2) -> proper# X2) (proper# splitAt(X1, X2) -> proper# X1, proper# u(X1, X2, X3, X4) -> u#(proper X1, proper X2, proper X3, proper X4)) (proper# splitAt(X1, X2) -> proper# X1, proper# u(X1, X2, X3, X4) -> proper# X1) (proper# splitAt(X1, X2) -> proper# X1, proper# u(X1, X2, X3, X4) -> proper# X2) (proper# splitAt(X1, X2) -> proper# X1, proper# u(X1, X2, X3, X4) -> proper# X3) (proper# splitAt(X1, X2) -> proper# X1, proper# u(X1, X2, X3, X4) -> proper# X4) (proper# splitAt(X1, X2) -> proper# X1, proper# head X -> head# proper X) (proper# splitAt(X1, X2) -> proper# X1, proper# head X -> proper# X) (proper# splitAt(X1, X2) -> proper# X1, proper# tail X -> tail# proper X) (proper# splitAt(X1, X2) -> proper# X1, proper# tail X -> proper# X) (proper# splitAt(X1, X2) -> proper# X1, proper# afterNth(X1, X2) -> afterNth#(proper X1, proper X2)) (proper# splitAt(X1, X2) -> proper# X1, proper# afterNth(X1, X2) -> proper# X1) (proper# splitAt(X1, X2) -> proper# X1, proper# afterNth(X1, X2) -> proper# X2) (proper# splitAt(X1, X2) -> proper# X1, proper# sel(X1, X2) -> sel#(proper X1, proper X2)) (proper# splitAt(X1, X2) -> proper# X1, proper# sel(X1, X2) -> proper# X1) (proper# splitAt(X1, X2) -> proper# X1, proper# sel(X1, X2) -> proper# X2) (proper# splitAt(X1, X2) -> proper# X1, proper# take(X1, X2) -> take#(proper X1, proper X2)) (proper# splitAt(X1, X2) -> proper# X1, proper# take(X1, X2) -> proper# X1) (proper# splitAt(X1, X2) -> proper# X1, proper# take(X1, X2) -> proper# X2) (proper# cons(X1, X2) -> proper# X1, proper# cons(X1, X2) -> cons#(proper X1, proper X2)) (proper# cons(X1, X2) -> proper# X1, proper# cons(X1, X2) -> proper# X1) (proper# cons(X1, X2) -> proper# X1, proper# cons(X1, X2) -> proper# X2) (proper# cons(X1, X2) -> proper# X1, proper# natsFrom X -> natsFrom# proper X) (proper# cons(X1, X2) -> proper# X1, proper# natsFrom X -> proper# X) (proper# cons(X1, X2) -> proper# X1, proper# s X -> s# proper X) (proper# cons(X1, X2) -> proper# X1, proper# s X -> proper# X) (proper# cons(X1, X2) -> proper# X1, proper# fst X -> fst# proper X) (proper# cons(X1, X2) -> proper# X1, proper# fst X -> proper# X) (proper# cons(X1, X2) -> proper# X1, proper# pair(X1, X2) -> pair#(proper X1, proper X2)) (proper# cons(X1, X2) -> proper# X1, proper# pair(X1, X2) -> proper# X1) (proper# cons(X1, X2) -> proper# X1, proper# pair(X1, X2) -> proper# X2) (proper# cons(X1, X2) -> proper# X1, proper# snd X -> snd# proper X) (proper# cons(X1, X2) -> proper# X1, proper# snd X -> proper# X) (proper# cons(X1, X2) -> proper# X1, proper# splitAt(X1, X2) -> splitAt#(proper X1, proper X2)) (proper# cons(X1, X2) -> proper# X1, proper# splitAt(X1, X2) -> proper# X1) (proper# cons(X1, X2) -> proper# X1, proper# splitAt(X1, X2) -> proper# X2) (proper# cons(X1, X2) -> proper# X1, proper# u(X1, X2, X3, X4) -> u#(proper X1, proper X2, proper X3, proper X4)) (proper# cons(X1, X2) -> proper# X1, proper# u(X1, X2, X3, X4) -> proper# X1) (proper# cons(X1, X2) -> proper# X1, proper# u(X1, X2, X3, X4) -> proper# X2) (proper# cons(X1, X2) -> proper# X1, proper# u(X1, X2, X3, X4) -> proper# X3) (proper# cons(X1, X2) -> proper# X1, proper# u(X1, X2, X3, X4) -> proper# X4) (proper# cons(X1, X2) -> proper# X1, proper# head X -> head# proper X) (proper# cons(X1, X2) -> proper# X1, proper# head X -> proper# X) (proper# cons(X1, X2) -> proper# X1, proper# tail X -> tail# proper X) (proper# cons(X1, X2) -> proper# X1, proper# tail X -> proper# X) (proper# cons(X1, X2) -> proper# X1, proper# afterNth(X1, X2) -> afterNth#(proper X1, proper X2)) (proper# cons(X1, X2) -> proper# X1, proper# afterNth(X1, X2) -> proper# X1) (proper# cons(X1, X2) -> proper# X1, proper# afterNth(X1, X2) -> proper# X2) (proper# cons(X1, X2) -> proper# X1, proper# sel(X1, X2) -> sel#(proper X1, proper X2)) (proper# cons(X1, X2) -> proper# X1, proper# sel(X1, X2) -> proper# X1) (proper# cons(X1, X2) -> proper# X1, proper# sel(X1, X2) -> proper# X2) (proper# cons(X1, X2) -> proper# X1, proper# take(X1, X2) -> take#(proper X1, proper X2)) (proper# cons(X1, X2) -> proper# X1, proper# take(X1, X2) -> proper# X1) (proper# cons(X1, X2) -> proper# X1, proper# take(X1, X2) -> proper# X2) (active# sel(X1, X2) -> active# X1, active# cons(X1, X2) -> cons#(active X1, X2)) (active# sel(X1, X2) -> active# X1, active# cons(X1, X2) -> active# X1) (active# sel(X1, X2) -> active# X1, active# natsFrom N -> cons#(N, natsFrom s N)) (active# sel(X1, X2) -> active# X1, active# natsFrom N -> natsFrom# s N) (active# sel(X1, X2) -> active# X1, active# natsFrom N -> s# N) (active# sel(X1, X2) -> active# X1, active# natsFrom X -> natsFrom# active X) (active# sel(X1, X2) -> active# X1, active# natsFrom X -> active# X) (active# sel(X1, X2) -> active# X1, active# s X -> s# active X) (active# sel(X1, X2) -> active# X1, active# s X -> active# X) (active# sel(X1, X2) -> active# X1, active# fst X -> active# X) (active# sel(X1, X2) -> active# X1, active# fst X -> fst# active X) (active# sel(X1, X2) -> active# X1, active# pair(X1, X2) -> active# X1) (active# sel(X1, X2) -> active# X1, active# pair(X1, X2) -> active# X2) (active# sel(X1, X2) -> active# X1, active# pair(X1, X2) -> pair#(X1, active X2)) (active# sel(X1, X2) -> active# X1, active# pair(X1, X2) -> pair#(active X1, X2)) (active# sel(X1, X2) -> active# X1, active# snd X -> active# X) (active# sel(X1, X2) -> active# X1, active# snd X -> snd# active X) (active# sel(X1, X2) -> active# X1, active# splitAt(X1, X2) -> active# X1) (active# sel(X1, X2) -> active# X1, active# splitAt(X1, X2) -> active# X2) (active# sel(X1, X2) -> active# X1, active# splitAt(X1, X2) -> splitAt#(X1, active X2)) (active# sel(X1, X2) -> active# X1, active# splitAt(X1, X2) -> splitAt#(active X1, X2)) (active# sel(X1, X2) -> active# X1, active# splitAt(s N, cons(X, XS)) -> splitAt#(N, XS)) (active# sel(X1, X2) -> active# X1, active# splitAt(s N, cons(X, XS)) -> u#(splitAt(N, XS), N, X, XS)) (active# sel(X1, X2) -> active# X1, active# splitAt(0(), XS) -> pair#(nil(), XS)) (active# sel(X1, X2) -> active# X1, active# u(X1, X2, X3, X4) -> active# X1) (active# sel(X1, X2) -> active# X1, active# u(X1, X2, X3, X4) -> u#(active X1, X2, X3, X4)) (active# sel(X1, X2) -> active# X1, active# u(pair(YS, ZS), N, X, XS) -> cons#(X, YS)) (active# sel(X1, X2) -> active# X1, active# u(pair(YS, ZS), N, X, XS) -> pair#(cons(X, YS), ZS)) (active# sel(X1, X2) -> active# X1, active# head X -> active# X) (active# sel(X1, X2) -> active# X1, active# head X -> head# active X) (active# sel(X1, X2) -> active# X1, active# tail X -> active# X) (active# sel(X1, X2) -> active# X1, active# tail X -> tail# active X) (active# sel(X1, X2) -> active# X1, active# afterNth(N, XS) -> snd# splitAt(N, XS)) (active# sel(X1, X2) -> active# X1, active# afterNth(N, XS) -> splitAt#(N, XS)) (active# sel(X1, X2) -> active# X1, active# afterNth(X1, X2) -> active# X1) (active# sel(X1, X2) -> active# X1, active# afterNth(X1, X2) -> active# X2) (active# sel(X1, X2) -> active# X1, active# afterNth(X1, X2) -> afterNth#(X1, active X2)) (active# sel(X1, X2) -> active# X1, active# afterNth(X1, X2) -> afterNth#(active X1, X2)) (active# sel(X1, X2) -> active# X1, active# sel(N, XS) -> head# afterNth(N, XS)) (active# sel(X1, X2) -> active# X1, active# sel(N, XS) -> afterNth#(N, XS)) (active# sel(X1, X2) -> active# X1, active# sel(X1, X2) -> active# X1) (active# sel(X1, X2) -> active# X1, active# sel(X1, X2) -> active# X2) (active# sel(X1, X2) -> active# X1, active# sel(X1, X2) -> sel#(X1, active X2)) (active# sel(X1, X2) -> active# X1, active# sel(X1, X2) -> sel#(active X1, X2)) (active# sel(X1, X2) -> active# X1, active# take(N, XS) -> fst# splitAt(N, XS)) (active# sel(X1, X2) -> active# X1, active# take(N, XS) -> splitAt#(N, XS)) (active# sel(X1, X2) -> active# X1, active# take(X1, X2) -> active# X1) (active# sel(X1, X2) -> active# X1, active# take(X1, X2) -> active# X2) (active# sel(X1, X2) -> active# X1, active# take(X1, X2) -> take#(X1, active X2)) (active# sel(X1, X2) -> active# X1, active# take(X1, X2) -> take#(active X1, X2)) (active# u(X1, X2, X3, X4) -> active# X1, active# cons(X1, X2) -> cons#(active X1, X2)) (active# u(X1, X2, X3, X4) -> active# X1, active# cons(X1, X2) -> active# X1) (active# u(X1, X2, X3, X4) -> active# X1, active# natsFrom N -> cons#(N, natsFrom s N)) (active# u(X1, X2, X3, X4) -> active# X1, active# natsFrom N -> natsFrom# s N) (active# u(X1, X2, X3, X4) -> active# X1, active# natsFrom N -> s# N) (active# u(X1, X2, X3, X4) -> active# X1, active# natsFrom X -> natsFrom# active X) (active# u(X1, X2, X3, X4) -> active# X1, active# natsFrom X -> active# X) (active# u(X1, X2, X3, X4) -> active# X1, active# s X -> s# active X) (active# u(X1, X2, X3, X4) -> active# X1, active# s X -> active# X) (active# u(X1, X2, X3, X4) -> active# X1, active# fst X -> active# X) (active# u(X1, X2, X3, X4) -> active# X1, active# fst X -> fst# active X) (active# u(X1, X2, X3, X4) -> active# X1, active# pair(X1, X2) -> active# X1) (active# u(X1, X2, X3, X4) -> active# X1, active# pair(X1, X2) -> active# X2) (active# u(X1, X2, X3, X4) -> active# X1, active# pair(X1, X2) -> pair#(X1, active X2)) (active# u(X1, X2, X3, X4) -> active# X1, active# pair(X1, X2) -> pair#(active X1, X2)) (active# u(X1, X2, X3, X4) -> active# X1, active# snd X -> active# X) (active# u(X1, X2, X3, X4) -> active# X1, active# snd X -> snd# active X) (active# u(X1, X2, X3, X4) -> active# X1, active# splitAt(X1, X2) -> active# X1) (active# u(X1, X2, X3, X4) -> active# X1, active# splitAt(X1, X2) -> active# X2) (active# u(X1, X2, X3, X4) -> active# X1, active# splitAt(X1, X2) -> splitAt#(X1, active X2)) (active# u(X1, X2, X3, X4) -> active# X1, active# splitAt(X1, X2) -> splitAt#(active X1, X2)) (active# u(X1, X2, X3, X4) -> active# X1, active# splitAt(s N, cons(X, XS)) -> splitAt#(N, XS)) (active# u(X1, X2, X3, X4) -> active# X1, active# splitAt(s N, cons(X, XS)) -> u#(splitAt(N, XS), N, X, XS)) (active# u(X1, X2, X3, X4) -> active# X1, active# splitAt(0(), XS) -> pair#(nil(), XS)) (active# u(X1, X2, X3, X4) -> active# X1, active# u(X1, X2, X3, X4) -> active# X1) (active# u(X1, X2, X3, X4) -> active# X1, active# u(X1, X2, X3, X4) -> u#(active X1, X2, X3, X4)) (active# u(X1, X2, X3, X4) -> active# X1, active# u(pair(YS, ZS), N, X, XS) -> cons#(X, YS)) (active# u(X1, X2, X3, X4) -> active# X1, active# u(pair(YS, ZS), N, X, XS) -> pair#(cons(X, YS), ZS)) (active# u(X1, X2, X3, X4) -> active# X1, active# head X -> active# X) (active# u(X1, X2, X3, X4) -> active# X1, active# head X -> head# active X) (active# u(X1, X2, X3, X4) -> active# X1, active# tail X -> active# X) (active# u(X1, X2, X3, X4) -> active# X1, active# tail X -> tail# active X) (active# u(X1, X2, X3, X4) -> active# X1, active# afterNth(N, XS) -> snd# splitAt(N, XS)) (active# u(X1, X2, X3, X4) -> active# X1, active# afterNth(N, XS) -> splitAt#(N, XS)) (active# u(X1, X2, X3, X4) -> active# X1, active# afterNth(X1, X2) -> active# X1) (active# u(X1, X2, X3, X4) -> active# X1, active# afterNth(X1, X2) -> active# X2) (active# u(X1, X2, X3, X4) -> active# X1, active# afterNth(X1, X2) -> afterNth#(X1, active X2)) (active# u(X1, X2, X3, X4) -> active# X1, active# afterNth(X1, X2) -> afterNth#(active X1, X2)) (active# u(X1, X2, X3, X4) -> active# X1, active# sel(N, XS) -> head# afterNth(N, XS)) (active# u(X1, X2, X3, X4) -> active# X1, active# sel(N, XS) -> afterNth#(N, XS)) (active# u(X1, X2, X3, X4) -> active# X1, active# sel(X1, X2) -> active# X1) (active# u(X1, X2, X3, X4) -> active# X1, active# sel(X1, X2) -> active# X2) (active# u(X1, X2, X3, X4) -> active# X1, active# sel(X1, X2) -> sel#(X1, active X2)) (active# u(X1, X2, X3, X4) -> active# X1, active# sel(X1, X2) -> sel#(active X1, X2)) (active# u(X1, X2, X3, X4) -> active# X1, active# take(N, XS) -> fst# splitAt(N, XS)) (active# u(X1, X2, X3, X4) -> active# X1, active# take(N, XS) -> splitAt#(N, XS)) (active# u(X1, X2, X3, X4) -> active# X1, active# take(X1, X2) -> active# X1) (active# u(X1, X2, X3, X4) -> active# X1, active# take(X1, X2) -> active# X2) (active# u(X1, X2, X3, X4) -> active# X1, active# take(X1, X2) -> take#(X1, active X2)) (active# u(X1, X2, X3, X4) -> active# X1, active# take(X1, X2) -> take#(active X1, X2)) (active# pair(X1, X2) -> active# X1, active# cons(X1, X2) -> cons#(active X1, X2)) (active# pair(X1, X2) -> active# X1, active# cons(X1, X2) -> active# X1) (active# pair(X1, X2) -> active# X1, active# natsFrom N -> cons#(N, natsFrom s N)) (active# pair(X1, X2) -> active# X1, active# natsFrom N -> natsFrom# s N) (active# pair(X1, X2) -> active# X1, active# natsFrom N -> s# N) (active# pair(X1, X2) -> active# X1, active# natsFrom X -> natsFrom# active X) (active# pair(X1, X2) -> active# X1, active# natsFrom X -> active# X) (active# pair(X1, X2) -> active# X1, active# s X -> s# active X) (active# pair(X1, X2) -> active# X1, active# s X -> active# X) (active# pair(X1, X2) -> active# X1, active# fst X -> active# X) (active# pair(X1, X2) -> active# X1, active# fst X -> fst# active X) (active# pair(X1, X2) -> active# X1, active# pair(X1, X2) -> active# X1) (active# pair(X1, X2) -> active# X1, active# pair(X1, X2) -> active# X2) (active# pair(X1, X2) -> active# X1, active# pair(X1, X2) -> pair#(X1, active X2)) (active# pair(X1, X2) -> active# X1, active# pair(X1, X2) -> pair#(active X1, X2)) (active# pair(X1, X2) -> active# X1, active# snd X -> active# X) (active# pair(X1, X2) -> active# X1, active# snd X -> snd# active X) (active# pair(X1, X2) -> active# X1, active# splitAt(X1, X2) -> active# X1) (active# pair(X1, X2) -> active# X1, active# splitAt(X1, X2) -> active# X2) (active# pair(X1, X2) -> active# X1, active# splitAt(X1, X2) -> splitAt#(X1, active X2)) (active# pair(X1, X2) -> active# X1, active# splitAt(X1, X2) -> splitAt#(active X1, X2)) (active# pair(X1, X2) -> active# X1, active# splitAt(s N, cons(X, XS)) -> splitAt#(N, XS)) (active# pair(X1, X2) -> active# X1, active# splitAt(s N, cons(X, XS)) -> u#(splitAt(N, XS), N, X, XS)) (active# pair(X1, X2) -> active# X1, active# splitAt(0(), XS) -> pair#(nil(), XS)) (active# pair(X1, X2) -> active# X1, active# u(X1, X2, X3, X4) -> active# X1) (active# pair(X1, X2) -> active# X1, active# u(X1, X2, X3, X4) -> u#(active X1, X2, X3, X4)) (active# pair(X1, X2) -> active# X1, active# u(pair(YS, ZS), N, X, XS) -> cons#(X, YS)) (active# pair(X1, X2) -> active# X1, active# u(pair(YS, ZS), N, X, XS) -> pair#(cons(X, YS), ZS)) (active# pair(X1, X2) -> active# X1, active# head X -> active# X) (active# pair(X1, X2) -> active# X1, active# head X -> head# active X) (active# pair(X1, X2) -> active# X1, active# tail X -> active# X) (active# pair(X1, X2) -> active# X1, active# tail X -> tail# active X) (active# pair(X1, X2) -> active# X1, active# afterNth(N, XS) -> snd# splitAt(N, XS)) (active# pair(X1, X2) -> active# X1, active# afterNth(N, XS) -> splitAt#(N, XS)) (active# pair(X1, X2) -> active# X1, active# afterNth(X1, X2) -> active# X1) (active# pair(X1, X2) -> active# X1, active# afterNth(X1, X2) -> active# X2) (active# pair(X1, X2) -> active# X1, active# afterNth(X1, X2) -> afterNth#(X1, active X2)) (active# pair(X1, X2) -> active# X1, active# afterNth(X1, X2) -> afterNth#(active X1, X2)) (active# pair(X1, X2) -> active# X1, active# sel(N, XS) -> head# afterNth(N, XS)) (active# pair(X1, X2) -> active# X1, active# sel(N, XS) -> afterNth#(N, XS)) (active# pair(X1, X2) -> active# X1, active# sel(X1, X2) -> active# X1) (active# pair(X1, X2) -> active# X1, active# sel(X1, X2) -> active# X2) (active# pair(X1, X2) -> active# X1, active# sel(X1, X2) -> sel#(X1, active X2)) (active# pair(X1, X2) -> active# X1, active# sel(X1, X2) -> sel#(active X1, X2)) (active# pair(X1, X2) -> active# X1, active# take(N, XS) -> fst# splitAt(N, XS)) (active# pair(X1, X2) -> active# X1, active# take(N, XS) -> splitAt#(N, XS)) (active# pair(X1, X2) -> active# X1, active# take(X1, X2) -> active# X1) (active# pair(X1, X2) -> active# X1, active# take(X1, X2) -> active# X2) (active# pair(X1, X2) -> active# X1, active# take(X1, X2) -> take#(X1, active X2)) (active# pair(X1, X2) -> active# X1, active# take(X1, X2) -> take#(active X1, X2)) (u#(ok X1, ok X2, ok X3, ok X4) -> u#(X1, X2, X3, X4), u#(mark X1, X2, X3, X4) -> u#(X1, X2, X3, X4)) (u#(ok X1, ok X2, ok X3, ok X4) -> u#(X1, X2, X3, X4), u#(ok X1, ok X2, ok X3, ok X4) -> u#(X1, X2, X3, X4)) (active# u(X1, X2, X3, X4) -> u#(active X1, X2, X3, X4), u#(mark X1, X2, X3, X4) -> u#(X1, X2, X3, X4)) (active# u(X1, X2, X3, X4) -> u#(active X1, X2, X3, X4), u#(ok X1, ok X2, ok X3, ok X4) -> u#(X1, X2, X3, X4)) (top# ok X -> top# active X, top# mark X -> proper# X) (top# ok X -> top# active X, top# mark X -> top# proper X) (top# ok X -> top# active X, top# ok X -> active# X) (top# ok X -> top# active X, top# ok X -> top# active X) (proper# tail X -> tail# proper X, tail# mark X -> tail# X) (proper# tail X -> tail# proper X, tail# ok X -> tail# X) (proper# snd X -> snd# proper X, snd# mark X -> snd# X) (proper# snd X -> snd# proper X, snd# ok X -> snd# X) (proper# s X -> s# proper X, s# mark X -> s# X) (proper# s X -> s# proper X, s# ok X -> s# X) (active# tail X -> tail# active X, tail# mark X -> tail# X) (active# tail X -> tail# active X, tail# ok X -> tail# X) (active# snd X -> snd# active X, snd# mark X -> snd# X) (active# snd X -> snd# active X, snd# ok X -> snd# X) (active# s X -> s# active X, s# mark X -> s# X) (active# s X -> s# active X, s# ok X -> s# X) (top# ok X -> active# X, active# cons(X1, X2) -> cons#(active X1, X2)) (top# ok X -> active# X, active# cons(X1, X2) -> active# X1) (top# ok X -> active# X, active# natsFrom N -> cons#(N, natsFrom s N)) (top# ok X -> active# X, active# natsFrom N -> natsFrom# s N) (top# ok X -> active# X, active# natsFrom N -> s# N) (top# ok X -> active# X, active# natsFrom X -> natsFrom# active X) (top# ok X -> active# X, active# natsFrom X -> active# X) (top# ok X -> active# X, active# s X -> s# active X) (top# ok X -> active# X, active# s X -> active# X) (top# ok X -> active# X, active# fst X -> active# X) (top# ok X -> active# X, active# fst X -> fst# active X) (top# ok X -> active# X, active# pair(X1, X2) -> active# X1) (top# ok X -> active# X, active# pair(X1, X2) -> active# X2) (top# ok X -> active# X, active# pair(X1, X2) -> pair#(X1, active X2)) (top# ok X -> active# X, active# pair(X1, X2) -> pair#(active X1, X2)) (top# ok X -> active# X, active# snd X -> active# X) (top# ok X -> active# X, active# snd X -> snd# active X) (top# ok X -> active# X, active# splitAt(X1, X2) -> active# X1) (top# ok X -> active# X, active# splitAt(X1, X2) -> active# X2) (top# ok X -> active# X, active# splitAt(X1, X2) -> splitAt#(X1, active X2)) (top# ok X -> active# X, active# splitAt(X1, X2) -> splitAt#(active X1, X2)) (top# ok X -> active# X, active# splitAt(s N, cons(X, XS)) -> splitAt#(N, XS)) (top# ok X -> active# X, active# splitAt(s N, cons(X, XS)) -> u#(splitAt(N, XS), N, X, XS)) (top# ok X -> active# X, active# splitAt(0(), XS) -> pair#(nil(), XS)) (top# ok X -> active# X, active# u(X1, X2, X3, X4) -> active# X1) (top# ok X -> active# X, active# u(X1, X2, X3, X4) -> u#(active X1, X2, X3, X4)) (top# ok X -> active# X, active# u(pair(YS, ZS), N, X, XS) -> cons#(X, YS)) (top# ok X -> active# X, active# u(pair(YS, ZS), N, X, XS) -> pair#(cons(X, YS), ZS)) (top# ok X -> active# X, active# head X -> active# X) (top# ok X -> active# X, active# head X -> head# active X) (top# ok X -> active# X, active# tail X -> active# X) (top# ok X -> active# X, active# tail X -> tail# active X) (top# ok X -> active# X, active# afterNth(N, XS) -> snd# splitAt(N, XS)) (top# ok X -> active# X, active# afterNth(N, XS) -> splitAt#(N, XS)) (top# ok X -> active# X, active# afterNth(X1, X2) -> active# X1) (top# ok X -> active# X, active# afterNth(X1, X2) -> active# X2) (top# ok X -> active# X, active# afterNth(X1, X2) -> afterNth#(X1, active X2)) (top# ok X -> active# X, active# afterNth(X1, X2) -> afterNth#(active X1, X2)) (top# ok X -> active# X, active# sel(N, XS) -> head# afterNth(N, XS)) (top# ok X -> active# X, active# sel(N, XS) -> afterNth#(N, XS)) (top# ok X -> active# X, active# sel(X1, X2) -> active# X1) (top# ok X -> active# X, active# sel(X1, X2) -> active# X2) (top# ok X -> active# X, active# sel(X1, X2) -> sel#(X1, active X2)) (top# ok X -> active# X, active# sel(X1, X2) -> sel#(active X1, X2)) (top# ok X -> active# X, active# take(N, XS) -> fst# splitAt(N, XS)) (top# ok X -> active# X, active# take(N, XS) -> splitAt#(N, XS)) (top# ok X -> active# X, active# take(X1, X2) -> active# X1) (top# ok X -> active# X, active# take(X1, X2) -> active# X2) (top# ok X -> active# X, active# take(X1, X2) -> take#(X1, active X2)) (top# ok X -> active# X, active# take(X1, X2) -> take#(active X1, X2)) (proper# tail X -> proper# X, proper# cons(X1, X2) -> cons#(proper X1, proper X2)) (proper# tail X -> proper# X, proper# cons(X1, X2) -> proper# X1) (proper# tail X -> proper# X, proper# cons(X1, X2) -> proper# X2) (proper# tail X -> proper# X, proper# natsFrom X -> natsFrom# proper X) (proper# tail X -> proper# X, proper# natsFrom X -> proper# X) (proper# tail X -> proper# X, proper# s X -> s# proper X) (proper# tail X -> proper# X, proper# s X -> proper# X) (proper# tail X -> proper# X, proper# fst X -> fst# proper X) (proper# tail X -> proper# X, proper# fst X -> proper# X) (proper# tail X -> proper# X, proper# pair(X1, X2) -> pair#(proper X1, proper X2)) (proper# tail X -> proper# X, proper# pair(X1, X2) -> proper# X1) (proper# tail X -> proper# X, proper# pair(X1, X2) -> proper# X2) (proper# tail X -> proper# X, proper# snd X -> snd# proper X) (proper# tail X -> proper# X, proper# snd X -> proper# X) (proper# tail X -> proper# X, proper# splitAt(X1, X2) -> splitAt#(proper X1, proper X2)) (proper# tail X -> proper# X, proper# splitAt(X1, X2) -> proper# X1) (proper# tail X -> proper# X, proper# splitAt(X1, X2) -> proper# X2) (proper# tail X -> proper# X, proper# u(X1, X2, X3, X4) -> u#(proper X1, proper X2, proper X3, proper X4)) (proper# tail X -> proper# X, proper# u(X1, X2, X3, X4) -> proper# X1) (proper# tail X -> proper# X, proper# u(X1, X2, X3, X4) -> proper# X2) (proper# tail X -> proper# X, proper# u(X1, X2, X3, X4) -> proper# X3) (proper# tail X -> proper# X, proper# u(X1, X2, X3, X4) -> proper# X4) (proper# tail X -> proper# X, proper# head X -> head# proper X) (proper# tail X -> proper# X, proper# head X -> proper# X) (proper# tail X -> proper# X, proper# tail X -> tail# proper X) (proper# tail X -> proper# X, proper# tail X -> proper# X) (proper# tail X -> proper# X, proper# afterNth(X1, X2) -> afterNth#(proper X1, proper X2)) (proper# tail X -> proper# X, proper# afterNth(X1, X2) -> proper# X1) (proper# tail X -> proper# X, proper# afterNth(X1, X2) -> proper# X2) (proper# tail X -> proper# X, proper# sel(X1, X2) -> sel#(proper X1, proper X2)) (proper# tail X -> proper# X, proper# sel(X1, X2) -> proper# X1) (proper# tail X -> proper# X, proper# sel(X1, X2) -> proper# X2) (proper# tail X -> proper# X, proper# take(X1, X2) -> take#(proper X1, proper X2)) (proper# tail X -> proper# X, proper# take(X1, X2) -> proper# X1) (proper# tail X -> proper# X, proper# take(X1, X2) -> proper# X2) (proper# snd X -> proper# X, proper# cons(X1, X2) -> cons#(proper X1, proper X2)) (proper# snd X -> proper# X, proper# cons(X1, X2) -> proper# X1) (proper# snd X -> proper# X, proper# cons(X1, X2) -> proper# X2) (proper# snd X -> proper# X, proper# natsFrom X -> natsFrom# proper X) (proper# snd X -> proper# X, proper# natsFrom X -> proper# X) (proper# snd X -> proper# X, proper# s X -> s# proper X) (proper# snd X -> proper# X, proper# s X -> proper# X) (proper# snd X -> proper# X, proper# fst X -> fst# proper X) (proper# snd X -> proper# X, proper# fst X -> proper# X) (proper# snd X -> proper# X, proper# pair(X1, X2) -> pair#(proper X1, proper X2)) (proper# snd X -> proper# X, proper# pair(X1, X2) -> proper# X1) (proper# snd X -> proper# X, proper# pair(X1, X2) -> proper# X2) (proper# snd X -> proper# X, proper# snd X -> snd# proper X) (proper# snd X -> proper# X, proper# snd X -> proper# X) (proper# snd X -> proper# X, proper# splitAt(X1, X2) -> splitAt#(proper X1, proper X2)) (proper# snd X -> proper# X, proper# splitAt(X1, X2) -> proper# X1) (proper# snd X -> proper# X, proper# splitAt(X1, X2) -> proper# X2) (proper# snd X -> proper# X, proper# u(X1, X2, X3, X4) -> u#(proper X1, proper X2, proper X3, proper X4)) (proper# snd X -> proper# X, proper# u(X1, X2, X3, X4) -> proper# X1) (proper# snd X -> proper# X, proper# u(X1, X2, X3, X4) -> proper# X2) (proper# snd X -> proper# X, proper# u(X1, X2, X3, X4) -> proper# X3) (proper# snd X -> proper# X, proper# u(X1, X2, X3, X4) -> proper# X4) (proper# snd X -> proper# X, proper# head X -> head# proper X) (proper# snd X -> proper# X, proper# head X -> proper# X) (proper# snd X -> proper# X, proper# tail X -> tail# proper X) (proper# snd X -> proper# X, proper# tail X -> proper# X) (proper# snd X -> proper# X, proper# afterNth(X1, X2) -> afterNth#(proper X1, proper X2)) (proper# snd X -> proper# X, proper# afterNth(X1, X2) -> proper# X1) (proper# snd X -> proper# X, proper# afterNth(X1, X2) -> proper# X2) (proper# snd X -> proper# X, proper# sel(X1, X2) -> sel#(proper X1, proper X2)) (proper# snd X -> proper# X, proper# sel(X1, X2) -> proper# X1) (proper# snd X -> proper# X, proper# sel(X1, X2) -> proper# X2) (proper# snd X -> proper# X, proper# take(X1, X2) -> take#(proper X1, proper X2)) (proper# snd X -> proper# X, proper# take(X1, X2) -> proper# X1) (proper# snd X -> proper# X, proper# take(X1, X2) -> proper# X2) (proper# s X -> proper# X, proper# cons(X1, X2) -> cons#(proper X1, proper X2)) (proper# s X -> proper# X, proper# cons(X1, X2) -> proper# X1) (proper# s X -> proper# X, proper# cons(X1, X2) -> proper# X2) (proper# s X -> proper# X, proper# natsFrom X -> natsFrom# proper X) (proper# s X -> proper# X, proper# natsFrom X -> proper# X) (proper# s X -> proper# X, proper# s X -> s# proper X) (proper# s X -> proper# X, proper# s X -> proper# X) (proper# s X -> proper# X, proper# fst X -> fst# proper X) (proper# s X -> proper# X, proper# fst X -> proper# X) (proper# s X -> proper# X, proper# pair(X1, X2) -> pair#(proper X1, proper X2)) (proper# s X -> proper# X, proper# pair(X1, X2) -> proper# X1) (proper# s X -> proper# X, proper# pair(X1, X2) -> proper# X2) (proper# s X -> proper# X, proper# snd X -> snd# proper X) (proper# s X -> proper# X, proper# snd X -> proper# X) (proper# s X -> proper# X, proper# splitAt(X1, X2) -> splitAt#(proper X1, proper X2)) (proper# s X -> proper# X, proper# splitAt(X1, X2) -> proper# X1) (proper# s X -> proper# X, proper# splitAt(X1, X2) -> proper# X2) (proper# s X -> proper# X, proper# u(X1, X2, X3, X4) -> u#(proper X1, proper X2, proper X3, proper X4)) (proper# s X -> proper# X, proper# u(X1, X2, X3, X4) -> proper# X1) (proper# s X -> proper# X, proper# u(X1, X2, X3, X4) -> proper# X2) (proper# s X -> proper# X, proper# u(X1, X2, X3, X4) -> proper# X3) (proper# s X -> proper# X, proper# u(X1, X2, X3, X4) -> proper# X4) (proper# s X -> proper# X, proper# head X -> head# proper X) (proper# s X -> proper# X, proper# head X -> proper# X) (proper# s X -> proper# X, proper# tail X -> tail# proper X) (proper# s X -> proper# X, proper# tail X -> proper# X) (proper# s X -> proper# X, proper# afterNth(X1, X2) -> afterNth#(proper X1, proper X2)) (proper# s X -> proper# X, proper# afterNth(X1, X2) -> proper# X1) (proper# s X -> proper# X, proper# afterNth(X1, X2) -> proper# X2) (proper# s X -> proper# X, proper# sel(X1, X2) -> sel#(proper X1, proper X2)) (proper# s X -> proper# X, proper# sel(X1, X2) -> proper# X1) (proper# s X -> proper# X, proper# sel(X1, X2) -> proper# X2) (proper# s X -> proper# X, proper# take(X1, X2) -> take#(proper X1, proper X2)) (proper# s X -> proper# X, proper# take(X1, X2) -> proper# X1) (proper# s X -> proper# X, proper# take(X1, X2) -> proper# X2) (tail# ok X -> tail# X, tail# mark X -> tail# X) (tail# ok X -> tail# X, tail# ok X -> tail# X) (head# ok X -> head# X, head# mark X -> head# X) (head# ok X -> head# X, head# ok X -> head# X) (snd# ok X -> snd# X, snd# mark X -> snd# X) (snd# ok X -> snd# X, snd# ok X -> snd# X) (fst# ok X -> fst# X, fst# mark X -> fst# X) (fst# ok X -> fst# X, fst# ok X -> fst# X) (active# tail X -> active# X, active# cons(X1, X2) -> cons#(active X1, X2)) (active# tail X -> active# X, active# cons(X1, X2) -> active# X1) (active# tail X -> active# X, active# natsFrom N -> cons#(N, natsFrom s N)) (active# tail X -> active# X, active# natsFrom N -> natsFrom# s N) (active# tail X -> active# X, active# natsFrom N -> s# N) (active# tail X -> active# X, active# natsFrom X -> natsFrom# active X) (active# tail X -> active# X, active# natsFrom X -> active# X) (active# tail X -> active# X, active# s X -> s# active X) (active# tail X -> active# X, active# s X -> active# X) (active# tail X -> active# X, active# fst X -> active# X) (active# tail X -> active# X, active# fst X -> fst# active X) (active# tail X -> active# X, active# pair(X1, X2) -> active# X1) (active# tail X -> active# X, active# pair(X1, X2) -> active# X2) (active# tail X -> active# X, active# pair(X1, X2) -> pair#(X1, active X2)) (active# tail X -> active# X, active# pair(X1, X2) -> pair#(active X1, X2)) (active# tail X -> active# X, active# snd X -> active# X) (active# tail X -> active# X, active# snd X -> snd# active X) (active# tail X -> active# X, active# splitAt(X1, X2) -> active# X1) (active# tail X -> active# X, active# splitAt(X1, X2) -> active# X2) (active# tail X -> active# X, active# splitAt(X1, X2) -> splitAt#(X1, active X2)) (active# tail X -> active# X, active# splitAt(X1, X2) -> splitAt#(active X1, X2)) (active# tail X -> active# X, active# splitAt(s N, cons(X, XS)) -> splitAt#(N, XS)) (active# tail X -> active# X, active# splitAt(s N, cons(X, XS)) -> u#(splitAt(N, XS), N, X, XS)) (active# tail X -> active# X, active# splitAt(0(), XS) -> pair#(nil(), XS)) (active# tail X -> active# X, active# u(X1, X2, X3, X4) -> active# X1) (active# tail X -> active# X, active# u(X1, X2, X3, X4) -> u#(active X1, X2, X3, X4)) (active# tail X -> active# X, active# u(pair(YS, ZS), N, X, XS) -> cons#(X, YS)) (active# tail X -> active# X, active# u(pair(YS, ZS), N, X, XS) -> pair#(cons(X, YS), ZS)) (active# tail X -> active# X, active# head X -> active# X) (active# tail X -> active# X, active# head X -> head# active X) (active# tail X -> active# X, active# tail X -> active# X) (active# tail X -> active# X, active# tail X -> tail# active X) (active# tail X -> active# X, active# afterNth(N, XS) -> snd# splitAt(N, XS)) (active# tail X -> active# X, active# afterNth(N, XS) -> splitAt#(N, XS)) (active# tail X -> active# X, active# afterNth(X1, X2) -> active# X1) (active# tail X -> active# X, active# afterNth(X1, X2) -> active# X2) (active# tail X -> active# X, active# afterNth(X1, X2) -> afterNth#(X1, active X2)) (active# tail X -> active# X, active# afterNth(X1, X2) -> afterNth#(active X1, X2)) (active# tail X -> active# X, active# sel(N, XS) -> head# afterNth(N, XS)) (active# tail X -> active# X, active# sel(N, XS) -> afterNth#(N, XS)) (active# tail X -> active# X, active# sel(X1, X2) -> active# X1) (active# tail X -> active# X, active# sel(X1, X2) -> active# X2) (active# tail X -> active# X, active# sel(X1, X2) -> sel#(X1, active X2)) (active# tail X -> active# X, active# sel(X1, X2) -> sel#(active X1, X2)) (active# tail X -> active# X, active# take(N, XS) -> fst# splitAt(N, XS)) (active# tail X -> active# X, active# take(N, XS) -> splitAt#(N, XS)) (active# tail X -> active# X, active# take(X1, X2) -> active# X1) (active# tail X -> active# X, active# take(X1, X2) -> active# X2) (active# tail X -> active# X, active# take(X1, X2) -> take#(X1, active X2)) (active# tail X -> active# X, active# take(X1, X2) -> take#(active X1, X2)) (active# snd X -> active# X, active# cons(X1, X2) -> cons#(active X1, X2)) (active# snd X -> active# X, active# cons(X1, X2) -> active# X1) (active# snd X -> active# X, active# natsFrom N -> cons#(N, natsFrom s N)) (active# snd X -> active# X, active# natsFrom N -> natsFrom# s N) (active# snd X -> active# X, active# natsFrom N -> s# N) (active# snd X -> active# X, active# natsFrom X -> natsFrom# active X) (active# snd X -> active# X, active# natsFrom X -> active# X) (active# snd X -> active# X, active# s X -> s# active X) (active# snd X -> active# X, active# s X -> active# X) (active# snd X -> active# X, active# fst X -> active# X) (active# snd X -> active# X, active# fst X -> fst# active X) (active# snd X -> active# X, active# pair(X1, X2) -> active# X1) (active# snd X -> active# X, active# pair(X1, X2) -> active# X2) (active# snd X -> active# X, active# pair(X1, X2) -> pair#(X1, active X2)) (active# snd X -> active# X, active# pair(X1, X2) -> pair#(active X1, X2)) (active# snd X -> active# X, active# snd X -> active# X) (active# snd X -> active# X, active# snd X -> snd# active X) (active# snd X -> active# X, active# splitAt(X1, X2) -> active# X1) (active# snd X -> active# X, active# splitAt(X1, X2) -> active# X2) (active# snd X -> active# X, active# splitAt(X1, X2) -> splitAt#(X1, active X2)) (active# snd X -> active# X, active# splitAt(X1, X2) -> splitAt#(active X1, X2)) (active# snd X -> active# X, active# splitAt(s N, cons(X, XS)) -> splitAt#(N, XS)) (active# snd X -> active# X, active# splitAt(s N, cons(X, XS)) -> u#(splitAt(N, XS), N, X, XS)) (active# snd X -> active# X, active# splitAt(0(), XS) -> pair#(nil(), XS)) (active# snd X -> active# X, active# u(X1, X2, X3, X4) -> active# X1) (active# snd X -> active# X, active# u(X1, X2, X3, X4) -> u#(active X1, X2, X3, X4)) (active# snd X -> active# X, active# u(pair(YS, ZS), N, X, XS) -> cons#(X, YS)) (active# snd X -> active# X, active# u(pair(YS, ZS), N, X, XS) -> pair#(cons(X, YS), ZS)) (active# snd X -> active# X, active# head X -> active# X) (active# snd X -> active# X, active# head X -> head# active X) (active# snd X -> active# X, active# tail X -> active# X) (active# snd X -> active# X, active# tail X -> tail# active X) (active# snd X -> active# X, active# afterNth(N, XS) -> snd# splitAt(N, XS)) (active# snd X -> active# X, active# afterNth(N, XS) -> splitAt#(N, XS)) (active# snd X -> active# X, active# afterNth(X1, X2) -> active# X1) (active# snd X -> active# X, active# afterNth(X1, X2) -> active# X2) (active# snd X -> active# X, active# afterNth(X1, X2) -> afterNth#(X1, active X2)) (active# snd X -> active# X, active# afterNth(X1, X2) -> afterNth#(active X1, X2)) (active# snd X -> active# X, active# sel(N, XS) -> head# afterNth(N, XS)) (active# snd X -> active# X, active# sel(N, XS) -> afterNth#(N, XS)) (active# snd X -> active# X, active# sel(X1, X2) -> active# X1) (active# snd X -> active# X, active# sel(X1, X2) -> active# X2) (active# snd X -> active# X, active# sel(X1, X2) -> sel#(X1, active X2)) (active# snd X -> active# X, active# sel(X1, X2) -> sel#(active X1, X2)) (active# snd X -> active# X, active# take(N, XS) -> fst# splitAt(N, XS)) (active# snd X -> active# X, active# take(N, XS) -> splitAt#(N, XS)) (active# snd X -> active# X, active# take(X1, X2) -> active# X1) (active# snd X -> active# X, active# take(X1, X2) -> active# X2) (active# snd X -> active# X, active# take(X1, X2) -> take#(X1, active X2)) (active# snd X -> active# X, active# take(X1, X2) -> take#(active X1, X2)) (active# s X -> active# X, active# cons(X1, X2) -> cons#(active X1, X2)) (active# s X -> active# X, active# cons(X1, X2) -> active# X1) (active# s X -> active# X, active# natsFrom N -> cons#(N, natsFrom s N)) (active# s X -> active# X, active# natsFrom N -> natsFrom# s N) (active# s X -> active# X, active# natsFrom N -> s# N) (active# s X -> active# X, active# natsFrom X -> natsFrom# active X) (active# s X -> active# X, active# natsFrom X -> active# X) (active# s X -> active# X, active# s X -> s# active X) (active# s X -> active# X, active# s X -> active# X) (active# s X -> active# X, active# fst X -> active# X) (active# s X -> active# X, active# fst X -> fst# active X) (active# s X -> active# X, active# pair(X1, X2) -> active# X1) (active# s X -> active# X, active# pair(X1, X2) -> active# X2) (active# s X -> active# X, active# pair(X1, X2) -> pair#(X1, active X2)) (active# s X -> active# X, active# pair(X1, X2) -> pair#(active X1, X2)) (active# s X -> active# X, active# snd X -> active# X) (active# s X -> active# X, active# snd X -> snd# active X) (active# s X -> active# X, active# splitAt(X1, X2) -> active# X1) (active# s X -> active# X, active# splitAt(X1, X2) -> active# X2) (active# s X -> active# X, active# splitAt(X1, X2) -> splitAt#(X1, active X2)) (active# s X -> active# X, active# splitAt(X1, X2) -> splitAt#(active X1, X2)) (active# s X -> active# X, active# splitAt(s N, cons(X, XS)) -> splitAt#(N, XS)) (active# s X -> active# X, active# splitAt(s N, cons(X, XS)) -> u#(splitAt(N, XS), N, X, XS)) (active# s X -> active# X, active# splitAt(0(), XS) -> pair#(nil(), XS)) (active# s X -> active# X, active# u(X1, X2, X3, X4) -> active# X1) (active# s X -> active# X, active# u(X1, X2, X3, X4) -> u#(active X1, X2, X3, X4)) (active# s X -> active# X, active# u(pair(YS, ZS), N, X, XS) -> cons#(X, YS)) (active# s X -> active# X, active# u(pair(YS, ZS), N, X, XS) -> pair#(cons(X, YS), ZS)) (active# s X -> active# X, active# head X -> active# X) (active# s X -> active# X, active# head X -> head# active X) (active# s X -> active# X, active# tail X -> active# X) (active# s X -> active# X, active# tail X -> tail# active X) (active# s X -> active# X, active# afterNth(N, XS) -> snd# splitAt(N, XS)) (active# s X -> active# X, active# afterNth(N, XS) -> splitAt#(N, XS)) (active# s X -> active# X, active# afterNth(X1, X2) -> active# X1) (active# s X -> active# X, active# afterNth(X1, X2) -> active# X2) (active# s X -> active# X, active# afterNth(X1, X2) -> afterNth#(X1, active X2)) (active# s X -> active# X, active# afterNth(X1, X2) -> afterNth#(active X1, X2)) (active# s X -> active# X, active# sel(N, XS) -> head# afterNth(N, XS)) (active# s X -> active# X, active# sel(N, XS) -> afterNth#(N, XS)) (active# s X -> active# X, active# sel(X1, X2) -> active# X1) (active# s X -> active# X, active# sel(X1, X2) -> active# X2) (active# s X -> active# X, active# sel(X1, X2) -> sel#(X1, active X2)) (active# s X -> active# X, active# sel(X1, X2) -> sel#(active X1, X2)) (active# s X -> active# X, active# take(N, XS) -> fst# splitAt(N, XS)) (active# s X -> active# X, active# take(N, XS) -> splitAt#(N, XS)) (active# s X -> active# X, active# take(X1, X2) -> active# X1) (active# s X -> active# X, active# take(X1, X2) -> active# X2) (active# s X -> active# X, active# take(X1, X2) -> take#(X1, active X2)) (active# s X -> active# X, active# take(X1, X2) -> take#(active X1, X2)) (s# ok X -> s# X, s# mark X -> s# X) (s# ok X -> s# X, s# ok X -> s# X) (natsFrom# ok X -> natsFrom# X, natsFrom# mark X -> natsFrom# X) (natsFrom# ok X -> natsFrom# X, natsFrom# ok X -> natsFrom# X) (proper# take(X1, X2) -> take#(proper X1, proper X2), take#(X1, mark X2) -> take#(X1, X2)) (proper# take(X1, X2) -> take#(proper X1, proper X2), take#(mark X1, X2) -> take#(X1, X2)) (proper# take(X1, X2) -> take#(proper X1, proper X2), take#(ok X1, ok X2) -> take#(X1, X2)) (proper# afterNth(X1, X2) -> afterNth#(proper X1, proper X2), afterNth#(X1, mark X2) -> afterNth#(X1, X2)) (proper# afterNth(X1, X2) -> afterNth#(proper X1, proper X2), afterNth#(mark X1, X2) -> afterNth#(X1, X2)) (proper# afterNth(X1, X2) -> afterNth#(proper X1, proper X2), afterNth#(ok X1, ok X2) -> afterNth#(X1, X2)) (proper# pair(X1, X2) -> pair#(proper X1, proper X2), pair#(X1, mark X2) -> pair#(X1, X2)) (proper# pair(X1, X2) -> pair#(proper X1, proper X2), pair#(mark X1, X2) -> pair#(X1, X2)) (proper# pair(X1, X2) -> pair#(proper X1, proper X2), pair#(ok X1, ok X2) -> pair#(X1, X2)) (active# take(X1, X2) -> take#(X1, active X2), take#(X1, mark X2) -> take#(X1, X2)) (active# take(X1, X2) -> take#(X1, active X2), take#(mark X1, X2) -> take#(X1, X2)) (active# take(X1, X2) -> take#(X1, active X2), take#(ok X1, ok X2) -> take#(X1, X2)) (active# afterNth(X1, X2) -> afterNth#(X1, active X2), afterNth#(X1, mark X2) -> afterNth#(X1, X2)) (active# afterNth(X1, X2) -> afterNth#(X1, active X2), afterNth#(mark X1, X2) -> afterNth#(X1, X2)) (active# afterNth(X1, X2) -> afterNth#(X1, active X2), afterNth#(ok X1, ok X2) -> afterNth#(X1, X2)) (active# pair(X1, X2) -> pair#(X1, active X2), pair#(X1, mark X2) -> pair#(X1, X2)) (active# pair(X1, X2) -> pair#(X1, active X2), pair#(mark X1, X2) -> pair#(X1, X2)) (active# pair(X1, X2) -> pair#(X1, active X2), pair#(ok X1, ok X2) -> pair#(X1, X2)) (proper# u(X1, X2, X3, X4) -> proper# X4, proper# cons(X1, X2) -> cons#(proper X1, proper X2)) (proper# u(X1, X2, X3, X4) -> proper# X4, proper# cons(X1, X2) -> proper# X1) (proper# u(X1, X2, X3, X4) -> proper# X4, proper# cons(X1, X2) -> proper# X2) (proper# u(X1, X2, X3, X4) -> proper# X4, proper# natsFrom X -> natsFrom# proper X) (proper# u(X1, X2, X3, X4) -> proper# X4, proper# natsFrom X -> proper# X) (proper# u(X1, X2, X3, X4) -> proper# X4, proper# s X -> s# proper X) (proper# u(X1, X2, X3, X4) -> proper# X4, proper# s X -> proper# X) (proper# u(X1, X2, X3, X4) -> proper# X4, proper# fst X -> fst# proper X) (proper# u(X1, X2, X3, X4) -> proper# X4, proper# fst X -> proper# X) (proper# u(X1, X2, X3, X4) -> proper# X4, proper# pair(X1, X2) -> pair#(proper X1, proper X2)) (proper# u(X1, X2, X3, X4) -> proper# X4, proper# pair(X1, X2) -> proper# X1) (proper# u(X1, X2, X3, X4) -> proper# X4, proper# pair(X1, X2) -> proper# X2) (proper# u(X1, X2, X3, X4) -> proper# X4, proper# snd X -> snd# proper X) (proper# u(X1, X2, X3, X4) -> proper# X4, proper# snd X -> proper# X) (proper# u(X1, X2, X3, X4) -> proper# X4, proper# splitAt(X1, X2) -> splitAt#(proper X1, proper X2)) (proper# u(X1, X2, X3, X4) -> proper# X4, proper# splitAt(X1, X2) -> proper# X1) (proper# u(X1, X2, X3, X4) -> proper# X4, proper# splitAt(X1, X2) -> proper# X2) (proper# u(X1, X2, X3, X4) -> proper# X4, proper# u(X1, X2, X3, X4) -> u#(proper X1, proper X2, proper X3, proper X4)) (proper# u(X1, X2, X3, X4) -> proper# X4, proper# u(X1, X2, X3, X4) -> proper# X1) (proper# u(X1, X2, X3, X4) -> proper# X4, proper# u(X1, X2, X3, X4) -> proper# X2) (proper# u(X1, X2, X3, X4) -> proper# X4, proper# u(X1, X2, X3, X4) -> proper# X3) (proper# u(X1, X2, X3, X4) -> proper# X4, proper# u(X1, X2, X3, X4) -> proper# X4) (proper# u(X1, X2, X3, X4) -> proper# X4, proper# head X -> head# proper X) (proper# u(X1, X2, X3, X4) -> proper# X4, proper# head X -> proper# X) (proper# u(X1, X2, X3, X4) -> proper# X4, proper# tail X -> tail# proper X) (proper# u(X1, X2, X3, X4) -> proper# X4, proper# tail X -> proper# X) (proper# u(X1, X2, X3, X4) -> proper# X4, proper# afterNth(X1, X2) -> afterNth#(proper X1, proper X2)) (proper# u(X1, X2, X3, X4) -> proper# X4, proper# afterNth(X1, X2) -> proper# X1) (proper# u(X1, X2, X3, X4) -> proper# X4, proper# afterNth(X1, X2) -> proper# X2) (proper# u(X1, X2, X3, X4) -> proper# X4, proper# sel(X1, X2) -> sel#(proper X1, proper X2)) (proper# u(X1, X2, X3, X4) -> proper# X4, proper# sel(X1, X2) -> proper# X1) (proper# u(X1, X2, X3, X4) -> proper# X4, proper# sel(X1, X2) -> proper# X2) (proper# u(X1, X2, X3, X4) -> proper# X4, proper# take(X1, X2) -> take#(proper X1, proper X2)) (proper# u(X1, X2, X3, X4) -> proper# X4, proper# take(X1, X2) -> proper# X1) (proper# u(X1, X2, X3, X4) -> proper# X4, proper# take(X1, X2) -> proper# X2) (take#(mark X1, X2) -> take#(X1, X2), take#(X1, mark X2) -> take#(X1, X2)) (take#(mark X1, X2) -> take#(X1, X2), take#(mark X1, X2) -> take#(X1, X2)) (take#(mark X1, X2) -> take#(X1, X2), take#(ok X1, ok X2) -> take#(X1, X2)) (sel#(ok X1, ok X2) -> sel#(X1, X2), sel#(X1, mark X2) -> sel#(X1, X2)) (sel#(ok X1, ok X2) -> sel#(X1, X2), sel#(mark X1, X2) -> sel#(X1, X2)) (sel#(ok X1, ok X2) -> sel#(X1, X2), sel#(ok X1, ok X2) -> sel#(X1, X2)) (sel#(X1, mark X2) -> sel#(X1, X2), sel#(X1, mark X2) -> sel#(X1, X2)) (sel#(X1, mark X2) -> sel#(X1, X2), sel#(mark X1, X2) -> sel#(X1, X2)) (sel#(X1, mark X2) -> sel#(X1, X2), sel#(ok X1, ok X2) -> sel#(X1, X2)) (afterNth#(mark X1, X2) -> afterNth#(X1, X2), afterNth#(X1, mark X2) -> afterNth#(X1, X2)) (afterNth#(mark X1, X2) -> afterNth#(X1, X2), afterNth#(mark X1, X2) -> afterNth#(X1, X2)) (afterNth#(mark X1, X2) -> afterNth#(X1, X2), afterNth#(ok X1, ok X2) -> afterNth#(X1, X2)) (splitAt#(ok X1, ok X2) -> splitAt#(X1, X2), splitAt#(X1, mark X2) -> splitAt#(X1, X2)) (splitAt#(ok X1, ok X2) -> splitAt#(X1, X2), splitAt#(mark X1, X2) -> splitAt#(X1, X2)) (splitAt#(ok X1, ok X2) -> splitAt#(X1, X2), splitAt#(ok X1, ok X2) -> splitAt#(X1, X2)) (splitAt#(X1, mark X2) -> splitAt#(X1, X2), splitAt#(X1, mark X2) -> splitAt#(X1, X2)) (splitAt#(X1, mark X2) -> splitAt#(X1, X2), splitAt#(mark X1, X2) -> splitAt#(X1, X2)) (splitAt#(X1, mark X2) -> splitAt#(X1, X2), splitAt#(ok X1, ok X2) -> splitAt#(X1, X2)) (pair#(mark X1, X2) -> pair#(X1, X2), pair#(X1, mark X2) -> pair#(X1, X2)) (pair#(mark X1, X2) -> pair#(X1, X2), pair#(mark X1, X2) -> pair#(X1, X2)) (pair#(mark X1, X2) -> pair#(X1, X2), pair#(ok X1, ok X2) -> pair#(X1, X2)) (cons#(ok X1, ok X2) -> cons#(X1, X2), cons#(mark X1, X2) -> cons#(X1, X2)) (cons#(ok X1, ok X2) -> cons#(X1, X2), cons#(ok X1, ok X2) -> cons#(X1, X2)) (active# u(pair(YS, ZS), N, X, XS) -> pair#(cons(X, YS), ZS), pair#(X1, mark X2) -> pair#(X1, X2)) (active# u(pair(YS, ZS), N, X, XS) -> pair#(cons(X, YS), ZS), pair#(mark X1, X2) -> pair#(X1, X2)) (active# u(pair(YS, ZS), N, X, XS) -> pair#(cons(X, YS), ZS), pair#(ok X1, ok X2) -> pair#(X1, X2)) (active# sel(X1, X2) -> sel#(active X1, X2), sel#(X1, mark X2) -> sel#(X1, X2)) (active# sel(X1, X2) -> sel#(active X1, X2), sel#(mark X1, X2) -> sel#(X1, X2)) (active# sel(X1, X2) -> sel#(active X1, X2), sel#(ok X1, ok X2) -> sel#(X1, X2)) (active# splitAt(X1, X2) -> splitAt#(active X1, X2), splitAt#(X1, mark X2) -> splitAt#(X1, X2)) (active# splitAt(X1, X2) -> splitAt#(active X1, X2), splitAt#(mark X1, X2) -> splitAt#(X1, X2)) (active# splitAt(X1, X2) -> splitAt#(active X1, X2), splitAt#(ok X1, ok X2) -> splitAt#(X1, X2)) (active# cons(X1, X2) -> cons#(active X1, X2), cons#(mark X1, X2) -> cons#(X1, X2)) (active# cons(X1, X2) -> cons#(active X1, X2), cons#(ok X1, ok X2) -> cons#(X1, X2)) (active# natsFrom N -> cons#(N, natsFrom s N), cons#(mark X1, X2) -> cons#(X1, X2)) (active# natsFrom N -> cons#(N, natsFrom s N), cons#(ok X1, ok X2) -> cons#(X1, X2)) (active# sel(N, XS) -> head# afterNth(N, XS), head# mark X -> head# X) (active# sel(N, XS) -> head# afterNth(N, XS), head# ok X -> head# X) (proper# u(X1, X2, X3, X4) -> u#(proper X1, proper X2, proper X3, proper X4), u#(mark X1, X2, X3, X4) -> u#(X1, X2, X3, X4)) (proper# u(X1, X2, X3, X4) -> u#(proper X1, proper X2, proper X3, proper X4), u#(ok X1, ok X2, ok X3, ok X4) -> u#(X1, X2, X3, X4)) (proper# sel(X1, X2) -> proper# X2, proper# cons(X1, X2) -> cons#(proper X1, proper X2)) (proper# sel(X1, X2) -> proper# X2, proper# cons(X1, X2) -> proper# X1) (proper# sel(X1, X2) -> proper# X2, proper# cons(X1, X2) -> proper# X2) (proper# sel(X1, X2) -> proper# X2, proper# natsFrom X -> natsFrom# proper X) (proper# sel(X1, X2) -> proper# X2, proper# natsFrom X -> proper# X) (proper# sel(X1, X2) -> proper# X2, proper# s X -> s# proper X) (proper# sel(X1, X2) -> proper# X2, proper# s X -> proper# X) (proper# sel(X1, X2) -> proper# X2, proper# fst X -> fst# proper X) (proper# sel(X1, X2) -> proper# X2, proper# fst X -> proper# X) (proper# sel(X1, X2) -> proper# X2, proper# pair(X1, X2) -> pair#(proper X1, proper X2)) (proper# sel(X1, X2) -> proper# X2, proper# pair(X1, X2) -> proper# X1) (proper# sel(X1, X2) -> proper# X2, proper# pair(X1, X2) -> proper# X2) (proper# sel(X1, X2) -> proper# X2, proper# snd X -> snd# proper X) (proper# sel(X1, X2) -> proper# X2, proper# snd X -> proper# X) (proper# sel(X1, X2) -> proper# X2, proper# splitAt(X1, X2) -> splitAt#(proper X1, proper X2)) (proper# sel(X1, X2) -> proper# X2, proper# splitAt(X1, X2) -> proper# X1) (proper# sel(X1, X2) -> proper# X2, proper# splitAt(X1, X2) -> proper# X2) (proper# sel(X1, X2) -> proper# X2, proper# u(X1, X2, X3, X4) -> u#(proper X1, proper X2, proper X3, proper X4)) (proper# sel(X1, X2) -> proper# X2, proper# u(X1, X2, X3, X4) -> proper# X1) (proper# sel(X1, X2) -> proper# X2, proper# u(X1, X2, X3, X4) -> proper# X2) (proper# sel(X1, X2) -> proper# X2, proper# u(X1, X2, X3, X4) -> proper# X3) (proper# sel(X1, X2) -> proper# X2, proper# u(X1, X2, X3, X4) -> proper# X4) (proper# sel(X1, X2) -> proper# X2, proper# head X -> head# proper X) (proper# sel(X1, X2) -> proper# X2, proper# head X -> proper# X) (proper# sel(X1, X2) -> proper# X2, proper# tail X -> tail# proper X) (proper# sel(X1, X2) -> proper# X2, proper# tail X -> proper# X) (proper# sel(X1, X2) -> proper# X2, proper# afterNth(X1, X2) -> afterNth#(proper X1, proper X2)) (proper# sel(X1, X2) -> proper# X2, proper# afterNth(X1, X2) -> proper# X1) (proper# sel(X1, X2) -> proper# X2, proper# afterNth(X1, X2) -> proper# X2) (proper# sel(X1, X2) -> proper# X2, proper# sel(X1, X2) -> sel#(proper X1, proper X2)) (proper# sel(X1, X2) -> proper# X2, proper# sel(X1, X2) -> proper# X1) (proper# sel(X1, X2) -> proper# X2, proper# sel(X1, X2) -> proper# X2) (proper# sel(X1, X2) -> proper# X2, proper# take(X1, X2) -> take#(proper X1, proper X2)) (proper# sel(X1, X2) -> proper# X2, proper# take(X1, X2) -> proper# X1) (proper# sel(X1, X2) -> proper# X2, proper# take(X1, X2) -> proper# X2) (proper# u(X1, X2, X3, X4) -> proper# X2, proper# cons(X1, X2) -> cons#(proper X1, proper X2)) (proper# u(X1, X2, X3, X4) -> proper# X2, proper# cons(X1, X2) -> proper# X1) (proper# u(X1, X2, X3, X4) -> proper# X2, proper# cons(X1, X2) -> proper# X2) (proper# u(X1, X2, X3, X4) -> proper# X2, proper# natsFrom X -> natsFrom# proper X) (proper# u(X1, X2, X3, X4) -> proper# X2, proper# natsFrom X -> proper# X) (proper# u(X1, X2, X3, X4) -> proper# X2, proper# s X -> s# proper X) (proper# u(X1, X2, X3, X4) -> proper# X2, proper# s X -> proper# X) (proper# u(X1, X2, X3, X4) -> proper# X2, proper# fst X -> fst# proper X) (proper# u(X1, X2, X3, X4) -> proper# X2, proper# fst X -> proper# X) (proper# u(X1, X2, X3, X4) -> proper# X2, proper# pair(X1, X2) -> pair#(proper X1, proper X2)) (proper# u(X1, X2, X3, X4) -> proper# X2, proper# pair(X1, X2) -> proper# X1) (proper# u(X1, X2, X3, X4) -> proper# X2, proper# pair(X1, X2) -> proper# X2) (proper# u(X1, X2, X3, X4) -> proper# X2, proper# snd X -> snd# proper X) (proper# u(X1, X2, X3, X4) -> proper# X2, proper# snd X -> proper# X) (proper# u(X1, X2, X3, X4) -> proper# X2, proper# splitAt(X1, X2) -> splitAt#(proper X1, proper X2)) (proper# u(X1, X2, X3, X4) -> proper# X2, proper# splitAt(X1, X2) -> proper# X1) (proper# u(X1, X2, X3, X4) -> proper# X2, proper# splitAt(X1, X2) -> proper# X2) (proper# u(X1, X2, X3, X4) -> proper# X2, proper# u(X1, X2, X3, X4) -> u#(proper X1, proper X2, proper X3, proper X4)) (proper# u(X1, X2, X3, X4) -> proper# X2, proper# u(X1, X2, X3, X4) -> proper# X1) (proper# u(X1, X2, X3, X4) -> proper# X2, proper# u(X1, X2, X3, X4) -> proper# X2) (proper# u(X1, X2, X3, X4) -> proper# X2, proper# u(X1, X2, X3, X4) -> proper# X3) (proper# u(X1, X2, X3, X4) -> proper# X2, proper# u(X1, X2, X3, X4) -> proper# X4) (proper# u(X1, X2, X3, X4) -> proper# X2, proper# head X -> head# proper X) (proper# u(X1, X2, X3, X4) -> proper# X2, proper# head X -> proper# X) (proper# u(X1, X2, X3, X4) -> proper# X2, proper# tail X -> tail# proper X) (proper# u(X1, X2, X3, X4) -> proper# X2, proper# tail X -> proper# X) (proper# u(X1, X2, X3, X4) -> proper# X2, proper# afterNth(X1, X2) -> afterNth#(proper X1, proper X2)) (proper# u(X1, X2, X3, X4) -> proper# X2, proper# afterNth(X1, X2) -> proper# X1) (proper# u(X1, X2, X3, X4) -> proper# X2, proper# afterNth(X1, X2) -> proper# X2) (proper# u(X1, X2, X3, X4) -> proper# X2, proper# sel(X1, X2) -> sel#(proper X1, proper X2)) (proper# u(X1, X2, X3, X4) -> proper# X2, proper# sel(X1, X2) -> proper# X1) (proper# u(X1, X2, X3, X4) -> proper# X2, proper# sel(X1, X2) -> proper# X2) (proper# u(X1, X2, X3, X4) -> proper# X2, proper# take(X1, X2) -> take#(proper X1, proper X2)) (proper# u(X1, X2, X3, X4) -> proper# X2, proper# take(X1, X2) -> proper# X1) (proper# u(X1, X2, X3, X4) -> proper# X2, proper# take(X1, X2) -> proper# X2) (proper# pair(X1, X2) -> proper# X2, proper# cons(X1, X2) -> cons#(proper X1, proper X2)) (proper# pair(X1, X2) -> proper# X2, proper# cons(X1, X2) -> proper# X1) (proper# pair(X1, X2) -> proper# X2, proper# cons(X1, X2) -> proper# X2) (proper# pair(X1, X2) -> proper# X2, proper# natsFrom X -> natsFrom# proper X) (proper# pair(X1, X2) -> proper# X2, proper# natsFrom X -> proper# X) (proper# pair(X1, X2) -> proper# X2, proper# s X -> s# proper X) (proper# pair(X1, X2) -> proper# X2, proper# s X -> proper# X) (proper# pair(X1, X2) -> proper# X2, proper# fst X -> fst# proper X) (proper# pair(X1, X2) -> proper# X2, proper# fst X -> proper# X) (proper# pair(X1, X2) -> proper# X2, proper# pair(X1, X2) -> pair#(proper X1, proper X2)) (proper# pair(X1, X2) -> proper# X2, proper# pair(X1, X2) -> proper# X1) (proper# pair(X1, X2) -> proper# X2, proper# pair(X1, X2) -> proper# X2) (proper# pair(X1, X2) -> proper# X2, proper# snd X -> snd# proper X) (proper# pair(X1, X2) -> proper# X2, proper# snd X -> proper# X) (proper# pair(X1, X2) -> proper# X2, proper# splitAt(X1, X2) -> splitAt#(proper X1, proper X2)) (proper# pair(X1, X2) -> proper# X2, proper# splitAt(X1, X2) -> proper# X1) (proper# pair(X1, X2) -> proper# X2, proper# splitAt(X1, X2) -> proper# X2) (proper# pair(X1, X2) -> proper# X2, proper# u(X1, X2, X3, X4) -> u#(proper X1, proper X2, proper X3, proper X4)) (proper# pair(X1, X2) -> proper# X2, proper# u(X1, X2, X3, X4) -> proper# X1) (proper# pair(X1, X2) -> proper# X2, proper# u(X1, X2, X3, X4) -> proper# X2) (proper# pair(X1, X2) -> proper# X2, proper# u(X1, X2, X3, X4) -> proper# X3) (proper# pair(X1, X2) -> proper# X2, proper# u(X1, X2, X3, X4) -> proper# X4) (proper# pair(X1, X2) -> proper# X2, proper# head X -> head# proper X) (proper# pair(X1, X2) -> proper# X2, proper# head X -> proper# X) (proper# pair(X1, X2) -> proper# X2, proper# tail X -> tail# proper X) (proper# pair(X1, X2) -> proper# X2, proper# tail X -> proper# X) (proper# pair(X1, X2) -> proper# X2, proper# afterNth(X1, X2) -> afterNth#(proper X1, proper X2)) (proper# pair(X1, X2) -> proper# X2, proper# afterNth(X1, X2) -> proper# X1) (proper# pair(X1, X2) -> proper# X2, proper# afterNth(X1, X2) -> proper# X2) (proper# pair(X1, X2) -> proper# X2, proper# sel(X1, X2) -> sel#(proper X1, proper X2)) (proper# pair(X1, X2) -> proper# X2, proper# sel(X1, X2) -> proper# X1) (proper# pair(X1, X2) -> proper# X2, proper# sel(X1, X2) -> proper# X2) (proper# pair(X1, X2) -> proper# X2, proper# take(X1, X2) -> take#(proper X1, proper X2)) (proper# pair(X1, X2) -> proper# X2, proper# take(X1, X2) -> proper# X1) (proper# pair(X1, X2) -> proper# X2, proper# take(X1, X2) -> proper# X2) (active# take(X1, X2) -> active# X2, active# cons(X1, X2) -> cons#(active X1, X2)) (active# take(X1, X2) -> active# X2, active# cons(X1, X2) -> active# X1) (active# take(X1, X2) -> active# X2, active# natsFrom N -> cons#(N, natsFrom s N)) (active# take(X1, X2) -> active# X2, active# natsFrom N -> natsFrom# s N) (active# take(X1, X2) -> active# X2, active# natsFrom N -> s# N) (active# take(X1, X2) -> active# X2, active# natsFrom X -> natsFrom# active X) (active# take(X1, X2) -> active# X2, active# natsFrom X -> active# X) (active# take(X1, X2) -> active# X2, active# s X -> s# active X) (active# take(X1, X2) -> active# X2, active# s X -> active# X) (active# take(X1, X2) -> active# X2, active# fst X -> active# X) (active# take(X1, X2) -> active# X2, active# fst X -> fst# active X) (active# take(X1, X2) -> active# X2, active# pair(X1, X2) -> active# X1) (active# take(X1, X2) -> active# X2, active# pair(X1, X2) -> active# X2) (active# take(X1, X2) -> active# X2, active# pair(X1, X2) -> pair#(X1, active X2)) (active# take(X1, X2) -> active# X2, active# pair(X1, X2) -> pair#(active X1, X2)) (active# take(X1, X2) -> active# X2, active# snd X -> active# X) (active# take(X1, X2) -> active# X2, active# snd X -> snd# active X) (active# take(X1, X2) -> active# X2, active# splitAt(X1, X2) -> active# X1) (active# take(X1, X2) -> active# X2, active# splitAt(X1, X2) -> active# X2) (active# take(X1, X2) -> active# X2, active# splitAt(X1, X2) -> splitAt#(X1, active X2)) (active# take(X1, X2) -> active# X2, active# splitAt(X1, X2) -> splitAt#(active X1, X2)) (active# take(X1, X2) -> active# X2, active# splitAt(s N, cons(X, XS)) -> splitAt#(N, XS)) (active# take(X1, X2) -> active# X2, active# splitAt(s N, cons(X, XS)) -> u#(splitAt(N, XS), N, X, XS)) (active# take(X1, X2) -> active# X2, active# splitAt(0(), XS) -> pair#(nil(), XS)) (active# take(X1, X2) -> active# X2, active# u(X1, X2, X3, X4) -> active# X1) (active# take(X1, X2) -> active# X2, active# u(X1, X2, X3, X4) -> u#(active X1, X2, X3, X4)) (active# take(X1, X2) -> active# X2, active# u(pair(YS, ZS), N, X, XS) -> cons#(X, YS)) (active# take(X1, X2) -> active# X2, active# u(pair(YS, ZS), N, X, XS) -> pair#(cons(X, YS), ZS)) (active# take(X1, X2) -> active# X2, active# head X -> active# X) (active# take(X1, X2) -> active# X2, active# head X -> head# active X) (active# take(X1, X2) -> active# X2, active# tail X -> active# X) (active# take(X1, X2) -> active# X2, active# tail X -> tail# active X) (active# take(X1, X2) -> active# X2, active# afterNth(N, XS) -> snd# splitAt(N, XS)) (active# take(X1, X2) -> active# X2, active# afterNth(N, XS) -> splitAt#(N, XS)) (active# take(X1, X2) -> active# X2, active# afterNth(X1, X2) -> active# X1) (active# take(X1, X2) -> active# X2, active# afterNth(X1, X2) -> active# X2) (active# take(X1, X2) -> active# X2, active# afterNth(X1, X2) -> afterNth#(X1, active X2)) (active# take(X1, X2) -> active# X2, active# afterNth(X1, X2) -> afterNth#(active X1, X2)) (active# take(X1, X2) -> active# X2, active# sel(N, XS) -> head# afterNth(N, XS)) (active# take(X1, X2) -> active# X2, active# sel(N, XS) -> afterNth#(N, XS)) (active# take(X1, X2) -> active# X2, active# sel(X1, X2) -> active# X1) (active# take(X1, X2) -> active# X2, active# sel(X1, X2) -> active# X2) (active# take(X1, X2) -> active# X2, active# sel(X1, X2) -> sel#(X1, active X2)) (active# take(X1, X2) -> active# X2, active# sel(X1, X2) -> sel#(active X1, X2)) (active# take(X1, X2) -> active# X2, active# take(N, XS) -> fst# splitAt(N, XS)) (active# take(X1, X2) -> active# X2, active# take(N, XS) -> splitAt#(N, XS)) (active# take(X1, X2) -> active# X2, active# take(X1, X2) -> active# X1) (active# take(X1, X2) -> active# X2, active# take(X1, X2) -> active# X2) (active# take(X1, X2) -> active# X2, active# take(X1, X2) -> take#(X1, active X2)) (active# take(X1, X2) -> active# X2, active# take(X1, X2) -> take#(active X1, X2)) (active# afterNth(X1, X2) -> active# X2, active# cons(X1, X2) -> cons#(active X1, X2)) (active# afterNth(X1, X2) -> active# X2, active# cons(X1, X2) -> active# X1) (active# afterNth(X1, X2) -> active# X2, active# natsFrom N -> cons#(N, natsFrom s N)) (active# afterNth(X1, X2) -> active# X2, active# natsFrom N -> natsFrom# s N) (active# afterNth(X1, X2) -> active# X2, active# natsFrom N -> s# N) (active# afterNth(X1, X2) -> active# X2, active# natsFrom X -> natsFrom# active X) (active# afterNth(X1, X2) -> active# X2, active# natsFrom X -> active# X) (active# afterNth(X1, X2) -> active# X2, active# s X -> s# active X) (active# afterNth(X1, X2) -> active# X2, active# s X -> active# X) (active# afterNth(X1, X2) -> active# X2, active# fst X -> active# X) (active# afterNth(X1, X2) -> active# X2, active# fst X -> fst# active X) (active# afterNth(X1, X2) -> active# X2, active# pair(X1, X2) -> active# X1) (active# afterNth(X1, X2) -> active# X2, active# pair(X1, X2) -> active# X2) (active# afterNth(X1, X2) -> active# X2, active# pair(X1, X2) -> pair#(X1, active X2)) (active# afterNth(X1, X2) -> active# X2, active# pair(X1, X2) -> pair#(active X1, X2)) (active# afterNth(X1, X2) -> active# X2, active# snd X -> active# X) (active# afterNth(X1, X2) -> active# X2, active# snd X -> snd# active X) (active# afterNth(X1, X2) -> active# X2, active# splitAt(X1, X2) -> active# X1) (active# afterNth(X1, X2) -> active# X2, active# splitAt(X1, X2) -> active# X2) (active# afterNth(X1, X2) -> active# X2, active# splitAt(X1, X2) -> splitAt#(X1, active X2)) (active# afterNth(X1, X2) -> active# X2, active# splitAt(X1, X2) -> splitAt#(active X1, X2)) (active# afterNth(X1, X2) -> active# X2, active# splitAt(s N, cons(X, XS)) -> splitAt#(N, XS)) (active# afterNth(X1, X2) -> active# X2, active# splitAt(s N, cons(X, XS)) -> u#(splitAt(N, XS), N, X, XS)) (active# afterNth(X1, X2) -> active# X2, active# splitAt(0(), XS) -> pair#(nil(), XS)) (active# afterNth(X1, X2) -> active# X2, active# u(X1, X2, X3, X4) -> active# X1) (active# afterNth(X1, X2) -> active# X2, active# u(X1, X2, X3, X4) -> u#(active X1, X2, X3, X4)) (active# afterNth(X1, X2) -> active# X2, active# u(pair(YS, ZS), N, X, XS) -> cons#(X, YS)) (active# afterNth(X1, X2) -> active# X2, active# u(pair(YS, ZS), N, X, XS) -> pair#(cons(X, YS), ZS)) (active# afterNth(X1, X2) -> active# X2, active# head X -> active# X) (active# afterNth(X1, X2) -> active# X2, active# head X -> head# active X) (active# afterNth(X1, X2) -> active# X2, active# tail X -> active# X) (active# afterNth(X1, X2) -> active# X2, active# tail X -> tail# active X) (active# afterNth(X1, X2) -> active# X2, active# afterNth(N, XS) -> snd# splitAt(N, XS)) (active# afterNth(X1, X2) -> active# X2, active# afterNth(N, XS) -> splitAt#(N, XS)) (active# afterNth(X1, X2) -> active# X2, active# afterNth(X1, X2) -> active# X1) (active# afterNth(X1, X2) -> active# X2, active# afterNth(X1, X2) -> active# X2) (active# afterNth(X1, X2) -> active# X2, active# afterNth(X1, X2) -> afterNth#(X1, active X2)) (active# afterNth(X1, X2) -> active# X2, active# afterNth(X1, X2) -> afterNth#(active X1, X2)) (active# afterNth(X1, X2) -> active# X2, active# sel(N, XS) -> head# afterNth(N, XS)) (active# afterNth(X1, X2) -> active# X2, active# sel(N, XS) -> afterNth#(N, XS)) (active# afterNth(X1, X2) -> active# X2, active# sel(X1, X2) -> active# X1) (active# afterNth(X1, X2) -> active# X2, active# sel(X1, X2) -> active# X2) (active# afterNth(X1, X2) -> active# X2, active# sel(X1, X2) -> sel#(X1, active X2)) (active# afterNth(X1, X2) -> active# X2, active# sel(X1, X2) -> sel#(active X1, X2)) (active# afterNth(X1, X2) -> active# X2, active# take(N, XS) -> fst# splitAt(N, XS)) (active# afterNth(X1, X2) -> active# X2, active# take(N, XS) -> splitAt#(N, XS)) (active# afterNth(X1, X2) -> active# X2, active# take(X1, X2) -> active# X1) (active# afterNth(X1, X2) -> active# X2, active# take(X1, X2) -> active# X2) (active# afterNth(X1, X2) -> active# X2, active# take(X1, X2) -> take#(X1, active X2)) (active# afterNth(X1, X2) -> active# X2, active# take(X1, X2) -> take#(active X1, X2)) (active# pair(X1, X2) -> active# X2, active# cons(X1, X2) -> cons#(active X1, X2)) (active# pair(X1, X2) -> active# X2, active# cons(X1, X2) -> active# X1) (active# pair(X1, X2) -> active# X2, active# natsFrom N -> cons#(N, natsFrom s N)) (active# pair(X1, X2) -> active# X2, active# natsFrom N -> natsFrom# s N) (active# pair(X1, X2) -> active# X2, active# natsFrom N -> s# N) (active# pair(X1, X2) -> active# X2, active# natsFrom X -> natsFrom# active X) (active# pair(X1, X2) -> active# X2, active# natsFrom X -> active# X) (active# pair(X1, X2) -> active# X2, active# s X -> s# active X) (active# pair(X1, X2) -> active# X2, active# s X -> active# X) (active# pair(X1, X2) -> active# X2, active# fst X -> active# X) (active# pair(X1, X2) -> active# X2, active# fst X -> fst# active X) (active# pair(X1, X2) -> active# X2, active# pair(X1, X2) -> active# X1) (active# pair(X1, X2) -> active# X2, active# pair(X1, X2) -> active# X2) (active# pair(X1, X2) -> active# X2, active# pair(X1, X2) -> pair#(X1, active X2)) (active# pair(X1, X2) -> active# X2, active# pair(X1, X2) -> pair#(active X1, X2)) (active# pair(X1, X2) -> active# X2, active# snd X -> active# X) (active# pair(X1, X2) -> active# X2, active# snd X -> snd# active X) (active# pair(X1, X2) -> active# X2, active# splitAt(X1, X2) -> active# X1) (active# pair(X1, X2) -> active# X2, active# splitAt(X1, X2) -> active# X2) (active# pair(X1, X2) -> active# X2, active# splitAt(X1, X2) -> splitAt#(X1, active X2)) (active# pair(X1, X2) -> active# X2, active# splitAt(X1, X2) -> splitAt#(active X1, X2)) (active# pair(X1, X2) -> active# X2, active# splitAt(s N, cons(X, XS)) -> splitAt#(N, XS)) (active# pair(X1, X2) -> active# X2, active# splitAt(s N, cons(X, XS)) -> u#(splitAt(N, XS), N, X, XS)) (active# pair(X1, X2) -> active# X2, active# splitAt(0(), XS) -> pair#(nil(), XS)) (active# pair(X1, X2) -> active# X2, active# u(X1, X2, X3, X4) -> active# X1) (active# pair(X1, X2) -> active# X2, active# u(X1, X2, X3, X4) -> u#(active X1, X2, X3, X4)) (active# pair(X1, X2) -> active# X2, active# u(pair(YS, ZS), N, X, XS) -> cons#(X, YS)) (active# pair(X1, X2) -> active# X2, active# u(pair(YS, ZS), N, X, XS) -> pair#(cons(X, YS), ZS)) (active# pair(X1, X2) -> active# X2, active# head X -> active# X) (active# pair(X1, X2) -> active# X2, active# head X -> head# active X) (active# pair(X1, X2) -> active# X2, active# tail X -> active# X) (active# pair(X1, X2) -> active# X2, active# tail X -> tail# active X) (active# pair(X1, X2) -> active# X2, active# afterNth(N, XS) -> snd# splitAt(N, XS)) (active# pair(X1, X2) -> active# X2, active# afterNth(N, XS) -> splitAt#(N, XS)) (active# pair(X1, X2) -> active# X2, active# afterNth(X1, X2) -> active# X1) (active# pair(X1, X2) -> active# X2, active# afterNth(X1, X2) -> active# X2) (active# pair(X1, X2) -> active# X2, active# afterNth(X1, X2) -> afterNth#(X1, active X2)) (active# pair(X1, X2) -> active# X2, active# afterNth(X1, X2) -> afterNth#(active X1, X2)) (active# pair(X1, X2) -> active# X2, active# sel(N, XS) -> head# afterNth(N, XS)) (active# pair(X1, X2) -> active# X2, active# sel(N, XS) -> afterNth#(N, XS)) (active# pair(X1, X2) -> active# X2, active# sel(X1, X2) -> active# X1) (active# pair(X1, X2) -> active# X2, active# sel(X1, X2) -> active# X2) (active# pair(X1, X2) -> active# X2, active# sel(X1, X2) -> sel#(X1, active X2)) (active# pair(X1, X2) -> active# X2, active# sel(X1, X2) -> sel#(active X1, X2)) (active# pair(X1, X2) -> active# X2, active# take(N, XS) -> fst# splitAt(N, XS)) (active# pair(X1, X2) -> active# X2, active# take(N, XS) -> splitAt#(N, XS)) (active# pair(X1, X2) -> active# X2, active# take(X1, X2) -> active# X1) (active# pair(X1, X2) -> active# X2, active# take(X1, X2) -> active# X2) (active# pair(X1, X2) -> active# X2, active# take(X1, X2) -> take#(X1, active X2)) (active# pair(X1, X2) -> active# X2, active# take(X1, X2) -> take#(active X1, X2)) (active# natsFrom N -> s# N, s# mark X -> s# X) (active# natsFrom N -> s# N, s# ok X -> s# X) } STATUS: arrows: 0.864514 SCCS (16): Scc: {top# mark X -> top# proper X, top# ok X -> top# active X} Scc: { proper# cons(X1, X2) -> proper# X1, proper# cons(X1, X2) -> proper# X2, proper# natsFrom X -> proper# X, proper# s X -> proper# X, proper# fst X -> proper# X, proper# pair(X1, X2) -> proper# X1, proper# pair(X1, X2) -> proper# X2, proper# snd X -> proper# X, proper# splitAt(X1, X2) -> proper# X1, proper# splitAt(X1, X2) -> proper# X2, proper# u(X1, X2, X3, X4) -> proper# X1, proper# u(X1, X2, X3, X4) -> proper# X2, proper# u(X1, X2, X3, X4) -> proper# X3, proper# u(X1, X2, X3, X4) -> proper# X4, proper# head X -> proper# X, proper# tail X -> proper# X, proper# afterNth(X1, X2) -> proper# X1, proper# afterNth(X1, X2) -> proper# X2, proper# sel(X1, X2) -> proper# X1, proper# sel(X1, X2) -> proper# X2, proper# take(X1, X2) -> proper# X1, proper# take(X1, X2) -> proper# X2} Scc: { active# cons(X1, X2) -> active# X1, active# natsFrom X -> active# X, active# s X -> active# X, active# fst X -> active# X, active# pair(X1, X2) -> active# X1, active# pair(X1, X2) -> active# X2, active# snd X -> active# X, active# splitAt(X1, X2) -> active# X1, active# splitAt(X1, X2) -> active# X2, active# u(X1, X2, X3, X4) -> active# X1, active# head X -> active# X, active# tail X -> active# X, active# afterNth(X1, X2) -> active# X1, active# afterNth(X1, X2) -> active# X2, active# sel(X1, X2) -> active# X1, active# sel(X1, X2) -> active# X2, active# take(X1, X2) -> active# X1, active# take(X1, X2) -> active# X2} Scc: { take#(X1, mark X2) -> take#(X1, X2), take#(mark X1, X2) -> take#(X1, X2), take#(ok X1, ok X2) -> take#(X1, X2)} Scc: { sel#(X1, mark X2) -> sel#(X1, X2), sel#(mark X1, X2) -> sel#(X1, X2), sel#(ok X1, ok X2) -> sel#(X1, X2)} Scc: { afterNth#(X1, mark X2) -> afterNth#(X1, X2), afterNth#(mark X1, X2) -> afterNth#(X1, X2), afterNth#(ok X1, ok X2) -> afterNth#(X1, X2)} Scc: {tail# mark X -> tail# X, tail# ok X -> tail# X} Scc: {head# mark X -> head# X, head# ok X -> head# X} Scc: { u#(mark X1, X2, X3, X4) -> u#(X1, X2, X3, X4), u#(ok X1, ok X2, ok X3, ok X4) -> u#(X1, X2, X3, X4)} Scc: { splitAt#(X1, mark X2) -> splitAt#(X1, X2), splitAt#(mark X1, X2) -> splitAt#(X1, X2), splitAt#(ok X1, ok X2) -> splitAt#(X1, X2)} Scc: {snd# mark X -> snd# X, snd# ok X -> snd# X} Scc: {fst# mark X -> fst# X, fst# ok X -> fst# X} Scc: {natsFrom# mark X -> natsFrom# X, natsFrom# ok X -> natsFrom# X} Scc: { cons#(mark X1, X2) -> cons#(X1, X2), cons#(ok X1, ok X2) -> cons#(X1, X2)} Scc: { pair#(X1, mark X2) -> pair#(X1, X2), pair#(mark X1, X2) -> pair#(X1, X2), pair#(ok X1, ok X2) -> pair#(X1, X2)} Scc: {s# mark X -> s# X, s# ok X -> s# X} SCC (2): Strict: {top# mark X -> top# proper X, top# ok X -> top# active X} Weak: { cons(mark X1, X2) -> mark cons(X1, X2), cons(ok X1, ok X2) -> ok cons(X1, X2), natsFrom mark X -> mark natsFrom X, natsFrom ok X -> ok natsFrom X, s mark X -> mark s X, s ok X -> ok s X, active cons(X1, X2) -> cons(active X1, X2), active natsFrom N -> mark cons(N, natsFrom s N), active natsFrom X -> natsFrom active X, active s X -> s active X, active fst X -> fst active X, active fst pair(XS, YS) -> mark XS, active pair(X1, X2) -> pair(X1, active X2), active pair(X1, X2) -> pair(active X1, X2), active snd X -> snd active X, active snd pair(XS, YS) -> mark YS, active splitAt(X1, X2) -> splitAt(X1, active X2), active splitAt(X1, X2) -> splitAt(active X1, X2), active splitAt(s N, cons(X, XS)) -> mark u(splitAt(N, XS), N, X, XS), active splitAt(0(), XS) -> mark pair(nil(), XS), active u(X1, X2, X3, X4) -> u(active X1, X2, X3, X4), active u(pair(YS, ZS), N, X, XS) -> mark pair(cons(X, YS), ZS), active head X -> head active X, active head cons(N, XS) -> mark N, active tail X -> tail active X, active tail cons(N, XS) -> mark XS, active afterNth(N, XS) -> mark snd splitAt(N, XS), active afterNth(X1, X2) -> afterNth(X1, active X2), active afterNth(X1, X2) -> afterNth(active X1, X2), active sel(N, XS) -> mark head afterNth(N, XS), active sel(X1, X2) -> sel(X1, active X2), active sel(X1, X2) -> sel(active X1, X2), active take(N, XS) -> mark fst splitAt(N, XS), active take(X1, X2) -> take(X1, active X2), active take(X1, X2) -> take(active X1, X2), fst mark X -> mark fst X, fst ok X -> ok fst X, pair(X1, mark X2) -> mark pair(X1, X2), pair(mark X1, X2) -> mark pair(X1, X2), pair(ok X1, ok X2) -> ok pair(X1, X2), snd mark X -> mark snd X, snd ok X -> ok snd X, splitAt(X1, mark X2) -> mark splitAt(X1, X2), splitAt(mark X1, X2) -> mark splitAt(X1, X2), splitAt(ok X1, ok X2) -> ok splitAt(X1, X2), u(mark X1, X2, X3, X4) -> mark u(X1, X2, X3, X4), u(ok X1, ok X2, ok X3, ok X4) -> ok u(X1, X2, X3, X4), head mark X -> mark head X, head ok X -> ok head X, tail mark X -> mark tail X, tail ok X -> ok tail X, afterNth(X1, mark X2) -> mark afterNth(X1, X2), afterNth(mark X1, X2) -> mark afterNth(X1, X2), afterNth(ok X1, ok X2) -> ok afterNth(X1, X2), sel(X1, mark X2) -> mark sel(X1, X2), sel(mark X1, X2) -> mark sel(X1, X2), sel(ok X1, ok X2) -> ok sel(X1, X2), take(X1, mark X2) -> mark take(X1, X2), take(mark X1, X2) -> mark take(X1, X2), take(ok X1, ok X2) -> ok take(X1, X2), proper cons(X1, X2) -> cons(proper X1, proper X2), proper natsFrom X -> natsFrom proper X, proper s X -> s proper X, proper fst X -> fst proper X, proper pair(X1, X2) -> pair(proper X1, proper X2), proper snd X -> snd proper X, proper nil() -> ok nil(), proper splitAt(X1, X2) -> splitAt(proper X1, proper X2), proper 0() -> ok 0(), proper u(X1, X2, X3, X4) -> u(proper X1, proper X2, proper X3, proper X4), proper head X -> head proper X, proper tail X -> tail proper X, proper afterNth(X1, X2) -> afterNth(proper X1, proper X2), proper sel(X1, X2) -> sel(proper X1, proper X2), proper take(X1, X2) -> take(proper X1, proper X2), top mark X -> top proper X, top ok X -> top active X} Open SCC (22): Strict: { proper# cons(X1, X2) -> proper# X1, proper# cons(X1, X2) -> proper# X2, proper# natsFrom X -> proper# X, proper# s X -> proper# X, proper# fst X -> proper# X, proper# pair(X1, X2) -> proper# X1, proper# pair(X1, X2) -> proper# X2, proper# snd X -> proper# X, proper# splitAt(X1, X2) -> proper# X1, proper# splitAt(X1, X2) -> proper# X2, proper# u(X1, X2, X3, X4) -> proper# X1, proper# u(X1, X2, X3, X4) -> proper# X2, proper# u(X1, X2, X3, X4) -> proper# X3, proper# u(X1, X2, X3, X4) -> proper# X4, proper# head X -> proper# X, proper# tail X -> proper# X, proper# afterNth(X1, X2) -> proper# X1, proper# afterNth(X1, X2) -> proper# X2, proper# sel(X1, X2) -> proper# X1, proper# sel(X1, X2) -> proper# X2, proper# take(X1, X2) -> proper# X1, proper# take(X1, X2) -> proper# X2} Weak: { cons(mark X1, X2) -> mark cons(X1, X2), cons(ok X1, ok X2) -> ok cons(X1, X2), natsFrom mark X -> mark natsFrom X, natsFrom ok X -> ok natsFrom X, s mark X -> mark s X, s ok X -> ok s X, active cons(X1, X2) -> cons(active X1, X2), active natsFrom N -> mark cons(N, natsFrom s N), active natsFrom X -> natsFrom active X, active s X -> s active X, active fst X -> fst active X, active fst pair(XS, YS) -> mark XS, active pair(X1, X2) -> pair(X1, active X2), active pair(X1, X2) -> pair(active X1, X2), active snd X -> snd active X, active snd pair(XS, YS) -> mark YS, active splitAt(X1, X2) -> splitAt(X1, active X2), active splitAt(X1, X2) -> splitAt(active X1, X2), active splitAt(s N, cons(X, XS)) -> mark u(splitAt(N, XS), N, X, XS), active splitAt(0(), XS) -> mark pair(nil(), XS), active u(X1, X2, X3, X4) -> u(active X1, X2, X3, X4), active u(pair(YS, ZS), N, X, XS) -> mark pair(cons(X, YS), ZS), active head X -> head active X, active head cons(N, XS) -> mark N, active tail X -> tail active X, active tail cons(N, XS) -> mark XS, active afterNth(N, XS) -> mark snd splitAt(N, XS), active afterNth(X1, X2) -> afterNth(X1, active X2), active afterNth(X1, X2) -> afterNth(active X1, X2), active sel(N, XS) -> mark head afterNth(N, XS), active sel(X1, X2) -> sel(X1, active X2), active sel(X1, X2) -> sel(active X1, X2), active take(N, XS) -> mark fst splitAt(N, XS), active take(X1, X2) -> take(X1, active X2), active take(X1, X2) -> take(active X1, X2), fst mark X -> mark fst X, fst ok X -> ok fst X, pair(X1, mark X2) -> mark pair(X1, X2), pair(mark X1, X2) -> mark pair(X1, X2), pair(ok X1, ok X2) -> ok pair(X1, X2), snd mark X -> mark snd X, snd ok X -> ok snd X, splitAt(X1, mark X2) -> mark splitAt(X1, X2), splitAt(mark X1, X2) -> mark splitAt(X1, X2), splitAt(ok X1, ok X2) -> ok splitAt(X1, X2), u(mark X1, X2, X3, X4) -> mark u(X1, X2, X3, X4), u(ok X1, ok X2, ok X3, ok X4) -> ok u(X1, X2, X3, X4), head mark X -> mark head X, head ok X -> ok head X, tail mark X -> mark tail X, tail ok X -> ok tail X, afterNth(X1, mark X2) -> mark afterNth(X1, X2), afterNth(mark X1, X2) -> mark afterNth(X1, X2), afterNth(ok X1, ok X2) -> ok afterNth(X1, X2), sel(X1, mark X2) -> mark sel(X1, X2), sel(mark X1, X2) -> mark sel(X1, X2), sel(ok X1, ok X2) -> ok sel(X1, X2), take(X1, mark X2) -> mark take(X1, X2), take(mark X1, X2) -> mark take(X1, X2), take(ok X1, ok X2) -> ok take(X1, X2), proper cons(X1, X2) -> cons(proper X1, proper X2), proper natsFrom X -> natsFrom proper X, proper s X -> s proper X, proper fst X -> fst proper X, proper pair(X1, X2) -> pair(proper X1, proper X2), proper snd X -> snd proper X, proper nil() -> ok nil(), proper splitAt(X1, X2) -> splitAt(proper X1, proper X2), proper 0() -> ok 0(), proper u(X1, X2, X3, X4) -> u(proper X1, proper X2, proper X3, proper X4), proper head X -> head proper X, proper tail X -> tail proper X, proper afterNth(X1, X2) -> afterNth(proper X1, proper X2), proper sel(X1, X2) -> sel(proper X1, proper X2), proper take(X1, X2) -> take(proper X1, proper X2), top mark X -> top proper X, top ok X -> top active X} Open SCC (18): Strict: { active# cons(X1, X2) -> active# X1, active# natsFrom X -> active# X, active# s X -> active# X, active# fst X -> active# X, active# pair(X1, X2) -> active# X1, active# pair(X1, X2) -> active# X2, active# snd X -> active# X, active# splitAt(X1, X2) -> active# X1, active# splitAt(X1, X2) -> active# X2, active# u(X1, X2, X3, X4) -> active# X1, active# head X -> active# X, active# tail X -> active# X, active# afterNth(X1, X2) -> active# X1, active# afterNth(X1, X2) -> active# X2, active# sel(X1, X2) -> active# X1, active# sel(X1, X2) -> active# X2, active# take(X1, X2) -> active# X1, active# take(X1, X2) -> active# X2} Weak: { cons(mark X1, X2) -> mark cons(X1, X2), cons(ok X1, ok X2) -> ok cons(X1, X2), natsFrom mark X -> mark natsFrom X, natsFrom ok X -> ok natsFrom X, s mark X -> mark s X, s ok X -> ok s X, active cons(X1, X2) -> cons(active X1, X2), active natsFrom N -> mark cons(N, natsFrom s N), active natsFrom X -> natsFrom active X, active s X -> s active X, active fst X -> fst active X, active fst pair(XS, YS) -> mark XS, active pair(X1, X2) -> pair(X1, active X2), active pair(X1, X2) -> pair(active X1, X2), active snd X -> snd active X, active snd pair(XS, YS) -> mark YS, active splitAt(X1, X2) -> splitAt(X1, active X2), active splitAt(X1, X2) -> splitAt(active X1, X2), active splitAt(s N, cons(X, XS)) -> mark u(splitAt(N, XS), N, X, XS), active splitAt(0(), XS) -> mark pair(nil(), XS), active u(X1, X2, X3, X4) -> u(active X1, X2, X3, X4), active u(pair(YS, ZS), N, X, XS) -> mark pair(cons(X, YS), ZS), active head X -> head active X, active head cons(N, XS) -> mark N, active tail X -> tail active X, active tail cons(N, XS) -> mark XS, active afterNth(N, XS) -> mark snd splitAt(N, XS), active afterNth(X1, X2) -> afterNth(X1, active X2), active afterNth(X1, X2) -> afterNth(active X1, X2), active sel(N, XS) -> mark head afterNth(N, XS), active sel(X1, X2) -> sel(X1, active X2), active sel(X1, X2) -> sel(active X1, X2), active take(N, XS) -> mark fst splitAt(N, XS), active take(X1, X2) -> take(X1, active X2), active take(X1, X2) -> take(active X1, X2), fst mark X -> mark fst X, fst ok X -> ok fst X, pair(X1, mark X2) -> mark pair(X1, X2), pair(mark X1, X2) -> mark pair(X1, X2), pair(ok X1, ok X2) -> ok pair(X1, X2), snd mark X -> mark snd X, snd ok X -> ok snd X, splitAt(X1, mark X2) -> mark splitAt(X1, X2), splitAt(mark X1, X2) -> mark splitAt(X1, X2), splitAt(ok X1, ok X2) -> ok splitAt(X1, X2), u(mark X1, X2, X3, X4) -> mark u(X1, X2, X3, X4), u(ok X1, ok X2, ok X3, ok X4) -> ok u(X1, X2, X3, X4), head mark X -> mark head X, head ok X -> ok head X, tail mark X -> mark tail X, tail ok X -> ok tail X, afterNth(X1, mark X2) -> mark afterNth(X1, X2), afterNth(mark X1, X2) -> mark afterNth(X1, X2), afterNth(ok X1, ok X2) -> ok afterNth(X1, X2), sel(X1, mark X2) -> mark sel(X1, X2), sel(mark X1, X2) -> mark sel(X1, X2), sel(ok X1, ok X2) -> ok sel(X1, X2), take(X1, mark X2) -> mark take(X1, X2), take(mark X1, X2) -> mark take(X1, X2), take(ok X1, ok X2) -> ok take(X1, X2), proper cons(X1, X2) -> cons(proper X1, proper X2), proper natsFrom X -> natsFrom proper X, proper s X -> s proper X, proper fst X -> fst proper X, proper pair(X1, X2) -> pair(proper X1, proper X2), proper snd X -> snd proper X, proper nil() -> ok nil(), proper splitAt(X1, X2) -> splitAt(proper X1, proper X2), proper 0() -> ok 0(), proper u(X1, X2, X3, X4) -> u(proper X1, proper X2, proper X3, proper X4), proper head X -> head proper X, proper tail X -> tail proper X, proper afterNth(X1, X2) -> afterNth(proper X1, proper X2), proper sel(X1, X2) -> sel(proper X1, proper X2), proper take(X1, X2) -> take(proper X1, proper X2), top mark X -> top proper X, top ok X -> top active X} Open SCC (3): Strict: { take#(X1, mark X2) -> take#(X1, X2), take#(mark X1, X2) -> take#(X1, X2), take#(ok X1, ok X2) -> take#(X1, X2)} Weak: { cons(mark X1, X2) -> mark cons(X1, X2), cons(ok X1, ok X2) -> ok cons(X1, X2), natsFrom mark X -> mark natsFrom X, natsFrom ok X -> ok natsFrom X, s mark X -> mark s X, s ok X -> ok s X, active cons(X1, X2) -> cons(active X1, X2), active natsFrom N -> mark cons(N, natsFrom s N), active natsFrom X -> natsFrom active X, active s X -> s active X, active fst X -> fst active X, active fst pair(XS, YS) -> mark XS, active pair(X1, X2) -> pair(X1, active X2), active pair(X1, X2) -> pair(active X1, X2), active snd X -> snd active X, active snd pair(XS, YS) -> mark YS, active splitAt(X1, X2) -> splitAt(X1, active X2), active splitAt(X1, X2) -> splitAt(active X1, X2), active splitAt(s N, cons(X, XS)) -> mark u(splitAt(N, XS), N, X, XS), active splitAt(0(), XS) -> mark pair(nil(), XS), active u(X1, X2, X3, X4) -> u(active X1, X2, X3, X4), active u(pair(YS, ZS), N, X, XS) -> mark pair(cons(X, YS), ZS), active head X -> head active X, active head cons(N, XS) -> mark N, active tail X -> tail active X, active tail cons(N, XS) -> mark XS, active afterNth(N, XS) -> mark snd splitAt(N, XS), active afterNth(X1, X2) -> afterNth(X1, active X2), active afterNth(X1, X2) -> afterNth(active X1, X2), active sel(N, XS) -> mark head afterNth(N, XS), active sel(X1, X2) -> sel(X1, active X2), active sel(X1, X2) -> sel(active X1, X2), active take(N, XS) -> mark fst splitAt(N, XS), active take(X1, X2) -> take(X1, active X2), active take(X1, X2) -> take(active X1, X2), fst mark X -> mark fst X, fst ok X -> ok fst X, pair(X1, mark X2) -> mark pair(X1, X2), pair(mark X1, X2) -> mark pair(X1, X2), pair(ok X1, ok X2) -> ok pair(X1, X2), snd mark X -> mark snd X, snd ok X -> ok snd X, splitAt(X1, mark X2) -> mark splitAt(X1, X2), splitAt(mark X1, X2) -> mark splitAt(X1, X2), splitAt(ok X1, ok X2) -> ok splitAt(X1, X2), u(mark X1, X2, X3, X4) -> mark u(X1, X2, X3, X4), u(ok X1, ok X2, ok X3, ok X4) -> ok u(X1, X2, X3, X4), head mark X -> mark head X, head ok X -> ok head X, tail mark X -> mark tail X, tail ok X -> ok tail X, afterNth(X1, mark X2) -> mark afterNth(X1, X2), afterNth(mark X1, X2) -> mark afterNth(X1, X2), afterNth(ok X1, ok X2) -> ok afterNth(X1, X2), sel(X1, mark X2) -> mark sel(X1, X2), sel(mark X1, X2) -> mark sel(X1, X2), sel(ok X1, ok X2) -> ok sel(X1, X2), take(X1, mark X2) -> mark take(X1, X2), take(mark X1, X2) -> mark take(X1, X2), take(ok X1, ok X2) -> ok take(X1, X2), proper cons(X1, X2) -> cons(proper X1, proper X2), proper natsFrom X -> natsFrom proper X, proper s X -> s proper X, proper fst X -> fst proper X, proper pair(X1, X2) -> pair(proper X1, proper X2), proper snd X -> snd proper X, proper nil() -> ok nil(), proper splitAt(X1, X2) -> splitAt(proper X1, proper X2), proper 0() -> ok 0(), proper u(X1, X2, X3, X4) -> u(proper X1, proper X2, proper X3, proper X4), proper head X -> head proper X, proper tail X -> tail proper X, proper afterNth(X1, X2) -> afterNth(proper X1, proper X2), proper sel(X1, X2) -> sel(proper X1, proper X2), proper take(X1, X2) -> take(proper X1, proper X2), top mark X -> top proper X, top ok X -> top active X} Open SCC (3): Strict: { sel#(X1, mark X2) -> sel#(X1, X2), sel#(mark X1, X2) -> sel#(X1, X2), sel#(ok X1, ok X2) -> sel#(X1, X2)} Weak: { cons(mark X1, X2) -> mark cons(X1, X2), cons(ok X1, ok X2) -> ok cons(X1, X2), natsFrom mark X -> mark natsFrom X, natsFrom ok X -> ok natsFrom X, s mark X -> mark s X, s ok X -> ok s X, active cons(X1, X2) -> cons(active X1, X2), active natsFrom N -> mark cons(N, natsFrom s N), active natsFrom X -> natsFrom active X, active s X -> s active X, active fst X -> fst active X, active fst pair(XS, YS) -> mark XS, active pair(X1, X2) -> pair(X1, active X2), active pair(X1, X2) -> pair(active X1, X2), active snd X -> snd active X, active snd pair(XS, YS) -> mark YS, active splitAt(X1, X2) -> splitAt(X1, active X2), active splitAt(X1, X2) -> splitAt(active X1, X2), active splitAt(s N, cons(X, XS)) -> mark u(splitAt(N, XS), N, X, XS), active splitAt(0(), XS) -> mark pair(nil(), XS), active u(X1, X2, X3, X4) -> u(active X1, X2, X3, X4), active u(pair(YS, ZS), N, X, XS) -> mark pair(cons(X, YS), ZS), active head X -> head active X, active head cons(N, XS) -> mark N, active tail X -> tail active X, active tail cons(N, XS) -> mark XS, active afterNth(N, XS) -> mark snd splitAt(N, XS), active afterNth(X1, X2) -> afterNth(X1, active X2), active afterNth(X1, X2) -> afterNth(active X1, X2), active sel(N, XS) -> mark head afterNth(N, XS), active sel(X1, X2) -> sel(X1, active X2), active sel(X1, X2) -> sel(active X1, X2), active take(N, XS) -> mark fst splitAt(N, XS), active take(X1, X2) -> take(X1, active X2), active take(X1, X2) -> take(active X1, X2), fst mark X -> mark fst X, fst ok X -> ok fst X, pair(X1, mark X2) -> mark pair(X1, X2), pair(mark X1, X2) -> mark pair(X1, X2), pair(ok X1, ok X2) -> ok pair(X1, X2), snd mark X -> mark snd X, snd ok X -> ok snd X, splitAt(X1, mark X2) -> mark splitAt(X1, X2), splitAt(mark X1, X2) -> mark splitAt(X1, X2), splitAt(ok X1, ok X2) -> ok splitAt(X1, X2), u(mark X1, X2, X3, X4) -> mark u(X1, X2, X3, X4), u(ok X1, ok X2, ok X3, ok X4) -> ok u(X1, X2, X3, X4), head mark X -> mark head X, head ok X -> ok head X, tail mark X -> mark tail X, tail ok X -> ok tail X, afterNth(X1, mark X2) -> mark afterNth(X1, X2), afterNth(mark X1, X2) -> mark afterNth(X1, X2), afterNth(ok X1, ok X2) -> ok afterNth(X1, X2), sel(X1, mark X2) -> mark sel(X1, X2), sel(mark X1, X2) -> mark sel(X1, X2), sel(ok X1, ok X2) -> ok sel(X1, X2), take(X1, mark X2) -> mark take(X1, X2), take(mark X1, X2) -> mark take(X1, X2), take(ok X1, ok X2) -> ok take(X1, X2), proper cons(X1, X2) -> cons(proper X1, proper X2), proper natsFrom X -> natsFrom proper X, proper s X -> s proper X, proper fst X -> fst proper X, proper pair(X1, X2) -> pair(proper X1, proper X2), proper snd X -> snd proper X, proper nil() -> ok nil(), proper splitAt(X1, X2) -> splitAt(proper X1, proper X2), proper 0() -> ok 0(), proper u(X1, X2, X3, X4) -> u(proper X1, proper X2, proper X3, proper X4), proper head X -> head proper X, proper tail X -> tail proper X, proper afterNth(X1, X2) -> afterNth(proper X1, proper X2), proper sel(X1, X2) -> sel(proper X1, proper X2), proper take(X1, X2) -> take(proper X1, proper X2), top mark X -> top proper X, top ok X -> top active X} Open SCC (3): Strict: { afterNth#(X1, mark X2) -> afterNth#(X1, X2), afterNth#(mark X1, X2) -> afterNth#(X1, X2), afterNth#(ok X1, ok X2) -> afterNth#(X1, X2)} Weak: { cons(mark X1, X2) -> mark cons(X1, X2), cons(ok X1, ok X2) -> ok cons(X1, X2), natsFrom mark X -> mark natsFrom X, natsFrom ok X -> ok natsFrom X, s mark X -> mark s X, s ok X -> ok s X, active cons(X1, X2) -> cons(active X1, X2), active natsFrom N -> mark cons(N, natsFrom s N), active natsFrom X -> natsFrom active X, active s X -> s active X, active fst X -> fst active X, active fst pair(XS, YS) -> mark XS, active pair(X1, X2) -> pair(X1, active X2), active pair(X1, X2) -> pair(active X1, X2), active snd X -> snd active X, active snd pair(XS, YS) -> mark YS, active splitAt(X1, X2) -> splitAt(X1, active X2), active splitAt(X1, X2) -> splitAt(active X1, X2), active splitAt(s N, cons(X, XS)) -> mark u(splitAt(N, XS), N, X, XS), active splitAt(0(), XS) -> mark pair(nil(), XS), active u(X1, X2, X3, X4) -> u(active X1, X2, X3, X4), active u(pair(YS, ZS), N, X, XS) -> mark pair(cons(X, YS), ZS), active head X -> head active X, active head cons(N, XS) -> mark N, active tail X -> tail active X, active tail cons(N, XS) -> mark XS, active afterNth(N, XS) -> mark snd splitAt(N, XS), active afterNth(X1, X2) -> afterNth(X1, active X2), active afterNth(X1, X2) -> afterNth(active X1, X2), active sel(N, XS) -> mark head afterNth(N, XS), active sel(X1, X2) -> sel(X1, active X2), active sel(X1, X2) -> sel(active X1, X2), active take(N, XS) -> mark fst splitAt(N, XS), active take(X1, X2) -> take(X1, active X2), active take(X1, X2) -> take(active X1, X2), fst mark X -> mark fst X, fst ok X -> ok fst X, pair(X1, mark X2) -> mark pair(X1, X2), pair(mark X1, X2) -> mark pair(X1, X2), pair(ok X1, ok X2) -> ok pair(X1, X2), snd mark X -> mark snd X, snd ok X -> ok snd X, splitAt(X1, mark X2) -> mark splitAt(X1, X2), splitAt(mark X1, X2) -> mark splitAt(X1, X2), splitAt(ok X1, ok X2) -> ok splitAt(X1, X2), u(mark X1, X2, X3, X4) -> mark u(X1, X2, X3, X4), u(ok X1, ok X2, ok X3, ok X4) -> ok u(X1, X2, X3, X4), head mark X -> mark head X, head ok X -> ok head X, tail mark X -> mark tail X, tail ok X -> ok tail X, afterNth(X1, mark X2) -> mark afterNth(X1, X2), afterNth(mark X1, X2) -> mark afterNth(X1, X2), afterNth(ok X1, ok X2) -> ok afterNth(X1, X2), sel(X1, mark X2) -> mark sel(X1, X2), sel(mark X1, X2) -> mark sel(X1, X2), sel(ok X1, ok X2) -> ok sel(X1, X2), take(X1, mark X2) -> mark take(X1, X2), take(mark X1, X2) -> mark take(X1, X2), take(ok X1, ok X2) -> ok take(X1, X2), proper cons(X1, X2) -> cons(proper X1, proper X2), proper natsFrom X -> natsFrom proper X, proper s X -> s proper X, proper fst X -> fst proper X, proper pair(X1, X2) -> pair(proper X1, proper X2), proper snd X -> snd proper X, proper nil() -> ok nil(), proper splitAt(X1, X2) -> splitAt(proper X1, proper X2), proper 0() -> ok 0(), proper u(X1, X2, X3, X4) -> u(proper X1, proper X2, proper X3, proper X4), proper head X -> head proper X, proper tail X -> tail proper X, proper afterNth(X1, X2) -> afterNth(proper X1, proper X2), proper sel(X1, X2) -> sel(proper X1, proper X2), proper take(X1, X2) -> take(proper X1, proper X2), top mark X -> top proper X, top ok X -> top active X} Open SCC (2): Strict: {tail# mark X -> tail# X, tail# ok X -> tail# X} Weak: { cons(mark X1, X2) -> mark cons(X1, X2), cons(ok X1, ok X2) -> ok cons(X1, X2), natsFrom mark X -> mark natsFrom X, natsFrom ok X -> ok natsFrom X, s mark X -> mark s X, s ok X -> ok s X, active cons(X1, X2) -> cons(active X1, X2), active natsFrom N -> mark cons(N, natsFrom s N), active natsFrom X -> natsFrom active X, active s X -> s active X, active fst X -> fst active X, active fst pair(XS, YS) -> mark XS, active pair(X1, X2) -> pair(X1, active X2), active pair(X1, X2) -> pair(active X1, X2), active snd X -> snd active X, active snd pair(XS, YS) -> mark YS, active splitAt(X1, X2) -> splitAt(X1, active X2), active splitAt(X1, X2) -> splitAt(active X1, X2), active splitAt(s N, cons(X, XS)) -> mark u(splitAt(N, XS), N, X, XS), active splitAt(0(), XS) -> mark pair(nil(), XS), active u(X1, X2, X3, X4) -> u(active X1, X2, X3, X4), active u(pair(YS, ZS), N, X, XS) -> mark pair(cons(X, YS), ZS), active head X -> head active X, active head cons(N, XS) -> mark N, active tail X -> tail active X, active tail cons(N, XS) -> mark XS, active afterNth(N, XS) -> mark snd splitAt(N, XS), active afterNth(X1, X2) -> afterNth(X1, active X2), active afterNth(X1, X2) -> afterNth(active X1, X2), active sel(N, XS) -> mark head afterNth(N, XS), active sel(X1, X2) -> sel(X1, active X2), active sel(X1, X2) -> sel(active X1, X2), active take(N, XS) -> mark fst splitAt(N, XS), active take(X1, X2) -> take(X1, active X2), active take(X1, X2) -> take(active X1, X2), fst mark X -> mark fst X, fst ok X -> ok fst X, pair(X1, mark X2) -> mark pair(X1, X2), pair(mark X1, X2) -> mark pair(X1, X2), pair(ok X1, ok X2) -> ok pair(X1, X2), snd mark X -> mark snd X, snd ok X -> ok snd X, splitAt(X1, mark X2) -> mark splitAt(X1, X2), splitAt(mark X1, X2) -> mark splitAt(X1, X2), splitAt(ok X1, ok X2) -> ok splitAt(X1, X2), u(mark X1, X2, X3, X4) -> mark u(X1, X2, X3, X4), u(ok X1, ok X2, ok X3, ok X4) -> ok u(X1, X2, X3, X4), head mark X -> mark head X, head ok X -> ok head X, tail mark X -> mark tail X, tail ok X -> ok tail X, afterNth(X1, mark X2) -> mark afterNth(X1, X2), afterNth(mark X1, X2) -> mark afterNth(X1, X2), afterNth(ok X1, ok X2) -> ok afterNth(X1, X2), sel(X1, mark X2) -> mark sel(X1, X2), sel(mark X1, X2) -> mark sel(X1, X2), sel(ok X1, ok X2) -> ok sel(X1, X2), take(X1, mark X2) -> mark take(X1, X2), take(mark X1, X2) -> mark take(X1, X2), take(ok X1, ok X2) -> ok take(X1, X2), proper cons(X1, X2) -> cons(proper X1, proper X2), proper natsFrom X -> natsFrom proper X, proper s X -> s proper X, proper fst X -> fst proper X, proper pair(X1, X2) -> pair(proper X1, proper X2), proper snd X -> snd proper X, proper nil() -> ok nil(), proper splitAt(X1, X2) -> splitAt(proper X1, proper X2), proper 0() -> ok 0(), proper u(X1, X2, X3, X4) -> u(proper X1, proper X2, proper X3, proper X4), proper head X -> head proper X, proper tail X -> tail proper X, proper afterNth(X1, X2) -> afterNth(proper X1, proper X2), proper sel(X1, X2) -> sel(proper X1, proper X2), proper take(X1, X2) -> take(proper X1, proper X2), top mark X -> top proper X, top ok X -> top active X} Open SCC (2): Strict: {head# mark X -> head# X, head# ok X -> head# X} Weak: { cons(mark X1, X2) -> mark cons(X1, X2), cons(ok X1, ok X2) -> ok cons(X1, X2), natsFrom mark X -> mark natsFrom X, natsFrom ok X -> ok natsFrom X, s mark X -> mark s X, s ok X -> ok s X, active cons(X1, X2) -> cons(active X1, X2), active natsFrom N -> mark cons(N, natsFrom s N), active natsFrom X -> natsFrom active X, active s X -> s active X, active fst X -> fst active X, active fst pair(XS, YS) -> mark XS, active pair(X1, X2) -> pair(X1, active X2), active pair(X1, X2) -> pair(active X1, X2), active snd X -> snd active X, active snd pair(XS, YS) -> mark YS, active splitAt(X1, X2) -> splitAt(X1, active X2), active splitAt(X1, X2) -> splitAt(active X1, X2), active splitAt(s N, cons(X, XS)) -> mark u(splitAt(N, XS), N, X, XS), active splitAt(0(), XS) -> mark pair(nil(), XS), active u(X1, X2, X3, X4) -> u(active X1, X2, X3, X4), active u(pair(YS, ZS), N, X, XS) -> mark pair(cons(X, YS), ZS), active head X -> head active X, active head cons(N, XS) -> mark N, active tail X -> tail active X, active tail cons(N, XS) -> mark XS, active afterNth(N, XS) -> mark snd splitAt(N, XS), active afterNth(X1, X2) -> afterNth(X1, active X2), active afterNth(X1, X2) -> afterNth(active X1, X2), active sel(N, XS) -> mark head afterNth(N, XS), active sel(X1, X2) -> sel(X1, active X2), active sel(X1, X2) -> sel(active X1, X2), active take(N, XS) -> mark fst splitAt(N, XS), active take(X1, X2) -> take(X1, active X2), active take(X1, X2) -> take(active X1, X2), fst mark X -> mark fst X, fst ok X -> ok fst X, pair(X1, mark X2) -> mark pair(X1, X2), pair(mark X1, X2) -> mark pair(X1, X2), pair(ok X1, ok X2) -> ok pair(X1, X2), snd mark X -> mark snd X, snd ok X -> ok snd X, splitAt(X1, mark X2) -> mark splitAt(X1, X2), splitAt(mark X1, X2) -> mark splitAt(X1, X2), splitAt(ok X1, ok X2) -> ok splitAt(X1, X2), u(mark X1, X2, X3, X4) -> mark u(X1, X2, X3, X4), u(ok X1, ok X2, ok X3, ok X4) -> ok u(X1, X2, X3, X4), head mark X -> mark head X, head ok X -> ok head X, tail mark X -> mark tail X, tail ok X -> ok tail X, afterNth(X1, mark X2) -> mark afterNth(X1, X2), afterNth(mark X1, X2) -> mark afterNth(X1, X2), afterNth(ok X1, ok X2) -> ok afterNth(X1, X2), sel(X1, mark X2) -> mark sel(X1, X2), sel(mark X1, X2) -> mark sel(X1, X2), sel(ok X1, ok X2) -> ok sel(X1, X2), take(X1, mark X2) -> mark take(X1, X2), take(mark X1, X2) -> mark take(X1, X2), take(ok X1, ok X2) -> ok take(X1, X2), proper cons(X1, X2) -> cons(proper X1, proper X2), proper natsFrom X -> natsFrom proper X, proper s X -> s proper X, proper fst X -> fst proper X, proper pair(X1, X2) -> pair(proper X1, proper X2), proper snd X -> snd proper X, proper nil() -> ok nil(), proper splitAt(X1, X2) -> splitAt(proper X1, proper X2), proper 0() -> ok 0(), proper u(X1, X2, X3, X4) -> u(proper X1, proper X2, proper X3, proper X4), proper head X -> head proper X, proper tail X -> tail proper X, proper afterNth(X1, X2) -> afterNth(proper X1, proper X2), proper sel(X1, X2) -> sel(proper X1, proper X2), proper take(X1, X2) -> take(proper X1, proper X2), top mark X -> top proper X, top ok X -> top active X} Open SCC (2): Strict: { u#(mark X1, X2, X3, X4) -> u#(X1, X2, X3, X4), u#(ok X1, ok X2, ok X3, ok X4) -> u#(X1, X2, X3, X4)} Weak: { cons(mark X1, X2) -> mark cons(X1, X2), cons(ok X1, ok X2) -> ok cons(X1, X2), natsFrom mark X -> mark natsFrom X, natsFrom ok X -> ok natsFrom X, s mark X -> mark s X, s ok X -> ok s X, active cons(X1, X2) -> cons(active X1, X2), active natsFrom N -> mark cons(N, natsFrom s N), active natsFrom X -> natsFrom active X, active s X -> s active X, active fst X -> fst active X, active fst pair(XS, YS) -> mark XS, active pair(X1, X2) -> pair(X1, active X2), active pair(X1, X2) -> pair(active X1, X2), active snd X -> snd active X, active snd pair(XS, YS) -> mark YS, active splitAt(X1, X2) -> splitAt(X1, active X2), active splitAt(X1, X2) -> splitAt(active X1, X2), active splitAt(s N, cons(X, XS)) -> mark u(splitAt(N, XS), N, X, XS), active splitAt(0(), XS) -> mark pair(nil(), XS), active u(X1, X2, X3, X4) -> u(active X1, X2, X3, X4), active u(pair(YS, ZS), N, X, XS) -> mark pair(cons(X, YS), ZS), active head X -> head active X, active head cons(N, XS) -> mark N, active tail X -> tail active X, active tail cons(N, XS) -> mark XS, active afterNth(N, XS) -> mark snd splitAt(N, XS), active afterNth(X1, X2) -> afterNth(X1, active X2), active afterNth(X1, X2) -> afterNth(active X1, X2), active sel(N, XS) -> mark head afterNth(N, XS), active sel(X1, X2) -> sel(X1, active X2), active sel(X1, X2) -> sel(active X1, X2), active take(N, XS) -> mark fst splitAt(N, XS), active take(X1, X2) -> take(X1, active X2), active take(X1, X2) -> take(active X1, X2), fst mark X -> mark fst X, fst ok X -> ok fst X, pair(X1, mark X2) -> mark pair(X1, X2), pair(mark X1, X2) -> mark pair(X1, X2), pair(ok X1, ok X2) -> ok pair(X1, X2), snd mark X -> mark snd X, snd ok X -> ok snd X, splitAt(X1, mark X2) -> mark splitAt(X1, X2), splitAt(mark X1, X2) -> mark splitAt(X1, X2), splitAt(ok X1, ok X2) -> ok splitAt(X1, X2), u(mark X1, X2, X3, X4) -> mark u(X1, X2, X3, X4), u(ok X1, ok X2, ok X3, ok X4) -> ok u(X1, X2, X3, X4), head mark X -> mark head X, head ok X -> ok head X, tail mark X -> mark tail X, tail ok X -> ok tail X, afterNth(X1, mark X2) -> mark afterNth(X1, X2), afterNth(mark X1, X2) -> mark afterNth(X1, X2), afterNth(ok X1, ok X2) -> ok afterNth(X1, X2), sel(X1, mark X2) -> mark sel(X1, X2), sel(mark X1, X2) -> mark sel(X1, X2), sel(ok X1, ok X2) -> ok sel(X1, X2), take(X1, mark X2) -> mark take(X1, X2), take(mark X1, X2) -> mark take(X1, X2), take(ok X1, ok X2) -> ok take(X1, X2), proper cons(X1, X2) -> cons(proper X1, proper X2), proper natsFrom X -> natsFrom proper X, proper s X -> s proper X, proper fst X -> fst proper X, proper pair(X1, X2) -> pair(proper X1, proper X2), proper snd X -> snd proper X, proper nil() -> ok nil(), proper splitAt(X1, X2) -> splitAt(proper X1, proper X2), proper 0() -> ok 0(), proper u(X1, X2, X3, X4) -> u(proper X1, proper X2, proper X3, proper X4), proper head X -> head proper X, proper tail X -> tail proper X, proper afterNth(X1, X2) -> afterNth(proper X1, proper X2), proper sel(X1, X2) -> sel(proper X1, proper X2), proper take(X1, X2) -> take(proper X1, proper X2), top mark X -> top proper X, top ok X -> top active X} Open SCC (3): Strict: { splitAt#(X1, mark X2) -> splitAt#(X1, X2), splitAt#(mark X1, X2) -> splitAt#(X1, X2), splitAt#(ok X1, ok X2) -> splitAt#(X1, X2)} Weak: { cons(mark X1, X2) -> mark cons(X1, X2), cons(ok X1, ok X2) -> ok cons(X1, X2), natsFrom mark X -> mark natsFrom X, natsFrom ok X -> ok natsFrom X, s mark X -> mark s X, s ok X -> ok s X, active cons(X1, X2) -> cons(active X1, X2), active natsFrom N -> mark cons(N, natsFrom s N), active natsFrom X -> natsFrom active X, active s X -> s active X, active fst X -> fst active X, active fst pair(XS, YS) -> mark XS, active pair(X1, X2) -> pair(X1, active X2), active pair(X1, X2) -> pair(active X1, X2), active snd X -> snd active X, active snd pair(XS, YS) -> mark YS, active splitAt(X1, X2) -> splitAt(X1, active X2), active splitAt(X1, X2) -> splitAt(active X1, X2), active splitAt(s N, cons(X, XS)) -> mark u(splitAt(N, XS), N, X, XS), active splitAt(0(), XS) -> mark pair(nil(), XS), active u(X1, X2, X3, X4) -> u(active X1, X2, X3, X4), active u(pair(YS, ZS), N, X, XS) -> mark pair(cons(X, YS), ZS), active head X -> head active X, active head cons(N, XS) -> mark N, active tail X -> tail active X, active tail cons(N, XS) -> mark XS, active afterNth(N, XS) -> mark snd splitAt(N, XS), active afterNth(X1, X2) -> afterNth(X1, active X2), active afterNth(X1, X2) -> afterNth(active X1, X2), active sel(N, XS) -> mark head afterNth(N, XS), active sel(X1, X2) -> sel(X1, active X2), active sel(X1, X2) -> sel(active X1, X2), active take(N, XS) -> mark fst splitAt(N, XS), active take(X1, X2) -> take(X1, active X2), active take(X1, X2) -> take(active X1, X2), fst mark X -> mark fst X, fst ok X -> ok fst X, pair(X1, mark X2) -> mark pair(X1, X2), pair(mark X1, X2) -> mark pair(X1, X2), pair(ok X1, ok X2) -> ok pair(X1, X2), snd mark X -> mark snd X, snd ok X -> ok snd X, splitAt(X1, mark X2) -> mark splitAt(X1, X2), splitAt(mark X1, X2) -> mark splitAt(X1, X2), splitAt(ok X1, ok X2) -> ok splitAt(X1, X2), u(mark X1, X2, X3, X4) -> mark u(X1, X2, X3, X4), u(ok X1, ok X2, ok X3, ok X4) -> ok u(X1, X2, X3, X4), head mark X -> mark head X, head ok X -> ok head X, tail mark X -> mark tail X, tail ok X -> ok tail X, afterNth(X1, mark X2) -> mark afterNth(X1, X2), afterNth(mark X1, X2) -> mark afterNth(X1, X2), afterNth(ok X1, ok X2) -> ok afterNth(X1, X2), sel(X1, mark X2) -> mark sel(X1, X2), sel(mark X1, X2) -> mark sel(X1, X2), sel(ok X1, ok X2) -> ok sel(X1, X2), take(X1, mark X2) -> mark take(X1, X2), take(mark X1, X2) -> mark take(X1, X2), take(ok X1, ok X2) -> ok take(X1, X2), proper cons(X1, X2) -> cons(proper X1, proper X2), proper natsFrom X -> natsFrom proper X, proper s X -> s proper X, proper fst X -> fst proper X, proper pair(X1, X2) -> pair(proper X1, proper X2), proper snd X -> snd proper X, proper nil() -> ok nil(), proper splitAt(X1, X2) -> splitAt(proper X1, proper X2), proper 0() -> ok 0(), proper u(X1, X2, X3, X4) -> u(proper X1, proper X2, proper X3, proper X4), proper head X -> head proper X, proper tail X -> tail proper X, proper afterNth(X1, X2) -> afterNth(proper X1, proper X2), proper sel(X1, X2) -> sel(proper X1, proper X2), proper take(X1, X2) -> take(proper X1, proper X2), top mark X -> top proper X, top ok X -> top active X} Open SCC (2): Strict: {snd# mark X -> snd# X, snd# ok X -> snd# X} Weak: { cons(mark X1, X2) -> mark cons(X1, X2), cons(ok X1, ok X2) -> ok cons(X1, X2), natsFrom mark X -> mark natsFrom X, natsFrom ok X -> ok natsFrom X, s mark X -> mark s X, s ok X -> ok s X, active cons(X1, X2) -> cons(active X1, X2), active natsFrom N -> mark cons(N, natsFrom s N), active natsFrom X -> natsFrom active X, active s X -> s active X, active fst X -> fst active X, active fst pair(XS, YS) -> mark XS, active pair(X1, X2) -> pair(X1, active X2), active pair(X1, X2) -> pair(active X1, X2), active snd X -> snd active X, active snd pair(XS, YS) -> mark YS, active splitAt(X1, X2) -> splitAt(X1, active X2), active splitAt(X1, X2) -> splitAt(active X1, X2), active splitAt(s N, cons(X, XS)) -> mark u(splitAt(N, XS), N, X, XS), active splitAt(0(), XS) -> mark pair(nil(), XS), active u(X1, X2, X3, X4) -> u(active X1, X2, X3, X4), active u(pair(YS, ZS), N, X, XS) -> mark pair(cons(X, YS), ZS), active head X -> head active X, active head cons(N, XS) -> mark N, active tail X -> tail active X, active tail cons(N, XS) -> mark XS, active afterNth(N, XS) -> mark snd splitAt(N, XS), active afterNth(X1, X2) -> afterNth(X1, active X2), active afterNth(X1, X2) -> afterNth(active X1, X2), active sel(N, XS) -> mark head afterNth(N, XS), active sel(X1, X2) -> sel(X1, active X2), active sel(X1, X2) -> sel(active X1, X2), active take(N, XS) -> mark fst splitAt(N, XS), active take(X1, X2) -> take(X1, active X2), active take(X1, X2) -> take(active X1, X2), fst mark X -> mark fst X, fst ok X -> ok fst X, pair(X1, mark X2) -> mark pair(X1, X2), pair(mark X1, X2) -> mark pair(X1, X2), pair(ok X1, ok X2) -> ok pair(X1, X2), snd mark X -> mark snd X, snd ok X -> ok snd X, splitAt(X1, mark X2) -> mark splitAt(X1, X2), splitAt(mark X1, X2) -> mark splitAt(X1, X2), splitAt(ok X1, ok X2) -> ok splitAt(X1, X2), u(mark X1, X2, X3, X4) -> mark u(X1, X2, X3, X4), u(ok X1, ok X2, ok X3, ok X4) -> ok u(X1, X2, X3, X4), head mark X -> mark head X, head ok X -> ok head X, tail mark X -> mark tail X, tail ok X -> ok tail X, afterNth(X1, mark X2) -> mark afterNth(X1, X2), afterNth(mark X1, X2) -> mark afterNth(X1, X2), afterNth(ok X1, ok X2) -> ok afterNth(X1, X2), sel(X1, mark X2) -> mark sel(X1, X2), sel(mark X1, X2) -> mark sel(X1, X2), sel(ok X1, ok X2) -> ok sel(X1, X2), take(X1, mark X2) -> mark take(X1, X2), take(mark X1, X2) -> mark take(X1, X2), take(ok X1, ok X2) -> ok take(X1, X2), proper cons(X1, X2) -> cons(proper X1, proper X2), proper natsFrom X -> natsFrom proper X, proper s X -> s proper X, proper fst X -> fst proper X, proper pair(X1, X2) -> pair(proper X1, proper X2), proper snd X -> snd proper X, proper nil() -> ok nil(), proper splitAt(X1, X2) -> splitAt(proper X1, proper X2), proper 0() -> ok 0(), proper u(X1, X2, X3, X4) -> u(proper X1, proper X2, proper X3, proper X4), proper head X -> head proper X, proper tail X -> tail proper X, proper afterNth(X1, X2) -> afterNth(proper X1, proper X2), proper sel(X1, X2) -> sel(proper X1, proper X2), proper take(X1, X2) -> take(proper X1, proper X2), top mark X -> top proper X, top ok X -> top active X} Open SCC (2): Strict: {fst# mark X -> fst# X, fst# ok X -> fst# X} Weak: { cons(mark X1, X2) -> mark cons(X1, X2), cons(ok X1, ok X2) -> ok cons(X1, X2), natsFrom mark X -> mark natsFrom X, natsFrom ok X -> ok natsFrom X, s mark X -> mark s X, s ok X -> ok s X, active cons(X1, X2) -> cons(active X1, X2), active natsFrom N -> mark cons(N, natsFrom s N), active natsFrom X -> natsFrom active X, active s X -> s active X, active fst X -> fst active X, active fst pair(XS, YS) -> mark XS, active pair(X1, X2) -> pair(X1, active X2), active pair(X1, X2) -> pair(active X1, X2), active snd X -> snd active X, active snd pair(XS, YS) -> mark YS, active splitAt(X1, X2) -> splitAt(X1, active X2), active splitAt(X1, X2) -> splitAt(active X1, X2), active splitAt(s N, cons(X, XS)) -> mark u(splitAt(N, XS), N, X, XS), active splitAt(0(), XS) -> mark pair(nil(), XS), active u(X1, X2, X3, X4) -> u(active X1, X2, X3, X4), active u(pair(YS, ZS), N, X, XS) -> mark pair(cons(X, YS), ZS), active head X -> head active X, active head cons(N, XS) -> mark N, active tail X -> tail active X, active tail cons(N, XS) -> mark XS, active afterNth(N, XS) -> mark snd splitAt(N, XS), active afterNth(X1, X2) -> afterNth(X1, active X2), active afterNth(X1, X2) -> afterNth(active X1, X2), active sel(N, XS) -> mark head afterNth(N, XS), active sel(X1, X2) -> sel(X1, active X2), active sel(X1, X2) -> sel(active X1, X2), active take(N, XS) -> mark fst splitAt(N, XS), active take(X1, X2) -> take(X1, active X2), active take(X1, X2) -> take(active X1, X2), fst mark X -> mark fst X, fst ok X -> ok fst X, pair(X1, mark X2) -> mark pair(X1, X2), pair(mark X1, X2) -> mark pair(X1, X2), pair(ok X1, ok X2) -> ok pair(X1, X2), snd mark X -> mark snd X, snd ok X -> ok snd X, splitAt(X1, mark X2) -> mark splitAt(X1, X2), splitAt(mark X1, X2) -> mark splitAt(X1, X2), splitAt(ok X1, ok X2) -> ok splitAt(X1, X2), u(mark X1, X2, X3, X4) -> mark u(X1, X2, X3, X4), u(ok X1, ok X2, ok X3, ok X4) -> ok u(X1, X2, X3, X4), head mark X -> mark head X, head ok X -> ok head X, tail mark X -> mark tail X, tail ok X -> ok tail X, afterNth(X1, mark X2) -> mark afterNth(X1, X2), afterNth(mark X1, X2) -> mark afterNth(X1, X2), afterNth(ok X1, ok X2) -> ok afterNth(X1, X2), sel(X1, mark X2) -> mark sel(X1, X2), sel(mark X1, X2) -> mark sel(X1, X2), sel(ok X1, ok X2) -> ok sel(X1, X2), take(X1, mark X2) -> mark take(X1, X2), take(mark X1, X2) -> mark take(X1, X2), take(ok X1, ok X2) -> ok take(X1, X2), proper cons(X1, X2) -> cons(proper X1, proper X2), proper natsFrom X -> natsFrom proper X, proper s X -> s proper X, proper fst X -> fst proper X, proper pair(X1, X2) -> pair(proper X1, proper X2), proper snd X -> snd proper X, proper nil() -> ok nil(), proper splitAt(X1, X2) -> splitAt(proper X1, proper X2), proper 0() -> ok 0(), proper u(X1, X2, X3, X4) -> u(proper X1, proper X2, proper X3, proper X4), proper head X -> head proper X, proper tail X -> tail proper X, proper afterNth(X1, X2) -> afterNth(proper X1, proper X2), proper sel(X1, X2) -> sel(proper X1, proper X2), proper take(X1, X2) -> take(proper X1, proper X2), top mark X -> top proper X, top ok X -> top active X} Open SCC (2): Strict: {natsFrom# mark X -> natsFrom# X, natsFrom# ok X -> natsFrom# X} Weak: { cons(mark X1, X2) -> mark cons(X1, X2), cons(ok X1, ok X2) -> ok cons(X1, X2), natsFrom mark X -> mark natsFrom X, natsFrom ok X -> ok natsFrom X, s mark X -> mark s X, s ok X -> ok s X, active cons(X1, X2) -> cons(active X1, X2), active natsFrom N -> mark cons(N, natsFrom s N), active natsFrom X -> natsFrom active X, active s X -> s active X, active fst X -> fst active X, active fst pair(XS, YS) -> mark XS, active pair(X1, X2) -> pair(X1, active X2), active pair(X1, X2) -> pair(active X1, X2), active snd X -> snd active X, active snd pair(XS, YS) -> mark YS, active splitAt(X1, X2) -> splitAt(X1, active X2), active splitAt(X1, X2) -> splitAt(active X1, X2), active splitAt(s N, cons(X, XS)) -> mark u(splitAt(N, XS), N, X, XS), active splitAt(0(), XS) -> mark pair(nil(), XS), active u(X1, X2, X3, X4) -> u(active X1, X2, X3, X4), active u(pair(YS, ZS), N, X, XS) -> mark pair(cons(X, YS), ZS), active head X -> head active X, active head cons(N, XS) -> mark N, active tail X -> tail active X, active tail cons(N, XS) -> mark XS, active afterNth(N, XS) -> mark snd splitAt(N, XS), active afterNth(X1, X2) -> afterNth(X1, active X2), active afterNth(X1, X2) -> afterNth(active X1, X2), active sel(N, XS) -> mark head afterNth(N, XS), active sel(X1, X2) -> sel(X1, active X2), active sel(X1, X2) -> sel(active X1, X2), active take(N, XS) -> mark fst splitAt(N, XS), active take(X1, X2) -> take(X1, active X2), active take(X1, X2) -> take(active X1, X2), fst mark X -> mark fst X, fst ok X -> ok fst X, pair(X1, mark X2) -> mark pair(X1, X2), pair(mark X1, X2) -> mark pair(X1, X2), pair(ok X1, ok X2) -> ok pair(X1, X2), snd mark X -> mark snd X, snd ok X -> ok snd X, splitAt(X1, mark X2) -> mark splitAt(X1, X2), splitAt(mark X1, X2) -> mark splitAt(X1, X2), splitAt(ok X1, ok X2) -> ok splitAt(X1, X2), u(mark X1, X2, X3, X4) -> mark u(X1, X2, X3, X4), u(ok X1, ok X2, ok X3, ok X4) -> ok u(X1, X2, X3, X4), head mark X -> mark head X, head ok X -> ok head X, tail mark X -> mark tail X, tail ok X -> ok tail X, afterNth(X1, mark X2) -> mark afterNth(X1, X2), afterNth(mark X1, X2) -> mark afterNth(X1, X2), afterNth(ok X1, ok X2) -> ok afterNth(X1, X2), sel(X1, mark X2) -> mark sel(X1, X2), sel(mark X1, X2) -> mark sel(X1, X2), sel(ok X1, ok X2) -> ok sel(X1, X2), take(X1, mark X2) -> mark take(X1, X2), take(mark X1, X2) -> mark take(X1, X2), take(ok X1, ok X2) -> ok take(X1, X2), proper cons(X1, X2) -> cons(proper X1, proper X2), proper natsFrom X -> natsFrom proper X, proper s X -> s proper X, proper fst X -> fst proper X, proper pair(X1, X2) -> pair(proper X1, proper X2), proper snd X -> snd proper X, proper nil() -> ok nil(), proper splitAt(X1, X2) -> splitAt(proper X1, proper X2), proper 0() -> ok 0(), proper u(X1, X2, X3, X4) -> u(proper X1, proper X2, proper X3, proper X4), proper head X -> head proper X, proper tail X -> tail proper X, proper afterNth(X1, X2) -> afterNth(proper X1, proper X2), proper sel(X1, X2) -> sel(proper X1, proper X2), proper take(X1, X2) -> take(proper X1, proper X2), top mark X -> top proper X, top ok X -> top active X} Open SCC (2): Strict: { cons#(mark X1, X2) -> cons#(X1, X2), cons#(ok X1, ok X2) -> cons#(X1, X2)} Weak: { cons(mark X1, X2) -> mark cons(X1, X2), cons(ok X1, ok X2) -> ok cons(X1, X2), natsFrom mark X -> mark natsFrom X, natsFrom ok X -> ok natsFrom X, s mark X -> mark s X, s ok X -> ok s X, active cons(X1, X2) -> cons(active X1, X2), active natsFrom N -> mark cons(N, natsFrom s N), active natsFrom X -> natsFrom active X, active s X -> s active X, active fst X -> fst active X, active fst pair(XS, YS) -> mark XS, active pair(X1, X2) -> pair(X1, active X2), active pair(X1, X2) -> pair(active X1, X2), active snd X -> snd active X, active snd pair(XS, YS) -> mark YS, active splitAt(X1, X2) -> splitAt(X1, active X2), active splitAt(X1, X2) -> splitAt(active X1, X2), active splitAt(s N, cons(X, XS)) -> mark u(splitAt(N, XS), N, X, XS), active splitAt(0(), XS) -> mark pair(nil(), XS), active u(X1, X2, X3, X4) -> u(active X1, X2, X3, X4), active u(pair(YS, ZS), N, X, XS) -> mark pair(cons(X, YS), ZS), active head X -> head active X, active head cons(N, XS) -> mark N, active tail X -> tail active X, active tail cons(N, XS) -> mark XS, active afterNth(N, XS) -> mark snd splitAt(N, XS), active afterNth(X1, X2) -> afterNth(X1, active X2), active afterNth(X1, X2) -> afterNth(active X1, X2), active sel(N, XS) -> mark head afterNth(N, XS), active sel(X1, X2) -> sel(X1, active X2), active sel(X1, X2) -> sel(active X1, X2), active take(N, XS) -> mark fst splitAt(N, XS), active take(X1, X2) -> take(X1, active X2), active take(X1, X2) -> take(active X1, X2), fst mark X -> mark fst X, fst ok X -> ok fst X, pair(X1, mark X2) -> mark pair(X1, X2), pair(mark X1, X2) -> mark pair(X1, X2), pair(ok X1, ok X2) -> ok pair(X1, X2), snd mark X -> mark snd X, snd ok X -> ok snd X, splitAt(X1, mark X2) -> mark splitAt(X1, X2), splitAt(mark X1, X2) -> mark splitAt(X1, X2), splitAt(ok X1, ok X2) -> ok splitAt(X1, X2), u(mark X1, X2, X3, X4) -> mark u(X1, X2, X3, X4), u(ok X1, ok X2, ok X3, ok X4) -> ok u(X1, X2, X3, X4), head mark X -> mark head X, head ok X -> ok head X, tail mark X -> mark tail X, tail ok X -> ok tail X, afterNth(X1, mark X2) -> mark afterNth(X1, X2), afterNth(mark X1, X2) -> mark afterNth(X1, X2), afterNth(ok X1, ok X2) -> ok afterNth(X1, X2), sel(X1, mark X2) -> mark sel(X1, X2), sel(mark X1, X2) -> mark sel(X1, X2), sel(ok X1, ok X2) -> ok sel(X1, X2), take(X1, mark X2) -> mark take(X1, X2), take(mark X1, X2) -> mark take(X1, X2), take(ok X1, ok X2) -> ok take(X1, X2), proper cons(X1, X2) -> cons(proper X1, proper X2), proper natsFrom X -> natsFrom proper X, proper s X -> s proper X, proper fst X -> fst proper X, proper pair(X1, X2) -> pair(proper X1, proper X2), proper snd X -> snd proper X, proper nil() -> ok nil(), proper splitAt(X1, X2) -> splitAt(proper X1, proper X2), proper 0() -> ok 0(), proper u(X1, X2, X3, X4) -> u(proper X1, proper X2, proper X3, proper X4), proper head X -> head proper X, proper tail X -> tail proper X, proper afterNth(X1, X2) -> afterNth(proper X1, proper X2), proper sel(X1, X2) -> sel(proper X1, proper X2), proper take(X1, X2) -> take(proper X1, proper X2), top mark X -> top proper X, top ok X -> top active X} Open SCC (3): Strict: { pair#(X1, mark X2) -> pair#(X1, X2), pair#(mark X1, X2) -> pair#(X1, X2), pair#(ok X1, ok X2) -> pair#(X1, X2)} Weak: { cons(mark X1, X2) -> mark cons(X1, X2), cons(ok X1, ok X2) -> ok cons(X1, X2), natsFrom mark X -> mark natsFrom X, natsFrom ok X -> ok natsFrom X, s mark X -> mark s X, s ok X -> ok s X, active cons(X1, X2) -> cons(active X1, X2), active natsFrom N -> mark cons(N, natsFrom s N), active natsFrom X -> natsFrom active X, active s X -> s active X, active fst X -> fst active X, active fst pair(XS, YS) -> mark XS, active pair(X1, X2) -> pair(X1, active X2), active pair(X1, X2) -> pair(active X1, X2), active snd X -> snd active X, active snd pair(XS, YS) -> mark YS, active splitAt(X1, X2) -> splitAt(X1, active X2), active splitAt(X1, X2) -> splitAt(active X1, X2), active splitAt(s N, cons(X, XS)) -> mark u(splitAt(N, XS), N, X, XS), active splitAt(0(), XS) -> mark pair(nil(), XS), active u(X1, X2, X3, X4) -> u(active X1, X2, X3, X4), active u(pair(YS, ZS), N, X, XS) -> mark pair(cons(X, YS), ZS), active head X -> head active X, active head cons(N, XS) -> mark N, active tail X -> tail active X, active tail cons(N, XS) -> mark XS, active afterNth(N, XS) -> mark snd splitAt(N, XS), active afterNth(X1, X2) -> afterNth(X1, active X2), active afterNth(X1, X2) -> afterNth(active X1, X2), active sel(N, XS) -> mark head afterNth(N, XS), active sel(X1, X2) -> sel(X1, active X2), active sel(X1, X2) -> sel(active X1, X2), active take(N, XS) -> mark fst splitAt(N, XS), active take(X1, X2) -> take(X1, active X2), active take(X1, X2) -> take(active X1, X2), fst mark X -> mark fst X, fst ok X -> ok fst X, pair(X1, mark X2) -> mark pair(X1, X2), pair(mark X1, X2) -> mark pair(X1, X2), pair(ok X1, ok X2) -> ok pair(X1, X2), snd mark X -> mark snd X, snd ok X -> ok snd X, splitAt(X1, mark X2) -> mark splitAt(X1, X2), splitAt(mark X1, X2) -> mark splitAt(X1, X2), splitAt(ok X1, ok X2) -> ok splitAt(X1, X2), u(mark X1, X2, X3, X4) -> mark u(X1, X2, X3, X4), u(ok X1, ok X2, ok X3, ok X4) -> ok u(X1, X2, X3, X4), head mark X -> mark head X, head ok X -> ok head X, tail mark X -> mark tail X, tail ok X -> ok tail X, afterNth(X1, mark X2) -> mark afterNth(X1, X2), afterNth(mark X1, X2) -> mark afterNth(X1, X2), afterNth(ok X1, ok X2) -> ok afterNth(X1, X2), sel(X1, mark X2) -> mark sel(X1, X2), sel(mark X1, X2) -> mark sel(X1, X2), sel(ok X1, ok X2) -> ok sel(X1, X2), take(X1, mark X2) -> mark take(X1, X2), take(mark X1, X2) -> mark take(X1, X2), take(ok X1, ok X2) -> ok take(X1, X2), proper cons(X1, X2) -> cons(proper X1, proper X2), proper natsFrom X -> natsFrom proper X, proper s X -> s proper X, proper fst X -> fst proper X, proper pair(X1, X2) -> pair(proper X1, proper X2), proper snd X -> snd proper X, proper nil() -> ok nil(), proper splitAt(X1, X2) -> splitAt(proper X1, proper X2), proper 0() -> ok 0(), proper u(X1, X2, X3, X4) -> u(proper X1, proper X2, proper X3, proper X4), proper head X -> head proper X, proper tail X -> tail proper X, proper afterNth(X1, X2) -> afterNth(proper X1, proper X2), proper sel(X1, X2) -> sel(proper X1, proper X2), proper take(X1, X2) -> take(proper X1, proper X2), top mark X -> top proper X, top ok X -> top active X} Open SCC (2): Strict: {s# mark X -> s# X, s# ok X -> s# X} Weak: { cons(mark X1, X2) -> mark cons(X1, X2), cons(ok X1, ok X2) -> ok cons(X1, X2), natsFrom mark X -> mark natsFrom X, natsFrom ok X -> ok natsFrom X, s mark X -> mark s X, s ok X -> ok s X, active cons(X1, X2) -> cons(active X1, X2), active natsFrom N -> mark cons(N, natsFrom s N), active natsFrom X -> natsFrom active X, active s X -> s active X, active fst X -> fst active X, active fst pair(XS, YS) -> mark XS, active pair(X1, X2) -> pair(X1, active X2), active pair(X1, X2) -> pair(active X1, X2), active snd X -> snd active X, active snd pair(XS, YS) -> mark YS, active splitAt(X1, X2) -> splitAt(X1, active X2), active splitAt(X1, X2) -> splitAt(active X1, X2), active splitAt(s N, cons(X, XS)) -> mark u(splitAt(N, XS), N, X, XS), active splitAt(0(), XS) -> mark pair(nil(), XS), active u(X1, X2, X3, X4) -> u(active X1, X2, X3, X4), active u(pair(YS, ZS), N, X, XS) -> mark pair(cons(X, YS), ZS), active head X -> head active X, active head cons(N, XS) -> mark N, active tail X -> tail active X, active tail cons(N, XS) -> mark XS, active afterNth(N, XS) -> mark snd splitAt(N, XS), active afterNth(X1, X2) -> afterNth(X1, active X2), active afterNth(X1, X2) -> afterNth(active X1, X2), active sel(N, XS) -> mark head afterNth(N, XS), active sel(X1, X2) -> sel(X1, active X2), active sel(X1, X2) -> sel(active X1, X2), active take(N, XS) -> mark fst splitAt(N, XS), active take(X1, X2) -> take(X1, active X2), active take(X1, X2) -> take(active X1, X2), fst mark X -> mark fst X, fst ok X -> ok fst X, pair(X1, mark X2) -> mark pair(X1, X2), pair(mark X1, X2) -> mark pair(X1, X2), pair(ok X1, ok X2) -> ok pair(X1, X2), snd mark X -> mark snd X, snd ok X -> ok snd X, splitAt(X1, mark X2) -> mark splitAt(X1, X2), splitAt(mark X1, X2) -> mark splitAt(X1, X2), splitAt(ok X1, ok X2) -> ok splitAt(X1, X2), u(mark X1, X2, X3, X4) -> mark u(X1, X2, X3, X4), u(ok X1, ok X2, ok X3, ok X4) -> ok u(X1, X2, X3, X4), head mark X -> mark head X, head ok X -> ok head X, tail mark X -> mark tail X, tail ok X -> ok tail X, afterNth(X1, mark X2) -> mark afterNth(X1, X2), afterNth(mark X1, X2) -> mark afterNth(X1, X2), afterNth(ok X1, ok X2) -> ok afterNth(X1, X2), sel(X1, mark X2) -> mark sel(X1, X2), sel(mark X1, X2) -> mark sel(X1, X2), sel(ok X1, ok X2) -> ok sel(X1, X2), take(X1, mark X2) -> mark take(X1, X2), take(mark X1, X2) -> mark take(X1, X2), take(ok X1, ok X2) -> ok take(X1, X2), proper cons(X1, X2) -> cons(proper X1, proper X2), proper natsFrom X -> natsFrom proper X, proper s X -> s proper X, proper fst X -> fst proper X, proper pair(X1, X2) -> pair(proper X1, proper X2), proper snd X -> snd proper X, proper nil() -> ok nil(), proper splitAt(X1, X2) -> splitAt(proper X1, proper X2), proper 0() -> ok 0(), proper u(X1, X2, X3, X4) -> u(proper X1, proper X2, proper X3, proper X4), proper head X -> head proper X, proper tail X -> tail proper X, proper afterNth(X1, X2) -> afterNth(proper X1, proper X2), proper sel(X1, X2) -> sel(proper X1, proper X2), proper take(X1, X2) -> take(proper X1, proper X2), top mark X -> top proper X, top ok X -> top active X} Open