Benchmark

non-incremental/QF_S/20250410-matching/wildcard-matching-regex-111.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
Size13100
Compressed Size3429
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 13092
Compressed Size3446
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.allchar304 re.none1 str.to_re284
re.*157 re.++2 re.inter1

Evaluations

Evaluation Rating Solver Variant Result Wallclock CPU Time
SMT-COMP 2025 0.17 (5/6) cvc5 cvc5 unknown ❌ 0.34167 0.21124
OSTRICH OSTRICH sat ✅ 1.70640 3.90637
Z3alpha Z3-alpha sat ✅ 0.43827 0.34321
Z3 Z3-alpha-base sat ✅ 0.29447 0.17761
Z3-Noodler-base sat ✅ 0.31070 0.19270
Z3-Noodler Z3-Noodler sat ✅ 0.71709 0.59725
Z3-Noodler-Mocha-base sat ✅ 0.70630 0.58808
Z3-Noodler-Mocha Z3-Noodler-Mocha sat ✅ 0.30903 0.17403