Benchmark

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

Benchmarks for substring matching problem, which needs to determine whether the pattern string exists in the text string.
Benchmark
Size11342
Compressed Size2406
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 11334
Compressed Size2413
Max. Term Depth2
Asserts 19
Declared Functions0
Declared Constants18
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

=18 str.++2 str.contains1

Evaluations

Evaluation Rating Solver Variant Result Wallclock CPU Time
SMT-COMP 2025 0.17 (5/6) cvc5 cvc5 unsat ✅ 5.94068 5.82302
OSTRICH OSTRICH unknown ❌ 1201.40613 1252.59855
Z3alpha Z3-alpha unsat ✅ 10.59436 39.76304
Z3 Z3-alpha-base unsat ✅ 5.97618 5.85687
Z3-Noodler-base unsat ✅ 6.94860 6.81904
Z3-Noodler Z3-Noodler unsat ✅ 6.83399 6.70982
Z3-Noodler-Mocha-base unsat ✅ 7.00492 6.88303
Z3-Noodler-Mocha Z3-Noodler-Mocha unsat ✅ 5.95363 5.83122