problem_id
stringlengths 14
17
⌀ | task_type
stringclasses 2
values | prompt
stringlengths 608
6.19k
| verification_info
stringlengths 679
11.9k
| metadata
stringlengths 17
466
| responses
sequencelengths 8
8
| response_lens
sequencelengths 8
8
| avg_reward
float64 0.03
0.47
|
|---|---|---|---|---|---|---|---|
null |
reasoning_gym
| "In front of you are some buttons, a light, and a number. The light will toggle between red and gree(...TRUNCATED)
| "{\"reasoning_gym_dataset\": \"quantum_lock\", \"ground_truth\": \"C \\u2192 B \\u2192 C \\u2192 C \(...TRUNCATED)
| "{\"source_dataset\": \"quantum_lock\", \"source_index\": 1150, \"solution_path\": [\"C\", \"B\", \"(...TRUNCATED)
| [" If there is no solution, return null.\n\nOkay, so I have this problem here where I need to figure(...TRUNCATED)
|
[
18000,
13468,
11579,
17741,
2926,
1029,
12132,
11756
] | 0.125
|
null |
reasoning_gym
| "In front of you are some buttons, a light, and a number. The light will toggle between red and gree(...TRUNCATED)
| "{\"reasoning_gym_dataset\": \"quantum_lock\", \"ground_truth\": \"B \\u2192 C \\u2192 B \\u2192 B \(...TRUNCATED)
| "{\"source_dataset\": \"quantum_lock\", \"source_index\": 643, \"solution_path\": [\"B\", \"C\", \"B(...TRUNCATED)
| [" If no sequence exists, return null.\n\nOkay, let's tackle this problem step by step. So, I have a(...TRUNCATED)
|
[
18000,
7770,
9890,
10581,
18000,
9366,
12506,
10948
] | 0.375
|
null |
reasoning_gym
| "In front of you are some buttons, a light, and a number. The light will toggle between red and gree(...TRUNCATED)
| "{\"reasoning_gym_dataset\": \"quantum_lock\", \"ground_truth\": \"B \\u2192 A \\u2192 A \\u2192 A \(...TRUNCATED)
| "{\"source_dataset\": \"quantum_lock\", \"source_index\": 1094, \"solution_path\": [\"B\", \"A\", \"(...TRUNCATED)
| [" If no sequence exists, return null.\n\n<think>\nOkay, so I need to figure out how to get from 0 ((...TRUNCATED)
|
[
9489,
14575,
10035,
18000,
15676,
18000,
18000,
18000
] | 0.25
|
null |
reasoning_gym
| "In front of you are some buttons, a light, and a number. The light will toggle between red and gree(...TRUNCATED)
| "{\"reasoning_gym_dataset\": \"quantum_lock\", \"ground_truth\": \"A \\u2192 B \\u2192 A \\u2192 B \(...TRUNCATED)
| "{\"source_dataset\": \"quantum_lock\", \"source_index\": 1113, \"solution_path\": [\"A\", \"B\", \"(...TRUNCATED)
| [" If no solution exists, return null.\nOkay, so I'm trying to solve this puzzle where I have to pre(...TRUNCATED)
|
[
12217,
18000,
11401,
8616,
11165,
12830,
11103,
18000
] | 0.375
|
null |
reasoning_gym
| "In front of you are some buttons, a light, and a number. The light will toggle between red and gree(...TRUNCATED)
| "{\"reasoning_gym_dataset\": \"quantum_lock\", \"ground_truth\": \"A \\u2192 A \\u2192 B \\u2192 A \(...TRUNCATED)
| "{\"source_dataset\": \"quantum_lock\", \"source_index\": 699, \"solution_path\": [\"A\", \"A\", \"B(...TRUNCATED)
| [" If no such sequence exists, return an empty string.\n\nAlright, so I've got this problem here whe(...TRUNCATED)
|
[
18000,
18000,
9266,
10105,
9091,
18000,
2733,
7753
] | 0.25
|
null |
reasoning_gym
| "In front of you are some buttons, a light, and a number. The light will toggle between red and gree(...TRUNCATED)
| "{\"reasoning_gym_dataset\": \"quantum_lock\", \"ground_truth\": \"B \\u2192 B \\u2192 B \\u2192 B \(...TRUNCATED)
| "{\"source_dataset\": \"quantum_lock\", \"source_index\": 1365, \"solution_path\": [\"B\", \"B\", \"(...TRUNCATED)
| [" If no solution exists, return { \"sequence\": \"No solution.\" }\n\nAlright, let's try to figure (...TRUNCATED)
|
[
8918,
14330,
14462,
10947,
18000,
16027,
17777,
18000
] | 0.25
|
null |
reasoning_gym
| "In front of you are some buttons, a light, and a number. The light will toggle between red and gree(...TRUNCATED)
| "{\"reasoning_gym_dataset\": \"quantum_lock\", \"ground_truth\": \"B \\u2192 A \\u2192 B \\u2192 A \(...TRUNCATED)
| "{\"source_dataset\": \"quantum_lock\", \"source_index\": 475, \"solution_path\": [\"B\", \"A\", \"B(...TRUNCATED)
| [" If there's no solution, return null.\n</think>\n\nTo solve this problem, we need to determine the(...TRUNCATED)
|
[
2721,
18000,
10302,
18000,
14715,
11444,
14390,
13853
] | 0.375
|
null |
reasoning_gym
| "In front of you are some buttons, a light, and a number. The light will toggle between red and gree(...TRUNCATED)
| "{\"reasoning_gym_dataset\": \"quantum_lock\", \"ground_truth\": \"A \\u2192 A \\u2192 A \\u2192 A \(...TRUNCATED)
| "{\"source_dataset\": \"quantum_lock\", \"source_index\": 1709, \"solution_path\": [\"A\", \"A\", \"(...TRUNCATED)
| [" If no such sequence exists, return an empty string.\n\nAlright, let me try to figure this out. So(...TRUNCATED)
|
[
13263,
18000,
13321,
15115,
1230,
12222,
18000,
18000
] | 0.375
|
null |
reasoning_gym
| "In front of you are some buttons, a light, and a number. The light will toggle between red and gree(...TRUNCATED)
| "{\"reasoning_gym_dataset\": \"quantum_lock\", \"ground_truth\": \"C \\u2192 B \\u2192 C \\u2192 A \(...TRUNCATED)
| "{\"source_dataset\": \"quantum_lock\", \"source_index\": 680, \"solution_path\": [\"C\", \"B\", \"C(...TRUNCATED)
| [" The number of buttons pressed must be minimized. If multiple sequences are possible, choose the l(...TRUNCATED)
|
[
13285,
12089,
11263,
10450,
9602,
9629,
17319,
8885
] | 0.25
|
null |
reasoning_gym
| "In front of you are some buttons, a light, and a number. The light will toggle between red and gree(...TRUNCATED)
| "{\"reasoning_gym_dataset\": \"quantum_lock\", \"ground_truth\": \"A \\u2192 A \\u2192 A \\u2192 A \(...TRUNCATED)
| "{\"source_dataset\": \"quantum_lock\", \"source_index\": 469, \"solution_path\": [\"A\", \"A\", \"A(...TRUNCATED)
| [" If no solution exists, return a json with \"sequence\" as null.\n\nOkay, let's try to figure out (...TRUNCATED)
|
[
18000,
9609,
12952,
12745,
13577,
16964,
18000,
13110
] | 0.375
|
End of preview. Expand
in Data Studio
README.md exists but content is empty.
- Downloads last month
- -