Benchmark

non-incremental/UFNIA/2019-Preiner/qf/t3_rw1135.smt2

Publications: "Towards Bit-Width-Independent Proofs in SMT Solvers " by A. Niemetz, M. Preiner, A. Reynolds, Y. Zohar, C. Barrett, and C. Tinelli, CADE-27 (2019).
Benchmark
Size3289
Compressed Size1096
License Creative Commons Attribution 4.0 International (CC-BY-4.0)
Categorycrafted
First Occurrence2019-07-07
Generated ByMathias Preiner
Generated On2019-03-22 00:00:00
Generator
Dolmen OK1
strict Dolmen OK1
check-sat calls1
Query 1
Status unknown
Inferred Status sat
Size 3281
Compressed Size1107
Max. Term Depth7
Asserts 2
Declared Functions4
Declared Constants0
Declared Sorts 0
Defined Functions28
Defined Recursive Functions 0
Defined Sorts0
Constants2
Declared Datatypes0

Symbols

true3 Bool12 ite3 not1
and4 =>1 =8 forall1
Int21 div2 mod3 +2
-8 *4 <1 <=2
>2 >=2

Evaluations

Evaluation Rating Solver Variant Result Wallclock CPU Time
SMT-COMP 2024 0.67 (1/3) cvc5 cvc5 sat ✅ 0.23101 0.13129
iProver iProver v3.9 unknown ❌ 1201.72887 4761.99482
SMTInterpol SMTInterpol unknown ❌ 0.50143 0.60136
SMT-COMP 2025 0.50 (2/4) cvc5 cvc5 sat ✅ 0.29467 0.17343
iProver iProver v3.9.3 unknown ❌ 1201.79230 4778.19560
SMTInterpol SMTInterpol unknown ❌ 0.51012 0.58566
UltimateEliminator UltimateEliminator+MathSAT sat ✅ 3.19280 5.38970