1.15/1.41	NO
1.15/1.41	
1.15/1.41	Problem 1: 
1.15/1.41	
1.15/1.41	(VAR IL L M N)
1.15/1.41	(STRATEGY CONTEXTSENSITIVE
1.15/1.41	(U11 1)
1.15/1.41	(U12 1)
1.15/1.41	(U21 1)
1.15/1.41	(U22 1)
1.15/1.41	(U23 1)
1.15/1.41	(length 1)
1.15/1.41	(take 1 2)
1.15/1.41	(zeros)
1.15/1.41	(0)
1.15/1.41	(cons 1)
1.15/1.41	(nil)
1.15/1.41	(s 1)
1.15/1.41	(tt)
1.15/1.41	)
1.15/1.41	(RULES
1.15/1.41	U11(tt,L) -> U12(tt,L)
1.15/1.41	U12(tt,L) -> s(length(L))
1.15/1.41	U21(tt,IL,M,N) -> U22(tt,IL,M,N)
1.15/1.41	U22(tt,IL,M,N) -> U23(tt,IL,M,N)
1.15/1.41	U23(tt,IL,M,N) -> cons(N,take(M,IL))
1.15/1.41	length(cons(N,L)) -> U11(tt,L)
1.15/1.41	length(nil) -> 0
1.15/1.41	take(0,IL) -> nil
1.15/1.41	take(s(M),cons(N,IL)) -> U21(tt,IL,M,N)
1.15/1.41	zeros -> cons(0,zeros)
1.15/1.41	)
1.15/1.41	
1.15/1.41	Problem 1: 
1.15/1.41	
1.15/1.41	Dependency Pairs Processor:
1.15/1.41	-> Pairs:
1.15/1.41	 U11#(tt,L) -> U12#(tt,L)
1.15/1.41	 U12#(tt,L) -> LENGTH(L)
1.15/1.41	 U12#(tt,L) -> L
1.15/1.41	 U21#(tt,IL,M,N) -> U22#(tt,IL,M,N)
1.15/1.41	 U22#(tt,IL,M,N) -> U23#(tt,IL,M,N)
1.15/1.41	 U23#(tt,IL,M,N) -> N
1.15/1.41	 LENGTH(cons(N,L)) -> U11#(tt,L)
1.15/1.41	 TAKE(s(M),cons(N,IL)) -> U21#(tt,IL,M,N)
1.15/1.41	-> Rules:
1.15/1.41	 U11(tt,L) -> U12(tt,L)
1.15/1.41	 U12(tt,L) -> s(length(L))
1.15/1.41	 U21(tt,IL,M,N) -> U22(tt,IL,M,N)
1.15/1.41	 U22(tt,IL,M,N) -> U23(tt,IL,M,N)
1.15/1.41	 U23(tt,IL,M,N) -> cons(N,take(M,IL))
1.15/1.41	 length(cons(N,L)) -> U11(tt,L)
1.15/1.41	 length(nil) -> 0
1.15/1.41	 take(0,IL) -> nil
1.15/1.41	 take(s(M),cons(N,IL)) -> U21(tt,IL,M,N)
1.15/1.41	 zeros -> cons(0,zeros)
1.15/1.41	-> Unhiding Rules:
1.15/1.41	 take(M,IL) -> TAKE(M,IL)
1.15/1.41	 take(M,x4) -> x4
1.15/1.41	 take(x4,IL) -> x4
1.15/1.41	 zeros -> ZEROS
1.15/1.41	
1.15/1.41	Problem 1: 
1.15/1.41	
1.15/1.41	SCC Processor:
1.15/1.41	-> Pairs:
1.15/1.41	 U11#(tt,L) -> U12#(tt,L)
1.15/1.41	 U12#(tt,L) -> LENGTH(L)
1.15/1.41	 U12#(tt,L) -> L
1.15/1.41	 U21#(tt,IL,M,N) -> U22#(tt,IL,M,N)
1.15/1.41	 U22#(tt,IL,M,N) -> U23#(tt,IL,M,N)
1.15/1.41	 U23#(tt,IL,M,N) -> N
1.15/1.41	 LENGTH(cons(N,L)) -> U11#(tt,L)
1.15/1.41	 TAKE(s(M),cons(N,IL)) -> U21#(tt,IL,M,N)
1.15/1.41	-> Rules:
1.15/1.41	 U11(tt,L) -> U12(tt,L)
1.15/1.41	 U12(tt,L) -> s(length(L))
1.15/1.41	 U21(tt,IL,M,N) -> U22(tt,IL,M,N)
1.15/1.41	 U22(tt,IL,M,N) -> U23(tt,IL,M,N)
1.15/1.41	 U23(tt,IL,M,N) -> cons(N,take(M,IL))
1.15/1.41	 length(cons(N,L)) -> U11(tt,L)
1.15/1.41	 length(nil) -> 0
1.15/1.41	 take(0,IL) -> nil
1.15/1.41	 take(s(M),cons(N,IL)) -> U21(tt,IL,M,N)
1.15/1.41	 zeros -> cons(0,zeros)
1.15/1.41	-> Unhiding rules:
1.15/1.41	 take(M,IL) -> TAKE(M,IL)
1.15/1.41	 take(M,x4) -> x4
1.15/1.41	 take(x4,IL) -> x4
1.15/1.41	 zeros -> ZEROS
1.15/1.41	->Strongly Connected Components:
1.15/1.41	->->Cycle:
1.15/1.41	->->-> Pairs:
1.15/1.41	 U21#(tt,IL,M,N) -> U22#(tt,IL,M,N)
1.15/1.41	 U22#(tt,IL,M,N) -> U23#(tt,IL,M,N)
1.15/1.41	 U23#(tt,IL,M,N) -> N
1.15/1.41	 TAKE(s(M),cons(N,IL)) -> U21#(tt,IL,M,N)
1.15/1.41	->->-> Rules:
1.15/1.41	 U11(tt,L) -> U12(tt,L)
1.15/1.41	 U12(tt,L) -> s(length(L))
1.15/1.41	 U21(tt,IL,M,N) -> U22(tt,IL,M,N)
1.15/1.41	 U22(tt,IL,M,N) -> U23(tt,IL,M,N)
1.15/1.41	 U23(tt,IL,M,N) -> cons(N,take(M,IL))
1.15/1.41	 length(cons(N,L)) -> U11(tt,L)
1.15/1.41	 length(nil) -> 0
1.15/1.41	 take(0,IL) -> nil
1.15/1.41	 take(s(M),cons(N,IL)) -> U21(tt,IL,M,N)
1.15/1.41	 zeros -> cons(0,zeros)
1.15/1.41	->->-> Unhiding rules:
1.15/1.41	 take(M,IL) -> TAKE(M,IL)
1.15/1.41	 take(M,x4) -> x4
1.15/1.41	 take(x4,IL) -> x4
1.15/1.41	->->Cycle:
1.15/1.41	->->-> Pairs:
1.15/1.41	 U11#(tt,L) -> U12#(tt,L)
1.15/1.41	 U12#(tt,L) -> LENGTH(L)
1.15/1.41	 LENGTH(cons(N,L)) -> U11#(tt,L)
1.15/1.41	->->-> Rules:
1.15/1.41	 U11(tt,L) -> U12(tt,L)
1.15/1.41	 U12(tt,L) -> s(length(L))
1.15/1.41	 U21(tt,IL,M,N) -> U22(tt,IL,M,N)
1.15/1.41	 U22(tt,IL,M,N) -> U23(tt,IL,M,N)
1.15/1.41	 U23(tt,IL,M,N) -> cons(N,take(M,IL))
1.15/1.41	 length(cons(N,L)) -> U11(tt,L)
1.15/1.41	 length(nil) -> 0
1.15/1.41	 take(0,IL) -> nil
1.15/1.41	 take(s(M),cons(N,IL)) -> U21(tt,IL,M,N)
1.15/1.41	 zeros -> cons(0,zeros)
1.15/1.41	->->-> Unhiding rules:
1.15/1.41	 Empty
1.15/1.41	
1.15/1.41	Problem 1: 
1.15/1.41	
1.15/1.41	Basic Processor:
1.15/1.41	-> Pairs:
1.15/1.41	 U11#(tt,L) -> U12#(tt,L)
1.15/1.41	 U12#(tt,L) -> LENGTH(L)
1.15/1.41	 LENGTH(cons(N,L)) -> U11#(tt,L)
1.15/1.41	-> Rules:
1.15/1.41	 U11(tt,L) -> U12(tt,L)
1.15/1.41	 U12(tt,L) -> s(length(L))
1.15/1.41	 U21(tt,IL,M,N) -> U22(tt,IL,M,N)
1.15/1.41	 U22(tt,IL,M,N) -> U23(tt,IL,M,N)
1.15/1.41	 U23(tt,IL,M,N) -> cons(N,take(M,IL))
1.15/1.41	 length(cons(N,L)) -> U11(tt,L)
1.15/1.41	 length(nil) -> 0
1.15/1.41	 take(0,IL) -> nil
1.15/1.41	 take(s(M),cons(N,IL)) -> U21(tt,IL,M,N)
1.15/1.41	 zeros -> cons(0,zeros)
1.15/1.41	-> Unhiding rules:
1.15/1.41	 Empty
1.15/1.41	-> Pairs in cycle:
1.15/1.41	 U11#(tt,zeros) -> U12#(tt,zeros)
1.15/1.41	 U12#(tt,zeros) -> LENGTH(zeros)
1.15/1.41	 LENGTH(zeros) -> LENGTH(cons(0,zeros))
1.15/1.41	 LENGTH(cons(0,zeros)) -> U11#(tt,zeros)
1.15/1.41	
1.15/1.41	The problem is infinite.
1.15/1.41	EOF