YES Input TRS: 1: a(b(x1)) -> b(c(a(x1))) 2: b(c(x1)) -> c(b(b(x1))) 3: a(c(x1)) -> c(a(b(x1))) 4: a(a(x1)) -> a(d(d(d(x1)))) 5: d(a(x1)) -> d(d(c(x1))) 6: a(d(d(c(x1)))) -> a(a(a(d(x1)))) 7: e(e(f(f(x1)))) -> f(f(f(e(e(x1))))) 8: e(x1) -> a(x1) 9: b(d(x1)) -> d(d(x1)) Number of strict rules: 9 Direct POLO(bPol) ... removes: 8 7 a w: x1 d w: x1 b w: x1 c w: x1 f w: x1 + 26286 e w: 2 * x1 + 8946 Number of strict rules: 7 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #b(c(x1)) -> #b(b(x1)) #2: #b(c(x1)) -> #b(x1) #3: #a(d(d(c(x1)))) -> #a(a(a(d(x1)))) #4: #a(d(d(c(x1)))) -> #a(a(d(x1))) #5: #a(d(d(c(x1)))) -> #a(d(x1)) #6: #a(d(d(c(x1)))) -> #d(x1) #7: #b(d(x1)) -> #d(d(x1)) #8: #d(a(x1)) -> #d(d(c(x1))) #9: #d(a(x1)) -> #d(c(x1)) #10: #a(c(x1)) -> #a(b(x1)) #11: #a(c(x1)) -> #b(x1) #12: #a(b(x1)) -> #b(c(a(x1))) #13: #a(b(x1)) -> #a(x1) #14: #a(a(x1)) -> #a(d(d(d(x1)))) #15: #a(a(x1)) -> #d(d(d(x1))) #16: #a(a(x1)) -> #d(d(x1)) #17: #a(a(x1)) -> #d(x1) Number of SCCs: 2, DPs: 7 SCC { #1 #2 } POLO(Sum)... succeeded. a w: 1 d w: 1 b w: x1 c w: x1 + 7720 f w: 0 #d w: 0 e w: 0 #a w: 0 #b w: x1 USABLE RULES: { 2 9 } Removed DPs: #1 #2 Number of SCCs: 1, DPs: 5 SCC { #3..5 #10 #13 } POLO(Sum)... succeeded. a w: 8856 d w: 8857 b w: x1 c w: x1 f w: 0 #d w: 0 e w: 0 #a w: x1 #b w: x1 USABLE RULES: { 1..6 9 } Removed DPs: #3 #4 Number of SCCs: 2, DPs: 3 SCC { #5 } POLO(Sum)... POLO(max)... succeeded. a w: x1 + 11294 d w: x1 + 1 b w: 0 c w: x1 + 11293 f w: 0 #d w: 0 e w: 0 #a w: x1 #b w: 0 USABLE RULES: { 5 } Removed DPs: #5 Number of SCCs: 1, DPs: 2 SCC { #10 #13 } POLO(Sum)... POLO(max)... succeeded. a w: x1 + 1 d w: x1 b w: x1 c w: x1 + 1 f w: 0 #d w: 0 e w: 0 #a w: x1 #b w: 0 USABLE RULES: { 2 5 9 } Removed DPs: #10 Number of SCCs: 1, DPs: 1 SCC { #13 } POLO(Sum)... succeeded. a w: 29525 d w: 1 b w: x1 + 28101 c w: 1424 f w: 0 #d w: 0 e w: 0 #a w: x1 #b w: x1 USABLE RULES: { 1..6 9 } Removed DPs: #13 Number of SCCs: 0, DPs: 0