Benchmark
non-incremental/QF_S/20250410-matching/wildcard-matching-regex-35.smt2
Benchmarks for string matching problem with wildcards, which needs to determine whether two strings containing two wildcards can match.
Use re.allchar and (re.* re.allchar) to represent wildcards.
Determine whether the two strings match by judging whether the result of re.inter is re.none.
| Benchmark |
|---|
| Size | 67423 |
| Compressed Size | 3139 |
| 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 | unknown |
| Inferred Status | None |
| Size | 67415 |
| Compressed Size | 3151 |
| Max. Term Depth | 4 |
| Asserts | 1 |
| Declared Functions | 0 |
| Declared Constants | 0 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
= | 1 |
re.allchar | 3578 |
re.none | 1 |
str.to_re | 291 |
re.* | 3237 |
re.++ | 2 |
re.inter | 1 |
| |
Evaluations
| Evaluation |
Rating |
Solver |
Variant |
Result |
Wallclock |
CPU Time |
|
SMT-COMP 2025
|
0.33 (4/6) |
cvc5 |
cvc5 |
unknown ❌
|
0.35284
|
0.22959
|
| |
OSTRICH |
OSTRICH |
sat ✅
|
2.98666
|
7.13337
|
| |
Z3alpha |
Z3-alpha |
sat ✅
|
0.81922
|
1.98678
|
| |
Z3 |
Z3-alpha-base |
unknown ❌
|
1201.26313
|
1201.00650
|
| |
|
Z3-Noodler-base |
unknown ❌
|
1201.29090
|
1201.04660
|
| |
Z3-Noodler |
Z3-Noodler |
unsat ✅
|
2.46154
|
2.33926
|
| |
|
Z3-Noodler-Mocha-base |
unsat ✅
|
2.48156
|
2.36184
|
| |
Z3-Noodler-Mocha |
Z3-Noodler-Mocha |
unsat ✅
|
0.28364
|
0.15958
|