Encoded problems in to a propositional logic satisfiability problem which z3 can solve.
The problem to color graph vertices such that no adjacent two vertices have the same color.
The problem, when sets of teachers and subjects are given and each teacher can teach a certain subset of subjects, deciding if only k teachers can cover all the subjects.