0.00/0.10	MAYBE
0.00/0.10	Input TRS:
0.00/0.10	    1: a(x1) -> x1
0.00/0.10	    2: a(b(x1)) -> b(c(a(x1)))
0.00/0.10	    3: b(c(c(x1))) -> c(b(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(b(x1)) -> #b(c(a(x1)))
0.00/0.10	   #2: #a(b(x1)) -> #a(x1)
0.00/0.10	   #3: #b(c(c(x1))) -> #b(a(x1))
0.00/0.10	   #4: #b(c(c(x1))) -> #a(x1)
0.00/0.10	Number of SCCs: 1, DPs: 4
0.00/0.10	  SCC { #1..4 }
0.00/0.10	POLO(Sum)... succeeded.
0.00/0.10	      a 	w: x1
0.00/0.10	      b 	w: x1 + 2
0.00/0.10	      c 	w: x1
0.00/0.10	      #a 	w: x1
0.00/0.10	      #b 	w: x1 + 1
0.00/0.10	    USABLE RULES: { 1..3 }
0.00/0.10	    Removed DPs: #1 #2 #4
0.00/0.10	Number of SCCs: 1, DPs: 1
0.00/0.10	  SCC { #3 }
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