$\phi$ is a $m$-clause CNF formula. Prove that if $m< 8$, then there is at least 1 satisfying assignment for $\phi$.

Question

$\phi$ is a 3SAT CNF formula. All variables in each clause of $\phi$ are distinct. The expected number of satisfied clauses under the uniform random assignment is given as $\frac{7m}{8}$. A satisfying assignment of the CNF means that all $m$ clauses must be true. (A CNF is defined as a conjunction of disjunction of literals.)

We know that if $m < 8$, then that means $E(X) < 7$. I don't understand how this suggests the existence of at least one satisfying assignment.

Hints will be appreciated, thank you!

Answer 1

The idea here is that if there are no satisfying assignments then $X$ can never be more than $m-1,$ and so we must have $E(X)\leq m-1$. When is that true?

Answer 2

HINT

The hardest version of a $7$ clause 3SAT problem would be when all clauses refer to the same $3$ variables. Now, with $3$ variables, how many possible truth-assignments are there?