Benchmark

non-incremental/QF_UFNRA/20230328-sqrtmodinv-hoenicke/modInvStep.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
Size	2962
Compressed Size	883
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

Query 1

Status	sat
Inferred Status	sat
Size	2954
Compressed Size	889
Max. Term Depth	7
Asserts	19
Declared Functions	1
Declared Constants	5
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	=	8	Real	1
/	2	+	3	-	10	*	36
<	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.03000	1199.71000
		cvc5	cvc5-default-2023-05-16-ea045f305_sq	sat ✅	0.45875	0.45927
		SMTInterpol	smtinterpol-2.5-1272-g2d6d356c_default	unknown ❌	0.38759	0.51380
		Yices2	Yices 2 for SMTCOMP 2023_default	sat ✅	0.03107	0.03105
SMT-COMP 2024	0.33 (2/3)	cvc5	cvc5	sat ✅	0.27665	0.17677
		SMTInterpol	SMTInterpol	unknown ❌	0.51680	0.62530
		Yices2	Yices2	sat ✅	0.23412	0.13402
SMT-COMP 2025	0.33 (2/3)	cvc5	cvc5	sat ✅	0.47957	0.36295
		SMTInterpol	SMTInterpol	unknown ❌	0.50248	0.56968
		Yices2	Yices2	sat ✅	0.28721	0.16591