Benchmark

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

Benchmarks for substring matching problem, which needs to determine whether the pattern string exists in the text string.
Benchmark
Size10938
Compressed Size2168
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 10930
Compressed Size2175
Max. Term Depth2
Asserts 15
Declared Functions0
Declared Constants14
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

=14 str.++2 str.contains1

Evaluations

Evaluation Rating Solver Variant Result Wallclock CPU Time
SMT-COMP 2025 0.17 (5/6) cvc5 cvc5 sat ✅ 11.61212 11.48370
OSTRICH OSTRICH unknown ❌ 1201.41205 1250.12970
Z3alpha Z3-alpha sat ✅ 19.02095 72.19792
Z3 Z3-alpha-base sat ✅ 10.47976 10.34524
Z3-Noodler-base sat ✅ 12.22097 12.09873
Z3-Noodler Z3-Noodler sat ✅ 12.08104 11.94166
Z3-Noodler-Mocha-base sat ✅ 12.31508 12.19152
Z3-Noodler-Mocha Z3-Noodler-Mocha sat ✅ 10.39010 10.26716