Benchmark

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

Benchmarks for substring matching problem, which needs to determine whether the pattern string exists in the text string.
Benchmark
Size7666
Compressed Size1460
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 7658
Compressed Size1457
Max. Term Depth2
Asserts 7
Declared Functions0
Declared Constants6
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

=6 str.++2 str.contains1

Evaluations

Evaluation Rating Solver Variant Result Wallclock CPU Time
SMT-COMP 2025 0.17 (5/6) cvc5 cvc5 sat ✅ 4.52170 4.40242
OSTRICH OSTRICH unknown ❌ 1201.38794 1252.57911
Z3alpha Z3-alpha sat ✅ 31.10780 51.95381
Z3 Z3-alpha-base sat ✅ 119.67475 119.53564
Z3-Noodler-base sat ✅ 138.08167 137.94918
Z3-Noodler Z3-Noodler sat ✅ 4.62953 4.50819
Z3-Noodler-Mocha-base sat ✅ 4.73605 4.61548
Z3-Noodler-Mocha Z3-Noodler-Mocha sat ✅ 4.04229 3.92261