Benchmark

non-incremental/QF_SLIA/20250410-matching/sub-find-unsat-6.smt2

Benchmarks for substring matching problem, which needs to determine whether the pattern string exists in the text string.
Benchmark
Size4652
Compressed Size424
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 4644
Compressed Size423
Max. Term Depth3
Asserts 3
Declared Functions0
Declared Constants2
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

=3 str.++2 str.indexof1

Evaluations

Evaluation Rating Solver Variant Result Wallclock CPU Time
SMT-COMP 2025 0.17 (5/6) cvc5 cvc5 unsat ✅ 4.25428 4.13245
OSTRICH OSTRICH unknown ❌ 1201.39251 1247.43540
Z3alpha Z3-alpha unsat ✅ 8.43562 31.96456
Z3 Z3-alpha-base unsat ✅ 4.74737 4.62347
Z3-Noodler-base unsat ✅ 5.83674 5.71800
Z3-Noodler Z3-Noodler unsat ✅ 5.43823 5.31990
Z3-Noodler-Mocha-base unsat ✅ 5.57233 5.44690
Z3-Noodler-Mocha Z3-Noodler-Mocha unsat ✅ 4.72588 4.59883