Benchmark
non-incremental/QF_NIA/20230328-sqrtmodinv-hoenicke/modInvStep.smt2
This checks the validity of a line in computing the inverse of
denominator mod 2^256. The code is:
assume s > 1 && (denominator * inv1) mod s = 1
inv2 = inv1 * (2 - denominator * inv1)
assert (* denominator * inv2) mod (s * s) = 1
See mulInvStepSimplified.smt2 for the reason why this benchmark is unsat.
| Benchmark |
|---|
| Size | 960 |
| Compressed Size | 496 |
| 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 | Handwritten |
| Dolmen OK | 1 |
| strict Dolmen OK | 1 |
| check-sat calls | 1 |
| Status | unsat |
| Inferred Status | None |
| Size | 953 |
| Compressed Size | 490 |
| Max. Term Depth | 4 |
| Asserts | 4 |
| Declared Functions | 0 |
| Declared Constants | 5 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
Evaluations
| Evaluation |
Rating |
Solver |
Variant |
Result |
Wallclock |
CPU Time |
|
SMT-COMP 2025
|
1.00 (0/5) |
cvc5 |
cvc5 |
unknown ❌
|
1201.78892
|
1201.06024
|
| |
SMTInterpol |
SMTInterpol |
unknown ❌
|
0.41749
|
0.39781
|
| |
Yices2 |
Yices2 |
unknown ❌
|
1201.32697
|
1201.02704
|
| |
Z3alpha |
Z3-alpha |
unknown ❌
|
1201.75884
|
3602.09790
|
| |
Z3 |
Z3-alpha-base |
unknown ❌
|
1201.25502
|
1201.06040
|
| |
|
z3siri-base |
unknown ❌
|
1201.26826
|
1201.06436
|