0.00/0.09 MAYBE 0.00/0.09 Input TRS: 0.00/0.09 1: Mr(R(x1)) -> Ml(cr(R(x1))) 0.00/0.09 2: L(Ml(x1)) -> L(Mr(cr(x1))) 0.00/0.09 3: Mr(o(x1)) -> Ml(cr(x1)) 0.00/0.09 4: Mr(n(x1)) -> Ml(cr(x1)) 0.00/0.09 5: o(Ml(x1)) -> Mr(cr(x1)) 0.00/0.09 6: n(Ml(x1)) -> Mr(cr(x1)) 0.00/0.09 7: Mr(o(x1)) ->= Mr(x1) 0.00/0.09 8: Mr(n(x1)) ->= Mr(x1) 0.00/0.09 9: o(Ml(x1)) ->= Ml(x1) 0.00/0.09 10: n(Ml(x1)) ->= Ml(x1) 0.00/0.09 11: Ml(cr(x1)) ->= cl(Ml(x1)) 0.00/0.09 12: Mr(cr(x1)) ->= cl(Mr(x1)) 0.00/0.09 13: L(x1) ->= L(n(x1)) 0.00/0.09 14: R(x1) ->= n(R(x1)) 0.00/0.09 15: cr(n(x1)) ->= n(cr(x1)) 0.00/0.09 16: cr(o(x1)) ->= o(cr(x1)) 0.00/0.09 17: cr(o(x1)) ->= o(x1) 0.00/0.09 18: n(cl(x1)) ->= cl(n(x1)) 0.00/0.09 19: o(cl(x1)) ->= cl(o(x1)) 0.00/0.09 20: o(cl(x1)) ->= o(x1) 0.00/0.09 Number of strict rules: 6 0.00/0.09 Direct POLO(bPol) ... removes: 3 5 7 9 0.00/0.09 n w: x1 0.00/0.09 Ml w: x1 + 1 0.00/0.09 o w: 2 * x1 + 1 0.00/0.09 Mr w: x1 + 1 0.00/0.09 R w: x1 + 1 0.00/0.09 L w: x1 0.00/0.09 cr w: x1 0.00/0.09 cl w: x1 0.00/0.09 Number of strict rules: 4 0.00/0.09 Direct POLO(bPol) ... failed. 0.00/0.09 Uncurrying ... failed. 0.00/0.09 Dependency Pairs: 0.00/0.09 #1: #L(Ml(x1)) -> #L(Mr(cr(x1))) 0.00/0.09 #2: #L(Ml(x1)) -> #Mr(cr(x1)) 0.00/0.09 #3: #L(Ml(x1)) -> #cr(x1) 0.00/0.09 #4: #n(Ml(x1)) -> #Mr(cr(x1)) 0.00/0.09 #5: #n(Ml(x1)) -> #cr(x1) 0.00/0.09 #6: #L(x1) ->? #L(n(x1)) 0.00/0.09 #7: #L(x1) ->? #n(x1) 0.00/0.09 #8: #Mr(cr(x1)) ->? #Mr(x1) 0.00/0.09 #9: #R(x1) ->? #n(R(x1)) 0.00/0.09 #10: #R(x1) ->? #R(x1) 0.00/0.09 #11: #cr(o(x1)) ->? #cr(x1) 0.00/0.09 #12: #Mr(R(x1)) -> #cr(R(x1)) 0.00/0.09 #13: #Mr(n(x1)) ->? #Mr(x1) 0.00/0.09 #14: #cr(n(x1)) ->? #n(cr(x1)) 0.00/0.09 #15: #cr(n(x1)) ->? #cr(x1) 0.00/0.09 #16: #Mr(n(x1)) -> #cr(x1) 0.00/0.09 #17: #n(cl(x1)) ->? #n(x1) 0.00/0.09 Number of SCCs: 3, DPs: 13 0.00/0.09 SCC { #10 } 0.00/0.09 POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed. 0.00/0.09 Finding a loop... failed. 0.00/0.09 EOF