Benchmark

non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0164.smt2

This example models a reverse transcription process inspired by bioinformatics. 
Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
In addition, the RNA string is required to contain a specific pattern.
Benchmark
Size1446
Compressed Size778
License Creative Commons Attribution 4.0 International (CC-BY-4.0)
Categoryindustrial
First Occurrence2025-08-11
Generated ByOliver Markgraf
Generated On2025-04-03 00:00:00
Generator
Dolmen OK1
strict Dolmen OK1
check-sat calls1
Query 1
Status unsat
Inferred Status unsat
Size 1422
Compressed Size771
Max. Term Depth2
Asserts 7
Declared Functions0
Declared Constants6
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

=6 str.contains1 str.replace_all4

Evaluations

Evaluation Rating Solver Variant Result Wallclock CPU Time
SMT-COMP 2025 0.50 (3/6) cvc5 cvc5 unknown ❌ 1201.76708 1200.87466
OSTRICH OSTRICH unsat ✅ 2.34183 5.51050
Z3alpha Z3-alpha unknown ❌ 0.40101 0.28478
Z3 Z3-alpha-base unknown ❌ 0.31053 0.18571
Z3-Noodler-base unknown ❌ 0.30347 0.17599
Z3-Noodler Z3-Noodler unsat ✅ 0.27443 0.15368
Z3-Noodler-Mocha-base unsat ✅ 0.31151 0.18406
Z3-Noodler-Mocha Z3-Noodler-Mocha unsat ✅ 0.27704 0.15796