0.00/0.04	YES
0.00/0.04	
0.00/0.04	Problem 1: 
0.00/0.04	
0.00/0.04	(VAR v_NonEmpty:S x1:S)
0.00/0.04	(RULES
0.00/0.04	b(a(b(c(c(b(x1:S)))))) -> a(b(b(c(c(b(a(x1:S)))))))
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	 B(a(b(c(c(b(x1:S)))))) -> B(b(c(c(b(a(x1:S))))))
0.00/0.04	 B(a(b(c(c(b(x1:S)))))) -> B(a(x1:S))
0.00/0.04	 B(a(b(c(c(b(x1:S)))))) -> B(c(c(b(a(x1:S)))))
0.00/0.04	-> Rules:
0.00/0.04	 b(a(b(c(c(b(x1:S)))))) -> a(b(b(c(c(b(a(x1:S)))))))
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	 B(a(b(c(c(b(x1:S)))))) -> B(b(c(c(b(a(x1:S))))))
0.00/0.04	 B(a(b(c(c(b(x1:S)))))) -> B(a(x1:S))
0.00/0.04	 B(a(b(c(c(b(x1:S)))))) -> B(c(c(b(a(x1:S)))))
0.00/0.04	-> Rules:
0.00/0.04	 b(a(b(c(c(b(x1:S)))))) -> a(b(b(c(c(b(a(x1:S)))))))
0.00/0.04	->Strongly Connected Components:
0.00/0.04	->->Cycle:
0.00/0.04	->->-> Pairs:
0.00/0.04	 B(a(b(c(c(b(x1:S)))))) -> B(a(x1:S))
0.00/0.04	->->-> Rules:
0.00/0.04	 b(a(b(c(c(b(x1:S)))))) -> a(b(b(c(c(b(a(x1:S)))))))
0.00/0.04	
0.00/0.04	Problem 1: 
0.00/0.04	
0.00/0.04	Reduction Pair Processor:
0.00/0.04	-> Pairs:
0.00/0.04	 B(a(b(c(c(b(x1:S)))))) -> B(a(x1:S))
0.00/0.04	-> Rules:
0.00/0.04	 b(a(b(c(c(b(x1:S)))))) -> a(b(b(c(c(b(a(x1:S)))))))
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	[b](X) = 2.X + 2
0.00/0.04	[a](X) = 2.X
0.00/0.04	[c](X) = X
0.00/0.04	[B](X) = 2.X
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	 Empty
0.00/0.04	-> Rules:
0.00/0.04	 b(a(b(c(c(b(x1:S)))))) -> a(b(b(c(c(b(a(x1:S)))))))
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