Benchmark

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

Benchmarks for substring matching problem, which needs to determine whether the pattern string exists in the text string.
Benchmark
Size11471
Compressed Size2238
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 11463
Compressed Size2231
Max. Term Depth2
Asserts 17
Declared Functions0
Declared Constants16
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

=16 str.++2 str.contains1

Evaluations

Evaluation Rating Solver Variant Result Wallclock CPU Time
SMT-COMP 2025 0.17 (5/6) cvc5 cvc5 sat ✅ 10.65742 10.53710
OSTRICH OSTRICH unknown ❌ 1201.40115 1268.82351
Z3alpha Z3-alpha sat ✅ 20.64753 79.28656
Z3 Z3-alpha-base sat ✅ 11.41366 11.29044
Z3-Noodler-base sat ✅ 13.37270 13.25061
Z3-Noodler Z3-Noodler sat ✅ 13.16816 13.04015
Z3-Noodler-Mocha-base sat ✅ 13.45739 13.33552
Z3-Noodler-Mocha Z3-Noodler-Mocha sat ✅ 11.33797 11.21763