0.00/0.02	YES
0.00/0.02	
0.00/0.02	Problem 1: 
0.00/0.02	
0.00/0.02	(VAR v_NonEmpty:S)
0.00/0.02	(RULES
0.00/0.02	f(0) -> cons(0)
0.00/0.02	f(s(0)) -> f(p(s(0)))
0.00/0.02	p(s(0)) -> 0
0.00/0.02	) 
0.00/0.02	(STRATEGY INNERMOST)
0.00/0.02	
0.00/0.02	Problem 1: 
0.00/0.02	
0.00/0.02	Dependency Pairs Processor:
0.00/0.02	-> Pairs:
0.00/0.02	 F(s(0)) -> F(p(s(0)))
0.00/0.02	 F(s(0)) -> P(s(0))
0.00/0.02	-> Rules:
0.00/0.02	 f(0) -> cons(0)
0.00/0.02	 f(s(0)) -> f(p(s(0)))
0.00/0.02	 p(s(0)) -> 0
0.00/0.02	
0.00/0.02	Problem 1: 
0.00/0.02	
0.00/0.02	SCC Processor:
0.00/0.02	-> Pairs:
0.00/0.02	 F(s(0)) -> F(p(s(0)))
0.00/0.02	 F(s(0)) -> P(s(0))
0.00/0.02	-> Rules:
0.00/0.02	 f(0) -> cons(0)
0.00/0.02	 f(s(0)) -> f(p(s(0)))
0.00/0.02	 p(s(0)) -> 0
0.00/0.02	->Strongly Connected Components:
0.00/0.02	->->Cycle:
0.00/0.02	->->-> Pairs:
0.00/0.02	 F(s(0)) -> F(p(s(0)))
0.00/0.02	->->-> Rules:
0.00/0.02	 f(0) -> cons(0)
0.00/0.02	 f(s(0)) -> f(p(s(0)))
0.00/0.02	 p(s(0)) -> 0
0.00/0.02	
0.00/0.02	Problem 1: 
0.00/0.02	
0.00/0.02	Reduction Pairs Processor:
0.00/0.02	-> Pairs:
0.00/0.02	 F(s(0)) -> F(p(s(0)))
0.00/0.02	-> Rules:
0.00/0.02	 f(0) -> cons(0)
0.00/0.02	 f(s(0)) -> f(p(s(0)))
0.00/0.02	 p(s(0)) -> 0
0.00/0.02	-> Usable rules:
0.00/0.02	 p(s(0)) -> 0
0.00/0.02	->Interpretation type:
0.00/0.02	 Linear
0.00/0.02	->Coefficients:
0.00/0.02	 Natural Numbers
0.00/0.02	->Dimension:
0.00/0.02	 1
0.00/0.02	->Bound:
0.00/0.02	 2
0.00/0.02	->Interpretation:
0.00/0.02	 
0.00/0.02	[f](X) = 0
0.00/0.02	[p](X) = 2
0.00/0.02	[0] = 2
0.00/0.02	[cons](X) = 0
0.00/0.02	[fSNonEmpty] = 0
0.00/0.02	[s](X) = 2.X + 2
0.00/0.02	[F](X) = 2.X
0.00/0.02	[P](X) = 0
0.00/0.02	
0.00/0.02	Problem 1: 
0.00/0.02	
0.00/0.02	SCC Processor:
0.00/0.02	-> Pairs:
0.00/0.02	 Empty
0.00/0.02	-> Rules:
0.00/0.02	 f(0) -> cons(0)
0.00/0.02	 f(s(0)) -> f(p(s(0)))
0.00/0.02	 p(s(0)) -> 0
0.00/0.02	->Strongly Connected Components:
0.00/0.02	 There is no strongly connected component
0.00/0.02	
0.00/0.02	The problem is finite.
0.00/0.04	EOF