Benchmark
non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0001.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 |
|---|
| Size | 1414 |
| Compressed Size | 760 |
| License |
Creative Commons Attribution 4.0 International
(CC-BY-4.0)
|
| Category | industrial |
| First Occurrence | 2025-08-11 |
| Generated By | Oliver Markgraf |
| Generated On | 2025-04-03 00:00:00 |
| Generator | — |
| Dolmen OK | 1 |
| strict Dolmen OK | 1 |
| check-sat calls | 1 |
| Status | sat |
| Inferred Status | None |
| Size | 1390 |
| Compressed Size | 756 |
| Max. Term Depth | 2 |
| Asserts | 7 |
| Declared Functions | 0 |
| Declared Constants | 6 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
= | 6 |
str.contains | 1 |
str.replace_all | 4 |
| |