Benchmark

non-incremental/QF_UFNRA/20230328-sqrtmodinv-hoenicke/modInvVar1.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 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
Size2583
Compressed Size856
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
Generator
Dolmen OK1
strict Dolmen OK1
check-sat calls1
Query 1
Status sat
Inferred Status sat
Size 2575
Compressed Size868
Max. Term Depth7
Asserts 15
Declared Functions1
Declared Constants5
Declared Sorts 0
Defined Functions4
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

Bool3 ite3 not1 or2
and7 =>3 =8 Real1
/2 +4 -9 *31
<4 <=3 >2 >=6

Evaluations

Evaluation Rating Solver Variant Result Wallclock CPU Time
SMT-COMP 2023 0.50 (2/4) CVC4 CVC4-sq-final_default unknown ❌ 1200.11000 1199.77000
cvc5 cvc5-default-2023-05-16-ea045f305_sq sat ✅ 0.23720 0.23778
SMTInterpol smtinterpol-2.5-1272-g2d6d356c_default unknown ❌ 0.35019 0.49841
Yices2 Yices 2 for SMTCOMP 2023_default sat ✅ 0.01400 0.01395
SMT-COMP 2024 0.33 (2/3) cvc5 cvc5 sat ✅ 0.80603 0.70645
SMTInterpol SMTInterpol unknown ❌ 0.44236 0.49631
Yices2 Yices2 sat ✅ 0.25564 0.15436
SMT-COMP 2025 0.33 (2/3) cvc5 cvc5 sat ✅ 0.52986 0.41098
SMTInterpol SMTInterpol unknown ❌ 0.48621 0.53844
Yices2 Yices2 sat ✅ 0.29330 0.16787