Benchmark
non-incremental/QF_S/20250410-matching/wildcard-matching-regex-11.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 | 70423 |
| Compressed Size | 3156 |
| 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 | 70415 |
| Compressed Size | 3168 |
| 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 | 3758 |
re.none | 1 |
str.to_re | 283 |
re.* | 3403 |
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.31288
|
0.19589
|
| |
OSTRICH |
OSTRICH |
sat ✅
|
3.13527
|
7.77212
|
| |
Z3alpha |
Z3-alpha |
sat ✅
|
0.93796
|
2.18599
|
| |
Z3 |
Z3-alpha-base |
unknown ❌
|
1201.26391
|
1200.95040
|
| |
|
Z3-Noodler-base |
unknown ❌
|
1201.29714
|
1200.90916
|
| |
Z3-Noodler |
Z3-Noodler |
unsat ✅
|
2.55219
|
2.43247
|
| |
|
Z3-Noodler-Mocha-base |
unsat ✅
|
2.61082
|
2.48209
|
| |
Z3-Noodler-Mocha |
Z3-Noodler-Mocha |
unsat ✅
|
0.31333
|
0.17493
|