Benchmark

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

Benchmarks for substring matching problem, which needs to determine whether the pattern string exists in the text string.
Benchmark
Size4676
Compressed Size920
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 4668
Compressed Size917
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.44134 4.31437
OSTRICH OSTRICH unknown ❌ 1201.40495 1250.86839
Z3alpha Z3-alpha sat ✅ 8.17412 30.49984
Z3 Z3-alpha-base sat ✅ 4.88837 4.76519
Z3-Noodler-base sat ✅ 6.08428 5.94560
Z3-Noodler Z3-Noodler sat ✅ 5.58896 5.45824
Z3-Noodler-Mocha-base sat ✅ 5.75837 5.62969
Z3-Noodler-Mocha Z3-Noodler-Mocha sat ✅ 4.85858 4.73503