Benchmark
non-incremental/QF_S/20250410-matching/sub-matching-sat-1.smt2
Benchmarks for substring matching problem, which needs to determine whether the pattern string exists in the text string.
| Benchmark |
|---|
| Size | 7486 |
| Compressed Size | 415 |
| 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 | 7478 |
| Compressed Size | 414 |
| 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 ✅
|
9.69830
|
9.58110
|
| |
OSTRICH |
OSTRICH |
unknown ❌
|
1201.37435
|
1248.78402
|
| |
Z3alpha |
Z3-alpha |
sat ✅
|
18.03081
|
68.61180
|
| |
Z3 |
Z3-alpha-base |
sat ✅
|
11.08030
|
10.95540
|
| |
|
Z3-Noodler-base |
sat ✅
|
12.43351
|
12.31299
|
| |
Z3-Noodler |
Z3-Noodler |
sat ✅
|
12.23624
|
12.10479
|
| |
|
Z3-Noodler-Mocha-base |
sat ✅
|
12.50268
|
12.38363
|
| |
Z3-Noodler-Mocha |
Z3-Noodler-Mocha |
sat ✅
|
10.59678
|
10.47069
|