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