Mate Soos, Armin Biere,
"CryptoMiniSat 5.6 with YalSAT at the SAT Race 2019"
, in Marijn Heule, Matti Järvisalo, Martin Suda: Proc. of SAT Race 2019 - Solver and Benchmark Descriptions, Vol. B-2019-1, Department of Computer Science Series of Publications B, University of Helsinki, Seite(n) 14-15, 2019
CryptoMiniSat 5.6 with YalSAT at the SAT Race 2019
Sprache des Titels:
Proc. of SAT Race 2019 - Solver and Benchmark Descriptions
This paper presents the con?ict-driven clause-learning (CLDL) SAT solver CryptoMiniSat v5.6 (CMS) augmented with the Stochastic Local Search (SLS)  solver YalSAT 03v as submitted to SAT Race 2019. CryptoMiniSat aims to be a modern, open source SAT solver using inprocessing techniques, optimized data structures and ?nely-tuned timeouts to have good control over both memory and time usage of inprocessing steps. It also supports, when compiled as such, to recover XOR constraints and perform Gauss-Jordan elimination on them at every decision level. For the competition, this option was disabled. CryptoMiniSat is authored by Mate Soos. Yet Another Local Search SAT Solver (YalSAT) implements several variants of ProbSAT?s  algorithm and recent extensions . These variants are selected randomly at restarts, scheduled by a reluctant doubling scheme (Luby). For further details, see . YalSAT is authored by Armin Biere.
Sprache der Kurzfassung:
Department of Computer Science Series of Publications B