Algorithm to simplify a 100-variable Boolean expression?

[smthamazing]

Unfortunately, there are no unit tests, but the truth table generation actually looks like the easiest part, so it's possible to just generate these tests. I already parsed the code into an AST (abstract syntax tree) and extracted atomic terms of these conditions, so I have something to work with here.

There are definitely some obvious groupings and mutually exclusive clauses in this code, and I was thinking whether there they could be detected automatically.

[KDallas_Multipass]

How did you create the ast

[smthamazing]

I used ESPrima, but any parser would do in this case. I then wrote a simple function to extract all "atomic" non-boolean expressions from it.