Benchmark

non-incremental/QF_S/20250410-matching/wildcard-matching-regex-116.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
Size4038
Compressed Size1333
License Creative Commons Attribution 4.0 International (CC-BY-4.0)
Categorycrafted
First Occurrence2025-08-11
Generated ByShaoke Cui
Generated On2025-04-10 00:00:00
Generator
Dolmen OK1
strict Dolmen OK1
check-sat calls1
Query 1
Status unknown
Inferred Status sat
Size 4030
Compressed Size1328
Max. Term Depth4
Asserts 1
Declared Functions0
Declared Constants0
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

=1 re.allchar78 re.none1 str.to_re77
re.*36 re.++2 re.inter1

Evaluations

Evaluation Rating Solver Variant Result Wallclock CPU Time
SMT-COMP 2025 0.17 (5/6) cvc5 cvc5 unknown ❌ 0.31576 0.18842
OSTRICH OSTRICH sat ✅ 1.39114 2.71561
Z3alpha Z3-alpha sat ✅ 0.38266 0.28124
Z3 Z3-alpha-base sat ✅ 0.31525 0.19209
Z3-Noodler-base sat ✅ 0.29277 0.17259
Z3-Noodler Z3-Noodler sat ✅ 0.32598 0.20856
Z3-Noodler-Mocha-base sat ✅ 0.30929 0.19263
Z3-Noodler-Mocha Z3-Noodler-Mocha sat ✅ 0.29371 0.16802