0.00/0.09	MAYBE
0.00/0.10	Input TRS:
0.00/0.10	    1: b(p(b(x1))) -> b(a(p(b(x1))))
0.00/0.10	    2: p(x1) ->= a(p(a(x1)))
0.00/0.10	    3: a(p(a(a(x1)))) ->= p(x1)
0.00/0.10	Number of strict rules: 1
0.00/0.10	Direct POLO(bPol) ... failed.
0.00/0.10	Uncurrying ... failed.
0.00/0.10	Dependency Pairs:
0.00/0.10	   #1: #b(p(b(x1))) -> #b(a(p(b(x1))))
0.00/0.10	Number of SCCs: 1, DPs: 1
0.00/0.10	  SCC { #1 }
0.00/0.10	POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
0.00/0.10	Finding a loop...  failed.
0.00/0.10	EOF