0.63/0.74	NO
0.63/0.74	
0.63/0.74	Problem 1: 
0.63/0.74	
0.63/0.74	(VAR L N)
0.63/0.74	(STRATEGY CONTEXTSENSITIVE
0.63/0.74	(U11 1)
0.63/0.74	(U12 1)
0.63/0.74	(length 1)
0.63/0.74	(zeros)
0.63/0.74	(0)
0.63/0.74	(cons 1)
0.63/0.74	(nil)
0.63/0.74	(s 1)
0.63/0.74	(tt)
0.63/0.74	)
0.63/0.74	(RULES
0.63/0.74	U11(tt,L) -> U12(tt,L)
0.63/0.74	U12(tt,L) -> s(length(L))
0.63/0.74	length(cons(N,L)) -> U11(tt,L)
0.63/0.74	length(nil) -> 0
0.63/0.74	zeros -> cons(0,zeros)
0.63/0.74	)
0.63/0.74	
0.63/0.74	Problem 1: 
0.63/0.74	
0.63/0.74	Dependency Pairs Processor:
0.63/0.74	-> Pairs:
0.63/0.74	 U11#(tt,L) -> U12#(tt,L)
0.63/0.74	 U12#(tt,L) -> LENGTH(L)
0.63/0.74	 U12#(tt,L) -> L
0.63/0.74	 LENGTH(cons(N,L)) -> U11#(tt,L)
0.63/0.74	-> Rules:
0.63/0.74	 U11(tt,L) -> U12(tt,L)
0.63/0.74	 U12(tt,L) -> s(length(L))
0.63/0.74	 length(cons(N,L)) -> U11(tt,L)
0.63/0.74	 length(nil) -> 0
0.63/0.74	 zeros -> cons(0,zeros)
0.63/0.74	-> Unhiding Rules:
0.63/0.74	 zeros -> ZEROS
0.63/0.74	
0.63/0.74	Problem 1: 
0.63/0.74	
0.63/0.74	SCC Processor:
0.63/0.74	-> Pairs:
0.63/0.74	 U11#(tt,L) -> U12#(tt,L)
0.63/0.74	 U12#(tt,L) -> LENGTH(L)
0.63/0.74	 U12#(tt,L) -> L
0.63/0.74	 LENGTH(cons(N,L)) -> U11#(tt,L)
0.63/0.74	-> Rules:
0.63/0.74	 U11(tt,L) -> U12(tt,L)
0.63/0.74	 U12(tt,L) -> s(length(L))
0.63/0.74	 length(cons(N,L)) -> U11(tt,L)
0.63/0.74	 length(nil) -> 0
0.63/0.74	 zeros -> cons(0,zeros)
0.63/0.74	-> Unhiding rules:
0.63/0.74	 zeros -> ZEROS
0.63/0.74	->Strongly Connected Components:
0.63/0.74	->->Cycle:
0.63/0.74	->->-> Pairs:
0.63/0.74	 U11#(tt,L) -> U12#(tt,L)
0.63/0.74	 U12#(tt,L) -> LENGTH(L)
0.63/0.74	 LENGTH(cons(N,L)) -> U11#(tt,L)
0.63/0.74	->->-> Rules:
0.63/0.74	 U11(tt,L) -> U12(tt,L)
0.63/0.74	 U12(tt,L) -> s(length(L))
0.63/0.74	 length(cons(N,L)) -> U11(tt,L)
0.63/0.74	 length(nil) -> 0
0.63/0.74	 zeros -> cons(0,zeros)
0.63/0.74	->->-> Unhiding rules:
0.63/0.74	 Empty
0.63/0.74	
0.63/0.74	Problem 1: 
0.63/0.74	
0.63/0.74	Basic Processor:
0.63/0.74	-> Pairs:
0.63/0.74	 U11#(tt,L) -> U12#(tt,L)
0.63/0.74	 U12#(tt,L) -> LENGTH(L)
0.63/0.74	 LENGTH(cons(N,L)) -> U11#(tt,L)
0.63/0.74	-> Rules:
0.63/0.74	 U11(tt,L) -> U12(tt,L)
0.63/0.74	 U12(tt,L) -> s(length(L))
0.63/0.74	 length(cons(N,L)) -> U11(tt,L)
0.63/0.74	 length(nil) -> 0
0.63/0.74	 zeros -> cons(0,zeros)
0.63/0.74	-> Unhiding rules:
0.63/0.74	 Empty
0.63/0.74	-> Pairs in cycle:
0.63/0.74	 U11#(tt,zeros) -> U12#(tt,zeros)
0.63/0.74	 U12#(tt,zeros) -> LENGTH(zeros)
0.63/0.74	 LENGTH(zeros) -> LENGTH(cons(0,zeros))
0.63/0.74	 LENGTH(cons(0,zeros)) -> U11#(tt,zeros)
0.63/0.74	
0.63/0.74	The problem is infinite.
0.63/0.74	EOF