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