Benchmark

non-incremental/QF_SLIA/20250410-matching/sub-find-sat-4.smt2

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

Symbols

=73 str.replace35 str.indexof35

Evaluations

Evaluation Rating Solver Variant Result Wallclock CPU Time
SMT-COMP 2025 0.33 (4/6) cvc5 cvc5 sat ✅ 15.15197 15.02441
OSTRICH OSTRICH unknown ❌ 1201.62535 1562.36064
Z3alpha Z3-alpha unknown ❌ 1201.79424 2565.00977
Z3 Z3-alpha-base sat ✅ 553.22732 552.98141
Z3-Noodler-base sat ✅ 565.37370 565.17295
Z3-Noodler Z3-Noodler sat ✅ 20.98583 20.85764
Z3-Noodler-Mocha-base sat ✅ 21.20124 21.06513
Z3-Noodler-Mocha Z3-Noodler-Mocha sat ✅ 3.61950 3.49448