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(X:S) -> c(X:S) 0.00/0.01 a__c(X:S) -> d(X:S) 0.00/0.01 a__f(f(X:S)) -> a__c(f(g(f(X:S)))) 0.00/0.01 a__f(X:S) -> f(X:S) 0.00/0.01 a__h(X:S) -> a__c(d(X:S)) 0.00/0.01 a__h(X:S) -> h(X:S) 0.00/0.01 mark(c(X:S)) -> a__c(X:S) 0.00/0.01 mark(d(X:S)) -> d(X:S) 0.00/0.01 mark(f(X:S)) -> a__f(mark(X:S)) 0.00/0.01 mark(g(X:S)) -> g(X:S) 0.00/0.01 mark(h(X:S)) -> a__h(mark(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__F(f(X:S)) -> A__C(f(g(f(X:S)))) 0.00/0.01 A__H(X:S) -> A__C(d(X:S)) 0.00/0.01 MARK(c(X:S)) -> A__C(X:S) 0.00/0.01 MARK(f(X:S)) -> A__F(mark(X:S)) 0.00/0.01 MARK(f(X:S)) -> MARK(X:S) 0.00/0.01 MARK(h(X:S)) -> A__H(mark(X:S)) 0.00/0.01 MARK(h(X:S)) -> MARK(X:S) 0.00/0.01 -> Rules: 0.00/0.01 a__c(X:S) -> c(X:S) 0.00/0.01 a__c(X:S) -> d(X:S) 0.00/0.01 a__f(f(X:S)) -> a__c(f(g(f(X:S)))) 0.00/0.01 a__f(X:S) -> f(X:S) 0.00/0.01 a__h(X:S) -> a__c(d(X:S)) 0.00/0.01 a__h(X:S) -> h(X:S) 0.00/0.01 mark(c(X:S)) -> a__c(X:S) 0.00/0.01 mark(d(X:S)) -> d(X:S) 0.00/0.01 mark(f(X:S)) -> a__f(mark(X:S)) 0.00/0.01 mark(g(X:S)) -> g(X:S) 0.00/0.01 mark(h(X:S)) -> a__h(mark(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__F(f(X:S)) -> A__C(f(g(f(X:S)))) 0.00/0.01 A__H(X:S) -> A__C(d(X:S)) 0.00/0.01 MARK(c(X:S)) -> A__C(X:S) 0.00/0.01 MARK(f(X:S)) -> A__F(mark(X:S)) 0.00/0.01 MARK(f(X:S)) -> MARK(X:S) 0.00/0.01 MARK(h(X:S)) -> A__H(mark(X:S)) 0.00/0.01 MARK(h(X:S)) -> MARK(X:S) 0.00/0.01 -> Rules: 0.00/0.01 a__c(X:S) -> c(X:S) 0.00/0.01 a__c(X:S) -> d(X:S) 0.00/0.01 a__f(f(X:S)) -> a__c(f(g(f(X:S)))) 0.00/0.01 a__f(X:S) -> f(X:S) 0.00/0.01 a__h(X:S) -> a__c(d(X:S)) 0.00/0.01 a__h(X:S) -> h(X:S) 0.00/0.01 mark(c(X:S)) -> a__c(X:S) 0.00/0.01 mark(d(X:S)) -> d(X:S) 0.00/0.01 mark(f(X:S)) -> a__f(mark(X:S)) 0.00/0.01 mark(g(X:S)) -> g(X:S) 0.00/0.01 mark(h(X:S)) -> a__h(mark(X:S)) 0.00/0.01 ->Strongly Connected Components: 0.00/0.01 ->->Cycle: 0.00/0.01 ->->-> Pairs: 0.00/0.01 MARK(f(X:S)) -> MARK(X:S) 0.00/0.01 MARK(h(X:S)) -> MARK(X:S) 0.00/0.01 ->->-> Rules: 0.00/0.01 a__c(X:S) -> c(X:S) 0.00/0.01 a__c(X:S) -> d(X:S) 0.00/0.01 a__f(f(X:S)) -> a__c(f(g(f(X:S)))) 0.00/0.01 a__f(X:S) -> f(X:S) 0.00/0.01 a__h(X:S) -> a__c(d(X:S)) 0.00/0.01 a__h(X:S) -> h(X:S) 0.00/0.01 mark(c(X:S)) -> a__c(X:S) 0.00/0.01 mark(d(X:S)) -> d(X:S) 0.00/0.01 mark(f(X:S)) -> a__f(mark(X:S)) 0.00/0.01 mark(g(X:S)) -> g(X:S) 0.00/0.01 mark(h(X:S)) -> a__h(mark(X:S)) 0.00/0.01 0.00/0.01 Problem 1: 0.00/0.01 0.00/0.01 Subterm Processor: 0.00/0.01 -> Pairs: 0.00/0.01 MARK(f(X:S)) -> MARK(X:S) 0.00/0.01 MARK(h(X:S)) -> MARK(X:S) 0.00/0.01 -> Rules: 0.00/0.01 a__c(X:S) -> c(X:S) 0.00/0.01 a__c(X:S) -> d(X:S) 0.00/0.01 a__f(f(X:S)) -> a__c(f(g(f(X:S)))) 0.00/0.01 a__f(X:S) -> f(X:S) 0.00/0.01 a__h(X:S) -> a__c(d(X:S)) 0.00/0.01 a__h(X:S) -> h(X:S) 0.00/0.01 mark(c(X:S)) -> a__c(X:S) 0.00/0.01 mark(d(X:S)) -> d(X:S) 0.00/0.01 mark(f(X:S)) -> a__f(mark(X:S)) 0.00/0.01 mark(g(X:S)) -> g(X:S) 0.00/0.01 mark(h(X:S)) -> a__h(mark(X:S)) 0.00/0.01 ->Projection: 0.00/0.01 pi(MARK) = 1 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 a__c(X:S) -> c(X:S) 0.00/0.01 a__c(X:S) -> d(X:S) 0.00/0.01 a__f(f(X:S)) -> a__c(f(g(f(X:S)))) 0.00/0.01 a__f(X:S) -> f(X:S) 0.00/0.01 a__h(X:S) -> a__c(d(X:S)) 0.00/0.01 a__h(X:S) -> h(X:S) 0.00/0.01 mark(c(X:S)) -> a__c(X:S) 0.00/0.01 mark(d(X:S)) -> d(X:S) 0.00/0.01 mark(f(X:S)) -> a__f(mark(X:S)) 0.00/0.01 mark(g(X:S)) -> g(X:S) 0.00/0.01 mark(h(X:S)) -> a__h(mark(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