Benchmark

non-incremental/QF_S/20250410-matching/sub-matching-unsat-18.smt2

Benchmarks for substring matching problem, which needs to determine whether the pattern string exists in the text string.
Benchmark
Size13838
Compressed Size2073
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 unsat
Inferred Status unsat
Size 13830
Compressed Size2040
Max. Term Depth2
Asserts 37
Declared Functions0
Declared Constants36
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

=36 str.++2 str.contains1

Evaluations

Evaluation Rating Solver Variant Result Wallclock CPU Time
SMT-COMP 2025 0.17 (5/6) cvc5 cvc5 unsat ✅ 4.75883 4.62802
OSTRICH OSTRICH unknown ❌ 1201.39347 1268.29255
Z3alpha Z3-alpha unsat ✅ 8.98277 33.70094
Z3 Z3-alpha-base unsat ✅ 4.93795 4.81839
Z3-Noodler-base unsat ✅ 5.77986 5.65106
Z3-Noodler Z3-Noodler unsat ✅ 5.66165 5.54046
Z3-Noodler-Mocha-base unsat ✅ 5.79365 5.66153
Z3-Noodler-Mocha Z3-Noodler-Mocha unsat ✅ 4.94206 4.82070