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 X:S)
0.00/0.04	(RULES
0.00/0.04	a__c -> c
0.00/0.04	a__c -> d
0.00/0.04	a__g(X:S) -> a__h(X:S)
0.00/0.04	a__g(X:S) -> g(X:S)
0.00/0.04	a__h(d) -> a__g(c)
0.00/0.04	a__h(X:S) -> h(X:S)
0.00/0.04	mark(c) -> a__c
0.00/0.04	mark(d) -> d
0.00/0.04	mark(g(X:S)) -> a__g(X:S)
0.00/0.04	mark(h(X:S)) -> a__h(X:S)
0.00/0.04	) 
0.00/0.04	(STRATEGY INNERMOST)
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	 A__G(X:S) -> A__H(X:S)
0.00/0.04	 A__H(d) -> A__G(c)
0.00/0.04	 MARK(c) -> A__C
0.00/0.04	 MARK(g(X:S)) -> A__G(X:S)
0.00/0.04	 MARK(h(X:S)) -> A__H(X:S)
0.00/0.04	-> Rules:
0.00/0.04	 a__c -> c
0.00/0.04	 a__c -> d
0.00/0.04	 a__g(X:S) -> a__h(X:S)
0.00/0.04	 a__g(X:S) -> g(X:S)
0.00/0.04	 a__h(d) -> a__g(c)
0.00/0.04	 a__h(X:S) -> h(X:S)
0.00/0.04	 mark(c) -> a__c
0.00/0.04	 mark(d) -> d
0.00/0.04	 mark(g(X:S)) -> a__g(X:S)
0.00/0.04	 mark(h(X:S)) -> a__h(X: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	 A__G(X:S) -> A__H(X:S)
0.00/0.04	 A__H(d) -> A__G(c)
0.00/0.04	 MARK(c) -> A__C
0.00/0.04	 MARK(g(X:S)) -> A__G(X:S)
0.00/0.04	 MARK(h(X:S)) -> A__H(X:S)
0.00/0.04	-> Rules:
0.00/0.04	 a__c -> c
0.00/0.04	 a__c -> d
0.00/0.04	 a__g(X:S) -> a__h(X:S)
0.00/0.04	 a__g(X:S) -> g(X:S)
0.00/0.04	 a__h(d) -> a__g(c)
0.00/0.04	 a__h(X:S) -> h(X:S)
0.00/0.04	 mark(c) -> a__c
0.00/0.04	 mark(d) -> d
0.00/0.04	 mark(g(X:S)) -> a__g(X:S)
0.00/0.04	 mark(h(X:S)) -> a__h(X:S)
0.00/0.04	->Strongly Connected Components:
0.00/0.04	->->Cycle:
0.00/0.04	->->-> Pairs:
0.00/0.04	 A__G(X:S) -> A__H(X:S)
0.00/0.04	 A__H(d) -> A__G(c)
0.00/0.04	->->-> Rules:
0.00/0.04	 a__c -> c
0.00/0.04	 a__c -> d
0.00/0.04	 a__g(X:S) -> a__h(X:S)
0.00/0.04	 a__g(X:S) -> g(X:S)
0.00/0.04	 a__h(d) -> a__g(c)
0.00/0.04	 a__h(X:S) -> h(X:S)
0.00/0.04	 mark(c) -> a__c
0.00/0.04	 mark(d) -> d
0.00/0.04	 mark(g(X:S)) -> a__g(X:S)
0.00/0.04	 mark(h(X:S)) -> a__h(X:S)
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	 A__G(X:S) -> A__H(X:S)
0.00/0.04	 A__H(d) -> A__G(c)
0.00/0.04	-> Rules:
0.00/0.04	 a__c -> c
0.00/0.04	 a__c -> d
0.00/0.04	 a__g(X:S) -> a__h(X:S)
0.00/0.04	 a__g(X:S) -> g(X:S)
0.00/0.04	 a__h(d) -> a__g(c)
0.00/0.04	 a__h(X:S) -> h(X:S)
0.00/0.04	 mark(c) -> a__c
0.00/0.04	 mark(d) -> d
0.00/0.04	 mark(g(X:S)) -> a__g(X:S)
0.00/0.04	 mark(h(X:S)) -> a__h(X: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	[a__c] = 0
0.00/0.04	[a__g](X) = 0
0.00/0.04	[a__h](X) = 0
0.00/0.04	[mark](X) = 0
0.00/0.04	[c] = 1
0.00/0.04	[d] = 2
0.00/0.04	[fSNonEmpty] = 0
0.00/0.04	[g](X) = 0
0.00/0.04	[h](X) = 0
0.00/0.04	[A__C] = 0
0.00/0.04	[A__G](X) = 2.X + 2
0.00/0.04	[A__H](X) = 2.X + 1
0.00/0.04	[MARK](X) = 0
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	 A__H(d) -> A__G(c)
0.00/0.04	-> Rules:
0.00/0.04	 a__c -> c
0.00/0.04	 a__c -> d
0.00/0.04	 a__g(X:S) -> a__h(X:S)
0.00/0.04	 a__g(X:S) -> g(X:S)
0.00/0.04	 a__h(d) -> a__g(c)
0.00/0.04	 a__h(X:S) -> h(X:S)
0.00/0.04	 mark(c) -> a__c
0.00/0.04	 mark(d) -> d
0.00/0.04	 mark(g(X:S)) -> a__g(X:S)
0.00/0.04	 mark(h(X:S)) -> a__h(X: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.04	EOF