Benchmark

non-incremental/QF_S/20250410-matching/wildcard-matching-regex-23.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
Size70110
Compressed Size3280
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 70102
Compressed Size3292
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.allchar3718 re.none1 str.to_re307
re.*3364 re.++2 re.inter1

Evaluations

Evaluation Rating Solver Variant Result Wallclock CPU Time
SMT-COMP 2025 0.33 (4/6) cvc5 cvc5 unknown ❌ 0.35453 0.22750
OSTRICH OSTRICH sat ✅ 3.18116 7.72828
Z3alpha Z3-alpha sat ✅ 0.87078 2.14223
Z3 Z3-alpha-base unknown ❌ 1201.29622 1200.91301
Z3-Noodler-base unknown ❌ 1201.31514 1200.97431
Z3-Noodler Z3-Noodler unsat ✅ 2.64534 2.52674
Z3-Noodler-Mocha-base unsat ✅ 2.71166 2.58394
Z3-Noodler-Mocha Z3-Noodler-Mocha unsat ✅ 0.26604 0.14615