Benchmark

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

Benchmarks for substring matching problem, which needs to determine whether the pattern string exists in the text string.
Benchmark
Size7611
Compressed Size1387
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 7603
Compressed Size1374
Max. Term Depth2
Asserts 7
Declared Functions0
Declared Constants6
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

=6 str.++2 str.contains1

Evaluations

Evaluation Rating Solver Variant Result Wallclock CPU Time
SMT-COMP 2025 0.17 (5/6) cvc5 cvc5 unsat ✅ 7.52196 7.40597
OSTRICH OSTRICH unknown ❌ 1201.40620 1266.78207
Z3alpha Z3-alpha unsat ✅ 83.63552 120.32858
Z3 Z3-alpha-base unsat ✅ 295.68188 295.48651
Z3-Noodler-base unsat ✅ 334.34904 334.19140
Z3-Noodler Z3-Noodler unsat ✅ 7.83687 7.71542
Z3-Noodler-Mocha-base unsat ✅ 7.99229 7.87578
Z3-Noodler-Mocha Z3-Noodler-Mocha unsat ✅ 6.78750 6.66626