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