New binary `haskell-kompile` for doing compile-time optimizations

Requirements:

• Kore -> Kore transformation, works in both text form and binary form. The reason is so that LLVM backend can benefit from these optimizations too.
• Does the existing kompile-time validation that kore-parse does (replace all calls into haskell backend at kompile time with call to this binary).
• Implement the same simple algorithm for preserves-definedness that is implemented here (no fancy #Ceil simplification): https://github.com/runtimeverification/k/pull/2963

From the other duplicate issue:

We need to keep in mind the future requirement of exposing a Kore compilation tool which will implement several optimization passes over the kompiled definition.

Definition processing which will be moved to this tool:

• parsing
• syntactical validation
• semantic validation (like sort checking, application argument count etc.)
• rule optimizations (adding the preserves-definedness attribute, rule indexing, static function expansion, etc.)

For now, we need to make sure that the processing described above isn't tightly coupled with the symbolic execution API we're building.

Start by reviewing the existing kompile-time validation performed by kore-parse and the simple preserves-definedness algorithm in PR 2963. The work is complete when a separate haskell-kompile binary performs the described Kore transformations in text and binary form without coupling them to the symbolic execution API.