Benchmark
non-incremental/QF_S/20250410-matching/sub-matching-sat-13.smt2
Benchmarks for substring matching problem, which needs to determine whether the pattern string exists in the text string.
| Benchmark |
|---|
| Size | 13144 |
| Compressed Size | 2619 |
| License |
Creative Commons Attribution 4.0 International
(CC-BY-4.0)
|
| Category | crafted |
| First Occurrence | 2025-08-11 |
| Generated By | Shaoke Cui |
| Generated On | 2025-04-10 00:00:00 |
| Generator | — |
| Dolmen OK | 1 |
| strict Dolmen OK | 1 |
| check-sat calls | 1 |
| Status | sat |
| Inferred Status | None |
| Size | 13136 |
| Compressed Size | 2601 |
| Max. Term Depth | 2 |
| Asserts | 27 |
| Declared Functions | 0 |
| Declared Constants | 26 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
= | 26 |
str.++ | 2 |
str.contains | 1 |
| |