0.84/0.89 MAYBE 0.86/0.89 Input TRS: 0.86/0.89 1: c(b(a(x1))) -> a(b(b(x1))) 0.86/0.89 2: b(a(c(x1))) -> b(b(b(x1))) 0.86/0.89 3: a(c(c(x1))) -> a(b(b(x1))) 0.86/0.89 4: c(c(a(x1))) ->= c(a(c(x1))) 0.86/0.89 5: a(a(a(x1))) ->= a(a(b(x1))) 0.86/0.89 6: a(b(a(x1))) ->= b(b(a(x1))) 0.86/0.89 7: b(b(b(x1))) ->= a(b(c(x1))) 0.86/0.89 Number of strict rules: 3 0.86/0.89 Direct POLO(bPol) ... failed. 0.86/0.89 Uncurrying ... failed. 0.86/0.89 Dependency Pairs: 0.86/0.89 #1: #b(a(c(x1))) -> #b(b(b(x1))) 0.86/0.89 #2: #b(a(c(x1))) -> #b(b(x1)) 0.86/0.89 #3: #b(a(c(x1))) -> #b(x1) 0.86/0.89 #4: #a(b(a(x1))) ->? #b(b(a(x1))) 0.86/0.89 #5: #b(b(b(x1))) ->? #a(b(c(x1))) 0.86/0.89 #6: #b(b(b(x1))) ->? #b(c(x1)) 0.86/0.89 #7: #b(b(b(x1))) ->? #c(x1) 0.86/0.89 #8: #a(a(a(x1))) ->? #a(a(b(x1))) 0.86/0.89 #9: #a(a(a(x1))) ->? #a(b(x1)) 0.86/0.89 #10: #a(a(a(x1))) ->? #b(x1) 0.86/0.89 #11: #a(c(c(x1))) -> #a(b(b(x1))) 0.86/0.89 #12: #a(c(c(x1))) -> #b(b(x1)) 0.86/0.89 #13: #a(c(c(x1))) -> #b(x1) 0.86/0.89 #14: #c(b(a(x1))) -> #a(b(b(x1))) 0.86/0.89 #15: #c(b(a(x1))) -> #b(b(x1)) 0.86/0.89 #16: #c(b(a(x1))) -> #b(x1) 0.86/0.89 #17: #c(c(a(x1))) ->? #c(a(c(x1))) 0.86/0.89 #18: #c(c(a(x1))) ->? #a(c(x1)) 0.86/0.89 #19: #c(c(a(x1))) ->? #c(x1) 0.86/0.89 Number of SCCs: 1, DPs: 19 0.86/0.89 SCC { #1..19 } 0.86/0.89 POLO(Sum)... succeeded. 0.86/0.89 a w: x1 + 1 0.86/0.89 b w: x1 + 1 0.86/0.89 c w: x1 + 1 0.86/0.89 #c w: x1 + 1 0.86/0.89 #a w: x1 0.86/0.89 #b w: x1 0.86/0.89 USABLE RULES: { 1..7 } 0.86/0.89 Removed DPs: #2 #3 #6 #7 #9 #10 #12..16 #18 #19 0.86/0.89 Number of SCCs: 1, DPs: 4 0.86/0.89 SCC { #1 #4 #5 #8 } 0.86/0.89 POLO(Sum)... succeeded. 0.86/0.89 a w: x1 0.86/0.89 b w: 0 0.86/0.89 c w: 1 0.86/0.89 #c w: x1 + 1 0.86/0.89 #a w: x1 0.86/0.89 #b w: x1 0.86/0.89 USABLE RULES: { 1..7 } 0.86/0.89 Removed DPs: #1 0.86/0.89 Number of SCCs: 1, DPs: 3 0.86/0.89 SCC { #4 #5 #8 } 0.86/0.89 POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed. 0.86/0.89 Finding a loop... failed. 0.86/0.89 EOF