SemanticVerifier uses proof by refutation over first-order logic axioms:
$$ \Gamma \land \neg \phi $$
- Unsatisfiable (
unsat): Property $\phi$ is mathematically proven. - Satisfiable (
sat): A counter-example model violates the constraint.
SemanticVerifier uses proof by refutation over first-order logic axioms:
$$ \Gamma \land \neg \phi $$
unsat): Property $\phi$ is mathematically proven.sat): A counter-example model violates the constraint.