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