Benchmark
non-incremental/QF_SLIA/20230329-woorpje-lu/track05/05_track_35.smt2
Publications: Day, J. D., Ehlers, T., Kulczynski, M., Manea, F., Nowotka, D., & Poulsen, D. B. (2019). On solving word equations using SAT. In RP 2019
Description: Enriches a system of 30 word equations by suitable linear constraints
| Benchmark |
|---|
| Size | 1229 |
| Compressed Size | 614 |
| License |
Creative Commons Attribution 4.0 International
(CC-BY-4.0)
|
| Category | random |
| First Occurrence | 2023-07-06 |
| Generated By | Joel Day, Thorsten Ehlers, Mitja Kulczynski, Federico Mora, Florin Manea, Dirk Nowotka, Danny Poulsen, Zhengyang Lu |
| Generated On | — |
| Generator | — |
| Dolmen OK | 1 |
| strict Dolmen OK | — |
| check-sat calls | 1 |
| Status | unknown |
| Inferred Status | None |
| Size | 1220 |
| Compressed Size | 617 |
| Max. Term Depth | 3 |
| Asserts | 7 |
| Declared Functions | 0 |
| Declared Constants | 4 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
= | 3 |
* | 4 |
<= | 2 |
>= | 2 |
str.len | 4 |
str.++ | 6 |
| | | |