This note generalizes factorization for formulas with multiplicities and conjectures that the connection method along with this feature is computationally as powerful as resolution, also seen from a complexity point of view.

翻译：本文推广了带多重性的公式的因子分解，并猜想具有该特征的连接法与归结法在计算能力上相当——这一点从复杂性角度同样成立。