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