Benchmark
non-incremental/UFNIA/2019-Zohar-ic/qf/int_check_ne_bvor_ltr_no_inv.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 |
|---|
| Size | 3523 |
| Compressed Size | 1124 |
| License |
Creative Commons Attribution 4.0 International
(CC-BY-4.0)
|
| Category | crafted |
| First Occurrence | 2019-07-07 |
| Generated By | Yoni Zohar |
| Generated On | 2019-03-18 00:00:00 |
| Generator | — |
| Dolmen OK | 1 |
| strict Dolmen OK | 1 |
| check-sat calls | 1 |
| Status | sat |
| Inferred Status | None |
| Size | 3515 |
| Compressed Size | 1127 |
| Max. Term Depth | 4 |
| Asserts | 6 |
| Declared Functions | 4 |
| Declared Constants | 3 |
| Declared Sorts | 0 |
| Defined Functions | 30 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 3 |
| Declared Datatypes | 0 |
Symbols
true | 3 |
Bool | 15 |
ite | 3 |
not | 1 |
or | 1 |
and | 3 |
=> | 1 |
= | 7 |
distinct | 3 |
exists | 1 |
Int | 19 |
div | 2 |
mod | 3 |
+ | 2 |
- | 8 |
* | 4 |
< | 1 |
<= | 2 |
> | 1 |
>= | 3 |