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