Input TRS: 1: a__g(X) -> a__h(X) 2: a__c -> d 3: a__h(d) -> a__g(c) 4: mark(g(X)) -> a__g(X) 5: mark(h(X)) -> a__h(X) 6: mark(c) -> a__c 7: mark(d) -> d 8: a__g(X) -> g(X) 9: a__h(X) -> h(X) 10: a__c -> c Dependency Pairs: #1: #a__g(X) -> #a__h(X) #2: #a__h(d) -> #a__g(c) #3: #mark(g(X)) -> #a__g(X) #4: #mark(h(X)) -> #a__h(X) #5: #mark(c) -> #a__c Number of SCCs: 1 SCC { #1 #2 } QKBOPS(sum)... removes: #2 I(c) = 1 I(d) = 2 I(#a__g) = x1 \pi(#a__g) = [] I(#a__h) = x1 \pi(#a__h) = [] PREC: c = d > #a__g = #a__h USABLE RULES: { } Number of SCCs: 0