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