0.00/0.35	MAYBE
0.00/0.35	Input TRS:
0.00/0.35	    1: a(a(b(a(a(a(b(a(a(b(x1)))))))))) -> a(b(a(a(a(b(a(a(b(a(a(a(b(x1)))))))))))))
0.00/0.35	Number of strict rules: 1
0.00/0.35	Direct POLO(bPol) ... failed.
0.00/0.35	Uncurrying a
0.00/0.35	1: a^2_b(a(a^2_b(a^2_b(x1)))) -> a^1_b(a(a^2_b(a^2_b(a(a^2_b(x1))))))
0.00/0.35	2: a(b(_1)) ->= a^1_b(_1)
0.00/0.35	3: a(a^1_b(_1)) ->= a^2_b(_1)
0.00/0.35	Number of strict rules: 1
0.00/0.35	Direct POLO(bPol) ... removes: 2
0.00/0.35	      a 	w: x1
0.00/0.35	      b 	w: 2 * x1 + 2
0.00/0.35	      a^1_b	w: x1
0.00/0.35	      a^2_b	w: x1
0.00/0.35	Number of strict rules: 1
0.00/0.35	Direct POLO(bPol) ... failed.
0.00/0.35	Dependency Pairs:
0.00/0.35	   #1: #a(a^1_b(_1)) ->? #a^2_b(_1)
0.00/0.35	   #2: #a^2_b(a(a^2_b(a^2_b(x1)))) -> #a(a^2_b(a^2_b(a(a^2_b(x1)))))
0.00/0.35	   #3: #a^2_b(a(a^2_b(a^2_b(x1)))) -> #a^2_b(a^2_b(a(a^2_b(x1))))
0.00/0.35	   #4: #a^2_b(a(a^2_b(a^2_b(x1)))) -> #a^2_b(a(a^2_b(x1)))
0.00/0.35	   #5: #a^2_b(a(a^2_b(a^2_b(x1)))) -> #a(a^2_b(x1))
0.00/0.35	Number of SCCs: 1, DPs: 3
0.00/0.35	  SCC { #1 #4 #5 }
0.00/0.35	POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
0.00/0.35	Finding a loop...  failed.
0.00/0.35	EOF