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-matrix-permutation-equivalence-l2-s6 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 2 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 4 x 5 binary matrices (0-indexed, one row per line).
A:
01111
01111
01111
11111
B:
10111
10111
10111
11111
Find a permutation a of 0..3 and a permutation b of 0..4 such that A[a[i]][b[j]] = B[i][j] for all 0 <= i < 4, 0 <= j < 5.
Answer format: {"a": [a_0, ...], "b": [b_0, ...]}
Write your final answer a... | {"A": ["01111", "01111", "01111", "11111"], "B": ["10111", "10111", "10111", "11111"], "family": "rlve_matrix_permutation_equivalence", "subset": "construct"} | null | null | null | {"a": [2, 1, 0, 3], "b": [1, 0, 2, 4, 3]} | 1 |
construct-rlve-matrix-permutation-equivalence-l2-s7 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 2 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 3 x 3 binary matrices (0-indexed, one row per line).
A:
101
110
011
B:
101
011
110
Find a permutation a of 0..2 and a permutation b of 0..2 such that A[a[i]][b[j]] = B[i][j] for all 0 <= i < 3, 0 <= j < 3.
Answer format: {"a": [a_0, ...], "b": [b_0, ...]}
Write your final answer as JSON to `/workdir/answ... | {"A": ["101", "110", "011"], "B": ["101", "011", "110"], "family": "rlve_matrix_permutation_equivalence", "subset": "construct"} | null | null | null | {"a": [0, 2, 1], "b": [0, 1, 2]} | 1 |
construct-rlve-matrix-permutation-equivalence-l2-s8 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 2 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 2 x 3 binary matrices (0-indexed, one row per line).
A:
010
000
B:
100
000
Find a permutation a of 0..1 and a permutation b of 0..2 such that A[a[i]][b[j]] = B[i][j] for all 0 <= i < 2, 0 <= j < 3.
Answer format: {"a": [a_0, ...], "b": [b_0, ...]}
Write your final answer as JSON to `/workdir/answer.json`... | {"A": ["010", "000"], "B": ["100", "000"], "family": "rlve_matrix_permutation_equivalence", "subset": "construct"} | null | null | null | {"a": [0, 1], "b": [1, 0, 2]} | 1 |
construct-rlve-matrix-permutation-equivalence-l2-s9 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 2 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 3 x 5 binary matrices (0-indexed, one row per line).
A:
11111
01110
11111
B:
11111
11111
10101
Find a permutation a of 0..2 and a permutation b of 0..4 such that A[a[i]][b[j]] = B[i][j] for all 0 <= i < 3, 0 <= j < 5.
Answer format: {"a": [a_0, ...], "b": [b_0, ...]}
Write your final answer as JSON to `/... | {"A": ["11111", "01110", "11111"], "B": ["11111", "11111", "10101"], "family": "rlve_matrix_permutation_equivalence", "subset": "construct"} | null | null | null | {"a": [0, 2, 1], "b": [1, 4, 3, 0, 2]} | 1 |
construct-rlve-matrix-permutation-equivalence-l3-s0 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 3 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 7 x 2 binary matrices (0-indexed, one row per line).
A:
10
10
10
10
00
11
10
B:
10
10
11
00
10
10
10
Find a permutation a of 0..6 and a permutation b of 0..1 such that A[a[i]][b[j]] = B[i][j] for all 0 <= i < 7, 0 <= j < 2.
Answer format: {"a": [a_0, ...], "b": [b_0, ...]}
Write your final answer as JSON... | {"A": ["10", "10", "10", "10", "00", "11", "10"], "B": ["10", "10", "11", "00", "10", "10", "10"], "family": "rlve_matrix_permutation_equivalence", "subset": "construct"} | null | null | null | {"a": [0, 3, 5, 4, 1, 2, 6], "b": [0, 1]} | 1 |
construct-rlve-matrix-permutation-equivalence-l3-s1 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 3 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 7 x 7 binary matrices (0-indexed, one row per line).
A:
0101101
0011011
0010011
1100000
1111110
0110000
0001111
B:
0100001
0100110
1010110
1010101
0001001
1111011
0110110
Find a permutation a of 0..6 and a permutation b of 0..6 such that A[a[i]][b[j]] = B[i][j] for all 0 <= i < 7, 0 <= j < 7.
Answer forma... | {"A": ["0101101", "0011011", "0010011", "1100000", "1111110", "0110000", "0001111"], "B": ["0100001", "0100110", "1010110", "1010101", "0001001", "1111011", "0110110"], "family": "rlve_matrix_permutation_equivalence", "subset": "construct"} | null | null | null | {"a": [5, 2, 6, 0, 3, 4, 1], "b": [4, 2, 3, 0, 6, 5, 1]} | 1 |
construct-rlve-matrix-permutation-equivalence-l3-s2 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 3 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 8 x 6 binary matrices (0-indexed, one row per line).
A:
100110
111111
111010
111101
110010
111111
101011
011111
B:
111111
010101
101101
001111
111110
000111
111011
111111
Find a permutation a of 0..7 and a permutation b of 0..5 such that A[a[i]][b[j]] = B[i][j] for all 0 <= i < 8, 0 <= j < 6.
Answer forma... | {"A": ["100110", "111111", "111010", "111101", "110010", "111111", "101011", "011111"], "B": ["111111", "010101", "101101", "001111", "111110", "000111", "111011", "111111"], "family": "rlve_matrix_permutation_equivalence", "subset": "construct"} | null | null | null | {"a": [5, 0, 6, 2, 3, 4, 7, 1], "b": [5, 3, 2, 0, 1, 4]} | 1 |
construct-rlve-matrix-permutation-equivalence-l3-s3 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 3 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 7 x 6 binary matrices (0-indexed, one row per line).
A:
110011
001110
101010
101101
001111
111110
001010
B:
111001
110010
010010
011110
110111
010110
101110
Find a permutation a of 0..6 and a permutation b of 0..5 such that A[a[i]][b[j]] = B[i][j] for all 0 <= i < 7, 0 <= j < 6.
Answer format: {"a": [a_0,... | {"A": ["110011", "001110", "101010", "101101", "001111", "111110", "001010"], "B": ["111001", "110010", "010010", "011110", "110111", "010110", "101110"], "family": "rlve_matrix_permutation_equivalence", "subset": "construct"} | null | null | null | {"a": [0, 2, 6, 4, 5, 1, 3], "b": [0, 4, 5, 3, 2, 1]} | 1 |
construct-rlve-matrix-permutation-equivalence-l3-s4 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 3 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 2 x 5 binary matrices (0-indexed, one row per line).
A:
10000
00011
B:
00010
10001
Find a permutation a of 0..1 and a permutation b of 0..4 such that A[a[i]][b[j]] = B[i][j] for all 0 <= i < 2, 0 <= j < 5.
Answer format: {"a": [a_0, ...], "b": [b_0, ...]}
Write your final answer as JSON to `/workdir/answ... | {"A": ["10000", "00011"], "B": ["00010", "10001"], "family": "rlve_matrix_permutation_equivalence", "subset": "construct"} | null | null | null | {"a": [0, 1], "b": [4, 2, 1, 0, 3]} | 1 |
construct-rlve-matrix-permutation-equivalence-l3-s5 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 3 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 5 x 4 binary matrices (0-indexed, one row per line).
A:
0111
0111
1101
1100
1111
B:
1111
1011
1110
1001
1110
Find a permutation a of 0..4 and a permutation b of 0..3 such that A[a[i]][b[j]] = B[i][j] for all 0 <= i < 5, 0 <= j < 4.
Answer format: {"a": [a_0, ...], "b": [b_0, ...]}
Write your final answer... | {"A": ["0111", "0111", "1101", "1100", "1111"], "B": ["1111", "1011", "1110", "1001", "1110"], "family": "rlve_matrix_permutation_equivalence", "subset": "construct"} | null | null | null | {"a": [4, 2, 1, 3, 0], "b": [1, 2, 3, 0]} | 1 |
construct-rlve-matrix-permutation-equivalence-l3-s6 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 3 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 2 x 7 binary matrices (0-indexed, one row per line).
A:
1110111
1111111
B:
1111111
1111011
Find a permutation a of 0..1 and a permutation b of 0..6 such that A[a[i]][b[j]] = B[i][j] for all 0 <= i < 2, 0 <= j < 7.
Answer format: {"a": [a_0, ...], "b": [b_0, ...]}
Write your final answer as JSON to `/work... | {"A": ["1110111", "1111111"], "B": ["1111111", "1111011"], "family": "rlve_matrix_permutation_equivalence", "subset": "construct"} | null | null | null | {"a": [1, 0], "b": [4, 1, 0, 5, 3, 6, 2]} | 1 |
construct-rlve-matrix-permutation-equivalence-l3-s7 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 3 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 4 x 7 binary matrices (0-indexed, one row per line).
A:
1001111
1110011
1110101
1111110
B:
1101110
1011011
1110011
1111101
Find a permutation a of 0..3 and a permutation b of 0..6 such that A[a[i]][b[j]] = B[i][j] for all 0 <= i < 4, 0 <= j < 7.
Answer format: {"a": [a_0, ...], "b": [b_0, ...]}
Write you... | {"A": ["1001111", "1110011", "1110101", "1111110"], "B": ["1101110", "1011011", "1110011", "1111101"], "family": "rlve_matrix_permutation_equivalence", "subset": "construct"} | null | null | null | {"a": [0, 1, 2, 3], "b": [0, 4, 1, 5, 3, 6, 2]} | 1 |
construct-rlve-matrix-permutation-equivalence-l3-s8 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 3 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 6 x 6 binary matrices (0-indexed, one row per line).
A:
111111
111111
111111
111111
010110
111111
B:
111111
010011
111111
111111
111111
111111
Find a permutation a of 0..5 and a permutation b of 0..5 such that A[a[i]][b[j]] = B[i][j] for all 0 <= i < 6, 0 <= j < 6.
Answer format: {"a": [a_0, ...], "b": [b... | {"A": ["111111", "111111", "111111", "111111", "010110", "111111"], "B": ["111111", "010011", "111111", "111111", "111111", "111111"], "family": "rlve_matrix_permutation_equivalence", "subset": "construct"} | null | null | null | {"a": [2, 4, 3, 1, 5, 0], "b": [5, 1, 0, 2, 3, 4]} | 1 |
construct-rlve-matrix-permutation-equivalence-l3-s9 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 3 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 5 x 5 binary matrices (0-indexed, one row per line).
A:
01111
11101
11111
11011
00011
B:
01111
10111
00101
11111
11110
Find a permutation a of 0..4 and a permutation b of 0..4 such that A[a[i]][b[j]] = B[i][j] for all 0 <= i < 5, 0 <= j < 5.
Answer format: {"a": [a_0, ...], "b": [b_0, ...]}
Write your fi... | {"A": ["01111", "11101", "11111", "11011", "00011"], "B": ["01111", "10111", "00101", "11111", "11110"], "family": "rlve_matrix_permutation_equivalence", "subset": "construct"} | null | null | null | {"a": [3, 0, 4, 2, 1], "b": [2, 0, 4, 1, 3]} | 1 |
construct-rlve-matrix-permutation-equivalence-l4-s0 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 4 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 6 x 11 binary matrices (0-indexed, one row per line).
A:
00110101000
01100000000
00000000000
00001110000
00000010000
00101000011
B:
00100100011
00011000110
00000000000
10000000010
00010101000
00000001000
Find a permutation a of 0..5 and a permutation b of 0..10 such that A[a[i]][b[j]] = B[i][j] for all 0 <... | {"A": ["00110101000", "01100000000", "00000000000", "00001110000", "00000010000", "00101000011"], "B": ["00100100011", "00011000110", "00000000000", "10000000010", "00010101000", "00000001000"], "family": "rlve_matrix_permutation_equivalence", "subset": "construct"} | null | null | null | {"a": [5, 0, 2, 1, 3, 4], "b": [1, 8, 9, 5, 3, 4, 0, 6, 7, 2, 10]} | 1 |
construct-rlve-matrix-permutation-equivalence-l4-s1 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 4 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 10 x 8 binary matrices (0-indexed, one row per line).
A:
01111110
11110111
01111111
11111111
11110011
10111111
11101101
11111111
00111111
11110111
B:
11011011
10111111
11110011
10101111
11111111
11111011
10111111
11111111
11111100
11110111
Find a permutation a of 0..9 and a permutation b of 0..7 such that ... | {"A": ["01111110", "11110111", "01111111", "11111111", "11110011", "10111111", "11101101", "11111111", "00111111", "11110111"], "B": ["11011011", "10111111", "11110011", "10101111", "11111111", "11111011", "10111111", "11111111", "11111100", "11110111"], "family": "rlve_matrix_permutation_equivalence", "subset": "const... | null | null | null | {"a": [0, 1, 8, 4, 3, 2, 9, 7, 6, 5], "b": [2, 4, 7, 5, 1, 0, 3, 6]} | 1 |
construct-rlve-matrix-permutation-equivalence-l4-s2 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 4 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 9 x 3 binary matrices (0-indexed, one row per line).
A:
011
111
110
100
110
101
110
111
010
B:
110
101
010
110
111
110
011
100
111
Find a permutation a of 0..8 and a permutation b of 0..2 such that A[a[i]][b[j]] = B[i][j] for all 0 <= i < 9, 0 <= j < 3.
Answer format: {"a": [a_0, ...], "b": [b_0, ...]}
W... | {"A": ["011", "111", "110", "100", "110", "101", "110", "111", "010"], "B": ["110", "101", "010", "110", "111", "110", "011", "100", "111"], "family": "rlve_matrix_permutation_equivalence", "subset": "construct"} | null | null | null | {"a": [2, 5, 8, 4, 1, 6, 0, 3, 7], "b": [0, 1, 2]} | 1 |
construct-rlve-matrix-permutation-equivalence-l4-s3 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 4 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 10 x 12 binary matrices (0-indexed, one row per line).
A:
100101000001
101111111001
101110001001
110110101010
111010111001
100100010000
010001111110
001100011111
000011001101
100100100101
B:
011011100110
000100100010
111010010011
001101011111
101101101111
001110111001
001101101100
100101100000
010101100001
... | {"A": ["100101000001", "101111111001", "101110001001", "110110101010", "111010111001", "100100010000", "010001111110", "001100011111", "000011001101", "100100100101"], "B": ["011011100110", "000100100010", "111010010011", "001101011111", "101101101111", "001110111001", "001101101100", "100101100000", "010101100001", "1... | null | null | null | {"a": [7, 5, 6, 4, 1, 3, 2, 0, 9, 8], "b": [5, 9, 8, 0, 10, 11, 3, 1, 4, 2, 7, 6]} | 1 |
construct-rlve-matrix-permutation-equivalence-l4-s4 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 4 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 7 x 7 binary matrices (0-indexed, one row per line).
A:
1101111
1111111
1110111
1110111
1111111
1111111
1111111
B:
1011111
1111110
1011111
1111111
1111111
1111111
1111111
Find a permutation a of 0..6 and a permutation b of 0..6 such that A[a[i]][b[j]] = B[i][j] for all 0 <= i < 7, 0 <= j < 7.
Answer forma... | {"A": ["1101111", "1111111", "1110111", "1110111", "1111111", "1111111", "1111111"], "B": ["1011111", "1111110", "1011111", "1111111", "1111111", "1111111", "1111111"], "family": "rlve_matrix_permutation_equivalence", "subset": "construct"} | null | null | null | {"a": [2, 0, 3, 1, 6, 4, 5], "b": [5, 3, 4, 1, 6, 0, 2]} | 1 |
construct-rlve-matrix-permutation-equivalence-l4-s5 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 4 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 10 x 9 binary matrices (0-indexed, one row per line).
A:
101100000
101110010
000111001
110100011
011111001
111011101
111011001
110111110
010101110
101011101
B:
111000011
001010110
110111110
101111011
101100101
110011110
011110110
110110110
111000000
001111001
Find a permutation a of 0..9 and a permutation ... | {"A": ["101100000", "101110010", "000111001", "110100011", "011111001", "111011101", "111011001", "110111110", "010101110", "101011101"], "B": ["111000011", "001010110", "110111110", "101111011", "101100101", "110011110", "011110110", "110110110", "111000000", "001111001"], "family": "rlve_matrix_permutation_equivalenc... | null | null | null | {"a": [1, 2, 5, 7, 3, 9, 4, 6, 0, 8], "b": [0, 2, 3, 1, 5, 6, 8, 4, 7]} | 1 |
construct-rlve-matrix-permutation-equivalence-l4-s6 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 4 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 6 x 9 binary matrices (0-indexed, one row per line).
A:
010000100
000000000
100000000
000000000
000000000
000000000
B:
000000000
000000000
000000000
000000100
101000000
000000000
Find a permutation a of 0..5 and a permutation b of 0..8 such that A[a[i]][b[j]] = B[i][j] for all 0 <= i < 6, 0 <= j < 9.
Answ... | {"A": ["010000100", "000000000", "100000000", "000000000", "000000000", "000000000"], "B": ["000000000", "000000000", "000000000", "000000100", "101000000", "000000000"], "family": "rlve_matrix_permutation_equivalence", "subset": "construct"} | null | null | null | {"a": [1, 3, 4, 2, 0, 5], "b": [6, 7, 1, 5, 4, 3, 0, 8, 2]} | 1 |
construct-rlve-matrix-permutation-equivalence-l4-s7 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 4 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 2 x 7 binary matrices (0-indexed, one row per line).
A:
0111010
1100001
B:
1100110
1011000
Find a permutation a of 0..1 and a permutation b of 0..6 such that A[a[i]][b[j]] = B[i][j] for all 0 <= i < 2, 0 <= j < 7.
Answer format: {"a": [a_0, ...], "b": [b_0, ...]}
Write your final answer as JSON to `/work... | {"A": ["0111010", "1100001"], "B": ["1100110", "1011000"], "family": "rlve_matrix_permutation_equivalence", "subset": "construct"} | null | null | null | {"a": [0, 1], "b": [1, 3, 0, 6, 5, 2, 4]} | 1 |
construct-rlve-matrix-permutation-equivalence-l4-s8 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 4 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 12 x 10 binary matrices (0-indexed, one row per line).
A:
0001110011
1011010001
1011011111
1011110110
0111111111
1011111010
1111101110
1011110111
1011101110
1101101001
0101111111
0000111111
B:
0110111111
1111110101
0011011111
0111100100
1011011111
0011101111
0101110101
0111101111
0011111110
0110101010
11110... | {"A": ["0001110011", "1011010001", "1011011111", "1011110110", "0111111111", "1011111010", "1111101110", "1011110111", "1011101110", "1101101001", "0101111111", "0000111111"], "B": ["0110111111", "1111110101", "0011011111", "0111100100", "1011011111", "0011101111", "0101110101", "0111101111", "0011111110", "0110101010"... | null | null | null | {"a": [2, 10, 8, 0, 6, 3, 11, 7, 5, 1, 9, 4], "b": [1, 9, 3, 4, 5, 6, 0, 8, 2, 7]} | 1 |
construct-rlve-matrix-permutation-equivalence-l4-s9 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 4 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 8 x 12 binary matrices (0-indexed, one row per line).
A:
100000000000
000000000000
000000000000
000001000000
000000000000
001000000000
000000000000
100000000000
B:
000001000000
000000000000
000000000000
000001000000
000000100000
000000000000
000000000100
000000000000
Find a permutation a of 0..7 and a perm... | {"A": ["100000000000", "000000000000", "000000000000", "000001000000", "000000000000", "001000000000", "000000000000", "100000000000"], "B": ["000001000000", "000000000000", "000000000000", "000001000000", "000000100000", "000000000000", "000000000100", "000000000000"], "family": "rlve_matrix_permutation_equivalence", ... | null | null | null | {"a": [7, 1, 4, 0, 3, 2, 5, 6], "b": [7, 11, 6, 3, 4, 0, 5, 8, 1, 2, 9, 10]} | 1 |
construct-rlve-matrix-permutation-equivalence-l5-s0 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 5 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 3 x 10 binary matrices (0-indexed, one row per line).
A:
1100100000
0010110001
0010000001
B:
0000110000
0100000101
0000111001
Find a permutation a of 0..2 and a permutation b of 0..9 such that A[a[i]][b[j]] = B[i][j] for all 0 <= i < 3, 0 <= j < 10.
Answer format: {"a": [a_0, ...], "b": [b_0, ...]}
Write... | {"A": ["1100100000", "0010110001", "0010000001"], "B": ["0000110000", "0100000101", "0000111001"], "family": "rlve_matrix_permutation_equivalence", "subset": "construct"} | null | null | null | {"a": [2, 0, 1], "b": [7, 0, 8, 3, 9, 2, 5, 1, 6, 4]} | 1 |
construct-rlve-matrix-permutation-equivalence-l5-s1 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 5 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 8 x 12 binary matrices (0-indexed, one row per line).
A:
010011111101
111111110011
110111101101
101010110110
111101111111
101111011101
001111101011
111111111011
B:
111011100111
010011111111
110100101111
001001111111
111110111110
111110111111
111111111101
101111001010
Find a permutation a of 0..7 and a perm... | {"A": ["010011111101", "111111110011", "110111101101", "101010110110", "111101111111", "101111011101", "001111101011", "111111111011"], "B": ["111011100111", "010011111111", "110100101111", "001001111111", "111110111110", "111110111111", "111111111101", "101111001010"], "family": "rlve_matrix_permutation_equivalence", ... | null | null | null | {"a": [5, 2, 6, 0, 1, 7, 4, 3], "b": [2, 3, 7, 10, 0, 9, 11, 1, 6, 5, 4, 8]} | 1 |
construct-rlve-matrix-permutation-equivalence-l5-s2 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 5 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 16 x 2 binary matrices (0-indexed, one row per line).
A:
00
00
01
10
00
10
00
01
00
10
10
01
00
10
01
00
B:
01
01
00
00
00
01
00
01
10
01
00
00
10
10
10
00
Find a permutation a of 0..15 and a permutation b of 0..1 such that A[a[i]][b[j]] = B[i][j] for all 0 <= i < 16, 0 <= j < 2.
Answer format: {"a": [a_0... | {"A": ["00", "00", "01", "10", "00", "10", "00", "01", "00", "10", "10", "01", "00", "10", "01", "00"], "B": ["01", "01", "00", "00", "00", "01", "00", "01", "10", "01", "00", "00", "10", "10", "10", "00"], "family": "rlve_matrix_permutation_equivalence", "subset": "construct"} | null | null | null | {"a": [9, 5, 1, 15, 8, 13, 4, 3, 14, 10, 0, 12, 7, 2, 11, 6], "b": [1, 0]} | 1 |
construct-rlve-matrix-permutation-equivalence-l5-s3 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 5 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 17 x 13 binary matrices (0-indexed, one row per line).
A:
0000000000011
0000000000000
0010000000000
0100000000011
0000000000000
0011100100000
0000000000000
0000100000000
0000000011000
0001000001000
0000000000000
1100000001100
0000000000000
0000000000010
0010010000000
0100100000001
1010000000000
B:
000010100... | {"A": ["0000000000011", "0000000000000", "0010000000000", "0100000000011", "0000000000000", "0011100100000", "0000000000000", "0000100000000", "0000000011000", "0001000001000", "0000000000000", "1100000001100", "0000000000000", "0000000000010", "0010010000000", "0100100000001", "1010000000000"], "B": ["0000101000001", ... | null | null | null | {"a": [15, 2, 14, 0, 7, 13, 4, 8, 6, 10, 3, 11, 1, 12, 9, 16, 5], "b": [10, 7, 0, 3, 4, 5, 1, 9, 6, 2, 8, 11, 12]} | 1 |
construct-rlve-matrix-permutation-equivalence-l5-s4 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 5 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 10 x 14 binary matrices (0-indexed, one row per line).
A:
00011000000001
10111011110001
00010101001100
00000010000011
11000010000011
00011100001011
00111000000100
00010000111001
01001011101001
11110000100001
B:
11100000100001
11000011000101
00000011000001
00001111111011
00011101000100
00010101001011
1001101... | {"A": ["00011000000001", "10111011110001", "00010101001100", "00000010000011", "11000010000011", "00011100001011", "00111000000100", "00010000111001", "01001011101001", "11110000100001"], "B": ["11100000100001", "11000011000101", "00000011000001", "00001111111011", "00011101000100", "00010101001011", "10011011101000", ... | null | null | null | {"a": [2, 5, 0, 1, 4, 9, 8, 7, 3, 6], "b": [10, 5, 11, 1, 6, 0, 4, 13, 7, 9, 8, 12, 2, 3]} | 1 |
construct-rlve-matrix-permutation-equivalence-l5-s5 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 5 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 16 x 6 binary matrices (0-indexed, one row per line).
A:
101110
011110
111111
001110
011111
100101
001101
001110
101110
111010
011111
111111
111011
101111
111100
110111
B:
110100
111111
011100
111110
111010
110111
101011
110111
110010
011111
111001
111111
101111
110011
110010
111010
Find a permutation a of... | {"A": ["101110", "011110", "111111", "001110", "011111", "100101", "001101", "001110", "101110", "111010", "011111", "111111", "111011", "101111", "111100", "110111"], "B": ["110100", "111111", "011100", "111110", "111010", "110111", "101011", "110111", "110010", "011111", "111001", "111111", "101111", "110011", "11001... | null | null | null | {"a": [6, 2, 5, 13, 8, 10, 9, 4, 3, 15, 14, 11, 12, 1, 7, 0], "b": [2, 3, 0, 5, 4, 1]} | 1 |
construct-rlve-matrix-permutation-equivalence-l5-s6 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 5 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 2 x 12 binary matrices (0-indexed, one row per line).
A:
111011101111
101110111111
B:
110011111111
111111010111
Find a permutation a of 0..1 and a permutation b of 0..11 such that A[a[i]][b[j]] = B[i][j] for all 0 <= i < 2, 0 <= j < 12.
Answer format: {"a": [a_0, ...], "b": [b_0, ...]}
Write your final a... | {"A": ["111011101111", "101110111111"], "B": ["110011111111", "111111010111"], "family": "rlve_matrix_permutation_equivalence", "subset": "construct"} | null | null | null | {"a": [0, 1], "b": [10, 4, 7, 3, 8, 0, 1, 2, 5, 9, 6, 11]} | 1 |
construct-rlve-matrix-permutation-equivalence-l5-s7 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 5 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 13 x 15 binary matrices (0-indexed, one row per line).
A:
000000110000100
000000000001010
100000101000100
000100000000010
011000101000010
000111000001100
011100000001000
000000001010000
000000000000100
000000110000000
000100001100000
000000100100100
000011001000000
B:
100100100100010
000000000100101
0000000... | {"A": ["000000110000100", "000000000001010", "100000101000100", "000100000000010", "011000101000010", "000111000001100", "011100000001000", "000000001010000", "000000000000100", "000000110000000", "000100001100000", "000000100100100", "000011001000000"], "B": ["100100100100010", "000000000100101", "000000000100100", "0... | null | null | null | {"a": [4, 0, 9, 8, 3, 2, 7, 1, 5, 11, 10, 6, 12], "b": [2, 9, 14, 8, 5, 11, 13, 0, 10, 6, 4, 3, 7, 1, 12]} | 1 |
construct-rlve-matrix-permutation-equivalence-l5-s8 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 5 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 15 x 7 binary matrices (0-indexed, one row per line).
A:
0000100
0000110
0001011
1100010
0010011
0000000
1101000
0001010
0000000
1011001
0100000
0000000
0000000
0000000
0100000
B:
0000010
0010000
0000000
1100000
1001101
0101100
0000000
0110000
0000000
1000011
0100011
0000000
1101000
0000000
0000010
Find a ... | {"A": ["0000100", "0000110", "0001011", "1100010", "0010011", "0000000", "1101000", "0001010", "0000000", "1011001", "0100000", "0000000", "0000000", "0000000", "0100000"], "B": ["0000010", "0010000", "0000000", "1100000", "1001101", "0101100", "0000000", "0110000", "0000000", "1000011", "0100011", "0000000", "1101000"... | null | null | null | {"a": [10, 0, 5, 7, 9, 4, 8, 1, 11, 6, 3, 12, 2, 13, 14], "b": [3, 5, 4, 6, 2, 1, 0]} | 1 |
construct-rlve-matrix-permutation-equivalence-l5-s9 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 5 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 5 x 12 binary matrices (0-indexed, one row per line).
A:
110011100010
100110001110
011010011010
010110101011
010110000111
B:
100100101011
000101101101
110101101010
101111100000
110100110100
Find a permutation a of 0..4 and a permutation b of 0..11 such that A[a[i]][b[j]] = B[i][j] for all 0 <= i < 5, 0 <= ... | {"A": ["110011100010", "100110001110", "011010011010", "010110101011", "010110000111"], "B": ["100100101011", "000101101101", "110101101010", "101111100000", "110100110100"], "family": "rlve_matrix_permutation_equivalence", "subset": "construct"} | null | null | null | {"a": [4, 1, 3, 2, 0], "b": [1, 6, 7, 10, 2, 8, 4, 5, 3, 0, 11, 9]} | 1 |
construct-rlve-matrix-permutation-equivalence-l6-s0 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 6 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 11 x 17 binary matrices (0-indexed, one row per line).
A:
01010101010110001
01000011000101100
01100011001111111
10111001001001101
00000001001100110
01011100100010110
00001010001010100
00100110011100001
01011100001001101
00001000100010010
11010000010101000
B:
10100101001001011
00000100110001111
0111100100000... | {"A": ["01010101010110001", "01000011000101100", "01100011001111111", "10111001001001101", "00000001001100110", "01011100100010110", "00001010001010100", "00100110011100001", "01011100001001101", "00001000100010010", "11010000010101000"], "B": ["10100101001001011", "00000100110001111", "01111001000001101", "00101101000... | null | null | null | {"a": [0, 7, 8, 10, 6, 1, 3, 5, 9, 4, 2], "b": [12, 4, 1, 14, 13, 11, 8, 3, 2, 6, 7, 15, 0, 5, 10, 9, 16]} | 1 |
construct-rlve-matrix-permutation-equivalence-l6-s1 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 6 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 20 x 11 binary matrices (0-indexed, one row per line).
A:
11001001000
11001000000
10110011001
00100010101
00000001101
11000000100
00101001011
00010000100
00000000100
00000000000
00010010000
10000110010
00001101000
00010000000
10100101000
00000100010
10010000001
00001000001
00101010000
00001001001
B:
0111001... | {"A": ["11001001000", "11001000000", "10110011001", "00100010101", "00000001101", "11000000100", "00101001011", "00010000100", "00000000100", "00000000000", "00010010000", "10000110010", "00001101000", "00010000000", "10100101000", "00000100010", "10010000001", "00001000001", "00101010000", "00001001001"], "B": ["01110... | null | null | null | {"a": [6, 10, 7, 8, 1, 9, 17, 3, 12, 16, 14, 13, 18, 5, 19, 2, 15, 11, 0, 4], "b": [6, 2, 4, 9, 8, 5, 7, 10, 1, 3, 0]} | 1 |
construct-rlve-matrix-permutation-equivalence-l6-s2 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 6 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 6 x 15 binary matrices (0-indexed, one row per line).
A:
111111011111111
101010111111110
111111101100111
101011111111111
111101111111111
101100111101111
B:
111011111111000
110111111111111
101011111111111
101011110111110
011111011111011
111111111111101
Find a permutation a of 0..5 and a permutation b of 0..... | {"A": ["111111011111111", "101010111111110", "111111101100111", "101011111111111", "111101111111111", "101100111101111"], "B": ["111011111111000", "110111111111111", "101011111111111", "101011110111110", "011111011111011", "111111111111101"], "family": "rlve_matrix_permutation_equivalence", "subset": "construct"} | null | null | null | {"a": [5, 0, 3, 1, 2, 4], "b": [7, 3, 6, 1, 8, 2, 11, 13, 14, 9, 12, 0, 10, 4, 5]} | 1 |
construct-rlve-matrix-permutation-equivalence-l6-s3 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 6 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 20 x 6 binary matrices (0-indexed, one row per line).
A:
100101
100100
000100
100100
000011
001001
101000
000011
000011
111011
101011
010111
001010
101000
110001
001011
110111
011001
100000
011000
B:
011111
010100
000011
111110
000011
010111
100000
010100
100010
010001
100010
000101
010101
010100
110010
001... | {"A": ["100101", "100100", "000100", "100100", "000011", "001001", "101000", "000011", "000011", "111011", "101011", "010111", "001010", "101000", "110001", "001011", "110111", "011001", "100000", "011000"], "B": ["011111", "010100", "000011", "111110", "000011", "010111", "100000", "010100", "100010", "010001", "10001... | null | null | null | {"a": [9, 4, 6, 16, 13, 10, 2, 8, 3, 5, 1, 12, 15, 7, 0, 19, 14, 11, 17, 18], "b": [3, 5, 1, 4, 0, 2]} | 1 |
construct-rlve-matrix-permutation-equivalence-l6-s4 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 6 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 21 x 25 binary matrices (0-indexed, one row per line).
A:
1100110001001111111001101
1001101111010000010110100
0011111010110100000111111
1000000001111011110011000
1001010011111110111001001
0000111101100000000100110
1111011100101111111101101
1100010000101100110101010
1000001011011101000110110
0111010100111010... | {"A": ["1100110001001111111001101", "1001101111010000010110100", "0011111010110100000111111", "1000000001111011110011000", "1001010011111110111001001", "0000111101100000000100110", "1111011100101111111101101", "1100010000101100110101010", "1000001011011101000110110", "0111010100111010010101000", "1100111110110010000101... | null | null | null | {"a": [17, 19, 18, 2, 11, 20, 12, 13, 4, 9, 16, 3, 5, 8, 6, 0, 7, 10, 15, 1, 14], "b": [17, 18, 22, 9, 14, 13, 3, 21, 6, 20, 15, 4, 7, 0, 10, 1, 12, 11, 8, 19, 2, 23, 16, 5, 24]} | 1 |
construct-rlve-matrix-permutation-equivalence-l6-s5 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 6 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 23 x 20 binary matrices (0-indexed, one row per line).
A:
10000000100000001001
01001000000011010010
00001000000010000011
10011011000000100110
11100011010011010101
00010010010000100101
01000001000100000001
01000100000000001010
11000000000100000000
11011000000000000000
11001000001100000110
0000001000000000000... | {"A": ["10000000100000001001", "01001000000011010010", "00001000000010000011", "10011011000000100110", "11100011010011010101", "00010010010000100101", "01000001000100000001", "01000100000000001010", "11000000000100000000", "11011000000000000000", "11001000001100000110", "00000010000000000001", "00001000000000001001", "... | null | null | null | {"a": [16, 22, 6, 3, 1, 12, 4, 9, 14, 17, 11, 19, 13, 0, 5, 7, 20, 21, 10, 18, 15, 2, 8], "b": [7, 10, 2, 9, 1, 8, 11, 5, 19, 0, 4, 15, 14, 13, 3, 17, 6, 16, 18, 12]} | 1 |
construct-rlve-matrix-permutation-equivalence-l6-s6 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 6 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 9 x 22 binary matrices (0-indexed, one row per line).
A:
1101110101011110110101
1101111111111101011111
0110111110111111000101
1011111111010001111101
1000100111011111111110
1111111010111011111110
0101101101111001001111
0011011111001101011111
0111111111011110101000
B:
1100111011101110010101
010111111101010100... | {"A": ["1101110101011110110101", "1101111111111101011111", "0110111110111111000101", "1011111111010001111101", "1000100111011111111110", "1111111010111011111110", "0101101101111001001111", "0011011111001101011111", "0111111111011110101000"], "B": ["1100111011101110010101", "0101111111010101001111", "0111010110110111010... | null | null | null | {"a": [6, 4, 0, 3, 7, 1, 2, 8, 5], "b": [6, 9, 5, 0, 18, 4, 15, 17, 19, 20, 3, 13, 10, 12, 21, 14, 2, 1, 8, 11, 16, 7]} | 1 |
construct-rlve-matrix-permutation-equivalence-l6-s7 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 6 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 24 x 10 binary matrices (0-indexed, one row per line).
A:
1011111111
1111111111
1011001111
1111111111
1000110011
1101101101
0010110011
1011011110
1010110100
1100101011
1111011100
1101011010
1010111111
1111111011
1100111111
1111111110
1110101110
0111011110
0111111101
0111011011
1110111100
0111001101
11111011... | {"A": ["1011111111", "1111111111", "1011001111", "1111111111", "1000110011", "1101101101", "0010110011", "1011011110", "1010110100", "1100101011", "1111011100", "1101011010", "1010111111", "1111111011", "1100111111", "1111111110", "1110101110", "0111011110", "0111111101", "0111011011", "1110111100", "0111001101", "1111... | null | null | null | {"a": [11, 13, 20, 14, 1, 15, 22, 9, 16, 3, 5, 7, 12, 21, 6, 23, 18, 2, 0, 10, 17, 8, 19, 4], "b": [7, 5, 6, 3, 2, 9, 4, 1, 0, 8]} | 1 |
construct-rlve-matrix-permutation-equivalence-l6-s8 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 6 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 19 x 9 binary matrices (0-indexed, one row per line).
A:
110010011
100011110
110110010
000011000
001000100
001001001
001111000
010001101
101010100
010100110
001101001
101000110
000100000
000110001
000101000
001100101
010000000
101011111
000010001
B:
000111001
010001101
100010011
000010000
001101010
00000100... | {"A": ["110010011", "100011110", "110110010", "000011000", "001000100", "001001001", "001111000", "010001101", "101010100", "010100110", "001101001", "101000110", "000100000", "000110001", "000101000", "001100101", "010000000", "101011111", "000010001"], "B": ["000111001", "010001101", "100010011", "000010000", "001101... | null | null | null | {"a": [15, 11, 6, 12, 7, 4, 16, 18, 14, 10, 1, 9, 2, 17, 13, 0, 5, 8, 3], "b": [4, 7, 1, 8, 3, 6, 0, 5, 2]} | 1 |
construct-rlve-matrix-permutation-equivalence-l6-s9 | construct | rlve_matrix_permutation_equivalence | binary_matrix_permutation_equivalence | combinatorics | competition | 6 | RLVE-Gym/matrix_permutation_equivalence | MIT | [
"agentic_trivial",
"np_search"
] | A and B are 18 x 11 binary matrices (0-indexed, one row per line).
A:
10011110110
00110001010
01110111111
11111101101
00110010101
01001111010
10100011100
11111111101
11111110011
00010111110
11101100111
01111110010
10000110110
11001100111
01110011011
10000111111
10101101111
01110110001
B:
10001101110
01111110111
1111111... | {"A": ["10011110110", "00110001010", "01110111111", "11111101101", "00110010101", "01001111010", "10100011100", "11111111101", "11111110011", "00010111110", "11101100111", "01111110010", "10000110110", "11001100111", "01110011011", "10000111111", "10101101111", "01110110001"], "B": ["10001101110", "01111110111", "11111... | null | null | null | {"a": [9, 3, 8, 13, 16, 6, 2, 0, 10, 11, 5, 15, 4, 14, 12, 1, 7, 17], "b": [9, 0, 4, 10, 3, 5, 2, 6, 7, 8, 1]} | 1 |
construct-rlve-max-achromatic-coloring-l1-s0 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 1 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 6 vertices labelled 0..5 and edge list
[[0, 2], [0, 3], [0, 4], [1, 2], [2, 3], [2, 4], [2, 5], [3, 4], [3, 5], [4, 5]]
A complete colouring assigns colours so that (1) adjacent vertices get different colours and (2) for every pair of distinct colours x, y that are used, some edge has on... | {"n": 6, "k": 4, "edges": [[0, 2], [0, 3], [0, 4], [1, 2], [2, 3], [2, 4], [2, 5], [3, 4], [3, 5], [4, 5]], "family": "rlve_max_achromatic_coloring", "subset": "construct"} | null | null | null | {"colors": [0, 0, 1, 2, 3, 0]} | 1 |
construct-rlve-max-achromatic-coloring-l1-s1 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 1 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 6 vertices labelled 0..5 and edge list
[[0, 2], [0, 3], [1, 2], [1, 3], [2, 3], [3, 4], [3, 5]]
A complete colouring assigns colours so that (1) adjacent vertices get different colours and (2) for every pair of distinct colours x, y that are used, some edge has one endpoint coloured x an... | {"n": 6, "k": 3, "edges": [[0, 2], [0, 3], [1, 2], [1, 3], [2, 3], [3, 4], [3, 5]], "family": "rlve_max_achromatic_coloring", "subset": "construct"} | null | null | null | {"colors": [0, 0, 1, 2, 0, 0]} | 1 |
construct-rlve-max-achromatic-coloring-l1-s2 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 1 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 6 vertices labelled 0..5 and edge list
[[0, 3], [1, 4], [3, 4], [3, 5]]
A complete colouring assigns colours so that (1) adjacent vertices get different colours and (2) for every pair of distinct colours x, y that are used, some edge has one endpoint coloured x and the other coloured y. ... | {"n": 6, "k": 3, "edges": [[0, 3], [1, 4], [3, 4], [3, 5]], "family": "rlve_max_achromatic_coloring", "subset": "construct"} | null | null | null | {"colors": [0, 0, 0, 1, 2, 0]} | 1 |
construct-rlve-max-achromatic-coloring-l1-s3 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 1 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 6 vertices labelled 0..5 and edge list
[[0, 3], [1, 2], [1, 3], [2, 4]]
A complete colouring assigns colours so that (1) adjacent vertices get different colours and (2) for every pair of distinct colours x, y that are used, some edge has one endpoint coloured x and the other coloured y. ... | {"n": 6, "k": 3, "edges": [[0, 3], [1, 2], [1, 3], [2, 4]], "family": "rlve_max_achromatic_coloring", "subset": "construct"} | null | null | null | {"colors": [0, 0, 1, 2, 2, 0]} | 1 |
construct-rlve-max-achromatic-coloring-l1-s4 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 1 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 6 vertices labelled 0..5 and edge list
[[0, 2], [0, 5], [1, 5], [3, 5]]
A complete colouring assigns colours so that (1) adjacent vertices get different colours and (2) for every pair of distinct colours x, y that are used, some edge has one endpoint coloured x and the other coloured y. ... | {"n": 6, "k": 3, "edges": [[0, 2], [0, 5], [1, 5], [3, 5]], "family": "rlve_max_achromatic_coloring", "subset": "construct"} | null | null | null | {"colors": [0, 0, 1, 1, 0, 2]} | 1 |
construct-rlve-max-achromatic-coloring-l1-s5 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 1 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 6 vertices labelled 0..5 and edge list
[[0, 1], [0, 3], [1, 5], [2, 5], [3, 4], [3, 5], [4, 5]]
A complete colouring assigns colours so that (1) adjacent vertices get different colours and (2) for every pair of distinct colours x, y that are used, some edge has one endpoint coloured x an... | {"n": 6, "k": 4, "edges": [[0, 1], [0, 3], [1, 5], [2, 5], [3, 4], [3, 5], [4, 5]], "family": "rlve_max_achromatic_coloring", "subset": "construct"} | null | null | null | {"colors": [0, 1, 0, 2, 1, 3]} | 1 |
construct-rlve-max-achromatic-coloring-l1-s6 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 1 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 6 vertices labelled 0..5 and edge list
[[1, 4], [2, 3], [2, 5], [3, 5]]
A complete colouring assigns colours so that (1) adjacent vertices get different colours and (2) for every pair of distinct colours x, y that are used, some edge has one endpoint coloured x and the other coloured y. ... | {"n": 6, "k": 3, "edges": [[1, 4], [2, 3], [2, 5], [3, 5]], "family": "rlve_max_achromatic_coloring", "subset": "construct"} | null | null | null | {"colors": [0, 0, 0, 1, 1, 2]} | 1 |
construct-rlve-max-achromatic-coloring-l1-s7 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 1 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 6 vertices labelled 0..5 and edge list
[[0, 3], [1, 3], [1, 4], [1, 5], [2, 5], [3, 5], [4, 5]]
A complete colouring assigns colours so that (1) adjacent vertices get different colours and (2) for every pair of distinct colours x, y that are used, some edge has one endpoint coloured x an... | {"n": 6, "k": 4, "edges": [[0, 3], [1, 3], [1, 4], [1, 5], [2, 5], [3, 5], [4, 5]], "family": "rlve_max_achromatic_coloring", "subset": "construct"} | null | null | null | {"colors": [0, 1, 0, 2, 0, 3]} | 1 |
construct-rlve-max-achromatic-coloring-l1-s8 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 1 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 6 vertices labelled 0..5 and edge list
[[0, 5], [1, 4], [1, 5], [2, 3]]
A complete colouring assigns colours so that (1) adjacent vertices get different colours and (2) for every pair of distinct colours x, y that are used, some edge has one endpoint coloured x and the other coloured y. ... | {"n": 6, "k": 3, "edges": [[0, 5], [1, 4], [1, 5], [2, 3]], "family": "rlve_max_achromatic_coloring", "subset": "construct"} | null | null | null | {"colors": [0, 0, 1, 2, 1, 2]} | 1 |
construct-rlve-max-achromatic-coloring-l1-s9 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 1 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 6 vertices labelled 0..5 and edge list
[[0, 1], [0, 2], [0, 3], [1, 2], [1, 5], [3, 5], [4, 5]]
A complete colouring assigns colours so that (1) adjacent vertices get different colours and (2) for every pair of distinct colours x, y that are used, some edge has one endpoint coloured x an... | {"n": 6, "k": 4, "edges": [[0, 1], [0, 2], [0, 3], [1, 2], [1, 5], [3, 5], [4, 5]], "family": "rlve_max_achromatic_coloring", "subset": "construct"} | null | null | null | {"colors": [0, 1, 2, 2, 0, 3]} | 1 |
construct-rlve-max-achromatic-coloring-l2-s0 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 2 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 8 vertices labelled 0..7 and edge list
[[0, 1], [0, 2], [0, 7], [1, 7], [3, 7], [4, 5], [5, 7], [6, 7]]
A complete colouring assigns colours so that (1) adjacent vertices get different colours and (2) for every pair of distinct colours x, y that are used, some edge has one endpoint colou... | {"n": 8, "k": 4, "edges": [[0, 1], [0, 2], [0, 7], [1, 7], [3, 7], [4, 5], [5, 7], [6, 7]], "family": "rlve_max_achromatic_coloring", "subset": "construct"} | null | null | null | {"colors": [0, 1, 2, 0, 1, 2, 0, 3]} | 1 |
construct-rlve-max-achromatic-coloring-l2-s1 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 2 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 8 vertices labelled 0..7 and edge list
[[0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [1, 3], [1, 5], [1, 6], [1, 7], [2, 3], [2, 4], [2, 6], [3, 4], [3, 5], [4, 5], [4, 6], [5, 6], [5, 7]]
A complete colouring assigns colours so that (1) adjacent vertices get different colours and (2)... | {"n": 8, "k": 5, "edges": [[0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [1, 3], [1, 5], [1, 6], [1, 7], [2, 3], [2, 4], [2, 6], [3, 4], [3, 5], [4, 5], [4, 6], [5, 6], [5, 7]], "family": "rlve_max_achromatic_coloring", "subset": "construct"} | null | null | null | {"colors": [0, 0, 1, 2, 3, 4, 2, 1]} | 1 |
construct-rlve-max-achromatic-coloring-l2-s2 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 2 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 8 vertices labelled 0..7 and edge list
[[0, 6], [0, 7], [1, 2], [1, 4], [1, 5], [1, 6], [2, 4], [2, 6], [2, 7], [3, 4], [3, 5], [4, 6], [4, 7], [5, 7]]
A complete colouring assigns colours so that (1) adjacent vertices get different colours and (2) for every pair of distinct colours x, y... | {"n": 8, "k": 5, "edges": [[0, 6], [0, 7], [1, 2], [1, 4], [1, 5], [1, 6], [2, 4], [2, 6], [2, 7], [3, 4], [3, 5], [4, 6], [4, 7], [5, 7]], "family": "rlve_max_achromatic_coloring", "subset": "construct"} | null | null | null | {"colors": [0, 0, 1, 0, 2, 3, 3, 4]} | 1 |
construct-rlve-max-achromatic-coloring-l2-s3 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 2 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 8 vertices labelled 0..7 and edge list
[[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 3], [1, 5], [1, 7], [2, 4], [2, 6], [2, 7], [3, 4], [3, 6], [3, 7], [4, 5], [4, 7], [5, 6], [5, 7], [6, 7]]
A complete colouring assigns colours so that (1) adjacent vertices get different colours and (2)... | {"n": 8, "k": 5, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 3], [1, 5], [1, 7], [2, 4], [2, 6], [2, 7], [3, 4], [3, 6], [3, 7], [4, 5], [4, 7], [5, 6], [5, 7], [6, 7]], "family": "rlve_max_achromatic_coloring", "subset": "construct"} | null | null | null | {"colors": [0, 1, 1, 2, 3, 2, 0, 4]} | 1 |
construct-rlve-max-achromatic-coloring-l2-s4 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 2 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 8 vertices labelled 0..7 and edge list
[[0, 1], [0, 3], [0, 5], [1, 2], [1, 3], [1, 4], [1, 6], [1, 7], [2, 3], [2, 4], [2, 5], [2, 7], [3, 4], [3, 5], [4, 5], [4, 6], [4, 7], [5, 6], [5, 7]]
A complete colouring assigns colours so that (1) adjacent vertices get different colours and (2)... | {"n": 8, "k": 5, "edges": [[0, 1], [0, 3], [0, 5], [1, 2], [1, 3], [1, 4], [1, 6], [1, 7], [2, 3], [2, 4], [2, 5], [2, 7], [3, 4], [3, 5], [4, 5], [4, 6], [4, 7], [5, 6], [5, 7]], "family": "rlve_max_achromatic_coloring", "subset": "construct"} | null | null | null | {"colors": [0, 1, 2, 3, 4, 1, 0, 0]} | 1 |
construct-rlve-max-achromatic-coloring-l2-s5 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 2 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 8 vertices labelled 0..7 and edge list
[[0, 1], [0, 3], [0, 4], [0, 5], [1, 2], [1, 5], [1, 7], [2, 3], [2, 4], [2, 5], [2, 6], [3, 4], [3, 5], [3, 6], [3, 7], [4, 5], [4, 7], [5, 6], [5, 7]]
A complete colouring assigns colours so that (1) adjacent vertices get different colours and (2)... | {"n": 8, "k": 5, "edges": [[0, 1], [0, 3], [0, 4], [0, 5], [1, 2], [1, 5], [1, 7], [2, 3], [2, 4], [2, 5], [2, 6], [3, 4], [3, 5], [3, 6], [3, 7], [4, 5], [4, 7], [5, 6], [5, 7]], "family": "rlve_max_achromatic_coloring", "subset": "construct"} | null | null | null | {"colors": [0, 1, 0, 1, 2, 3, 4, 4]} | 1 |
construct-rlve-max-achromatic-coloring-l2-s6 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 2 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 8 vertices labelled 0..7 and edge list
[[0, 2], [0, 3], [0, 5], [0, 6], [0, 7], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [2, 5], [2, 6], [2, 7], [3, 4], [3, 5], [3, 7], [4, 5], [5, 6], [6, 7]]
A complete colouring assigns colours so that (1) adjacent vertices get different colours and (2)... | {"n": 8, "k": 5, "edges": [[0, 2], [0, 3], [0, 5], [0, 6], [0, 7], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [2, 5], [2, 6], [2, 7], [3, 4], [3, 5], [3, 7], [4, 5], [5, 6], [6, 7]], "family": "rlve_max_achromatic_coloring", "subset": "construct"} | null | null | null | {"colors": [0, 0, 1, 1, 2, 3, 4, 2]} | 1 |
construct-rlve-max-achromatic-coloring-l2-s7 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 2 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 8 vertices labelled 0..7 and edge list
[[0, 1], [0, 2], [0, 3], [0, 6], [1, 2], [1, 5], [1, 6], [1, 7], [2, 5], [2, 7], [3, 4], [5, 6], [5, 7], [6, 7]]
A complete colouring assigns colours so that (1) adjacent vertices get different colours and (2) for every pair of distinct colours x, y... | {"n": 8, "k": 5, "edges": [[0, 1], [0, 2], [0, 3], [0, 6], [1, 2], [1, 5], [1, 6], [1, 7], [2, 5], [2, 7], [3, 4], [5, 6], [5, 7], [6, 7]], "family": "rlve_max_achromatic_coloring", "subset": "construct"} | null | null | null | {"colors": [0, 1, 2, 2, 3, 0, 3, 4]} | 1 |
construct-rlve-max-achromatic-coloring-l2-s8 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 2 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 8 vertices labelled 0..7 and edge list
[[0, 1], [0, 4], [0, 7], [1, 3], [1, 4], [1, 5], [2, 3], [2, 5], [3, 5], [3, 6], [3, 7], [4, 5], [5, 7], [6, 7]]
A complete colouring assigns colours so that (1) adjacent vertices get different colours and (2) for every pair of distinct colours x, y... | {"n": 8, "k": 5, "edges": [[0, 1], [0, 4], [0, 7], [1, 3], [1, 4], [1, 5], [2, 3], [2, 5], [3, 5], [3, 6], [3, 7], [4, 5], [5, 7], [6, 7]], "family": "rlve_max_achromatic_coloring", "subset": "construct"} | null | null | null | {"colors": [0, 1, 0, 2, 2, 3, 1, 4]} | 1 |
construct-rlve-max-achromatic-coloring-l2-s9 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 2 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 8 vertices labelled 0..7 and edge list
[[0, 1], [1, 2], [1, 5], [1, 6], [2, 3], [2, 7], [3, 6], [5, 6]]
A complete colouring assigns colours so that (1) adjacent vertices get different colours and (2) for every pair of distinct colours x, y that are used, some edge has one endpoint colou... | {"n": 8, "k": 4, "edges": [[0, 1], [1, 2], [1, 5], [1, 6], [2, 3], [2, 7], [3, 6], [5, 6]], "family": "rlve_max_achromatic_coloring", "subset": "construct"} | null | null | null | {"colors": [0, 1, 0, 2, 0, 2, 3, 3]} | 1 |
construct-rlve-max-achromatic-coloring-l3-s0 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 3 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 10 vertices labelled 0..9 and edge list
[[0, 2], [0, 5], [0, 6], [0, 7], [0, 9], [1, 2], [1, 7], [1, 8], [2, 6], [3, 7], [4, 6], [6, 7], [6, 8]]
A complete colouring assigns colours so that (1) adjacent vertices get different colours and (2) for every pair of distinct colours x, y that a... | {"n": 10, "k": 5, "edges": [[0, 2], [0, 5], [0, 6], [0, 7], [0, 9], [1, 2], [1, 7], [1, 8], [2, 6], [3, 7], [4, 6], [6, 7], [6, 8]], "family": "rlve_max_achromatic_coloring", "subset": "construct"} | null | null | null | {"colors": [0, 1, 2, 2, 1, 1, 3, 4, 0, 1]} | 1 |
construct-rlve-max-achromatic-coloring-l3-s1 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 3 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 10 vertices labelled 0..9 and edge list
[[0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [1, 3], [1, 4], [1, 6], [1, 9], [2, 3], [2, 6], [3, 4], [3, 6], [4, 5], [4, 6], [4, 8], [5, 6], [7, 8], [8, 9]]
A complete colouring assigns colours so that (1) adjacent vertices get different colour... | {"n": 10, "k": 6, "edges": [[0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [1, 3], [1, 4], [1, 6], [1, 9], [2, 3], [2, 6], [3, 4], [3, 6], [4, 5], [4, 6], [4, 8], [5, 6], [7, 8], [8, 9]], "family": "rlve_max_achromatic_coloring", "subset": "construct"} | null | null | null | {"colors": [0, 1, 1, 2, 3, 4, 5, 1, 2, 4]} | 1 |
construct-rlve-max-achromatic-coloring-l3-s2 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 3 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 10 vertices labelled 0..9 and edge list
[[0, 2], [0, 3], [0, 6], [0, 7], [1, 2], [1, 3], [1, 5], [1, 6], [1, 7], [1, 8], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [3, 4], [3, 6], [3, 7], [4, 5], [4, 7], [5, 7], [6, 7], [6, 9], [7, 8], [7, 9], [8, 9]]
A complete colouring assigns co... | {"n": 10, "k": 6, "edges": [[0, 2], [0, 3], [0, 6], [0, 7], [1, 2], [1, 3], [1, 5], [1, 6], [1, 7], [1, 8], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [3, 4], [3, 6], [3, 7], [4, 5], [4, 7], [5, 7], [6, 7], [6, 9], [7, 8], [7, 9], [8, 9]], "family": "rlve_max_achromatic_coloring", "subset": "construct"} | null | null | null | {"colors": [0, 0, 1, 2, 0, 3, 4, 5, 2, 3]} | 1 |
construct-rlve-max-achromatic-coloring-l3-s3 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 3 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 10 vertices labelled 0..9 and edge list
[[0, 2], [0, 3], [0, 4], [0, 6], [0, 8], [1, 2], [1, 3], [1, 5], [1, 7], [1, 9], [2, 4], [2, 5], [2, 6], [2, 7], [3, 5], [3, 7], [3, 8], [4, 6], [4, 7], [4, 8], [4, 9], [5, 7], [5, 8], [5, 9], [6, 7], [6, 8], [8, 9]]
A complete colouring assigns co... | {"n": 10, "k": 6, "edges": [[0, 2], [0, 3], [0, 4], [0, 6], [0, 8], [1, 2], [1, 3], [1, 5], [1, 7], [1, 9], [2, 4], [2, 5], [2, 6], [2, 7], [3, 5], [3, 7], [3, 8], [4, 6], [4, 7], [4, 8], [4, 9], [5, 7], [5, 8], [5, 9], [6, 7], [6, 8], [8, 9]], "family": "rlve_max_achromatic_coloring", "subset": "construct"} | null | null | null | {"colors": [0, 0, 1, 1, 2, 2, 3, 4, 5, 4]} | 1 |
construct-rlve-max-achromatic-coloring-l3-s4 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 3 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 10 vertices labelled 0..9 and edge list
[[0, 2], [0, 5], [0, 6], [0, 7], [1, 2], [1, 4], [1, 7], [1, 9], [2, 3], [2, 4], [2, 6], [2, 8], [2, 9], [3, 6], [3, 9], [4, 6], [4, 8], [4, 9], [5, 6], [5, 8], [5, 9], [6, 7], [6, 8], [6, 9], [7, 8], [7, 9], [8, 9]]
A complete colouring assigns co... | {"n": 10, "k": 7, "edges": [[0, 2], [0, 5], [0, 6], [0, 7], [1, 2], [1, 4], [1, 7], [1, 9], [2, 3], [2, 4], [2, 6], [2, 8], [2, 9], [3, 6], [3, 9], [4, 6], [4, 8], [4, 9], [5, 6], [5, 8], [5, 9], [6, 7], [6, 8], [6, 9], [7, 8], [7, 9], [8, 9]], "family": "rlve_max_achromatic_coloring", "subset": "construct"} | null | null | null | {"colors": [0, 1, 2, 3, 0, 1, 4, 3, 5, 6]} | 1 |
construct-rlve-max-achromatic-coloring-l3-s5 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 3 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 10 vertices labelled 0..9 and edge list
[[0, 6], [1, 3], [1, 8], [2, 3], [2, 4], [2, 5], [2, 6], [2, 8], [2, 9], [3, 5], [4, 6], [5, 8], [6, 9]]
A complete colouring assigns colours so that (1) adjacent vertices get different colours and (2) for every pair of distinct colours x, y that a... | {"n": 10, "k": 4, "edges": [[0, 6], [1, 3], [1, 8], [2, 3], [2, 4], [2, 5], [2, 6], [2, 8], [2, 9], [3, 5], [4, 6], [5, 8], [6, 9]], "family": "rlve_max_achromatic_coloring", "subset": "construct"} | null | null | null | {"colors": [0, 0, 0, 1, 1, 2, 3, 0, 1, 2]} | 1 |
construct-rlve-max-achromatic-coloring-l3-s6 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 3 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 10 vertices labelled 0..9 and edge list
[[0, 2], [0, 8], [1, 2], [1, 6], [1, 7], [1, 8], [1, 9], [2, 3], [2, 6], [2, 7], [3, 4], [3, 6], [3, 8], [3, 9], [4, 6], [4, 7], [5, 6], [5, 7], [5, 9], [6, 8]]
A complete colouring assigns colours so that (1) adjacent vertices get different colour... | {"n": 10, "k": 5, "edges": [[0, 2], [0, 8], [1, 2], [1, 6], [1, 7], [1, 8], [1, 9], [2, 3], [2, 6], [2, 7], [3, 4], [3, 6], [3, 8], [3, 9], [4, 6], [4, 7], [5, 6], [5, 7], [5, 9], [6, 8]], "family": "rlve_max_achromatic_coloring", "subset": "construct"} | null | null | null | {"colors": [0, 0, 1, 0, 2, 1, 3, 4, 4, 2]} | 1 |
construct-rlve-max-achromatic-coloring-l3-s7 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 3 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 10 vertices labelled 0..9 and edge list
[[0, 2], [0, 3], [0, 5], [0, 6], [0, 7], [1, 2], [1, 5], [1, 6], [1, 8], [1, 9], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 9], [3, 5], [3, 7], [4, 5], [4, 7], [4, 8], [5, 6], [5, 9], [6, 8], [7, 8], [7, 9], [8, 9]]
A complete colouring assigns co... | {"n": 10, "k": 6, "edges": [[0, 2], [0, 3], [0, 5], [0, 6], [0, 7], [1, 2], [1, 5], [1, 6], [1, 8], [1, 9], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 9], [3, 5], [3, 7], [4, 5], [4, 7], [4, 8], [5, 6], [5, 9], [6, 8], [7, 8], [7, 9], [8, 9]], "family": "rlve_max_achromatic_coloring", "subset": "construct"} | null | null | null | {"colors": [0, 0, 1, 2, 0, 3, 4, 4, 2, 5]} | 1 |
construct-rlve-max-achromatic-coloring-l3-s8 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 3 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 10 vertices labelled 0..9 and edge list
[[0, 7], [1, 6], [1, 7], [2, 6], [2, 9], [3, 6], [3, 7], [3, 8], [4, 5], [4, 9], [6, 9], [7, 8], [8, 9]]
A complete colouring assigns colours so that (1) adjacent vertices get different colours and (2) for every pair of distinct colours x, y that a... | {"n": 10, "k": 5, "edges": [[0, 7], [1, 6], [1, 7], [2, 6], [2, 9], [3, 6], [3, 7], [3, 8], [4, 5], [4, 9], [6, 9], [7, 8], [8, 9]], "family": "rlve_max_achromatic_coloring", "subset": "construct"} | null | null | null | {"colors": [0, 0, 1, 1, 2, 3, 3, 2, 0, 4]} | 1 |
construct-rlve-max-achromatic-coloring-l3-s9 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 3 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 10 vertices labelled 0..9 and edge list
[[0, 1], [0, 2], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [1, 2], [1, 3], [1, 4], [1, 6], [1, 7], [1, 8], [2, 3], [2, 6], [2, 8], [2, 9], [3, 4], [3, 5], [4, 5], [4, 7], [4, 8], [5, 7], [5, 9], [6, 7], [6, 8], [8, 9]]
A complete colouring assigns co... | {"n": 10, "k": 6, "edges": [[0, 1], [0, 2], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [1, 2], [1, 3], [1, 4], [1, 6], [1, 7], [1, 8], [2, 3], [2, 6], [2, 8], [2, 9], [3, 4], [3, 5], [4, 5], [4, 7], [4, 8], [5, 7], [5, 9], [6, 7], [6, 8], [8, 9]], "family": "rlve_max_achromatic_coloring", "subset": "construct"} | null | null | null | {"colors": [0, 1, 2, 0, 2, 1, 3, 4, 5, 4]} | 1 |
construct-rlve-max-achromatic-coloring-l4-s0 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 4 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 12 vertices labelled 0..11 and edge list
[[0, 1], [0, 2], [0, 3], [0, 5], [0, 7], [0, 8], [0, 9], [0, 11], [1, 3], [1, 4], [1, 5], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [2, 4], [2, 5], [2, 6], [2, 9], [2, 11], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [4, 5], [4, 8], [4, 11], [5, 6], [5... | {"n": 12, "k": 8, "edges": [[0, 1], [0, 2], [0, 3], [0, 5], [0, 7], [0, 8], [0, 9], [0, 11], [1, 3], [1, 4], [1, 5], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [2, 4], [2, 5], [2, 6], [2, 9], [2, 11], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [4, 5], [4, 8], [4, 11], [5, 6], [5, 7], [5, 8], [5, 9], [6, 7], [6, 9], [6, 10]... | null | null | null | {"colors": [0, 1, 1, 2, 0, 3, 4, 5, 6, 7, 0, 4]} | 1 |
construct-rlve-max-achromatic-coloring-l4-s1 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 4 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 12 vertices labelled 0..11 and edge list
[[0, 1], [0, 3], [0, 5], [0, 6], [0, 11], [1, 3], [1, 5], [1, 9], [1, 10], [1, 11], [2, 3], [2, 5], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [3, 4], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [4, 5], [4, 6], [4, 7], [4, 9], [4, 11], [5, 7],... | {"n": 12, "k": 7, "edges": [[0, 1], [0, 3], [0, 5], [0, 6], [0, 11], [1, 3], [1, 5], [1, 9], [1, 10], [1, 11], [2, 3], [2, 5], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [3, 4], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [4, 5], [4, 6], [4, 7], [4, 9], [4, 11], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [6, 8], [6... | null | null | null | {"colors": [0, 1, 0, 2, 0, 2, 3, 4, 1, 4, 5, 6]} | 1 |
construct-rlve-max-achromatic-coloring-l4-s2 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 4 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 12 vertices labelled 0..11 and edge list
[[0, 3], [0, 4], [0, 5], [0, 6], [0, 8], [0, 9], [0, 10], [1, 2], [1, 5], [1, 6], [1, 8], [1, 10], [2, 5], [2, 8], [2, 11], [3, 6], [3, 7], [3, 8], [4, 8], [4, 9], [4, 10], [5, 6], [5, 9], [5, 10], [5, 11], [6, 7], [6, 8], [7, 9], [7, 11], [8, 10],... | {"n": 12, "k": 7, "edges": [[0, 3], [0, 4], [0, 5], [0, 6], [0, 8], [0, 9], [0, 10], [1, 2], [1, 5], [1, 6], [1, 8], [1, 10], [2, 5], [2, 8], [2, 11], [3, 6], [3, 7], [3, 8], [4, 8], [4, 9], [4, 10], [5, 6], [5, 9], [5, 10], [5, 11], [6, 7], [6, 8], [7, 9], [7, 11], [8, 10], [8, 11], [9, 10], [9, 11]], "family": "rlve_... | null | null | null | {"colors": [0, 1, 0, 2, 3, 2, 3, 4, 4, 5, 6, 1]} | 1 |
construct-rlve-max-achromatic-coloring-l4-s3 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 4 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 12 vertices labelled 0..11 and edge list
[[0, 6], [0, 11], [1, 3], [1, 5], [1, 7], [1, 11], [2, 3], [2, 5], [2, 6], [2, 7], [3, 4], [3, 9], [3, 11], [4, 5], [4, 10], [4, 11], [5, 7], [5, 8], [6, 9], [6, 11], [7, 9], [7, 11], [8, 11]]
A complete colouring assigns colours so that (1) adjac... | {"n": 12, "k": 6, "edges": [[0, 6], [0, 11], [1, 3], [1, 5], [1, 7], [1, 11], [2, 3], [2, 5], [2, 6], [2, 7], [3, 4], [3, 9], [3, 11], [4, 5], [4, 10], [4, 11], [5, 7], [5, 8], [6, 9], [6, 11], [7, 9], [7, 11], [8, 11]], "family": "rlve_max_achromatic_coloring", "subset": "construct"} | null | null | null | {"colors": [0, 1, 0, 2, 0, 2, 1, 3, 4, 4, 4, 5]} | 1 |
construct-rlve-max-achromatic-coloring-l4-s4 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 4 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 12 vertices labelled 0..11 and edge list
[[0, 2], [0, 3], [0, 5], [0, 11], [1, 2], [1, 5], [1, 6], [1, 7], [1, 10], [2, 5], [2, 6], [2, 9], [2, 10], [3, 4], [3, 7], [3, 9], [3, 10], [3, 11], [4, 5], [5, 8], [6, 10], [6, 11], [7, 10]]
A complete colouring assigns colours so that (1) adjac... | {"n": 12, "k": 6, "edges": [[0, 2], [0, 3], [0, 5], [0, 11], [1, 2], [1, 5], [1, 6], [1, 7], [1, 10], [2, 5], [2, 6], [2, 9], [2, 10], [3, 4], [3, 7], [3, 9], [3, 10], [3, 11], [4, 5], [5, 8], [6, 10], [6, 11], [7, 10]], "family": "rlve_max_achromatic_coloring", "subset": "construct"} | null | null | null | {"colors": [0, 0, 1, 2, 0, 2, 3, 4, 3, 4, 5, 4]} | 1 |
construct-rlve-max-achromatic-coloring-l4-s5 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 4 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 12 vertices labelled 0..11 and edge list
[[0, 2], [0, 3], [0, 7], [0, 9], [1, 3], [1, 4], [1, 6], [1, 7], [1, 8], [2, 3], [2, 4], [2, 6], [2, 10], [3, 7], [3, 8], [3, 9], [3, 11], [4, 5], [4, 6], [4, 9], [4, 10], [4, 11], [5, 7], [5, 9], [5, 11], [6, 7], [6, 8], [6, 9], [6, 11], [8, 9], [... | {"n": 12, "k": 7, "edges": [[0, 2], [0, 3], [0, 7], [0, 9], [1, 3], [1, 4], [1, 6], [1, 7], [1, 8], [2, 3], [2, 4], [2, 6], [2, 10], [3, 7], [3, 8], [3, 9], [3, 11], [4, 5], [4, 6], [4, 9], [4, 10], [4, 11], [5, 7], [5, 9], [5, 11], [6, 7], [6, 8], [6, 9], [6, 11], [8, 9], [9, 10], [9, 11], [10, 11]], "family": "rlve_m... | null | null | null | {"colors": [0, 0, 1, 2, 2, 1, 3, 4, 5, 6, 4, 5]} | 1 |
construct-rlve-max-achromatic-coloring-l4-s6 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 4 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 12 vertices labelled 0..11 and edge list
[[0, 1], [0, 3], [0, 5], [0, 9], [0, 10], [1, 2], [1, 4], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [2, 3], [2, 6], [2, 9], [2, 11], [3, 4], [3, 6], [3, 8], [3, 11], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [5, 8], [5, 9], [5, 11], ... | {"n": 12, "k": 7, "edges": [[0, 1], [0, 3], [0, 5], [0, 9], [0, 10], [1, 2], [1, 4], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [2, 3], [2, 6], [2, 9], [2, 11], [3, 4], [3, 6], [3, 8], [3, 11], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [5, 8], [5, 9], [5, 11], [7, 8], [7, 10], [10, 11]], "family": "rlve_m... | null | null | null | {"colors": [0, 1, 2, 3, 4, 2, 0, 3, 5, 6, 5, 6]} | 1 |
construct-rlve-max-achromatic-coloring-l4-s7 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 4 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 12 vertices labelled 0..11 and edge list
[[0, 2], [0, 3], [0, 6], [0, 8], [0, 9], [0, 10], [0, 11], [1, 4], [1, 5], [1, 7], [1, 8], [1, 9], [2, 5], [2, 6], [2, 8], [2, 9], [2, 10], [2, 11], [3, 5], [3, 7], [3, 9], [3, 10], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 11], [5, 8], [5, 9], [... | {"n": 12, "k": 8, "edges": [[0, 2], [0, 3], [0, 6], [0, 8], [0, 9], [0, 10], [0, 11], [1, 4], [1, 5], [1, 7], [1, 8], [1, 9], [2, 5], [2, 6], [2, 8], [2, 9], [2, 10], [2, 11], [3, 5], [3, 7], [3, 9], [3, 10], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 11], [5, 8], [5, 9], [5, 11], [6, 7], [6, 8], [6, 9], [6, 10], [6, ... | null | null | null | {"colors": [0, 0, 1, 2, 3, 4, 2, 1, 5, 6, 7, 7]} | 1 |
construct-rlve-max-achromatic-coloring-l4-s8 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 4 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 12 vertices labelled 0..11 and edge list
[[0, 2], [0, 3], [0, 4], [0, 6], [0, 7], [0, 9], [0, 10], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 8], [1, 9], [2, 5], [2, 8], [2, 9], [2, 10], [2, 11], [3, 5], [3, 7], [3, 8], [3, 9], [3, 10], [4, 5], [4, 6], [4, 8], [4, 9], [4, 10], [4, 11], [... | {"n": 12, "k": 7, "edges": [[0, 2], [0, 3], [0, 4], [0, 6], [0, 7], [0, 9], [0, 10], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 8], [1, 9], [2, 5], [2, 8], [2, 9], [2, 10], [2, 11], [3, 5], [3, 7], [3, 8], [3, 9], [3, 10], [4, 5], [4, 6], [4, 8], [4, 9], [4, 10], [4, 11], [5, 6], [5, 9], [6, 7], [6, 8], [6, 10], [6, 1... | null | null | null | {"colors": [0, 0, 1, 1, 2, 3, 1, 3, 4, 5, 6, 4]} | 1 |
construct-rlve-max-achromatic-coloring-l4-s9 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 4 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 12 vertices labelled 0..11 and edge list
[[0, 1], [0, 2], [0, 3], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [1, 2], [1, 3], [1, 4], [1, 5], [1, 7], [1, 8], [2, 5], [2, 7], [2, 8], [2, 9], [2, 10], [3, 8], [3, 9], [4, 5], [4, 7], [4, 8], [4, 9], [4, 10], [5, 6], [5, 7], [5, 8], [5, ... | {"n": 12, "k": 8, "edges": [[0, 1], [0, 2], [0, 3], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [1, 2], [1, 3], [1, 4], [1, 5], [1, 7], [1, 8], [2, 5], [2, 7], [2, 8], [2, 9], [2, 10], [3, 8], [3, 9], [4, 5], [4, 7], [4, 8], [4, 9], [4, 10], [5, 6], [5, 7], [5, 8], [5, 9], [6, 8], [6, 10], [6, 11], [7, 8], [7, 9],... | null | null | null | {"colors": [0, 1, 2, 2, 3, 4, 3, 5, 6, 7, 1, 2]} | 1 |
construct-rlve-max-achromatic-coloring-l5-s0 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 5 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 13 vertices labelled 0..12 and edge list
[[0, 1], [0, 2], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 11], [0, 12], [1, 2], [1, 3], [1, 5], [1, 9], [1, 10], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [3, 5], [3, 6], [3, 8], [3, 10], [3, 11], [3, 12], [4, 5], [4, 7], [... | {"n": 13, "k": 8, "edges": [[0, 1], [0, 2], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 11], [0, 12], [1, 2], [1, 3], [1, 5], [1, 9], [1, 10], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [3, 5], [3, 6], [3, 8], [3, 10], [3, 11], [3, 12], [4, 5], [4, 7], [4, 8], [4, 11], [4, 12], [5, 6], [5, 7], [5, ... | null | null | null | {"colors": [0, 1, 2, 0, 1, 3, 4, 5, 6, 5, 4, 7, 2]} | 1 |
construct-rlve-max-achromatic-coloring-l5-s1 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 5 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 13 vertices labelled 0..12 and edge list
[[0, 4], [0, 5], [0, 12], [1, 2], [1, 7], [1, 10], [1, 12], [2, 6], [2, 7], [2, 9], [3, 5], [3, 6], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [4, 8], [4, 9], [4, 11], [4, 12], [5, 7], [5, 9], [5, 11], [6, 7], [6, 8], [6, 9], [7, 10], [9, 10], [10,... | {"n": 13, "k": 7, "edges": [[0, 4], [0, 5], [0, 12], [1, 2], [1, 7], [1, 10], [1, 12], [2, 6], [2, 7], [2, 9], [3, 5], [3, 6], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [4, 8], [4, 9], [4, 11], [4, 12], [5, 7], [5, 9], [5, 11], [6, 7], [6, 8], [6, 9], [7, 10], [9, 10], [10, 12], [11, 12]], "family": "rlve_max_achromat... | null | null | null | {"colors": [0, 1, 2, 0, 3, 1, 4, 3, 5, 6, 5, 4, 2]} | 1 |
construct-rlve-max-achromatic-coloring-l5-s2 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 5 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 13 vertices labelled 0..12 and edge list
[[0, 1], [0, 2], [0, 4], [0, 5], [0, 9], [0, 10], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 9], [1, 10], [1, 11], [2, 3], [2, 4], [2, 7], [2, 9], [2, 10], [2, 11], [2, 12], [3, 4], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12]... | {"n": 13, "k": 9, "edges": [[0, 1], [0, 2], [0, 4], [0, 5], [0, 9], [0, 10], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 9], [1, 10], [1, 11], [2, 3], [2, 4], [2, 7], [2, 9], [2, 10], [2, 11], [2, 12], [3, 4], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [4, 6], [4, 8], [4, 12], [5, 6], [5, 7], [5... | null | null | null | {"colors": [0, 1, 2, 3, 4, 2, 5, 4, 0, 6, 7, 8, 0]} | 1 |
construct-rlve-max-achromatic-coloring-l5-s3 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 5 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 13 vertices labelled 0..12 and edge list
[[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 11], [0, 12], [1, 2], [1, 3], [1, 6], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 12], [3, 7], [3, 8], [3, 10], [4, 5], [4, 9], [4, 11], [5, 7], [5, 8], [5, 9], [5... | {"n": 13, "k": 8, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 11], [0, 12], [1, 2], [1, 3], [1, 6], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 12], [3, 7], [3, 8], [3, 10], [4, 5], [4, 9], [4, 11], [5, 7], [5, 8], [5, 9], [5, 11], [6, 9], [6, 10], [6, 12], [7, 10], [7,... | null | null | null | {"colors": [0, 1, 2, 3, 3, 4, 5, 5, 6, 7, 2, 1, 6]} | 1 |
construct-rlve-max-achromatic-coloring-l5-s4 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 5 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 13 vertices labelled 0..12 and edge list
[[0, 1], [0, 3], [0, 4], [0, 5], [0, 7], [0, 9], [0, 11], [0, 12], [1, 2], [1, 4], [1, 7], [1, 9], [1, 11], [1, 12], [2, 4], [2, 5], [2, 7], [2, 9], [2, 10], [2, 11], [3, 4], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 12], [4, 5], [4, 6], [4, 8],... | {"n": 13, "k": 8, "edges": [[0, 1], [0, 3], [0, 4], [0, 5], [0, 7], [0, 9], [0, 11], [0, 12], [1, 2], [1, 4], [1, 7], [1, 9], [1, 11], [1, 12], [2, 4], [2, 5], [2, 7], [2, 9], [2, 10], [2, 11], [3, 4], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 12], [4, 5], [4, 6], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [5, 8], [... | null | null | null | {"colors": [0, 1, 0, 1, 2, 3, 0, 3, 4, 5, 6, 6, 7]} | 1 |
construct-rlve-max-achromatic-coloring-l5-s5 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 5 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 13 vertices labelled 0..12 and edge list
[[0, 1], [0, 2], [0, 3], [0, 4], [0, 7], [0, 8], [0, 9], [1, 2], [1, 3], [1, 4], [1, 5], [1, 8], [1, 10], [1, 11], [1, 12], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 10], [2, 11], [3, 4], [3, 6], [3, 8], [3, 10], [3, 11], [4, 9], [4, 10],... | {"n": 13, "k": 9, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 7], [0, 8], [0, 9], [1, 2], [1, 3], [1, 4], [1, 5], [1, 8], [1, 10], [1, 11], [1, 12], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 10], [2, 11], [3, 4], [3, 6], [3, 8], [3, 10], [3, 11], [4, 9], [4, 10], [4, 11], [4, 12], [5, 6], [5, 7], [5, 8], [5... | null | null | null | {"colors": [0, 1, 2, 3, 4, 3, 0, 5, 6, 6, 7, 8, 5]} | 1 |
construct-rlve-max-achromatic-coloring-l5-s6 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 5 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 13 vertices labelled 0..12 and edge list
[[0, 4], [0, 6], [0, 7], [0, 10], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [2, 4], [2, 7], [2, 9], [2, 10], [2, 11], [3, 5], [3, 7], [3, 9], [3, 10], [4, 6], [4, 9], [5, 8], [5, 11], [6, 10], [6, 11], [7, 11], [7, 12], [8, 9], [8, 11], [8, 12], [9... | {"n": 13, "k": 7, "edges": [[0, 4], [0, 6], [0, 7], [0, 10], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [2, 4], [2, 7], [2, 9], [2, 10], [2, 11], [3, 5], [3, 7], [3, 9], [3, 10], [4, 6], [4, 9], [5, 8], [5, 11], [6, 10], [6, 11], [7, 11], [7, 12], [8, 9], [8, 11], [8, 12], [9, 10], [10, 12]], "family": "rlve_max_achroma... | null | null | null | {"colors": [0, 1, 2, 3, 1, 0, 4, 5, 2, 5, 6, 3, 4]} | 1 |
construct-rlve-max-achromatic-coloring-l5-s7 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 5 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 13 vertices labelled 0..12 and edge list
[[0, 2], [0, 4], [0, 5], [1, 2], [1, 7], [1, 10], [2, 3], [2, 5], [2, 6], [2, 12], [3, 5], [3, 7], [3, 9], [3, 10], [3, 12], [4, 8], [4, 12], [5, 9], [5, 12], [6, 7], [6, 8], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [8, 11], [8, 12], [9, 10], [10... | {"n": 13, "k": 7, "edges": [[0, 2], [0, 4], [0, 5], [1, 2], [1, 7], [1, 10], [2, 3], [2, 5], [2, 6], [2, 12], [3, 5], [3, 7], [3, 9], [3, 10], [3, 12], [4, 8], [4, 12], [5, 9], [5, 12], [6, 7], [6, 8], [7, 8], [7, 9], [7, 10], [7, 11], [7, 12], [8, 11], [8, 12], [9, 10], [10, 12], [11, 12]], "family": "rlve_max_achroma... | null | null | null | {"colors": [0, 0, 1, 2, 2, 3, 3, 4, 0, 5, 1, 5, 6]} | 1 |
construct-rlve-max-achromatic-coloring-l5-s8 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 5 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 13 vertices labelled 0..12 and edge list
[[0, 2], [0, 3], [0, 5], [0, 6], [0, 7], [0, 9], [0, 10], [0, 11], [0, 12], [1, 3], [1, 6], [1, 7], [1, 10], [1, 12], [2, 5], [2, 6], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [3, 4], [3, 5], [3, 7], [3, 8], [3, 10], [3, 12], [4, 6], [4, 7], [4, 8... | {"n": 13, "k": 8, "edges": [[0, 2], [0, 3], [0, 5], [0, 6], [0, 7], [0, 9], [0, 10], [0, 11], [0, 12], [1, 3], [1, 6], [1, 7], [1, 10], [1, 12], [2, 5], [2, 6], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [3, 4], [3, 5], [3, 7], [3, 8], [3, 10], [3, 12], [4, 6], [4, 7], [4, 8], [4, 9], [4, 11], [5, 6], [5, 9], [5, 11], ... | null | null | null | {"colors": [0, 1, 2, 3, 2, 4, 5, 4, 5, 1, 6, 7, 7]} | 1 |
construct-rlve-max-achromatic-coloring-l5-s9 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 5 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 13 vertices labelled 0..12 and edge list
[[0, 2], [0, 3], [0, 4], [0, 7], [0, 10], [0, 11], [0, 12], [1, 3], [1, 4], [1, 7], [1, 9], [1, 10], [1, 12], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 11], [2, 12], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11]... | {"n": 13, "k": 8, "edges": [[0, 2], [0, 3], [0, 4], [0, 7], [0, 10], [0, 11], [0, 12], [1, 3], [1, 4], [1, 7], [1, 9], [1, 10], [1, 12], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 11], [2, 12], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [4, 5], [4, 6], [4, 9], [4, 10], [... | null | null | null | {"colors": [0, 0, 1, 2, 3, 0, 4, 3, 5, 6, 1, 5, 7]} | 1 |
construct-rlve-max-achromatic-coloring-l6-s0 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 6 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 14 vertices labelled 0..13 and edge list
[[0, 1], [0, 5], [0, 6], [1, 2], [1, 4], [1, 5], [1, 8], [2, 3], [2, 4], [2, 5], [2, 7], [2, 8], [2, 10], [2, 12], [2, 13], [3, 6], [3, 8], [3, 9], [3, 10], [3, 13], [4, 7], [4, 9], [4, 11], [5, 8], [5, 10], [5, 11], [5, 12], [5, 13], [6, 9], [6, 1... | {"n": 14, "k": 8, "edges": [[0, 1], [0, 5], [0, 6], [1, 2], [1, 4], [1, 5], [1, 8], [2, 3], [2, 4], [2, 5], [2, 7], [2, 8], [2, 10], [2, 12], [2, 13], [3, 6], [3, 8], [3, 9], [3, 10], [3, 13], [4, 7], [4, 9], [4, 11], [5, 8], [5, 10], [5, 11], [5, 12], [5, 13], [6, 9], [6, 11], [6, 13], [7, 8], [7, 11], [8, 11], [8, 12... | null | null | null | {"colors": [0, 1, 0, 1, 2, 2, 3, 4, 5, 4, 6, 6, 3, 7]} | 1 |
construct-rlve-max-achromatic-coloring-l6-s1 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 6 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 14 vertices labelled 0..13 and edge list
[[0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 8], [0, 9], [0, 10], [0, 11], [0, 13], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 12], [1, 13], [2, 3], [2, 4], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [3, 4], [3, 8], [3, 9], [3, 1... | {"n": 14, "k": 9, "edges": [[0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 8], [0, 9], [0, 10], [0, 11], [0, 13], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 12], [1, 13], [2, 3], [2, 4], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [3, 4], [3, 8], [3, 9], [3, 10], [3, 11], [3, 13], [4, 10], [4, 11], [4, 1... | null | null | null | {"colors": [0, 0, 1, 2, 3, 1, 3, 4, 4, 5, 6, 7, 5, 8]} | 1 |
construct-rlve-max-achromatic-coloring-l6-s2 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 6 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 14 vertices labelled 0..13 and edge list
[[0, 1], [0, 4], [0, 5], [0, 6], [0, 7], [0, 9], [0, 13], [1, 3], [1, 4], [1, 6], [1, 10], [1, 11], [1, 12], [1, 13], [2, 3], [2, 4], [2, 5], [2, 7], [2, 8], [2, 11], [2, 12], [2, 13], [3, 5], [3, 7], [3, 8], [3, 9], [3, 10], [3, 12], [3, 13], [4, ... | {"n": 14, "k": 9, "edges": [[0, 1], [0, 4], [0, 5], [0, 6], [0, 7], [0, 9], [0, 13], [1, 3], [1, 4], [1, 6], [1, 10], [1, 11], [1, 12], [1, 13], [2, 3], [2, 4], [2, 5], [2, 7], [2, 8], [2, 11], [2, 12], [2, 13], [3, 5], [3, 7], [3, 8], [3, 9], [3, 10], [3, 12], [3, 13], [4, 5], [4, 6], [4, 7], [4, 11], [4, 13], [5, 6],... | null | null | null | {"colors": [0, 1, 0, 2, 3, 4, 2, 5, 1, 3, 4, 6, 7, 8]} | 1 |
construct-rlve-max-achromatic-coloring-l6-s3 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 6 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 14 vertices labelled 0..13 and edge list
[[0, 3], [0, 9], [0, 12], [0, 13], [1, 4], [1, 5], [1, 8], [1, 9], [1, 10], [1, 13], [2, 5], [2, 6], [2, 7], [2, 9], [2, 11], [3, 4], [3, 6], [3, 8], [4, 6], [4, 8], [4, 9], [4, 11], [5, 6], [5, 7], [5, 9], [5, 10], [5, 12], [6, 11], [6, 12], [7, 9... | {"n": 14, "k": 8, "edges": [[0, 3], [0, 9], [0, 12], [0, 13], [1, 4], [1, 5], [1, 8], [1, 9], [1, 10], [1, 13], [2, 5], [2, 6], [2, 7], [2, 9], [2, 11], [3, 4], [3, 6], [3, 8], [4, 6], [4, 8], [4, 9], [4, 11], [5, 6], [5, 7], [5, 9], [5, 10], [5, 12], [6, 11], [6, 12], [7, 9], [7, 10], [7, 11], [8, 9], [8, 10], [8, 11]... | null | null | null | {"colors": [0, 0, 1, 2, 3, 2, 4, 3, 5, 4, 6, 7, 7, 1]} | 1 |
construct-rlve-max-achromatic-coloring-l6-s4 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 6 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 14 vertices labelled 0..13 and edge list
[[0, 4], [0, 5], [0, 8], [0, 10], [0, 11], [1, 2], [1, 6], [1, 9], [1, 10], [1, 11], [1, 12], [2, 5], [2, 9], [2, 10], [2, 12], [3, 5], [3, 6], [4, 6], [4, 7], [4, 8], [4, 10], [4, 11], [4, 13], [5, 6], [5, 9], [6, 9], [6, 10], [6, 11], [6, 12], [6... | {"n": 14, "k": 8, "edges": [[0, 4], [0, 5], [0, 8], [0, 10], [0, 11], [1, 2], [1, 6], [1, 9], [1, 10], [1, 11], [1, 12], [2, 5], [2, 9], [2, 10], [2, 12], [3, 5], [3, 6], [4, 6], [4, 7], [4, 8], [4, 10], [4, 11], [4, 13], [5, 6], [5, 9], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [7, 8], [7, 10], [7, 11], [7, 12], [8,... | null | null | null | {"colors": [0, 0, 1, 0, 2, 3, 4, 3, 5, 6, 7, 1, 2, 5]} | 1 |
construct-rlve-max-achromatic-coloring-l6-s5 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 6 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 14 vertices labelled 0..13 and edge list
[[0, 1], [0, 2], [0, 4], [0, 7], [0, 9], [0, 11], [0, 13], [1, 4], [1, 5], [1, 6], [1, 8], [1, 10], [1, 11], [1, 12], [2, 5], [2, 11], [2, 12], [2, 13], [3, 5], [3, 7], [3, 13], [4, 5], [4, 6], [4, 7], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [5... | {"n": 14, "k": 8, "edges": [[0, 1], [0, 2], [0, 4], [0, 7], [0, 9], [0, 11], [0, 13], [1, 4], [1, 5], [1, 6], [1, 8], [1, 10], [1, 11], [1, 12], [2, 5], [2, 11], [2, 12], [2, 13], [3, 5], [3, 7], [3, 13], [4, 5], [4, 6], [4, 7], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [5, 10], [5, 11], [5, 12], [6, 7], [7, 8], [7, ... | null | null | null | {"colors": [0, 1, 2, 0, 3, 4, 2, 4, 5, 6, 6, 7, 6, 5]} | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.