Benchmark

non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0322.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 Size771
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.77149 1200.93341
OSTRICH OSTRICH unsat ✅ 2.31913 5.50667
Z3alpha Z3-alpha unknown ❌ 0.39497 0.27854
Z3 Z3-alpha-base unknown ❌ 0.29943 0.17893
Z3-Noodler-base unknown ❌ 0.31130 0.17740
Z3-Noodler Z3-Noodler unsat ✅ 0.29762 0.17785
Z3-Noodler-Mocha-base unsat ✅ 0.30436 0.18084
Z3-Noodler-Mocha Z3-Noodler-Mocha unsat ✅ 0.32305 0.19087