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