<p>This is an extended comment to complement Ryan's answer, which deals with the thresholds where the number of clauses becomes large enough that the instance is <em>almost surely</em> unsatisfiable.
One can also compute the much larger thresholds where the number of clauses <em>forces</em> unsatisfiability when it exceeds a function of $n$.</p>

<p>Note that some technical issues need to be addressed.
If repeated clauses are counted in $m$, then $m$ can be made as large as desired without changing $n$.
This would destroy most relationships between $m$ and $n$.
So assume that $m$ is the number of distinct clauses.
We need to decide on another detail, whether instances are encoded so that order of literals within a clause or order of clauses within an instance matter.
Suppose this is not important, so two instances are regarded as equivalent if they contain the same clauses, and two clauses are equivalent if they contain the same literals.
With these assumptions we can now bound the number of distinct clauses that can be expressed with $n$ variables.
Each clause can have each variable occurring positively or negatively, or not at all, and then $m\le 3^n$.</p>

<p>First consider SAT without a restriction on $k$.
What is the largest $m$ such that the instance is satisfiable?
Without loss of generality we can suppose that the all-zero assignment is a solution.
There are then $3^n-2^n$ different clauses consistent with this solution, each containing at least one negated literal.
Hence $m\le 3^n-2^n$ for any satisfiable instance.
The instance consisting of all clauses that each contain at least one negated literal has this many clauses, and is satisfied by the all-zero assignment.
Further, by the pigeonhole principle any instance with at least $3^n-2^n+1$ clauses is unsatisfiable.</p>

<p>This yields $2^{3^n-2^n}$ different subsets of such clauses, each representing a distinct instance which is satisfied by some assignment.  In comparison, the total number of different instances is $2^{3^n}$.</p>

<p>Now modifying the above for instances in which each clause has at most $k$ literals, there are $\sum_{i=0}^k \binom{n}{i}2^i$ distinct such clauses, and $\sum_{i=0}^k \binom{n}{i}$ clauses in which there are no negative literals, so $m\le \sum_{i=0}^k \binom{n}{i}(2^i - 1)$ for satisfiable instances, and any larger $m$ is unsatisfiable.
There are then $2^{\sum_{i=0}^k \binom{n}{i}(2^i - 1)}$ instances satisfied by any particular assignment, out of the total of $2^{\sum_{i=0}^k \binom{n}{i}2^i}$ $k$-SAT instances.</p>

CC BY-SA 3.0
2016-04-18T21:34:40.440Z
I also produced the same result back in  2008 ish. There are also complimentary functions for literals and variables such that if you assume no repetition of literals, variables or clauses then if more than x many or y many literals or variables occurs respectively then the given instance is not satisfiable. I would have to dig to find those two functions. +1
Tayfun Pay
CC BY-SA 3.0
2016-04-18T13:13:11.893Z
2016-04-18T13:13:11.893Z
András Salamon
<p>The answer depends on $k$, $m$, and $n$. Exact counts are generally not known, but there is a "threshold" phenomenon that for most settings of $k$, $m$, $n$, either nearly all $k$-SAT instances are satisfiable, or nearly all instances are unsatisfiable. For example, when $k=3$, it has been empirically observed that when $m &lt; 4.27 n$, all but a $o(1)$ fraction of 3-SAT instances are satisfiable, and when $m &gt; 4.27n$, all but a $o(1)$ fraction are unsatisfiable. (There are also rigorous proofs of bounds known.) </p>

<p>One starting point is <a href="http://citeseer.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.9230">"The Asymptotic Order of the k-SAT Threshold"</a>. </p>

<p><a href="http://www.uni-frankfurt.de/52107833">Amin Coja-Oghlan</a> has also done <a href="https://scholar.google.ca/citations?user=1SdgKVAAAAAJ">a lot of work</a> on these satisfiability threshold problems.</p>

CC BY-SA 3.0
2011-11-20T00:52:59.837Z
2016-04-18T00:49:49.797Z
2016-04-18T00:49:49.797Z
Ryan Williams
<p>Given $m, n, k$, how many of $k$-DNFs with $n$ variables and $m$ clauses are tautology? (or how many $k$-CNFs are unsatisfiable?)</p>

