In this question, let's assume that in a Boolean formula in CNF each clause appears at most once in the formula,

And in each verse there are no double occurrences of literals $($a literal does not appear more than once in a verse$).$

As you remember, a Boolean formula in CNF is called a sufficiency, if it has a set that satisfies all the clauses of

The formula.

The language:

The formula CNF$-$SAT $=\{<>|$ is a satisfiable CNF Boolean formula$\}$ is a complete NP$.$

We will define the following language:

$\{$ Boolean formula in CNF$,$ which has a placement, which satisfies exactly two$-$thirds of the clauses $|<>\}$

For example, the placement $1=$ x$1,0=$x$2=$x$3=$x$4=$x$5=$x$6,$ provides exactly two thirds of the clauses of the formula

$($x$1$x$3$x$5$x$6)^($x$2$x$3$x$4)^($x$1$x$4)$

Prove: This language is complete$-$NP