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