Benchmark

non-incremental/QF_SLIA/20250410-matching/sub-find-sat-5.smt2

Benchmarks for substring matching problem, which needs to determine whether the pattern string exists in the text string.
Benchmark
Size1026445
Compressed Size17592
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 sat
Inferred Status None
Size 1026437
Compressed Size17603
Max. Term Depth2
Asserts 209
Declared Functions0
Declared Constants106
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

=209 str.replace103 str.indexof103

Evaluations

Evaluation Rating Solver Variant Result Wallclock CPU Time
SMT-COMP 2025 0.83 (1/6) cvc5 cvc5 sat ✅ 14.16356 14.03972
OSTRICH OSTRICH unknown ❌ 1201.55456 1624.61985
Z3alpha Z3-alpha unknown ❌ 1201.73273 2082.27648
Z3 Z3-alpha-base unknown ❌ 1201.33442 1201.12487
Z3-Noodler-base unknown ❌ 1201.32847 1201.10021
Z3-Noodler Z3-Noodler unknown ❌ 1201.37552 1201.04805
Z3-Noodler-Mocha-base unknown ❌ 1201.32121 1201.05854
Z3-Noodler-Mocha Z3-Noodler-Mocha unknown ❌ 1201.32895 1201.01296