0.00/0.11	MAYBE
0.00/0.11	Input TRS:
0.00/0.11	    1: a(b(x1)) -> x1
0.00/0.11	    2: a(c(x1)) -> b(c(a(a(x1))))
0.00/0.11	    3: c(b(x1)) -> a(c(x1))
0.00/0.11	Number of strict rules: 3
0.00/0.11	Direct POLO(bPol) ... failed.
0.00/0.11	Uncurrying ... failed.
0.00/0.11	Dependency Pairs:
0.00/0.11	   #1: #a(c(x1)) -> #c(a(a(x1)))
0.00/0.11	   #2: #a(c(x1)) -> #a(a(x1))
0.00/0.11	   #3: #a(c(x1)) -> #a(x1)
0.00/0.11	   #4: #c(b(x1)) -> #a(c(x1))
0.00/0.11	   #5: #c(b(x1)) -> #c(x1)
0.00/0.11	Number of SCCs: 1, DPs: 5
0.00/0.11	  SCC { #1..5 }
0.00/0.11	POLO(Sum)... succeeded.
0.00/0.11	      a 	w: x1
0.00/0.11	      b 	w: x1
0.00/0.11	      c 	w: x1 + 1
0.00/0.11	      #c 	w: x1 + 1
0.00/0.11	      #a 	w: x1
0.00/0.11	    USABLE RULES: { 1..3 }
0.00/0.11	    Removed DPs: #2 #3
0.00/0.11	Number of SCCs: 1, DPs: 3
0.00/0.11	  SCC { #1 #4 #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.12	EOF