Benchmark

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

Benchmarks for substring matching problem, which needs to determine whether the pattern string exists in the text string.
Benchmark
Size4812
Compressed Size934
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 4804
Compressed Size927
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 ✅ 4.62573 4.50027
OSTRICH OSTRICH unknown ❌ 1201.40347 1249.96636
Z3alpha Z3-alpha sat ✅ 8.44834 31.66343
Z3 Z3-alpha-base sat ✅ 5.17435 5.05186
Z3-Noodler-base sat ✅ 6.08768 5.96575
Z3-Noodler Z3-Noodler sat ✅ 5.84875 5.72147
Z3-Noodler-Mocha-base sat ✅ 6.00410 5.87594
Z3-Noodler-Mocha Z3-Noodler-Mocha sat ✅ 5.18115 5.05256