Benchmark
non-incremental/QF_UFNRA/20230328-sqrtmodinv-hoenicke/modInvInitial.smt2
This is a relaxed variant of the benchmark in QF_NIA.
This checks the validity of a line in computing the inverse of
denominator mod 2^256. The code is:
assume (denominator mod 2) == 1
inv1 = (3 * denominator) xor 2
assert (denominator * inv2) mod 16 = 1
| Benchmark |
|---|
| Size | 3086 |
| Compressed Size | 885 |
| License |
Creative Commons Attribution 4.0 International
(CC-BY-4.0)
|
| Category | crafted |
| First Occurrence | 2023-07-06 |
| Generated By | Jochen Hoenicke |
| Generated On | 2023-01-19 00:00:00 |
| Generator | — |
| Dolmen OK | 1 |
| strict Dolmen OK | 1 |
| check-sat calls | 1 |
| Status | sat |
| Inferred Status | sat |
| Size | 3078 |
| Compressed Size | 889 |
| Max. Term Depth | 7 |
| Asserts | 23 |
| Declared Functions | 1 |
| Declared Constants | 3 |
| Declared Sorts | 0 |
| Defined Functions | 4 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
Bool | 3 |
ite | 3 |
not | 1 |
or | 2 |
and | 7 |
=> | 3 |
= | 9 |
Real | 1 |
/ | 7 |
+ | 12 |
- | 11 |
* | 12 |
< | 4 |
<= | 3 |
> | 2 |
>= | 5 |
Evaluations
| Evaluation |
Rating |
Solver |
Variant |
Result |
Wallclock |
CPU Time |
|
SMT-COMP 2023
|
0.25 (3/4) |
CVC4 |
CVC4-sq-final_default |
sat ✅
|
0.03631
|
0.03658
|
| |
cvc5 |
cvc5-default-2023-05-16-ea045f305_sq |
sat ✅
|
0.04371
|
0.04435
|
| |
SMTInterpol |
smtinterpol-2.5-1272-g2d6d356c_default |
unknown ❌
|
0.38112
|
0.56903
|
| |
Yices2 |
Yices 2 for SMTCOMP 2023_default |
sat ✅
|
0.01214
|
0.01209
|
|
SMT-COMP 2024
|
0.33 (2/3) |
cvc5 |
cvc5 |
sat ✅
|
0.23478
|
0.13430
|
| |
SMTInterpol |
SMTInterpol |
unknown ❌
|
0.44552
|
0.55177
|
| |
Yices2 |
Yices2 |
sat ✅
|
0.23880
|
0.13860
|
|
SMT-COMP 2025
|
0.33 (2/3) |
cvc5 |
cvc5 |
sat ✅
|
0.27536
|
0.15945
|
| |
SMTInterpol |
SMTInterpol |
unknown ❌
|
0.49175
|
0.56625
|
| |
Yices2 |
Yices2 |
sat ✅
|
0.25211
|
0.13428
|