Benchmark
non-incremental/QF_S/20250410-matching/wildcard-matching-regex-104.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 | 5912 |
| Compressed Size | 1834 |
| 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 | sat |
| Size | 5904 |
| Compressed Size | 1826 |
| 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 | 126 |
re.none | 1 |
str.to_re | 113 |
re.* | 65 |
re.++ | 2 |
re.inter | 1 |
| |
Evaluations
| Evaluation |
Rating |
Solver |
Variant |
Result |
Wallclock |
CPU Time |
|
SMT-COMP 2025
|
0.17 (5/6) |
cvc5 |
cvc5 |
unknown ❌
|
0.33090
|
0.20900
|
| |
OSTRICH |
OSTRICH |
sat ✅
|
1.51289
|
3.21780
|
| |
Z3alpha |
Z3-alpha |
sat ✅
|
0.40586
|
0.29653
|
| |
Z3 |
Z3-alpha-base |
sat ✅
|
0.29578
|
0.17785
|
| |
|
Z3-Noodler-base |
sat ✅
|
0.27041
|
0.15534
|
| |
Z3-Noodler |
Z3-Noodler |
sat ✅
|
0.38854
|
0.25699
|
| |
|
Z3-Noodler-Mocha-base |
sat ✅
|
0.36162
|
0.24602
|
| |
Z3-Noodler-Mocha |
Z3-Noodler-Mocha |
sat ✅
|
0.29087
|
0.16878
|