0.00/0.24	MAYBE
0.00/0.25	Input TRS:
0.00/0.25	    1: b(a(L(x1))) -> L(a(L(X(b(a(b(b(x1))))))))
0.00/0.25	    2: b(L(x1)) -> L(b(x1))
0.00/0.25	Number of strict rules: 2
0.00/0.25	Direct POLO(bPol) ... failed.
0.00/0.25	Uncurrying b
0.00/0.25	1: b^1_a(L(x1)) -> L(a(L(X(b^1_a(b(b(x1)))))))
0.00/0.25	2: b^1_L(x1) -> L(b(x1))
0.00/0.25	3: b(a(_1)) ->= b^1_a(_1)
0.00/0.25	4: b(L(_1)) ->= b^1_L(_1)
0.00/0.25	Number of strict rules: 2
0.00/0.25	Direct POLO(bPol) ... failed.
0.00/0.25	Dependency Pairs:
0.00/0.25	   #1: #b^1_L(x1) -> #b(x1)
0.00/0.25	   #2: #b(a(_1)) ->? #b^1_a(_1)
0.00/0.25	   #3: #b^1_a(L(x1)) -> #b^1_a(b(b(x1)))
0.00/0.25	   #4: #b^1_a(L(x1)) -> #b(b(x1))
0.00/0.25	   #5: #b^1_a(L(x1)) -> #b(x1)
0.00/0.25	   #6: #b(L(_1)) ->? #b^1_L(_1)
0.00/0.25	Number of SCCs: 1, DPs: 6
0.00/0.25	  SCC { #1..6 }
0.00/0.25	POLO(Sum)... succeeded.
0.00/0.25	      a 	w: x1 + 2
0.00/0.25	      b^1_L	w: x1
0.00/0.25	      b 	w: x1
0.00/0.25	      #b^1_L	w: x1
0.00/0.25	      L 	w: x1
0.00/0.25	      b^1_a	w: 2
0.00/0.25	      X 	w: 0
0.00/0.25	      #b 	w: x1
0.00/0.25	      #b^1_a	w: x1 + 1
0.00/0.25	    USABLE RULES: { 1..4 }
0.00/0.25	    Removed DPs: #2 #4 #5
0.00/0.25	Number of SCCs: 2, DPs: 3
0.00/0.25	  SCC { #3 }
0.00/0.25	POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
0.00/0.25	Finding a loop...  failed.
0.00/0.25	EOF