MAYBE Input TRS: 1: b(b(x1)) -> b(a(b(x1))) 2: b(b(a(b(x1)))) -> b(a(b(a(a(b(b(x1))))))) 3: b(a(b(x1))) -> b(a(a(b(x1)))) 4: b(a(a(b(a(b(x1)))))) -> b(b(x1)) Number of strict rules: 4 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #b(b(a(b(x1)))) -> #b(a(b(a(a(b(b(x1))))))) #2: #b(b(a(b(x1)))) -> #b(a(a(b(b(x1))))) #3: #b(b(a(b(x1)))) -> #b(b(x1)) #4: #b(a(b(x1))) -> #b(a(a(b(x1)))) #5: #b(b(x1)) -> #b(a(b(x1))) #6: #b(a(a(b(a(b(x1)))))) -> #b(b(x1)) Number of SCCs: 1, DPs: 6 SCC { #1..6 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed. Finding a loop... failed.