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 x1:S)
0.00/0.01	(RULES
0.00/0.01	b(b(c(a(b(c(x1:S)))))) -> a(b(b(c(b(c(a(x1:S)))))))
0.00/0.01	)
0.00/0.01	
0.00/0.01	Problem 1: 
0.00/0.01	
0.00/0.01	Innermost Equivalent Processor:
0.00/0.01	-> Rules:
0.00/0.01	 b(b(c(a(b(c(x1:S)))))) -> a(b(b(c(b(c(a(x1:S)))))))
0.00/0.01	-> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination.
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	 Empty
0.00/0.01	-> Rules:
0.00/0.01	 b(b(c(a(b(c(x1:S)))))) -> a(b(b(c(b(c(a(x1: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	 Empty
0.00/0.01	-> Rules:
0.00/0.01	 b(b(c(a(b(c(x1:S)))))) -> a(b(b(c(b(c(a(x1: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