0.00/0.05	YES
0.00/0.05	
0.00/0.05	Problem 1: 
0.00/0.05	
0.00/0.05	(VAR X)
0.00/0.05	(STRATEGY CONTEXTSENSITIVE
0.00/0.05	(f 1)
0.00/0.05	(p 1)
0.00/0.05	(0)
0.00/0.05	(cons 1)
0.00/0.05	(s 1)
0.00/0.05	)
0.00/0.05	(RULES
0.00/0.05	f(0) -> cons(0,f(s(0)))
0.00/0.05	f(s(0)) -> f(p(s(0)))
0.00/0.05	p(s(X)) -> X
0.00/0.05	)
0.00/0.05	
0.00/0.05	Problem 1: 
0.00/0.05	
0.00/0.05	Innermost Equivalent Processor:
0.00/0.05	-> Rules:
0.00/0.05	 f(0) -> cons(0,f(s(0)))
0.00/0.05	 f(s(0)) -> f(p(s(0)))
0.00/0.05	 p(s(X)) -> X
0.00/0.05	-> The context-sensitive term rewriting system is an orthogonal system. Therefore, innermost cs-termination implies cs-termination.
0.00/0.05	 
0.00/0.05	
0.00/0.05	Problem 1: 
0.00/0.05	
0.00/0.05	Dependency Pairs Processor:
0.00/0.05	-> Pairs:
0.00/0.05	 F(s(0)) -> F(p(s(0)))
0.00/0.05	 F(s(0)) -> P(s(0))
0.00/0.05	-> Rules:
0.00/0.05	 f(0) -> cons(0,f(s(0)))
0.00/0.05	 f(s(0)) -> f(p(s(0)))
0.00/0.05	 p(s(X)) -> X
0.00/0.05	-> Unhiding Rules:
0.00/0.05	 Empty
0.00/0.05	
0.00/0.05	Problem 1: 
0.00/0.05	
0.00/0.05	SCC Processor:
0.00/0.05	-> Pairs:
0.00/0.05	 F(s(0)) -> F(p(s(0)))
0.00/0.05	 F(s(0)) -> P(s(0))
0.00/0.05	-> Rules:
0.00/0.05	 f(0) -> cons(0,f(s(0)))
0.00/0.05	 f(s(0)) -> f(p(s(0)))
0.00/0.05	 p(s(X)) -> X
0.00/0.05	-> Unhiding rules:
0.00/0.05	 Empty
0.00/0.05	->Strongly Connected Components:
0.00/0.05	->->Cycle:
0.00/0.05	->->-> Pairs:
0.00/0.05	 F(s(0)) -> F(p(s(0)))
0.00/0.05	->->-> Rules:
0.00/0.05	 f(0) -> cons(0,f(s(0)))
0.00/0.05	 f(s(0)) -> f(p(s(0)))
0.00/0.05	 p(s(X)) -> X
0.00/0.05	->->-> Unhiding rules:
0.00/0.05	 Empty
0.00/0.05	
0.00/0.05	Problem 1: 
0.00/0.05	
0.00/0.05	Reduction Pairs Processor:
0.00/0.05	-> Pairs:
0.00/0.05	 F(s(0)) -> F(p(s(0)))
0.00/0.05	-> Rules:
0.00/0.05	 f(0) -> cons(0,f(s(0)))
0.00/0.05	 f(s(0)) -> f(p(s(0)))
0.00/0.05	 p(s(X)) -> X
0.00/0.05	-> Unhiding rules:
0.00/0.05	 Empty
0.00/0.05	-> Usable rules:
0.00/0.05	 p(s(X)) -> X
0.00/0.05	->Interpretation type:
0.00/0.05	 Linear
0.00/0.05	->Coefficients:
0.00/0.05	 All rationals
0.00/0.05	->Dimension:
0.00/0.05	 1
0.00/0.05	->Bound:
0.00/0.05	 2
0.00/0.05	->Interpretation:
0.00/0.05	 
0.00/0.05	[p](X) = 1/2.X + 1/2
0.00/0.05	[0] = 0
0.00/0.05	[s](X) = 2.X + 2
0.00/0.05	[F](X) = 1/2.X
0.00/0.05	
0.00/0.05	Problem 1: 
0.00/0.05	
0.00/0.05	Basic Processor:
0.00/0.05	-> Pairs:
0.00/0.05	 Empty
0.00/0.05	-> Rules:
0.00/0.05	 f(0) -> cons(0,f(s(0)))
0.00/0.05	 f(s(0)) -> f(p(s(0)))
0.00/0.05	 p(s(X)) -> X
0.00/0.05	-> Unhiding rules:
0.00/0.05	 Empty
0.00/0.05	-> Result:
0.00/0.05	 Set P is empty
0.00/0.05	
0.00/0.05	The problem is finite.
0.00/0.05	EOF