0.00/0.06	MAYBE
0.00/0.07	Input TRS:
0.00/0.07	    1: o(l(x1)) -> r(x1)
0.00/0.07	    2: n(l(o(x1))) -> r(o(x1))
0.00/0.07	    3: L(l(o(x1))) -> L(r(o(x1)))
0.00/0.07	    4: r(o(x1)) -> l(x1)
0.00/0.07	    5: o(r(n(x1))) -> o(l(x1))
0.00/0.07	    6: o(r(R(x1))) -> o(l(R(x1)))
0.00/0.07	    7: L(x1) ->= L(n(x1))
0.00/0.07	    8: R(x1) ->= n(R(x1))
0.00/0.07	Number of strict rules: 6
0.00/0.07	Direct POLO(bPol) ... removes: 4 1
0.00/0.07	      n 	w: x1
0.00/0.07	      r 	w: x1 + 1
0.00/0.07	      l 	w: x1 + 1
0.00/0.07	      o 	w: x1 + 1
0.00/0.07	      R 	w: x1 + 1
0.00/0.07	      L 	w: 2 * x1
0.00/0.07	Number of strict rules: 4
0.00/0.07	Direct POLO(bPol) ... failed.
0.00/0.07	Uncurrying ... failed.
0.00/0.07	Dependency Pairs:
0.00/0.07	   #1: #o(r(R(x1))) -> #o(l(R(x1)))
0.00/0.07	   #2: #L(x1) ->? #L(n(x1))
0.00/0.07	   #3: #L(x1) ->? #n(x1)
0.00/0.07	   #4: #o(r(n(x1))) -> #o(l(x1))
0.00/0.07	   #5: #L(l(o(x1))) -> #L(r(o(x1)))
0.00/0.07	   #6: #R(x1) ->? #n(R(x1))
0.00/0.07	   #7: #R(x1) ->? #R(x1)
0.00/0.07	Number of SCCs: 2, DPs: 2
0.00/0.07	  SCC { #7 }
0.00/0.07	POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
0.00/0.07	Finding a loop...  failed.
0.00/0.07	EOF