Benchmark

non-incremental/QF_S/20250410-matching/sub-matching-sat-6.smt2

Benchmarks for substring matching problem, which needs to determine whether the pattern string exists in the text string.
Benchmark
Size9213
Compressed Size1955
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 sat
Inferred Status sat
Size 9205
Compressed Size1956
Max. Term Depth2
Asserts 13
Declared Functions0
Declared Constants12
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

=12 str.++2 str.contains1

Evaluations

Evaluation Rating Solver Variant Result Wallclock CPU Time
SMT-COMP 2025 0.17 (5/6) cvc5 cvc5 sat ✅ 5.30114 5.17760
OSTRICH OSTRICH unknown ❌ 1201.41534 1252.04325
Z3alpha Z3-alpha sat ✅ 8.64867 31.81286
Z3 Z3-alpha-base sat ✅ 4.22795 4.10794
Z3-Noodler-base sat ✅ 4.90317 4.78386
Z3-Noodler Z3-Noodler sat ✅ 4.89652 4.76403
Z3-Noodler-Mocha-base sat ✅ 4.90896 4.78892
Z3-Noodler-Mocha Z3-Noodler-Mocha sat ✅ 4.21778 4.09823