Benchmark

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

Benchmarks for substring matching problem, which needs to determine whether the pattern string exists in the text string.
Benchmark
Size14794
Compressed Size2311
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 14786
Compressed Size2265
Max. Term Depth2
Asserts 39
Declared Functions0
Declared Constants38
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

=38 str.++2 str.contains1

Evaluations

Evaluation Rating Solver Variant Result Wallclock CPU Time
SMT-COMP 2025 0.17 (5/6) cvc5 cvc5 unsat ✅ 1.65206 1.53587
OSTRICH OSTRICH unknown ❌ 1201.44310 1267.84463
Z3alpha Z3-alpha unsat ✅ 162.84208 192.64776
Z3 Z3-alpha-base unsat ✅ 432.57489 432.41351
Z3-Noodler-base unsat ✅ 484.31837 484.15112
Z3-Noodler Z3-Noodler unsat ✅ 7.07254 6.95246
Z3-Noodler-Mocha-base unsat ✅ 7.27504 7.14470
Z3-Noodler-Mocha Z3-Noodler-Mocha unsat ✅ 5.60770 5.48401