task_id stringlengths 23 52 | subset stringclasses 1
value | family stringclasses 80
values | problem_key stringclasses 75
values | domain stringclasses 8
values | tier stringclasses 2
values | level stringclasses 6
values | source stringclasses 80
values | license stringclasses 3
values | tags listlengths 0 4 | prompt stringlengths 308 37k | instance stringlengths 56 37.8k | direction null | baseline null | best_known null | reference_answer stringlengths 8 198k | reference_reward float64 1 1 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
construct-rlve-imp-party-l6-s6 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 6 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 75 vertices labelled 0..74 and edge list
[[0, 1], [0, 2], [0, 3], [0, 5], [0, 6], [0, 7], [0, 8], [0, 11], [0, 12], [0, 13], [0, 14], [0, 16], [0, 17], [0, 18], [0, 20], [0, 21], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 31], [0, 34], [0, 35], [0, 36], [0, 39], [0... | {"n": 25, "edges": [[0, 1], [0, 2], [0, 3], [0, 5], [0, 6], [0, 7], [0, 8], [0, 11], [0, 12], [0, 13], [0, 14], [0, 16], [0, 17], [0, 18], [0, 20], [0, 21], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 31], [0, 34], [0, 35], [0, 36], [0, 39], [0, 40], [0, 42], [0, 43], [0, 44], [0, 46], [0, 47], [... | null | null | null | {"clique": [0, 2, 3, 5, 6, 16, 21, 24, 27, 29, 30, 31, 35, 39, 40, 42, 43, 44, 46, 48, 54, 58, 60, 64, 69]} | 1 |
construct-rlve-imp-party-l6-s7 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 6 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 75 vertices labelled 0..74 and edge list
[[0, 2], [0, 3], [0, 8], [0, 13], [0, 14], [0, 15], [0, 16], [0, 19], [0, 21], [0, 23], [0, 25], [0, 28], [0, 29], [0, 30], [0, 32], [0, 34], [0, 36], [0, 40], [0, 41], [0, 42], [0, 44], [0, 46], [0, 48], [0, 49], [0, 51], [0, 55], [0, 56], [0, 60]... | {"n": 25, "edges": [[0, 2], [0, 3], [0, 8], [0, 13], [0, 14], [0, 15], [0, 16], [0, 19], [0, 21], [0, 23], [0, 25], [0, 28], [0, 29], [0, 30], [0, 32], [0, 34], [0, 36], [0, 40], [0, 41], [0, 42], [0, 44], [0, 46], [0, 48], [0, 49], [0, 51], [0, 55], [0, 56], [0, 60], [0, 61], [0, 65], [0, 67], [0, 72], [0, 73], [0, 74... | null | null | null | {"clique": [3, 6, 9, 11, 13, 14, 15, 17, 21, 23, 28, 37, 43, 46, 48, 55, 56, 58, 60, 62, 63, 64, 71, 73, 74]} | 1 |
construct-rlve-imp-party-l6-s8 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 6 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 75 vertices labelled 0..74 and edge list
[[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 27], [0, 28], [0, 29], [0, ... | {"n": 25, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 27], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [0, 33], [0, 34], [0, 35], [0,... | null | null | null | {"clique": [0, 2, 15, 18, 23, 25, 27, 28, 34, 36, 39, 40, 46, 47, 48, 51, 52, 62, 63, 65, 66, 69, 70, 72, 73]} | 1 |
construct-rlve-imp-party-l6-s9 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 6 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 75 vertices labelled 0..74 and edge list
[[0, 1], [0, 3], [0, 4], [0, 5], [0, 6], [0, 8], [0, 9], [0, 11], [0, 13], [0, 14], [0, 16], [0, 17], [0, 19], [0, 20], [0, 23], [0, 24], [0, 26], [0, 29], [0, 30], [0, 33], [0, 35], [0, 36], [0, 38], [0, 39], [0, 40], [0, 41], [0, 42], [0, 47], [0... | {"n": 25, "edges": [[0, 1], [0, 3], [0, 4], [0, 5], [0, 6], [0, 8], [0, 9], [0, 11], [0, 13], [0, 14], [0, 16], [0, 17], [0, 19], [0, 20], [0, 23], [0, 24], [0, 26], [0, 29], [0, 30], [0, 33], [0, 35], [0, 36], [0, 38], [0, 39], [0, 40], [0, 41], [0, 42], [0, 47], [0, 48], [0, 50], [0, 52], [0, 53], [0, 54], [0, 55], [... | null | null | null | {"clique": [4, 6, 13, 17, 29, 30, 33, 36, 39, 40, 47, 50, 52, 53, 57, 58, 60, 64, 65, 66, 67, 68, 70, 71, 74]} | 1 |
construct-rlve-integer-linear-system-l1-s0 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 1 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[2] satisfying all of the following 6 equations:
1*x[0] + 1*x[1] + 1*x[2] = 5
1*x[0] = 2
1*x[0] + 1*x[1] = 4
1*x[0] + 1*x[2] = 3
1*x[0] + 1*x[1] + 1*x[2] = 5
1*x[0] + 1*x[1] + 1*x[2] = 5
Answer format: {"x": [x_0, ..., x_2]} (integers)
Write your final answer as JSON to `/workdir/answer.jso... | {"coeffs": [[1, 1, 1], [1, 0, 0], [1, 1, 0], [1, 0, 1], [1, 1, 1], [1, 1, 1]], "rhs": [5, 2, 4, 3, 5, 5], "family": "rlve_integer_linear_system", "subset": "construct"} | null | null | null | {"x": [2, 2, 1]} | 1 |
construct-rlve-integer-linear-system-l1-s1 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 1 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[2] satisfying all of the following 7 equations:
1*x[2] = 1
1*x[1] + 1*x[2] = 2
1*x[1] = 1
1*x[0] + 1*x[1] + 1*x[2] = 4
1*x[0] = 2
1*x[0] + 1*x[1] + 1*x[2] = 4
1*x[1] + 1*x[2] = 2
Answer format: {"x": [x_0, ..., x_2]} (integers)
Write your final answer as JSON to `/workdir/answer.json`. The... | {"coeffs": [[0, 0, 1], [0, 1, 1], [0, 1, 0], [1, 1, 1], [1, 0, 0], [1, 1, 1], [0, 1, 1]], "rhs": [1, 2, 1, 4, 2, 4, 2], "family": "rlve_integer_linear_system", "subset": "construct"} | null | null | null | {"x": [2, 1, 1]} | 1 |
construct-rlve-integer-linear-system-l1-s2 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 1 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[2] satisfying all of the following 6 equations:
1*x[0] + 1*x[2] = 6
1*x[2] = 3
1*x[0] + 1*x[2] = 6
1*x[0] + 1*x[2] = 6
1*x[1] = 1
1*x[0] + 1*x[1] = 4
Answer format: {"x": [x_0, ..., x_2]} (integers)
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/w... | {"coeffs": [[1, 0, 1], [0, 0, 1], [1, 0, 1], [1, 0, 1], [0, 1, 0], [1, 1, 0]], "rhs": [6, 3, 6, 6, 1, 4], "family": "rlve_integer_linear_system", "subset": "construct"} | null | null | null | {"x": [3, 1, 3]} | 1 |
construct-rlve-integer-linear-system-l1-s3 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 1 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[2] satisfying all of the following 7 equations:
1*x[0] + 1*x[1] + 1*x[2] = 5
1*x[2] = 1
1*x[0] + 1*x[1] + 1*x[2] = 5
1*x[1] = 2
1*x[0] + 1*x[1] + 1*x[2] = 5
1*x[0] = 2
1*x[0] + 1*x[1] = 4
Answer format: {"x": [x_0, ..., x_2]} (integers)
Write your final answer as JSON to `/workdir/answer.j... | {"coeffs": [[1, 1, 1], [0, 0, 1], [1, 1, 1], [0, 1, 0], [1, 1, 1], [1, 0, 0], [1, 1, 0]], "rhs": [5, 1, 5, 2, 5, 2, 4], "family": "rlve_integer_linear_system", "subset": "construct"} | null | null | null | {"x": [2, 2, 1]} | 1 |
construct-rlve-integer-linear-system-l1-s4 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 1 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[2] satisfying all of the following 9 equations:
1*x[0] + 1*x[1] + 1*x[2] = 7
1*x[0] = 2
1*x[0] + 1*x[1] = 5
1*x[2] = 2
1*x[1] = 3
1*x[0] = 2
1*x[0] + 1*x[2] = 4
1*x[0] = 2
1*x[0] + 1*x[2] = 4
Answer format: {"x": [x_0, ..., x_2]} (integers)
Write your final answer as JSON to `/workdir/answ... | {"coeffs": [[1, 1, 1], [1, 0, 0], [1, 1, 0], [0, 0, 1], [0, 1, 0], [1, 0, 0], [1, 0, 1], [1, 0, 0], [1, 0, 1]], "rhs": [7, 2, 5, 2, 3, 2, 4, 2, 4], "family": "rlve_integer_linear_system", "subset": "construct"} | null | null | null | {"x": [2, 3, 2]} | 1 |
construct-rlve-integer-linear-system-l1-s5 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 1 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[2] satisfying all of the following 7 equations:
1*x[2] = 1
1*x[0] + 1*x[1] = 3
1*x[0] = 1
1*x[0] + 1*x[1] + 1*x[2] = 4
1*x[0] = 1
1*x[0] = 1
1*x[2] = 1
Answer format: {"x": [x_0, ..., x_2]} (integers)
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `... | {"coeffs": [[0, 0, 1], [1, 1, 0], [1, 0, 0], [1, 1, 1], [1, 0, 0], [1, 0, 0], [0, 0, 1]], "rhs": [1, 3, 1, 4, 1, 1, 1], "family": "rlve_integer_linear_system", "subset": "construct"} | null | null | null | {"x": [1, 2, 1]} | 1 |
construct-rlve-integer-linear-system-l1-s6 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 1 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[2] satisfying all of the following 7 equations:
1*x[0] + 1*x[2] = 2
1*x[2] = 1
1*x[0] + 1*x[1] + 1*x[2] = 5
1*x[2] = 1
1*x[0] = 1
1*x[0] + 1*x[2] = 2
1*x[2] = 1
Answer format: {"x": [x_0, ..., x_2]} (integers)
Write your final answer as JSON to `/workdir/answer.json`. The instance data is ... | {"coeffs": [[1, 0, 1], [0, 0, 1], [1, 1, 1], [0, 0, 1], [1, 0, 0], [1, 0, 1], [0, 0, 1]], "rhs": [2, 1, 5, 1, 1, 2, 1], "family": "rlve_integer_linear_system", "subset": "construct"} | null | null | null | {"x": [1, 3, 1]} | 1 |
construct-rlve-integer-linear-system-l1-s7 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 1 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[2] satisfying all of the following 6 equations:
1*x[0] + 1*x[1] = 5
1*x[0] + 1*x[2] = 5
1*x[0] + 1*x[2] = 5
1*x[0] + 1*x[2] = 5
1*x[0] + 1*x[1] = 5
1*x[1] = 2
Answer format: {"x": [x_0, ..., x_2]} (integers)
Write your final answer as JSON to `/workdir/answer.json`. The instance data is al... | {"coeffs": [[1, 1, 0], [1, 0, 1], [1, 0, 1], [1, 0, 1], [1, 1, 0], [0, 1, 0]], "rhs": [5, 5, 5, 5, 5, 2], "family": "rlve_integer_linear_system", "subset": "construct"} | null | null | null | {"x": [3, 2, 2]} | 1 |
construct-rlve-integer-linear-system-l1-s8 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 1 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[2] satisfying all of the following 6 equations:
1*x[1] = 2
1*x[0] + 1*x[2] = 6
1*x[0] = 3
1*x[1] = 2
1*x[0] + 1*x[1] = 5
1*x[2] = 3
Answer format: {"x": [x_0, ..., x_2]} (integers)
Write your final answer as JSON to `/workdir/answer.json`. The instance data is also in `/workdir/instance.js... | {"coeffs": [[0, 1, 0], [1, 0, 1], [1, 0, 0], [0, 1, 0], [1, 1, 0], [0, 0, 1]], "rhs": [2, 6, 3, 2, 5, 3], "family": "rlve_integer_linear_system", "subset": "construct"} | null | null | null | {"x": [3, 2, 3]} | 1 |
construct-rlve-integer-linear-system-l1-s9 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 1 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[2] satisfying all of the following 9 equations:
1*x[0] + 1*x[1] = 2
1*x[0] = 1
1*x[2] = 3
1*x[1] = 1
1*x[0] + 1*x[1] + 1*x[2] = 5
1*x[0] + 1*x[2] = 4
1*x[0] + 1*x[1] = 2
1*x[0] + 1*x[1] + 1*x[2] = 5
1*x[0] + 1*x[2] = 4
Answer format: {"x": [x_0, ..., x_2]} (integers)
Write your final answe... | {"coeffs": [[1, 1, 0], [1, 0, 0], [0, 0, 1], [0, 1, 0], [1, 1, 1], [1, 0, 1], [1, 1, 0], [1, 1, 1], [1, 0, 1]], "rhs": [2, 1, 3, 1, 5, 4, 2, 5, 4], "family": "rlve_integer_linear_system", "subset": "construct"} | null | null | null | {"x": [1, 1, 3]} | 1 |
construct-rlve-integer-linear-system-l2-s0 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 2 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[4] satisfying all of the following 11 equations:
1*x[1] + 1*x[3] = 6
1*x[1] = 3
1*x[0] = 4
1*x[0] + 1*x[1] + 1*x[4] = 12
1*x[0] = 4
1*x[4] = 5
1*x[1] + 1*x[3] = 6
1*x[0] + 1*x[3] + 1*x[4] = 12
1*x[0] + 1*x[1] + 1*x[3] + 1*x[4] = 15
1*x[1] + 1*x[2] + 1*x[3] + 1*x[4] = 16
1*x[2] + 1*x[4] = 10
... | {"coeffs": [[0, 1, 0, 1, 0], [0, 1, 0, 0, 0], [1, 0, 0, 0, 0], [1, 1, 0, 0, 1], [1, 0, 0, 0, 0], [0, 0, 0, 0, 1], [0, 1, 0, 1, 0], [1, 0, 0, 1, 1], [1, 1, 0, 1, 1], [0, 1, 1, 1, 1], [0, 0, 1, 0, 1]], "rhs": [6, 3, 4, 12, 4, 5, 6, 12, 15, 16, 10], "family": "rlve_integer_linear_system", "subset": "construct"} | null | null | null | {"x": [4, 3, 5, 3, 5]} | 1 |
construct-rlve-integer-linear-system-l2-s1 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 2 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[4] satisfying all of the following 11 equations:
1*x[0] + 1*x[1] + 1*x[3] = 12
1*x[3] + 1*x[4] = 6
1*x[0] + 1*x[1] + 1*x[2] + 1*x[3] = 16
1*x[1] + 1*x[3] + 1*x[4] = 9
1*x[4] = 1
1*x[1] + 1*x[2] + 1*x[4] = 8
1*x[2] + 1*x[3] + 1*x[4] = 10
1*x[3] = 5
1*x[0] + 1*x[2] + 1*x[4] = 9
1*x[0] + 1*x[1] ... | {"coeffs": [[1, 1, 0, 1, 0], [0, 0, 0, 1, 1], [1, 1, 1, 1, 0], [0, 1, 0, 1, 1], [0, 0, 0, 0, 1], [0, 1, 1, 0, 1], [0, 0, 1, 1, 1], [0, 0, 0, 1, 0], [1, 0, 1, 0, 1], [1, 1, 0, 1, 1], [1, 0, 1, 1, 0]], "rhs": [12, 6, 16, 9, 1, 8, 10, 5, 9, 13, 13], "family": "rlve_integer_linear_system", "subset": "construct"} | null | null | null | {"x": [4, 3, 4, 5, 1]} | 1 |
construct-rlve-integer-linear-system-l2-s2 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 2 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[4] satisfying all of the following 11 equations:
1*x[2] + 1*x[3] + 1*x[4] = 10
1*x[0] + 1*x[1] + 1*x[2] + 1*x[3] = 13
1*x[0] + 1*x[1] + 1*x[3] = 12
1*x[1] + 1*x[2] + 1*x[3] = 10
1*x[0] + 1*x[1] + 1*x[2] + 1*x[4] = 12
1*x[0] + 1*x[1] + 1*x[3] + 1*x[4] = 16
1*x[2] + 1*x[4] = 5
1*x[0] = 3
1*x[2]... | {"coeffs": [[0, 0, 1, 1, 1], [1, 1, 1, 1, 0], [1, 1, 0, 1, 0], [0, 1, 1, 1, 0], [1, 1, 1, 0, 1], [1, 1, 0, 1, 1], [0, 0, 1, 0, 1], [1, 0, 0, 0, 0], [0, 0, 1, 1, 0], [0, 1, 0, 0, 0], [1, 1, 1, 0, 1]], "rhs": [10, 13, 12, 10, 12, 16, 5, 3, 6, 4, 12], "family": "rlve_integer_linear_system", "subset": "construct"} | null | null | null | {"x": [3, 4, 1, 5, 4]} | 1 |
construct-rlve-integer-linear-system-l2-s3 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 2 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[4] satisfying all of the following 11 equations:
1*x[0] + 1*x[1] + 1*x[3] = 10
1*x[1] + 1*x[2] + 1*x[3] = 7
1*x[0] + 1*x[2] + 1*x[3] + 1*x[4] = 15
1*x[1] + 1*x[2] + 1*x[3] + 1*x[4] = 12
1*x[0] + 1*x[2] = 5
1*x[2] + 1*x[4] = 6
1*x[0] + 1*x[2] + 1*x[3] + 1*x[4] = 15
1*x[1] + 1*x[2] + 1*x[4] = 7... | {"coeffs": [[1, 1, 0, 1, 0], [0, 1, 1, 1, 0], [1, 0, 1, 1, 1], [0, 1, 1, 1, 1], [1, 0, 1, 0, 0], [0, 0, 1, 0, 1], [1, 0, 1, 1, 1], [0, 1, 1, 0, 1], [1, 1, 0, 1, 1], [1, 0, 0, 1, 0], [0, 1, 0, 0, 1]], "rhs": [10, 7, 15, 12, 5, 6, 15, 7, 15, 9, 6], "family": "rlve_integer_linear_system", "subset": "construct"} | null | null | null | {"x": [4, 1, 1, 5, 5]} | 1 |
construct-rlve-integer-linear-system-l2-s4 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 2 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[4] satisfying all of the following 10 equations:
1*x[1] + 1*x[3] = 6
1*x[0] + 1*x[2] = 7
1*x[0] + 1*x[4] = 6
1*x[0] + 1*x[1] + 1*x[4] = 10
1*x[1] + 1*x[2] = 8
1*x[0] + 1*x[2] + 1*x[3] + 1*x[4] = 12
1*x[2] + 1*x[3] + 1*x[4] = 9
1*x[1] = 4
1*x[0] + 1*x[1] + 1*x[2] + 1*x[3] + 1*x[4] = 16
1*x[0] ... | {"coeffs": [[0, 1, 0, 1, 0], [1, 0, 1, 0, 0], [1, 0, 0, 0, 1], [1, 1, 0, 0, 1], [0, 1, 1, 0, 0], [1, 0, 1, 1, 1], [0, 0, 1, 1, 1], [0, 1, 0, 0, 0], [1, 1, 1, 1, 1], [1, 1, 0, 0, 1]], "rhs": [6, 7, 6, 10, 8, 12, 9, 4, 16, 10], "family": "rlve_integer_linear_system", "subset": "construct"} | null | null | null | {"x": [3, 4, 4, 2, 3]} | 1 |
construct-rlve-integer-linear-system-l2-s5 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 2 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[4] satisfying all of the following 13 equations:
1*x[1] + 1*x[2] + 1*x[3] + 1*x[4] = 12
1*x[3] = 4
1*x[1] + 1*x[3] + 1*x[4] = 9
1*x[0] + 1*x[1] + 1*x[2] + 1*x[3] + 1*x[4] = 15
1*x[3] + 1*x[4] = 6
1*x[1] + 1*x[2] + 1*x[4] = 8
1*x[0] + 1*x[1] + 1*x[3] = 10
1*x[0] + 1*x[1] + 1*x[2] = 9
1*x[0] + ... | {"coeffs": [[0, 1, 1, 1, 1], [0, 0, 0, 1, 0], [0, 1, 0, 1, 1], [1, 1, 1, 1, 1], [0, 0, 0, 1, 1], [0, 1, 1, 0, 1], [1, 1, 0, 1, 0], [1, 1, 1, 0, 0], [1, 0, 0, 0, 1], [1, 0, 0, 1, 0], [0, 1, 1, 0, 1], [0, 0, 1, 0, 1], [1, 0, 1, 0, 0]], "rhs": [12, 4, 9, 15, 6, 8, 10, 9, 5, 7, 8, 5, 6], "family": "rlve_integer_linear_syst... | null | null | null | {"x": [3, 3, 3, 4, 2]} | 1 |
construct-rlve-integer-linear-system-l2-s6 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 2 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[4] satisfying all of the following 14 equations:
1*x[0] = 2
1*x[0] + 1*x[1] + 1*x[2] + 1*x[3] + 1*x[4] = 12
1*x[0] + 1*x[1] + 1*x[4] = 5
1*x[0] + 1*x[1] + 1*x[3] + 1*x[4] = 7
1*x[0] + 1*x[1] + 1*x[4] = 5
1*x[0] + 1*x[4] = 3
1*x[1] + 1*x[2] + 1*x[3] + 1*x[4] = 10
1*x[2] + 1*x[4] = 6
1*x[1] + 1... | {"coeffs": [[1, 0, 0, 0, 0], [1, 1, 1, 1, 1], [1, 1, 0, 0, 1], [1, 1, 0, 1, 1], [1, 1, 0, 0, 1], [1, 0, 0, 0, 1], [0, 1, 1, 1, 1], [0, 0, 1, 0, 1], [0, 1, 1, 0, 1], [0, 1, 0, 1, 0], [0, 0, 0, 1, 0], [1, 1, 0, 1, 1], [0, 1, 1, 1, 1], [0, 1, 0, 1, 0]], "rhs": [2, 12, 5, 7, 5, 3, 10, 6, 8, 4, 2, 7, 10, 4], "family": "rlve... | null | null | null | {"x": [2, 2, 5, 2, 1]} | 1 |
construct-rlve-integer-linear-system-l2-s7 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 2 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[4] satisfying all of the following 13 equations:
1*x[1] + 1*x[2] = 5
1*x[0] + 1*x[1] + 1*x[3] + 1*x[4] = 15
1*x[0] + 1*x[1] + 1*x[2] + 1*x[4] = 12
1*x[0] + 1*x[1] + 1*x[2] = 10
1*x[0] + 1*x[1] + 1*x[2] = 10
1*x[0] + 1*x[4] = 7
1*x[0] + 1*x[1] + 1*x[3] = 13
1*x[0] = 5
1*x[0] + 1*x[2] + 1*x[3] ... | {"coeffs": [[0, 1, 1, 0, 0], [1, 1, 0, 1, 1], [1, 1, 1, 0, 1], [1, 1, 1, 0, 0], [1, 1, 1, 0, 0], [1, 0, 0, 0, 1], [1, 1, 0, 1, 0], [1, 0, 0, 0, 0], [1, 0, 1, 1, 0], [0, 1, 1, 1, 0], [1, 1, 1, 1, 0], [1, 1, 1, 0, 1], [1, 0, 1, 0, 0]], "rhs": [5, 15, 12, 10, 10, 7, 13, 5, 10, 9, 14, 12, 6], "family": "rlve_integer_linear... | null | null | null | {"x": [5, 4, 1, 4, 2]} | 1 |
construct-rlve-integer-linear-system-l2-s8 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 2 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[4] satisfying all of the following 13 equations:
1*x[2] + 1*x[3] = 7
1*x[1] + 1*x[3] = 3
1*x[0] + 1*x[1] + 1*x[2] = 10
1*x[1] + 1*x[2] + 1*x[4] = 7
1*x[0] + 1*x[1] = 5
1*x[1] + 1*x[4] = 2
1*x[1] + 1*x[3] = 3
1*x[1] = 1
1*x[1] + 1*x[4] = 2
1*x[3] = 2
1*x[1] + 1*x[2] + 1*x[4] = 7
1*x[0] + 1*x[2... | {"coeffs": [[0, 0, 1, 1, 0], [0, 1, 0, 1, 0], [1, 1, 1, 0, 0], [0, 1, 1, 0, 1], [1, 1, 0, 0, 0], [0, 1, 0, 0, 1], [0, 1, 0, 1, 0], [0, 1, 0, 0, 0], [0, 1, 0, 0, 1], [0, 0, 0, 1, 0], [0, 1, 1, 0, 1], [1, 0, 1, 0, 1], [1, 0, 1, 0, 1]], "rhs": [7, 3, 10, 7, 5, 2, 3, 1, 2, 2, 7, 10, 10], "family": "rlve_integer_linear_syst... | null | null | null | {"x": [4, 1, 5, 2, 1]} | 1 |
construct-rlve-integer-linear-system-l2-s9 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 2 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[4] satisfying all of the following 14 equations:
1*x[0] + 1*x[1] + 1*x[3] = 8
1*x[0] + 1*x[3] + 1*x[4] = 8
1*x[0] + 1*x[1] + 1*x[2] + 1*x[4] = 12
1*x[2] + 1*x[3] = 3
1*x[0] + 1*x[1] + 1*x[3] = 8
1*x[1] + 1*x[2] = 6
1*x[2] + 1*x[3] = 3
1*x[0] + 1*x[1] + 1*x[3] + 1*x[4] = 13
1*x[0] + 1*x[1] = 6... | {"coeffs": [[1, 1, 0, 1, 0], [1, 0, 0, 1, 1], [1, 1, 1, 0, 1], [0, 0, 1, 1, 0], [1, 1, 0, 1, 0], [0, 1, 1, 0, 0], [0, 0, 1, 1, 0], [1, 1, 0, 1, 1], [1, 1, 0, 0, 0], [0, 0, 0, 1, 0], [1, 1, 0, 0, 0], [0, 0, 0, 1, 0], [0, 1, 1, 0, 0], [0, 1, 0, 0, 0]], "rhs": [8, 8, 12, 3, 8, 6, 3, 13, 6, 2, 6, 2, 6, 5], "family": "rlve_... | null | null | null | {"x": [1, 5, 1, 2, 5]} | 1 |
construct-rlve-integer-linear-system-l3-s0 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 3 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[7] satisfying all of the following 22 equations:
1*x[2] + 1*x[4] + 1*x[5] = 10
1*x[1] + 1*x[3] + 1*x[4] + 1*x[7] = 19
1*x[0] + 1*x[1] + 1*x[2] + 1*x[3] + 1*x[4] + 1*x[6] + 1*x[7] = 30
1*x[0] + 1*x[1] + 1*x[2] + 1*x[3] + 1*x[5] + 1*x[6] = 25
1*x[1] + 1*x[2] + 1*x[3] + 1*x[4] + 1*x[5] + 1*x[6] ... | {"coeffs": [[0, 0, 1, 0, 1, 1, 0, 0], [0, 1, 0, 1, 1, 0, 0, 1], [1, 1, 1, 1, 1, 0, 1, 1], [1, 1, 1, 1, 0, 1, 1, 0], [0, 1, 1, 1, 1, 1, 1, 1], [1, 0, 0, 1, 0, 1, 1, 0], [1, 0, 0, 1, 1, 1, 0, 1], [1, 1, 1, 0, 1, 0, 1, 1], [1, 0, 0, 0, 0, 0, 1, 1], [1, 0, 1, 0, 1, 0, 0, 1], [0, 1, 1, 0, 1, 1, 0, 1], [1, 1, 1, 1, 0, 1, 0, ... | null | null | null | {"x": [4, 3, 2, 7, 4, 4, 5, 5]} | 1 |
construct-rlve-integer-linear-system-l3-s1 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 3 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[7] satisfying all of the following 16 equations:
1*x[0] + 1*x[2] + 1*x[4] + 1*x[7] = 14
1*x[1] + 1*x[2] + 1*x[5] + 1*x[6] + 1*x[7] = 24
1*x[2] + 1*x[3] + 1*x[6] = 15
1*x[3] + 1*x[5] + 1*x[6] + 1*x[7] = 13
1*x[1] + 1*x[5] + 1*x[6] = 15
1*x[1] + 1*x[2] + 1*x[3] + 1*x[4] + 1*x[5] + 1*x[7] = 24
1... | {"coeffs": [[1, 0, 1, 0, 1, 0, 0, 1], [0, 1, 1, 0, 0, 1, 1, 1], [0, 0, 1, 1, 0, 0, 1, 0], [0, 0, 0, 1, 0, 1, 1, 1], [0, 1, 0, 0, 0, 1, 1, 0], [0, 1, 1, 1, 1, 1, 0, 1], [1, 0, 0, 0, 0, 0, 0, 0], [0, 0, 1, 0, 1, 0, 1, 0], [1, 1, 0, 0, 1, 0, 0, 1], [1, 0, 0, 0, 0, 0, 0, 0], [1, 1, 0, 0, 1, 1, 1, 0], [0, 0, 1, 1, 1, 0, 1, ... | null | null | null | {"x": [4, 6, 8, 3, 1, 5, 4, 1]} | 1 |
construct-rlve-integer-linear-system-l3-s2 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 3 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[7] satisfying all of the following 19 equations:
1*x[0] + 1*x[1] + 1*x[3] = 15
1*x[3] + 1*x[7] = 14
1*x[0] + 1*x[1] + 1*x[2] + 1*x[3] = 23
1*x[1] + 1*x[2] + 1*x[3] + 1*x[4] + 1*x[5] = 33
1*x[0] + 1*x[4] + 1*x[5] + 1*x[6] + 1*x[7] = 23
1*x[1] + 1*x[2] + 1*x[5] + 1*x[7] = 24
1*x[0] + 1*x[1] + 1... | {"coeffs": [[1, 1, 0, 1, 0, 0, 0, 0], [0, 0, 0, 1, 0, 0, 0, 1], [1, 1, 1, 1, 0, 0, 0, 0], [0, 1, 1, 1, 1, 1, 0, 0], [1, 0, 0, 0, 1, 1, 1, 1], [0, 1, 1, 0, 0, 1, 0, 1], [1, 1, 0, 1, 0, 1, 0, 1], [0, 1, 0, 1, 1, 0, 0, 1], [0, 0, 0, 0, 1, 0, 1, 1], [1, 0, 0, 1, 1, 1, 0, 1], [1, 0, 1, 1, 0, 1, 0, 0], [1, 1, 1, 1, 1, 0, 0, ... | null | null | null | {"x": [2, 5, 8, 8, 7, 5, 3, 6]} | 1 |
construct-rlve-integer-linear-system-l3-s3 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 3 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[7] satisfying all of the following 20 equations:
1*x[0] + 1*x[2] + 1*x[3] + 1*x[6] + 1*x[7] = 22
1*x[4] = 5
1*x[2] + 1*x[4] + 1*x[5] + 1*x[6] + 1*x[7] = 21
1*x[0] + 1*x[4] + 1*x[5] + 1*x[7] = 23
1*x[1] + 1*x[2] + 1*x[3] + 1*x[4] + 1*x[5] + 1*x[7] = 31
1*x[2] + 1*x[4] + 1*x[6] = 10
1*x[0] + 1*... | {"coeffs": [[1, 0, 1, 1, 0, 0, 1, 1], [0, 0, 0, 0, 1, 0, 0, 0], [0, 0, 1, 0, 1, 1, 1, 1], [1, 0, 0, 0, 1, 1, 0, 1], [0, 1, 1, 1, 1, 1, 0, 1], [0, 0, 1, 0, 1, 0, 1, 0], [1, 0, 0, 0, 1, 1, 1, 1], [1, 1, 1, 1, 0, 0, 1, 0], [1, 1, 1, 0, 1, 0, 0, 0], [1, 0, 0, 1, 0, 1, 0, 0], [1, 0, 0, 0, 0, 0, 1, 1], [1, 0, 1, 1, 1, 1, 0, ... | null | null | null | {"x": [7, 8, 4, 3, 5, 4, 1, 7]} | 1 |
construct-rlve-integer-linear-system-l3-s4 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 3 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[7] satisfying all of the following 20 equations:
1*x[0] + 1*x[1] + 1*x[2] + 1*x[5] = 22
1*x[0] + 1*x[5] = 13
1*x[2] + 1*x[3] + 1*x[5] = 14
1*x[2] + 1*x[4] + 1*x[5] = 13
1*x[0] + 1*x[2] + 1*x[4] + 1*x[7] = 16
1*x[0] + 1*x[3] + 1*x[6] + 1*x[7] = 15
1*x[1] + 1*x[7] = 6
1*x[1] + 1*x[2] + 1*x[3] +... | {"coeffs": [[1, 1, 1, 0, 0, 1, 0, 0], [1, 0, 0, 0, 0, 1, 0, 0], [0, 0, 1, 1, 0, 1, 0, 0], [0, 0, 1, 0, 1, 1, 0, 0], [1, 0, 1, 0, 1, 0, 0, 1], [1, 0, 0, 1, 0, 0, 1, 1], [0, 1, 0, 0, 0, 0, 0, 1], [0, 1, 1, 1, 0, 0, 1, 1], [0, 1, 1, 0, 0, 0, 1, 0], [1, 1, 0, 0, 1, 1, 1, 1], [1, 0, 1, 0, 1, 0, 1, 0], [1, 0, 1, 1, 1, 0, 1, ... | null | null | null | {"x": [7, 4, 5, 3, 2, 6, 3, 2]} | 1 |
construct-rlve-integer-linear-system-l3-s5 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 3 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[7] satisfying all of the following 22 equations:
1*x[0] + 1*x[2] + 1*x[3] + 1*x[4] + 1*x[7] = 27
1*x[0] + 1*x[2] + 1*x[5] + 1*x[7] = 24
1*x[0] + 1*x[1] + 1*x[3] + 1*x[4] = 17
1*x[4] + 1*x[5] + 1*x[7] = 16
1*x[0] + 1*x[1] + 1*x[3] + 1*x[7] = 19
1*x[0] + 1*x[1] + 1*x[2] + 1*x[5] = 20
1*x[2] + 1... | {"coeffs": [[1, 0, 1, 1, 1, 0, 0, 1], [1, 0, 1, 0, 0, 1, 0, 1], [1, 1, 0, 1, 1, 0, 0, 0], [0, 0, 0, 0, 1, 1, 0, 1], [1, 1, 0, 1, 0, 0, 0, 1], [1, 1, 1, 0, 0, 1, 0, 0], [0, 0, 1, 1, 1, 0, 1, 1], [1, 0, 1, 0, 0, 0, 1, 1], [1, 0, 0, 0, 0, 0, 1, 1], [1, 0, 1, 1, 0, 0, 0, 1], [0, 1, 1, 0, 0, 0, 0, 1], [0, 0, 1, 0, 0, 0, 0, ... | null | null | null | {"x": [7, 3, 6, 2, 5, 4, 8, 7]} | 1 |
construct-rlve-integer-linear-system-l3-s6 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 3 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[7] satisfying all of the following 24 equations:
1*x[1] + 1*x[2] + 1*x[3] + 1*x[5] + 1*x[6] = 19
1*x[5] + 1*x[7] = 10
1*x[0] + 1*x[1] + 1*x[2] + 1*x[3] + 1*x[5] + 1*x[6] + 1*x[7] = 31
1*x[0] + 1*x[1] + 1*x[2] + 1*x[3] + 1*x[4] + 1*x[5] + 1*x[6] + 1*x[7] = 37
1*x[1] + 1*x[2] + 1*x[3] + 1*x[6] ... | {"coeffs": [[0, 1, 1, 1, 0, 1, 1, 0], [0, 0, 0, 0, 0, 1, 0, 1], [1, 1, 1, 1, 0, 1, 1, 1], [1, 1, 1, 1, 1, 1, 1, 1], [0, 1, 1, 1, 0, 0, 1, 1], [0, 1, 0, 0, 1, 1, 0, 1], [0, 1, 0, 0, 1, 1, 0, 0], [1, 1, 1, 0, 0, 1, 0, 1], [1, 1, 1, 0, 1, 0, 0, 0], [1, 0, 1, 1, 1, 0, 0, 0], [1, 0, 0, 0, 1, 1, 1, 0], [1, 1, 1, 0, 1, 0, 1, ... | null | null | null | {"x": [4, 4, 1, 4, 6, 2, 8, 8]} | 1 |
construct-rlve-integer-linear-system-l3-s7 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 3 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[7] satisfying all of the following 16 equations:
1*x[1] + 1*x[2] + 1*x[5] + 1*x[6] + 1*x[7] = 25
1*x[2] + 1*x[3] + 1*x[4] + 1*x[5] + 1*x[7] = 25
1*x[0] + 1*x[1] + 1*x[2] + 1*x[4] + 1*x[5] + 1*x[6] = 28
1*x[1] + 1*x[2] + 1*x[3] + 1*x[4] + 1*x[6] = 23
1*x[2] + 1*x[6] = 10
1*x[1] = 3
1*x[0] = 7
... | {"coeffs": [[0, 1, 1, 0, 0, 1, 1, 1], [0, 0, 1, 1, 1, 1, 0, 1], [1, 1, 1, 0, 1, 1, 1, 0], [0, 1, 1, 1, 1, 0, 1, 0], [0, 0, 1, 0, 0, 0, 1, 0], [0, 1, 0, 0, 0, 0, 0, 0], [1, 0, 0, 0, 0, 0, 0, 0], [0, 0, 1, 1, 0, 0, 1, 0], [0, 1, 0, 0, 1, 1, 0, 0], [1, 0, 0, 1, 1, 1, 0, 0], [0, 1, 0, 1, 0, 1, 0, 1], [1, 1, 0, 0, 1, 1, 0, ... | null | null | null | {"x": [7, 3, 3, 7, 3, 5, 7, 7]} | 1 |
construct-rlve-integer-linear-system-l3-s8 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 3 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[7] satisfying all of the following 19 equations:
1*x[0] + 1*x[1] + 1*x[2] + 1*x[6] = 11
1*x[0] + 1*x[1] + 1*x[3] + 1*x[5] + 1*x[7] = 20
1*x[1] + 1*x[3] + 1*x[4] + 1*x[5] = 16
1*x[0] + 1*x[2] + 1*x[4] + 1*x[5] + 1*x[6] = 11
1*x[0] + 1*x[2] + 1*x[3] + 1*x[5] + 1*x[6] + 1*x[7] = 19
1*x[2] + 1*x[... | {"coeffs": [[1, 1, 1, 0, 0, 0, 1, 0], [1, 1, 0, 1, 0, 1, 0, 1], [0, 1, 0, 1, 1, 1, 0, 0], [1, 0, 1, 0, 1, 1, 1, 0], [1, 0, 1, 1, 0, 1, 1, 1], [0, 0, 1, 0, 0, 1, 0, 0], [0, 1, 0, 0, 0, 1, 0, 0], [0, 0, 0, 0, 0, 0, 0, 1], [1, 0, 1, 1, 0, 0, 1, 0], [1, 1, 0, 0, 1, 1, 0, 1], [0, 0, 0, 1, 0, 0, 1, 0], [1, 0, 0, 0, 1, 1, 1, ... | null | null | null | {"x": [2, 5, 3, 6, 4, 1, 1, 6]} | 1 |
construct-rlve-integer-linear-system-l3-s9 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 3 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[7] satisfying all of the following 19 equations:
1*x[0] + 1*x[1] + 1*x[2] + 1*x[5] + 1*x[6] = 25
1*x[0] + 1*x[3] = 3
1*x[1] + 1*x[2] + 1*x[6] = 18
1*x[0] + 1*x[1] + 1*x[3] + 1*x[5] + 1*x[7] = 16
1*x[0] + 1*x[3] = 3
1*x[0] + 1*x[3] + 1*x[4] + 1*x[5] + 1*x[6] = 18
1*x[1] + 1*x[3] + 1*x[4] = 10
... | {"coeffs": [[1, 1, 1, 0, 0, 1, 1, 0], [1, 0, 0, 1, 0, 0, 0, 0], [0, 1, 1, 0, 0, 0, 1, 0], [1, 1, 0, 1, 0, 1, 0, 1], [1, 0, 0, 1, 0, 0, 0, 0], [1, 0, 0, 1, 1, 1, 1, 0], [0, 1, 0, 1, 1, 0, 0, 0], [0, 0, 0, 0, 1, 0, 0, 0], [1, 1, 0, 1, 1, 0, 1, 1], [1, 1, 1, 1, 1, 1, 1, 0], [1, 0, 1, 1, 0, 1, 0, 1], [1, 0, 0, 1, 0, 1, 1, ... | null | null | null | {"x": [1, 6, 5, 2, 2, 6, 7, 1]} | 1 |
construct-rlve-integer-linear-system-l4-s0 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 4 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[11] satisfying all of the following 31 equations:
2*x[0] + 2*x[1] + 1*x[2] + 1*x[7] + 1*x[10] + 1*x[11] = 45
2*x[1] + 1*x[4] + 2*x[7] + 1*x[8] + 2*x[9] + 1*x[10] = 58
2*x[0] + 1*x[2] + 2*x[4] + 1*x[5] + 2*x[6] + 1*x[7] + 2*x[8] + 1*x[10] + 1*x[11] = 79
1*x[1] + 1*x[2] + 2*x[5] + 1*x[9] = 26
1... | {"coeffs": [[2, 2, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1], [0, 2, 0, 0, 1, 0, 0, 2, 1, 2, 1, 0], [2, 0, 1, 0, 2, 1, 2, 1, 2, 0, 1, 1], [0, 1, 1, 0, 0, 2, 0, 0, 0, 1, 0, 0], [0, 1, 0, 0, 2, 0, 0, 1, 0, 0, 2, 0], [0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0], [0, 1, 1, 0, 2, 0, 0, 0, 0, 0, 2, 0], [1, 0, 0, 1, 0, 0, 0, 0, 1, 2, 1, 0], [0, ... | null | null | null | {"x": [1, 11, 6, 10, 11, 4, 5, 4, 10, 1, 5, 6]} | 1 |
construct-rlve-integer-linear-system-l4-s1 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 4 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[11] satisfying all of the following 36 equations:
1*x[4] + 1*x[5] + 2*x[6] + 1*x[7] + 1*x[9] + 2*x[11] = 57
2*x[2] + 1*x[3] + 1*x[5] = 25
1*x[1] + 2*x[4] + 1*x[6] + 1*x[7] + 2*x[10] = 52
2*x[0] + 1*x[4] = 25
1*x[0] + 1*x[1] + 2*x[3] + 2*x[7] + 1*x[8] = 52
1*x[1] + 2*x[2] + 2*x[3] + 2*x[4] + 2... | {"coeffs": [[0, 0, 0, 0, 1, 1, 2, 1, 0, 1, 0, 2], [0, 0, 2, 1, 0, 1, 0, 0, 0, 0, 0, 0], [0, 1, 0, 0, 2, 0, 1, 1, 0, 0, 2, 0], [2, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0], [1, 1, 0, 2, 0, 0, 0, 2, 1, 0, 0, 0], [0, 1, 2, 2, 2, 2, 0, 0, 1, 2, 1, 0], [1, 0, 1, 0, 0, 0, 2, 1, 2, 0, 0, 0], [1, 1, 2, 0, 0, 1, 0, 1, 0, 2, 1, 0], [0, ... | null | null | null | {"x": [7, 6, 4, 11, 11, 6, 7, 3, 11, 3, 7, 10]} | 1 |
construct-rlve-integer-linear-system-l4-s2 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 4 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[11] satisfying all of the following 26 equations:
2*x[0] + 2*x[3] + 2*x[5] + 1*x[6] + 1*x[7] = 44
2*x[1] + 2*x[2] + 1*x[7] = 41
1*x[1] + 1*x[5] + 1*x[10] = 24
2*x[3] + 1*x[4] + 2*x[5] + 2*x[7] + 2*x[9] + 2*x[11] = 93
2*x[0] + 1*x[1] + 1*x[2] + 2*x[5] + 1*x[6] + 1*x[8] + 1*x[9] + 1*x[11] = 72
... | {"coeffs": [[2, 0, 0, 2, 0, 2, 1, 1, 0, 0, 0, 0], [0, 2, 2, 0, 0, 0, 0, 1, 0, 0, 0, 0], [0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0], [0, 0, 0, 2, 1, 2, 0, 2, 0, 2, 0, 2], [2, 1, 1, 0, 0, 2, 1, 0, 1, 1, 0, 1], [1, 0, 0, 2, 1, 0, 1, 1, 1, 1, 0, 0], [1, 0, 0, 0, 0, 1, 0, 2, 0, 1, 0, 0], [2, 1, 1, 1, 1, 2, 0, 0, 0, 0, 0, 0], [2, ... | null | null | null | {"x": [6, 8, 11, 9, 11, 5, 1, 3, 6, 12, 11, 12]} | 1 |
construct-rlve-integer-linear-system-l4-s3 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 4 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[11] satisfying all of the following 33 equations:
1*x[0] + 1*x[2] + 1*x[3] + 1*x[5] + 1*x[7] + 2*x[8] + 1*x[10] + 1*x[11] = 47
1*x[3] + 2*x[4] + 1*x[6] + 1*x[8] = 11
2*x[2] + 1*x[3] + 1*x[4] + 2*x[5] + 2*x[6] + 1*x[7] + 2*x[8] + 1*x[9] + 2*x[11] = 69
2*x[1] + 2*x[3] + 1*x[4] + 2*x[5] + 2*x[8]... | {"coeffs": [[1, 0, 1, 1, 0, 1, 0, 1, 2, 0, 1, 1], [0, 0, 0, 1, 2, 0, 1, 0, 1, 0, 0, 0], [0, 0, 2, 1, 1, 2, 2, 1, 2, 1, 0, 2], [0, 2, 0, 2, 1, 2, 0, 0, 2, 1, 0, 2], [2, 0, 2, 1, 0, 0, 0, 2, 1, 0, 0, 1], [1, 2, 2, 2, 0, 2, 2, 1, 2, 2, 1, 0], [0, 1, 2, 0, 2, 0, 2, 1, 1, 1, 1, 1], [0, 2, 1, 2, 2, 0, 0, 2, 1, 0, 0, 2], [0, ... | null | null | null | {"x": [5, 2, 2, 6, 1, 12, 1, 3, 2, 9, 7, 8]} | 1 |
construct-rlve-integer-linear-system-l4-s4 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 4 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[11] satisfying all of the following 24 equations:
2*x[0] + 1*x[1] + 2*x[3] + 1*x[4] + 2*x[7] + 2*x[8] = 39
2*x[1] + 1*x[4] + 2*x[7] + 2*x[8] + 2*x[9] = 42
2*x[1] + 2*x[2] + 2*x[3] + 2*x[4] + 2*x[5] + 1*x[6] + 2*x[9] + 1*x[11] = 72
1*x[0] + 2*x[3] + 1*x[4] + 2*x[6] + 2*x[8] + 2*x[10] = 33
2*x[... | {"coeffs": [[2, 1, 0, 2, 1, 0, 0, 2, 2, 0, 0, 0], [0, 2, 0, 0, 1, 0, 0, 2, 2, 2, 0, 0], [0, 2, 2, 2, 2, 2, 1, 0, 0, 2, 0, 1], [1, 0, 0, 2, 1, 0, 2, 0, 2, 0, 2, 0], [0, 2, 0, 2, 2, 0, 2, 0, 2, 2, 0, 0], [2, 0, 2, 2, 1, 0, 1, 0, 0, 0, 1, 2], [1, 2, 2, 1, 1, 1, 2, 0, 0, 2, 1, 0], [0, 0, 1, 0, 2, 1, 1, 1, 2, 1, 0, 0], [0, ... | null | null | null | {"x": [3, 5, 8, 1, 4, 10, 3, 4, 7, 3, 2, 7]} | 1 |
construct-rlve-integer-linear-system-l4-s5 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 4 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[11] satisfying all of the following 28 equations:
1*x[0] + 1*x[3] + 1*x[6] + 2*x[9] + 2*x[11] = 42
2*x[1] + 1*x[5] + 2*x[6] + 1*x[7] + 2*x[8] + 1*x[11] = 84
2*x[1] + 2*x[4] + 1*x[8] + 1*x[10] + 2*x[11] = 56
1*x[1] + 1*x[2] + 1*x[5] + 2*x[9] + 1*x[10] + 1*x[11] = 38
2*x[0] + 2*x[2] + 1*x[5] + ... | {"coeffs": [[1, 0, 0, 1, 0, 0, 1, 0, 0, 2, 0, 2], [0, 2, 0, 0, 0, 1, 2, 1, 2, 0, 0, 1], [0, 2, 0, 0, 2, 0, 0, 0, 1, 0, 1, 2], [0, 1, 1, 0, 0, 1, 0, 0, 0, 2, 1, 1], [2, 0, 2, 0, 0, 1, 2, 2, 2, 0, 1, 1], [2, 2, 0, 0, 0, 0, 0, 2, 0, 1, 0, 0], [0, 0, 1, 0, 0, 0, 0, 0, 0, 2, 2, 0], [0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 2, 0], [0, ... | null | null | null | {"x": [9, 11, 5, 5, 8, 10, 12, 9, 7, 3, 1, 5]} | 1 |
construct-rlve-integer-linear-system-l4-s6 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 4 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[11] satisfying all of the following 28 equations:
2*x[0] + 2*x[1] + 1*x[5] + 1*x[6] + 1*x[11] = 36
1*x[0] + 2*x[3] + 1*x[4] + 2*x[5] + 2*x[8] + 2*x[9] + 1*x[10] + 1*x[11] = 58
2*x[2] + 2*x[3] + 1*x[4] + 2*x[5] + 1*x[6] + 1*x[8] + 2*x[10] + 2*x[11] = 58
1*x[2] + 2*x[5] + 1*x[11] = 22
1*x[1] + ... | {"coeffs": [[2, 2, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1], [1, 0, 0, 2, 1, 2, 0, 0, 2, 2, 1, 1], [0, 0, 2, 2, 1, 2, 1, 0, 1, 0, 2, 2], [0, 0, 1, 0, 0, 2, 0, 0, 0, 0, 0, 1], [0, 1, 0, 1, 0, 0, 2, 0, 0, 0, 2, 1], [0, 0, 2, 2, 0, 2, 1, 2, 0, 1, 0, 1], [0, 0, 0, 2, 2, 0, 2, 1, 0, 0, 0, 0], [1, 0, 2, 2, 0, 1, 0, 0, 2, 0, 1, 1], [0, ... | null | null | null | {"x": [7, 1, 6, 3, 6, 6, 10, 2, 2, 9, 1, 4]} | 1 |
construct-rlve-integer-linear-system-l4-s7 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 4 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[11] satisfying all of the following 33 equations:
2*x[0] + 2*x[5] + 2*x[6] + 2*x[8] + 1*x[9] = 76
1*x[2] + 1*x[5] + 1*x[8] + 2*x[9] + 2*x[10] + 2*x[11] = 77
1*x[1] + 1*x[6] + 2*x[9] + 1*x[10] = 52
2*x[0] + 2*x[1] + 1*x[2] + 2*x[3] + 1*x[6] + 2*x[7] + 2*x[11] = 80
1*x[0] + 1*x[1] + 1*x[2] + 1*... | {"coeffs": [[2, 0, 0, 0, 0, 2, 2, 0, 2, 1, 0, 0], [0, 0, 1, 0, 0, 1, 0, 0, 1, 2, 2, 2], [0, 1, 0, 0, 0, 0, 1, 0, 0, 2, 1, 0], [2, 2, 1, 2, 0, 0, 1, 2, 0, 0, 0, 2], [1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 2], [0, 2, 1, 0, 1, 1, 2, 2, 0, 1, 0, 2], [0, 1, 0, 0, 1, 0, 1, 2, 1, 0, 0, 0], [0, 2, 0, 0, 0, 0, 0, 2, 0, 2, 0, 0], [1, ... | null | null | null | {"x": [2, 10, 2, 6, 5, 9, 10, 11, 12, 10, 12, 5]} | 1 |
construct-rlve-integer-linear-system-l4-s8 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 4 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[11] satisfying all of the following 36 equations:
2*x[0] + 1*x[2] + 2*x[4] + 1*x[5] + 2*x[7] + 1*x[8] + 1*x[11] = 67
2*x[2] + 1*x[4] + 2*x[5] + 1*x[6] + 1*x[7] + 1*x[8] + 1*x[10] + 1*x[11] = 59
1*x[2] + 1*x[6] + 1*x[7] + 2*x[11] = 12
2*x[0] + 1*x[1] + 1*x[4] + 2*x[9] + 2*x[11] = 57
2*x[0] + 2... | {"coeffs": [[2, 0, 1, 0, 2, 1, 0, 2, 1, 0, 0, 1], [0, 0, 2, 0, 1, 2, 1, 1, 1, 0, 1, 1], [0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 2], [2, 1, 0, 0, 1, 0, 0, 0, 0, 2, 0, 2], [2, 2, 0, 0, 0, 0, 0, 0, 0, 2, 2, 1], [0, 0, 1, 0, 0, 0, 1, 2, 2, 0, 2, 2], [0, 1, 1, 0, 0, 2, 2, 0, 2, 0, 2, 1], [0, 1, 0, 0, 0, 0, 0, 0, 2, 0, 1, 0], [2, ... | null | null | null | {"x": [10, 6, 4, 9, 9, 12, 3, 1, 9, 9, 3, 2]} | 1 |
construct-rlve-integer-linear-system-l4-s9 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 4 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[11] satisfying all of the following 26 equations:
2*x[0] + 1*x[1] + 1*x[2] + 2*x[3] + 2*x[5] + 1*x[10] + 2*x[11] = 57
2*x[1] + 1*x[7] + 1*x[8] + 2*x[10] + 2*x[11] = 71
2*x[0] + 2*x[1] + 1*x[2] + 1*x[3] + 2*x[11] = 54
1*x[0] + 2*x[3] + 1*x[4] + 1*x[5] + 1*x[6] + 1*x[7] + 2*x[8] + 2*x[9] = 51
1... | {"coeffs": [[2, 1, 1, 2, 0, 2, 0, 0, 0, 0, 1, 2], [0, 2, 0, 0, 0, 0, 0, 1, 1, 0, 2, 2], [2, 2, 1, 1, 0, 0, 0, 0, 0, 0, 0, 2], [1, 0, 0, 2, 1, 1, 1, 1, 2, 2, 0, 0], [1, 0, 0, 1, 0, 0, 1, 0, 0, 2, 0, 1], [2, 0, 0, 0, 2, 0, 1, 0, 0, 1, 1, 1], [0, 0, 0, 0, 0, 2, 0, 1, 1, 1, 2, 1], [1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0], [0, ... | null | null | null | {"x": [3, 12, 3, 1, 5, 3, 3, 5, 6, 9, 8, 10]} | 1 |
construct-rlve-integer-linear-system-l5-s0 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 5 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[17] satisfying all of the following 36 equations:
2*x[0] + 3*x[3] + 2*x[5] + 3*x[6] + 1*x[7] + 1*x[10] + 3*x[11] + 3*x[12] + 2*x[17] = 177
1*x[0] + 1*x[2] + 3*x[10] + 1*x[11] + 2*x[13] + 2*x[14] + 2*x[15] = 97
3*x[0] + 3*x[1] + 1*x[2] + 2*x[6] + 1*x[8] + 3*x[9] + 1*x[11] + 3*x[13] + 1*x[15] =... | {"coeffs": [[2, 0, 0, 3, 0, 2, 3, 1, 0, 0, 1, 3, 3, 0, 0, 0, 0, 2], [1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 3, 1, 0, 2, 2, 2, 0, 0], [3, 3, 1, 0, 0, 0, 2, 0, 1, 3, 0, 1, 0, 3, 0, 1, 0, 0], [3, 0, 0, 0, 0, 3, 2, 0, 1, 0, 3, 0, 3, 2, 3, 0, 0, 2], [0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 3, 3, 0], [1, 3, 2, 0, 0, 1, 0, 0, 0, ... | null | null | null | {"x": [2, 8, 6, 16, 14, 16, 1, 4, 6, 6, 11, 8, 13, 1, 5, 18, 8, 6]} | 1 |
construct-rlve-integer-linear-system-l5-s1 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 5 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[17] satisfying all of the following 39 equations:
3*x[0] + 3*x[4] + 2*x[5] + 3*x[6] + 2*x[7] + 3*x[9] + 1*x[11] + 1*x[12] + 1*x[13] + 1*x[14] + 3*x[16] + 2*x[17] = 239
2*x[3] + 3*x[6] + 2*x[10] + 2*x[13] + 1*x[14] + 3*x[15] + 3*x[16] + 1*x[17] = 138
2*x[0] + 3*x[2] + 1*x[3] + 3*x[10] + 1*x[14... | {"coeffs": [[3, 0, 0, 0, 3, 2, 3, 2, 0, 3, 0, 1, 1, 1, 1, 0, 3, 2], [0, 0, 0, 2, 0, 0, 3, 0, 0, 0, 2, 0, 0, 2, 1, 3, 3, 1], [2, 0, 3, 1, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 1, 3, 0, 1], [0, 3, 0, 2, 2, 0, 3, 0, 3, 2, 3, 1, 2, 0, 1, 0, 1, 3], [0, 0, 1, 0, 0, 1, 0, 0, 3, 2, 2, 1, 1, 0, 1, 0, 0, 1], [3, 2, 0, 3, 0, 0, 1, 0, 0, ... | null | null | null | {"x": [7, 13, 18, 5, 13, 13, 7, 8, 13, 10, 16, 10, 17, 2, 13, 10, 4, 16]} | 1 |
construct-rlve-integer-linear-system-l5-s2 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 5 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[17] satisfying all of the following 39 equations:
2*x[1] + 2*x[2] + 2*x[3] + 3*x[4] + 1*x[5] + 3*x[8] + 1*x[10] + 2*x[13] + 3*x[16] = 152
1*x[1] + 1*x[5] + 1*x[7] + 2*x[9] + 1*x[12] + 1*x[17] = 79
3*x[1] + 3*x[2] + 2*x[4] + 3*x[5] + 1*x[7] + 1*x[8] + 3*x[9] + 1*x[11] + 1*x[14] + 2*x[16] = 177... | {"coeffs": [[0, 2, 2, 2, 3, 1, 0, 0, 3, 0, 1, 0, 0, 2, 0, 0, 3, 0], [0, 1, 0, 0, 0, 1, 0, 1, 0, 2, 0, 0, 1, 0, 0, 0, 0, 1], [0, 3, 3, 0, 2, 3, 0, 1, 1, 3, 0, 1, 0, 0, 1, 0, 2, 0], [0, 0, 2, 0, 3, 2, 0, 0, 0, 0, 0, 0, 0, 1, 1, 3, 1, 1], [0, 3, 3, 0, 0, 3, 0, 1, 2, 0, 2, 0, 2, 1, 2, 0, 0, 0], [2, 0, 1, 1, 0, 0, 1, 0, 1, ... | null | null | null | {"x": [14, 10, 3, 9, 1, 7, 2, 15, 5, 17, 17, 10, 4, 9, 2, 5, 16, 9]} | 1 |
construct-rlve-integer-linear-system-l5-s3 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 5 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[17] satisfying all of the following 50 equations:
3*x[0] + 1*x[2] + 2*x[3] + 2*x[6] + 2*x[7] + 1*x[10] + 3*x[11] + 2*x[16] = 142
2*x[4] + 1*x[5] + 3*x[10] + 1*x[12] + 1*x[14] + 2*x[16] + 1*x[17] = 99
3*x[0] + 3*x[5] + 2*x[6] + 3*x[8] + 1*x[9] + 1*x[10] + 3*x[11] + 2*x[12] + 3*x[16] = 217
3*x[... | {"coeffs": [[3, 0, 1, 2, 0, 0, 2, 2, 0, 0, 1, 3, 0, 0, 0, 0, 2, 0], [0, 0, 0, 0, 2, 1, 0, 0, 0, 0, 3, 0, 1, 0, 1, 0, 2, 1], [3, 0, 0, 0, 0, 3, 2, 0, 3, 1, 1, 3, 2, 0, 0, 0, 3, 0], [3, 3, 2, 0, 0, 2, 0, 3, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0], [0, 0, 3, 3, 1, 2, 2, 0, 1, 0, 3, 0, 0, 0, 2, 0, 1, 0], [0, 2, 2, 0, 0, 0, 0, 2, 0, ... | null | null | null | {"x": [8, 11, 11, 16, 10, 12, 12, 9, 18, 9, 1, 2, 12, 3, 12, 12, 13, 14]} | 1 |
construct-rlve-integer-linear-system-l5-s4 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 5 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[17] satisfying all of the following 43 equations:
2*x[1] + 3*x[2] + 1*x[4] + 2*x[8] + 3*x[9] + 1*x[11] + 2*x[13] + 2*x[17] = 216
3*x[1] + 3*x[2] + 2*x[5] + 2*x[6] + 3*x[8] + 2*x[10] + 1*x[11] + 2*x[15] + 1*x[16] + 3*x[17] = 220
2*x[6] + 2*x[7] + 3*x[9] + 3*x[11] + 1*x[13] + 3*x[14] + 3*x[15] ... | {"coeffs": [[0, 2, 3, 0, 1, 0, 0, 0, 2, 3, 0, 1, 0, 2, 0, 0, 0, 2], [0, 3, 3, 0, 0, 2, 2, 0, 3, 0, 2, 1, 0, 0, 0, 2, 1, 3], [0, 0, 0, 0, 0, 0, 2, 2, 0, 3, 0, 3, 0, 1, 3, 3, 1, 0], [2, 0, 0, 1, 2, 0, 2, 2, 0, 2, 2, 0, 1, 1, 0, 2, 0, 0], [0, 3, 3, 2, 2, 1, 1, 0, 3, 0, 0, 3, 2, 0, 0, 3, 0, 3], [0, 0, 0, 2, 0, 3, 3, 0, 1, ... | null | null | null | {"x": [12, 12, 11, 2, 13, 13, 3, 4, 16, 14, 7, 16, 16, 18, 12, 3, 5, 10]} | 1 |
construct-rlve-integer-linear-system-l5-s5 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 5 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[17] satisfying all of the following 54 equations:
2*x[2] + 1*x[3] + 2*x[4] + 2*x[6] + 1*x[7] + 1*x[8] + 2*x[10] + 1*x[11] + 3*x[14] + 3*x[16] + 2*x[17] = 208
1*x[0] + 2*x[2] + 3*x[3] + 1*x[6] + 3*x[8] + 2*x[11] + 2*x[13] + 1*x[15] + 1*x[16] = 157
3*x[0] + 2*x[1] + 3*x[2] + 1*x[4] + 2*x[7] + 1... | {"coeffs": [[0, 0, 2, 1, 2, 0, 2, 1, 1, 0, 2, 1, 0, 0, 3, 0, 3, 2], [1, 0, 2, 3, 0, 0, 1, 0, 3, 0, 0, 2, 0, 2, 0, 1, 1, 0], [3, 2, 3, 0, 1, 0, 0, 2, 0, 1, 0, 0, 1, 0, 3, 0, 3, 0], [0, 2, 0, 0, 0, 2, 0, 2, 1, 1, 0, 2, 0, 0, 0, 0, 3, 1], [1, 0, 0, 3, 0, 2, 0, 3, 0, 0, 0, 0, 3, 3, 0, 2, 2, 3], [2, 0, 0, 2, 0, 0, 0, 2, 0, ... | null | null | null | {"x": [11, 11, 13, 15, 12, 1, 12, 8, 13, 5, 4, 2, 10, 3, 11, 5, 9, 14]} | 1 |
construct-rlve-integer-linear-system-l5-s6 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 5 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[17] satisfying all of the following 54 equations:
1*x[0] + 2*x[1] + 3*x[4] + 3*x[6] + 1*x[8] + 1*x[12] + 3*x[13] + 3*x[14] = 183
3*x[1] + 3*x[2] + 1*x[3] + 2*x[4] + 1*x[6] + 1*x[8] + 3*x[12] + 1*x[14] + 2*x[15] + 2*x[16] = 194
3*x[1] + 3*x[3] + 1*x[5] + 2*x[6] + 2*x[7] + 1*x[12] + 2*x[16] = 1... | {"coeffs": [[1, 2, 0, 0, 3, 0, 3, 0, 1, 0, 0, 0, 1, 3, 3, 0, 0, 0], [0, 3, 3, 1, 2, 0, 1, 0, 1, 0, 0, 0, 3, 0, 1, 2, 2, 0], [0, 3, 0, 3, 0, 1, 2, 2, 0, 0, 0, 0, 1, 0, 0, 0, 2, 0], [0, 0, 2, 2, 2, 0, 0, 1, 2, 0, 0, 2, 0, 3, 0, 2, 1, 0], [3, 2, 2, 1, 0, 0, 0, 3, 0, 2, 3, 3, 1, 0, 1, 0, 2, 0], [0, 3, 0, 1, 2, 0, 0, 1, 0, ... | null | null | null | {"x": [8, 14, 2, 9, 15, 16, 15, 5, 4, 10, 10, 12, 17, 7, 5, 4, 12, 15]} | 1 |
construct-rlve-integer-linear-system-l5-s7 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 5 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[17] satisfying all of the following 46 equations:
1*x[0] + 1*x[1] + 1*x[2] + 1*x[3] + 3*x[5] + 1*x[7] + 1*x[8] + 2*x[12] + 1*x[13] + 3*x[17] = 86
3*x[4] + 1*x[5] + 3*x[6] + 1*x[10] + 2*x[11] + 1*x[14] + 2*x[16] = 130
3*x[1] + 1*x[2] + 1*x[3] + 3*x[4] + 3*x[6] + 3*x[7] + 1*x[8] + 2*x[9] + 3*x[... | {"coeffs": [[1, 1, 1, 1, 0, 3, 0, 1, 1, 0, 0, 0, 2, 1, 0, 0, 0, 3], [0, 0, 0, 0, 3, 1, 3, 0, 0, 0, 1, 2, 0, 0, 1, 0, 2, 0], [0, 3, 1, 1, 3, 0, 3, 3, 1, 2, 3, 1, 0, 1, 3, 1, 0, 3], [0, 0, 1, 1, 1, 0, 3, 0, 0, 3, 1, 0, 0, 3, 0, 0, 0, 0], [0, 2, 0, 2, 0, 1, 3, 1, 3, 3, 1, 0, 2, 2, 3, 1, 3, 0], [2, 1, 0, 0, 0, 0, 0, 0, 0, ... | null | null | null | {"x": [1, 1, 5, 16, 7, 7, 10, 4, 2, 9, 16, 9, 5, 11, 6, 7, 16, 5]} | 1 |
construct-rlve-integer-linear-system-l5-s8 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 5 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[17] satisfying all of the following 46 equations:
1*x[0] + 3*x[1] + 1*x[5] + 1*x[6] + 1*x[9] + 1*x[10] + 3*x[13] + 1*x[14] + 3*x[17] = 162
1*x[0] + 1*x[1] + 2*x[2] + 2*x[3] + 1*x[7] + 2*x[8] + 3*x[11] + 2*x[12] + 2*x[13] + 3*x[15] + 3*x[16] = 235
1*x[0] + 3*x[1] + 3*x[2] + 2*x[3] + 1*x[5] + 1... | {"coeffs": [[1, 3, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 3, 1, 0, 0, 3], [1, 1, 2, 2, 0, 0, 0, 1, 2, 0, 0, 3, 2, 2, 0, 3, 3, 0], [1, 3, 3, 2, 0, 1, 1, 0, 2, 1, 0, 3, 0, 0, 0, 2, 1, 1], [2, 0, 0, 2, 3, 0, 0, 0, 1, 1, 1, 3, 1, 2, 2, 1, 2, 0], [0, 0, 0, 0, 2, 0, 3, 3, 0, 0, 0, 0, 0, 3, 3, 0, 3, 2], [0, 0, 0, 3, 3, 2, 0, 2, 1, ... | null | null | null | {"x": [17, 14, 14, 15, 3, 1, 9, 1, 7, 7, 7, 11, 13, 18, 10, 9, 3, 5]} | 1 |
construct-rlve-integer-linear-system-l5-s9 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 5 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[17] satisfying all of the following 50 equations:
2*x[0] + 2*x[1] + 2*x[2] + 1*x[3] + 2*x[6] + 3*x[7] + 3*x[8] + 1*x[11] + 2*x[13] + 1*x[14] + 3*x[17] = 165
3*x[2] + 2*x[5] + 2*x[6] + 2*x[10] + 2*x[11] + 3*x[12] + 3*x[16] = 211
3*x[2] + 1*x[5] + 1*x[8] + 1*x[9] + 2*x[11] + 2*x[12] + 2*x[15] +... | {"coeffs": [[2, 2, 2, 1, 0, 0, 2, 3, 3, 0, 0, 1, 0, 2, 1, 0, 0, 3], [0, 0, 3, 0, 0, 2, 2, 0, 0, 0, 2, 2, 3, 0, 0, 0, 3, 0], [0, 0, 3, 0, 0, 1, 0, 0, 1, 1, 0, 2, 2, 0, 0, 2, 1, 3], [1, 0, 3, 0, 0, 1, 0, 0, 0, 3, 0, 2, 3, 1, 2, 0, 0, 1], [0, 3, 0, 2, 2, 0, 0, 0, 3, 1, 2, 2, 1, 3, 3, 3, 1, 2], [1, 2, 0, 0, 0, 0, 1, 2, 0, ... | null | null | null | {"x": [14, 8, 9, 16, 15, 14, 4, 1, 6, 16, 11, 18, 16, 7, 14, 17, 14, 4]} | 1 |
construct-rlve-integer-linear-system-l6-s0 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 6 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[25] satisfying all of the following 72 equations:
1*x[0] + 1*x[1] + 3*x[3] + 1*x[7] + 4*x[10] + 2*x[11] + 2*x[12] + 2*x[13] + 1*x[18] + 4*x[19] + 2*x[20] + 5*x[21] + 3*x[22] + 2*x[25] = 440
5*x[1] + 1*x[2] + 2*x[3] + 3*x[4] + 4*x[5] + 5*x[6] + 3*x[8] + 4*x[9] + 3*x[10] + 1*x[11] + 5*x[14] + 5... | {"coeffs": [[1, 1, 0, 3, 0, 0, 0, 1, 0, 0, 4, 2, 2, 2, 0, 0, 0, 0, 1, 4, 2, 5, 3, 0, 0, 2], [0, 5, 1, 2, 3, 4, 5, 0, 3, 4, 3, 1, 0, 0, 5, 0, 0, 5, 0, 3, 4, 0, 1, 0, 2, 3], [2, 0, 0, 0, 2, 0, 5, 2, 0, 1, 0, 0, 3, 0, 0, 0, 1, 0, 4, 0, 0, 5, 1, 4, 2, 0], [0, 5, 2, 0, 0, 4, 0, 0, 3, 0, 5, 1, 0, 0, 0, 0, 0, 0, 3, 5, 0, 2, 0... | null | null | null | {"x": [4, 9, 13, 20, 14, 3, 16, 14, 3, 3, 12, 26, 14, 2, 1, 13, 20, 13, 14, 13, 14, 14, 13, 5, 25, 9]} | 1 |
construct-rlve-integer-linear-system-l6-s1 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 6 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[25] satisfying all of the following 78 equations:
1*x[5] + 1*x[6] + 2*x[7] + 4*x[8] + 3*x[9] + 5*x[10] + 1*x[11] + 2*x[12] + 2*x[13] + 2*x[14] + 5*x[16] + 5*x[17] + 2*x[18] + 5*x[22] + 1*x[25] = 478
1*x[0] + 3*x[3] + 1*x[4] + 1*x[6] + 3*x[7] + 5*x[9] + 5*x[10] + 5*x[11] + 3*x[12] + 1*x[13] + ... | {"coeffs": [[0, 0, 0, 0, 0, 1, 1, 2, 4, 3, 5, 1, 2, 2, 2, 0, 5, 5, 2, 0, 0, 0, 5, 0, 0, 1], [1, 0, 0, 3, 1, 0, 1, 3, 0, 5, 5, 5, 3, 1, 0, 5, 0, 3, 0, 1, 5, 2, 1, 3, 0, 2], [0, 1, 0, 0, 2, 0, 0, 0, 0, 3, 4, 3, 4, 1, 4, 5, 1, 0, 5, 3, 0, 0, 0, 0, 2, 0], [0, 4, 1, 4, 4, 2, 0, 0, 1, 0, 0, 0, 1, 0, 3, 0, 2, 1, 0, 0, 0, 1, 0... | null | null | null | {"x": [10, 24, 4, 20, 23, 19, 14, 6, 16, 20, 3, 24, 10, 21, 25, 24, 4, 13, 3, 19, 5, 2, 12, 22, 3, 7]} | 1 |
construct-rlve-integer-linear-system-l6-s2 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 6 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[25] satisfying all of the following 62 equations:
5*x[0] + 3*x[1] + 1*x[3] + 1*x[5] + 1*x[7] + 1*x[8] + 4*x[9] + 2*x[10] + 4*x[12] + 5*x[15] + 1*x[19] + 3*x[23] + 1*x[25] = 240
3*x[1] + 4*x[5] + 1*x[7] + 5*x[8] + 1*x[9] + 5*x[10] + 5*x[13] + 5*x[14] + 2*x[16] + 4*x[17] + 4*x[19] + 4*x[20] = 5... | {"coeffs": [[5, 3, 0, 1, 0, 1, 0, 1, 1, 4, 2, 0, 4, 0, 0, 5, 0, 0, 0, 1, 0, 0, 0, 3, 0, 1], [0, 3, 0, 0, 0, 4, 0, 1, 5, 1, 5, 0, 0, 5, 5, 0, 2, 4, 0, 4, 4, 0, 0, 0, 0, 0], [1, 0, 0, 0, 0, 3, 5, 1, 0, 0, 0, 0, 1, 0, 0, 5, 5, 0, 2, 0, 5, 2, 0, 0, 0, 0], [1, 1, 0, 4, 4, 0, 0, 0, 4, 1, 0, 0, 0, 2, 4, 0, 4, 0, 0, 4, 5, 0, 0... | null | null | null | {"x": [2, 6, 2, 20, 3, 17, 5, 18, 2, 9, 6, 7, 8, 21, 7, 6, 14, 26, 2, 9, 25, 7, 18, 7, 16, 15]} | 1 |
construct-rlve-integer-linear-system-l6-s3 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 6 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[25] satisfying all of the following 57 equations:
3*x[0] + 5*x[1] + 3*x[2] + 5*x[3] + 1*x[4] + 4*x[8] + 3*x[10] + 4*x[11] + 1*x[12] + 3*x[13] + 2*x[15] + 3*x[17] + 2*x[18] + 4*x[19] + 4*x[20] + 2*x[21] + 2*x[25] = 685
2*x[2] + 2*x[3] + 4*x[5] + 4*x[8] + 1*x[9] + 2*x[13] + 5*x[15] + 1*x[23] + ... | {"coeffs": [[3, 5, 3, 5, 1, 0, 0, 0, 4, 0, 3, 4, 1, 3, 0, 2, 0, 3, 2, 4, 4, 2, 0, 0, 0, 2], [0, 0, 2, 2, 0, 4, 0, 0, 4, 1, 0, 0, 0, 2, 0, 5, 0, 0, 0, 0, 0, 0, 0, 1, 2, 1], [2, 0, 3, 1, 0, 0, 5, 0, 0, 0, 4, 0, 0, 0, 1, 0, 0, 0, 5, 0, 0, 3, 1, 1, 3, 1], [0, 3, 1, 0, 0, 0, 5, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 2, 4... | null | null | null | {"x": [16, 15, 14, 4, 22, 10, 14, 12, 14, 1, 6, 20, 22, 19, 10, 4, 2, 19, 15, 20, 1, 13, 26, 14, 25, 20]} | 1 |
construct-rlve-integer-linear-system-l6-s4 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 6 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[25] satisfying all of the following 57 equations:
2*x[0] + 5*x[1] + 1*x[2] + 3*x[3] + 4*x[4] + 4*x[10] + 1*x[15] + 3*x[17] + 2*x[21] + 3*x[22] + 5*x[23] = 358
2*x[0] + 5*x[1] + 4*x[3] + 3*x[4] + 3*x[7] + 3*x[9] + 4*x[10] + 2*x[12] + 2*x[14] + 5*x[15] + 4*x[16] + 3*x[21] + 3*x[22] = 556
4*x[0]... | {"coeffs": [[2, 5, 1, 3, 4, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 1, 0, 3, 0, 0, 0, 2, 3, 5, 0, 0], [2, 5, 0, 4, 3, 0, 0, 3, 0, 3, 4, 0, 2, 0, 2, 5, 4, 0, 0, 0, 0, 3, 3, 0, 0, 0], [4, 5, 5, 0, 3, 0, 0, 0, 0, 0, 3, 4, 3, 3, 3, 0, 5, 0, 0, 4, 1, 0, 0, 0, 3, 3], [0, 0, 2, 2, 5, 0, 0, 2, 0, 4, 0, 0, 0, 2, 2, 1, 2, 0, 2, 3, 0, 0, 0... | null | null | null | {"x": [5, 2, 20, 25, 11, 10, 24, 13, 3, 21, 12, 13, 14, 5, 9, 4, 16, 6, 2, 22, 5, 24, 17, 6, 17, 4]} | 1 |
construct-rlve-integer-linear-system-l6-s5 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 6 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[25] satisfying all of the following 72 equations:
1*x[1] + 1*x[3] + 2*x[5] + 4*x[13] + 2*x[15] + 2*x[16] + 4*x[19] + 3*x[20] + 3*x[21] + 5*x[24] = 325
1*x[0] + 5*x[2] + 5*x[5] + 2*x[6] + 2*x[7] + 2*x[11] + 3*x[12] + 2*x[19] + 3*x[22] + 2*x[23] + 1*x[24] + 2*x[25] = 338
5*x[9] + 2*x[10] + 3*x[... | {"coeffs": [[0, 1, 0, 1, 0, 2, 0, 0, 0, 0, 0, 0, 0, 4, 0, 2, 2, 0, 0, 4, 3, 3, 0, 0, 5, 0], [1, 0, 5, 0, 0, 5, 2, 2, 0, 0, 0, 2, 3, 0, 0, 0, 0, 0, 0, 2, 0, 0, 3, 2, 1, 2], [0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 2, 3, 0, 0, 0, 0, 5, 0, 1, 0, 5, 1, 0, 0, 0, 0], [0, 5, 0, 4, 5, 2, 5, 0, 0, 2, 0, 4, 3, 4, 0, 0, 2, 0, 3, 4, 0, 3, 0... | null | null | null | {"x": [7, 12, 13, 12, 13, 3, 23, 26, 6, 13, 22, 2, 2, 8, 9, 2, 25, 16, 19, 14, 10, 6, 6, 15, 21, 23]} | 1 |
construct-rlve-integer-linear-system-l6-s6 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 6 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[25] satisfying all of the following 78 equations:
5*x[3] + 4*x[4] + 2*x[5] + 2*x[6] + 4*x[7] + 1*x[9] + 1*x[11] + 2*x[13] + 1*x[14] + 2*x[16] + 1*x[18] + 3*x[19] + 1*x[21] + 4*x[25] = 477
5*x[0] + 2*x[3] + 2*x[4] + 2*x[11] + 2*x[12] + 3*x[13] + 3*x[15] + 3*x[16] + 4*x[17] + 4*x[21] + 4*x[22] ... | {"coeffs": [[0, 0, 0, 5, 4, 2, 2, 4, 0, 1, 0, 1, 0, 2, 1, 0, 2, 0, 1, 3, 0, 1, 0, 0, 0, 4], [5, 0, 0, 2, 2, 0, 0, 0, 0, 0, 0, 2, 2, 3, 0, 3, 3, 4, 0, 0, 0, 4, 4, 4, 0, 0], [5, 5, 1, 3, 0, 3, 0, 4, 5, 0, 5, 3, 3, 0, 0, 3, 5, 0, 0, 0, 0, 5, 1, 0, 3, 0], [0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 2, 0, 3, 0, 0, 5, 3, 4, 0, 0, 0... | null | null | null | {"x": [8, 18, 22, 10, 13, 9, 18, 12, 6, 23, 11, 24, 8, 6, 23, 17, 9, 7, 1, 25, 9, 1, 19, 26, 5, 24]} | 1 |
construct-rlve-integer-linear-system-l6-s7 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 6 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[25] satisfying all of the following 78 equations:
4*x[0] + 5*x[1] + 1*x[3] + 5*x[7] + 2*x[8] + 2*x[12] + 2*x[17] + 2*x[23] = 302
2*x[0] + 5*x[1] + 5*x[3] + 1*x[6] + 5*x[7] + 2*x[8] + 4*x[10] + 1*x[11] + 3*x[18] + 2*x[23] + 1*x[25] = 350
1*x[0] + 4*x[2] + 3*x[6] + 2*x[7] + 4*x[9] + 1*x[10] + 2... | {"coeffs": [[4, 5, 0, 1, 0, 0, 0, 5, 2, 0, 0, 0, 2, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 2, 0, 0], [2, 5, 0, 5, 0, 0, 1, 5, 2, 0, 4, 1, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 2, 0, 1], [1, 0, 4, 0, 0, 0, 3, 2, 0, 4, 1, 2, 1, 4, 2, 2, 1, 1, 0, 0, 0, 0, 1, 0, 2, 0], [0, 2, 5, 3, 0, 2, 4, 0, 0, 0, 0, 0, 3, 5, 0, 2, 0, 2, 3, 0, 4, 0, 0... | null | null | null | {"x": [17, 1, 25, 7, 19, 2, 19, 24, 12, 3, 19, 9, 25, 17, 8, 26, 10, 12, 1, 25, 3, 10, 20, 2, 19, 21]} | 1 |
construct-rlve-integer-linear-system-l6-s8 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 6 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[25] satisfying all of the following 62 equations:
2*x[1] + 2*x[5] + 1*x[6] + 5*x[10] + 5*x[13] + 5*x[15] + 1*x[16] + 3*x[17] + 4*x[18] + 4*x[21] + 4*x[22] + 5*x[24] + 2*x[25] = 696
2*x[0] + 5*x[1] + 4*x[2] + 3*x[4] + 4*x[5] + 4*x[8] + 3*x[9] + 2*x[13] + 3*x[16] + 4*x[18] + 5*x[20] + 2*x[23] +... | {"coeffs": [[0, 2, 0, 0, 0, 2, 1, 0, 0, 0, 5, 0, 0, 5, 0, 5, 1, 3, 4, 0, 0, 4, 4, 0, 5, 2], [2, 5, 4, 0, 3, 4, 0, 0, 4, 3, 0, 0, 0, 2, 0, 0, 3, 0, 4, 0, 5, 0, 0, 2, 1, 0], [0, 4, 0, 0, 5, 5, 0, 0, 0, 0, 0, 5, 2, 0, 0, 0, 1, 0, 5, 2, 3, 2, 5, 4, 0, 0], [5, 3, 0, 0, 1, 1, 5, 4, 0, 1, 0, 0, 3, 0, 1, 0, 0, 2, 5, 5, 0, 0, 2... | null | null | null | {"x": [13, 2, 22, 22, 18, 18, 14, 9, 25, 14, 20, 16, 9, 15, 4, 26, 7, 23, 6, 22, 23, 17, 4, 9, 25, 14]} | 1 |
construct-rlve-integer-linear-system-l6-s9 | construct | rlve_integer_linear_system | integer_linear_system | algebra | competition | 6 | RLVE-Gym/gaussian_elimination | MIT | [
"agentic_trivial"
] | Find integers x[0], ..., x[25] satisfying all of the following 67 equations:
2*x[2] + 5*x[5] + 3*x[6] + 1*x[10] + 4*x[14] + 1*x[15] + 4*x[17] + 2*x[18] + 5*x[20] + 1*x[22] + 3*x[25] = 485
5*x[4] + 3*x[5] + 1*x[7] + 3*x[8] + 4*x[9] + 2*x[12] + 1*x[13] + 4*x[14] + 3*x[15] + 3*x[18] + 5*x[21] + 1*x[23] = 522
4*x[2] + 2*x[... | {"coeffs": [[0, 0, 2, 0, 0, 5, 3, 0, 0, 0, 1, 0, 0, 0, 4, 1, 0, 4, 2, 0, 5, 0, 1, 0, 0, 3], [0, 0, 0, 0, 5, 3, 0, 1, 3, 4, 0, 0, 2, 1, 4, 3, 0, 0, 3, 0, 0, 5, 0, 1, 0, 0], [0, 0, 4, 0, 2, 1, 0, 2, 0, 2, 0, 0, 2, 2, 0, 3, 2, 1, 0, 0, 0, 2, 0, 0, 4, 3], [0, 0, 2, 5, 0, 4, 0, 0, 5, 0, 1, 2, 0, 4, 0, 4, 4, 3, 0, 0, 2, 1, 1... | null | null | null | {"x": [9, 10, 26, 21, 11, 24, 10, 17, 2, 23, 20, 19, 13, 3, 6, 17, 5, 22, 21, 14, 8, 21, 22, 8, 18, 10]} | 1 |
construct-rlve-largest-convex-polygon-l1-s0 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 1 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 6 points in the plane, indexed 0..5 (distinct, no three collinear):
0: (4, 4)
1: (6, 2)
2: (3, 1)
3: (3, 3)
4: (1, 6)
5: (6, 3)
The largest subset of these points in convex position has exactly 5 points. Find 5 distinct points that are the vertices of a convex polygon (every chosen point is a vertex of t... | {"points": [[4, 4], [6, 2], [3, 1], [3, 3], [1, 6], [6, 3]], "k": 5, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [2, 3, 0, 5, 1]} | 1 |
construct-rlve-largest-convex-polygon-l1-s1 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 1 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 6 points in the plane, indexed 0..5 (distinct, no three collinear):
0: (3, 1)
1: (4, 6)
2: (5, 1)
3: (3, 0)
4: (2, 5)
5: (1, 3)
The largest subset of these points in convex position has exactly 5 points. Find 5 distinct points that are the vertices of a convex polygon (every chosen point is a vertex of t... | {"points": [[3, 1], [4, 6], [5, 1], [3, 0], [2, 5], [1, 3]], "k": 5, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [5, 4, 1, 2, 0]} | 1 |
construct-rlve-largest-convex-polygon-l1-s2 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 1 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 6 points in the plane, indexed 0..5 (distinct, no three collinear):
0: (6, 2)
1: (4, 5)
2: (5, 6)
3: (6, 6)
4: (3, 2)
5: (2, 5)
The largest subset of these points in convex position has exactly 5 points. Find 5 distinct points that are the vertices of a convex polygon (every chosen point is a vertex of t... | {"points": [[6, 2], [4, 5], [5, 6], [6, 6], [3, 2], [2, 5]], "k": 5, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [4, 1, 2, 3, 0]} | 1 |
construct-rlve-largest-convex-polygon-l1-s3 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 1 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 6 points in the plane, indexed 0..5 (distinct, no three collinear):
0: (0, 1)
1: (4, 0)
2: (4, 3)
3: (6, 1)
4: (0, 2)
5: (2, 6)
The largest subset of these points in convex position has exactly 5 points. Find 5 distinct points that are the vertices of a convex polygon (every chosen point is a vertex of t... | {"points": [[0, 1], [4, 0], [4, 3], [6, 1], [0, 2], [2, 6]], "k": 5, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [0, 4, 5, 2, 1]} | 1 |
construct-rlve-largest-convex-polygon-l1-s4 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 1 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 6 points in the plane, indexed 0..5 (distinct, no three collinear):
0: (5, 5)
1: (3, 1)
2: (1, 1)
3: (4, 5)
4: (2, 6)
5: (6, 3)
The largest subset of these points in convex position has exactly 5 points. Find 5 distinct points that are the vertices of a convex polygon (every chosen point is a vertex of t... | {"points": [[5, 5], [3, 1], [1, 1], [4, 5], [2, 6], [6, 3]], "k": 5, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [2, 4, 3, 5, 1]} | 1 |
construct-rlve-largest-convex-polygon-l1-s5 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 1 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 6 points in the plane, indexed 0..5 (distinct, no three collinear):
0: (1, 2)
1: (1, 1)
2: (5, 4)
3: (6, 0)
4: (5, 3)
5: (4, 1)
The largest subset of these points in convex position has exactly 5 points. Find 5 distinct points that are the vertices of a convex polygon (every chosen point is a vertex of t... | {"points": [[1, 2], [1, 1], [5, 4], [6, 0], [5, 3], [4, 1]], "k": 5, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [1, 0, 2, 4, 5]} | 1 |
construct-rlve-largest-convex-polygon-l1-s6 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 1 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 6 points in the plane, indexed 0..5 (distinct, no three collinear):
0: (6, 2)
1: (3, 4)
2: (5, 3)
3: (4, 6)
4: (0, 5)
5: (6, 6)
The largest subset of these points in convex position has exactly 4 points. Find 4 distinct points that are the vertices of a convex polygon (every chosen point is a vertex of t... | {"points": [[6, 2], [3, 4], [5, 3], [4, 6], [0, 5], [6, 6]], "k": 4, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [1, 3, 5, 2]} | 1 |
construct-rlve-largest-convex-polygon-l1-s7 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 1 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 6 points in the plane, indexed 0..5 (distinct, no three collinear):
0: (2, 4)
1: (6, 4)
2: (2, 6)
3: (0, 5)
4: (1, 0)
5: (5, 2)
The largest subset of these points in convex position has exactly 5 points. Find 5 distinct points that are the vertices of a convex polygon (every chosen point is a vertex of t... | {"points": [[2, 4], [6, 4], [2, 6], [0, 5], [1, 0], [5, 2]], "k": 5, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [3, 2, 1, 5, 4]} | 1 |
construct-rlve-largest-convex-polygon-l1-s8 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 1 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 6 points in the plane, indexed 0..5 (distinct, no three collinear):
0: (6, 5)
1: (3, 0)
2: (2, 3)
3: (0, 6)
4: (5, 3)
5: (2, 5)
The largest subset of these points in convex position has exactly 5 points. Find 5 distinct points that are the vertices of a convex polygon (every chosen point is a vertex of t... | {"points": [[6, 5], [3, 0], [2, 3], [0, 6], [5, 3], [2, 5]], "k": 5, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [2, 5, 0, 4, 1]} | 1 |
construct-rlve-largest-convex-polygon-l1-s9 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 1 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 6 points in the plane, indexed 0..5 (distinct, no three collinear):
0: (2, 4)
1: (4, 0)
2: (4, 1)
3: (1, 4)
4: (2, 6)
5: (1, 3)
The largest subset of these points in convex position has exactly 5 points. Find 5 distinct points that are the vertices of a convex polygon (every chosen point is a vertex of t... | {"points": [[2, 4], [4, 0], [4, 1], [1, 4], [2, 6], [1, 3]], "k": 5, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [5, 3, 0, 2, 1]} | 1 |
construct-rlve-largest-convex-polygon-l2-s0 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 2 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 9 points in the plane, indexed 0..8 (distinct, no three collinear):
0: (9, 7)
1: (4, 0)
2: (7, 1)
3: (6, 8)
4: (1, 7)
5: (4, 8)
6: (7, 2)
7: (6, 3)
8: (1, 3)
The largest subset of these points in convex position has exactly 7 points. Find 7 distinct points that are the vertices of a convex polygon (every... | {"points": [[9, 7], [4, 0], [7, 1], [6, 8], [1, 7], [4, 8], [7, 2], [6, 3], [1, 3]], "k": 7, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [8, 4, 5, 3, 0, 6, 1]} | 1 |
construct-rlve-largest-convex-polygon-l2-s1 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 2 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 9 points in the plane, indexed 0..8 (distinct, no three collinear):
0: (0, 1)
1: (0, 7)
2: (3, 7)
3: (6, 8)
4: (1, 8)
5: (6, 4)
6: (3, 2)
7: (4, 1)
8: (5, 2)
The largest subset of these points in convex position has exactly 7 points. Find 7 distinct points that are the vertices of a convex polygon (every... | {"points": [[0, 1], [0, 7], [3, 7], [6, 8], [1, 8], [6, 4], [3, 2], [4, 1], [5, 2]], "k": 7, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [0, 1, 4, 2, 5, 8, 7]} | 1 |
construct-rlve-largest-convex-polygon-l2-s2 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 2 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 9 points in the plane, indexed 0..8 (distinct, no three collinear):
0: (1, 3)
1: (0, 0)
2: (5, 8)
3: (4, 6)
4: (5, 0)
5: (9, 8)
6: (3, 2)
7: (6, 3)
8: (9, 7)
The largest subset of these points in convex position has exactly 6 points. Find 6 distinct points that are the vertices of a convex polygon (every... | {"points": [[1, 3], [0, 0], [5, 8], [4, 6], [5, 0], [9, 8], [3, 2], [6, 3], [9, 7]], "k": 6, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [0, 3, 5, 8, 7, 6]} | 1 |
construct-rlve-largest-convex-polygon-l2-s3 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 2 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 9 points in the plane, indexed 0..8 (distinct, no three collinear):
0: (1, 1)
1: (9, 6)
2: (0, 9)
3: (4, 2)
4: (5, 7)
5: (9, 8)
6: (5, 3)
7: (6, 3)
8: (7, 8)
The largest subset of these points in convex position has exactly 7 points. Find 7 distinct points that are the vertices of a convex polygon (every... | {"points": [[1, 1], [9, 6], [0, 9], [4, 2], [5, 7], [9, 8], [5, 3], [6, 3], [7, 8]], "k": 7, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [0, 4, 8, 5, 1, 7, 3]} | 1 |
construct-rlve-largest-convex-polygon-l2-s4 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 2 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 9 points in the plane, indexed 0..8 (distinct, no three collinear):
0: (6, 2)
1: (4, 3)
2: (6, 8)
3: (1, 8)
4: (5, 1)
5: (4, 5)
6: (3, 3)
7: (9, 7)
8: (8, 5)
The largest subset of these points in convex position has exactly 7 points. Find 7 distinct points that are the vertices of a convex polygon (every... | {"points": [[6, 2], [4, 3], [6, 8], [1, 8], [5, 1], [4, 5], [3, 3], [9, 7], [8, 5]], "k": 7, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [1, 5, 2, 7, 8, 0, 4]} | 1 |
construct-rlve-largest-convex-polygon-l2-s5 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 2 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 9 points in the plane, indexed 0..8 (distinct, no three collinear):
0: (0, 1)
1: (2, 7)
2: (3, 1)
3: (9, 2)
4: (0, 6)
5: (6, 7)
6: (9, 5)
7: (1, 6)
8: (2, 8)
The largest subset of these points in convex position has exactly 7 points. Find 7 distinct points that are the vertices of a convex polygon (every... | {"points": [[0, 1], [2, 7], [3, 1], [9, 2], [0, 6], [6, 7], [9, 5], [1, 6], [2, 8]], "k": 7, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [0, 7, 1, 5, 6, 3, 2]} | 1 |
construct-rlve-largest-convex-polygon-l2-s6 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 2 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 9 points in the plane, indexed 0..8 (distinct, no three collinear):
0: (8, 8)
1: (9, 0)
2: (6, 1)
3: (9, 6)
4: (5, 1)
5: (2, 3)
6: (7, 9)
7: (8, 9)
8: (2, 5)
The largest subset of these points in convex position has exactly 7 points. Find 7 distinct points that are the vertices of a convex polygon (every... | {"points": [[8, 8], [9, 0], [6, 1], [9, 6], [5, 1], [2, 3], [7, 9], [8, 9], [2, 5]], "k": 7, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [5, 8, 6, 0, 3, 1, 2]} | 1 |
construct-rlve-largest-convex-polygon-l2-s7 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 2 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 9 points in the plane, indexed 0..8 (distinct, no three collinear):
0: (7, 4)
1: (1, 2)
2: (2, 8)
3: (0, 0)
4: (3, 7)
5: (6, 7)
6: (7, 6)
7: (0, 5)
8: (5, 2)
The largest subset of these points in convex position has exactly 7 points. Find 7 distinct points that are the vertices of a convex polygon (every... | {"points": [[7, 4], [1, 2], [2, 8], [0, 0], [3, 7], [6, 7], [7, 6], [0, 5], [5, 2]], "k": 7, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [3, 7, 4, 5, 6, 0, 8]} | 1 |
construct-rlve-largest-convex-polygon-l2-s8 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 2 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 9 points in the plane, indexed 0..8 (distinct, no three collinear):
0: (0, 7)
1: (1, 2)
2: (2, 1)
3: (5, 8)
4: (6, 8)
5: (2, 0)
6: (0, 6)
7: (3, 3)
8: (6, 6)
The largest subset of these points in convex position has exactly 7 points. Find 7 distinct points that are the vertices of a convex polygon (every... | {"points": [[0, 7], [1, 2], [2, 1], [5, 8], [6, 8], [2, 0], [0, 6], [3, 3], [6, 6]], "k": 7, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [6, 0, 3, 4, 8, 7, 1]} | 1 |
construct-rlve-largest-convex-polygon-l2-s9 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 2 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 9 points in the plane, indexed 0..8 (distinct, no three collinear):
0: (0, 1)
1: (9, 0)
2: (7, 7)
3: (3, 4)
4: (8, 7)
5: (7, 6)
6: (6, 0)
7: (6, 6)
8: (9, 4)
The largest subset of these points in convex position has exactly 7 points. Find 7 distinct points that are the vertices of a convex polygon (every... | {"points": [[0, 1], [9, 0], [7, 7], [3, 4], [8, 7], [7, 6], [6, 0], [6, 6], [9, 4]], "k": 7, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [0, 3, 7, 5, 8, 1, 6]} | 1 |
construct-rlve-largest-convex-polygon-l3-s0 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 3 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 13 points in the plane, indexed 0..12 (distinct, no three collinear):
0: (12, 7)
1: (2, 10)
2: (0, 9)
3: (10, 13)
4: (5, 13)
5: (11, 12)
6: (4, 5)
7: (12, 6)
8: (2, 6)
9: (11, 5)
10: (8, 12)
11: (5, 3)
12: (9, 7)
The largest subset of these points in convex position has exactly 9 points. Find 9 distinct ... | {"points": [[12, 7], [2, 10], [0, 9], [10, 13], [5, 13], [11, 12], [4, 5], [12, 6], [2, 6], [11, 5], [8, 12], [5, 3], [9, 7]], "k": 9, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [1, 4, 3, 5, 0, 7, 9, 11, 6]} | 1 |
construct-rlve-largest-convex-polygon-l3-s1 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 3 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 13 points in the plane, indexed 0..12 (distinct, no three collinear):
0: (0, 1)
1: (2, 4)
2: (10, 5)
3: (8, 4)
4: (4, 13)
5: (7, 1)
6: (7, 10)
7: (9, 2)
8: (5, 13)
9: (2, 9)
10: (9, 5)
11: (1, 0)
12: (6, 9)
The largest subset of these points in convex position has exactly 9 points. Find 9 distinct points... | {"points": [[0, 1], [2, 4], [10, 5], [8, 4], [4, 13], [7, 1], [7, 10], [9, 2], [5, 13], [2, 9], [9, 5], [1, 0], [6, 9]], "k": 9, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [0, 9, 4, 8, 6, 10, 7, 5, 11]} | 1 |
construct-rlve-largest-convex-polygon-l3-s2 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 3 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 13 points in the plane, indexed 0..12 (distinct, no three collinear):
0: (9, 0)
1: (13, 4)
2: (12, 7)
3: (3, 4)
4: (13, 1)
5: (8, 7)
6: (7, 10)
7: (7, 3)
8: (8, 13)
9: (2, 3)
10: (5, 10)
11: (6, 0)
12: (10, 9)
The largest subset of these points in convex position has exactly 9 points. Find 9 distinct poi... | {"points": [[9, 0], [13, 4], [12, 7], [3, 4], [13, 1], [8, 7], [7, 10], [7, 3], [8, 13], [2, 3], [5, 10], [6, 0], [10, 9]], "k": 9, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [3, 10, 6, 12, 2, 1, 4, 0, 11]} | 1 |
construct-rlve-largest-convex-polygon-l3-s3 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 3 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 13 points in the plane, indexed 0..12 (distinct, no three collinear):
0: (10, 5)
1: (1, 2)
2: (8, 4)
3: (11, 0)
4: (7, 10)
5: (11, 9)
6: (9, 2)
7: (3, 10)
8: (2, 3)
9: (4, 8)
10: (5, 3)
11: (1, 9)
12: (2, 8)
The largest subset of these points in convex position has exactly 8 points. Find 8 distinct point... | {"points": [[10, 5], [1, 2], [8, 4], [11, 0], [7, 10], [11, 9], [9, 2], [3, 10], [2, 3], [4, 8], [5, 3], [1, 9], [2, 8]], "k": 8, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [1, 12, 7, 4, 5, 0, 2, 10]} | 1 |
construct-rlve-largest-convex-polygon-l3-s4 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 3 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 13 points in the plane, indexed 0..12 (distinct, no three collinear):
0: (5, 5)
1: (8, 4)
2: (13, 1)
3: (0, 3)
4: (4, 12)
5: (5, 1)
6: (3, 10)
7: (2, 0)
8: (2, 13)
9: (10, 10)
10: (7, 5)
11: (0, 11)
12: (11, 8)
The largest subset of these points in convex position has exactly 8 points. Find 8 distinct po... | {"points": [[5, 5], [8, 4], [13, 1], [0, 3], [4, 12], [5, 1], [3, 10], [2, 0], [2, 13], [10, 10], [7, 5], [0, 11], [11, 8]], "k": 8, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [3, 11, 8, 4, 12, 1, 5, 7]} | 1 |
construct-rlve-largest-convex-polygon-l3-s5 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 3 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 13 points in the plane, indexed 0..12 (distinct, no three collinear):
0: (6, 12)
1: (6, 2)
2: (8, 4)
3: (3, 7)
4: (4, 12)
5: (12, 3)
6: (4, 2)
7: (3, 9)
8: (9, 8)
9: (12, 5)
10: (13, 5)
11: (1, 9)
12: (11, 11)
The largest subset of these points in convex position has exactly 9 points. Find 9 distinct poi... | {"points": [[6, 12], [6, 2], [8, 4], [3, 7], [4, 12], [12, 3], [4, 2], [3, 9], [9, 8], [12, 5], [13, 5], [1, 9], [11, 11]], "k": 9, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [3, 7, 4, 0, 12, 9, 5, 1, 6]} | 1 |
construct-rlve-largest-convex-polygon-l3-s6 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 3 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 13 points in the plane, indexed 0..12 (distinct, no three collinear):
0: (4, 4)
1: (4, 10)
2: (9, 10)
3: (13, 1)
4: (1, 1)
5: (0, 9)
6: (12, 13)
7: (9, 2)
8: (2, 9)
9: (7, 6)
10: (7, 12)
11: (3, 12)
12: (2, 5)
The largest subset of these points in convex position has exactly 8 points. Find 8 distinct poi... | {"points": [[4, 4], [4, 10], [9, 10], [13, 1], [1, 1], [0, 9], [12, 13], [9, 2], [2, 9], [7, 6], [7, 12], [3, 12], [2, 5]], "k": 8, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [5, 11, 10, 2, 3, 7, 0, 12]} | 1 |
construct-rlve-largest-convex-polygon-l3-s7 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 3 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 13 points in the plane, indexed 0..12 (distinct, no three collinear):
0: (4, 10)
1: (9, 0)
2: (3, 8)
3: (0, 4)
4: (11, 0)
5: (10, 13)
6: (11, 12)
7: (6, 7)
8: (9, 8)
9: (2, 12)
10: (4, 11)
11: (7, 11)
12: (5, 2)
The largest subset of these points in convex position has exactly 7 points. Find 7 distinct p... | {"points": [[4, 10], [9, 0], [3, 8], [0, 4], [11, 0], [10, 13], [11, 12], [6, 7], [9, 8], [2, 12], [4, 11], [7, 11], [5, 2]], "k": 7, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [0, 10, 11, 8, 4, 1, 12]} | 1 |
construct-rlve-largest-convex-polygon-l3-s8 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 3 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 13 points in the plane, indexed 0..12 (distinct, no three collinear):
0: (1, 12)
1: (6, 5)
2: (3, 1)
3: (6, 1)
4: (10, 4)
5: (13, 10)
6: (3, 10)
7: (13, 13)
8: (2, 3)
9: (8, 3)
10: (11, 5)
11: (9, 11)
12: (9, 7)
The largest subset of these points in convex position has exactly 8 points. Find 8 distinct p... | {"points": [[1, 12], [6, 5], [3, 1], [6, 1], [10, 4], [13, 10], [3, 10], [13, 13], [2, 3], [8, 3], [11, 5], [9, 11], [9, 7]], "k": 8, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [0, 11, 5, 10, 4, 9, 2, 8]} | 1 |
construct-rlve-largest-convex-polygon-l3-s9 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 3 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 13 points in the plane, indexed 0..12 (distinct, no three collinear):
0: (4, 4)
1: (10, 11)
2: (7, 7)
3: (1, 5)
4: (5, 8)
5: (7, 0)
6: (10, 1)
7: (0, 2)
8: (2, 6)
9: (5, 6)
10: (6, 0)
11: (12, 5)
12: (1, 9)
The largest subset of these points in convex position has exactly 9 points. Find 9 distinct points... | {"points": [[4, 4], [10, 11], [7, 7], [1, 5], [5, 8], [7, 0], [10, 1], [0, 2], [2, 6], [5, 6], [6, 0], [12, 5], [1, 9]], "k": 9, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [7, 3, 8, 4, 1, 11, 6, 5, 10]} | 1 |
construct-rlve-largest-convex-polygon-l4-s0 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 4 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 18 points in the plane, indexed 0..17 (distinct, no three collinear):
0: (2, 14)
1: (16, 16)
2: (7, 7)
3: (14, 17)
4: (1, 11)
5: (12, 16)
6: (3, 7)
7: (1, 15)
8: (18, 10)
9: (17, 3)
10: (13, 0)
11: (18, 12)
12: (15, 3)
13: (8, 2)
14: (7, 5)
15: (0, 14)
16: (14, 15)
17: (13, 11)
The largest subset of thes... | {"points": [[2, 14], [16, 16], [7, 7], [14, 17], [1, 11], [12, 16], [3, 7], [1, 15], [18, 10], [17, 3], [13, 0], [18, 12], [15, 3], [8, 2], [7, 5], [0, 14], [14, 15], [13, 11]], "k": 11, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [15, 7, 5, 16, 11, 8, 9, 12, 14, 6, 4]} | 1 |
construct-rlve-largest-convex-polygon-l4-s1 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 4 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 18 points in the plane, indexed 0..17 (distinct, no three collinear):
0: (15, 12)
1: (8, 7)
2: (9, 12)
3: (12, 13)
4: (18, 13)
5: (15, 1)
6: (4, 15)
7: (13, 3)
8: (5, 10)
9: (2, 5)
10: (13, 6)
11: (18, 2)
12: (2, 2)
13: (8, 6)
14: (16, 8)
15: (16, 14)
16: (6, 3)
17: (7, 14)
The largest subset of these po... | {"points": [[15, 12], [8, 7], [9, 12], [12, 13], [18, 13], [15, 1], [4, 15], [13, 3], [5, 10], [2, 5], [13, 6], [18, 2], [2, 2], [8, 6], [16, 8], [16, 14], [6, 3], [7, 14]], "k": 10, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [12, 9, 8, 2, 3, 15, 4, 14, 10, 16]} | 1 |
construct-rlve-largest-convex-polygon-l4-s2 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 4 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 18 points in the plane, indexed 0..17 (distinct, no three collinear):
0: (2, 14)
1: (12, 11)
2: (1, 2)
3: (5, 12)
4: (2, 1)
5: (11, 16)
6: (18, 7)
7: (12, 8)
8: (1, 9)
9: (9, 12)
10: (13, 10)
11: (18, 16)
12: (11, 15)
13: (4, 8)
14: (0, 18)
15: (14, 2)
16: (4, 17)
17: (13, 11)
The largest subset of these... | {"points": [[2, 14], [12, 11], [1, 2], [5, 12], [2, 1], [11, 16], [18, 7], [12, 8], [1, 9], [9, 12], [13, 10], [18, 16], [11, 15], [4, 8], [0, 18], [14, 2], [4, 17], [13, 11]], "k": 9, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [2, 8, 0, 16, 12, 17, 10, 7, 4]} | 1 |
construct-rlve-largest-convex-polygon-l4-s3 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 4 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 18 points in the plane, indexed 0..17 (distinct, no three collinear):
0: (5, 15)
1: (15, 11)
2: (2, 4)
3: (3, 8)
4: (1, 15)
5: (6, 11)
6: (0, 0)
7: (14, 17)
8: (18, 0)
9: (15, 13)
10: (3, 10)
11: (7, 3)
12: (1, 17)
13: (6, 13)
14: (14, 3)
15: (13, 6)
16: (13, 2)
17: (18, 8)
The largest subset of these po... | {"points": [[5, 15], [15, 11], [2, 4], [3, 8], [1, 15], [6, 11], [0, 0], [14, 17], [18, 0], [15, 13], [3, 10], [7, 3], [1, 17], [6, 13], [14, 3], [13, 6], [13, 2], [18, 8]], "k": 9, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [2, 3, 5, 7, 9, 1, 14, 16, 11]} | 1 |
construct-rlve-largest-convex-polygon-l4-s4 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 4 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 18 points in the plane, indexed 0..17 (distinct, no three collinear):
0: (1, 12)
1: (18, 1)
2: (5, 11)
3: (12, 10)
4: (0, 13)
5: (6, 14)
6: (13, 10)
7: (7, 13)
8: (17, 9)
9: (14, 16)
10: (0, 12)
11: (18, 3)
12: (8, 3)
13: (8, 9)
14: (5, 0)
15: (6, 6)
16: (17, 11)
17: (4, 7)
The largest subset of these po... | {"points": [[1, 12], [18, 1], [5, 11], [12, 10], [0, 13], [6, 14], [13, 10], [7, 13], [17, 9], [14, 16], [0, 12], [18, 3], [8, 3], [8, 9], [5, 0], [6, 6], [17, 11], [4, 7]], "k": 8, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [0, 5, 9, 8, 11, 1, 15, 17]} | 1 |
construct-rlve-largest-convex-polygon-l4-s5 | construct | rlve_largest_convex_polygon | largest_convex_subset | discrete_geometry | competition | 4 | RLVE-Gym/largest_convex_polygon | MIT | [
"agentic_trivial"
] | You are given 18 points in the plane, indexed 0..17 (distinct, no three collinear):
0: (4, 4)
1: (9, 10)
2: (6, 2)
3: (10, 5)
4: (6, 15)
5: (2, 7)
6: (0, 0)
7: (11, 16)
8: (17, 0)
9: (4, 6)
10: (10, 7)
11: (0, 18)
12: (3, 13)
13: (5, 6)
14: (15, 9)
15: (11, 17)
16: (3, 15)
17: (2, 8)
The largest subset of these points... | {"points": [[4, 4], [9, 10], [6, 2], [10, 5], [6, 15], [2, 7], [0, 0], [11, 16], [17, 0], [4, 6], [10, 7], [0, 18], [3, 13], [5, 6], [15, 9], [11, 17], [3, 15], [2, 8]], "k": 9, "family": "rlve_largest_convex_polygon", "subset": "construct"} | null | null | null | {"indices": [5, 17, 12, 4, 15, 7, 1, 13, 9]} | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.