mirror of
https://github.com/c-cube/sidekick.git
synced 2026-01-23 18:06:41 -05:00
7bead748a6
SAT proofs are part of bigger proofs, now. And we expect them to work on the literals of CDCL(T) directly, bypassing the low level boolean atoms
10 lines
338 B
Text
10 lines
338 B
Text
|
|
(library
|
|
(name sidekick_sat)
|
|
(public_name sidekick.sat)
|
|
(libraries iter sidekick.util sidekick.core)
|
|
(synopsis "Pure OCaml SAT solver implementation for sidekick")
|
|
(flags :standard -warn-error -a+8 -open Sidekick_util)
|
|
(ocamlopt_flags :standard -O3 -bin-annot
|
|
-unbox-closures -unbox-closures-factor 20)
|
|
)
|