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