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