Benchmark

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

Benchmarks for substring matching problem, which needs to determine whether the pattern string exists in the text string.
Benchmark
Size8284
Compressed Size1752
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 8276
Compressed Size1722
Max. Term Depth2
Asserts 13
Declared Functions0
Declared Constants12
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

=12 str.++2 str.contains1

Evaluations

Evaluation Rating Solver Variant Result Wallclock CPU Time
SMT-COMP 2025 0.17 (5/6) cvc5 cvc5 unsat ✅ 4.56853 4.45007
OSTRICH OSTRICH unknown ❌ 1201.39579 1252.18537
Z3alpha Z3-alpha unsat ✅ 7.95822 29.70365
Z3 Z3-alpha-base unsat ✅ 4.03303 3.90795
Z3-Noodler-base unsat ✅ 4.63726 4.51616
Z3-Noodler Z3-Noodler unsat ✅ 4.61575 4.48403
Z3-Noodler-Mocha-base unsat ✅ 4.65247 4.53280
Z3-Noodler-Mocha Z3-Noodler-Mocha unsat ✅ 3.98659 3.86529