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