[K-Improvement] Add `preserves-definedness` attribute for semantic rules

@ehildenb suggested a while ago we try https://github.com/runtimeverification/haskell-backend/issues/3175, and after the discussion here it looks like it's the way to go, especially for semantics which contain large maps/sets.

I think we need to do the following:

• Frontend: add a preserves-definedness attribute for semantic rules.
• Backend: add kore-rule-definedness which computes #Ceil(RHS) without any of the conditions present in #Ceil(LHS) (which has to be computed as well).
• Frontend: integrate kore-rule-definedness into kompile
• Backend: check definedness of the first configuration, after that if a configuration comes from the application of a definedness preserving rule, then #Ceil(term) (and of all of its subterms) can be simplified to #Top.

I've been thinking what the best way to integrate kore-rule-definedness and the frontend would be, and I think that kore-rule-definedness should be part of the kore-rpc-server. The reason is that this way we can avoid having to re-load the definition in the backend every call. kompile could spawn a kore server and run the command for every rule in definition, and add the appropriate information to each rule. Thoughts?

Start by reading the existing discussion and the issue's proposed kore-rpc-server and kompile integration. Trace how semantic rules are handled in the frontend and backend, then determine how kore-rule-definedness should be computed and consumed. Done means the preserves-definedness attribute, rule-definedness computation, kompile integration, and backend simplification behavior all work together.