| { | |
| "name": "golomb_n10__v0_nh", | |
| "problem_type": "golomb", | |
| "params": { | |
| "n": 10 | |
| }, | |
| "prompt": "Find a Golomb ruler with 10 marks. A Golomb ruler is a set of 10 integers (marks) such that all pairwise distances between marks are unique. The first mark should be at position 0.\n\nReturn a list of 10 integers in increasing order representing the mark positions, or state \"UNSATISFIABLE\" if no solution exists.", | |
| "satisfiable": true, | |
| "solution": { | |
| "x": [ | |
| 0, | |
| 2, | |
| 14, | |
| 21, | |
| 29, | |
| 32, | |
| 45, | |
| 49, | |
| 54, | |
| 55 | |
| ] | |
| }, | |
| "difficulty": { | |
| "solve_time_ms": 18872.1, | |
| "search_space": 110462212541120451001, | |
| "num_variables": 10, | |
| "num_constraints": 5, | |
| "num_edges": -1, | |
| "backend": "pycsp", | |
| "solve_tier": "hard", | |
| "solve_pct_global": 99.44, | |
| "solve_pct_type": 91.67 | |
| }, | |
| "partial_assignment": null | |
| } | |