YES Input TRS: 1: a(b(c(a(x1)))) -> b(a(c(b(a(b(x1)))))) 2: a(d(x1)) -> c(x1) 3: a(f(f(x1))) -> g(x1) 4: b(g(x1)) -> g(b(x1)) 5: c(x1) -> f(f(x1)) 6: c(a(c(x1))) -> b(c(a(b(c(x1))))) 7: c(d(x1)) -> a(a(x1)) 8: g(x1) -> c(a(x1)) 9: g(x1) -> d(d(d(d(x1)))) Number of strict rules: 9 Direct POLO(bPol) ... removes: 7 9 2 a w: x1 + 173642 d w: x1 + 115760 b w: x1 c w: x1 + 289400 f w: x1 + 144700 g w: x1 + 463042 Number of strict rules: 6 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #c(a(c(x1))) -> #b(c(a(b(c(x1))))) #2: #c(a(c(x1))) -> #c(a(b(c(x1)))) #3: #c(a(c(x1))) -> #a(b(c(x1))) #4: #c(a(c(x1))) -> #b(c(x1)) #5: #a(f(f(x1))) -> #g(x1) #6: #a(b(c(a(x1)))) -> #b(a(c(b(a(b(x1)))))) #7: #a(b(c(a(x1)))) -> #a(c(b(a(b(x1))))) #8: #a(b(c(a(x1)))) -> #c(b(a(b(x1)))) #9: #a(b(c(a(x1)))) -> #b(a(b(x1))) #10: #a(b(c(a(x1)))) -> #a(b(x1)) #11: #a(b(c(a(x1)))) -> #b(x1) #12: #g(x1) -> #c(a(x1)) #13: #g(x1) -> #a(x1) #14: #b(g(x1)) -> #g(b(x1)) #15: #b(g(x1)) -> #b(x1) Number of SCCs: 1, DPs: 14 SCC { #1..7 #9..15 } POLO(Sum)... succeeded. a w: x1 + 52868 d w: 0 b w: x1 c w: x1 + 72672 f w: x1 + 36336 #g w: x1 + 125540 #c w: x1 + 72672 #a w: x1 + 125540 g w: x1 + 125540 #b w: x1 USABLE RULES: { 1 3..6 8 } Removed DPs: #4..6 #9..11 #15 Number of SCCs: 1, DPs: 4 SCC { #1 #2 #12 #14 } POLO(Sum)... succeeded. a w: 3 d w: 0 b w: x1 c w: 1 f w: 1 #g w: 3 #c w: 2 #a w: 125540 g w: 3 #b w: x1 USABLE RULES: { 1 3..6 8 } Removed DPs: #1 #12 Number of SCCs: 1, DPs: 1 SCC { #2 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... succeeded. a s: [1] p: 2 w: x1 + 3 d s: [] p: 0 w: 1 b s: [] p: 0 w: x1 c s: [] p: 1 w: 8369 f s: [] p: 1 w: 8368 #g s: [] p: 0 w: 1 #c s: [1] p: 0 w: x1 + 1 #a s: [] p: 0 w: 1 g s: [] p: 0 w: 8370 #b s: [] p: 0 w: 1 USABLE RULES: { 1 3..6 8 } Removed DPs: #2 Number of SCCs: 0, DPs: 0