Benchmark
non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_79.smt2
Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
Most benchmarks expected to be unsat.
Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
Proof Generation
| Benchmark |
|---|
| Size | 1957 |
| Compressed Size | 754 |
| 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 | unknown |
| Inferred Status | None |
| Size | 1949 |
| Compressed Size | 756 |
| Max. Term Depth | 4 |
| Asserts | 16 |
| Declared Functions | 0 |
| Declared Constants | 17 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
= | 15 |
str.replace_all | 6 |
str.to_re | 3 |
re.+ | 1 |
re.union | 1 |
str.in_re | 1 |
| | | |