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