YES Input TRS: 1: active(f(f(a()))) -> mark(c(f(g(f(a()))))) 2: mark(f(X)) -> active(f(mark(X))) 3: mark(a()) -> active(a()) 4: mark(c(X)) -> active(c(X)) 5: mark(g(X)) -> active(g(mark(X))) 6: f(mark(X)) -> f(X) 7: f(active(X)) -> f(X) 8: c(mark(X)) -> c(X) 9: c(active(X)) -> c(X) 10: g(mark(X)) -> g(X) 11: g(active(X)) -> g(X) Number of strict rules: 11 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #mark(f(X)) -> #active(f(mark(X))) #2: #mark(f(X)) -> #f(mark(X)) #3: #mark(f(X)) -> #mark(X) #4: #f(mark(X)) -> #f(X) #5: #c(active(X)) -> #c(X) #6: #g(active(X)) -> #g(X) #7: #f(active(X)) -> #f(X) #8: #g(mark(X)) -> #g(X) #9: #mark(g(X)) -> #active(g(mark(X))) #10: #mark(g(X)) -> #g(mark(X)) #11: #mark(g(X)) -> #mark(X) #12: #mark(a()) -> #active(a()) #13: #active(f(f(a()))) -> #mark(c(f(g(f(a()))))) #14: #active(f(f(a()))) -> #c(f(g(f(a())))) #15: #active(f(f(a()))) -> #f(g(f(a()))) #16: #active(f(f(a()))) -> #g(f(a())) #17: #c(mark(X)) -> #c(X) #18: #mark(c(X)) -> #active(c(X)) Number of SCCs: 4, DPs: 8 SCC { #3 #11 } POLO(Sum)... succeeded. a w: 0 c w: 0 f w: x1 + 1 #mark w: x1 mark w: 0 #f w: 0 #g w: 0 #c w: 0 active w: 0 #active w: 0 g w: x1 + 1 USABLE RULES: { } Removed DPs: #3 #11 Number of SCCs: 3, DPs: 6 SCC { #5 #17 } POLO(Sum)... succeeded. a w: 0 c w: 0 f w: 1 #mark w: 0 mark w: x1 + 1 #f w: 0 #g w: 0 #c w: x1 active w: x1 + 1 #active w: 0 g w: 1 USABLE RULES: { } Removed DPs: #5 #17 Number of SCCs: 2, DPs: 4 SCC { #6 #8 } POLO(Sum)... succeeded. a w: 0 c w: 0 f w: 1 #mark w: 0 mark w: x1 + 1 #f w: 0 #g w: x1 #c w: 0 active w: x1 + 1 #active w: 0 g w: 1 USABLE RULES: { } Removed DPs: #6 #8 Number of SCCs: 1, DPs: 2 SCC { #4 #7 } POLO(Sum)... succeeded. a w: 0 c w: 0 f w: 1 #mark w: 0 mark w: x1 + 1 #f w: x1 #g w: 0 #c w: 0 active w: x1 + 1 #active w: 0 g w: 1 USABLE RULES: { } Removed DPs: #4 #7 Number of SCCs: 0, DPs: 0