Benchmark

non-incremental/QF_S/20250410-matching/sub-matching-unsat-14.smt2

Benchmarks for substring matching problem, which needs to determine whether the pattern string exists in the text string.
Benchmark
Size12975
Compressed Size2378
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 unsat
Inferred Status unsat
Size 12967
Compressed Size2357
Max. Term Depth2
Asserts 29
Declared Functions0
Declared Constants28
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

=28 str.++2 str.contains1

Evaluations

Evaluation Rating Solver Variant Result Wallclock CPU Time
SMT-COMP 2025 0.17 (5/6) cvc5 cvc5 unsat ✅ 6.79467 6.67104
OSTRICH OSTRICH unknown ❌ 1201.41062 1270.07052
Z3alpha Z3-alpha unsat ✅ 104.77754 139.11465
Z3 Z3-alpha-base unsat ✅ 355.12964 354.93087
Z3-Noodler-base unsat ✅ 401.79771 401.62856
Z3-Noodler Z3-Noodler unsat ✅ 7.05696 6.93707
Z3-Noodler-Mocha-base unsat ✅ 7.18247 7.05458
Z3-Noodler-Mocha Z3-Noodler-Mocha unsat ✅ 5.54524 5.42378