Benchmark
incremental/QF_S/20250411-hornstr/coffee-can-v2_sat_incre_equiv_init_0.smt2
Benchmarks are extracted by running HornStr https://arg-git.informatik.uni-kl.de/pub/string-chc-lib on all benchmarks
provided in the repository and gathering the string queries sent to the string solvers.
| Benchmark |
| Size | 5909 |
| Compressed Size | 1183 |
| License |
Creative Commons Attribution 4.0 International
(CC-BY-4.0)
|
| Category | industrial |
| First Occurrence | — |
| Generated By | Hongjian Jiang, Oliver Markgraf, Daniel Stan, Anthony W. Lin, Philipp Ruemmer |
| Generated On | 2025-04-11 00:00:00 |
| Generator | — |
| Dolmen OK | 1 |
| strict Dolmen OK | 1 |
| check-sat calls | 7 |
| Status | unknown |
| Inferred Status | None |
| Size | 2240 |
| Compressed Size | 789 |
| Max. Term Depth | 11 |
| Asserts | 4 |
| Declared Functions | 0 |
| Declared Constants | 5 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
not | 1 |
and | 1 |
= | 1 |
let | 9 |
str.to_re | 30 |
re.* | 8 |
re.++ | 14 |
re.union | 15 |
str.in_re | 4 |
| | | | | |
| Status | unknown |
| Inferred Status | None |
| Size | 1945 |
| Compressed Size | 762 |
| Max. Term Depth | 11 |
| Asserts | 4 |
| Declared Functions | 0 |
| Declared Constants | 5 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
not | 1 |
and | 1 |
= | 1 |
let | 7 |
re.none | 1 |
str.to_re | 23 |
re.* | 7 |
re.++ | 12 |
re.union | 10 |
str.in_re | 4 |
| | | |
| Status | unknown |
| Inferred Status | None |
| Size | 2739 |
| Compressed Size | 896 |
| Max. Term Depth | 11 |
| Asserts | 4 |
| Declared Functions | 0 |
| Declared Constants | 5 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
not | 1 |
and | 1 |
= | 1 |
let | 12 |
str.to_re | 40 |
re.* | 14 |
re.++ | 24 |
re.union | 19 |
str.in_re | 4 |
| | | | | |
| Status | unknown |
| Inferred Status | None |
| Size | 2695 |
| Compressed Size | 891 |
| Max. Term Depth | 11 |
| Asserts | 4 |
| Declared Functions | 0 |
| Declared Constants | 5 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
not | 1 |
and | 1 |
= | 1 |
let | 12 |
str.to_re | 39 |
re.* | 14 |
re.++ | 24 |
re.union | 18 |
str.in_re | 4 |
| | | | | |
| Status | unknown |
| Inferred Status | None |
| Size | 2898 |
| Compressed Size | 916 |
| Max. Term Depth | 13 |
| Asserts | 4 |
| Declared Functions | 0 |
| Declared Constants | 5 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
not | 1 |
and | 1 |
= | 1 |
let | 14 |
str.to_re | 45 |
re.* | 13 |
re.++ | 24 |
re.union | 24 |
str.in_re | 4 |
| | | | | |
| Status | unknown |
| Inferred Status | None |
| Size | 2604 |
| Compressed Size | 859 |
| Max. Term Depth | 11 |
| Asserts | 4 |
| Declared Functions | 0 |
| Declared Constants | 5 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
not | 1 |
and | 1 |
= | 1 |
let | 11 |
str.to_re | 37 |
re.* | 9 |
re.++ | 17 |
re.union | 20 |
str.in_re | 4 |
| | | | | |
| Status | unknown |
| Inferred Status | None |
| Size | 1913 |
| Compressed Size | 756 |
| Max. Term Depth | 11 |
| Asserts | 3 |
| Declared Functions | 0 |
| Declared Constants | 5 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
not | 1 |
and | 1 |
= | 1 |
let | 7 |
str.to_re | 23 |
re.* | 7 |
re.++ | 12 |
re.union | 10 |
str.in_re | 3 |
| | | | | |