0.00/0.04	YES
0.00/0.04	
0.00/0.04	Problem 1: 
0.00/0.04	
0.00/0.04	(VAR X Y)
0.00/0.04	(STRATEGY CONTEXTSENSITIVE
0.00/0.04	(f 1)
0.00/0.04	(if 1 2)
0.00/0.04	(c)
0.00/0.04	(false)
0.00/0.04	(true)
0.00/0.04	)
0.00/0.04	(RULES
0.00/0.04	f(X) -> if(X,c,f(true))
0.00/0.04	if(false,X,Y) -> Y
0.00/0.04	if(true,X,Y) -> X
0.00/0.04	)
0.00/0.04	
0.00/0.04	Problem 1: 
0.00/0.04	
0.00/0.04	Innermost Equivalent Processor:
0.00/0.04	-> Rules:
0.00/0.04	 f(X) -> if(X,c,f(true))
0.00/0.04	 if(false,X,Y) -> Y
0.00/0.04	 if(true,X,Y) -> X
0.00/0.04	-> The context-sensitive term rewriting system is an orthogonal system. Therefore, innermost cs-termination implies cs-termination.
0.00/0.04	 
0.00/0.04	
0.00/0.04	Problem 1: 
0.00/0.04	
0.00/0.04	Dependency Pairs Processor:
0.00/0.04	-> Pairs:
0.00/0.04	 F(X) -> IF(X,c,f(true))
0.00/0.04	 IF(false,X,Y) -> Y
0.00/0.04	-> Rules:
0.00/0.04	 f(X) -> if(X,c,f(true))
0.00/0.04	 if(false,X,Y) -> Y
0.00/0.04	 if(true,X,Y) -> X
0.00/0.04	-> Unhiding Rules:
0.00/0.04	 f(true) -> F(true)
0.00/0.04	
0.00/0.04	Problem 1: 
0.00/0.04	
0.00/0.04	SCC Processor:
0.00/0.04	-> Pairs:
0.00/0.04	 F(X) -> IF(X,c,f(true))
0.00/0.04	 IF(false,X,Y) -> Y
0.00/0.04	-> Rules:
0.00/0.04	 f(X) -> if(X,c,f(true))
0.00/0.04	 if(false,X,Y) -> Y
0.00/0.04	 if(true,X,Y) -> X
0.00/0.04	-> Unhiding rules:
0.00/0.04	 f(true) -> F(true)
0.00/0.04	->Strongly Connected Components:
0.00/0.04	->->Cycle:
0.00/0.04	->->-> Pairs:
0.00/0.04	 F(X) -> IF(X,c,f(true))
0.00/0.04	 IF(false,X,Y) -> Y
0.00/0.04	->->-> Rules:
0.00/0.04	 f(X) -> if(X,c,f(true))
0.00/0.04	 if(false,X,Y) -> Y
0.00/0.04	 if(true,X,Y) -> X
0.00/0.04	->->-> Unhiding rules:
0.00/0.04	 f(true) -> F(true)
0.00/0.04	
0.00/0.04	Problem 1: 
0.00/0.04	
0.00/0.04	Reduction Pairs Processor:
0.00/0.04	-> Pairs:
0.00/0.04	 F(X) -> IF(X,c,f(true))
0.00/0.04	 IF(false,X,Y) -> Y
0.00/0.04	-> Rules:
0.00/0.04	 f(X) -> if(X,c,f(true))
0.00/0.04	 if(false,X,Y) -> Y
0.00/0.04	 if(true,X,Y) -> X
0.00/0.04	-> Unhiding rules:
0.00/0.04	 f(true) -> F(true)
0.00/0.04	-> Usable rules:
0.00/0.04	 Empty
0.00/0.04	->Interpretation type:
0.00/0.04	 Linear
0.00/0.04	->Coefficients:
0.00/0.04	 Natural Numbers
0.00/0.04	->Dimension:
0.00/0.04	 1
0.00/0.04	->Bound:
0.00/0.04	 2
0.00/0.04	->Interpretation:
0.00/0.04	 
0.00/0.04	[f](X) = 2.X
0.00/0.04	[c] = 0
0.00/0.04	[false] = 2
0.00/0.04	[true] = 0
0.00/0.04	[F](X) = 2.X
0.00/0.04	[IF](X1,X2,X3) = 2.X1 + 2.X3
0.00/0.04	
0.00/0.04	Problem 1: 
0.00/0.04	
0.00/0.04	SCC Processor:
0.00/0.04	-> Pairs:
0.00/0.04	 F(X) -> IF(X,c,f(true))
0.00/0.04	-> Rules:
0.00/0.04	 f(X) -> if(X,c,f(true))
0.00/0.04	 if(false,X,Y) -> Y
0.00/0.04	 if(true,X,Y) -> X
0.00/0.04	-> Unhiding rules:
0.00/0.04	 f(true) -> F(true)
0.00/0.04	->Strongly Connected Components:
0.00/0.04	 There is no strongly connected component
0.00/0.04	
0.00/0.04	The problem is finite.
0.00/0.05	EOF