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