You have n events. Each event can be in slot or slot . Some pairs conflict in slot , others conflict in slot , some conflict in both slots. Model: x_i is true if event i is in slot . Conflicts give you clauses based on which slots they conflict in.
Implement -SAT to find a valid schedule or report impossible. This is a practical scheduling application. Test with different conflict patterns to understand the algorithm's behavior and when solutions exist.