0.00/0.15	MAYBE
0.00/0.16	Input TRS:
0.00/0.16	    1: A(b(x1)) -> b(a(B(A(x1))))
0.00/0.16	    2: B(a(x1)) -> a(b(A(B(x1))))
0.00/0.16	    3: A(a(x1)) -> x1
0.00/0.16	    4: B(b(x1)) -> x1
0.00/0.16	Number of strict rules: 4
0.00/0.16	Direct POLO(bPol) ... failed.
0.00/0.16	Uncurrying ... failed.
0.00/0.16	Dependency Pairs:
0.00/0.16	   #1: #B(a(x1)) -> #A(B(x1))
0.00/0.16	   #2: #B(a(x1)) -> #B(x1)
0.00/0.16	   #3: #A(b(x1)) -> #B(A(x1))
0.00/0.16	   #4: #A(b(x1)) -> #A(x1)
0.00/0.16	Number of SCCs: 1, DPs: 4
0.00/0.16	  SCC { #1..4 }
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