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