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