Benchmark

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

Benchmarks for substring matching problem, which needs to determine whether the pattern string exists in the text string.
Benchmark
Size4596
Compressed Size909
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 4588
Compressed Size905
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 ✅ 5.48218 5.35893
OSTRICH OSTRICH unknown ❌ 1201.41366 1249.76586
Z3alpha Z3-alpha sat ✅ 10.20389 38.35491
Z3 Z3-alpha-base sat ✅ 6.51307 6.37713
Z3-Noodler-base sat ✅ 6.98516 6.86047
Z3-Noodler Z3-Noodler sat ✅ 6.95942 6.84102
Z3-Noodler-Mocha-base sat ✅ 7.02220 6.90363
Z3-Noodler-Mocha Z3-Noodler-Mocha sat ✅ 5.98757 5.86221