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