Benchmark
non-incremental/QF_S/20250410-matching/sub-matching-sat-30.smt2
Benchmarks for substring matching problem, which needs to determine whether the pattern string exists in the text string.
| Benchmark |
|---|
| Size | 4554 |
| Compressed Size | 888 |
| 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 | 4546 |
| Compressed Size | 887 |
| Max. Term Depth | 2 |
| Asserts | 3 |
| Declared Functions | 0 |
| Declared Constants | 2 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
Evaluations
| Evaluation |
Rating |
Solver |
Variant |
Result |
Wallclock |
CPU Time |
|
SMT-COMP 2025
|
0.17 (5/6) |
cvc5 |
cvc5 |
sat ✅
|
4.93532
|
4.81654
|
| |
OSTRICH |
OSTRICH |
unknown ❌
|
1201.74565
|
1851.73388
|
| |
Z3alpha |
Z3-alpha |
sat ✅
|
9.20620
|
34.65243
|
| |
Z3 |
Z3-alpha-base |
sat ✅
|
5.83607
|
5.70906
|
| |
|
Z3-Noodler-base |
sat ✅
|
6.37574
|
6.25145
|
| |
Z3-Noodler |
Z3-Noodler |
sat ✅
|
6.24097
|
6.12324
|
| |
|
Z3-Noodler-Mocha-base |
sat ✅
|
6.40549
|
6.28531
|
| |
Z3-Noodler-Mocha |
Z3-Noodler-Mocha |
sat ✅
|
5.42495
|
5.29843
|