Benchmark

non-incremental/QF_S/20250410-matching/wildcard-matching-regex-22.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
Size103673
Compressed Size4671
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 103665
Compressed Size4682
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.allchar5508 re.none1 str.to_re468
re.*4977 re.++2 re.inter1

Evaluations

Evaluation Rating Solver Variant Result Wallclock CPU Time
SMT-COMP 2025 0.33 (4/6) cvc5 cvc5 unknown ❌ 0.34378 0.22624
OSTRICH OSTRICH sat ✅ 3.97710 9.35387
Z3alpha Z3-alpha sat ✅ 1.41416 4.19709
Z3 Z3-alpha-base unknown ❌ 1201.28705 1201.04630
Z3-Noodler-base unknown ❌ 1201.26569 1200.97855
Z3-Noodler Z3-Noodler unsat ✅ 5.69187 5.56616
Z3-Noodler-Mocha-base unsat ✅ 5.76069 5.63850
Z3-Noodler-Mocha Z3-Noodler-Mocha unsat ✅ 0.30574 0.17986