Benchmark

non-incremental/QF_S/20250410-matching/wildcard-matching-regex-83.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
Size68494
Compressed Size3240
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 68486
Compressed Size3251
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.allchar3620 re.none1 str.to_re311
re.*3280 re.++2 re.inter1

Evaluations

Evaluation Rating Solver Variant Result Wallclock CPU Time
SMT-COMP 2025 0.33 (4/6) cvc5 cvc5 unknown ❌ 0.35758 0.23383
OSTRICH OSTRICH sat ✅ 2.97843 7.16218
Z3alpha Z3-alpha sat ✅ 0.81662 2.02983
Z3 Z3-alpha-base unknown ❌ 1201.32028 1200.91242
Z3-Noodler-base unknown ❌ 1201.29480 1201.05481
Z3-Noodler Z3-Noodler unsat ✅ 2.51516 2.38255
Z3-Noodler-Mocha-base unsat ✅ 2.49564 2.38401
Z3-Noodler-Mocha Z3-Noodler-Mocha unsat ✅ 0.30500 0.17672