Benchmark

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

Benchmarks for substring matching problem, which needs to determine whether the pattern string exists in the text string.
Benchmark
Size14728
Compressed Size2508
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 14720
Compressed Size2475
Max. Term Depth2
Asserts 35
Declared Functions0
Declared Constants34
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

=34 str.++2 str.contains1

Evaluations

Evaluation Rating Solver Variant Result Wallclock CPU Time
SMT-COMP 2025 0.17 (5/6) cvc5 cvc5 unsat ✅ 7.49459 7.37147
OSTRICH OSTRICH unknown ❌ 1201.41492 1269.48007
Z3alpha Z3-alpha unsat ✅ 13.93057 52.88319
Z3 Z3-alpha-base unsat ✅ 8.15798 8.03551
Z3-Noodler-base unsat ✅ 9.95264 9.83475
Z3-Noodler Z3-Noodler unsat ✅ 9.39026 9.25434
Z3-Noodler-Mocha-base unsat ✅ 9.57052 9.44847
Z3-Noodler-Mocha Z3-Noodler-Mocha unsat ✅ 7.52932 7.40849