Benchmark

non-incremental/QF_NIA/20230328-sqrtmodinv-hoenicke/modInvInitial.smt2

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
Size824
Compressed Size444
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 816
Compressed Size442
Max. Term Depth4
Asserts 4
Declared Functions0
Declared Constants3
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not1 =4 div1 mod3
+2 *3

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.01000 1188.43000
Yices2 Yices 2 for SMTCOMP 2023_default unknown ❌ 1200.02000 1200.00000
Yices-ismt yices-ismt-sq-0526_default unknown ❌ 1199.62000 1199.52000
Z3alpha z3alpha_default unknown ❌ 1200.02000 1199.85000
Z3++ z3++0715_default unknown ❌ 200.05500 200.03400
Z3++_sq_0526_default unknown ❌ 1200.11000 1199.98000
SMT-COMP 2025 1.00 (0/5) cvc5 cvc5 unknown ❌ 1201.74827 1200.99034
SMTInterpol SMTInterpol unknown ❌ 0.43865 0.41586
Yices2 Yices2 unknown ❌ 1201.35453 1200.96889
Z3alpha Z3-alpha unknown ❌ 1201.39313 3602.21927
Z3 Z3-alpha-base unknown ❌ 1201.25759 1200.98566
z3siri-base unknown ❌ 1201.25064 1201.04031