0.00/0.01	YES
0.00/0.01	
0.00/0.01	Problem 1: 
0.00/0.01	
0.00/0.01	(VAR v_NonEmpty:S N:S X:S Y:S)
0.00/0.01	(RULES
0.00/0.01	add(0,X:S) -> X:S
0.00/0.01	add(s,Y:S) -> s
0.00/0.01	dbl(0) -> 0
0.00/0.01	dbl(s) -> s
0.00/0.01	first(0,X:S) -> nil
0.00/0.01	first(s,cons(Y:S)) -> cons(Y:S)
0.00/0.01	sqr(0) -> 0
0.00/0.01	sqr(s) -> s
0.00/0.01	terms(N:S) -> cons(recip(sqr(N:S)))
0.00/0.01	) 
0.00/0.01	(STRATEGY INNERMOST)
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	 TERMS(N:S) -> SQR(N:S)
0.00/0.01	-> Rules:
0.00/0.01	 add(0,X:S) -> X:S
0.00/0.01	 add(s,Y:S) -> s
0.00/0.01	 dbl(0) -> 0
0.00/0.01	 dbl(s) -> s
0.00/0.01	 first(0,X:S) -> nil
0.00/0.01	 first(s,cons(Y:S)) -> cons(Y:S)
0.00/0.01	 sqr(0) -> 0
0.00/0.01	 sqr(s) -> s
0.00/0.01	 terms(N:S) -> cons(recip(sqr(N:S)))
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	 TERMS(N:S) -> SQR(N:S)
0.00/0.01	-> Rules:
0.00/0.01	 add(0,X:S) -> X:S
0.00/0.01	 add(s,Y:S) -> s
0.00/0.01	 dbl(0) -> 0
0.00/0.01	 dbl(s) -> s
0.00/0.01	 first(0,X:S) -> nil
0.00/0.01	 first(s,cons(Y:S)) -> cons(Y:S)
0.00/0.01	 sqr(0) -> 0
0.00/0.01	 sqr(s) -> s
0.00/0.01	 terms(N:S) -> cons(recip(sqr(N:S)))
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