CC BY-SA 3.0
2011-11-19T09:34:37.853Z
A bit of motivation would help us believe that this is not just a random question.
Andrej Bauer
CC BY-SA 3.0
2013-10-22T22:50:41.227Z
@AndrejBauer: I was reading about SAT solvers and their performance.
Anonymous
<co.combinatorics><lo.logic><sat>
How many tautologies are there?
Anonymous
# How many tautologies are there?

(Asked by: username_0 on 2011-11-19)

Given $m, n, k$, how many of $k$-DNFs with $n$ variables and $m$ clauses are tautology? (or how many $k$-CNFs are unsatisfiable?)

**Tags:** co.combinatorics, lo.logic, sat

> **Comments:**
> **username_1**: A bit of motivation would help us believe that this is not just a random question.  
> **username_0**: @AndrejBauer: I was reading about SAT solvers and their performance.  

---

## 2 answers

### Answer by username_4 on 2011-11-20. Score: 30 | Accepted answer

The answer depends on $k$, $m$, and $n$. Exact counts are generally not known, but there is a "threshold" phenomenon that for most settings of $k$, $m$, $n$, either nearly all $k$-SAT instances are satisfiable, or nearly all instances are unsatisfiable. For example, when $k=3$, it has been empirically observed that when $m < 4.27 n$, all but a $o(1)$ fraction of 3-SAT instances are satisfiable, and when $m > 4.27n$, all but a $o(1)$ fraction are unsatisfiable. (There are also rigorous proofs of bounds known.)

One starting point is ["The Asymptotic Order of the k-SAT Threshold"](http://citeseer.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.9230).

[Amin Coja-Oghlan](http://www.uni-frankfurt.de/52107833) has also done [a lot of work](https://scholar.google.ca/citations?user=1SdgKVAAAAAJ) on these satisfiability threshold problems.


---

### Answer by username_2 on 2016-04-18. Score: 6

This is an extended comment to complement Ryan's answer, which deals with the thresholds where the number of clauses becomes large enough that the instance is *almost surely* unsatisfiable.
One can also compute the much larger thresholds where the number of clauses *forces* unsatisfiability when it exceeds a function of $n$.

Note that some technical issues need to be addressed.
If repeated clauses are counted in $m$, then $m$ can be made as large as desired without changing $n$.
This would destroy most relationships between $m$ and $n$.
So assume that $m$ is the number of distinct clauses.
We need to decide on another detail, whether instances are encoded so that order of literals within a clause or order of clauses within an instance matter.
Suppose this is not important, so two instances are regarded as equivalent if they contain the same clauses, and two clauses are equivalent if they contain the same literals.
With these assumptions we can now bound the number of distinct clauses that can be expressed with $n$ variables.
Each clause can have each variable occurring positively or negatively, or not at all, and then $m\le 3^n$.

First consider SAT without a restriction on $k$.
What is the largest $m$ such that the instance is satisfiable?
Without loss of generality we can suppose that the all-zero assignment is a solution.
There are then $3^n-2^n$ different clauses consistent with this solution, each containing at least one negated literal.
Hence $m\le 3^n-2^n$ for any satisfiable instance.
The instance consisting of all clauses that each contain at least one negated literal has this many clauses, and is satisfied by the all-zero assignment.
Further, by the pigeonhole principle any instance with at least $3^n-2^n+1$ clauses is unsatisfiable.

This yields $2^{3^n-2^n}$ different subsets of such clauses, each representing a distinct instance which is satisfied by some assignment. In comparison, the total number of different instances is $2^{3^n}$.

Now modifying the above for instances in which each clause has at most $k$ literals, there are $\sum\_{i=0}^k \binom{n}{i}2^i$ distinct such clauses, and $\sum\_{i=0}^k \binom{n}{i}$ clauses in which there are no negative literals, so $m\le \sum\_{i=0}^k \binom{n}{i}(2^i - 1)$ for satisfiable instances, and any larger $m$ is unsatisfiable.
There are then $2^{\sum\_{i=0}^k \binom{n}{i}(2^i - 1)}$ instances satisfied by any particular assignment, out of the total of $2^{\sum\_{i=0}^k \binom{n}{i}2^i}$ $k$-SAT instances.

> **Comments:**
> **username_3**: I also produced the same result back in  2008 ish. There are also complimentary functions for literals and variables such that if you assume no repetition of literals, variables or clauses then if more than x many or y many literals or variables occurs respectively then the given instance is not satisfiable. I would have to dig to find those two functions. +1  

---

