Benchmark
non-incremental/QF_S/20250410-matching/wildcard-matching-regex-65.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 | 107804 |
| Compressed Size | 11260 |
| 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 | 107796 |
| Compressed Size | 11278 |
| 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 | 5384 |
re.none | 1 |
str.to_re | 1744 |
re.* | 2725 |
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.39890
|
0.27098
|
| |
OSTRICH |
OSTRICH |
sat ✅
|
4.33394
|
9.90699
|
| |
Z3alpha |
Z3-alpha |
sat ✅
|
1.93795
|
6.30317
|
| |
Z3 |
Z3-alpha-base |
unknown ❌
|
1201.29858
|
1200.95351
|
| |
|
Z3-Noodler-base |
unknown ❌
|
1201.26634
|
1200.96914
|
| |
Z3-Noodler |
Z3-Noodler |
unsat ✅
|
26.08358
|
25.95301
|
| |
|
Z3-Noodler-Mocha-base |
unsat ✅
|
25.10319
|
24.97449
|
| |
Z3-Noodler-Mocha |
Z3-Noodler-Mocha |
unsat ✅
|
0.27801
|
0.16206
|