NO
0.08/0.19	NO
0.08/0.19	
0.08/0.19	Problem:
0.08/0.19	 U71(tt()) -> s(length(L))
0.08/0.19	 U91(tt()) -> cons(N)
0.08/0.19	 and(tt()) -> X
0.08/0.19	 zeros() -> cons(0())
0.08/0.19	 U11(tt()) -> U12(isNatList())
0.08/0.19	 U12(tt()) -> tt()
0.08/0.19	 U21(tt()) -> U22(isNat())
0.08/0.19	 U22(tt()) -> tt()
0.08/0.19	 U31(tt()) -> U32(isNatList())
0.08/0.19	 U32(tt()) -> tt()
0.08/0.19	 U41(tt()) -> U42(isNat())
0.08/0.19	 U42(tt()) -> U43(isNatIList())
0.08/0.19	 U43(tt()) -> tt()
0.08/0.19	 U51(tt()) -> U52(isNat())
0.08/0.19	 U52(tt()) -> U53(isNatList())
0.08/0.19	 U53(tt()) -> tt()
0.08/0.19	 U61(tt()) -> U62(isNat())
0.08/0.19	 U62(tt()) -> U63(isNatIList())
0.08/0.19	 U63(tt()) -> tt()
0.08/0.19	 U81(tt()) -> nil()
0.08/0.19	 isNat() -> tt()
0.08/0.19	 isNat() -> U11(isNatIListKind())
0.08/0.19	 isNat() -> U21(isNatKind())
0.08/0.19	 isNatIList() -> U31(isNatIListKind())
0.08/0.19	 isNatIList() -> tt()
0.08/0.19	 isNatIList() -> U41(and(isNatKind()))
0.08/0.19	 isNatIListKind() -> tt()
0.08/0.19	 isNatIListKind() -> and(isNatKind())
0.08/0.19	 isNatKind() -> tt()
0.08/0.19	 isNatKind() -> isNatIListKind()
0.08/0.19	 isNatKind() -> isNatKind()
0.08/0.19	 isNatList() -> tt()
0.08/0.19	 isNatList() -> U51(and(isNatKind()))
0.08/0.19	 isNatList() -> U61(and(isNatKind()))
0.08/0.19	 length(nil()) -> 0()
0.08/0.19	 length(cons(N)) -> U71(and(and(isNatList())))
0.08/0.19	 take(0(),IL) -> U81(and(isNatIList()))
0.08/0.19	 take(s(M),cons(N)) -> U91(and(and(isNatIList())))
0.08/0.19	
0.08/0.19	Proof:
0.08/0.19	 Fresh Variable Processor:
0.08/0.19	  loop length: 1
0.08/0.19	  terms:
0.08/0.19	   U71(tt())
0.08/0.19	  context: s(length([]))
0.08/0.19	  substitution:
0.08/0.19	   L -> U71(tt())
0.08/0.19	  Qed
0.17/0.20	EOF