Benchmark

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

Benchmarks for substring matching problem, which needs to determine whether the pattern string exists in the text string.
Benchmark
Size4140
Compressed Size832
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 4132
Compressed Size833
Max. Term Depth2
Asserts 3
Declared Functions0
Declared Constants2
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

=2 str.++2 str.contains1

Evaluations

Evaluation Rating Solver Variant Result Wallclock CPU Time
SMT-COMP 2025 0.17 (5/6) cvc5 cvc5 unsat ✅ 5.65856 5.52710
OSTRICH OSTRICH unknown ❌ 1201.42238 1247.77512
Z3alpha Z3-alpha unsat ✅ 10.46490 39.56757
Z3 Z3-alpha-base unsat ✅ 6.06011 5.94084
Z3-Noodler-base unsat ✅ 7.51853 7.39046
Z3-Noodler Z3-Noodler unsat ✅ 6.96574 6.84516
Z3-Noodler-Mocha-base unsat ✅ 7.12253 6.99536
Z3-Noodler-Mocha Z3-Noodler-Mocha unsat ✅ 5.62940 5.50098