MAYBE Input TRS: 1: b(c(b(a(a(a(a(a(a(x1))))))))) -> a(a(a(a(a(a(a(b(c(b(b(c(b(x1))))))))))))) Number of strict rules: 1 Direct POLO(bPol) ... failed. Uncurrying b 1: b^1_c(b^1_a(a(a(a(a(a(x1))))))) -> a(a(a(a(a(a(a(b^1_c(b(b^1_c(b(x1))))))))))) 2: b(a(_1)) ->= b^1_a(_1) 3: b(c(_1)) ->= b^1_c(_1) Number of strict rules: 1 Direct POLO(bPol) ... removes: 3 a w: x1 b w: x1 b^1_c w: x1 c w: 2 * x1 + 1 b^1_a w: x1 Number of strict rules: 1 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #b^1_c(b^1_a(a(a(a(a(a(x1))))))) -> #b^1_c(b(b^1_c(b(x1)))) #2: #b^1_c(b^1_a(a(a(a(a(a(x1))))))) -> #b^1_c(b(x1)) Number of SCCs: 1, DPs: 2 SCC { #1 #2 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed. Finding a loop... failed.