0.00/0.09	MAYBE
0.00/0.10	Input TRS:
0.00/0.10	    1: b(b(x1)) -> c(b(c(x1)))
0.00/0.10	    2: c(c(c(x1))) -> a(x1)
0.00/0.10	    3: a(x1) ->= a(c(b(x1)))
0.00/0.10	Number of strict rules: 2
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: #c(c(c(x1))) -> #a(x1)
0.00/0.10	   #2: #a(x1) ->? #a(c(b(x1)))
0.00/0.10	   #3: #a(x1) ->? #c(b(x1))
0.00/0.10	   #4: #a(x1) ->? #b(x1)
0.00/0.10	   #5: #b(b(x1)) -> #c(b(c(x1)))
0.00/0.10	   #6: #b(b(x1)) -> #b(c(x1))
0.00/0.10	   #7: #b(b(x1)) -> #c(x1)
0.00/0.10	Number of SCCs: 1, DPs: 4
0.00/0.10	  SCC { #1 #2 #4 #7 }
0.00/0.10	POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... succeeded.
0.00/0.10	      a 	w: [0,0;1,0] * x1
0.00/0.10	      b 	w: [1,1;1,1] * x1 + [1;3]
0.00/0.10	      c 	w: [0,0;1,1] * x1 + [0;1]
0.00/0.10	      #c 	w: [0,1;0,0] * x1
0.00/0.10	      #a 	w: [1,0;0,0] * x1 + [1;0]
0.00/0.10	      #b 	w: [1,0;0,0] * x1
0.00/0.10	    USABLE RULES: { 1..3 }
0.00/0.10	    Removed DPs: #1 #4 #7
0.00/0.10	Number of SCCs: 1, DPs: 1
0.00/0.10	  SCC { #2 }
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