Benchmark

non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0416.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
Size1429
Compressed Size765
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 sat
Inferred Status sat
Size 1405
Compressed Size767
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.78582 1200.87639
OSTRICH OSTRICH sat ✅ 4.48787 12.27894
Z3alpha Z3-alpha unknown ❌ 0.39711 0.28240
Z3 Z3-alpha-base unknown ❌ 0.30238 0.17904
Z3-Noodler-base unknown ❌ 0.30565 0.17559
Z3-Noodler Z3-Noodler sat ✅ 0.31528 0.18953
Z3-Noodler-Mocha-base sat ✅ 0.27500 0.15692
Z3-Noodler-Mocha Z3-Noodler-Mocha sat ✅ 0.34261 0.22049