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