91Ó°ÊÓ

$⟨\mathrm{φ}âŸ\copyright$Consider the following algorithm which can be used for this language:

N= "On input where $\mathrm{φ}$ a Boolean formula in CNF"

If$\mathrm{φ}${ don't consists a unit clause} assume every literals.

Repetition performed until these exists no new $(~x)$unit clause:

If an empty clause is existing inrole="math" localid="1663228645556" $\mathrm{φ}$ reject.

Dependability can be viewed as:

Consider that ${\text{CNF}}_2∈\text{P}$.

Consider one more situation of $\mathrm{Ï•}$that will be belonging to some other variable.

Consider another situation ${\text{CNF}}_3∈\text{P}$.

Consider first situation of $\mathrm{Ï•}$and consider it belongs to some p and if there is any$p$ then reject. Consider one more situation of $\mathrm{Ï•}$that will be belonging to some other variable, let's say $q$and$r$ here situation will rejected if there is any$-q$ otherwise accepted.

Similarly, this situation will be held true for$CN{F}_H∈P$ .