| { | |
| "name": "low_autocorrelation_n10__v9_h", | |
| "problem_type": "low_autocorrelation", | |
| "params": { | |
| "n": 10 | |
| }, | |
| "prompt": "Find a binary sequence of length 10 over the alphabet {-1, +1} with low aperiodic autocorrelation: specifically, the sum over k=1..9 of C_k^2, where C_k = sum_{i=0}^{n-k-1} seq[i]*seq[i+k], must be at most 20.\n\nReturn seq as a list of 10 integers, each -1 or +1, or state \"UNSATISFIABLE\" if no such sequence exists.\n\nPartial assignment (fixed values that must be respected):\n- seq[0]=-1, seq[8]=1\n- c[6]=-1\nReturn a complete solution consistent with these fixed assignments.", | |
| "satisfiable": true, | |
| "solution": { | |
| "seq": [ | |
| -1, | |
| -1, | |
| 1, | |
| 1, | |
| -1, | |
| 1, | |
| -1, | |
| 1, | |
| 1, | |
| 1 | |
| ], | |
| "c": [ | |
| -1, | |
| 0, | |
| -1, | |
| 0, | |
| 1, | |
| 2, | |
| -1, | |
| -2, | |
| -1 | |
| ] | |
| }, | |
| "difficulty": { | |
| "solve_time_ms": 1343.9, | |
| "search_space": 1024, | |
| "num_variables": 19, | |
| "num_constraints": 16, | |
| "num_edges": -1, | |
| "backend": "pycsp", | |
| "solve_tier": "hard", | |
| "solve_pct_global": 83.27, | |
| "solve_pct_type": 20.83 | |
| }, | |
| "partial_assignment": { | |
| "seq": { | |
| "0": -1, | |
| "8": 1 | |
| }, | |
| "c": { | |
| "6": -1 | |
| } | |
| } | |
| } | |