Benchmark
non-incremental/QF_SLIA/20250410-matching/sub-find-unsat-3.smt2
Benchmarks for substring matching problem, which needs to determine whether the pattern string exists in the text string.
| Benchmark |
|---|
| Size | 5810 |
| Compressed Size | 424 |
| 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 | 5802 |
| Compressed Size | 423 |
| Max. Term Depth | 3 |
| 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
|
|
cvc5 |
cvc5 |
unsat ✅
|
11.92074
|
11.79880
|
| |
OSTRICH |
OSTRICH |
unsat ✅
|
240.01701
|
259.46612
|
| |
Z3alpha |
Z3-alpha |
unsat ✅
|
21.78673
|
85.13053
|
| |
Z3 |
Z3-alpha-base |
unsat ✅
|
13.44355
|
13.32281
|
| |
|
Z3-Noodler-base |
unsat ✅
|
15.32920
|
15.20754
|
| |
Z3-Noodler |
Z3-Noodler |
unsat ✅
|
14.97917
|
14.85627
|
| |
|
Z3-Noodler-Mocha-base |
unsat ✅
|
15.33547
|
15.21442
|
| |
Z3-Noodler-Mocha |
Z3-Noodler-Mocha |
unsat ✅
|
12.97332
|
12.85221
|