The SAT Competitions constitute a well-established series of yearly open international algorithm implementation competitions, focusing on the Boolean satisfiability (or propositional satisfiability, SAT) problem. In this article, we provide a detailed account on the 2020 instantiation of the SAT Competition, including the new competition tracks and benchmark selection procedures, overview of solving strategies implemented in top-performing solvers, and a detailed analysis of the empirical data obtained from running the competition.

中文翻译：

---

2020 年 SAT 竞赛

SAT 竞赛构成了一系列完善的年度公开国际算法实现竞赛，重点关注布尔可满足性（或命题可满足性，SAT）问题。在本文中，我们详细介绍了 2020 年 SAT 竞赛的实例化，包括新的竞赛轨道和基准选择程序，在表现最佳的求解器中实施的求解策略概述，以及对从运行中获得的经验数据的详细分析比赛。