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 X:S) 0.00/0.01 (RULES 0.00/0.01 a__c -> a__f(g(c)) 0.00/0.01 a__c -> c 0.00/0.01 a__f(g(X:S)) -> g(X:S) 0.00/0.01 a__f(X:S) -> f(X:S) 0.00/0.01 mark(c) -> a__c 0.00/0.01 mark(f(X:S)) -> a__f(X:S) 0.00/0.01 mark(g(X:S)) -> g(X:S) 0.00/0.01 ) 0.00/0.01 (STRATEGY INNERMOST) 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 A__C -> A__F(g(c)) 0.00/0.01 MARK(c) -> A__C 0.00/0.01 MARK(f(X:S)) -> A__F(X:S) 0.00/0.01 -> Rules: 0.00/0.01 a__c -> a__f(g(c)) 0.00/0.01 a__c -> c 0.00/0.01 a__f(g(X:S)) -> g(X:S) 0.00/0.01 a__f(X:S) -> f(X:S) 0.00/0.01 mark(c) -> a__c 0.00/0.01 mark(f(X:S)) -> a__f(X:S) 0.00/0.01 mark(g(X:S)) -> g(X: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 A__C -> A__F(g(c)) 0.00/0.01 MARK(c) -> A__C 0.00/0.01 MARK(f(X:S)) -> A__F(X:S) 0.00/0.01 -> Rules: 0.00/0.01 a__c -> a__f(g(c)) 0.00/0.01 a__c -> c 0.00/0.01 a__f(g(X:S)) -> g(X:S) 0.00/0.01 a__f(X:S) -> f(X:S) 0.00/0.01 mark(c) -> a__c 0.00/0.01 mark(f(X:S)) -> a__f(X:S) 0.00/0.01 mark(g(X:S)) -> g(X: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