Benchmark

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

Benchmarks for substring matching problem, which needs to determine whether the pattern string exists in the text string.
Benchmark
Size14110
Compressed Size2603
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 14102
Compressed Size2574
Max. Term Depth2
Asserts 25
Declared Functions0
Declared Constants24
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

=24 str.++2 str.contains1

Evaluations

Evaluation Rating Solver Variant Result Wallclock CPU Time
SMT-COMP 2025 0.17 (5/6) cvc5 cvc5 unsat ✅ 14.04740 13.91966
OSTRICH OSTRICH unknown ❌ 1201.37970 1251.92494
Z3alpha Z3-alpha unsat ✅ 23.62951 90.84494
Z3 Z3-alpha-base unsat ✅ 12.91179 12.79223
Z3-Noodler-base unsat ✅ 15.16790 15.04209
Z3-Noodler Z3-Noodler unsat ✅ 14.85449 14.73568
Z3-Noodler-Mocha-base unsat ✅ 15.18964 15.06841
Z3-Noodler-Mocha Z3-Noodler-Mocha unsat ✅ 12.83924 12.71157