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