mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-06-22 22:03:39 +00:00
Code Activity

Typo Fixes (#6803)

Browse source
This commit is contained in:
THE Spellchecker 2023-07-09 14:56:10 -04:00 • committed by GitHub
parent 28a0c2d18f
commit dc0887db5a
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
43 changed files with 1811 additions and 1811 deletions
Download patch file Download diff file Expand all files Collapse all files

2
src/ackermannization/ackermannize_bv_tactic.h
View file

@ -22,7 +22,7 @@ A tactic for performing Ackermann reduction for bit-vector formulas
### Long Description
The Ackermann reduction replaces uninterpreted functions $f(t_1), f(t_2)$
by fresh variables $f_1, f_2$ and addes axioms $t_1 \simeq t_2 \implies f_1 \simeq f_2$.
by fresh variables $f_1, f_2$ and adds axioms $t_1 \simeq t_2 \implies f_1 \simeq f_2$.
The reduction has the effect of eliminating uninterpreted functions. When the reduction
produces a pure bit-vector benchmark, it allows Z3 to use a specialized SAT solver.

2
src/ackermannization/ackr_info.h
View file

@ -23,7 +23,7 @@ Revision History:
/** \brief
Information about how a formula is being converted into
a formula without uninterpreted function symbols via ackermannization.
a formula without uninterpreted function symbols via ackermannization.
The intended use is that new terms are added via set_abstr.
Once all terms are abstracted, call seal.