Benchmark

non-incremental/QF_S/20250410-matching/wildcard-matching-regex-41.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
Size108318
Compressed Size11307
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 None
Size 108310
Compressed Size11317
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.allchar5361 re.none1 str.to_re1795
re.*2720 re.++2 re.inter1

Evaluations

Evaluation Rating Solver Variant Result Wallclock CPU Time
SMT-COMP 2025 0.33 (4/6) cvc5 cvc5 unknown ❌ 0.38633 0.25308
OSTRICH OSTRICH sat ✅ 4.77941 10.68481
Z3alpha Z3-alpha sat ✅ 1.93362 6.32214
Z3 Z3-alpha-base unknown ❌ 421.14985 420.98175
Z3-Noodler-base unknown ❌ 466.43199 466.24791
Z3-Noodler Z3-Noodler unsat ✅ 25.64462 25.51564
Z3-Noodler-Mocha-base unsat ✅ 25.92132 25.78734
Z3-Noodler-Mocha Z3-Noodler-Mocha unsat ✅ 0.27337 0.15448