Idea: More optimizations at compile time

[pvdz]

I've already started with this avenue but there's probably more fruit to be picked. Certain inputs can be immediately determined to be solved or rejected. Others can at least be reduced in complexity. For example; sum([0, 1], 'x') is the same as sum([1], 'x'), which is the same as eq('x', 1) which means you can eliminate the constraint entirely and set 'x' to 1 if it contains 1, or empty if it doesn't contain 1.

This type of optimization happens already and more can still be found. Simplifying the input can save a lot at runtime and the overhead is only executed once, opposed to many times while searching.