By the MAXSAT problem, we are given a set $V$ of $m$ variables and a collection $C$ of $n$ clauses over $V$. We will seek a truth assignment to maximize the number of satisfied clauses. This problem is $\textit{NP}$-hard even for its restricted version, the 2-MAXSAT problem by which every clause contains at most 2 literals. In this paper, we discuss a polynomial time algorithm to solve this problem. Its time complexity is bounded by O($n^2m^3$). Hence, we provide a proof of $P$ = $\textit{NP}$.

翻译：给定由$m$个变量构成的集合$V$以及由$n$个子句构成的集合$C$（每个子句基于$V$），MAXSAT问题要求寻找一个真值赋值以最大化满足的子句数量。该问题即使在受限版本（即每个子句最多包含两个文字的2-MAXSAT问题）中也是$\textit{NP}$-难的。本文讨论了一种多项式时间算法来求解该问题，其时间复杂度为O($n^2m^3$)。由此，我们提供了$P$ = $\textit{NP}$的证明。