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