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