Benchmark
non-incremental/QF_S/20250410-matching/sub-matching-sat-10.smt2
Benchmarks for substring matching problem, which needs to determine whether the pattern string exists in the text string.
| Benchmark |
|---|
| Size | 8649 |
| Compressed Size | 1831 |
| 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 | sat |
| Size | 8641 |
| Compressed Size | 1797 |
| Max. Term Depth | 2 |
| Asserts | 21 |
| Declared Functions | 0 |
| Declared Constants | 20 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
= | 20 |
str.++ | 2 |
str.contains | 1 |
| |
Evaluations
| Evaluation |
Rating |
Solver |
Variant |
Result |
Wallclock |
CPU Time |
|
SMT-COMP 2025
|
|
cvc5 |
cvc5 |
sat ✅
|
2.02277
|
1.90490
|
| |
OSTRICH |
OSTRICH |
sat ✅
|
457.75956
|
866.74348
|
| |
Z3alpha |
Z3-alpha |
sat ✅
|
3.45372
|
12.09158
|
| |
Z3 |
Z3-alpha-base |
sat ✅
|
1.87800
|
1.76152
|
| |
|
Z3-Noodler-base |
sat ✅
|
2.16231
|
2.03417
|
| |
Z3-Noodler |
Z3-Noodler |
sat ✅
|
2.14213
|
2.01162
|
| |
|
Z3-Noodler-Mocha-base |
sat ✅
|
2.17993
|
2.04405
|
| |
Z3-Noodler-Mocha |
Z3-Noodler-Mocha |
sat ✅
|
1.89461
|
1.76394
|