Verification of some Boolean partial polymorphisms

This dataset contains the formal verification that a certain partial ternary Boolean conjunction f preserves two specific Boolean relations, but does not preserve two other ones. Our approach is by translating the question into Boolean satisfiability problems and to implement these such that they can be treated by a sat solver being capable of reading SMT-LIB2.0 specifications. Specifically, we have been using the Z3 solver developed by Microsoft Research (https://github.com/z3prover/z3) to attack the problem.