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