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