Benchmark

non-incremental/QF_NIA/20230328-sqrtmodinv-hoenicke/modInvVar1.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
Size1002
Compressed Size522
License Creative Commons Attribution 4.0 International (CC-BY-4.0)
Categorycrafted
First Occurrence2023-07-06
Generated ByJochen Hoenicke
Generated On2023-01-19 00:00:00
GeneratorHandwritten
Dolmen OK1
strict Dolmen OK1
check-sat calls1
Query 1
Status unsat
Inferred Status None
Size 994
Compressed Size514
Max. Term Depth4
Asserts 4
Declared Functions0
Declared Constants5
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not1 =3 mod1 +1
-1 *6 >1

Evaluations

Evaluation Rating Solver Variant Result Wallclock CPU Time
SMT-COMP 2023 1.00 (0/5) cvc5 cvc5-default-2023-05-16-ea045f305_sq unknown ❌ 1200.02000 1197.16000
Yices2 Yices 2 for SMTCOMP 2023_default unknown ❌ 1200.02000 1199.96000
Yices-ismt yices-ismt-sq-0526_default unknown ❌ 318.92000 318.84000
Z3alpha z3alpha_default unknown ❌ 1200.02000 1199.82000
Z3++ z3++0715_default unknown ❌ 203.05800 203.03300
Z3++_sq_0526_default unknown ❌ 1200.11000 1199.95000
SMT-COMP 2025 1.00 (0/5) cvc5 cvc5 unknown ❌ 1201.75287 1201.00770
SMTInterpol SMTInterpol unknown ❌ 0.41042 0.38623
Yices2 Yices2 unknown ❌ 1201.36566 1201.08052
Z3alpha Z3-alpha unknown ❌ 1201.77037 3602.19047
Z3 Z3-alpha-base unknown ❌ 1201.25368 1201.03266
z3siri-base unknown ❌ 1201.28791 1201.04609