PV4 ⊧ Z3produces a satisfiability result for a formula
Application domain/field
- SMT (Satisfiability Modulo Theories)
- SMT solving
Type of tool
SMT solverExpected input
SMT formulaFormat:
SMT-LIB v2 format There are bindings for .NET, C, C++, Java, OCaml, Python, Julia and Web AssemblyExpected output
sat
, unsat
or unknown