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