Benchmark

non-incremental/QF_NIA/20230328-sqrtmodinv-hoenicke/sqrtStep7a.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
Size1230
Compressed Size638
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 1222
Compressed Size632
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 +9 *6 <2
<=4 >=2

Evaluations

Evaluation Rating Solver Variant Result Wallclock CPU Time
SMT-COMP 2023 0.60 (2/5) cvc5 cvc5-default-2023-05-16-ea045f305_sq unknown ❌ 1200.13000 1198.05000
Yices2 Yices 2 for SMTCOMP 2023_default unknown ❌ 1200.03000 1200.01000
Yices-ismt yices-ismt-sq-0526_default unknown ❌ 1200.02000 1199.78000
Z3alpha z3alpha_default unsat ✅ 166.61200 166.58700
Z3++ z3++0715_default unsat ✅ 11.26050 11.26030
Z3++_sq_0526_default unsat ✅ 10.66500 10.66350