An upper bound of 4.268 for the random 3-SAT satisfiability threshold

Fedor Vorobyev

We prove that a random 3-SAT formula with $n$ variables and $\lfloor 4.268n\rfloor$ clauses is unsatisfiable with high probability. The satisfiability threshold has attracted consi…