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