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