Benchmark

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

Benchmarks for substring matching problem, which needs to determine whether the pattern string exists in the text string.
Benchmark
Size10846
Compressed Size2107
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 10838
Compressed Size2088
Max. Term Depth2
Asserts 25
Declared Functions0
Declared Constants24
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

=24 str.++2 str.contains1

Evaluations

Evaluation Rating Solver Variant Result Wallclock CPU Time
SMT-COMP 2025 0.17 (5/6) cvc5 cvc5 sat ✅ 4.00566 3.88510
OSTRICH OSTRICH unknown ❌ 1201.78075 3683.96674
Z3alpha Z3-alpha sat ✅ 12.10632 32.42811
Z3 Z3-alpha-base sat ✅ 77.21742 77.08320
Z3-Noodler-base sat ✅ 90.21959 90.08728
Z3-Noodler Z3-Noodler sat ✅ 4.93003 4.79954
Z3-Noodler-Mocha-base sat ✅ 5.04858 4.92389
Z3-Noodler-Mocha Z3-Noodler-Mocha sat ✅ 4.33837 4.21590