Benchmark

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

This checks the validity of the newton-raphson step that computes
the square root from an initial approximation:

  assume abs(x - (res * res)) <= oldeps
  res = (res + (x / res)) / 2
  assert abs(x - (res * res)) <= neweps

where neweps depends on oldeps.  It also considers rounding errors
correctly.
Benchmark
Size1163
Compressed Size575
License Creative Commons Attribution 4.0 International (CC-BY-4.0)
Categorycrafted
First Occurrence2023-07-06
Generated ByJochen Hoenicke
Generated On2023-03-28 00:00:00
GeneratorHandwritten
Dolmen OK1
strict Dolmen OK1
check-sat calls1
Query 1
Status unsat
Inferred Status unsat
Size 1155
Compressed Size568
Max. Term Depth6
Asserts 5
Declared Functions0
Declared Constants3
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not1 or2 and2 =1
div4 +7 *8 <2
<=4 >=2

Evaluations

Evaluation Rating Solver Variant Result Wallclock CPU Time
SMT-COMP 2025 0.60 (2/5) cvc5 cvc5 unknown ❌ 1201.75181 1200.97364
SMTInterpol SMTInterpol unknown ❌ 0.46323 0.43143
Yices2 Yices2 unknown ❌ 1201.32553 1201.08513
Z3alpha Z3-alpha unsat ✅ 0.42340 0.35111
Z3 Z3-alpha-base unsat ✅ 0.31404 0.19794
z3siri-base unsat ✅ 0.30703 0.18610