0.00/0.29	MAYBE
0.00/0.29	Input TRS:
0.00/0.29	    1: a(a(a(b(b(x1))))) -> b(b(a(b(b(a(a(a(x1))))))))
0.00/0.29	    2: b(b(a(x1))) -> x1
0.00/0.29	    3: a(x1) -> b(b(b(x1)))
0.00/0.29	    4: a(x1) -> b(x1)
0.00/0.29	Number of strict rules: 4
0.00/0.29	Direct POLO(bPol) ... failed.
0.00/0.29	Uncurrying ... failed.
0.00/0.29	Dependency Pairs:
0.00/0.29	   #1: #a(x1) -> #b(b(b(x1)))
0.00/0.29	   #2: #a(x1) -> #b(b(x1))
0.00/0.29	   #3: #a(x1) -> #b(x1)
0.00/0.29	   #4: #a(a(a(b(b(x1))))) -> #b(b(a(b(b(a(a(a(x1))))))))
0.00/0.29	   #5: #a(a(a(b(b(x1))))) -> #b(a(b(b(a(a(a(x1)))))))
0.00/0.29	   #6: #a(a(a(b(b(x1))))) -> #a(b(b(a(a(a(x1))))))
0.00/0.29	   #7: #a(a(a(b(b(x1))))) -> #b(b(a(a(a(x1)))))
0.00/0.29	   #8: #a(a(a(b(b(x1))))) -> #b(a(a(a(x1))))
0.00/0.29	   #9: #a(a(a(b(b(x1))))) -> #a(a(a(x1)))
0.00/0.29	   #10: #a(a(a(b(b(x1))))) -> #a(a(x1))
0.00/0.29	   #11: #a(a(a(b(b(x1))))) -> #a(x1)
0.00/0.29	   #12: #a(x1) -> #b(x1)
0.00/0.29	Number of SCCs: 1, DPs: 4
0.00/0.29	  SCC { #6 #9..11 }
0.00/0.29	POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
0.00/0.29	Finding a loop...  failed.
0.00/0.29	EOF