Benchmark
non-incremental/QF_SLIA/20250410-matching/sub-find-unsat-10.smt2
Benchmarks for substring matching problem, which needs to determine whether the pattern string exists in the text string.
| Benchmark |
|---|
| Size | 4780 |
| Compressed Size | 422 |
| 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 | 4772 |
| Compressed Size | 420 |
| 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
|
0.17 (5/6) |
cvc5 |
cvc5 |
unsat ✅
|
3.17635
|
3.05639
|
| |
OSTRICH |
OSTRICH |
unknown ❌
|
1201.31392
|
1250.88325
|
| |
Z3alpha |
Z3-alpha |
unsat ✅
|
6.12825
|
22.60927
|
| |
Z3 |
Z3-alpha-base |
unsat ✅
|
3.74520
|
3.62882
|
| |
|
Z3-Noodler-base |
unsat ✅
|
4.17915
|
4.05185
|
| |
Z3-Noodler |
Z3-Noodler |
unsat ✅
|
4.10652
|
3.97232
|
| |
|
Z3-Noodler-Mocha-base |
unsat ✅
|
4.21011
|
4.07909
|
| |
Z3-Noodler-Mocha |
Z3-Noodler-Mocha |
unsat ✅
|
3.52869
|
3.40876
|