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