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