0.00/0.01	YES
0.00/0.01	
0.00/0.01	Problem 1: 
0.00/0.01	
0.00/0.01	(VAR N X XS Y YS)
0.00/0.01	(STRATEGY CONTEXTSENSITIVE
0.00/0.01	(incr 1)
0.00/0.01	(oddNs)
0.00/0.01	(pairNs)
0.00/0.01	(repItems 1)
0.00/0.01	(tail 1)
0.00/0.01	(take 1 2)
0.00/0.01	(zip 1 2)
0.00/0.01	(0)
0.00/0.01	(cons 1)
0.00/0.01	(nil)
0.00/0.01	(pair 1 2)
0.00/0.01	(s 1)
0.00/0.01	)
0.00/0.01	(RULES
0.00/0.01	incr(cons(X,XS)) -> cons(s(X),incr(XS))
0.00/0.01	oddNs -> incr(pairNs)
0.00/0.01	pairNs -> cons(0,incr(oddNs))
0.00/0.01	repItems(cons(X,XS)) -> cons(X,cons(X,repItems(XS)))
0.00/0.01	repItems(nil) -> nil
0.00/0.01	tail(cons(X,XS)) -> XS
0.00/0.01	take(0,XS) -> nil
0.00/0.01	take(s(N),cons(X,XS)) -> cons(X,take(N,XS))
0.00/0.01	zip(cons(X,XS),cons(Y,YS)) -> cons(pair(X,Y),zip(XS,YS))
0.00/0.01	zip(nil,XS) -> nil
0.00/0.01	zip(X,nil) -> nil
0.00/0.01	)
0.00/0.01	
0.00/0.01	Problem 1: 
0.00/0.01	
0.00/0.01	Dependency Pairs Processor:
0.00/0.01	-> Pairs:
0.00/0.01	 ODDNS -> INCR(pairNs)
0.00/0.01	 ODDNS -> PAIRNS
0.00/0.01	 TAIL(cons(X,XS)) -> XS
0.00/0.01	-> Rules:
0.00/0.01	 incr(cons(X,XS)) -> cons(s(X),incr(XS))
0.00/0.01	 oddNs -> incr(pairNs)
0.00/0.01	 pairNs -> cons(0,incr(oddNs))
0.00/0.01	 repItems(cons(X,XS)) -> cons(X,cons(X,repItems(XS)))
0.00/0.01	 repItems(nil) -> nil
0.00/0.01	 tail(cons(X,XS)) -> XS
0.00/0.01	 take(0,XS) -> nil
0.00/0.01	 take(s(N),cons(X,XS)) -> cons(X,take(N,XS))
0.00/0.01	 zip(cons(X,XS),cons(Y,YS)) -> cons(pair(X,Y),zip(XS,YS))
0.00/0.01	 zip(nil,XS) -> nil
0.00/0.01	 zip(X,nil) -> nil
0.00/0.01	-> Unhiding Rules:
0.00/0.01	 incr(oddNs) -> INCR(oddNs)
0.00/0.01	 incr(oddNs) -> ODDNS
0.00/0.01	 incr(XS) -> INCR(XS)
0.00/0.01	 incr(x5) -> x5
0.00/0.01	 take(N,XS) -> TAKE(N,XS)
0.00/0.01	 take(N,x5) -> x5
0.00/0.01	 zip(XS,YS) -> ZIP(XS,YS)
0.00/0.01	 zip(XS,x5) -> x5
0.00/0.01	 zip(x5,YS) -> x5
0.00/0.01	
0.00/0.01	Problem 1: 
0.00/0.01	
0.00/0.01	SCC Processor:
0.00/0.01	-> Pairs:
0.00/0.01	 ODDNS -> INCR(pairNs)
0.00/0.01	 ODDNS -> PAIRNS
0.00/0.01	 TAIL(cons(X,XS)) -> XS
0.00/0.01	-> Rules:
0.00/0.01	 incr(cons(X,XS)) -> cons(s(X),incr(XS))
0.00/0.01	 oddNs -> incr(pairNs)
0.00/0.01	 pairNs -> cons(0,incr(oddNs))
0.00/0.01	 repItems(cons(X,XS)) -> cons(X,cons(X,repItems(XS)))
0.00/0.01	 repItems(nil) -> nil
0.00/0.01	 tail(cons(X,XS)) -> XS
0.00/0.01	 take(0,XS) -> nil
0.00/0.01	 take(s(N),cons(X,XS)) -> cons(X,take(N,XS))
0.00/0.01	 zip(cons(X,XS),cons(Y,YS)) -> cons(pair(X,Y),zip(XS,YS))
0.00/0.01	 zip(nil,XS) -> nil
0.00/0.01	 zip(X,nil) -> nil
0.00/0.01	-> Unhiding rules:
0.00/0.01	 incr(oddNs) -> INCR(oddNs)
0.00/0.01	 incr(oddNs) -> ODDNS
0.00/0.01	 incr(XS) -> INCR(XS)
0.00/0.01	 incr(x5) -> x5
0.00/0.01	 take(N,XS) -> TAKE(N,XS)
0.00/0.01	 take(N,x5) -> x5
0.00/0.01	 zip(XS,YS) -> ZIP(XS,YS)
0.00/0.01	 zip(XS,x5) -> x5
0.00/0.01	 zip(x5,YS) -> x5
0.00/0.01	->Strongly Connected Components:
0.00/0.01	 There is no strongly connected component
0.00/0.01	
0.00/0.01	The problem is finite.
0.00/0.01	EOF