Benchmark

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

Benchmarks for substring matching problem, which needs to determine whether the pattern string exists in the text string.
Benchmark
Size13223
Compressed Size2702
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 13215
Compressed Size2687
Max. Term Depth2
Asserts 33
Declared Functions0
Declared Constants32
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

=32 str.++2 str.contains1

Evaluations

Evaluation Rating Solver Variant Result Wallclock CPU Time
SMT-COMP 2025 0.17 (5/6) cvc5 cvc5 sat ✅ 4.11897 3.99396
OSTRICH OSTRICH unknown ❌ 1201.43948 1280.09796
Z3alpha Z3-alpha sat ✅ 7.31235 27.17505
Z3 Z3-alpha-base sat ✅ 4.56702 4.44333
Z3-Noodler-base sat ✅ 5.51987 5.39330
Z3-Noodler Z3-Noodler sat ✅ 5.21503 5.09023
Z3-Noodler-Mocha-base sat ✅ 5.38514 5.26729
Z3-Noodler-Mocha Z3-Noodler-Mocha sat ✅ 4.75153 4.63098