Benchmark

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

Benchmarks for substring matching problem, which needs to determine whether the pattern string exists in the text string.
Benchmark
Size4780
Compressed Size942
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 4772
Compressed Size935
Max. Term Depth2
Asserts 3
Declared Functions0
Declared Constants2
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

=2 str.++2 str.contains1

Evaluations

Evaluation Rating Solver Variant Result Wallclock CPU Time
SMT-COMP 2025 0.17 (5/6) cvc5 cvc5 sat ✅ 6.62706 6.50857
OSTRICH OSTRICH unknown ❌ 1201.37749 1247.25997
Z3alpha Z3-alpha sat ✅ 12.27213 46.45764
Z3 Z3-alpha-base sat ✅ 7.22655 7.10569
Z3-Noodler-base sat ✅ 8.92479 8.80752
Z3-Noodler Z3-Noodler sat ✅ 8.32617 8.19881
Z3-Noodler-Mocha-base sat ✅ 8.49060 8.37134
Z3-Noodler-Mocha Z3-Noodler-Mocha sat ✅ 7.23058 7.10035