Benchmark

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

Benchmarks for substring matching problem, which needs to determine whether the pattern string exists in the text string.
Benchmark
Size13054
Compressed Size2751
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 13046
Compressed Size2731
Max. Term Depth2
Asserts 27
Declared Functions0
Declared Constants26
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

=26 str.++2 str.contains1

Evaluations

Evaluation Rating Solver Variant Result Wallclock CPU Time
SMT-COMP 2025 0.17 (5/6) cvc5 cvc5 unsat ✅ 6.05901 5.92769
OSTRICH OSTRICH unknown ❌ 1201.44417 1277.29643
Z3alpha Z3-alpha unsat ✅ 10.44599 39.28992
Z3 Z3-alpha-base unsat ✅ 6.09224 5.97420
Z3-Noodler-base unsat ✅ 7.08880 6.97348
Z3-Noodler Z3-Noodler unsat ✅ 6.93667 6.81465
Z3-Noodler-Mocha-base unsat ✅ 7.15355 7.03483
Z3-Noodler-Mocha Z3-Noodler-Mocha unsat ✅ 5.93670 5.80810