Benchmark
non-incremental/QF_S/20250410-matching/sub-matching-unsat-27.smt2
Benchmarks for substring matching problem, which needs to determine whether the pattern string exists in the text string.
| Benchmark |
| Size | 5014 |
| Compressed Size | 1035 |
| 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 | unsat |
| Inferred Status | unsat |
| Size | 5006 |
| Compressed Size | 1031 |
| 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 |
unsat ✅
|
5.37121
|
5.24352
|
| |
OSTRICH |
OSTRICH |
unknown ❌
|
1201.43622
|
1252.41997
|
| |
Z3alpha |
Z3-alpha |
unsat ✅
|
9.40351
|
35.23294
|
| |
Z3 |
Z3-alpha-base |
unsat ✅
|
5.67355
|
5.55123
|
| |
|
Z3-Noodler-base |
unsat ✅
|
6.57672
|
6.45439
|
| |
Z3-Noodler |
Z3-Noodler |
unsat ✅
|
6.49705
|
6.36698
|
| |
|
Z3-Noodler-Mocha-base |
unsat ✅
|
6.65357
|
6.52506
|
| |
Z3-Noodler-Mocha |
Z3-Noodler-Mocha |
unsat ✅
|
5.64101
|
5.52175
|