Benchmark
non-incremental/QF_S/20250410-matching/sub-matching-unsat-31.smt2
Benchmarks for substring matching problem, which needs to determine whether the pattern string exists in the text string.
| Benchmark |
| Size | 5058 |
| Compressed Size | 966 |
| 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 | 5050 |
| Compressed Size | 961 |
| 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 ✅
|
10.61841
|
10.49602
|
| |
OSTRICH |
OSTRICH |
unknown ❌
|
1201.43551
|
1248.74803
|
| |
Z3alpha |
Z3-alpha |
unsat ✅
|
20.04808
|
76.67498
|
| |
Z3 |
Z3-alpha-base |
unsat ✅
|
11.58025
|
11.45689
|
| |
|
Z3-Noodler-base |
unsat ✅
|
14.00332
|
13.88315
|
| |
Z3-Noodler |
Z3-Noodler |
unsat ✅
|
13.43412
|
13.29566
|
| |
|
Z3-Noodler-Mocha-base |
unsat ✅
|
13.71605
|
13.59252
|
| |
Z3-Noodler-Mocha |
Z3-Noodler-Mocha |
unsat ✅
|
10.80186
|
10.67027
|