Verification of Boolean Partial Polymorphisms Using Z3

Mike Behrisch from TU Wien created this dataset containing formal verification proofs for a partial ternary Boolean conjunction. The verification approach translates the problem into Boolean satisfiability problems specified in SMT-LIB2.0 and solved using the Z3 solver from Microsoft Research. The dataset includes SMT-LIB2.0 implementation files, solver outputs, and formal proof documents.

Use Cases

• Validate formal proofs for partial polymorphism preservation based on the described SMT-LIB2.0 specifications.
• Benchmark SAT/SMT solver performance on specific Boolean constraint problems.
• Study the translation of algebraic logic problems into satisfiability problems as detailed in the included PDF.

Strengths

• Includes formal proof documents generated by the Z3 solver.
• Provides a detailed problem description in a PDF file.
• Contains the original SMT-LIB2.0 source code for reproducibility.

Limitations

• Description metadata is limited; actual data quality requires manual inspection after download.
• Row count and data scale are unknown, which may limit suitability assessment.
• Column-level documentation is absent; field semantics must be inferred from the provided PDF.

Provenance

Source

Mike Behrisch, TU Wien

Collection Method

Formal verification via translation to Boolean satisfiability problems solved by the Z3 solver.