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