Benchmark
non-incremental/UFNIA/2019-Preiner/combined/t3_rw1171.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 | 9991 |
| Compressed Size | 2152 |
| License |
Creative Commons Attribution 4.0 International
(CC-BY-4.0)
|
| Category | crafted |
| First Occurrence | 2019-07-07 |
| Generated By | Mathias Preiner |
| Generated On | 2019-03-22 00:00:00 |
| Generator | — |
| Dolmen OK | 1 |
| strict Dolmen OK | 1 |
| check-sat calls | 1 |
| Status | unknown |
| Inferred Status | None |
| Size | 9983 |
| Compressed Size | 2191 |
| Max. Term Depth | 9 |
| Asserts | 2 |
| Declared Functions | 5 |
| Declared Constants | 0 |
| Declared Sorts | 0 |
| Defined Functions | 55 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 10 |
| Declared Datatypes | 0 |
Symbols
Bool | 44 |
ite | 9 |
not | 1 |
or | 3 |
and | 45 |
=> | 31 |
= | 36 |
distinct | 8 |
forall | 29 |
Int | 70 |
div | 3 |
mod | 4 |
+ | 5 |
- | 22 |
* | 10 |
< | 4 |
<= | 6 |
> | 27 |
>= | 16 |
| |