Benchmark

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

Benchmarks for substring matching problem, which needs to determine whether the pattern string exists in the text string.
Benchmark
Size4754
Compressed Size999
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 4746
Compressed Size993
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 ✅ 8.37298 8.25142
OSTRICH OSTRICH unknown ❌ 1201.40969 1264.14006
Z3alpha Z3-alpha unsat ✅ 15.03198 57.23636
Z3 Z3-alpha-base unsat ✅ 8.78077 8.64750
Z3-Noodler-base unsat ✅ 10.19764 10.07847
Z3-Noodler Z3-Noodler unsat ✅ 10.03141 9.91024
Z3-Noodler-Mocha-base unsat ✅ 10.27522 10.14298
Z3-Noodler-Mocha Z3-Noodler-Mocha unsat ✅ 8.66376 8.54241