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