Benchmark

non-incremental/QF_S/20250410-matching/wildcard-matching-regex-106.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
Size4707
Compressed Size1482
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 4699
Compressed Size1482
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.allchar97 re.none1 str.to_re89
re.*52 re.++2 re.inter1

Evaluations

Evaluation Rating Solver Variant Result Wallclock CPU Time
SMT-COMP 2025 0.17 (5/6) cvc5 cvc5 unknown ❌ 0.33012 0.20991
OSTRICH OSTRICH sat ✅ 1.39068 2.91702
Z3alpha Z3-alpha sat ✅ 0.40043 0.29682
Z3 Z3-alpha-base sat ✅ 0.32278 0.19315
Z3-Noodler-base sat ✅ 0.30206 0.17804
Z3-Noodler Z3-Noodler sat ✅ 0.35210 0.22314
Z3-Noodler-Mocha-base sat ✅ 0.33553 0.21406
Z3-Noodler-Mocha Z3-Noodler-Mocha sat ✅ 0.28402 0.15701