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