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