0.00/0.05	NO
0.00/0.06	Input TRS:
0.00/0.06	    1: b(a(x)) -> a(b(x))
0.00/0.06	    2: a(x) ->= a(a(x))
0.00/0.06	    3: b(x) ->= b(b(x))
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: #b(x) ->? #b(b(x))
0.00/0.06	   #2: #b(x) ->? #b(x)
0.00/0.06	   #3: #b(a(x)) -> #b(x)
0.00/0.06	Number of SCCs: 1, DPs: 3
0.00/0.06	  SCC { #1..3 }
0.00/0.06	POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
0.00/0.06	Finding a loop...  found.
0.00/0.06	  #b(a(x_{i9}))	-#1->
0.00/0.06	  #b(b(a(x_{i9})))	--->*
0.00/0.06	  #b(a(a(a(a(a(b(x_{i9})))))))	-#3->
0.00/0.06	  #b(a(a(a(a(b(x_{i9}))))))	--->*
0.00/0.06	  #b(a(a(a(a(b(x_{i9}))))))
0.00/0.06	  Looping with: [ x_{i9} := a(a(a(b(x_{i9})))); ]
0.00/0.06	EOF