Benchmark

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

Benchmarks for substring matching problem, which needs to determine whether the pattern string exists in the text string.
Benchmark
Size16187
Compressed Size2985
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 16179
Compressed Size2922
Max. Term Depth2
Asserts 39
Declared Functions0
Declared Constants38
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

=38 str.++2 str.contains1

Evaluations

Evaluation Rating Solver Variant Result Wallclock CPU Time
SMT-COMP 2025 0.17 (5/6) cvc5 cvc5 sat ✅ 9.13098 9.01149
OSTRICH OSTRICH unknown ❌ 1201.41896 1277.50644
Z3alpha Z3-alpha sat ✅ 269.67992 308.57674
Z3 Z3-alpha-base sat ✅ 673.11604 672.93473
Z3-Noodler-base sat ✅ 752.99024 752.71902
Z3-Noodler Z3-Noodler sat ✅ 9.58022 9.45836
Z3-Noodler-Mocha-base sat ✅ 9.92117 9.80187
Z3-Noodler-Mocha Z3-Noodler-Mocha sat ✅ 8.42751 8.30636