MAYBE Problem: active(natsFrom(N)) -> mark(cons(N,natsFrom(s(N)))) active(fst(pair(XS,YS))) -> mark(XS) active(snd(pair(XS,YS))) -> mark(YS) active(splitAt(0(),XS)) -> mark(pair(nil(),XS)) active(splitAt(s(N),cons(X,XS))) -> mark(u(splitAt(N,XS),N,X,XS)) active(u(pair(YS,ZS),N,X,XS)) -> mark(pair(cons(X,YS),ZS)) active(head(cons(N,XS))) -> mark(N) active(tail(cons(N,XS))) -> mark(XS) active(sel(N,XS)) -> mark(head(afterNth(N,XS))) active(take(N,XS)) -> mark(fst(splitAt(N,XS))) active(afterNth(N,XS)) -> mark(snd(splitAt(N,XS))) active(natsFrom(X)) -> natsFrom(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(s(X)) -> s(active(X)) active(fst(X)) -> fst(active(X)) active(pair(X1,X2)) -> pair(active(X1),X2) active(pair(X1,X2)) -> pair(X1,active(X2)) active(snd(X)) -> snd(active(X)) active(splitAt(X1,X2)) -> splitAt(active(X1),X2) active(splitAt(X1,X2)) -> splitAt(X1,active(X2)) active(u(X1,X2,X3,X4)) -> u(active(X1),X2,X3,X4) active(head(X)) -> head(active(X)) active(tail(X)) -> tail(active(X)) active(sel(X1,X2)) -> sel(active(X1),X2) active(sel(X1,X2)) -> sel(X1,active(X2)) active(afterNth(X1,X2)) -> afterNth(active(X1),X2) active(afterNth(X1,X2)) -> afterNth(X1,active(X2)) active(take(X1,X2)) -> take(active(X1),X2) active(take(X1,X2)) -> take(X1,active(X2)) natsFrom(mark(X)) -> mark(natsFrom(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) s(mark(X)) -> mark(s(X)) fst(mark(X)) -> mark(fst(X)) pair(mark(X1),X2) -> mark(pair(X1,X2)) pair(X1,mark(X2)) -> mark(pair(X1,X2)) snd(mark(X)) -> mark(snd(X)) splitAt(mark(X1),X2) -> mark(splitAt(X1,X2)) splitAt(X1,mark(X2)) -> mark(splitAt(X1,X2)) u(mark(X1),X2,X3,X4) -> mark(u(X1,X2,X3,X4)) head(mark(X)) -> mark(head(X)) tail(mark(X)) -> mark(tail(X)) sel(mark(X1),X2) -> mark(sel(X1,X2)) sel(X1,mark(X2)) -> mark(sel(X1,X2)) afterNth(mark(X1),X2) -> mark(afterNth(X1,X2)) afterNth(X1,mark(X2)) -> mark(afterNth(X1,X2)) take(mark(X1),X2) -> mark(take(X1,X2)) take(X1,mark(X2)) -> mark(take(X1,X2)) proper(natsFrom(X)) -> natsFrom(proper(X)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 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(splitAt(X1,X2)) -> splitAt(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(nil()) -> ok(nil()) 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(sel(X1,X2)) -> sel(proper(X1),proper(X2)) proper(afterNth(X1,X2)) -> afterNth(proper(X1),proper(X2)) proper(take(X1,X2)) -> take(proper(X1),proper(X2)) natsFrom(ok(X)) -> ok(natsFrom(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) s(ok(X)) -> ok(s(X)) fst(ok(X)) -> ok(fst(X)) pair(ok(X1),ok(X2)) -> ok(pair(X1,X2)) snd(ok(X)) -> ok(snd(X)) splitAt(ok(X1),ok(X2)) -> ok(splitAt(X1,X2)) u(ok(X1),ok(X2),ok(X3),ok(X4)) -> ok(u(X1,X2,X3,X4)) head(ok(X)) -> ok(head(X)) tail(ok(X)) -> ok(tail(X)) sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) afterNth(ok(X1),ok(X2)) -> ok(afterNth(X1,X2)) take(ok(X1),ok(X2)) -> ok(take(X1,X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Proof: DP Processor: DPs: active#(natsFrom(N)) -> s#(N) active#(natsFrom(N)) -> natsFrom#(s(N)) active#(natsFrom(N)) -> cons#(N,natsFrom(s(N))) active#(splitAt(0(),XS)) -> pair#(nil(),XS) 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#(u(pair(YS,ZS),N,X,XS)) -> cons#(X,YS) active#(u(pair(YS,ZS),N,X,XS)) -> pair#(cons(X,YS),ZS) active#(sel(N,XS)) -> afterNth#(N,XS) active#(sel(N,XS)) -> head#(afterNth(N,XS)) active#(take(N,XS)) -> splitAt#(N,XS) active#(take(N,XS)) -> fst#(splitAt(N,XS)) active#(afterNth(N,XS)) -> splitAt#(N,XS) active#(afterNth(N,XS)) -> snd#(splitAt(N,XS)) active#(natsFrom(X)) -> active#(X) active#(natsFrom(X)) -> natsFrom#(active(X)) active#(cons(X1,X2)) -> active#(X1) active#(cons(X1,X2)) -> cons#(active(X1),X2) active#(s(X)) -> active#(X) active#(s(X)) -> s#(active(X)) active#(fst(X)) -> active#(X) active#(fst(X)) -> fst#(active(X)) active#(pair(X1,X2)) -> active#(X1) active#(pair(X1,X2)) -> pair#(active(X1),X2) active#(pair(X1,X2)) -> active#(X2) active#(pair(X1,X2)) -> pair#(X1,active(X2)) active#(snd(X)) -> active#(X) active#(snd(X)) -> snd#(active(X)) active#(splitAt(X1,X2)) -> active#(X1) active#(splitAt(X1,X2)) -> splitAt#(active(X1),X2) active#(splitAt(X1,X2)) -> active#(X2) active#(splitAt(X1,X2)) -> splitAt#(X1,active(X2)) active#(u(X1,X2,X3,X4)) -> active#(X1) active#(u(X1,X2,X3,X4)) -> u#(active(X1),X2,X3,X4) active#(head(X)) -> active#(X) active#(head(X)) -> head#(active(X)) active#(tail(X)) -> active#(X) active#(tail(X)) -> tail#(active(X)) active#(sel(X1,X2)) -> active#(X1) active#(sel(X1,X2)) -> sel#(active(X1),X2) active#(sel(X1,X2)) -> active#(X2) active#(sel(X1,X2)) -> sel#(X1,active(X2)) active#(afterNth(X1,X2)) -> active#(X1) active#(afterNth(X1,X2)) -> afterNth#(active(X1),X2) active#(afterNth(X1,X2)) -> active#(X2) active#(afterNth(X1,X2)) -> afterNth#(X1,active(X2)) active#(take(X1,X2)) -> active#(X1) active#(take(X1,X2)) -> take#(active(X1),X2) active#(take(X1,X2)) -> active#(X2) active#(take(X1,X2)) -> take#(X1,active(X2)) natsFrom#(mark(X)) -> natsFrom#(X) cons#(mark(X1),X2) -> cons#(X1,X2) s#(mark(X)) -> s#(X) fst#(mark(X)) -> fst#(X) pair#(mark(X1),X2) -> pair#(X1,X2) pair#(X1,mark(X2)) -> pair#(X1,X2) snd#(mark(X)) -> snd#(X) splitAt#(mark(X1),X2) -> splitAt#(X1,X2) splitAt#(X1,mark(X2)) -> splitAt#(X1,X2) u#(mark(X1),X2,X3,X4) -> u#(X1,X2,X3,X4) head#(mark(X)) -> head#(X) tail#(mark(X)) -> tail#(X) sel#(mark(X1),X2) -> sel#(X1,X2) sel#(X1,mark(X2)) -> sel#(X1,X2) afterNth#(mark(X1),X2) -> afterNth#(X1,X2) afterNth#(X1,mark(X2)) -> afterNth#(X1,X2) take#(mark(X1),X2) -> take#(X1,X2) take#(X1,mark(X2)) -> take#(X1,X2) proper#(natsFrom(X)) -> proper#(X) proper#(natsFrom(X)) -> natsFrom#(proper(X)) proper#(cons(X1,X2)) -> proper#(X2) proper#(cons(X1,X2)) -> proper#(X1) proper#(cons(X1,X2)) -> cons#(proper(X1),proper(X2)) proper#(s(X)) -> proper#(X) proper#(s(X)) -> s#(proper(X)) proper#(fst(X)) -> proper#(X) proper#(fst(X)) -> fst#(proper(X)) proper#(pair(X1,X2)) -> proper#(X2) proper#(pair(X1,X2)) -> proper#(X1) proper#(pair(X1,X2)) -> pair#(proper(X1),proper(X2)) proper#(snd(X)) -> proper#(X) proper#(snd(X)) -> snd#(proper(X)) proper#(splitAt(X1,X2)) -> proper#(X2) proper#(splitAt(X1,X2)) -> proper#(X1) proper#(splitAt(X1,X2)) -> splitAt#(proper(X1),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#(X2) proper#(u(X1,X2,X3,X4)) -> proper#(X1) proper#(u(X1,X2,X3,X4)) -> u#(proper(X1),proper(X2),proper(X3),proper(X4)) proper#(head(X)) -> proper#(X) proper#(head(X)) -> head#(proper(X)) proper#(tail(X)) -> proper#(X) proper#(tail(X)) -> tail#(proper(X)) proper#(sel(X1,X2)) -> proper#(X2) proper#(sel(X1,X2)) -> proper#(X1) proper#(sel(X1,X2)) -> sel#(proper(X1),proper(X2)) proper#(afterNth(X1,X2)) -> proper#(X2) proper#(afterNth(X1,X2)) -> proper#(X1) proper#(afterNth(X1,X2)) -> afterNth#(proper(X1),proper(X2)) proper#(take(X1,X2)) -> proper#(X2) proper#(take(X1,X2)) -> proper#(X1) proper#(take(X1,X2)) -> take#(proper(X1),proper(X2)) natsFrom#(ok(X)) -> natsFrom#(X) cons#(ok(X1),ok(X2)) -> cons#(X1,X2) s#(ok(X)) -> s#(X) fst#(ok(X)) -> fst#(X) pair#(ok(X1),ok(X2)) -> pair#(X1,X2) snd#(ok(X)) -> snd#(X) splitAt#(ok(X1),ok(X2)) -> splitAt#(X1,X2) u#(ok(X1),ok(X2),ok(X3),ok(X4)) -> u#(X1,X2,X3,X4) head#(ok(X)) -> head#(X) tail#(ok(X)) -> tail#(X) sel#(ok(X1),ok(X2)) -> sel#(X1,X2) afterNth#(ok(X1),ok(X2)) -> afterNth#(X1,X2) take#(ok(X1),ok(X2)) -> take#(X1,X2) top#(mark(X)) -> proper#(X) top#(mark(X)) -> top#(proper(X)) top#(ok(X)) -> active#(X) top#(ok(X)) -> top#(active(X)) TRS: active(natsFrom(N)) -> mark(cons(N,natsFrom(s(N)))) active(fst(pair(XS,YS))) -> mark(XS) active(snd(pair(XS,YS))) -> mark(YS) active(splitAt(0(),XS)) -> mark(pair(nil(),XS)) active(splitAt(s(N),cons(X,XS))) -> mark(u(splitAt(N,XS),N,X,XS)) active(u(pair(YS,ZS),N,X,XS)) -> mark(pair(cons(X,YS),ZS)) active(head(cons(N,XS))) -> mark(N) active(tail(cons(N,XS))) -> mark(XS) active(sel(N,XS)) -> mark(head(afterNth(N,XS))) active(take(N,XS)) -> mark(fst(splitAt(N,XS))) active(afterNth(N,XS)) -> mark(snd(splitAt(N,XS))) active(natsFrom(X)) -> natsFrom(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(s(X)) -> s(active(X)) active(fst(X)) -> fst(active(X)) active(pair(X1,X2)) -> pair(active(X1),X2) active(pair(X1,X2)) -> pair(X1,active(X2)) active(snd(X)) -> snd(active(X)) active(splitAt(X1,X2)) -> splitAt(active(X1),X2) active(splitAt(X1,X2)) -> splitAt(X1,active(X2)) active(u(X1,X2,X3,X4)) -> u(active(X1),X2,X3,X4) active(head(X)) -> head(active(X)) active(tail(X)) -> tail(active(X)) active(sel(X1,X2)) -> sel(active(X1),X2) active(sel(X1,X2)) -> sel(X1,active(X2)) active(afterNth(X1,X2)) -> afterNth(active(X1),X2) active(afterNth(X1,X2)) -> afterNth(X1,active(X2)) active(take(X1,X2)) -> take(active(X1),X2) active(take(X1,X2)) -> take(X1,active(X2)) natsFrom(mark(X)) -> mark(natsFrom(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) s(mark(X)) -> mark(s(X)) fst(mark(X)) -> mark(fst(X)) pair(mark(X1),X2) -> mark(pair(X1,X2)) pair(X1,mark(X2)) -> mark(pair(X1,X2)) snd(mark(X)) -> mark(snd(X)) splitAt(mark(X1),X2) -> mark(splitAt(X1,X2)) splitAt(X1,mark(X2)) -> mark(splitAt(X1,X2)) u(mark(X1),X2,X3,X4) -> mark(u(X1,X2,X3,X4)) head(mark(X)) -> mark(head(X)) tail(mark(X)) -> mark(tail(X)) sel(mark(X1),X2) -> mark(sel(X1,X2)) sel(X1,mark(X2)) -> mark(sel(X1,X2)) afterNth(mark(X1),X2) -> mark(afterNth(X1,X2)) afterNth(X1,mark(X2)) -> mark(afterNth(X1,X2)) take(mark(X1),X2) -> mark(take(X1,X2)) take(X1,mark(X2)) -> mark(take(X1,X2)) proper(natsFrom(X)) -> natsFrom(proper(X)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 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(splitAt(X1,X2)) -> splitAt(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(nil()) -> ok(nil()) 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(sel(X1,X2)) -> sel(proper(X1),proper(X2)) proper(afterNth(X1,X2)) -> afterNth(proper(X1),proper(X2)) proper(take(X1,X2)) -> take(proper(X1),proper(X2)) natsFrom(ok(X)) -> ok(natsFrom(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) s(ok(X)) -> ok(s(X)) fst(ok(X)) -> ok(fst(X)) pair(ok(X1),ok(X2)) -> ok(pair(X1,X2)) snd(ok(X)) -> ok(snd(X)) splitAt(ok(X1),ok(X2)) -> ok(splitAt(X1,X2)) u(ok(X1),ok(X2),ok(X3),ok(X4)) -> ok(u(X1,X2,X3,X4)) head(ok(X)) -> ok(head(X)) tail(ok(X)) -> ok(tail(X)) sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) afterNth(ok(X1),ok(X2)) -> ok(afterNth(X1,X2)) take(ok(X1),ok(X2)) -> ok(take(X1,X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) TDG Processor: DPs: active#(natsFrom(N)) -> s#(N) active#(natsFrom(N)) -> natsFrom#(s(N)) active#(natsFrom(N)) -> cons#(N,natsFrom(s(N))) active#(splitAt(0(),XS)) -> pair#(nil(),XS) 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#(u(pair(YS,ZS),N,X,XS)) -> cons#(X,YS) active#(u(pair(YS,ZS),N,X,XS)) -> pair#(cons(X,YS),ZS) active#(sel(N,XS)) -> afterNth#(N,XS) active#(sel(N,XS)) -> head#(afterNth(N,XS)) active#(take(N,XS)) -> splitAt#(N,XS) active#(take(N,XS)) -> fst#(splitAt(N,XS)) active#(afterNth(N,XS)) -> splitAt#(N,XS) active#(afterNth(N,XS)) -> snd#(splitAt(N,XS)) active#(natsFrom(X)) -> active#(X) active#(natsFrom(X)) -> natsFrom#(active(X)) active#(cons(X1,X2)) -> active#(X1) active#(cons(X1,X2)) -> cons#(active(X1),X2) active#(s(X)) -> active#(X) active#(s(X)) -> s#(active(X)) active#(fst(X)) -> active#(X) active#(fst(X)) -> fst#(active(X)) active#(pair(X1,X2)) -> active#(X1) active#(pair(X1,X2)) -> pair#(active(X1),X2) active#(pair(X1,X2)) -> active#(X2) active#(pair(X1,X2)) -> pair#(X1,active(X2)) active#(snd(X)) -> active#(X) active#(snd(X)) -> snd#(active(X)) active#(splitAt(X1,X2)) -> active#(X1) active#(splitAt(X1,X2)) -> splitAt#(active(X1),X2) active#(splitAt(X1,X2)) -> active#(X2) active#(splitAt(X1,X2)) -> splitAt#(X1,active(X2)) active#(u(X1,X2,X3,X4)) -> active#(X1) active#(u(X1,X2,X3,X4)) -> u#(active(X1),X2,X3,X4) active#(head(X)) -> active#(X) active#(head(X)) -> head#(active(X)) active#(tail(X)) -> active#(X) active#(tail(X)) -> tail#(active(X)) active#(sel(X1,X2)) -> active#(X1) active#(sel(X1,X2)) -> sel#(active(X1),X2) active#(sel(X1,X2)) -> active#(X2) active#(sel(X1,X2)) -> sel#(X1,active(X2)) active#(afterNth(X1,X2)) -> active#(X1) active#(afterNth(X1,X2)) -> afterNth#(active(X1),X2) active#(afterNth(X1,X2)) -> active#(X2) active#(afterNth(X1,X2)) -> afterNth#(X1,active(X2)) active#(take(X1,X2)) -> active#(X1) active#(take(X1,X2)) -> take#(active(X1),X2) active#(take(X1,X2)) -> active#(X2) active#(take(X1,X2)) -> take#(X1,active(X2)) natsFrom#(mark(X)) -> natsFrom#(X) cons#(mark(X1),X2) -> cons#(X1,X2) s#(mark(X)) -> s#(X) fst#(mark(X)) -> fst#(X) pair#(mark(X1),X2) -> pair#(X1,X2) pair#(X1,mark(X2)) -> pair#(X1,X2) snd#(mark(X)) -> snd#(X) splitAt#(mark(X1),X2) -> splitAt#(X1,X2) splitAt#(X1,mark(X2)) -> splitAt#(X1,X2) u#(mark(X1),X2,X3,X4) -> u#(X1,X2,X3,X4) head#(mark(X)) -> head#(X) tail#(mark(X)) -> tail#(X) sel#(mark(X1),X2) -> sel#(X1,X2) sel#(X1,mark(X2)) -> sel#(X1,X2) afterNth#(mark(X1),X2) -> afterNth#(X1,X2) afterNth#(X1,mark(X2)) -> afterNth#(X1,X2) take#(mark(X1),X2) -> take#(X1,X2) take#(X1,mark(X2)) -> take#(X1,X2) proper#(natsFrom(X)) -> proper#(X) proper#(natsFrom(X)) -> natsFrom#(proper(X)) proper#(cons(X1,X2)) -> proper#(X2) proper#(cons(X1,X2)) -> proper#(X1) proper#(cons(X1,X2)) -> cons#(proper(X1),proper(X2)) proper#(s(X)) -> proper#(X) proper#(s(X)) -> s#(proper(X)) proper#(fst(X)) -> proper#(X) proper#(fst(X)) -> fst#(proper(X)) proper#(pair(X1,X2)) -> proper#(X2) proper#(pair(X1,X2)) -> proper#(X1) proper#(pair(X1,X2)) -> pair#(proper(X1),proper(X2)) proper#(snd(X)) -> proper#(X) proper#(snd(X)) -> snd#(proper(X)) proper#(splitAt(X1,X2)) -> proper#(X2) proper#(splitAt(X1,X2)) -> proper#(X1) proper#(splitAt(X1,X2)) -> splitAt#(proper(X1),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#(X2) proper#(u(X1,X2,X3,X4)) -> proper#(X1) proper#(u(X1,X2,X3,X4)) -> u#(proper(X1),proper(X2),proper(X3),proper(X4)) proper#(head(X)) -> proper#(X) proper#(head(X)) -> head#(proper(X)) proper#(tail(X)) -> proper#(X) proper#(tail(X)) -> tail#(proper(X)) proper#(sel(X1,X2)) -> proper#(X2) proper#(sel(X1,X2)) -> proper#(X1) proper#(sel(X1,X2)) -> sel#(proper(X1),proper(X2)) proper#(afterNth(X1,X2)) -> proper#(X2) proper#(afterNth(X1,X2)) -> proper#(X1) proper#(afterNth(X1,X2)) -> afterNth#(proper(X1),proper(X2)) proper#(take(X1,X2)) -> proper#(X2) proper#(take(X1,X2)) -> proper#(X1) proper#(take(X1,X2)) -> take#(proper(X1),proper(X2)) natsFrom#(ok(X)) -> natsFrom#(X) cons#(ok(X1),ok(X2)) -> cons#(X1,X2) s#(ok(X)) -> s#(X) fst#(ok(X)) -> fst#(X) pair#(ok(X1),ok(X2)) -> pair#(X1,X2) snd#(ok(X)) -> snd#(X) splitAt#(ok(X1),ok(X2)) -> splitAt#(X1,X2) u#(ok(X1),ok(X2),ok(X3),ok(X4)) -> u#(X1,X2,X3,X4) head#(ok(X)) -> head#(X) tail#(ok(X)) -> tail#(X) sel#(ok(X1),ok(X2)) -> sel#(X1,X2) afterNth#(ok(X1),ok(X2)) -> afterNth#(X1,X2) take#(ok(X1),ok(X2)) -> take#(X1,X2) top#(mark(X)) -> proper#(X) top#(mark(X)) -> top#(proper(X)) top#(ok(X)) -> active#(X) top#(ok(X)) -> top#(active(X)) TRS: active(natsFrom(N)) -> mark(cons(N,natsFrom(s(N)))) active(fst(pair(XS,YS))) -> mark(XS) active(snd(pair(XS,YS))) -> mark(YS) active(splitAt(0(),XS)) -> mark(pair(nil(),XS)) active(splitAt(s(N),cons(X,XS))) -> mark(u(splitAt(N,XS),N,X,XS)) active(u(pair(YS,ZS),N,X,XS)) -> mark(pair(cons(X,YS),ZS)) active(head(cons(N,XS))) -> mark(N) active(tail(cons(N,XS))) -> mark(XS) active(sel(N,XS)) -> mark(head(afterNth(N,XS))) active(take(N,XS)) -> mark(fst(splitAt(N,XS))) active(afterNth(N,XS)) -> mark(snd(splitAt(N,XS))) active(natsFrom(X)) -> natsFrom(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(s(X)) -> s(active(X)) active(fst(X)) -> fst(active(X)) active(pair(X1,X2)) -> pair(active(X1),X2) active(pair(X1,X2)) -> pair(X1,active(X2)) active(snd(X)) -> snd(active(X)) active(splitAt(X1,X2)) -> splitAt(active(X1),X2) active(splitAt(X1,X2)) -> splitAt(X1,active(X2)) active(u(X1,X2,X3,X4)) -> u(active(X1),X2,X3,X4) active(head(X)) -> head(active(X)) active(tail(X)) -> tail(active(X)) active(sel(X1,X2)) -> sel(active(X1),X2) active(sel(X1,X2)) -> sel(X1,active(X2)) active(afterNth(X1,X2)) -> afterNth(active(X1),X2) active(afterNth(X1,X2)) -> afterNth(X1,active(X2)) active(take(X1,X2)) -> take(active(X1),X2) active(take(X1,X2)) -> take(X1,active(X2)) natsFrom(mark(X)) -> mark(natsFrom(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) s(mark(X)) -> mark(s(X)) fst(mark(X)) -> mark(fst(X)) pair(mark(X1),X2) -> mark(pair(X1,X2)) pair(X1,mark(X2)) -> mark(pair(X1,X2)) snd(mark(X)) -> mark(snd(X)) splitAt(mark(X1),X2) -> mark(splitAt(X1,X2)) splitAt(X1,mark(X2)) -> mark(splitAt(X1,X2)) u(mark(X1),X2,X3,X4) -> mark(u(X1,X2,X3,X4)) head(mark(X)) -> mark(head(X)) tail(mark(X)) -> mark(tail(X)) sel(mark(X1),X2) -> mark(sel(X1,X2)) sel(X1,mark(X2)) -> mark(sel(X1,X2)) afterNth(mark(X1),X2) -> mark(afterNth(X1,X2)) afterNth(X1,mark(X2)) -> mark(afterNth(X1,X2)) take(mark(X1),X2) -> mark(take(X1,X2)) take(X1,mark(X2)) -> mark(take(X1,X2)) proper(natsFrom(X)) -> natsFrom(proper(X)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 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(splitAt(X1,X2)) -> splitAt(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(nil()) -> ok(nil()) 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(sel(X1,X2)) -> sel(proper(X1),proper(X2)) proper(afterNth(X1,X2)) -> afterNth(proper(X1),proper(X2)) proper(take(X1,X2)) -> take(proper(X1),proper(X2)) natsFrom(ok(X)) -> ok(natsFrom(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) s(ok(X)) -> ok(s(X)) fst(ok(X)) -> ok(fst(X)) pair(ok(X1),ok(X2)) -> ok(pair(X1,X2)) snd(ok(X)) -> ok(snd(X)) splitAt(ok(X1),ok(X2)) -> ok(splitAt(X1,X2)) u(ok(X1),ok(X2),ok(X3),ok(X4)) -> ok(u(X1,X2,X3,X4)) head(ok(X)) -> ok(head(X)) tail(ok(X)) -> ok(tail(X)) sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) afterNth(ok(X1),ok(X2)) -> ok(afterNth(X1,X2)) take(ok(X1),ok(X2)) -> ok(take(X1,X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) graph: ... SCC Processor: #sccs: 16 #rules: 73 #arcs: 1951/14400 DPs: top#(ok(X)) -> top#(active(X)) top#(mark(X)) -> top#(proper(X)) TRS: active(natsFrom(N)) -> mark(cons(N,natsFrom(s(N)))) active(fst(pair(XS,YS))) -> mark(XS) active(snd(pair(XS,YS))) -> mark(YS) active(splitAt(0(),XS)) -> mark(pair(nil(),XS)) active(splitAt(s(N),cons(X,XS))) -> mark(u(splitAt(N,XS),N,X,XS)) active(u(pair(YS,ZS),N,X,XS)) -> mark(pair(cons(X,YS),ZS)) active(head(cons(N,XS))) -> mark(N) active(tail(cons(N,XS))) -> mark(XS) active(sel(N,XS)) -> mark(head(afterNth(N,XS))) active(take(N,XS)) -> mark(fst(splitAt(N,XS))) active(afterNth(N,XS)) -> mark(snd(splitAt(N,XS))) active(natsFrom(X)) -> natsFrom(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(s(X)) -> s(active(X)) active(fst(X)) -> fst(active(X)) active(pair(X1,X2)) -> pair(active(X1),X2) active(pair(X1,X2)) -> pair(X1,active(X2)) active(snd(X)) -> snd(active(X)) active(splitAt(X1,X2)) -> splitAt(active(X1),X2) active(splitAt(X1,X2)) -> splitAt(X1,active(X2)) active(u(X1,X2,X3,X4)) -> u(active(X1),X2,X3,X4) active(head(X)) -> head(active(X)) active(tail(X)) -> tail(active(X)) active(sel(X1,X2)) -> sel(active(X1),X2) active(sel(X1,X2)) -> sel(X1,active(X2)) active(afterNth(X1,X2)) -> afterNth(active(X1),X2) active(afterNth(X1,X2)) -> afterNth(X1,active(X2)) active(take(X1,X2)) -> take(active(X1),X2) active(take(X1,X2)) -> take(X1,active(X2)) natsFrom(mark(X)) -> mark(natsFrom(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) s(mark(X)) -> mark(s(X)) fst(mark(X)) -> mark(fst(X)) pair(mark(X1),X2) -> mark(pair(X1,X2)) pair(X1,mark(X2)) -> mark(pair(X1,X2)) snd(mark(X)) -> mark(snd(X)) splitAt(mark(X1),X2) -> mark(splitAt(X1,X2)) splitAt(X1,mark(X2)) -> mark(splitAt(X1,X2)) u(mark(X1),X2,X3,X4) -> mark(u(X1,X2,X3,X4)) head(mark(X)) -> mark(head(X)) tail(mark(X)) -> mark(tail(X)) sel(mark(X1),X2) -> mark(sel(X1,X2)) sel(X1,mark(X2)) -> mark(sel(X1,X2)) afterNth(mark(X1),X2) -> mark(afterNth(X1,X2)) afterNth(X1,mark(X2)) -> mark(afterNth(X1,X2)) take(mark(X1),X2) -> mark(take(X1,X2)) take(X1,mark(X2)) -> mark(take(X1,X2)) proper(natsFrom(X)) -> natsFrom(proper(X)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 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(splitAt(X1,X2)) -> splitAt(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(nil()) -> ok(nil()) 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(sel(X1,X2)) -> sel(proper(X1),proper(X2)) proper(afterNth(X1,X2)) -> afterNth(proper(X1),proper(X2)) proper(take(X1,X2)) -> take(proper(X1),proper(X2)) natsFrom(ok(X)) -> ok(natsFrom(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) s(ok(X)) -> ok(s(X)) fst(ok(X)) -> ok(fst(X)) pair(ok(X1),ok(X2)) -> ok(pair(X1,X2)) snd(ok(X)) -> ok(snd(X)) splitAt(ok(X1),ok(X2)) -> ok(splitAt(X1,X2)) u(ok(X1),ok(X2),ok(X3),ok(X4)) -> ok(u(X1,X2,X3,X4)) head(ok(X)) -> ok(head(X)) tail(ok(X)) -> ok(tail(X)) sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) afterNth(ok(X1),ok(X2)) -> ok(afterNth(X1,X2)) take(ok(X1),ok(X2)) -> ok(take(X1,X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Open DPs: active#(natsFrom(X)) -> active#(X) active#(cons(X1,X2)) -> active#(X1) 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#(sel(X1,X2)) -> active#(X1) active#(sel(X1,X2)) -> active#(X2) active#(afterNth(X1,X2)) -> active#(X1) active#(afterNth(X1,X2)) -> active#(X2) active#(take(X1,X2)) -> active#(X1) active#(take(X1,X2)) -> active#(X2) TRS: active(natsFrom(N)) -> mark(cons(N,natsFrom(s(N)))) active(fst(pair(XS,YS))) -> mark(XS) active(snd(pair(XS,YS))) -> mark(YS) active(splitAt(0(),XS)) -> mark(pair(nil(),XS)) active(splitAt(s(N),cons(X,XS))) -> mark(u(splitAt(N,XS),N,X,XS)) active(u(pair(YS,ZS),N,X,XS)) -> mark(pair(cons(X,YS),ZS)) active(head(cons(N,XS))) -> mark(N) active(tail(cons(N,XS))) -> mark(XS) active(sel(N,XS)) -> mark(head(afterNth(N,XS))) active(take(N,XS)) -> mark(fst(splitAt(N,XS))) active(afterNth(N,XS)) -> mark(snd(splitAt(N,XS))) active(natsFrom(X)) -> natsFrom(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(s(X)) -> s(active(X)) active(fst(X)) -> fst(active(X)) active(pair(X1,X2)) -> pair(active(X1),X2) active(pair(X1,X2)) -> pair(X1,active(X2)) active(snd(X)) -> snd(active(X)) active(splitAt(X1,X2)) -> splitAt(active(X1),X2) active(splitAt(X1,X2)) -> splitAt(X1,active(X2)) active(u(X1,X2,X3,X4)) -> u(active(X1),X2,X3,X4) active(head(X)) -> head(active(X)) active(tail(X)) -> tail(active(X)) active(sel(X1,X2)) -> sel(active(X1),X2) active(sel(X1,X2)) -> sel(X1,active(X2)) active(afterNth(X1,X2)) -> afterNth(active(X1),X2) active(afterNth(X1,X2)) -> afterNth(X1,active(X2)) active(take(X1,X2)) -> take(active(X1),X2) active(take(X1,X2)) -> take(X1,active(X2)) natsFrom(mark(X)) -> mark(natsFrom(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) s(mark(X)) -> mark(s(X)) fst(mark(X)) -> mark(fst(X)) pair(mark(X1),X2) -> mark(pair(X1,X2)) pair(X1,mark(X2)) -> mark(pair(X1,X2)) snd(mark(X)) -> mark(snd(X)) splitAt(mark(X1),X2) -> mark(splitAt(X1,X2)) splitAt(X1,mark(X2)) -> mark(splitAt(X1,X2)) u(mark(X1),X2,X3,X4) -> mark(u(X1,X2,X3,X4)) head(mark(X)) -> mark(head(X)) tail(mark(X)) -> mark(tail(X)) sel(mark(X1),X2) -> mark(sel(X1,X2)) sel(X1,mark(X2)) -> mark(sel(X1,X2)) afterNth(mark(X1),X2) -> mark(afterNth(X1,X2)) afterNth(X1,mark(X2)) -> mark(afterNth(X1,X2)) take(mark(X1),X2) -> mark(take(X1,X2)) take(X1,mark(X2)) -> mark(take(X1,X2)) proper(natsFrom(X)) -> natsFrom(proper(X)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 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(splitAt(X1,X2)) -> splitAt(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(nil()) -> ok(nil()) 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(sel(X1,X2)) -> sel(proper(X1),proper(X2)) proper(afterNth(X1,X2)) -> afterNth(proper(X1),proper(X2)) proper(take(X1,X2)) -> take(proper(X1),proper(X2)) natsFrom(ok(X)) -> ok(natsFrom(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) s(ok(X)) -> ok(s(X)) fst(ok(X)) -> ok(fst(X)) pair(ok(X1),ok(X2)) -> ok(pair(X1,X2)) snd(ok(X)) -> ok(snd(X)) splitAt(ok(X1),ok(X2)) -> ok(splitAt(X1,X2)) u(ok(X1),ok(X2),ok(X3),ok(X4)) -> ok(u(X1,X2,X3,X4)) head(ok(X)) -> ok(head(X)) tail(ok(X)) -> ok(tail(X)) sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) afterNth(ok(X1),ok(X2)) -> ok(afterNth(X1,X2)) take(ok(X1),ok(X2)) -> ok(take(X1,X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Subterm Criterion Processor: simple projection: pi(active#) = 0 problem: DPs: TRS: active(natsFrom(N)) -> mark(cons(N,natsFrom(s(N)))) active(fst(pair(XS,YS))) -> mark(XS) active(snd(pair(XS,YS))) -> mark(YS) active(splitAt(0(),XS)) -> mark(pair(nil(),XS)) active(splitAt(s(N),cons(X,XS))) -> mark(u(splitAt(N,XS),N,X,XS)) active(u(pair(YS,ZS),N,X,XS)) -> mark(pair(cons(X,YS),ZS)) active(head(cons(N,XS))) -> mark(N) active(tail(cons(N,XS))) -> mark(XS) active(sel(N,XS)) -> mark(head(afterNth(N,XS))) active(take(N,XS)) -> mark(fst(splitAt(N,XS))) active(afterNth(N,XS)) -> mark(snd(splitAt(N,XS))) active(natsFrom(X)) -> natsFrom(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(s(X)) -> s(active(X)) active(fst(X)) -> fst(active(X)) active(pair(X1,X2)) -> pair(active(X1),X2) active(pair(X1,X2)) -> pair(X1,active(X2)) active(snd(X)) -> snd(active(X)) active(splitAt(X1,X2)) -> splitAt(active(X1),X2) active(splitAt(X1,X2)) -> splitAt(X1,active(X2)) active(u(X1,X2,X3,X4)) -> u(active(X1),X2,X3,X4) active(head(X)) -> head(active(X)) active(tail(X)) -> tail(active(X)) active(sel(X1,X2)) -> sel(active(X1),X2) active(sel(X1,X2)) -> sel(X1,active(X2)) active(afterNth(X1,X2)) -> afterNth(active(X1),X2) active(afterNth(X1,X2)) -> afterNth(X1,active(X2)) active(take(X1,X2)) -> take(active(X1),X2) active(take(X1,X2)) -> take(X1,active(X2)) natsFrom(mark(X)) -> mark(natsFrom(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) s(mark(X)) -> mark(s(X)) fst(mark(X)) -> mark(fst(X)) pair(mark(X1),X2) -> mark(pair(X1,X2)) pair(X1,mark(X2)) -> mark(pair(X1,X2)) snd(mark(X)) -> mark(snd(X)) splitAt(mark(X1),X2) -> mark(splitAt(X1,X2)) splitAt(X1,mark(X2)) -> mark(splitAt(X1,X2)) u(mark(X1),X2,X3,X4) -> mark(u(X1,X2,X3,X4)) head(mark(X)) -> mark(head(X)) tail(mark(X)) -> mark(tail(X)) sel(mark(X1),X2) -> mark(sel(X1,X2)) sel(X1,mark(X2)) -> mark(sel(X1,X2)) afterNth(mark(X1),X2) -> mark(afterNth(X1,X2)) afterNth(X1,mark(X2)) -> mark(afterNth(X1,X2)) take(mark(X1),X2) -> mark(take(X1,X2)) take(X1,mark(X2)) -> mark(take(X1,X2)) proper(natsFrom(X)) -> natsFrom(proper(X)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 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(splitAt(X1,X2)) -> splitAt(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(nil()) -> ok(nil()) 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(sel(X1,X2)) -> sel(proper(X1),proper(X2)) proper(afterNth(X1,X2)) -> afterNth(proper(X1),proper(X2)) proper(take(X1,X2)) -> take(proper(X1),proper(X2)) natsFrom(ok(X)) -> ok(natsFrom(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) s(ok(X)) -> ok(s(X)) fst(ok(X)) -> ok(fst(X)) pair(ok(X1),ok(X2)) -> ok(pair(X1,X2)) snd(ok(X)) -> ok(snd(X)) splitAt(ok(X1),ok(X2)) -> ok(splitAt(X1,X2)) u(ok(X1),ok(X2),ok(X3),ok(X4)) -> ok(u(X1,X2,X3,X4)) head(ok(X)) -> ok(head(X)) tail(ok(X)) -> ok(tail(X)) sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) afterNth(ok(X1),ok(X2)) -> ok(afterNth(X1,X2)) take(ok(X1),ok(X2)) -> ok(take(X1,X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Qed DPs: proper#(natsFrom(X)) -> proper#(X) proper#(cons(X1,X2)) -> proper#(X2) proper#(cons(X1,X2)) -> proper#(X1) proper#(s(X)) -> proper#(X) proper#(fst(X)) -> proper#(X) proper#(pair(X1,X2)) -> proper#(X2) proper#(pair(X1,X2)) -> proper#(X1) proper#(snd(X)) -> proper#(X) proper#(splitAt(X1,X2)) -> proper#(X2) proper#(splitAt(X1,X2)) -> proper#(X1) proper#(u(X1,X2,X3,X4)) -> proper#(X4) proper#(u(X1,X2,X3,X4)) -> proper#(X3) proper#(u(X1,X2,X3,X4)) -> proper#(X2) proper#(u(X1,X2,X3,X4)) -> proper#(X1) proper#(head(X)) -> proper#(X) proper#(tail(X)) -> proper#(X) proper#(sel(X1,X2)) -> proper#(X2) proper#(sel(X1,X2)) -> proper#(X1) proper#(afterNth(X1,X2)) -> proper#(X2) proper#(afterNth(X1,X2)) -> proper#(X1) proper#(take(X1,X2)) -> proper#(X2) proper#(take(X1,X2)) -> proper#(X1) TRS: active(natsFrom(N)) -> mark(cons(N,natsFrom(s(N)))) active(fst(pair(XS,YS))) -> mark(XS) active(snd(pair(XS,YS))) -> mark(YS) active(splitAt(0(),XS)) -> mark(pair(nil(),XS)) active(splitAt(s(N),cons(X,XS))) -> mark(u(splitAt(N,XS),N,X,XS)) active(u(pair(YS,ZS),N,X,XS)) -> mark(pair(cons(X,YS),ZS)) active(head(cons(N,XS))) -> mark(N) active(tail(cons(N,XS))) -> mark(XS) active(sel(N,XS)) -> mark(head(afterNth(N,XS))) active(take(N,XS)) -> mark(fst(splitAt(N,XS))) active(afterNth(N,XS)) -> mark(snd(splitAt(N,XS))) active(natsFrom(X)) -> natsFrom(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(s(X)) -> s(active(X)) active(fst(X)) -> fst(active(X)) active(pair(X1,X2)) -> pair(active(X1),X2) active(pair(X1,X2)) -> pair(X1,active(X2)) active(snd(X)) -> snd(active(X)) active(splitAt(X1,X2)) -> splitAt(active(X1),X2) active(splitAt(X1,X2)) -> splitAt(X1,active(X2)) active(u(X1,X2,X3,X4)) -> u(active(X1),X2,X3,X4) active(head(X)) -> head(active(X)) active(tail(X)) -> tail(active(X)) active(sel(X1,X2)) -> sel(active(X1),X2) active(sel(X1,X2)) -> sel(X1,active(X2)) active(afterNth(X1,X2)) -> afterNth(active(X1),X2) active(afterNth(X1,X2)) -> afterNth(X1,active(X2)) active(take(X1,X2)) -> take(active(X1),X2) active(take(X1,X2)) -> take(X1,active(X2)) natsFrom(mark(X)) -> mark(natsFrom(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) s(mark(X)) -> mark(s(X)) fst(mark(X)) -> mark(fst(X)) pair(mark(X1),X2) -> mark(pair(X1,X2)) pair(X1,mark(X2)) -> mark(pair(X1,X2)) snd(mark(X)) -> mark(snd(X)) splitAt(mark(X1),X2) -> mark(splitAt(X1,X2)) splitAt(X1,mark(X2)) -> mark(splitAt(X1,X2)) u(mark(X1),X2,X3,X4) -> mark(u(X1,X2,X3,X4)) head(mark(X)) -> mark(head(X)) tail(mark(X)) -> mark(tail(X)) sel(mark(X1),X2) -> mark(sel(X1,X2)) sel(X1,mark(X2)) -> mark(sel(X1,X2)) afterNth(mark(X1),X2) -> mark(afterNth(X1,X2)) afterNth(X1,mark(X2)) -> mark(afterNth(X1,X2)) take(mark(X1),X2) -> mark(take(X1,X2)) take(X1,mark(X2)) -> mark(take(X1,X2)) proper(natsFrom(X)) -> natsFrom(proper(X)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 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(splitAt(X1,X2)) -> splitAt(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(nil()) -> ok(nil()) 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(sel(X1,X2)) -> sel(proper(X1),proper(X2)) proper(afterNth(X1,X2)) -> afterNth(proper(X1),proper(X2)) proper(take(X1,X2)) -> take(proper(X1),proper(X2)) natsFrom(ok(X)) -> ok(natsFrom(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) s(ok(X)) -> ok(s(X)) fst(ok(X)) -> ok(fst(X)) pair(ok(X1),ok(X2)) -> ok(pair(X1,X2)) snd(ok(X)) -> ok(snd(X)) splitAt(ok(X1),ok(X2)) -> ok(splitAt(X1,X2)) u(ok(X1),ok(X2),ok(X3),ok(X4)) -> ok(u(X1,X2,X3,X4)) head(ok(X)) -> ok(head(X)) tail(ok(X)) -> ok(tail(X)) sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) afterNth(ok(X1),ok(X2)) -> ok(afterNth(X1,X2)) take(ok(X1),ok(X2)) -> ok(take(X1,X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Subterm Criterion Processor: simple projection: pi(proper#) = 0 problem: DPs: TRS: active(natsFrom(N)) -> mark(cons(N,natsFrom(s(N)))) active(fst(pair(XS,YS))) -> mark(XS) active(snd(pair(XS,YS))) -> mark(YS) active(splitAt(0(),XS)) -> mark(pair(nil(),XS)) active(splitAt(s(N),cons(X,XS))) -> mark(u(splitAt(N,XS),N,X,XS)) active(u(pair(YS,ZS),N,X,XS)) -> mark(pair(cons(X,YS),ZS)) active(head(cons(N,XS))) -> mark(N) active(tail(cons(N,XS))) -> mark(XS) active(sel(N,XS)) -> mark(head(afterNth(N,XS))) active(take(N,XS)) -> mark(fst(splitAt(N,XS))) active(afterNth(N,XS)) -> mark(snd(splitAt(N,XS))) active(natsFrom(X)) -> natsFrom(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(s(X)) -> s(active(X)) active(fst(X)) -> fst(active(X)) active(pair(X1,X2)) -> pair(active(X1),X2) active(pair(X1,X2)) -> pair(X1,active(X2)) active(snd(X)) -> snd(active(X)) active(splitAt(X1,X2)) -> splitAt(active(X1),X2) active(splitAt(X1,X2)) -> splitAt(X1,active(X2)) active(u(X1,X2,X3,X4)) -> u(active(X1),X2,X3,X4) active(head(X)) -> head(active(X)) active(tail(X)) -> tail(active(X)) active(sel(X1,X2)) -> sel(active(X1),X2) active(sel(X1,X2)) -> sel(X1,active(X2)) active(afterNth(X1,X2)) -> afterNth(active(X1),X2) active(afterNth(X1,X2)) -> afterNth(X1,active(X2)) active(take(X1,X2)) -> take(active(X1),X2) active(take(X1,X2)) -> take(X1,active(X2)) natsFrom(mark(X)) -> mark(natsFrom(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) s(mark(X)) -> mark(s(X)) fst(mark(X)) -> mark(fst(X)) pair(mark(X1),X2) -> mark(pair(X1,X2)) pair(X1,mark(X2)) -> mark(pair(X1,X2)) snd(mark(X)) -> mark(snd(X)) splitAt(mark(X1),X2) -> mark(splitAt(X1,X2)) splitAt(X1,mark(X2)) -> mark(splitAt(X1,X2)) u(mark(X1),X2,X3,X4) -> mark(u(X1,X2,X3,X4)) head(mark(X)) -> mark(head(X)) tail(mark(X)) -> mark(tail(X)) sel(mark(X1),X2) -> mark(sel(X1,X2)) sel(X1,mark(X2)) -> mark(sel(X1,X2)) afterNth(mark(X1),X2) -> mark(afterNth(X1,X2)) afterNth(X1,mark(X2)) -> mark(afterNth(X1,X2)) take(mark(X1),X2) -> mark(take(X1,X2)) take(X1,mark(X2)) -> mark(take(X1,X2)) proper(natsFrom(X)) -> natsFrom(proper(X)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 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(splitAt(X1,X2)) -> splitAt(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(nil()) -> ok(nil()) 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(sel(X1,X2)) -> sel(proper(X1),proper(X2)) proper(afterNth(X1,X2)) -> afterNth(proper(X1),proper(X2)) proper(take(X1,X2)) -> take(proper(X1),proper(X2)) natsFrom(ok(X)) -> ok(natsFrom(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) s(ok(X)) -> ok(s(X)) fst(ok(X)) -> ok(fst(X)) pair(ok(X1),ok(X2)) -> ok(pair(X1,X2)) snd(ok(X)) -> ok(snd(X)) splitAt(ok(X1),ok(X2)) -> ok(splitAt(X1,X2)) u(ok(X1),ok(X2),ok(X3),ok(X4)) -> ok(u(X1,X2,X3,X4)) head(ok(X)) -> ok(head(X)) tail(ok(X)) -> ok(tail(X)) sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) afterNth(ok(X1),ok(X2)) -> ok(afterNth(X1,X2)) take(ok(X1),ok(X2)) -> ok(take(X1,X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Qed DPs: take#(mark(X1),X2) -> take#(X1,X2) take#(X1,mark(X2)) -> take#(X1,X2) take#(ok(X1),ok(X2)) -> take#(X1,X2) TRS: active(natsFrom(N)) -> mark(cons(N,natsFrom(s(N)))) active(fst(pair(XS,YS))) -> mark(XS) active(snd(pair(XS,YS))) -> mark(YS) active(splitAt(0(),XS)) -> mark(pair(nil(),XS)) active(splitAt(s(N),cons(X,XS))) -> mark(u(splitAt(N,XS),N,X,XS)) active(u(pair(YS,ZS),N,X,XS)) -> mark(pair(cons(X,YS),ZS)) active(head(cons(N,XS))) -> mark(N) active(tail(cons(N,XS))) -> mark(XS) active(sel(N,XS)) -> mark(head(afterNth(N,XS))) active(take(N,XS)) -> mark(fst(splitAt(N,XS))) active(afterNth(N,XS)) -> mark(snd(splitAt(N,XS))) active(natsFrom(X)) -> natsFrom(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(s(X)) -> s(active(X)) active(fst(X)) -> fst(active(X)) active(pair(X1,X2)) -> pair(active(X1),X2) active(pair(X1,X2)) -> pair(X1,active(X2)) active(snd(X)) -> snd(active(X)) active(splitAt(X1,X2)) -> splitAt(active(X1),X2) active(splitAt(X1,X2)) -> splitAt(X1,active(X2)) active(u(X1,X2,X3,X4)) -> u(active(X1),X2,X3,X4) active(head(X)) -> head(active(X)) active(tail(X)) -> tail(active(X)) active(sel(X1,X2)) -> sel(active(X1),X2) active(sel(X1,X2)) -> sel(X1,active(X2)) active(afterNth(X1,X2)) -> afterNth(active(X1),X2) active(afterNth(X1,X2)) -> afterNth(X1,active(X2)) active(take(X1,X2)) -> take(active(X1),X2) active(take(X1,X2)) -> take(X1,active(X2)) natsFrom(mark(X)) -> mark(natsFrom(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) s(mark(X)) -> mark(s(X)) fst(mark(X)) -> mark(fst(X)) pair(mark(X1),X2) -> mark(pair(X1,X2)) pair(X1,mark(X2)) -> mark(pair(X1,X2)) snd(mark(X)) -> mark(snd(X)) splitAt(mark(X1),X2) -> mark(splitAt(X1,X2)) splitAt(X1,mark(X2)) -> mark(splitAt(X1,X2)) u(mark(X1),X2,X3,X4) -> mark(u(X1,X2,X3,X4)) head(mark(X)) -> mark(head(X)) tail(mark(X)) -> mark(tail(X)) sel(mark(X1),X2) -> mark(sel(X1,X2)) sel(X1,mark(X2)) -> mark(sel(X1,X2)) afterNth(mark(X1),X2) -> mark(afterNth(X1,X2)) afterNth(X1,mark(X2)) -> mark(afterNth(X1,X2)) take(mark(X1),X2) -> mark(take(X1,X2)) take(X1,mark(X2)) -> mark(take(X1,X2)) proper(natsFrom(X)) -> natsFrom(proper(X)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 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(splitAt(X1,X2)) -> splitAt(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(nil()) -> ok(nil()) 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(sel(X1,X2)) -> sel(proper(X1),proper(X2)) proper(afterNth(X1,X2)) -> afterNth(proper(X1),proper(X2)) proper(take(X1,X2)) -> take(proper(X1),proper(X2)) natsFrom(ok(X)) -> ok(natsFrom(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) s(ok(X)) -> ok(s(X)) fst(ok(X)) -> ok(fst(X)) pair(ok(X1),ok(X2)) -> ok(pair(X1,X2)) snd(ok(X)) -> ok(snd(X)) splitAt(ok(X1),ok(X2)) -> ok(splitAt(X1,X2)) u(ok(X1),ok(X2),ok(X3),ok(X4)) -> ok(u(X1,X2,X3,X4)) head(ok(X)) -> ok(head(X)) tail(ok(X)) -> ok(tail(X)) sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) afterNth(ok(X1),ok(X2)) -> ok(afterNth(X1,X2)) take(ok(X1),ok(X2)) -> ok(take(X1,X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Subterm Criterion Processor: simple projection: pi(take#) = 1 problem: DPs: take#(mark(X1),X2) -> take#(X1,X2) TRS: active(natsFrom(N)) -> mark(cons(N,natsFrom(s(N)))) active(fst(pair(XS,YS))) -> mark(XS) active(snd(pair(XS,YS))) -> mark(YS) active(splitAt(0(),XS)) -> mark(pair(nil(),XS)) active(splitAt(s(N),cons(X,XS))) -> mark(u(splitAt(N,XS),N,X,XS)) active(u(pair(YS,ZS),N,X,XS)) -> mark(pair(cons(X,YS),ZS)) active(head(cons(N,XS))) -> mark(N) active(tail(cons(N,XS))) -> mark(XS) active(sel(N,XS)) -> mark(head(afterNth(N,XS))) active(take(N,XS)) -> mark(fst(splitAt(N,XS))) active(afterNth(N,XS)) -> mark(snd(splitAt(N,XS))) active(natsFrom(X)) -> natsFrom(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(s(X)) -> s(active(X)) active(fst(X)) -> fst(active(X)) active(pair(X1,X2)) -> pair(active(X1),X2) active(pair(X1,X2)) -> pair(X1,active(X2)) active(snd(X)) -> snd(active(X)) active(splitAt(X1,X2)) -> splitAt(active(X1),X2) active(splitAt(X1,X2)) -> splitAt(X1,active(X2)) active(u(X1,X2,X3,X4)) -> u(active(X1),X2,X3,X4) active(head(X)) -> head(active(X)) active(tail(X)) -> tail(active(X)) active(sel(X1,X2)) -> sel(active(X1),X2) active(sel(X1,X2)) -> sel(X1,active(X2)) active(afterNth(X1,X2)) -> afterNth(active(X1),X2) active(afterNth(X1,X2)) -> afterNth(X1,active(X2)) active(take(X1,X2)) -> take(active(X1),X2) active(take(X1,X2)) -> take(X1,active(X2)) natsFrom(mark(X)) -> mark(natsFrom(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) s(mark(X)) -> mark(s(X)) fst(mark(X)) -> mark(fst(X)) pair(mark(X1),X2) -> mark(pair(X1,X2)) pair(X1,mark(X2)) -> mark(pair(X1,X2)) snd(mark(X)) -> mark(snd(X)) splitAt(mark(X1),X2) -> mark(splitAt(X1,X2)) splitAt(X1,mark(X2)) -> mark(splitAt(X1,X2)) u(mark(X1),X2,X3,X4) -> mark(u(X1,X2,X3,X4)) head(mark(X)) -> mark(head(X)) tail(mark(X)) -> mark(tail(X)) sel(mark(X1),X2) -> mark(sel(X1,X2)) sel(X1,mark(X2)) -> mark(sel(X1,X2)) afterNth(mark(X1),X2) -> mark(afterNth(X1,X2)) afterNth(X1,mark(X2)) -> mark(afterNth(X1,X2)) take(mark(X1),X2) -> mark(take(X1,X2)) take(X1,mark(X2)) -> mark(take(X1,X2)) proper(natsFrom(X)) -> natsFrom(proper(X)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 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(splitAt(X1,X2)) -> splitAt(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(nil()) -> ok(nil()) 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(sel(X1,X2)) -> sel(proper(X1),proper(X2)) proper(afterNth(X1,X2)) -> afterNth(proper(X1),proper(X2)) proper(take(X1,X2)) -> take(proper(X1),proper(X2)) natsFrom(ok(X)) -> ok(natsFrom(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) s(ok(X)) -> ok(s(X)) fst(ok(X)) -> ok(fst(X)) pair(ok(X1),ok(X2)) -> ok(pair(X1,X2)) snd(ok(X)) -> ok(snd(X)) splitAt(ok(X1),ok(X2)) -> ok(splitAt(X1,X2)) u(ok(X1),ok(X2),ok(X3),ok(X4)) -> ok(u(X1,X2,X3,X4)) head(ok(X)) -> ok(head(X)) tail(ok(X)) -> ok(tail(X)) sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) afterNth(ok(X1),ok(X2)) -> ok(afterNth(X1,X2)) take(ok(X1),ok(X2)) -> ok(take(X1,X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Subterm Criterion Processor: simple projection: pi(take#) = 0 problem: DPs: TRS: active(natsFrom(N)) -> mark(cons(N,natsFrom(s(N)))) active(fst(pair(XS,YS))) -> mark(XS) active(snd(pair(XS,YS))) -> mark(YS) active(splitAt(0(),XS)) -> mark(pair(nil(),XS)) active(splitAt(s(N),cons(X,XS))) -> mark(u(splitAt(N,XS),N,X,XS)) active(u(pair(YS,ZS),N,X,XS)) -> mark(pair(cons(X,YS),ZS)) active(head(cons(N,XS))) -> mark(N) active(tail(cons(N,XS))) -> mark(XS) active(sel(N,XS)) -> mark(head(afterNth(N,XS))) active(take(N,XS)) -> mark(fst(splitAt(N,XS))) active(afterNth(N,XS)) -> mark(snd(splitAt(N,XS))) active(natsFrom(X)) -> natsFrom(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(s(X)) -> s(active(X)) active(fst(X)) -> fst(active(X)) active(pair(X1,X2)) -> pair(active(X1),X2) active(pair(X1,X2)) -> pair(X1,active(X2)) active(snd(X)) -> snd(active(X)) active(splitAt(X1,X2)) -> splitAt(active(X1),X2) active(splitAt(X1,X2)) -> splitAt(X1,active(X2)) active(u(X1,X2,X3,X4)) -> u(active(X1),X2,X3,X4) active(head(X)) -> head(active(X)) active(tail(X)) -> tail(active(X)) active(sel(X1,X2)) -> sel(active(X1),X2) active(sel(X1,X2)) -> sel(X1,active(X2)) active(afterNth(X1,X2)) -> afterNth(active(X1),X2) active(afterNth(X1,X2)) -> afterNth(X1,active(X2)) active(take(X1,X2)) -> take(active(X1),X2) active(take(X1,X2)) -> take(X1,active(X2)) natsFrom(mark(X)) -> mark(natsFrom(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) s(mark(X)) -> mark(s(X)) fst(mark(X)) -> mark(fst(X)) pair(mark(X1),X2) -> mark(pair(X1,X2)) pair(X1,mark(X2)) -> mark(pair(X1,X2)) snd(mark(X)) -> mark(snd(X)) splitAt(mark(X1),X2) -> mark(splitAt(X1,X2)) splitAt(X1,mark(X2)) -> mark(splitAt(X1,X2)) u(mark(X1),X2,X3,X4) -> mark(u(X1,X2,X3,X4)) head(mark(X)) -> mark(head(X)) tail(mark(X)) -> mark(tail(X)) sel(mark(X1),X2) -> mark(sel(X1,X2)) sel(X1,mark(X2)) -> mark(sel(X1,X2)) afterNth(mark(X1),X2) -> mark(afterNth(X1,X2)) afterNth(X1,mark(X2)) -> mark(afterNth(X1,X2)) take(mark(X1),X2) -> mark(take(X1,X2)) take(X1,mark(X2)) -> mark(take(X1,X2)) proper(natsFrom(X)) -> natsFrom(proper(X)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 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(splitAt(X1,X2)) -> splitAt(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(nil()) -> ok(nil()) 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(sel(X1,X2)) -> sel(proper(X1),proper(X2)) proper(afterNth(X1,X2)) -> afterNth(proper(X1),proper(X2)) proper(take(X1,X2)) -> take(proper(X1),proper(X2)) natsFrom(ok(X)) -> ok(natsFrom(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) s(ok(X)) -> ok(s(X)) fst(ok(X)) -> ok(fst(X)) pair(ok(X1),ok(X2)) -> ok(pair(X1,X2)) snd(ok(X)) -> ok(snd(X)) splitAt(ok(X1),ok(X2)) -> ok(splitAt(X1,X2)) u(ok(X1),ok(X2),ok(X3),ok(X4)) -> ok(u(X1,X2,X3,X4)) head(ok(X)) -> ok(head(X)) tail(ok(X)) -> ok(tail(X)) sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) afterNth(ok(X1),ok(X2)) -> ok(afterNth(X1,X2)) take(ok(X1),ok(X2)) -> ok(take(X1,X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Qed DPs: afterNth#(mark(X1),X2) -> afterNth#(X1,X2) afterNth#(X1,mark(X2)) -> afterNth#(X1,X2) afterNth#(ok(X1),ok(X2)) -> afterNth#(X1,X2) TRS: active(natsFrom(N)) -> mark(cons(N,natsFrom(s(N)))) active(fst(pair(XS,YS))) -> mark(XS) active(snd(pair(XS,YS))) -> mark(YS) active(splitAt(0(),XS)) -> mark(pair(nil(),XS)) active(splitAt(s(N),cons(X,XS))) -> mark(u(splitAt(N,XS),N,X,XS)) active(u(pair(YS,ZS),N,X,XS)) -> mark(pair(cons(X,YS),ZS)) active(head(cons(N,XS))) -> mark(N) active(tail(cons(N,XS))) -> mark(XS) active(sel(N,XS)) -> mark(head(afterNth(N,XS))) active(take(N,XS)) -> mark(fst(splitAt(N,XS))) active(afterNth(N,XS)) -> mark(snd(splitAt(N,XS))) active(natsFrom(X)) -> natsFrom(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(s(X)) -> s(active(X)) active(fst(X)) -> fst(active(X)) active(pair(X1,X2)) -> pair(active(X1),X2) active(pair(X1,X2)) -> pair(X1,active(X2)) active(snd(X)) -> snd(active(X)) active(splitAt(X1,X2)) -> splitAt(active(X1),X2) active(splitAt(X1,X2)) -> splitAt(X1,active(X2)) active(u(X1,X2,X3,X4)) -> u(active(X1),X2,X3,X4) active(head(X)) -> head(active(X)) active(tail(X)) -> tail(active(X)) active(sel(X1,X2)) -> sel(active(X1),X2) active(sel(X1,X2)) -> sel(X1,active(X2)) active(afterNth(X1,X2)) -> afterNth(active(X1),X2) active(afterNth(X1,X2)) -> afterNth(X1,active(X2)) active(take(X1,X2)) -> take(active(X1),X2) active(take(X1,X2)) -> take(X1,active(X2)) natsFrom(mark(X)) -> mark(natsFrom(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) s(mark(X)) -> mark(s(X)) fst(mark(X)) -> mark(fst(X)) pair(mark(X1),X2) -> mark(pair(X1,X2)) pair(X1,mark(X2)) -> mark(pair(X1,X2)) snd(mark(X)) -> mark(snd(X)) splitAt(mark(X1),X2) -> mark(splitAt(X1,X2)) splitAt(X1,mark(X2)) -> mark(splitAt(X1,X2)) u(mark(X1),X2,X3,X4) -> mark(u(X1,X2,X3,X4)) head(mark(X)) -> mark(head(X)) tail(mark(X)) -> mark(tail(X)) sel(mark(X1),X2) -> mark(sel(X1,X2)) sel(X1,mark(X2)) -> mark(sel(X1,X2)) afterNth(mark(X1),X2) -> mark(afterNth(X1,X2)) afterNth(X1,mark(X2)) -> mark(afterNth(X1,X2)) take(mark(X1),X2) -> mark(take(X1,X2)) take(X1,mark(X2)) -> mark(take(X1,X2)) proper(natsFrom(X)) -> natsFrom(proper(X)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 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(splitAt(X1,X2)) -> splitAt(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(nil()) -> ok(nil()) 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(sel(X1,X2)) -> sel(proper(X1),proper(X2)) proper(afterNth(X1,X2)) -> afterNth(proper(X1),proper(X2)) proper(take(X1,X2)) -> take(proper(X1),proper(X2)) natsFrom(ok(X)) -> ok(natsFrom(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) s(ok(X)) -> ok(s(X)) fst(ok(X)) -> ok(fst(X)) pair(ok(X1),ok(X2)) -> ok(pair(X1,X2)) snd(ok(X)) -> ok(snd(X)) splitAt(ok(X1),ok(X2)) -> ok(splitAt(X1,X2)) u(ok(X1),ok(X2),ok(X3),ok(X4)) -> ok(u(X1,X2,X3,X4)) head(ok(X)) -> ok(head(X)) tail(ok(X)) -> ok(tail(X)) sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) afterNth(ok(X1),ok(X2)) -> ok(afterNth(X1,X2)) take(ok(X1),ok(X2)) -> ok(take(X1,X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Subterm Criterion Processor: simple projection: pi(afterNth#) = 1 problem: DPs: afterNth#(mark(X1),X2) -> afterNth#(X1,X2) TRS: active(natsFrom(N)) -> mark(cons(N,natsFrom(s(N)))) active(fst(pair(XS,YS))) -> mark(XS) active(snd(pair(XS,YS))) -> mark(YS) active(splitAt(0(),XS)) -> mark(pair(nil(),XS)) active(splitAt(s(N),cons(X,XS))) -> mark(u(splitAt(N,XS),N,X,XS)) active(u(pair(YS,ZS),N,X,XS)) -> mark(pair(cons(X,YS),ZS)) active(head(cons(N,XS))) -> mark(N) active(tail(cons(N,XS))) -> mark(XS) active(sel(N,XS)) -> mark(head(afterNth(N,XS))) active(take(N,XS)) -> mark(fst(splitAt(N,XS))) active(afterNth(N,XS)) -> mark(snd(splitAt(N,XS))) active(natsFrom(X)) -> natsFrom(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(s(X)) -> s(active(X)) active(fst(X)) -> fst(active(X)) active(pair(X1,X2)) -> pair(active(X1),X2) active(pair(X1,X2)) -> pair(X1,active(X2)) active(snd(X)) -> snd(active(X)) active(splitAt(X1,X2)) -> splitAt(active(X1),X2) active(splitAt(X1,X2)) -> splitAt(X1,active(X2)) active(u(X1,X2,X3,X4)) -> u(active(X1),X2,X3,X4) active(head(X)) -> head(active(X)) active(tail(X)) -> tail(active(X)) active(sel(X1,X2)) -> sel(active(X1),X2) active(sel(X1,X2)) -> sel(X1,active(X2)) active(afterNth(X1,X2)) -> afterNth(active(X1),X2) active(afterNth(X1,X2)) -> afterNth(X1,active(X2)) active(take(X1,X2)) -> take(active(X1),X2) active(take(X1,X2)) -> take(X1,active(X2)) natsFrom(mark(X)) -> mark(natsFrom(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) s(mark(X)) -> mark(s(X)) fst(mark(X)) -> mark(fst(X)) pair(mark(X1),X2) -> mark(pair(X1,X2)) pair(X1,mark(X2)) -> mark(pair(X1,X2)) snd(mark(X)) -> mark(snd(X)) splitAt(mark(X1),X2) -> mark(splitAt(X1,X2)) splitAt(X1,mark(X2)) -> mark(splitAt(X1,X2)) u(mark(X1),X2,X3,X4) -> mark(u(X1,X2,X3,X4)) head(mark(X)) -> mark(head(X)) tail(mark(X)) -> mark(tail(X)) sel(mark(X1),X2) -> mark(sel(X1,X2)) sel(X1,mark(X2)) -> mark(sel(X1,X2)) afterNth(mark(X1),X2) -> mark(afterNth(X1,X2)) afterNth(X1,mark(X2)) -> mark(afterNth(X1,X2)) take(mark(X1),X2) -> mark(take(X1,X2)) take(X1,mark(X2)) -> mark(take(X1,X2)) proper(natsFrom(X)) -> natsFrom(proper(X)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 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(splitAt(X1,X2)) -> splitAt(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(nil()) -> ok(nil()) 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(sel(X1,X2)) -> sel(proper(X1),proper(X2)) proper(afterNth(X1,X2)) -> afterNth(proper(X1),proper(X2)) proper(take(X1,X2)) -> take(proper(X1),proper(X2)) natsFrom(ok(X)) -> ok(natsFrom(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) s(ok(X)) -> ok(s(X)) fst(ok(X)) -> ok(fst(X)) pair(ok(X1),ok(X2)) -> ok(pair(X1,X2)) snd(ok(X)) -> ok(snd(X)) splitAt(ok(X1),ok(X2)) -> ok(splitAt(X1,X2)) u(ok(X1),ok(X2),ok(X3),ok(X4)) -> ok(u(X1,X2,X3,X4)) head(ok(X)) -> ok(head(X)) tail(ok(X)) -> ok(tail(X)) sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) afterNth(ok(X1),ok(X2)) -> ok(afterNth(X1,X2)) take(ok(X1),ok(X2)) -> ok(take(X1,X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Subterm Criterion Processor: simple projection: pi(afterNth#) = 0 problem: DPs: TRS: active(natsFrom(N)) -> mark(cons(N,natsFrom(s(N)))) active(fst(pair(XS,YS))) -> mark(XS) active(snd(pair(XS,YS))) -> mark(YS) active(splitAt(0(),XS)) -> mark(pair(nil(),XS)) active(splitAt(s(N),cons(X,XS))) -> mark(u(splitAt(N,XS),N,X,XS)) active(u(pair(YS,ZS),N,X,XS)) -> mark(pair(cons(X,YS),ZS)) active(head(cons(N,XS))) -> mark(N) active(tail(cons(N,XS))) -> mark(XS) active(sel(N,XS)) -> mark(head(afterNth(N,XS))) active(take(N,XS)) -> mark(fst(splitAt(N,XS))) active(afterNth(N,XS)) -> mark(snd(splitAt(N,XS))) active(natsFrom(X)) -> natsFrom(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(s(X)) -> s(active(X)) active(fst(X)) -> fst(active(X)) active(pair(X1,X2)) -> pair(active(X1),X2) active(pair(X1,X2)) -> pair(X1,active(X2)) active(snd(X)) -> snd(active(X)) active(splitAt(X1,X2)) -> splitAt(active(X1),X2) active(splitAt(X1,X2)) -> splitAt(X1,active(X2)) active(u(X1,X2,X3,X4)) -> u(active(X1),X2,X3,X4) active(head(X)) -> head(active(X)) active(tail(X)) -> tail(active(X)) active(sel(X1,X2)) -> sel(active(X1),X2) active(sel(X1,X2)) -> sel(X1,active(X2)) active(afterNth(X1,X2)) -> afterNth(active(X1),X2) active(afterNth(X1,X2)) -> afterNth(X1,active(X2)) active(take(X1,X2)) -> take(active(X1),X2) active(take(X1,X2)) -> take(X1,active(X2)) natsFrom(mark(X)) -> mark(natsFrom(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) s(mark(X)) -> mark(s(X)) fst(mark(X)) -> mark(fst(X)) pair(mark(X1),X2) -> mark(pair(X1,X2)) pair(X1,mark(X2)) -> mark(pair(X1,X2)) snd(mark(X)) -> mark(snd(X)) splitAt(mark(X1),X2) -> mark(splitAt(X1,X2)) splitAt(X1,mark(X2)) -> mark(splitAt(X1,X2)) u(mark(X1),X2,X3,X4) -> mark(u(X1,X2,X3,X4)) head(mark(X)) -> mark(head(X)) tail(mark(X)) -> mark(tail(X)) sel(mark(X1),X2) -> mark(sel(X1,X2)) sel(X1,mark(X2)) -> mark(sel(X1,X2)) afterNth(mark(X1),X2) -> mark(afterNth(X1,X2)) afterNth(X1,mark(X2)) -> mark(afterNth(X1,X2)) take(mark(X1),X2) -> mark(take(X1,X2)) take(X1,mark(X2)) -> mark(take(X1,X2)) proper(natsFrom(X)) -> natsFrom(proper(X)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 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(splitAt(X1,X2)) -> splitAt(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(nil()) -> ok(nil()) 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(sel(X1,X2)) -> sel(proper(X1),proper(X2)) proper(afterNth(X1,X2)) -> afterNth(proper(X1),proper(X2)) proper(take(X1,X2)) -> take(proper(X1),proper(X2)) natsFrom(ok(X)) -> ok(natsFrom(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) s(ok(X)) -> ok(s(X)) fst(ok(X)) -> ok(fst(X)) pair(ok(X1),ok(X2)) -> ok(pair(X1,X2)) snd(ok(X)) -> ok(snd(X)) splitAt(ok(X1),ok(X2)) -> ok(splitAt(X1,X2)) u(ok(X1),ok(X2),ok(X3),ok(X4)) -> ok(u(X1,X2,X3,X4)) head(ok(X)) -> ok(head(X)) tail(ok(X)) -> ok(tail(X)) sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) afterNth(ok(X1),ok(X2)) -> ok(afterNth(X1,X2)) take(ok(X1),ok(X2)) -> ok(take(X1,X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Qed DPs: sel#(mark(X1),X2) -> sel#(X1,X2) sel#(X1,mark(X2)) -> sel#(X1,X2) sel#(ok(X1),ok(X2)) -> sel#(X1,X2) TRS: active(natsFrom(N)) -> mark(cons(N,natsFrom(s(N)))) active(fst(pair(XS,YS))) -> mark(XS) active(snd(pair(XS,YS))) -> mark(YS) active(splitAt(0(),XS)) -> mark(pair(nil(),XS)) active(splitAt(s(N),cons(X,XS))) -> mark(u(splitAt(N,XS),N,X,XS)) active(u(pair(YS,ZS),N,X,XS)) -> mark(pair(cons(X,YS),ZS)) active(head(cons(N,XS))) -> mark(N) active(tail(cons(N,XS))) -> mark(XS) active(sel(N,XS)) -> mark(head(afterNth(N,XS))) active(take(N,XS)) -> mark(fst(splitAt(N,XS))) active(afterNth(N,XS)) -> mark(snd(splitAt(N,XS))) active(natsFrom(X)) -> natsFrom(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(s(X)) -> s(active(X)) active(fst(X)) -> fst(active(X)) active(pair(X1,X2)) -> pair(active(X1),X2) active(pair(X1,X2)) -> pair(X1,active(X2)) active(snd(X)) -> snd(active(X)) active(splitAt(X1,X2)) -> splitAt(active(X1),X2) active(splitAt(X1,X2)) -> splitAt(X1,active(X2)) active(u(X1,X2,X3,X4)) -> u(active(X1),X2,X3,X4) active(head(X)) -> head(active(X)) active(tail(X)) -> tail(active(X)) active(sel(X1,X2)) -> sel(active(X1),X2) active(sel(X1,X2)) -> sel(X1,active(X2)) active(afterNth(X1,X2)) -> afterNth(active(X1),X2) active(afterNth(X1,X2)) -> afterNth(X1,active(X2)) active(take(X1,X2)) -> take(active(X1),X2) active(take(X1,X2)) -> take(X1,active(X2)) natsFrom(mark(X)) -> mark(natsFrom(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) s(mark(X)) -> mark(s(X)) fst(mark(X)) -> mark(fst(X)) pair(mark(X1),X2) -> mark(pair(X1,X2)) pair(X1,mark(X2)) -> mark(pair(X1,X2)) snd(mark(X)) -> mark(snd(X)) splitAt(mark(X1),X2) -> mark(splitAt(X1,X2)) splitAt(X1,mark(X2)) -> mark(splitAt(X1,X2)) u(mark(X1),X2,X3,X4) -> mark(u(X1,X2,X3,X4)) head(mark(X)) -> mark(head(X)) tail(mark(X)) -> mark(tail(X)) sel(mark(X1),X2) -> mark(sel(X1,X2)) sel(X1,mark(X2)) -> mark(sel(X1,X2)) afterNth(mark(X1),X2) -> mark(afterNth(X1,X2)) afterNth(X1,mark(X2)) -> mark(afterNth(X1,X2)) take(mark(X1),X2) -> mark(take(X1,X2)) take(X1,mark(X2)) -> mark(take(X1,X2)) proper(natsFrom(X)) -> natsFrom(proper(X)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 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(splitAt(X1,X2)) -> splitAt(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(nil()) -> ok(nil()) 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(sel(X1,X2)) -> sel(proper(X1),proper(X2)) proper(afterNth(X1,X2)) -> afterNth(proper(X1),proper(X2)) proper(take(X1,X2)) -> take(proper(X1),proper(X2)) natsFrom(ok(X)) -> ok(natsFrom(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) s(ok(X)) -> ok(s(X)) fst(ok(X)) -> ok(fst(X)) pair(ok(X1),ok(X2)) -> ok(pair(X1,X2)) snd(ok(X)) -> ok(snd(X)) splitAt(ok(X1),ok(X2)) -> ok(splitAt(X1,X2)) u(ok(X1),ok(X2),ok(X3),ok(X4)) -> ok(u(X1,X2,X3,X4)) head(ok(X)) -> ok(head(X)) tail(ok(X)) -> ok(tail(X)) sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) afterNth(ok(X1),ok(X2)) -> ok(afterNth(X1,X2)) take(ok(X1),ok(X2)) -> ok(take(X1,X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Subterm Criterion Processor: simple projection: pi(sel#) = 1 problem: DPs: sel#(mark(X1),X2) -> sel#(X1,X2) TRS: active(natsFrom(N)) -> mark(cons(N,natsFrom(s(N)))) active(fst(pair(XS,YS))) -> mark(XS) active(snd(pair(XS,YS))) -> mark(YS) active(splitAt(0(),XS)) -> mark(pair(nil(),XS)) active(splitAt(s(N),cons(X,XS))) -> mark(u(splitAt(N,XS),N,X,XS)) active(u(pair(YS,ZS),N,X,XS)) -> mark(pair(cons(X,YS),ZS)) active(head(cons(N,XS))) -> mark(N) active(tail(cons(N,XS))) -> mark(XS) active(sel(N,XS)) -> mark(head(afterNth(N,XS))) active(take(N,XS)) -> mark(fst(splitAt(N,XS))) active(afterNth(N,XS)) -> mark(snd(splitAt(N,XS))) active(natsFrom(X)) -> natsFrom(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(s(X)) -> s(active(X)) active(fst(X)) -> fst(active(X)) active(pair(X1,X2)) -> pair(active(X1),X2) active(pair(X1,X2)) -> pair(X1,active(X2)) active(snd(X)) -> snd(active(X)) active(splitAt(X1,X2)) -> splitAt(active(X1),X2) active(splitAt(X1,X2)) -> splitAt(X1,active(X2)) active(u(X1,X2,X3,X4)) -> u(active(X1),X2,X3,X4) active(head(X)) -> head(active(X)) active(tail(X)) -> tail(active(X)) active(sel(X1,X2)) -> sel(active(X1),X2) active(sel(X1,X2)) -> sel(X1,active(X2)) active(afterNth(X1,X2)) -> afterNth(active(X1),X2) active(afterNth(X1,X2)) -> afterNth(X1,active(X2)) active(take(X1,X2)) -> take(active(X1),X2) active(take(X1,X2)) -> take(X1,active(X2)) natsFrom(mark(X)) -> mark(natsFrom(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) s(mark(X)) -> mark(s(X)) fst(mark(X)) -> mark(fst(X)) pair(mark(X1),X2) -> mark(pair(X1,X2)) pair(X1,mark(X2)) -> mark(pair(X1,X2)) snd(mark(X)) -> mark(snd(X)) splitAt(mark(X1),X2) -> mark(splitAt(X1,X2)) splitAt(X1,mark(X2)) -> mark(splitAt(X1,X2)) u(mark(X1),X2,X3,X4) -> mark(u(X1,X2,X3,X4)) head(mark(X)) -> mark(head(X)) tail(mark(X)) -> mark(tail(X)) sel(mark(X1),X2) -> mark(sel(X1,X2)) sel(X1,mark(X2)) -> mark(sel(X1,X2)) afterNth(mark(X1),X2) -> mark(afterNth(X1,X2)) afterNth(X1,mark(X2)) -> mark(afterNth(X1,X2)) take(mark(X1),X2) -> mark(take(X1,X2)) take(X1,mark(X2)) -> mark(take(X1,X2)) proper(natsFrom(X)) -> natsFrom(proper(X)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 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(splitAt(X1,X2)) -> splitAt(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(nil()) -> ok(nil()) 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(sel(X1,X2)) -> sel(proper(X1),proper(X2)) proper(afterNth(X1,X2)) -> afterNth(proper(X1),proper(X2)) proper(take(X1,X2)) -> take(proper(X1),proper(X2)) natsFrom(ok(X)) -> ok(natsFrom(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) s(ok(X)) -> ok(s(X)) fst(ok(X)) -> ok(fst(X)) pair(ok(X1),ok(X2)) -> ok(pair(X1,X2)) snd(ok(X)) -> ok(snd(X)) splitAt(ok(X1),ok(X2)) -> ok(splitAt(X1,X2)) u(ok(X1),ok(X2),ok(X3),ok(X4)) -> ok(u(X1,X2,X3,X4)) head(ok(X)) -> ok(head(X)) tail(ok(X)) -> ok(tail(X)) sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) afterNth(ok(X1),ok(X2)) -> ok(afterNth(X1,X2)) take(ok(X1),ok(X2)) -> ok(take(X1,X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Subterm Criterion Processor: simple projection: pi(sel#) = 0 problem: DPs: TRS: active(natsFrom(N)) -> mark(cons(N,natsFrom(s(N)))) active(fst(pair(XS,YS))) -> mark(XS) active(snd(pair(XS,YS))) -> mark(YS) active(splitAt(0(),XS)) -> mark(pair(nil(),XS)) active(splitAt(s(N),cons(X,XS))) -> mark(u(splitAt(N,XS),N,X,XS)) active(u(pair(YS,ZS),N,X,XS)) -> mark(pair(cons(X,YS),ZS)) active(head(cons(N,XS))) -> mark(N) active(tail(cons(N,XS))) -> mark(XS) active(sel(N,XS)) -> mark(head(afterNth(N,XS))) active(take(N,XS)) -> mark(fst(splitAt(N,XS))) active(afterNth(N,XS)) -> mark(snd(splitAt(N,XS))) active(natsFrom(X)) -> natsFrom(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(s(X)) -> s(active(X)) active(fst(X)) -> fst(active(X)) active(pair(X1,X2)) -> pair(active(X1),X2) active(pair(X1,X2)) -> pair(X1,active(X2)) active(snd(X)) -> snd(active(X)) active(splitAt(X1,X2)) -> splitAt(active(X1),X2) active(splitAt(X1,X2)) -> splitAt(X1,active(X2)) active(u(X1,X2,X3,X4)) -> u(active(X1),X2,X3,X4) active(head(X)) -> head(active(X)) active(tail(X)) -> tail(active(X)) active(sel(X1,X2)) -> sel(active(X1),X2) active(sel(X1,X2)) -> sel(X1,active(X2)) active(afterNth(X1,X2)) -> afterNth(active(X1),X2) active(afterNth(X1,X2)) -> afterNth(X1,active(X2)) active(take(X1,X2)) -> take(active(X1),X2) active(take(X1,X2)) -> take(X1,active(X2)) natsFrom(mark(X)) -> mark(natsFrom(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) s(mark(X)) -> mark(s(X)) fst(mark(X)) -> mark(fst(X)) pair(mark(X1),X2) -> mark(pair(X1,X2)) pair(X1,mark(X2)) -> mark(pair(X1,X2)) snd(mark(X)) -> mark(snd(X)) splitAt(mark(X1),X2) -> mark(splitAt(X1,X2)) splitAt(X1,mark(X2)) -> mark(splitAt(X1,X2)) u(mark(X1),X2,X3,X4) -> mark(u(X1,X2,X3,X4)) head(mark(X)) -> mark(head(X)) tail(mark(X)) -> mark(tail(X)) sel(mark(X1),X2) -> mark(sel(X1,X2)) sel(X1,mark(X2)) -> mark(sel(X1,X2)) afterNth(mark(X1),X2) -> mark(afterNth(X1,X2)) afterNth(X1,mark(X2)) -> mark(afterNth(X1,X2)) take(mark(X1),X2) -> mark(take(X1,X2)) take(X1,mark(X2)) -> mark(take(X1,X2)) proper(natsFrom(X)) -> natsFrom(proper(X)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 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(splitAt(X1,X2)) -> splitAt(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(nil()) -> ok(nil()) 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(sel(X1,X2)) -> sel(proper(X1),proper(X2)) proper(afterNth(X1,X2)) -> afterNth(proper(X1),proper(X2)) proper(take(X1,X2)) -> take(proper(X1),proper(X2)) natsFrom(ok(X)) -> ok(natsFrom(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) s(ok(X)) -> ok(s(X)) fst(ok(X)) -> ok(fst(X)) pair(ok(X1),ok(X2)) -> ok(pair(X1,X2)) snd(ok(X)) -> ok(snd(X)) splitAt(ok(X1),ok(X2)) -> ok(splitAt(X1,X2)) u(ok(X1),ok(X2),ok(X3),ok(X4)) -> ok(u(X1,X2,X3,X4)) head(ok(X)) -> ok(head(X)) tail(ok(X)) -> ok(tail(X)) sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) afterNth(ok(X1),ok(X2)) -> ok(afterNth(X1,X2)) take(ok(X1),ok(X2)) -> ok(take(X1,X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Qed DPs: tail#(mark(X)) -> tail#(X) tail#(ok(X)) -> tail#(X) TRS: active(natsFrom(N)) -> mark(cons(N,natsFrom(s(N)))) active(fst(pair(XS,YS))) -> mark(XS) active(snd(pair(XS,YS))) -> mark(YS) active(splitAt(0(),XS)) -> mark(pair(nil(),XS)) active(splitAt(s(N),cons(X,XS))) -> mark(u(splitAt(N,XS),N,X,XS)) active(u(pair(YS,ZS),N,X,XS)) -> mark(pair(cons(X,YS),ZS)) active(head(cons(N,XS))) -> mark(N) active(tail(cons(N,XS))) -> mark(XS) active(sel(N,XS)) -> mark(head(afterNth(N,XS))) active(take(N,XS)) -> mark(fst(splitAt(N,XS))) active(afterNth(N,XS)) -> mark(snd(splitAt(N,XS))) active(natsFrom(X)) -> natsFrom(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(s(X)) -> s(active(X)) active(fst(X)) -> fst(active(X)) active(pair(X1,X2)) -> pair(active(X1),X2) active(pair(X1,X2)) -> pair(X1,active(X2)) active(snd(X)) -> snd(active(X)) active(splitAt(X1,X2)) -> splitAt(active(X1),X2) active(splitAt(X1,X2)) -> splitAt(X1,active(X2)) active(u(X1,X2,X3,X4)) -> u(active(X1),X2,X3,X4) active(head(X)) -> head(active(X)) active(tail(X)) -> tail(active(X)) active(sel(X1,X2)) -> sel(active(X1),X2) active(sel(X1,X2)) -> sel(X1,active(X2)) active(afterNth(X1,X2)) -> afterNth(active(X1),X2) active(afterNth(X1,X2)) -> afterNth(X1,active(X2)) active(take(X1,X2)) -> take(active(X1),X2) active(take(X1,X2)) -> take(X1,active(X2)) natsFrom(mark(X)) -> mark(natsFrom(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) s(mark(X)) -> mark(s(X)) fst(mark(X)) -> mark(fst(X)) pair(mark(X1),X2) -> mark(pair(X1,X2)) pair(X1,mark(X2)) -> mark(pair(X1,X2)) snd(mark(X)) -> mark(snd(X)) splitAt(mark(X1),X2) -> mark(splitAt(X1,X2)) splitAt(X1,mark(X2)) -> mark(splitAt(X1,X2)) u(mark(X1),X2,X3,X4) -> mark(u(X1,X2,X3,X4)) head(mark(X)) -> mark(head(X)) tail(mark(X)) -> mark(tail(X)) sel(mark(X1),X2) -> mark(sel(X1,X2)) sel(X1,mark(X2)) -> mark(sel(X1,X2)) afterNth(mark(X1),X2) -> mark(afterNth(X1,X2)) afterNth(X1,mark(X2)) -> mark(afterNth(X1,X2)) take(mark(X1),X2) -> mark(take(X1,X2)) take(X1,mark(X2)) -> mark(take(X1,X2)) proper(natsFrom(X)) -> natsFrom(proper(X)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 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(splitAt(X1,X2)) -> splitAt(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(nil()) -> ok(nil()) 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(sel(X1,X2)) -> sel(proper(X1),proper(X2)) proper(afterNth(X1,X2)) -> afterNth(proper(X1),proper(X2)) proper(take(X1,X2)) -> take(proper(X1),proper(X2)) natsFrom(ok(X)) -> ok(natsFrom(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) s(ok(X)) -> ok(s(X)) fst(ok(X)) -> ok(fst(X)) pair(ok(X1),ok(X2)) -> ok(pair(X1,X2)) snd(ok(X)) -> ok(snd(X)) splitAt(ok(X1),ok(X2)) -> ok(splitAt(X1,X2)) u(ok(X1),ok(X2),ok(X3),ok(X4)) -> ok(u(X1,X2,X3,X4)) head(ok(X)) -> ok(head(X)) tail(ok(X)) -> ok(tail(X)) sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) afterNth(ok(X1),ok(X2)) -> ok(afterNth(X1,X2)) take(ok(X1),ok(X2)) -> ok(take(X1,X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Subterm Criterion Processor: simple projection: pi(tail#) = 0 problem: DPs: TRS: active(natsFrom(N)) -> mark(cons(N,natsFrom(s(N)))) active(fst(pair(XS,YS))) -> mark(XS) active(snd(pair(XS,YS))) -> mark(YS) active(splitAt(0(),XS)) -> mark(pair(nil(),XS)) active(splitAt(s(N),cons(X,XS))) -> mark(u(splitAt(N,XS),N,X,XS)) active(u(pair(YS,ZS),N,X,XS)) -> mark(pair(cons(X,YS),ZS)) active(head(cons(N,XS))) -> mark(N) active(tail(cons(N,XS))) -> mark(XS) active(sel(N,XS)) -> mark(head(afterNth(N,XS))) active(take(N,XS)) -> mark(fst(splitAt(N,XS))) active(afterNth(N,XS)) -> mark(snd(splitAt(N,XS))) active(natsFrom(X)) -> natsFrom(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(s(X)) -> s(active(X)) active(fst(X)) -> fst(active(X)) active(pair(X1,X2)) -> pair(active(X1),X2) active(pair(X1,X2)) -> pair(X1,active(X2)) active(snd(X)) -> snd(active(X)) active(splitAt(X1,X2)) -> splitAt(active(X1),X2) active(splitAt(X1,X2)) -> splitAt(X1,active(X2)) active(u(X1,X2,X3,X4)) -> u(active(X1),X2,X3,X4) active(head(X)) -> head(active(X)) active(tail(X)) -> tail(active(X)) active(sel(X1,X2)) -> sel(active(X1),X2) active(sel(X1,X2)) -> sel(X1,active(X2)) active(afterNth(X1,X2)) -> afterNth(active(X1),X2) active(afterNth(X1,X2)) -> afterNth(X1,active(X2)) active(take(X1,X2)) -> take(active(X1),X2) active(take(X1,X2)) -> take(X1,active(X2)) natsFrom(mark(X)) -> mark(natsFrom(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) s(mark(X)) -> mark(s(X)) fst(mark(X)) -> mark(fst(X)) pair(mark(X1),X2) -> mark(pair(X1,X2)) pair(X1,mark(X2)) -> mark(pair(X1,X2)) snd(mark(X)) -> mark(snd(X)) splitAt(mark(X1),X2) -> mark(splitAt(X1,X2)) splitAt(X1,mark(X2)) -> mark(splitAt(X1,X2)) u(mark(X1),X2,X3,X4) -> mark(u(X1,X2,X3,X4)) head(mark(X)) -> mark(head(X)) tail(mark(X)) -> mark(tail(X)) sel(mark(X1),X2) -> mark(sel(X1,X2)) sel(X1,mark(X2)) -> mark(sel(X1,X2)) afterNth(mark(X1),X2) -> mark(afterNth(X1,X2)) afterNth(X1,mark(X2)) -> mark(afterNth(X1,X2)) take(mark(X1),X2) -> mark(take(X1,X2)) take(X1,mark(X2)) -> mark(take(X1,X2)) proper(natsFrom(X)) -> natsFrom(proper(X)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 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(splitAt(X1,X2)) -> splitAt(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(nil()) -> ok(nil()) 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(sel(X1,X2)) -> sel(proper(X1),proper(X2)) proper(afterNth(X1,X2)) -> afterNth(proper(X1),proper(X2)) proper(take(X1,X2)) -> take(proper(X1),proper(X2)) natsFrom(ok(X)) -> ok(natsFrom(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) s(ok(X)) -> ok(s(X)) fst(ok(X)) -> ok(fst(X)) pair(ok(X1),ok(X2)) -> ok(pair(X1,X2)) snd(ok(X)) -> ok(snd(X)) splitAt(ok(X1),ok(X2)) -> ok(splitAt(X1,X2)) u(ok(X1),ok(X2),ok(X3),ok(X4)) -> ok(u(X1,X2,X3,X4)) head(ok(X)) -> ok(head(X)) tail(ok(X)) -> ok(tail(X)) sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) afterNth(ok(X1),ok(X2)) -> ok(afterNth(X1,X2)) take(ok(X1),ok(X2)) -> ok(take(X1,X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Qed DPs: head#(mark(X)) -> head#(X) head#(ok(X)) -> head#(X) TRS: active(natsFrom(N)) -> mark(cons(N,natsFrom(s(N)))) active(fst(pair(XS,YS))) -> mark(XS) active(snd(pair(XS,YS))) -> mark(YS) active(splitAt(0(),XS)) -> mark(pair(nil(),XS)) active(splitAt(s(N),cons(X,XS))) -> mark(u(splitAt(N,XS),N,X,XS)) active(u(pair(YS,ZS),N,X,XS)) -> mark(pair(cons(X,YS),ZS)) active(head(cons(N,XS))) -> mark(N) active(tail(cons(N,XS))) -> mark(XS) active(sel(N,XS)) -> mark(head(afterNth(N,XS))) active(take(N,XS)) -> mark(fst(splitAt(N,XS))) active(afterNth(N,XS)) -> mark(snd(splitAt(N,XS))) active(natsFrom(X)) -> natsFrom(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(s(X)) -> s(active(X)) active(fst(X)) -> fst(active(X)) active(pair(X1,X2)) -> pair(active(X1),X2) active(pair(X1,X2)) -> pair(X1,active(X2)) active(snd(X)) -> snd(active(X)) active(splitAt(X1,X2)) -> splitAt(active(X1),X2) active(splitAt(X1,X2)) -> splitAt(X1,active(X2)) active(u(X1,X2,X3,X4)) -> u(active(X1),X2,X3,X4) active(head(X)) -> head(active(X)) active(tail(X)) -> tail(active(X)) active(sel(X1,X2)) -> sel(active(X1),X2) active(sel(X1,X2)) -> sel(X1,active(X2)) active(afterNth(X1,X2)) -> afterNth(active(X1),X2) active(afterNth(X1,X2)) -> afterNth(X1,active(X2)) active(take(X1,X2)) -> take(active(X1),X2) active(take(X1,X2)) -> take(X1,active(X2)) natsFrom(mark(X)) -> mark(natsFrom(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) s(mark(X)) -> mark(s(X)) fst(mark(X)) -> mark(fst(X)) pair(mark(X1),X2) -> mark(pair(X1,X2)) pair(X1,mark(X2)) -> mark(pair(X1,X2)) snd(mark(X)) -> mark(snd(X)) splitAt(mark(X1),X2) -> mark(splitAt(X1,X2)) splitAt(X1,mark(X2)) -> mark(splitAt(X1,X2)) u(mark(X1),X2,X3,X4) -> mark(u(X1,X2,X3,X4)) head(mark(X)) -> mark(head(X)) tail(mark(X)) -> mark(tail(X)) sel(mark(X1),X2) -> mark(sel(X1,X2)) sel(X1,mark(X2)) -> mark(sel(X1,X2)) afterNth(mark(X1),X2) -> mark(afterNth(X1,X2)) afterNth(X1,mark(X2)) -> mark(afterNth(X1,X2)) take(mark(X1),X2) -> mark(take(X1,X2)) take(X1,mark(X2)) -> mark(take(X1,X2)) proper(natsFrom(X)) -> natsFrom(proper(X)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 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(splitAt(X1,X2)) -> splitAt(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(nil()) -> ok(nil()) 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(sel(X1,X2)) -> sel(proper(X1),proper(X2)) proper(afterNth(X1,X2)) -> afterNth(proper(X1),proper(X2)) proper(take(X1,X2)) -> take(proper(X1),proper(X2)) natsFrom(ok(X)) -> ok(natsFrom(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) s(ok(X)) -> ok(s(X)) fst(ok(X)) -> ok(fst(X)) pair(ok(X1),ok(X2)) -> ok(pair(X1,X2)) snd(ok(X)) -> ok(snd(X)) splitAt(ok(X1),ok(X2)) -> ok(splitAt(X1,X2)) u(ok(X1),ok(X2),ok(X3),ok(X4)) -> ok(u(X1,X2,X3,X4)) head(ok(X)) -> ok(head(X)) tail(ok(X)) -> ok(tail(X)) sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) afterNth(ok(X1),ok(X2)) -> ok(afterNth(X1,X2)) take(ok(X1),ok(X2)) -> ok(take(X1,X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Subterm Criterion Processor: simple projection: pi(head#) = 0 problem: DPs: TRS: active(natsFrom(N)) -> mark(cons(N,natsFrom(s(N)))) active(fst(pair(XS,YS))) -> mark(XS) active(snd(pair(XS,YS))) -> mark(YS) active(splitAt(0(),XS)) -> mark(pair(nil(),XS)) active(splitAt(s(N),cons(X,XS))) -> mark(u(splitAt(N,XS),N,X,XS)) active(u(pair(YS,ZS),N,X,XS)) -> mark(pair(cons(X,YS),ZS)) active(head(cons(N,XS))) -> mark(N) active(tail(cons(N,XS))) -> mark(XS) active(sel(N,XS)) -> mark(head(afterNth(N,XS))) active(take(N,XS)) -> mark(fst(splitAt(N,XS))) active(afterNth(N,XS)) -> mark(snd(splitAt(N,XS))) active(natsFrom(X)) -> natsFrom(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(s(X)) -> s(active(X)) active(fst(X)) -> fst(active(X)) active(pair(X1,X2)) -> pair(active(X1),X2) active(pair(X1,X2)) -> pair(X1,active(X2)) active(snd(X)) -> snd(active(X)) active(splitAt(X1,X2)) -> splitAt(active(X1),X2) active(splitAt(X1,X2)) -> splitAt(X1,active(X2)) active(u(X1,X2,X3,X4)) -> u(active(X1),X2,X3,X4) active(head(X)) -> head(active(X)) active(tail(X)) -> tail(active(X)) active(sel(X1,X2)) -> sel(active(X1),X2) active(sel(X1,X2)) -> sel(X1,active(X2)) active(afterNth(X1,X2)) -> afterNth(active(X1),X2) active(afterNth(X1,X2)) -> afterNth(X1,active(X2)) active(take(X1,X2)) -> take(active(X1),X2) active(take(X1,X2)) -> take(X1,active(X2)) natsFrom(mark(X)) -> mark(natsFrom(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) s(mark(X)) -> mark(s(X)) fst(mark(X)) -> mark(fst(X)) pair(mark(X1),X2) -> mark(pair(X1,X2)) pair(X1,mark(X2)) -> mark(pair(X1,X2)) snd(mark(X)) -> mark(snd(X)) splitAt(mark(X1),X2) -> mark(splitAt(X1,X2)) splitAt(X1,mark(X2)) -> mark(splitAt(X1,X2)) u(mark(X1),X2,X3,X4) -> mark(u(X1,X2,X3,X4)) head(mark(X)) -> mark(head(X)) tail(mark(X)) -> mark(tail(X)) sel(mark(X1),X2) -> mark(sel(X1,X2)) sel(X1,mark(X2)) -> mark(sel(X1,X2)) afterNth(mark(X1),X2) -> mark(afterNth(X1,X2)) afterNth(X1,mark(X2)) -> mark(afterNth(X1,X2)) take(mark(X1),X2) -> mark(take(X1,X2)) take(X1,mark(X2)) -> mark(take(X1,X2)) proper(natsFrom(X)) -> natsFrom(proper(X)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 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(splitAt(X1,X2)) -> splitAt(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(nil()) -> ok(nil()) 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(sel(X1,X2)) -> sel(proper(X1),proper(X2)) proper(afterNth(X1,X2)) -> afterNth(proper(X1),proper(X2)) proper(take(X1,X2)) -> take(proper(X1),proper(X2)) natsFrom(ok(X)) -> ok(natsFrom(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) s(ok(X)) -> ok(s(X)) fst(ok(X)) -> ok(fst(X)) pair(ok(X1),ok(X2)) -> ok(pair(X1,X2)) snd(ok(X)) -> ok(snd(X)) splitAt(ok(X1),ok(X2)) -> ok(splitAt(X1,X2)) u(ok(X1),ok(X2),ok(X3),ok(X4)) -> ok(u(X1,X2,X3,X4)) head(ok(X)) -> ok(head(X)) tail(ok(X)) -> ok(tail(X)) sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) afterNth(ok(X1),ok(X2)) -> ok(afterNth(X1,X2)) take(ok(X1),ok(X2)) -> ok(take(X1,X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Qed DPs: 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) TRS: active(natsFrom(N)) -> mark(cons(N,natsFrom(s(N)))) active(fst(pair(XS,YS))) -> mark(XS) active(snd(pair(XS,YS))) -> mark(YS) active(splitAt(0(),XS)) -> mark(pair(nil(),XS)) active(splitAt(s(N),cons(X,XS))) -> mark(u(splitAt(N,XS),N,X,XS)) active(u(pair(YS,ZS),N,X,XS)) -> mark(pair(cons(X,YS),ZS)) active(head(cons(N,XS))) -> mark(N) active(tail(cons(N,XS))) -> mark(XS) active(sel(N,XS)) -> mark(head(afterNth(N,XS))) active(take(N,XS)) -> mark(fst(splitAt(N,XS))) active(afterNth(N,XS)) -> mark(snd(splitAt(N,XS))) active(natsFrom(X)) -> natsFrom(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(s(X)) -> s(active(X)) active(fst(X)) -> fst(active(X)) active(pair(X1,X2)) -> pair(active(X1),X2) active(pair(X1,X2)) -> pair(X1,active(X2)) active(snd(X)) -> snd(active(X)) active(splitAt(X1,X2)) -> splitAt(active(X1),X2) active(splitAt(X1,X2)) -> splitAt(X1,active(X2)) active(u(X1,X2,X3,X4)) -> u(active(X1),X2,X3,X4) active(head(X)) -> head(active(X)) active(tail(X)) -> tail(active(X)) active(sel(X1,X2)) -> sel(active(X1),X2) active(sel(X1,X2)) -> sel(X1,active(X2)) active(afterNth(X1,X2)) -> afterNth(active(X1),X2) active(afterNth(X1,X2)) -> afterNth(X1,active(X2)) active(take(X1,X2)) -> take(active(X1),X2) active(take(X1,X2)) -> take(X1,active(X2)) natsFrom(mark(X)) -> mark(natsFrom(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) s(mark(X)) -> mark(s(X)) fst(mark(X)) -> mark(fst(X)) pair(mark(X1),X2) -> mark(pair(X1,X2)) pair(X1,mark(X2)) -> mark(pair(X1,X2)) snd(mark(X)) -> mark(snd(X)) splitAt(mark(X1),X2) -> mark(splitAt(X1,X2)) splitAt(X1,mark(X2)) -> mark(splitAt(X1,X2)) u(mark(X1),X2,X3,X4) -> mark(u(X1,X2,X3,X4)) head(mark(X)) -> mark(head(X)) tail(mark(X)) -> mark(tail(X)) sel(mark(X1),X2) -> mark(sel(X1,X2)) sel(X1,mark(X2)) -> mark(sel(X1,X2)) afterNth(mark(X1),X2) -> mark(afterNth(X1,X2)) afterNth(X1,mark(X2)) -> mark(afterNth(X1,X2)) take(mark(X1),X2) -> mark(take(X1,X2)) take(X1,mark(X2)) -> mark(take(X1,X2)) proper(natsFrom(X)) -> natsFrom(proper(X)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 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(splitAt(X1,X2)) -> splitAt(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(nil()) -> ok(nil()) 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(sel(X1,X2)) -> sel(proper(X1),proper(X2)) proper(afterNth(X1,X2)) -> afterNth(proper(X1),proper(X2)) proper(take(X1,X2)) -> take(proper(X1),proper(X2)) natsFrom(ok(X)) -> ok(natsFrom(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) s(ok(X)) -> ok(s(X)) fst(ok(X)) -> ok(fst(X)) pair(ok(X1),ok(X2)) -> ok(pair(X1,X2)) snd(ok(X)) -> ok(snd(X)) splitAt(ok(X1),ok(X2)) -> ok(splitAt(X1,X2)) u(ok(X1),ok(X2),ok(X3),ok(X4)) -> ok(u(X1,X2,X3,X4)) head(ok(X)) -> ok(head(X)) tail(ok(X)) -> ok(tail(X)) sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) afterNth(ok(X1),ok(X2)) -> ok(afterNth(X1,X2)) take(ok(X1),ok(X2)) -> ok(take(X1,X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Subterm Criterion Processor: simple projection: pi(u#) = 1 problem: DPs: u#(mark(X1),X2,X3,X4) -> u#(X1,X2,X3,X4) TRS: active(natsFrom(N)) -> mark(cons(N,natsFrom(s(N)))) active(fst(pair(XS,YS))) -> mark(XS) active(snd(pair(XS,YS))) -> mark(YS) active(splitAt(0(),XS)) -> mark(pair(nil(),XS)) active(splitAt(s(N),cons(X,XS))) -> mark(u(splitAt(N,XS),N,X,XS)) active(u(pair(YS,ZS),N,X,XS)) -> mark(pair(cons(X,YS),ZS)) active(head(cons(N,XS))) -> mark(N) active(tail(cons(N,XS))) -> mark(XS) active(sel(N,XS)) -> mark(head(afterNth(N,XS))) active(take(N,XS)) -> mark(fst(splitAt(N,XS))) active(afterNth(N,XS)) -> mark(snd(splitAt(N,XS))) active(natsFrom(X)) -> natsFrom(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(s(X)) -> s(active(X)) active(fst(X)) -> fst(active(X)) active(pair(X1,X2)) -> pair(active(X1),X2) active(pair(X1,X2)) -> pair(X1,active(X2)) active(snd(X)) -> snd(active(X)) active(splitAt(X1,X2)) -> splitAt(active(X1),X2) active(splitAt(X1,X2)) -> splitAt(X1,active(X2)) active(u(X1,X2,X3,X4)) -> u(active(X1),X2,X3,X4) active(head(X)) -> head(active(X)) active(tail(X)) -> tail(active(X)) active(sel(X1,X2)) -> sel(active(X1),X2) active(sel(X1,X2)) -> sel(X1,active(X2)) active(afterNth(X1,X2)) -> afterNth(active(X1),X2) active(afterNth(X1,X2)) -> afterNth(X1,active(X2)) active(take(X1,X2)) -> take(active(X1),X2) active(take(X1,X2)) -> take(X1,active(X2)) natsFrom(mark(X)) -> mark(natsFrom(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) s(mark(X)) -> mark(s(X)) fst(mark(X)) -> mark(fst(X)) pair(mark(X1),X2) -> mark(pair(X1,X2)) pair(X1,mark(X2)) -> mark(pair(X1,X2)) snd(mark(X)) -> mark(snd(X)) splitAt(mark(X1),X2) -> mark(splitAt(X1,X2)) splitAt(X1,mark(X2)) -> mark(splitAt(X1,X2)) u(mark(X1),X2,X3,X4) -> mark(u(X1,X2,X3,X4)) head(mark(X)) -> mark(head(X)) tail(mark(X)) -> mark(tail(X)) sel(mark(X1),X2) -> mark(sel(X1,X2)) sel(X1,mark(X2)) -> mark(sel(X1,X2)) afterNth(mark(X1),X2) -> mark(afterNth(X1,X2)) afterNth(X1,mark(X2)) -> mark(afterNth(X1,X2)) take(mark(X1),X2) -> mark(take(X1,X2)) take(X1,mark(X2)) -> mark(take(X1,X2)) proper(natsFrom(X)) -> natsFrom(proper(X)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 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(splitAt(X1,X2)) -> splitAt(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(nil()) -> ok(nil()) 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(sel(X1,X2)) -> sel(proper(X1),proper(X2)) proper(afterNth(X1,X2)) -> afterNth(proper(X1),proper(X2)) proper(take(X1,X2)) -> take(proper(X1),proper(X2)) natsFrom(ok(X)) -> ok(natsFrom(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) s(ok(X)) -> ok(s(X)) fst(ok(X)) -> ok(fst(X)) pair(ok(X1),ok(X2)) -> ok(pair(X1,X2)) snd(ok(X)) -> ok(snd(X)) splitAt(ok(X1),ok(X2)) -> ok(splitAt(X1,X2)) u(ok(X1),ok(X2),ok(X3),ok(X4)) -> ok(u(X1,X2,X3,X4)) head(ok(X)) -> ok(head(X)) tail(ok(X)) -> ok(tail(X)) sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) afterNth(ok(X1),ok(X2)) -> ok(afterNth(X1,X2)) take(ok(X1),ok(X2)) -> ok(take(X1,X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Subterm Criterion Processor: simple projection: pi(u#) = 0 problem: DPs: TRS: active(natsFrom(N)) -> mark(cons(N,natsFrom(s(N)))) active(fst(pair(XS,YS))) -> mark(XS) active(snd(pair(XS,YS))) -> mark(YS) active(splitAt(0(),XS)) -> mark(pair(nil(),XS)) active(splitAt(s(N),cons(X,XS))) -> mark(u(splitAt(N,XS),N,X,XS)) active(u(pair(YS,ZS),N,X,XS)) -> mark(pair(cons(X,YS),ZS)) active(head(cons(N,XS))) -> mark(N) active(tail(cons(N,XS))) -> mark(XS) active(sel(N,XS)) -> mark(head(afterNth(N,XS))) active(take(N,XS)) -> mark(fst(splitAt(N,XS))) active(afterNth(N,XS)) -> mark(snd(splitAt(N,XS))) active(natsFrom(X)) -> natsFrom(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(s(X)) -> s(active(X)) active(fst(X)) -> fst(active(X)) active(pair(X1,X2)) -> pair(active(X1),X2) active(pair(X1,X2)) -> pair(X1,active(X2)) active(snd(X)) -> snd(active(X)) active(splitAt(X1,X2)) -> splitAt(active(X1),X2) active(splitAt(X1,X2)) -> splitAt(X1,active(X2)) active(u(X1,X2,X3,X4)) -> u(active(X1),X2,X3,X4) active(head(X)) -> head(active(X)) active(tail(X)) -> tail(active(X)) active(sel(X1,X2)) -> sel(active(X1),X2) active(sel(X1,X2)) -> sel(X1,active(X2)) active(afterNth(X1,X2)) -> afterNth(active(X1),X2) active(afterNth(X1,X2)) -> afterNth(X1,active(X2)) active(take(X1,X2)) -> take(active(X1),X2) active(take(X1,X2)) -> take(X1,active(X2)) natsFrom(mark(X)) -> mark(natsFrom(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) s(mark(X)) -> mark(s(X)) fst(mark(X)) -> mark(fst(X)) pair(mark(X1),X2) -> mark(pair(X1,X2)) pair(X1,mark(X2)) -> mark(pair(X1,X2)) snd(mark(X)) -> mark(snd(X)) splitAt(mark(X1),X2) -> mark(splitAt(X1,X2)) splitAt(X1,mark(X2)) -> mark(splitAt(X1,X2)) u(mark(X1),X2,X3,X4) -> mark(u(X1,X2,X3,X4)) head(mark(X)) -> mark(head(X)) tail(mark(X)) -> mark(tail(X)) sel(mark(X1),X2) -> mark(sel(X1,X2)) sel(X1,mark(X2)) -> mark(sel(X1,X2)) afterNth(mark(X1),X2) -> mark(afterNth(X1,X2)) afterNth(X1,mark(X2)) -> mark(afterNth(X1,X2)) take(mark(X1),X2) -> mark(take(X1,X2)) take(X1,mark(X2)) -> mark(take(X1,X2)) proper(natsFrom(X)) -> natsFrom(proper(X)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 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(splitAt(X1,X2)) -> splitAt(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(nil()) -> ok(nil()) 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(sel(X1,X2)) -> sel(proper(X1),proper(X2)) proper(afterNth(X1,X2)) -> afterNth(proper(X1),proper(X2)) proper(take(X1,X2)) -> take(proper(X1),proper(X2)) natsFrom(ok(X)) -> ok(natsFrom(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) s(ok(X)) -> ok(s(X)) fst(ok(X)) -> ok(fst(X)) pair(ok(X1),ok(X2)) -> ok(pair(X1,X2)) snd(ok(X)) -> ok(snd(X)) splitAt(ok(X1),ok(X2)) -> ok(splitAt(X1,X2)) u(ok(X1),ok(X2),ok(X3),ok(X4)) -> ok(u(X1,X2,X3,X4)) head(ok(X)) -> ok(head(X)) tail(ok(X)) -> ok(tail(X)) sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) afterNth(ok(X1),ok(X2)) -> ok(afterNth(X1,X2)) take(ok(X1),ok(X2)) -> ok(take(X1,X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Qed DPs: splitAt#(mark(X1),X2) -> splitAt#(X1,X2) splitAt#(X1,mark(X2)) -> splitAt#(X1,X2) splitAt#(ok(X1),ok(X2)) -> splitAt#(X1,X2) TRS: active(natsFrom(N)) -> mark(cons(N,natsFrom(s(N)))) active(fst(pair(XS,YS))) -> mark(XS) active(snd(pair(XS,YS))) -> mark(YS) active(splitAt(0(),XS)) -> mark(pair(nil(),XS)) active(splitAt(s(N),cons(X,XS))) -> mark(u(splitAt(N,XS),N,X,XS)) active(u(pair(YS,ZS),N,X,XS)) -> mark(pair(cons(X,YS),ZS)) active(head(cons(N,XS))) -> mark(N) active(tail(cons(N,XS))) -> mark(XS) active(sel(N,XS)) -> mark(head(afterNth(N,XS))) active(take(N,XS)) -> mark(fst(splitAt(N,XS))) active(afterNth(N,XS)) -> mark(snd(splitAt(N,XS))) active(natsFrom(X)) -> natsFrom(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(s(X)) -> s(active(X)) active(fst(X)) -> fst(active(X)) active(pair(X1,X2)) -> pair(active(X1),X2) active(pair(X1,X2)) -> pair(X1,active(X2)) active(snd(X)) -> snd(active(X)) active(splitAt(X1,X2)) -> splitAt(active(X1),X2) active(splitAt(X1,X2)) -> splitAt(X1,active(X2)) active(u(X1,X2,X3,X4)) -> u(active(X1),X2,X3,X4) active(head(X)) -> head(active(X)) active(tail(X)) -> tail(active(X)) active(sel(X1,X2)) -> sel(active(X1),X2) active(sel(X1,X2)) -> sel(X1,active(X2)) active(afterNth(X1,X2)) -> afterNth(active(X1),X2) active(afterNth(X1,X2)) -> afterNth(X1,active(X2)) active(take(X1,X2)) -> take(active(X1),X2) active(take(X1,X2)) -> take(X1,active(X2)) natsFrom(mark(X)) -> mark(natsFrom(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) s(mark(X)) -> mark(s(X)) fst(mark(X)) -> mark(fst(X)) pair(mark(X1),X2) -> mark(pair(X1,X2)) pair(X1,mark(X2)) -> mark(pair(X1,X2)) snd(mark(X)) -> mark(snd(X)) splitAt(mark(X1),X2) -> mark(splitAt(X1,X2)) splitAt(X1,mark(X2)) -> mark(splitAt(X1,X2)) u(mark(X1),X2,X3,X4) -> mark(u(X1,X2,X3,X4)) head(mark(X)) -> mark(head(X)) tail(mark(X)) -> mark(tail(X)) sel(mark(X1),X2) -> mark(sel(X1,X2)) sel(X1,mark(X2)) -> mark(sel(X1,X2)) afterNth(mark(X1),X2) -> mark(afterNth(X1,X2)) afterNth(X1,mark(X2)) -> mark(afterNth(X1,X2)) take(mark(X1),X2) -> mark(take(X1,X2)) take(X1,mark(X2)) -> mark(take(X1,X2)) proper(natsFrom(X)) -> natsFrom(proper(X)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 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(splitAt(X1,X2)) -> splitAt(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(nil()) -> ok(nil()) 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(sel(X1,X2)) -> sel(proper(X1),proper(X2)) proper(afterNth(X1,X2)) -> afterNth(proper(X1),proper(X2)) proper(take(X1,X2)) -> take(proper(X1),proper(X2)) natsFrom(ok(X)) -> ok(natsFrom(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) s(ok(X)) -> ok(s(X)) fst(ok(X)) -> ok(fst(X)) pair(ok(X1),ok(X2)) -> ok(pair(X1,X2)) snd(ok(X)) -> ok(snd(X)) splitAt(ok(X1),ok(X2)) -> ok(splitAt(X1,X2)) u(ok(X1),ok(X2),ok(X3),ok(X4)) -> ok(u(X1,X2,X3,X4)) head(ok(X)) -> ok(head(X)) tail(ok(X)) -> ok(tail(X)) sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) afterNth(ok(X1),ok(X2)) -> ok(afterNth(X1,X2)) take(ok(X1),ok(X2)) -> ok(take(X1,X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Subterm Criterion Processor: simple projection: pi(splitAt#) = 1 problem: DPs: splitAt#(mark(X1),X2) -> splitAt#(X1,X2) TRS: active(natsFrom(N)) -> mark(cons(N,natsFrom(s(N)))) active(fst(pair(XS,YS))) -> mark(XS) active(snd(pair(XS,YS))) -> mark(YS) active(splitAt(0(),XS)) -> mark(pair(nil(),XS)) active(splitAt(s(N),cons(X,XS))) -> mark(u(splitAt(N,XS),N,X,XS)) active(u(pair(YS,ZS),N,X,XS)) -> mark(pair(cons(X,YS),ZS)) active(head(cons(N,XS))) -> mark(N) active(tail(cons(N,XS))) -> mark(XS) active(sel(N,XS)) -> mark(head(afterNth(N,XS))) active(take(N,XS)) -> mark(fst(splitAt(N,XS))) active(afterNth(N,XS)) -> mark(snd(splitAt(N,XS))) active(natsFrom(X)) -> natsFrom(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(s(X)) -> s(active(X)) active(fst(X)) -> fst(active(X)) active(pair(X1,X2)) -> pair(active(X1),X2) active(pair(X1,X2)) -> pair(X1,active(X2)) active(snd(X)) -> snd(active(X)) active(splitAt(X1,X2)) -> splitAt(active(X1),X2) active(splitAt(X1,X2)) -> splitAt(X1,active(X2)) active(u(X1,X2,X3,X4)) -> u(active(X1),X2,X3,X4) active(head(X)) -> head(active(X)) active(tail(X)) -> tail(active(X)) active(sel(X1,X2)) -> sel(active(X1),X2) active(sel(X1,X2)) -> sel(X1,active(X2)) active(afterNth(X1,X2)) -> afterNth(active(X1),X2) active(afterNth(X1,X2)) -> afterNth(X1,active(X2)) active(take(X1,X2)) -> take(active(X1),X2) active(take(X1,X2)) -> take(X1,active(X2)) natsFrom(mark(X)) -> mark(natsFrom(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) s(mark(X)) -> mark(s(X)) fst(mark(X)) -> mark(fst(X)) pair(mark(X1),X2) -> mark(pair(X1,X2)) pair(X1,mark(X2)) -> mark(pair(X1,X2)) snd(mark(X)) -> mark(snd(X)) splitAt(mark(X1),X2) -> mark(splitAt(X1,X2)) splitAt(X1,mark(X2)) -> mark(splitAt(X1,X2)) u(mark(X1),X2,X3,X4) -> mark(u(X1,X2,X3,X4)) head(mark(X)) -> mark(head(X)) tail(mark(X)) -> mark(tail(X)) sel(mark(X1),X2) -> mark(sel(X1,X2)) sel(X1,mark(X2)) -> mark(sel(X1,X2)) afterNth(mark(X1),X2) -> mark(afterNth(X1,X2)) afterNth(X1,mark(X2)) -> mark(afterNth(X1,X2)) take(mark(X1),X2) -> mark(take(X1,X2)) take(X1,mark(X2)) -> mark(take(X1,X2)) proper(natsFrom(X)) -> natsFrom(proper(X)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 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(splitAt(X1,X2)) -> splitAt(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(nil()) -> ok(nil()) 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(sel(X1,X2)) -> sel(proper(X1),proper(X2)) proper(afterNth(X1,X2)) -> afterNth(proper(X1),proper(X2)) proper(take(X1,X2)) -> take(proper(X1),proper(X2)) natsFrom(ok(X)) -> ok(natsFrom(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) s(ok(X)) -> ok(s(X)) fst(ok(X)) -> ok(fst(X)) pair(ok(X1),ok(X2)) -> ok(pair(X1,X2)) snd(ok(X)) -> ok(snd(X)) splitAt(ok(X1),ok(X2)) -> ok(splitAt(X1,X2)) u(ok(X1),ok(X2),ok(X3),ok(X4)) -> ok(u(X1,X2,X3,X4)) head(ok(X)) -> ok(head(X)) tail(ok(X)) -> ok(tail(X)) sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) afterNth(ok(X1),ok(X2)) -> ok(afterNth(X1,X2)) take(ok(X1),ok(X2)) -> ok(take(X1,X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Subterm Criterion Processor: simple projection: pi(splitAt#) = 0 problem: DPs: TRS: active(natsFrom(N)) -> mark(cons(N,natsFrom(s(N)))) active(fst(pair(XS,YS))) -> mark(XS) active(snd(pair(XS,YS))) -> mark(YS) active(splitAt(0(),XS)) -> mark(pair(nil(),XS)) active(splitAt(s(N),cons(X,XS))) -> mark(u(splitAt(N,XS),N,X,XS)) active(u(pair(YS,ZS),N,X,XS)) -> mark(pair(cons(X,YS),ZS)) active(head(cons(N,XS))) -> mark(N) active(tail(cons(N,XS))) -> mark(XS) active(sel(N,XS)) -> mark(head(afterNth(N,XS))) active(take(N,XS)) -> mark(fst(splitAt(N,XS))) active(afterNth(N,XS)) -> mark(snd(splitAt(N,XS))) active(natsFrom(X)) -> natsFrom(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(s(X)) -> s(active(X)) active(fst(X)) -> fst(active(X)) active(pair(X1,X2)) -> pair(active(X1),X2) active(pair(X1,X2)) -> pair(X1,active(X2)) active(snd(X)) -> snd(active(X)) active(splitAt(X1,X2)) -> splitAt(active(X1),X2) active(splitAt(X1,X2)) -> splitAt(X1,active(X2)) active(u(X1,X2,X3,X4)) -> u(active(X1),X2,X3,X4) active(head(X)) -> head(active(X)) active(tail(X)) -> tail(active(X)) active(sel(X1,X2)) -> sel(active(X1),X2) active(sel(X1,X2)) -> sel(X1,active(X2)) active(afterNth(X1,X2)) -> afterNth(active(X1),X2) active(afterNth(X1,X2)) -> afterNth(X1,active(X2)) active(take(X1,X2)) -> take(active(X1),X2) active(take(X1,X2)) -> take(X1,active(X2)) natsFrom(mark(X)) -> mark(natsFrom(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) s(mark(X)) -> mark(s(X)) fst(mark(X)) -> mark(fst(X)) pair(mark(X1),X2) -> mark(pair(X1,X2)) pair(X1,mark(X2)) -> mark(pair(X1,X2)) snd(mark(X)) -> mark(snd(X)) splitAt(mark(X1),X2) -> mark(splitAt(X1,X2)) splitAt(X1,mark(X2)) -> mark(splitAt(X1,X2)) u(mark(X1),X2,X3,X4) -> mark(u(X1,X2,X3,X4)) head(mark(X)) -> mark(head(X)) tail(mark(X)) -> mark(tail(X)) sel(mark(X1),X2) -> mark(sel(X1,X2)) sel(X1,mark(X2)) -> mark(sel(X1,X2)) afterNth(mark(X1),X2) -> mark(afterNth(X1,X2)) afterNth(X1,mark(X2)) -> mark(afterNth(X1,X2)) take(mark(X1),X2) -> mark(take(X1,X2)) take(X1,mark(X2)) -> mark(take(X1,X2)) proper(natsFrom(X)) -> natsFrom(proper(X)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 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(splitAt(X1,X2)) -> splitAt(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(nil()) -> ok(nil()) 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(sel(X1,X2)) -> sel(proper(X1),proper(X2)) proper(afterNth(X1,X2)) -> afterNth(proper(X1),proper(X2)) proper(take(X1,X2)) -> take(proper(X1),proper(X2)) natsFrom(ok(X)) -> ok(natsFrom(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) s(ok(X)) -> ok(s(X)) fst(ok(X)) -> ok(fst(X)) pair(ok(X1),ok(X2)) -> ok(pair(X1,X2)) snd(ok(X)) -> ok(snd(X)) splitAt(ok(X1),ok(X2)) -> ok(splitAt(X1,X2)) u(ok(X1),ok(X2),ok(X3),ok(X4)) -> ok(u(X1,X2,X3,X4)) head(ok(X)) -> ok(head(X)) tail(ok(X)) -> ok(tail(X)) sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) afterNth(ok(X1),ok(X2)) -> ok(afterNth(X1,X2)) take(ok(X1),ok(X2)) -> ok(take(X1,X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Qed DPs: snd#(mark(X)) -> snd#(X) snd#(ok(X)) -> snd#(X) TRS: active(natsFrom(N)) -> mark(cons(N,natsFrom(s(N)))) active(fst(pair(XS,YS))) -> mark(XS) active(snd(pair(XS,YS))) -> mark(YS) active(splitAt(0(),XS)) -> mark(pair(nil(),XS)) active(splitAt(s(N),cons(X,XS))) -> mark(u(splitAt(N,XS),N,X,XS)) active(u(pair(YS,ZS),N,X,XS)) -> mark(pair(cons(X,YS),ZS)) active(head(cons(N,XS))) -> mark(N) active(tail(cons(N,XS))) -> mark(XS) active(sel(N,XS)) -> mark(head(afterNth(N,XS))) active(take(N,XS)) -> mark(fst(splitAt(N,XS))) active(afterNth(N,XS)) -> mark(snd(splitAt(N,XS))) active(natsFrom(X)) -> natsFrom(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(s(X)) -> s(active(X)) active(fst(X)) -> fst(active(X)) active(pair(X1,X2)) -> pair(active(X1),X2) active(pair(X1,X2)) -> pair(X1,active(X2)) active(snd(X)) -> snd(active(X)) active(splitAt(X1,X2)) -> splitAt(active(X1),X2) active(splitAt(X1,X2)) -> splitAt(X1,active(X2)) active(u(X1,X2,X3,X4)) -> u(active(X1),X2,X3,X4) active(head(X)) -> head(active(X)) active(tail(X)) -> tail(active(X)) active(sel(X1,X2)) -> sel(active(X1),X2) active(sel(X1,X2)) -> sel(X1,active(X2)) active(afterNth(X1,X2)) -> afterNth(active(X1),X2) active(afterNth(X1,X2)) -> afterNth(X1,active(X2)) active(take(X1,X2)) -> take(active(X1),X2) active(take(X1,X2)) -> take(X1,active(X2)) natsFrom(mark(X)) -> mark(natsFrom(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) s(mark(X)) -> mark(s(X)) fst(mark(X)) -> mark(fst(X)) pair(mark(X1),X2) -> mark(pair(X1,X2)) pair(X1,mark(X2)) -> mark(pair(X1,X2)) snd(mark(X)) -> mark(snd(X)) splitAt(mark(X1),X2) -> mark(splitAt(X1,X2)) splitAt(X1,mark(X2)) -> mark(splitAt(X1,X2)) u(mark(X1),X2,X3,X4) -> mark(u(X1,X2,X3,X4)) head(mark(X)) -> mark(head(X)) tail(mark(X)) -> mark(tail(X)) sel(mark(X1),X2) -> mark(sel(X1,X2)) sel(X1,mark(X2)) -> mark(sel(X1,X2)) afterNth(mark(X1),X2) -> mark(afterNth(X1,X2)) afterNth(X1,mark(X2)) -> mark(afterNth(X1,X2)) take(mark(X1),X2) -> mark(take(X1,X2)) take(X1,mark(X2)) -> mark(take(X1,X2)) proper(natsFrom(X)) -> natsFrom(proper(X)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 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(splitAt(X1,X2)) -> splitAt(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(nil()) -> ok(nil()) 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(sel(X1,X2)) -> sel(proper(X1),proper(X2)) proper(afterNth(X1,X2)) -> afterNth(proper(X1),proper(X2)) proper(take(X1,X2)) -> take(proper(X1),proper(X2)) natsFrom(ok(X)) -> ok(natsFrom(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) s(ok(X)) -> ok(s(X)) fst(ok(X)) -> ok(fst(X)) pair(ok(X1),ok(X2)) -> ok(pair(X1,X2)) snd(ok(X)) -> ok(snd(X)) splitAt(ok(X1),ok(X2)) -> ok(splitAt(X1,X2)) u(ok(X1),ok(X2),ok(X3),ok(X4)) -> ok(u(X1,X2,X3,X4)) head(ok(X)) -> ok(head(X)) tail(ok(X)) -> ok(tail(X)) sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) afterNth(ok(X1),ok(X2)) -> ok(afterNth(X1,X2)) take(ok(X1),ok(X2)) -> ok(take(X1,X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Subterm Criterion Processor: simple projection: pi(snd#) = 0 problem: DPs: TRS: active(natsFrom(N)) -> mark(cons(N,natsFrom(s(N)))) active(fst(pair(XS,YS))) -> mark(XS) active(snd(pair(XS,YS))) -> mark(YS) active(splitAt(0(),XS)) -> mark(pair(nil(),XS)) active(splitAt(s(N),cons(X,XS))) -> mark(u(splitAt(N,XS),N,X,XS)) active(u(pair(YS,ZS),N,X,XS)) -> mark(pair(cons(X,YS),ZS)) active(head(cons(N,XS))) -> mark(N) active(tail(cons(N,XS))) -> mark(XS) active(sel(N,XS)) -> mark(head(afterNth(N,XS))) active(take(N,XS)) -> mark(fst(splitAt(N,XS))) active(afterNth(N,XS)) -> mark(snd(splitAt(N,XS))) active(natsFrom(X)) -> natsFrom(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(s(X)) -> s(active(X)) active(fst(X)) -> fst(active(X)) active(pair(X1,X2)) -> pair(active(X1),X2) active(pair(X1,X2)) -> pair(X1,active(X2)) active(snd(X)) -> snd(active(X)) active(splitAt(X1,X2)) -> splitAt(active(X1),X2) active(splitAt(X1,X2)) -> splitAt(X1,active(X2)) active(u(X1,X2,X3,X4)) -> u(active(X1),X2,X3,X4) active(head(X)) -> head(active(X)) active(tail(X)) -> tail(active(X)) active(sel(X1,X2)) -> sel(active(X1),X2) active(sel(X1,X2)) -> sel(X1,active(X2)) active(afterNth(X1,X2)) -> afterNth(active(X1),X2) active(afterNth(X1,X2)) -> afterNth(X1,active(X2)) active(take(X1,X2)) -> take(active(X1),X2) active(take(X1,X2)) -> take(X1,active(X2)) natsFrom(mark(X)) -> mark(natsFrom(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) s(mark(X)) -> mark(s(X)) fst(mark(X)) -> mark(fst(X)) pair(mark(X1),X2) -> mark(pair(X1,X2)) pair(X1,mark(X2)) -> mark(pair(X1,X2)) snd(mark(X)) -> mark(snd(X)) splitAt(mark(X1),X2) -> mark(splitAt(X1,X2)) splitAt(X1,mark(X2)) -> mark(splitAt(X1,X2)) u(mark(X1),X2,X3,X4) -> mark(u(X1,X2,X3,X4)) head(mark(X)) -> mark(head(X)) tail(mark(X)) -> mark(tail(X)) sel(mark(X1),X2) -> mark(sel(X1,X2)) sel(X1,mark(X2)) -> mark(sel(X1,X2)) afterNth(mark(X1),X2) -> mark(afterNth(X1,X2)) afterNth(X1,mark(X2)) -> mark(afterNth(X1,X2)) take(mark(X1),X2) -> mark(take(X1,X2)) take(X1,mark(X2)) -> mark(take(X1,X2)) proper(natsFrom(X)) -> natsFrom(proper(X)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 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(splitAt(X1,X2)) -> splitAt(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(nil()) -> ok(nil()) 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(sel(X1,X2)) -> sel(proper(X1),proper(X2)) proper(afterNth(X1,X2)) -> afterNth(proper(X1),proper(X2)) proper(take(X1,X2)) -> take(proper(X1),proper(X2)) natsFrom(ok(X)) -> ok(natsFrom(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) s(ok(X)) -> ok(s(X)) fst(ok(X)) -> ok(fst(X)) pair(ok(X1),ok(X2)) -> ok(pair(X1,X2)) snd(ok(X)) -> ok(snd(X)) splitAt(ok(X1),ok(X2)) -> ok(splitAt(X1,X2)) u(ok(X1),ok(X2),ok(X3),ok(X4)) -> ok(u(X1,X2,X3,X4)) head(ok(X)) -> ok(head(X)) tail(ok(X)) -> ok(tail(X)) sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) afterNth(ok(X1),ok(X2)) -> ok(afterNth(X1,X2)) take(ok(X1),ok(X2)) -> ok(take(X1,X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Qed DPs: pair#(mark(X1),X2) -> pair#(X1,X2) pair#(X1,mark(X2)) -> pair#(X1,X2) pair#(ok(X1),ok(X2)) -> pair#(X1,X2) TRS: active(natsFrom(N)) -> mark(cons(N,natsFrom(s(N)))) active(fst(pair(XS,YS))) -> mark(XS) active(snd(pair(XS,YS))) -> mark(YS) active(splitAt(0(),XS)) -> mark(pair(nil(),XS)) active(splitAt(s(N),cons(X,XS))) -> mark(u(splitAt(N,XS),N,X,XS)) active(u(pair(YS,ZS),N,X,XS)) -> mark(pair(cons(X,YS),ZS)) active(head(cons(N,XS))) -> mark(N) active(tail(cons(N,XS))) -> mark(XS) active(sel(N,XS)) -> mark(head(afterNth(N,XS))) active(take(N,XS)) -> mark(fst(splitAt(N,XS))) active(afterNth(N,XS)) -> mark(snd(splitAt(N,XS))) active(natsFrom(X)) -> natsFrom(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(s(X)) -> s(active(X)) active(fst(X)) -> fst(active(X)) active(pair(X1,X2)) -> pair(active(X1),X2) active(pair(X1,X2)) -> pair(X1,active(X2)) active(snd(X)) -> snd(active(X)) active(splitAt(X1,X2)) -> splitAt(active(X1),X2) active(splitAt(X1,X2)) -> splitAt(X1,active(X2)) active(u(X1,X2,X3,X4)) -> u(active(X1),X2,X3,X4) active(head(X)) -> head(active(X)) active(tail(X)) -> tail(active(X)) active(sel(X1,X2)) -> sel(active(X1),X2) active(sel(X1,X2)) -> sel(X1,active(X2)) active(afterNth(X1,X2)) -> afterNth(active(X1),X2) active(afterNth(X1,X2)) -> afterNth(X1,active(X2)) active(take(X1,X2)) -> take(active(X1),X2) active(take(X1,X2)) -> take(X1,active(X2)) natsFrom(mark(X)) -> mark(natsFrom(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) s(mark(X)) -> mark(s(X)) fst(mark(X)) -> mark(fst(X)) pair(mark(X1),X2) -> mark(pair(X1,X2)) pair(X1,mark(X2)) -> mark(pair(X1,X2)) snd(mark(X)) -> mark(snd(X)) splitAt(mark(X1),X2) -> mark(splitAt(X1,X2)) splitAt(X1,mark(X2)) -> mark(splitAt(X1,X2)) u(mark(X1),X2,X3,X4) -> mark(u(X1,X2,X3,X4)) head(mark(X)) -> mark(head(X)) tail(mark(X)) -> mark(tail(X)) sel(mark(X1),X2) -> mark(sel(X1,X2)) sel(X1,mark(X2)) -> mark(sel(X1,X2)) afterNth(mark(X1),X2) -> mark(afterNth(X1,X2)) afterNth(X1,mark(X2)) -> mark(afterNth(X1,X2)) take(mark(X1),X2) -> mark(take(X1,X2)) take(X1,mark(X2)) -> mark(take(X1,X2)) proper(natsFrom(X)) -> natsFrom(proper(X)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 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(splitAt(X1,X2)) -> splitAt(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(nil()) -> ok(nil()) 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(sel(X1,X2)) -> sel(proper(X1),proper(X2)) proper(afterNth(X1,X2)) -> afterNth(proper(X1),proper(X2)) proper(take(X1,X2)) -> take(proper(X1),proper(X2)) natsFrom(ok(X)) -> ok(natsFrom(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) s(ok(X)) -> ok(s(X)) fst(ok(X)) -> ok(fst(X)) pair(ok(X1),ok(X2)) -> ok(pair(X1,X2)) snd(ok(X)) -> ok(snd(X)) splitAt(ok(X1),ok(X2)) -> ok(splitAt(X1,X2)) u(ok(X1),ok(X2),ok(X3),ok(X4)) -> ok(u(X1,X2,X3,X4)) head(ok(X)) -> ok(head(X)) tail(ok(X)) -> ok(tail(X)) sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) afterNth(ok(X1),ok(X2)) -> ok(afterNth(X1,X2)) take(ok(X1),ok(X2)) -> ok(take(X1,X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Subterm Criterion Processor: simple projection: pi(pair#) = 1 problem: DPs: pair#(mark(X1),X2) -> pair#(X1,X2) TRS: active(natsFrom(N)) -> mark(cons(N,natsFrom(s(N)))) active(fst(pair(XS,YS))) -> mark(XS) active(snd(pair(XS,YS))) -> mark(YS) active(splitAt(0(),XS)) -> mark(pair(nil(),XS)) active(splitAt(s(N),cons(X,XS))) -> mark(u(splitAt(N,XS),N,X,XS)) active(u(pair(YS,ZS),N,X,XS)) -> mark(pair(cons(X,YS),ZS)) active(head(cons(N,XS))) -> mark(N) active(tail(cons(N,XS))) -> mark(XS) active(sel(N,XS)) -> mark(head(afterNth(N,XS))) active(take(N,XS)) -> mark(fst(splitAt(N,XS))) active(afterNth(N,XS)) -> mark(snd(splitAt(N,XS))) active(natsFrom(X)) -> natsFrom(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(s(X)) -> s(active(X)) active(fst(X)) -> fst(active(X)) active(pair(X1,X2)) -> pair(active(X1),X2) active(pair(X1,X2)) -> pair(X1,active(X2)) active(snd(X)) -> snd(active(X)) active(splitAt(X1,X2)) -> splitAt(active(X1),X2) active(splitAt(X1,X2)) -> splitAt(X1,active(X2)) active(u(X1,X2,X3,X4)) -> u(active(X1),X2,X3,X4) active(head(X)) -> head(active(X)) active(tail(X)) -> tail(active(X)) active(sel(X1,X2)) -> sel(active(X1),X2) active(sel(X1,X2)) -> sel(X1,active(X2)) active(afterNth(X1,X2)) -> afterNth(active(X1),X2) active(afterNth(X1,X2)) -> afterNth(X1,active(X2)) active(take(X1,X2)) -> take(active(X1),X2) active(take(X1,X2)) -> take(X1,active(X2)) natsFrom(mark(X)) -> mark(natsFrom(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) s(mark(X)) -> mark(s(X)) fst(mark(X)) -> mark(fst(X)) pair(mark(X1),X2) -> mark(pair(X1,X2)) pair(X1,mark(X2)) -> mark(pair(X1,X2)) snd(mark(X)) -> mark(snd(X)) splitAt(mark(X1),X2) -> mark(splitAt(X1,X2)) splitAt(X1,mark(X2)) -> mark(splitAt(X1,X2)) u(mark(X1),X2,X3,X4) -> mark(u(X1,X2,X3,X4)) head(mark(X)) -> mark(head(X)) tail(mark(X)) -> mark(tail(X)) sel(mark(X1),X2) -> mark(sel(X1,X2)) sel(X1,mark(X2)) -> mark(sel(X1,X2)) afterNth(mark(X1),X2) -> mark(afterNth(X1,X2)) afterNth(X1,mark(X2)) -> mark(afterNth(X1,X2)) take(mark(X1),X2) -> mark(take(X1,X2)) take(X1,mark(X2)) -> mark(take(X1,X2)) proper(natsFrom(X)) -> natsFrom(proper(X)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 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(splitAt(X1,X2)) -> splitAt(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(nil()) -> ok(nil()) 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(sel(X1,X2)) -> sel(proper(X1),proper(X2)) proper(afterNth(X1,X2)) -> afterNth(proper(X1),proper(X2)) proper(take(X1,X2)) -> take(proper(X1),proper(X2)) natsFrom(ok(X)) -> ok(natsFrom(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) s(ok(X)) -> ok(s(X)) fst(ok(X)) -> ok(fst(X)) pair(ok(X1),ok(X2)) -> ok(pair(X1,X2)) snd(ok(X)) -> ok(snd(X)) splitAt(ok(X1),ok(X2)) -> ok(splitAt(X1,X2)) u(ok(X1),ok(X2),ok(X3),ok(X4)) -> ok(u(X1,X2,X3,X4)) head(ok(X)) -> ok(head(X)) tail(ok(X)) -> ok(tail(X)) sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) afterNth(ok(X1),ok(X2)) -> ok(afterNth(X1,X2)) take(ok(X1),ok(X2)) -> ok(take(X1,X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Subterm Criterion Processor: simple projection: pi(pair#) = 0 problem: DPs: TRS: active(natsFrom(N)) -> mark(cons(N,natsFrom(s(N)))) active(fst(pair(XS,YS))) -> mark(XS) active(snd(pair(XS,YS))) -> mark(YS) active(splitAt(0(),XS)) -> mark(pair(nil(),XS)) active(splitAt(s(N),cons(X,XS))) -> mark(u(splitAt(N,XS),N,X,XS)) active(u(pair(YS,ZS),N,X,XS)) -> mark(pair(cons(X,YS),ZS)) active(head(cons(N,XS))) -> mark(N) active(tail(cons(N,XS))) -> mark(XS) active(sel(N,XS)) -> mark(head(afterNth(N,XS))) active(take(N,XS)) -> mark(fst(splitAt(N,XS))) active(afterNth(N,XS)) -> mark(snd(splitAt(N,XS))) active(natsFrom(X)) -> natsFrom(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(s(X)) -> s(active(X)) active(fst(X)) -> fst(active(X)) active(pair(X1,X2)) -> pair(active(X1),X2) active(pair(X1,X2)) -> pair(X1,active(X2)) active(snd(X)) -> snd(active(X)) active(splitAt(X1,X2)) -> splitAt(active(X1),X2) active(splitAt(X1,X2)) -> splitAt(X1,active(X2)) active(u(X1,X2,X3,X4)) -> u(active(X1),X2,X3,X4) active(head(X)) -> head(active(X)) active(tail(X)) -> tail(active(X)) active(sel(X1,X2)) -> sel(active(X1),X2) active(sel(X1,X2)) -> sel(X1,active(X2)) active(afterNth(X1,X2)) -> afterNth(active(X1),X2) active(afterNth(X1,X2)) -> afterNth(X1,active(X2)) active(take(X1,X2)) -> take(active(X1),X2) active(take(X1,X2)) -> take(X1,active(X2)) natsFrom(mark(X)) -> mark(natsFrom(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) s(mark(X)) -> mark(s(X)) fst(mark(X)) -> mark(fst(X)) pair(mark(X1),X2) -> mark(pair(X1,X2)) pair(X1,mark(X2)) -> mark(pair(X1,X2)) snd(mark(X)) -> mark(snd(X)) splitAt(mark(X1),X2) -> mark(splitAt(X1,X2)) splitAt(X1,mark(X2)) -> mark(splitAt(X1,X2)) u(mark(X1),X2,X3,X4) -> mark(u(X1,X2,X3,X4)) head(mark(X)) -> mark(head(X)) tail(mark(X)) -> mark(tail(X)) sel(mark(X1),X2) -> mark(sel(X1,X2)) sel(X1,mark(X2)) -> mark(sel(X1,X2)) afterNth(mark(X1),X2) -> mark(afterNth(X1,X2)) afterNth(X1,mark(X2)) -> mark(afterNth(X1,X2)) take(mark(X1),X2) -> mark(take(X1,X2)) take(X1,mark(X2)) -> mark(take(X1,X2)) proper(natsFrom(X)) -> natsFrom(proper(X)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 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(splitAt(X1,X2)) -> splitAt(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(nil()) -> ok(nil()) 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(sel(X1,X2)) -> sel(proper(X1),proper(X2)) proper(afterNth(X1,X2)) -> afterNth(proper(X1),proper(X2)) proper(take(X1,X2)) -> take(proper(X1),proper(X2)) natsFrom(ok(X)) -> ok(natsFrom(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) s(ok(X)) -> ok(s(X)) fst(ok(X)) -> ok(fst(X)) pair(ok(X1),ok(X2)) -> ok(pair(X1,X2)) snd(ok(X)) -> ok(snd(X)) splitAt(ok(X1),ok(X2)) -> ok(splitAt(X1,X2)) u(ok(X1),ok(X2),ok(X3),ok(X4)) -> ok(u(X1,X2,X3,X4)) head(ok(X)) -> ok(head(X)) tail(ok(X)) -> ok(tail(X)) sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) afterNth(ok(X1),ok(X2)) -> ok(afterNth(X1,X2)) take(ok(X1),ok(X2)) -> ok(take(X1,X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Qed DPs: fst#(mark(X)) -> fst#(X) fst#(ok(X)) -> fst#(X) TRS: active(natsFrom(N)) -> mark(cons(N,natsFrom(s(N)))) active(fst(pair(XS,YS))) -> mark(XS) active(snd(pair(XS,YS))) -> mark(YS) active(splitAt(0(),XS)) -> mark(pair(nil(),XS)) active(splitAt(s(N),cons(X,XS))) -> mark(u(splitAt(N,XS),N,X,XS)) active(u(pair(YS,ZS),N,X,XS)) -> mark(pair(cons(X,YS),ZS)) active(head(cons(N,XS))) -> mark(N) active(tail(cons(N,XS))) -> mark(XS) active(sel(N,XS)) -> mark(head(afterNth(N,XS))) active(take(N,XS)) -> mark(fst(splitAt(N,XS))) active(afterNth(N,XS)) -> mark(snd(splitAt(N,XS))) active(natsFrom(X)) -> natsFrom(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(s(X)) -> s(active(X)) active(fst(X)) -> fst(active(X)) active(pair(X1,X2)) -> pair(active(X1),X2) active(pair(X1,X2)) -> pair(X1,active(X2)) active(snd(X)) -> snd(active(X)) active(splitAt(X1,X2)) -> splitAt(active(X1),X2) active(splitAt(X1,X2)) -> splitAt(X1,active(X2)) active(u(X1,X2,X3,X4)) -> u(active(X1),X2,X3,X4) active(head(X)) -> head(active(X)) active(tail(X)) -> tail(active(X)) active(sel(X1,X2)) -> sel(active(X1),X2) active(sel(X1,X2)) -> sel(X1,active(X2)) active(afterNth(X1,X2)) -> afterNth(active(X1),X2) active(afterNth(X1,X2)) -> afterNth(X1,active(X2)) active(take(X1,X2)) -> take(active(X1),X2) active(take(X1,X2)) -> take(X1,active(X2)) natsFrom(mark(X)) -> mark(natsFrom(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) s(mark(X)) -> mark(s(X)) fst(mark(X)) -> mark(fst(X)) pair(mark(X1),X2) -> mark(pair(X1,X2)) pair(X1,mark(X2)) -> mark(pair(X1,X2)) snd(mark(X)) -> mark(snd(X)) splitAt(mark(X1),X2) -> mark(splitAt(X1,X2)) splitAt(X1,mark(X2)) -> mark(splitAt(X1,X2)) u(mark(X1),X2,X3,X4) -> mark(u(X1,X2,X3,X4)) head(mark(X)) -> mark(head(X)) tail(mark(X)) -> mark(tail(X)) sel(mark(X1),X2) -> mark(sel(X1,X2)) sel(X1,mark(X2)) -> mark(sel(X1,X2)) afterNth(mark(X1),X2) -> mark(afterNth(X1,X2)) afterNth(X1,mark(X2)) -> mark(afterNth(X1,X2)) take(mark(X1),X2) -> mark(take(X1,X2)) take(X1,mark(X2)) -> mark(take(X1,X2)) proper(natsFrom(X)) -> natsFrom(proper(X)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 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(splitAt(X1,X2)) -> splitAt(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(nil()) -> ok(nil()) 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(sel(X1,X2)) -> sel(proper(X1),proper(X2)) proper(afterNth(X1,X2)) -> afterNth(proper(X1),proper(X2)) proper(take(X1,X2)) -> take(proper(X1),proper(X2)) natsFrom(ok(X)) -> ok(natsFrom(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) s(ok(X)) -> ok(s(X)) fst(ok(X)) -> ok(fst(X)) pair(ok(X1),ok(X2)) -> ok(pair(X1,X2)) snd(ok(X)) -> ok(snd(X)) splitAt(ok(X1),ok(X2)) -> ok(splitAt(X1,X2)) u(ok(X1),ok(X2),ok(X3),ok(X4)) -> ok(u(X1,X2,X3,X4)) head(ok(X)) -> ok(head(X)) tail(ok(X)) -> ok(tail(X)) sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) afterNth(ok(X1),ok(X2)) -> ok(afterNth(X1,X2)) take(ok(X1),ok(X2)) -> ok(take(X1,X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Subterm Criterion Processor: simple projection: pi(fst#) = 0 problem: DPs: TRS: active(natsFrom(N)) -> mark(cons(N,natsFrom(s(N)))) active(fst(pair(XS,YS))) -> mark(XS) active(snd(pair(XS,YS))) -> mark(YS) active(splitAt(0(),XS)) -> mark(pair(nil(),XS)) active(splitAt(s(N),cons(X,XS))) -> mark(u(splitAt(N,XS),N,X,XS)) active(u(pair(YS,ZS),N,X,XS)) -> mark(pair(cons(X,YS),ZS)) active(head(cons(N,XS))) -> mark(N) active(tail(cons(N,XS))) -> mark(XS) active(sel(N,XS)) -> mark(head(afterNth(N,XS))) active(take(N,XS)) -> mark(fst(splitAt(N,XS))) active(afterNth(N,XS)) -> mark(snd(splitAt(N,XS))) active(natsFrom(X)) -> natsFrom(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(s(X)) -> s(active(X)) active(fst(X)) -> fst(active(X)) active(pair(X1,X2)) -> pair(active(X1),X2) active(pair(X1,X2)) -> pair(X1,active(X2)) active(snd(X)) -> snd(active(X)) active(splitAt(X1,X2)) -> splitAt(active(X1),X2) active(splitAt(X1,X2)) -> splitAt(X1,active(X2)) active(u(X1,X2,X3,X4)) -> u(active(X1),X2,X3,X4) active(head(X)) -> head(active(X)) active(tail(X)) -> tail(active(X)) active(sel(X1,X2)) -> sel(active(X1),X2) active(sel(X1,X2)) -> sel(X1,active(X2)) active(afterNth(X1,X2)) -> afterNth(active(X1),X2) active(afterNth(X1,X2)) -> afterNth(X1,active(X2)) active(take(X1,X2)) -> take(active(X1),X2) active(take(X1,X2)) -> take(X1,active(X2)) natsFrom(mark(X)) -> mark(natsFrom(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) s(mark(X)) -> mark(s(X)) fst(mark(X)) -> mark(fst(X)) pair(mark(X1),X2) -> mark(pair(X1,X2)) pair(X1,mark(X2)) -> mark(pair(X1,X2)) snd(mark(X)) -> mark(snd(X)) splitAt(mark(X1),X2) -> mark(splitAt(X1,X2)) splitAt(X1,mark(X2)) -> mark(splitAt(X1,X2)) u(mark(X1),X2,X3,X4) -> mark(u(X1,X2,X3,X4)) head(mark(X)) -> mark(head(X)) tail(mark(X)) -> mark(tail(X)) sel(mark(X1),X2) -> mark(sel(X1,X2)) sel(X1,mark(X2)) -> mark(sel(X1,X2)) afterNth(mark(X1),X2) -> mark(afterNth(X1,X2)) afterNth(X1,mark(X2)) -> mark(afterNth(X1,X2)) take(mark(X1),X2) -> mark(take(X1,X2)) take(X1,mark(X2)) -> mark(take(X1,X2)) proper(natsFrom(X)) -> natsFrom(proper(X)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 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(splitAt(X1,X2)) -> splitAt(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(nil()) -> ok(nil()) 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(sel(X1,X2)) -> sel(proper(X1),proper(X2)) proper(afterNth(X1,X2)) -> afterNth(proper(X1),proper(X2)) proper(take(X1,X2)) -> take(proper(X1),proper(X2)) natsFrom(ok(X)) -> ok(natsFrom(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) s(ok(X)) -> ok(s(X)) fst(ok(X)) -> ok(fst(X)) pair(ok(X1),ok(X2)) -> ok(pair(X1,X2)) snd(ok(X)) -> ok(snd(X)) splitAt(ok(X1),ok(X2)) -> ok(splitAt(X1,X2)) u(ok(X1),ok(X2),ok(X3),ok(X4)) -> ok(u(X1,X2,X3,X4)) head(ok(X)) -> ok(head(X)) tail(ok(X)) -> ok(tail(X)) sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) afterNth(ok(X1),ok(X2)) -> ok(afterNth(X1,X2)) take(ok(X1),ok(X2)) -> ok(take(X1,X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Qed DPs: s#(mark(X)) -> s#(X) s#(ok(X)) -> s#(X) TRS: active(natsFrom(N)) -> mark(cons(N,natsFrom(s(N)))) active(fst(pair(XS,YS))) -> mark(XS) active(snd(pair(XS,YS))) -> mark(YS) active(splitAt(0(),XS)) -> mark(pair(nil(),XS)) active(splitAt(s(N),cons(X,XS))) -> mark(u(splitAt(N,XS),N,X,XS)) active(u(pair(YS,ZS),N,X,XS)) -> mark(pair(cons(X,YS),ZS)) active(head(cons(N,XS))) -> mark(N) active(tail(cons(N,XS))) -> mark(XS) active(sel(N,XS)) -> mark(head(afterNth(N,XS))) active(take(N,XS)) -> mark(fst(splitAt(N,XS))) active(afterNth(N,XS)) -> mark(snd(splitAt(N,XS))) active(natsFrom(X)) -> natsFrom(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(s(X)) -> s(active(X)) active(fst(X)) -> fst(active(X)) active(pair(X1,X2)) -> pair(active(X1),X2) active(pair(X1,X2)) -> pair(X1,active(X2)) active(snd(X)) -> snd(active(X)) active(splitAt(X1,X2)) -> splitAt(active(X1),X2) active(splitAt(X1,X2)) -> splitAt(X1,active(X2)) active(u(X1,X2,X3,X4)) -> u(active(X1),X2,X3,X4) active(head(X)) -> head(active(X)) active(tail(X)) -> tail(active(X)) active(sel(X1,X2)) -> sel(active(X1),X2) active(sel(X1,X2)) -> sel(X1,active(X2)) active(afterNth(X1,X2)) -> afterNth(active(X1),X2) active(afterNth(X1,X2)) -> afterNth(X1,active(X2)) active(take(X1,X2)) -> take(active(X1),X2) active(take(X1,X2)) -> take(X1,active(X2)) natsFrom(mark(X)) -> mark(natsFrom(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) s(mark(X)) -> mark(s(X)) fst(mark(X)) -> mark(fst(X)) pair(mark(X1),X2) -> mark(pair(X1,X2)) pair(X1,mark(X2)) -> mark(pair(X1,X2)) snd(mark(X)) -> mark(snd(X)) splitAt(mark(X1),X2) -> mark(splitAt(X1,X2)) splitAt(X1,mark(X2)) -> mark(splitAt(X1,X2)) u(mark(X1),X2,X3,X4) -> mark(u(X1,X2,X3,X4)) head(mark(X)) -> mark(head(X)) tail(mark(X)) -> mark(tail(X)) sel(mark(X1),X2) -> mark(sel(X1,X2)) sel(X1,mark(X2)) -> mark(sel(X1,X2)) afterNth(mark(X1),X2) -> mark(afterNth(X1,X2)) afterNth(X1,mark(X2)) -> mark(afterNth(X1,X2)) take(mark(X1),X2) -> mark(take(X1,X2)) take(X1,mark(X2)) -> mark(take(X1,X2)) proper(natsFrom(X)) -> natsFrom(proper(X)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 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(splitAt(X1,X2)) -> splitAt(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(nil()) -> ok(nil()) 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(sel(X1,X2)) -> sel(proper(X1),proper(X2)) proper(afterNth(X1,X2)) -> afterNth(proper(X1),proper(X2)) proper(take(X1,X2)) -> take(proper(X1),proper(X2)) natsFrom(ok(X)) -> ok(natsFrom(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) s(ok(X)) -> ok(s(X)) fst(ok(X)) -> ok(fst(X)) pair(ok(X1),ok(X2)) -> ok(pair(X1,X2)) snd(ok(X)) -> ok(snd(X)) splitAt(ok(X1),ok(X2)) -> ok(splitAt(X1,X2)) u(ok(X1),ok(X2),ok(X3),ok(X4)) -> ok(u(X1,X2,X3,X4)) head(ok(X)) -> ok(head(X)) tail(ok(X)) -> ok(tail(X)) sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) afterNth(ok(X1),ok(X2)) -> ok(afterNth(X1,X2)) take(ok(X1),ok(X2)) -> ok(take(X1,X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Subterm Criterion Processor: simple projection: pi(s#) = 0 problem: DPs: TRS: active(natsFrom(N)) -> mark(cons(N,natsFrom(s(N)))) active(fst(pair(XS,YS))) -> mark(XS) active(snd(pair(XS,YS))) -> mark(YS) active(splitAt(0(),XS)) -> mark(pair(nil(),XS)) active(splitAt(s(N),cons(X,XS))) -> mark(u(splitAt(N,XS),N,X,XS)) active(u(pair(YS,ZS),N,X,XS)) -> mark(pair(cons(X,YS),ZS)) active(head(cons(N,XS))) -> mark(N) active(tail(cons(N,XS))) -> mark(XS) active(sel(N,XS)) -> mark(head(afterNth(N,XS))) active(take(N,XS)) -> mark(fst(splitAt(N,XS))) active(afterNth(N,XS)) -> mark(snd(splitAt(N,XS))) active(natsFrom(X)) -> natsFrom(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(s(X)) -> s(active(X)) active(fst(X)) -> fst(active(X)) active(pair(X1,X2)) -> pair(active(X1),X2) active(pair(X1,X2)) -> pair(X1,active(X2)) active(snd(X)) -> snd(active(X)) active(splitAt(X1,X2)) -> splitAt(active(X1),X2) active(splitAt(X1,X2)) -> splitAt(X1,active(X2)) active(u(X1,X2,X3,X4)) -> u(active(X1),X2,X3,X4) active(head(X)) -> head(active(X)) active(tail(X)) -> tail(active(X)) active(sel(X1,X2)) -> sel(active(X1),X2) active(sel(X1,X2)) -> sel(X1,active(X2)) active(afterNth(X1,X2)) -> afterNth(active(X1),X2) active(afterNth(X1,X2)) -> afterNth(X1,active(X2)) active(take(X1,X2)) -> take(active(X1),X2) active(take(X1,X2)) -> take(X1,active(X2)) natsFrom(mark(X)) -> mark(natsFrom(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) s(mark(X)) -> mark(s(X)) fst(mark(X)) -> mark(fst(X)) pair(mark(X1),X2) -> mark(pair(X1,X2)) pair(X1,mark(X2)) -> mark(pair(X1,X2)) snd(mark(X)) -> mark(snd(X)) splitAt(mark(X1),X2) -> mark(splitAt(X1,X2)) splitAt(X1,mark(X2)) -> mark(splitAt(X1,X2)) u(mark(X1),X2,X3,X4) -> mark(u(X1,X2,X3,X4)) head(mark(X)) -> mark(head(X)) tail(mark(X)) -> mark(tail(X)) sel(mark(X1),X2) -> mark(sel(X1,X2)) sel(X1,mark(X2)) -> mark(sel(X1,X2)) afterNth(mark(X1),X2) -> mark(afterNth(X1,X2)) afterNth(X1,mark(X2)) -> mark(afterNth(X1,X2)) take(mark(X1),X2) -> mark(take(X1,X2)) take(X1,mark(X2)) -> mark(take(X1,X2)) proper(natsFrom(X)) -> natsFrom(proper(X)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 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(splitAt(X1,X2)) -> splitAt(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(nil()) -> ok(nil()) 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(sel(X1,X2)) -> sel(proper(X1),proper(X2)) proper(afterNth(X1,X2)) -> afterNth(proper(X1),proper(X2)) proper(take(X1,X2)) -> take(proper(X1),proper(X2)) natsFrom(ok(X)) -> ok(natsFrom(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) s(ok(X)) -> ok(s(X)) fst(ok(X)) -> ok(fst(X)) pair(ok(X1),ok(X2)) -> ok(pair(X1,X2)) snd(ok(X)) -> ok(snd(X)) splitAt(ok(X1),ok(X2)) -> ok(splitAt(X1,X2)) u(ok(X1),ok(X2),ok(X3),ok(X4)) -> ok(u(X1,X2,X3,X4)) head(ok(X)) -> ok(head(X)) tail(ok(X)) -> ok(tail(X)) sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) afterNth(ok(X1),ok(X2)) -> ok(afterNth(X1,X2)) take(ok(X1),ok(X2)) -> ok(take(X1,X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Qed DPs: cons#(mark(X1),X2) -> cons#(X1,X2) cons#(ok(X1),ok(X2)) -> cons#(X1,X2) TRS: active(natsFrom(N)) -> mark(cons(N,natsFrom(s(N)))) active(fst(pair(XS,YS))) -> mark(XS) active(snd(pair(XS,YS))) -> mark(YS) active(splitAt(0(),XS)) -> mark(pair(nil(),XS)) active(splitAt(s(N),cons(X,XS))) -> mark(u(splitAt(N,XS),N,X,XS)) active(u(pair(YS,ZS),N,X,XS)) -> mark(pair(cons(X,YS),ZS)) active(head(cons(N,XS))) -> mark(N) active(tail(cons(N,XS))) -> mark(XS) active(sel(N,XS)) -> mark(head(afterNth(N,XS))) active(take(N,XS)) -> mark(fst(splitAt(N,XS))) active(afterNth(N,XS)) -> mark(snd(splitAt(N,XS))) active(natsFrom(X)) -> natsFrom(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(s(X)) -> s(active(X)) active(fst(X)) -> fst(active(X)) active(pair(X1,X2)) -> pair(active(X1),X2) active(pair(X1,X2)) -> pair(X1,active(X2)) active(snd(X)) -> snd(active(X)) active(splitAt(X1,X2)) -> splitAt(active(X1),X2) active(splitAt(X1,X2)) -> splitAt(X1,active(X2)) active(u(X1,X2,X3,X4)) -> u(active(X1),X2,X3,X4) active(head(X)) -> head(active(X)) active(tail(X)) -> tail(active(X)) active(sel(X1,X2)) -> sel(active(X1),X2) active(sel(X1,X2)) -> sel(X1,active(X2)) active(afterNth(X1,X2)) -> afterNth(active(X1),X2) active(afterNth(X1,X2)) -> afterNth(X1,active(X2)) active(take(X1,X2)) -> take(active(X1),X2) active(take(X1,X2)) -> take(X1,active(X2)) natsFrom(mark(X)) -> mark(natsFrom(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) s(mark(X)) -> mark(s(X)) fst(mark(X)) -> mark(fst(X)) pair(mark(X1),X2) -> mark(pair(X1,X2)) pair(X1,mark(X2)) -> mark(pair(X1,X2)) snd(mark(X)) -> mark(snd(X)) splitAt(mark(X1),X2) -> mark(splitAt(X1,X2)) splitAt(X1,mark(X2)) -> mark(splitAt(X1,X2)) u(mark(X1),X2,X3,X4) -> mark(u(X1,X2,X3,X4)) head(mark(X)) -> mark(head(X)) tail(mark(X)) -> mark(tail(X)) sel(mark(X1),X2) -> mark(sel(X1,X2)) sel(X1,mark(X2)) -> mark(sel(X1,X2)) afterNth(mark(X1),X2) -> mark(afterNth(X1,X2)) afterNth(X1,mark(X2)) -> mark(afterNth(X1,X2)) take(mark(X1),X2) -> mark(take(X1,X2)) take(X1,mark(X2)) -> mark(take(X1,X2)) proper(natsFrom(X)) -> natsFrom(proper(X)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 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(splitAt(X1,X2)) -> splitAt(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(nil()) -> ok(nil()) 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(sel(X1,X2)) -> sel(proper(X1),proper(X2)) proper(afterNth(X1,X2)) -> afterNth(proper(X1),proper(X2)) proper(take(X1,X2)) -> take(proper(X1),proper(X2)) natsFrom(ok(X)) -> ok(natsFrom(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) s(ok(X)) -> ok(s(X)) fst(ok(X)) -> ok(fst(X)) pair(ok(X1),ok(X2)) -> ok(pair(X1,X2)) snd(ok(X)) -> ok(snd(X)) splitAt(ok(X1),ok(X2)) -> ok(splitAt(X1,X2)) u(ok(X1),ok(X2),ok(X3),ok(X4)) -> ok(u(X1,X2,X3,X4)) head(ok(X)) -> ok(head(X)) tail(ok(X)) -> ok(tail(X)) sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) afterNth(ok(X1),ok(X2)) -> ok(afterNth(X1,X2)) take(ok(X1),ok(X2)) -> ok(take(X1,X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Subterm Criterion Processor: simple projection: pi(cons#) = 1 problem: DPs: cons#(mark(X1),X2) -> cons#(X1,X2) TRS: active(natsFrom(N)) -> mark(cons(N,natsFrom(s(N)))) active(fst(pair(XS,YS))) -> mark(XS) active(snd(pair(XS,YS))) -> mark(YS) active(splitAt(0(),XS)) -> mark(pair(nil(),XS)) active(splitAt(s(N),cons(X,XS))) -> mark(u(splitAt(N,XS),N,X,XS)) active(u(pair(YS,ZS),N,X,XS)) -> mark(pair(cons(X,YS),ZS)) active(head(cons(N,XS))) -> mark(N) active(tail(cons(N,XS))) -> mark(XS) active(sel(N,XS)) -> mark(head(afterNth(N,XS))) active(take(N,XS)) -> mark(fst(splitAt(N,XS))) active(afterNth(N,XS)) -> mark(snd(splitAt(N,XS))) active(natsFrom(X)) -> natsFrom(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(s(X)) -> s(active(X)) active(fst(X)) -> fst(active(X)) active(pair(X1,X2)) -> pair(active(X1),X2) active(pair(X1,X2)) -> pair(X1,active(X2)) active(snd(X)) -> snd(active(X)) active(splitAt(X1,X2)) -> splitAt(active(X1),X2) active(splitAt(X1,X2)) -> splitAt(X1,active(X2)) active(u(X1,X2,X3,X4)) -> u(active(X1),X2,X3,X4) active(head(X)) -> head(active(X)) active(tail(X)) -> tail(active(X)) active(sel(X1,X2)) -> sel(active(X1),X2) active(sel(X1,X2)) -> sel(X1,active(X2)) active(afterNth(X1,X2)) -> afterNth(active(X1),X2) active(afterNth(X1,X2)) -> afterNth(X1,active(X2)) active(take(X1,X2)) -> take(active(X1),X2) active(take(X1,X2)) -> take(X1,active(X2)) natsFrom(mark(X)) -> mark(natsFrom(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) s(mark(X)) -> mark(s(X)) fst(mark(X)) -> mark(fst(X)) pair(mark(X1),X2) -> mark(pair(X1,X2)) pair(X1,mark(X2)) -> mark(pair(X1,X2)) snd(mark(X)) -> mark(snd(X)) splitAt(mark(X1),X2) -> mark(splitAt(X1,X2)) splitAt(X1,mark(X2)) -> mark(splitAt(X1,X2)) u(mark(X1),X2,X3,X4) -> mark(u(X1,X2,X3,X4)) head(mark(X)) -> mark(head(X)) tail(mark(X)) -> mark(tail(X)) sel(mark(X1),X2) -> mark(sel(X1,X2)) sel(X1,mark(X2)) -> mark(sel(X1,X2)) afterNth(mark(X1),X2) -> mark(afterNth(X1,X2)) afterNth(X1,mark(X2)) -> mark(afterNth(X1,X2)) take(mark(X1),X2) -> mark(take(X1,X2)) take(X1,mark(X2)) -> mark(take(X1,X2)) proper(natsFrom(X)) -> natsFrom(proper(X)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 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(splitAt(X1,X2)) -> splitAt(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(nil()) -> ok(nil()) 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(sel(X1,X2)) -> sel(proper(X1),proper(X2)) proper(afterNth(X1,X2)) -> afterNth(proper(X1),proper(X2)) proper(take(X1,X2)) -> take(proper(X1),proper(X2)) natsFrom(ok(X)) -> ok(natsFrom(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) s(ok(X)) -> ok(s(X)) fst(ok(X)) -> ok(fst(X)) pair(ok(X1),ok(X2)) -> ok(pair(X1,X2)) snd(ok(X)) -> ok(snd(X)) splitAt(ok(X1),ok(X2)) -> ok(splitAt(X1,X2)) u(ok(X1),ok(X2),ok(X3),ok(X4)) -> ok(u(X1,X2,X3,X4)) head(ok(X)) -> ok(head(X)) tail(ok(X)) -> ok(tail(X)) sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) afterNth(ok(X1),ok(X2)) -> ok(afterNth(X1,X2)) take(ok(X1),ok(X2)) -> ok(take(X1,X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Subterm Criterion Processor: simple projection: pi(cons#) = 0 problem: DPs: TRS: active(natsFrom(N)) -> mark(cons(N,natsFrom(s(N)))) active(fst(pair(XS,YS))) -> mark(XS) active(snd(pair(XS,YS))) -> mark(YS) active(splitAt(0(),XS)) -> mark(pair(nil(),XS)) active(splitAt(s(N),cons(X,XS))) -> mark(u(splitAt(N,XS),N,X,XS)) active(u(pair(YS,ZS),N,X,XS)) -> mark(pair(cons(X,YS),ZS)) active(head(cons(N,XS))) -> mark(N) active(tail(cons(N,XS))) -> mark(XS) active(sel(N,XS)) -> mark(head(afterNth(N,XS))) active(take(N,XS)) -> mark(fst(splitAt(N,XS))) active(afterNth(N,XS)) -> mark(snd(splitAt(N,XS))) active(natsFrom(X)) -> natsFrom(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(s(X)) -> s(active(X)) active(fst(X)) -> fst(active(X)) active(pair(X1,X2)) -> pair(active(X1),X2) active(pair(X1,X2)) -> pair(X1,active(X2)) active(snd(X)) -> snd(active(X)) active(splitAt(X1,X2)) -> splitAt(active(X1),X2) active(splitAt(X1,X2)) -> splitAt(X1,active(X2)) active(u(X1,X2,X3,X4)) -> u(active(X1),X2,X3,X4) active(head(X)) -> head(active(X)) active(tail(X)) -> tail(active(X)) active(sel(X1,X2)) -> sel(active(X1),X2) active(sel(X1,X2)) -> sel(X1,active(X2)) active(afterNth(X1,X2)) -> afterNth(active(X1),X2) active(afterNth(X1,X2)) -> afterNth(X1,active(X2)) active(take(X1,X2)) -> take(active(X1),X2) active(take(X1,X2)) -> take(X1,active(X2)) natsFrom(mark(X)) -> mark(natsFrom(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) s(mark(X)) -> mark(s(X)) fst(mark(X)) -> mark(fst(X)) pair(mark(X1),X2) -> mark(pair(X1,X2)) pair(X1,mark(X2)) -> mark(pair(X1,X2)) snd(mark(X)) -> mark(snd(X)) splitAt(mark(X1),X2) -> mark(splitAt(X1,X2)) splitAt(X1,mark(X2)) -> mark(splitAt(X1,X2)) u(mark(X1),X2,X3,X4) -> mark(u(X1,X2,X3,X4)) head(mark(X)) -> mark(head(X)) tail(mark(X)) -> mark(tail(X)) sel(mark(X1),X2) -> mark(sel(X1,X2)) sel(X1,mark(X2)) -> mark(sel(X1,X2)) afterNth(mark(X1),X2) -> mark(afterNth(X1,X2)) afterNth(X1,mark(X2)) -> mark(afterNth(X1,X2)) take(mark(X1),X2) -> mark(take(X1,X2)) take(X1,mark(X2)) -> mark(take(X1,X2)) proper(natsFrom(X)) -> natsFrom(proper(X)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 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(splitAt(X1,X2)) -> splitAt(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(nil()) -> ok(nil()) 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(sel(X1,X2)) -> sel(proper(X1),proper(X2)) proper(afterNth(X1,X2)) -> afterNth(proper(X1),proper(X2)) proper(take(X1,X2)) -> take(proper(X1),proper(X2)) natsFrom(ok(X)) -> ok(natsFrom(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) s(ok(X)) -> ok(s(X)) fst(ok(X)) -> ok(fst(X)) pair(ok(X1),ok(X2)) -> ok(pair(X1,X2)) snd(ok(X)) -> ok(snd(X)) splitAt(ok(X1),ok(X2)) -> ok(splitAt(X1,X2)) u(ok(X1),ok(X2),ok(X3),ok(X4)) -> ok(u(X1,X2,X3,X4)) head(ok(X)) -> ok(head(X)) tail(ok(X)) -> ok(tail(X)) sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) afterNth(ok(X1),ok(X2)) -> ok(afterNth(X1,X2)) take(ok(X1),ok(X2)) -> ok(take(X1,X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Qed DPs: natsFrom#(mark(X)) -> natsFrom#(X) natsFrom#(ok(X)) -> natsFrom#(X) TRS: active(natsFrom(N)) -> mark(cons(N,natsFrom(s(N)))) active(fst(pair(XS,YS))) -> mark(XS) active(snd(pair(XS,YS))) -> mark(YS) active(splitAt(0(),XS)) -> mark(pair(nil(),XS)) active(splitAt(s(N),cons(X,XS))) -> mark(u(splitAt(N,XS),N,X,XS)) active(u(pair(YS,ZS),N,X,XS)) -> mark(pair(cons(X,YS),ZS)) active(head(cons(N,XS))) -> mark(N) active(tail(cons(N,XS))) -> mark(XS) active(sel(N,XS)) -> mark(head(afterNth(N,XS))) active(take(N,XS)) -> mark(fst(splitAt(N,XS))) active(afterNth(N,XS)) -> mark(snd(splitAt(N,XS))) active(natsFrom(X)) -> natsFrom(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(s(X)) -> s(active(X)) active(fst(X)) -> fst(active(X)) active(pair(X1,X2)) -> pair(active(X1),X2) active(pair(X1,X2)) -> pair(X1,active(X2)) active(snd(X)) -> snd(active(X)) active(splitAt(X1,X2)) -> splitAt(active(X1),X2) active(splitAt(X1,X2)) -> splitAt(X1,active(X2)) active(u(X1,X2,X3,X4)) -> u(active(X1),X2,X3,X4) active(head(X)) -> head(active(X)) active(tail(X)) -> tail(active(X)) active(sel(X1,X2)) -> sel(active(X1),X2) active(sel(X1,X2)) -> sel(X1,active(X2)) active(afterNth(X1,X2)) -> afterNth(active(X1),X2) active(afterNth(X1,X2)) -> afterNth(X1,active(X2)) active(take(X1,X2)) -> take(active(X1),X2) active(take(X1,X2)) -> take(X1,active(X2)) natsFrom(mark(X)) -> mark(natsFrom(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) s(mark(X)) -> mark(s(X)) fst(mark(X)) -> mark(fst(X)) pair(mark(X1),X2) -> mark(pair(X1,X2)) pair(X1,mark(X2)) -> mark(pair(X1,X2)) snd(mark(X)) -> mark(snd(X)) splitAt(mark(X1),X2) -> mark(splitAt(X1,X2)) splitAt(X1,mark(X2)) -> mark(splitAt(X1,X2)) u(mark(X1),X2,X3,X4) -> mark(u(X1,X2,X3,X4)) head(mark(X)) -> mark(head(X)) tail(mark(X)) -> mark(tail(X)) sel(mark(X1),X2) -> mark(sel(X1,X2)) sel(X1,mark(X2)) -> mark(sel(X1,X2)) afterNth(mark(X1),X2) -> mark(afterNth(X1,X2)) afterNth(X1,mark(X2)) -> mark(afterNth(X1,X2)) take(mark(X1),X2) -> mark(take(X1,X2)) take(X1,mark(X2)) -> mark(take(X1,X2)) proper(natsFrom(X)) -> natsFrom(proper(X)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 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(splitAt(X1,X2)) -> splitAt(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(nil()) -> ok(nil()) 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(sel(X1,X2)) -> sel(proper(X1),proper(X2)) proper(afterNth(X1,X2)) -> afterNth(proper(X1),proper(X2)) proper(take(X1,X2)) -> take(proper(X1),proper(X2)) natsFrom(ok(X)) -> ok(natsFrom(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) s(ok(X)) -> ok(s(X)) fst(ok(X)) -> ok(fst(X)) pair(ok(X1),ok(X2)) -> ok(pair(X1,X2)) snd(ok(X)) -> ok(snd(X)) splitAt(ok(X1),ok(X2)) -> ok(splitAt(X1,X2)) u(ok(X1),ok(X2),ok(X3),ok(X4)) -> ok(u(X1,X2,X3,X4)) head(ok(X)) -> ok(head(X)) tail(ok(X)) -> ok(tail(X)) sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) afterNth(ok(X1),ok(X2)) -> ok(afterNth(X1,X2)) take(ok(X1),ok(X2)) -> ok(take(X1,X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Subterm Criterion Processor: simple projection: pi(natsFrom#) = 0 problem: DPs: TRS: active(natsFrom(N)) -> mark(cons(N,natsFrom(s(N)))) active(fst(pair(XS,YS))) -> mark(XS) active(snd(pair(XS,YS))) -> mark(YS) active(splitAt(0(),XS)) -> mark(pair(nil(),XS)) active(splitAt(s(N),cons(X,XS))) -> mark(u(splitAt(N,XS),N,X,XS)) active(u(pair(YS,ZS),N,X,XS)) -> mark(pair(cons(X,YS),ZS)) active(head(cons(N,XS))) -> mark(N) active(tail(cons(N,XS))) -> mark(XS) active(sel(N,XS)) -> mark(head(afterNth(N,XS))) active(take(N,XS)) -> mark(fst(splitAt(N,XS))) active(afterNth(N,XS)) -> mark(snd(splitAt(N,XS))) active(natsFrom(X)) -> natsFrom(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(s(X)) -> s(active(X)) active(fst(X)) -> fst(active(X)) active(pair(X1,X2)) -> pair(active(X1),X2) active(pair(X1,X2)) -> pair(X1,active(X2)) active(snd(X)) -> snd(active(X)) active(splitAt(X1,X2)) -> splitAt(active(X1),X2) active(splitAt(X1,X2)) -> splitAt(X1,active(X2)) active(u(X1,X2,X3,X4)) -> u(active(X1),X2,X3,X4) active(head(X)) -> head(active(X)) active(tail(X)) -> tail(active(X)) active(sel(X1,X2)) -> sel(active(X1),X2) active(sel(X1,X2)) -> sel(X1,active(X2)) active(afterNth(X1,X2)) -> afterNth(active(X1),X2) active(afterNth(X1,X2)) -> afterNth(X1,active(X2)) active(take(X1,X2)) -> take(active(X1),X2) active(take(X1,X2)) -> take(X1,active(X2)) natsFrom(mark(X)) -> mark(natsFrom(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) s(mark(X)) -> mark(s(X)) fst(mark(X)) -> mark(fst(X)) pair(mark(X1),X2) -> mark(pair(X1,X2)) pair(X1,mark(X2)) -> mark(pair(X1,X2)) snd(mark(X)) -> mark(snd(X)) splitAt(mark(X1),X2) -> mark(splitAt(X1,X2)) splitAt(X1,mark(X2)) -> mark(splitAt(X1,X2)) u(mark(X1),X2,X3,X4) -> mark(u(X1,X2,X3,X4)) head(mark(X)) -> mark(head(X)) tail(mark(X)) -> mark(tail(X)) sel(mark(X1),X2) -> mark(sel(X1,X2)) sel(X1,mark(X2)) -> mark(sel(X1,X2)) afterNth(mark(X1),X2) -> mark(afterNth(X1,X2)) afterNth(X1,mark(X2)) -> mark(afterNth(X1,X2)) take(mark(X1),X2) -> mark(take(X1,X2)) take(X1,mark(X2)) -> mark(take(X1,X2)) proper(natsFrom(X)) -> natsFrom(proper(X)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 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(splitAt(X1,X2)) -> splitAt(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(nil()) -> ok(nil()) 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(sel(X1,X2)) -> sel(proper(X1),proper(X2)) proper(afterNth(X1,X2)) -> afterNth(proper(X1),proper(X2)) proper(take(X1,X2)) -> take(proper(X1),proper(X2)) natsFrom(ok(X)) -> ok(natsFrom(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) s(ok(X)) -> ok(s(X)) fst(ok(X)) -> ok(fst(X)) pair(ok(X1),ok(X2)) -> ok(pair(X1,X2)) snd(ok(X)) -> ok(snd(X)) splitAt(ok(X1),ok(X2)) -> ok(splitAt(X1,X2)) u(ok(X1),ok(X2),ok(X3),ok(X4)) -> ok(u(X1,X2,X3,X4)) head(ok(X)) -> ok(head(X)) tail(ok(X)) -> ok(tail(X)) sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) afterNth(ok(X1),ok(X2)) -> ok(afterNth(X1,X2)) take(ok(X1),ok(X2)) -> ok(take(X1,X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Qed