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