Benchmark
non-incremental/UFNIA/2019-Preiner/full/t3_rw957.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 | 4688 |
| Compressed Size | 1325 |
| 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 | 4680 |
| Compressed Size | 1340 |
| Max. Term Depth | 9 |
| Asserts | 2 |
| Declared Functions | 5 |
| Declared Constants | 0 |
| Declared Sorts | 0 |
| Defined Functions | 34 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 2 |
| Declared Datatypes | 0 |
Symbols
Bool | 15 |
ite | 9 |
not | 1 |
or | 1 |
and | 11 |
=> | 5 |
= | 17 |
forall | 5 |
Int | 31 |
div | 2 |
mod | 3 |
+ | 5 |
- | 21 |
* | 8 |
< | 1 |
<= | 2 |
> | 9 |
>= | 2 |
| | | |