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