MAYBE
0.00/0.03	 The problem does not contain well-formed TRSs:
0.00/0.03	   Strict Trs:
0.00/0.03	     { U101(tt()) -> fst(splitAt(N, XS))
0.00/0.03	     , fst(pair(X, Y)) -> U21(and(isLNat()))
0.00/0.03	     , splitAt(0(), XS) -> U71(isLNat())
0.00/0.03	     , splitAt(s(N), cons(X)) -> U81(and(isNatural()))
0.00/0.03	     , U11(tt()) -> snd(splitAt(N, XS))
0.00/0.03	     , snd(pair(X, Y)) -> U61(and(isLNat()))
0.00/0.03	     , U21(tt()) -> X
0.00/0.03	     , U31(tt()) -> N
0.00/0.03	     , U41(tt()) -> cons(N)
0.00/0.03	     , U51(tt()) -> head(afterNth(N, XS))
0.00/0.03	     , head(cons(N)) -> U31(and(isNatural()))
0.00/0.03	     , afterNth(N, XS) -> U11(and(isNatural()))
0.00/0.03	     , U61(tt()) -> Y
0.00/0.03	     , U71(tt()) -> pair(nil(), XS)
0.00/0.03	     , U81(tt()) -> U82(splitAt(N, XS))
0.00/0.03	     , U82(pair(YS, ZS)) -> pair(cons(X), ZS)
0.00/0.03	     , U91(tt()) -> XS
0.00/0.03	     , and(tt()) -> X
0.00/0.03	     , isNatural() -> tt()
0.00/0.03	     , isNatural() -> and(isNatural())
0.00/0.03	     , isNatural() -> isNatural()
0.00/0.03	     , isNatural() -> isLNat()
0.00/0.03	     , isLNat() -> tt()
0.00/0.03	     , isLNat() -> and(isNatural())
0.00/0.03	     , isLNat() -> isNatural()
0.00/0.03	     , isLNat() -> isLNat()
0.00/0.03	     , isLNat() -> isPLNat()
0.00/0.03	     , isPLNat() -> and(isNatural())
0.00/0.03	     , isPLNat() -> and(isLNat())
0.00/0.03	     , natsFrom(N) -> U41(isNatural())
0.00/0.03	     , sel(N, XS) -> U51(and(isNatural()))
0.00/0.03	     , tail(cons(N)) -> U91(and(isNatural()))
0.00/0.03	     , take(N, XS) -> U101(and(isNatural())) }
0.00/0.03	   StartTerms: basic terms
0.00/0.03	   Strategy: innermost
0.00/0.03	EOF