Benchmark

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

Benchmarks for substring matching problem, which needs to determine whether the pattern string exists in the text string.
Benchmark
Size5478
Compressed Size1026
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 5470
Compressed Size1009
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 ✅ 8.41448 8.29014
OSTRICH OSTRICH unknown ❌ 1201.41584 1251.33067
Z3alpha Z3-alpha sat ✅ 15.45064 58.70648
Z3 Z3-alpha-base sat ✅ 9.69790 9.57549
Z3-Noodler-base sat ✅ 10.71423 10.59755
Z3-Noodler Z3-Noodler sat ✅ 10.58256 10.45593
Z3-Noodler-Mocha-base sat ✅ 10.82343 10.70245
Z3-Noodler-Mocha Z3-Noodler-Mocha sat ✅ 9.13814 9.00893