Benchmark

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

Benchmarks for substring matching problem, which needs to determine whether the pattern string exists in the text string.
Benchmark
Size5058
Compressed Size966
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 5050
Compressed Size961
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 ✅ 10.61841 10.49602
OSTRICH OSTRICH unknown ❌ 1201.43551 1248.74803
Z3alpha Z3-alpha unsat ✅ 20.04808 76.67498
Z3 Z3-alpha-base unsat ✅ 11.58025 11.45689
Z3-Noodler-base unsat ✅ 14.00332 13.88315
Z3-Noodler Z3-Noodler unsat ✅ 13.43412 13.29566
Z3-Noodler-Mocha-base unsat ✅ 13.71605 13.59252
Z3-Noodler-Mocha Z3-Noodler-Mocha unsat ✅ 10.80186 10.67027