Is there a ready-made library or algorithm for turning an if statement into a CNF formula?

Question

Algorithms

Good day!
The SAT solver needs formulas in CNF format, i.e.:

(a | b | c) &
(a | !d ) &
(a | !c )

those. we can use only "and" "or" "not", and in each line there are OR variables, and each line is combined as AND, well, only a variable can be negated.
How can I convert these conditions:
if ( (a && b && c) || (c && d && f) || )
You need either an algorithm, or ideally a ready-made library, please tell me.

Answer 1

Well actually algorithm directly in Wikipedia is described.
If there are not very many terms, you can try to apply the Quine-McCluskey method . Thus, you will kill two birds with one stone - you will get not just CNF, but the minimum CNF.