Field of Research
The Scalable Automated Reasoning group aims to push the frontiers of automated reasoning by advancing the essential tools at its core, with a distinct focus on scalable parallel and distributed computing.
SAT Solving At Scale

The NP-complete propositional satisfiability (SAT) problem is an essential building block at the core of automated reasoning and Symbolic AI, and, in a sense, the canonical "difficult problem" of computer science. Due to the expressivity and genericity of the problem, SAT solvers have become crucial tools for a surprising variety of academic and industrial applications. As such, advancing scalable SAT solving methods bears immense potential for simultaneously advancing a plethora of important disciplines from computer science and real-world applications. Our research allows to efficiently exploit parallel and distributed computational environments, such as supercomuters and clouds, for SAT solving and related tools of automated reasoning.
Correctness Guarantees via Proofs

Our research transfers the concept of proofs of unsatisfiability to distributed solvers in a scalable manner. Such proofs are able to grant full confidence in a claimed result, since they can be independently validated by checker programs that are formally verified down to the machine code level. Parallel and distributed SAT solvers solvers have long been considered much less trustworthy than their sequential counterparts, and rightfully so – due to more complex technology stacks, less comprehensive testing, and no realistic ways to produce proofs. Our latest works enable users to exploit large-scale SAT solving for some of the most safety– or security-critical tasks that arise from applications.
The Mallob System

Mallob (Malleable Load Balancer, or Massively Parallel Logic Backend) is a distributed platform for processing automated reasoning tasks (primarily SAT instances) in modern large-scale HPC and cloud environments. Mallob's flexible and decentralized approach to job scheduling allows to concurrently process many tasks of varying priority by different users. As such, Mallob can drastically improve your academic or industrial workflows tied to automated reasoning. Mallob's tightly integrated distributed general-purpose SAT solving engine, MallobSat, has received a large amount of attention, including five gold medals of the International SAT Competition's Cloud Track in a row. Read more
Find further information on our research page.
News
SAtRes accredited as KIT Junior Research Group
January 23, 2026
KIT’s Council for Research and Promotion of Young Scientists formally recognizes the scientific and financial independence of our group.
Read more
TACAS'26: Incremental Proof Checking & SMT At Scale
January 7, 2026
Two of our works have been accepted for publication at the 2026 TACAS conference.
Read more
DFG Project on Proofs as Big Data
November 25, 2025
We have successfully acquired funding from the German Research Foundation (DFG) for our research project “Propositional Proofs as Big Data” (DFG-Einzelantrag).
Read more
MallobSat scores 1st in SAT Competition
August 20, 2025
Our latest, simplified version of MallobSat was the best performing parallel solver in the International SAT Competition 2025.
Read more
SAT'25 Best Paper Award
August 14, 2025
Our publication “Streamlining Distributed SAT Solver Design” has been recognized with the SAT conference’s Best Paper Award.
Read more
Mallob 2.0: MIT Release
July 31, 2025
Today’s major release of Mallob (2.0) offers an MIT license and features the latest & greatest in large-scale (incremental) SAT solving and proof technology.
Read more