Benchmark

non-incremental/QF_NIA/20230328-sqrtmodinv-hoenicke/sqrtStep1a.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
Size1071
Compressed Size556
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 None
Size 1063
Compressed Size543
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 or1 and2 =1
div3 +4 *7 <1
<=4 >=2

Evaluations

Evaluation Rating Solver Variant Result Wallclock CPU Time
SMT-COMP 2024 0.75 (1/4) cvc5 cvc5 unknown ❌ 1201.72540 1200.68182
SMTInterpol SMTInterpol unknown ❌ 0.41675 0.42514
Yices2 Yices2 unknown ❌ 1201.21565 1201.04904
Z3alpha Z3-alpha unsat ✅ 0.28952 0.18698