We propose ImitSAT, a branching policy for conflict-driven clause learning (CDCL) solvers based on imitation learning for the Boolean satisfiability problem (SAT). Unlike previous methods that predict ...

Loom and synth both verify their transformations with an SMT solver, and both pay for it in build pain: statically linking Z3 is a recurring source of toolchain friction (header discovery, ...