Benchmark
non-incremental/QF_S/20250410-matching/wildcard-matching-regex-25.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 | 105812 |
| Compressed Size | 11098 |
| 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 | 105804 |
| Compressed Size | 11109 |
| 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 | 5265 |
re.none | 1 |
str.to_re | 1751 |
re.* | 2606 |
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.36454
|
0.24583
|
| |
OSTRICH |
OSTRICH |
sat ✅
|
4.71768
|
10.54440
|
| |
Z3alpha |
Z3-alpha |
sat ✅
|
2.04007
|
6.63395
|
| |
Z3 |
Z3-alpha-base |
unknown ❌
|
1201.25193
|
1201.05538
|
| |
|
Z3-Noodler-base |
unknown ❌
|
1201.26967
|
1201.02889
|
| |
Z3-Noodler |
Z3-Noodler |
unsat ✅
|
25.09330
|
24.96985
|
| |
|
Z3-Noodler-Mocha-base |
unsat ✅
|
25.51798
|
25.36844
|
| |
Z3-Noodler-Mocha |
Z3-Noodler-Mocha |
unsat ✅
|
0.31137
|
0.18356
|