Benchmark
non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0095.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 | 1424 |
| Compressed Size | 770 |
| 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 | sat |
| Size | 1400 |
| Compressed Size | 764 |
| 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 |
| |
Evaluations
| Evaluation |
Rating |
Solver |
Variant |
Result |
Wallclock |
CPU Time |
|
SMT-COMP 2025
|
0.50 (3/6) |
cvc5 |
cvc5 |
unknown ❌
|
1201.84048
|
1201.02764
|
| |
OSTRICH |
OSTRICH |
sat ✅
|
4.29669
|
11.65047
|
| |
Z3alpha |
Z3-alpha |
unknown ❌
|
0.37979
|
0.26792
|
| |
Z3 |
Z3-alpha-base |
unknown ❌
|
0.30743
|
0.18464
|
| |
|
Z3-Noodler-base |
unknown ❌
|
0.29873
|
0.17367
|
| |
Z3-Noodler |
Z3-Noodler |
sat ✅
|
0.31365
|
0.18794
|
| |
|
Z3-Noodler-Mocha-base |
sat ✅
|
0.28262
|
0.16553
|
| |
Z3-Noodler-Mocha |
Z3-Noodler-Mocha |
sat ✅
|
0.27304
|
0.15698
|