TITLE: What are some theorems that currently only have computer-assisted proofs?
QUESTION [41 upvotes]: What are some theorems that currently only have computer-assisted proofs? For example, there's the four colour theorem.
I am very curious about this and would like to generate a list.

REPLY [4 votes]: The evaluation of the Ramsey number R(4,5)=25 by Brendan D. McKay and Stanisław P. Radziszkowski. In human language: the complete graph on $25$ vertices is the smallest complete graph with the property that, if each edge is colored blue or red, there will either be a complete subgraph on $4$ vertices whose edges are all blue, or else there will be a complete subgraph on $5$ vertices whose edges are all red.