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