Benchmark

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

Benchmarks for substring matching problem, which needs to determine whether the pattern string exists in the text string.
Benchmark
Size7824
Compressed Size1682
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 7816
Compressed Size1691
Max. Term Depth2
Asserts 11
Declared Functions0
Declared Constants10
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

=10 str.++2 str.contains1

Evaluations

Evaluation Rating Solver Variant Result Wallclock CPU Time
SMT-COMP 2025 0.17 (5/6) cvc5 cvc5 unsat ✅ 3.43138 3.31243
OSTRICH OSTRICH unknown ❌ 1201.39963 1254.62978
Z3alpha Z3-alpha unsat ✅ 6.28740 23.24582
Z3 Z3-alpha-base unsat ✅ 3.98593 3.86749
Z3-Noodler-base unsat ✅ 4.49435 4.36370
Z3-Noodler Z3-Noodler unsat ✅ 4.34592 4.22902
Z3-Noodler-Mocha-base unsat ✅ 4.52503 4.39634
Z3-Noodler-Mocha Z3-Noodler-Mocha unsat ✅ 3.82279 3.69799