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