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}$.

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