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