Benchmark

non-incremental/QF_S/20250410-matching/wildcard-matching-regex-19.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
Size70061
Compressed Size3214
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 70053
Compressed Size3225
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.allchar3715 re.none1 str.to_re298
re.*3383 re.++2 re.inter1

Evaluations

Evaluation Rating Solver Variant Result Wallclock CPU Time
SMT-COMP 2025 0.33 (4/6) cvc5 cvc5 unknown ❌ 0.36911 0.22926
OSTRICH OSTRICH sat ✅ 3.15518 7.62567
Z3alpha Z3-alpha sat ✅ 0.85634 2.08986
Z3 Z3-alpha-base unknown ❌ 1201.26628 1201.00248
Z3-Noodler-base unknown ❌ 1201.29718 1201.03753
Z3-Noodler Z3-Noodler unsat ✅ 2.62944 2.50930
Z3-Noodler-Mocha-base unsat ✅ 2.64084 2.52298
Z3-Noodler-Mocha Z3-Noodler-Mocha unsat ✅ 0.26835 0.14875