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