Nemotron-Post-Training-v3 Prompt-Only
Collection
51 items • Updated
Datasets:
dataset stringclasses 1
value | config stringclasses 1
value | split stringclasses 1
value | row_index int64 0 15k | prompt stringlengths 13 14.1k | prompt_source stringclasses 1
value | prompt_source_detail stringclasses 1
value | system_prompt float64 | system_source float64 | tools float64 | tools_source float64 | schema_str float64 | extraction_error float64 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 0 | Ghyll yearns for entrepreneurship. Oluwadamiloju finds joy in sculpting. Nikodem welcomes theatre. Sheriff is nuts about roller skating. Ata worships omelettes. Cahlum fancies ice cream. Geordan is devoted to organizing the pantry. Richard savors playing the accordion. Rholmark damns playing the clarinet. Jon savors co... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 1 | Jennifer has 6 male friends and she also has 5 female friends. They all are friends with each other and have no other friends aside. How many female friends does Thomas, a male friend of Jennifer, have? | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 2 | Solve this cryptarithm:
DJDWJ
+ UJH
-------
DKJWH
Each letter stands for a unique digit (0-9). No leading letter can be zero.
Provide a comma separated mapping from letters to digits that satisfies the equation in your final answer. Output format: "A=1,B=2,C=3" (without quotes)
| responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 3 | Calculate the antiderivative: ∫ -64*X**7/3 + 15*X**2 dx
When performing calculations, please follow these guidelines:
1. Use ** instead of ^ to represent exponents. For example, write 7*X**2 instead of 7*X^2.
2. Always include the * symbol for all multiplication operations in your reasoning steps. For example, write `-... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 4 | Solve the Tower of Hanoi problem with 3 disks and 4 pegs.
Move all disks from Peg 1 to Peg 3 following the rules:
- Only one disk can be moved at a time.
- A larger disk cannot be placed on top of a smaller disk.
- All disks must be on a peg at all times.
Provide the sequence of moves.
Formatting guidelines:
- Each i... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 5 | For the following matrix:
7 0
8 5
3 7
7 8
5 9
2 8
Perform the following series of operations in order:
- Identity transformation, i.e. no change
- Map each occurrence of 6 to 5
- Set all elements divisible by 3 to zero
- Set all elements divisible by 8 to zero
- Rotate the matrix 90 degrees
- Horizontally mirror the m... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 6 | There are nine different blocks [A] [B] [C] {A} {B} {C} (A) (B) (C)
1. One [A], one [B], and one [C] can be combined to form one {A}.
2. One [A] and one [B] can be combined to form one {C}.
3. One [B] and one [C] can be combined to form one {B}.
4. Two [C] can be combined to form one {C}.
5. One {A} and one {C} can be ... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 7 | Given the truthfulness of these statements, please tell me the number of possible solutions:
- Statement 1: 'At least 5 of these 7 statements are true.'
- Statement 2: 'At most 5 of these 7 statements are false.'
- Statement 3: 'Exactly 5 of these 7 statements are true.'
- Statement 4: 'Exactly 2 of these 7 statem... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 8 | Your task is, given a list of letters, to form a valid palindrome.
A palindrome is a phrase that reads the same forwards and backwards.
If there are multiple possible answers, only respond with one of them. You must use all the letters provided.
Your output should be a single string, with no spaces or punctuation.
... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 9 | Find the value of z in the equation: 465*z + 806 = 37541 | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 10 | You are a researcher studying causal relationships using Blicket experiments. In these experiments, certain objects (called 'blickets') have the hidden property of activating a detector, causing its light to turn on.
Each example shows the results of placing different combinations of objects on the detector. Each obje... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 11 | There is a dismantling engineer who has old machines A, B, and C.
He discovered that he can obtain a batch of new parts X, Y, Z through the following rules:
1. One unit of machine A can be dismanteled into two units of part X and one unit of part Y.
2. Two units of machine B can be dismanteled into one unit of part X.
... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 12 | A convex polygon has 5 sides. The measures of the first 4 interior angles are: 112.0°, 58.0°, 68.0°, 87.0°. Find the measure of the last interior angle.Return only the angle as your answer.Do not give the units in your answer. | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 13 | Your task is to count how many legs there are in total when given a list of animals.
Now, how many legs are there in total if you have 15 sheeps, 6 woodlouses, 14 scorpions, 11 elephants, 7 cockroachs, 15 praying mantiss, 4 tigers, 2 crabs, 15 deers?
| responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 14 | Your task is to find the shortest path from the start to the destination point in a grid.
The grid is represented as a matrix with the following types of cells:
- *: your starting point
- #: your destination point
- O: an open cell
- X: a blocked cell
Therefore, you need to find the shortest path from * to #, moving ... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 15 | Jennifer has 2 male colleagues and she also has 4 female colleagues. These are all colleagues that Jennifer has. All these mentioned persons around Jennifer are colleagues of each other. John has 3 male colleagues and 6 female colleagues in total. All these mentioned persons around John are colleagues of each other. Th... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 16 | Remove all numbers larger than -45.7015 in this list: ['-64.0362', '33.0677', '51', '-84.140', '26.1', '98.11', '88.14']
Return the new list in the same format. | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 17 | Your task is to compute an exponentiation of a number.
Compute -7.6877^-7. Return your final answer correct to 3 significant figures.
Provide your answer in scientific notation using 'e' notation (e.g., 1.23e+4).
| responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 18 | Given a string consisting of characters A, B, C, D, and E, your job is to insert a character according to the following pattern:
1. If there is a substring ABCD in the string, insert the character A after the substring.
2. If there is a substring BCDE in the string, insert the character B after the substring.
3. If the... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 19 | Your task is, given a list of letters, to form a valid palindrome.
A palindrome is a phrase that reads the same forwards and backwards.
If there are multiple possible answers, only respond with one of them. You must use all the letters provided.
Your output should be a single string, with no spaces or punctuation.
... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 20 | There are a total of 8 courses you have to take, labeled from 0 to 7.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(0, 6), (1, 0), (2, 6), (7, 6), (4, 6), (5, 4), (5, 3), (3, 4), (4, 0), (2, 4), (1,... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 21 | Your task is to unsramble words in a sentence.
For each word in a sentence, the letter may have been randomly shuffled. Your task is to unscramble the words.
The order of the words in the sentence is preserved. Moreover, the style of the sentence is preserved (i.e. punctuation, capitalization, new lines, etc.).
Your... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 22 | Given a square matrix, your job is to rotate it clockwise.
Your output should be a matrix in the same format as the input.
Rotate the matrix below by 720 degrees clockwise:
9 1 5 3 9
0 2 8 8 8
4 9 1 8 5
5 1 1 7 6
1 9 8 4 5
| responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 23 | A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.
An A::B program is a sequence of tokens. Example:
B# A# #B #A B#
To *compute* a program, we must rewrite neighbor tokens, using the rules:
A# #A ... becomes ... nothing
A# #B ... becomes ... #B A#
B# #A ... becomes ... #A B#
B# #B ... be... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 24 | Calculate 0 + -3 - -6 / ( 1 * 7 + -6 ). | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 25 | Calculate 6845 * 5489 * 1327 + 388 + -1002. | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 26 |
You are a central planner tasked with directing agents in a grid-like field to move colored boxes to their corresponding color-coded targets.
Each agent occupies a 1x1 square and can only interact with objects within its square. Agents can move a box to an adjacent square or
directly to a target square of the same col... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 27 | Your task is to count how many rectangles are present in an ASCII grid.
Single rectangles are outlined with a '#', overlapping rectangles (max 2) are shown with '█'.
Your output should be a single number, representing the total count of rectangles.
Now, it's your turn. How many rectangles do you see in the grid belo... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 28 | For triangle with vertices A=(-9, 3), B=(-8, 5), and C=(-3, -5), determine the orthocenter (intersection of altitudes). For all geometry problems:
1. Give coordinates in the form (x, y)
2. Round decimal answers to 3 decimal places
3. Use the degree symbol ° for angles
4. Return only the angle, coordinates, or radius as... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 29 | Restore the correct order of words in the following sentence: Just in time. | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 30 | Calculate 7459 - 2279 + 8026 - -2790. | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 31 | Evaluate the indefinite integral: ∫ x**3*exp(x) dx
When performing calculations, please follow these guidelines:
Use same variable symbols as given in the question
1. Use ** instead of ^ to represent exponents. For example, write 7*X**2 instead of 7*X^2.
2. Always include the * symbol for all multiplication operations ... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 32 | You are going to solve a 'sokoban' puzzle.
* - The player
% - The player on a goal
@ - A box
X - A goal
$ - A box on a goal
+ - A wall
- - An empty position
Your solution must be a string of characters, ex: LDURRUDL.
Here is your puzzle:
+ + + + + +
+ $ X @ - +
+ - - % - +
+ X + @ - +
+ - - @ X +
+ - - @ -... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 33 | Your task is to unsramble words in a sentence.
For each word in a sentence, the letter may have been randomly shuffled. Your task is to unscramble the words.
The order of the words in the sentence is preserved. Moreover, the style of the sentence is preserved (i.e. punctuation, capitalization, new lines, etc.).
Your... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 34 | Your task is to convert a number between two different bases.
If the target base is > 10, use lowercase letters a-z for digits above 9.
Now, convert the base-6 number 4125 to base-5
| responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 35 | There are several letter cards, and the game rules are as follows:
1. Initially, there are 13 cards.
2. Each time, a new card is added, and a result is determined. Then, one card is removed.
3. When there are two identical cards in hand, and the newly added card is the same as these two cards, the result is determined ... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 36 | Navigate from 'W' (start) to '-' (goal):
```
(((((((
(<-(<((
(<<(<((
((<<<W(
(((<<((
(<<<<<(
(((((((
```
Legend: '(' = Wall, '<' = Passage
What is the minimum number of steps to reach the goal?
Give only the number of steps as your final answer, no other text or formatting. | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 37 | I have these dice: 1d20, 1d19, 1d19, 1d18. What are the odds of rolling 32 or higher? (Assume that all dice are rolled at once, and that '1d6' represents one roll of a 6-sided dice.) Please respond with a reduced fraction representing the probability [ex., 1/60]. | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 38 | Find the indefinite integral: ∫ -45*x**8/4 - 104*x**7 + 1 dx
When performing calculations, please follow these guidelines:
1. Use ** instead of ^ to represent exponents. For example, write 7*X**2 instead of 7*X^2.
2. Always include the * symbol for all multiplication operations in your reasoning steps. For example, wri... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 39 | Given a string, partition it such that every substring is a palindrome.
A palindrome is a word that reads the same backward as forward.
You may return all possible palindrome partitioning in any order.
Your output should be a list of lists, where each list represents a palindrome partition, e.g. [["a","a","b"],["aa"... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 40 | I have these dice: 1d20, 1d13, 1d13, 1d3. What are the odds of rolling 32 or higher? (Assume that all dice are rolled at once, and that '1d6' represents one roll of a 6-sided dice.) Please respond with a reduced fraction representing the probability [ex., 1/60]. | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 41 | Your task is, given a list of letters, to form a valid palindrome.
A palindrome is a phrase that reads the same forwards and backwards.
If there are multiple possible answers, only respond with one of them. You must use all the letters provided.
Your output should be a single string, with no spaces or punctuation.
... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 42 |
You are given a question that requires some input and output variables as follows:
Given a list of winners and a list of losers, what is the shortest regex pattern that can correctly identify all winners while excluding all losers?
The input and output requirements are as follows:
Input:
`winners_text` (str): A s... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 43 | Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0xd32d >> 0x0) << 0x1) | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 44 | Knight Swap Challenge:
```
B C D
------------
3 | B | B | . |
------------
2 | w | | . |
------------
1 | w | . | . |
------------
```
Legend:
- 'w' = White Knight
- 'B' = Black Knight
- Empty squares are marked with '.'
Objective:
Swap the positions of all white knights with all black knights ... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 45 | I have these dice: 1d20, 1d16, 1d8, 1d4. What are the odds of rolling 21 or higher? (Assume that all dice are rolled at once, and that '1d6' represents one roll of a 6-sided dice.) Please respond with a reduced fraction representing the probability [ex., 1/60]. | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 46 | Given a matrix, your job is to generate a list of elements in spiral order, starting from the top-left element.
The spiral order is clockwise, starting from the top-left corner. More precisely:
- Start from the top-left corner and move right.
- Move down towards the bottom-right corner.
- Move left towards the bottom-... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 47 | State the final answer to the following arithmetic problem: 5 - 6 + 0 - 7 = | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 48 | Your task is to pick the largest/smallest number out of several options.
Your output should be only the number of interest.
Now, pick the smallest number of the following candidates: 8.329670137530000e+08 832967015.349000 832,967,009.73 832967013.052000 8.329670121720001e+08
| responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 49 | State the final answer to the following arithmetic problem: 8453 - 3863 - 7439 = | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 50 | A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.
An A::B program is a sequence of tokens. Example:
B# A# #B #A B#
To *compute* a program, we must rewrite neighbor tokens, using the rules:
A# #A ... becomes ... nothing
A# #B ... becomes ... #B A#
B# #A ... becomes ... #A B#
B# #B ... be... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 51 | Given a triangle with vertices A=(-3, -2), B=(-10, -3), and C=(-8, -2), determine the angle at B in degrees. For all geometry problems:
1. Give coordinates in the form (x, y)
2. Round decimal answers to 3 decimal places
3. Use the degree symbol ° for angles
4. Return only the angle, coordinates, or radius as your answe... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 52 | Two strings are isomorphic if the characters in one string can be replaced to get the second string.
All occurrences of a character must be replaced with another character while preserving the order of characters.
No two characters may map to the same character, but a character may map to itself.
Return True if the ... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 53 | The following emoji is encoded with a sentence.
Decode the following sentence from the emoji: 😓󠅇󠅙󠅤󠅘󠄐󠅤󠅘󠅕󠅙󠅢󠄐󠅘󠅕󠅑󠅔󠅣󠄐󠅒󠅕󠅞󠅤󠄐󠅔󠅟󠅧󠅞󠄐󠅟󠅦󠅕󠅢󠄐󠅤󠅘󠅕󠅙󠅢󠄐󠅕󠅜󠅕󠅓󠅤󠅢󠅙󠅓󠄐󠅓󠅟󠅝󠅠󠅥󠅤󠅕󠅢󠅣󠄜󠄐󠅤󠅘󠅙󠅢󠅤󠅩󠄐󠅣󠅓󠅙󠅕󠅞󠅤󠅙󠅖󠅙󠅓󠄐󠅝󠅕󠅞󠄐󠅧󠅕󠅢󠅕󠄐󠅑󠅒󠅣󠅟󠅢󠅒󠅕󠅔󠄐󠅙󠅞󠄐󠅤󠅢󠅑󠅞󠅣󠅓󠅕󠅞󠅔󠅕󠅞󠅤󠅑󠅜�... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 54 | Your task is to convert a number between two different bases.
If the target base is > 10, use lowercase letters a-z for digits above 9.
Now, convert the base-7 number 1666 to base-12
| responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 55 | Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0x4c3e * 0xc59f) - (0xe3c3 * 0x7bc)) | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 56 | Your job is to perform max/average pooling on the given matrix.
The stride is equal to the kernel size, meaning there is no overlap between the pooling regions.
Your output should be a matrix in the same format as the input matrix.
The output matrix is smaller than the input matrix when the kernel size is greater than... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 57 | Solve this cryptarithm:
NOT
JMJT
+ OIBU
-------
FIJUJ
Each letter stands for a unique digit (0-9). No leading letter can be zero.
Provide a comma separated mapping from letters to digits that satisfies the equation in your final answer. Output format: "A=1,B=2,C=3" (without quotes)
| responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 58 | I have these dice: 1d20, 1d19, 1d11, 1d2. What are the odds of rolling 23 or higher? (Assume that all dice are rolled at once, and that '1d6' represents one roll of a 6-sided dice.) Please respond with a reduced fraction representing the probability [ex., 1/60]. | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 59 | Remove all numbers smaller than 37.08 in this list: ['38.0', '0.043', '-0.1025']
Return the new list in the same format. | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 60 | I have these dice: 1d20, 1d11, 1d7, 1d5. What are the odds of rolling 28 or higher? (Assume that all dice are rolled at once, and that '1d6' represents one roll of a 6-sided dice.) Please respond with a reduced fraction representing the probability [ex., 1/60]. | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 61 | You are a researcher studying causal relationships using Blicket experiments. In these experiments, certain objects (called 'blickets') have the hidden property of activating a detector, causing its light to turn on.
Each example shows the results of placing different combinations of objects on the detector. Each obje... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 62 | In front of you are some buttons, a light, and a number. The light will toggle between red and green whenever you press a button. Each button performs a mathematical operation to the number, but the operation may depend on the state of the light.
You must press the shortest correct sequence of buttons to reach the targ... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 63 | Solve this 4*4 matrix puzzle:
3 1 4 8
0 1 0 11
0 2 4 14
13 4 16 33
where 0 represents empty cells that need to be filled. The last number in each row and column equals the sum of all other numbers in that row or column. You have the numbers [8, 2, 8] to place in the empty cells. Each number can only be used once. | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 64 | Find the common rule that maps an input grid to an output grid, given the examples below.
Example 1:
Input:
3 3 3 3 3 3 3 3 3 3
5 3 3 3 3 3 3 3 3 3
5 3 3 3 3 3 3 1 3 3
5 3 3 3 3 3 3 3 3 3
5 3 3 3 3 1 3 3 3 3
5 3 3 3 3 3 3 3 3 3
3 3 3 3 3 3 3 3 3 3
3 3 3 3 3 3 3 3 3 3
3 3 3 3 3 3 3 3 3 3
3 3 3 3 3 3 3 3 3 3
3 3 3 3 3 ... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 65 | Determine the value of p that satisfies: 104 - 99*p = -7816 | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 66 | A conference call began at 2001-11-23 23:23:48 +0900 and ended at 2001-12-22 16:04:33 +1100. How long was the conference? Answer in D days, HH:MM:SS. | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 67 | Evaluate the indefinite integral: ∫ 2*(9*x - 1)**3 dx
When performing calculations, please follow these guidelines:
Use same variable symbols as given in the question
1. Use ** instead of ^ to represent exponents. For example, write 7*X**2 instead of 7*X^2.
2. Always include the * symbol for all multiplication operatio... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 68 | Liam is married to Anna. They have a child called Michael. Michael is married to Aurora. They have children called Sage and Lily.
What is Aurora to Anna? Respond only with the word that describes their relationship. | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 69 | Your job is to complete an n x n chess board with n Queens in total, such that no two attack each other.
No two queens attack each other if they are not in the same row, column, or diagonal.
You can place a queen by replacing an underscore (_) with a Q.
Your output should be also a board in the same format as the in... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 70 | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 71 | This is a logic puzzle. There are 4 houses (numbered 1 on the left, 4 on the right), from the perspective of someone standing across the street from them. Each has a different person in them. They have different characteristics:
- Each person has a unique name: carol, bob, arnold, alice
- Everyone has a different fav... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 72 | Determine the value of y that satisfies: 69*y - 35 = 5968 | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 73 | Here's a Go challenge. Playing as Black, how can you capture as many white stones as possible?
```
A B C D E F G H I J K L M
13 . . . . . . . . . . . . .
12 . . . . . . . . . . . . .
11 . . . O . . . . . O . X .
10 . . . . . . . . . . . . .
9 . X . . . . . . . . . . .
8 . X . . . . . . . . . . .
7 . . . . . X . ... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 74 | In 4x4 Mini Sudoku:
- Each row must contain each number from 1-4 exactly once
- Each column must contain each number 1-4 exactly once
- Each 2x2 subgrid must contain each number 1-4 exactly once
Solve this 4x4 Mini Sudoku puzzle:
1 _ _ _
2 _ _ 1
_ _ _ 3
3 1 4 2
Format your response as the puzzle above, with spaces sepa... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 75 | A carton of tea is 13 mLs of tea. Robert drinks 4 cartons of tea. If tea has 7 calories per mL how many calories did he consume? Give the result as your final answer. Do not include units. | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 76 | Find the common rule that maps an input grid to an output grid, given the examples below.
Example 1:
Input:
9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9
9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9
9 9 9 0 0 0 0 0 0 0 0 0 0 0 0 9
9 9 9 0 0 0 0 0 0 0 0 0 0 0 0 9
9 9 9 0 0 7 7 7 7 7 7 7 7 0 0 9
9 9 9 0 0 7 7 7 7 7 7 7 7 0 0 9
9 9 9 0 7 7 7 7 7 ... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 77 | There are a total of 6 courses you have to take, labeled from 0 to 5.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(0, 2), (4, 0), (3, 4), (5, 4), (3, 0), (1, 3), (4, 2), (1, 2)]
Return True if you... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 78 | What will this Game of Life board look like after 1 steps of simulation? Assume a Moore neighborhood and wrapping topology. Reply as array of arrays representing rows in the grid from top to bottom in JSON format. (An empty 3x3 grid would look like this: [[0,0,0],[0,0,0],[0,0,0]])
[[0,0,0,0,0,0,0,1,0,0],
[0,0,0,0,0,1... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 79 | Your task is to count how many legs there are in total when given a list of animals.
Now, how many legs are there in total if you have 15 beetles, 2 scorpions, 6 chickens, 10 wasps, 10 sheeps, 2 sea slugs, 12 horses, 3 bees?
| responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 80 | What will this Game of Life board look like after 1 steps of simulation? Assume a Moore neighborhood and wrapping topology. Reply as array of arrays representing rows in the grid from top to bottom in JSON format. (An empty 3x3 grid would look like this: [[0,0,0],[0,0,0],[0,0,0]])
[[1,0,0,0,1,0,0,0,0,0],
[1,0,0,0,0,0... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 81 | Below is a randomly generated logic circuit.
A: ─────────────────────┐
B: ───────────────────┐ │
C: ─────────────────┐ │ │
D: ───────────────┐ │ │ │
E: ─────────────┐ │ │ │ │
F: ───────────┐ │ │ │ │ │
G: ─────────┐ │ │ │ │ │ │
H: ───────┐ │ │ │ │ │ │ │
I: ─────┐ │ │ │ │ │ │ │ │
J: ───┐ │ │ │ │ │ │ │ │ │
K: ─┐ │ │ │ │ ... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 82 | In front of you are some buttons, a light, and a number. The light will toggle between red and green whenever you press a button. Each button performs a mathematical operation to the number, but the operation may depend on the state of the light.
You must press the shortest correct sequence of buttons to reach the targ... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 83 | Tsumego time. Black to play and capture some stones.
Find the key move.
```
A B C D E F G H I J K
11 X . . . . . . . X O O
10 . . . . X . . X O O .
9 . . X . . . . . X O X
8 . . . . . . . . . X .
7 . . . . . . . X . . .
6 . . . . . X O . . X .
5 . . . . . . . . . . .
4 . . . . . . . . . . .
3 X O . . . . . .... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 84 | Solve the following problem.
Provide you answer as a comma-separated list of words with a space after the comma.
Reverse this list of words: www, or, What, all, so
| responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 85 | Susan has 2 male friends and she also has 1 female friends. They all are friends with each other and have no other friends aside. How many female friends does James, a male friend of Susan, have? | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 86 | Robert is married to Sky. They have a child called Axel. Axel is married to Linda. They have a child called Jacob. Jayden is married to Aurora. They have a child called Linda.
What relation is Aurora to Linda? Answer with a single word. | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 87 | Keep all numbers larger than -52.8636 in this list: ['-66.29', '78.7', '-55.501', '90.9']
Return the new list in the same format. | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 88 | This is a 'Game of Life' grid. We consider a game halted if there are no cells alive.
Will this game halt at or before 20 steps? Assume a Moore neighborhood and wrapping topology. If it will halt, reply 'True'. If it won't halt, reply 'False'.
Initial board:
[[0 0 0 0 0 0 0 0 0 0 0 0]
[0 0 0 0 0 0 0 0 0 0 0 0]
[0 0 ... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 89 | Given a string consisting of characters A, B, C, D, and E, your job is to insert a character according to the following pattern:
1. If there is a substring ABCD in the string, insert the character A after the substring.
2. If there is a substring BCDE in the string, insert the character B after the substring.
3. If the... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 90 | Solve this cryptarithm:
BGZ
GAK
+ ZKELL
-------
ZZUAC
Each letter stands for a unique digit (0-9). No leading letter can be zero.
Provide a comma separated mapping from letters to digits that satisfies the equation in your final answer. Output format: "A=1,B=2,C=3" (without quotes)
| responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 91 | Your task is, given a list of letters, to form a valid palindrome.
A palindrome is a phrase that reads the same forwards and backwards.
If there are multiple possible answers, only respond with one of them. You must use all the letters provided.
Your output should be a single string, with no spaces or punctuation.
... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 92 | You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 93 | You see a size 3 Rubik's cube arranged as follows::
R R Y
G Y B
W W B
G Y O G G Y O Y G O W W
W R O G G Y O O Y R B B
R R B W W R Y O B R R Y
O O G
... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 94 | Solve the following problem.
Provide you answer as a comma-separated list of words with a space after the comma.
Reverse this list of words: To, depend, will, 1, in, nations, after, True
| responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 95 | Calculate 1 * 6 * 7 - -6 * -8. | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 96 | Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0xa092 - 0x32b2) << 0x2) | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 97 | A very special island is inhabited only by knights and knaves. Knights always tell the truth, and knaves always lie. You meet 2 inhabitants: Lucas, and William. "Lucas is a knight or William is a knight," Lucas declared. William expressed that Lucas is a knave. So who is a knight and who is a knave? (Format your answer... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 98 | Solve the following 5x5 Futoshiki puzzle:
3 _ _ _ _
∧
_ _ _ _ 4
∧ ∨ ∨
_ _ _ > 1 _
∨
_ _ _ < 5 > _
∧
_ > 3 _ _ < _
Ensure your answer follows the same format as the puzzle above, just replace blanks (_) with the correct value for... | responses_input | first_user_message | null | null | null | null | null | null |
nvidia/Nemotron-RL-ReasoningGym-v1 | default | train | 99 | What will this Game of Life board look like after 1 steps of simulation? Assume a Moore neighborhood and wrapping topology. Reply as array of arrays representing rows in the grid from top to bottom in JSON format. (An empty 3x3 grid would look like this: [[0,0,0],[0,0,0],[0,0,0]])
[[0,0,0,1,0,0,0,0,0,0],
[0,0,0,0,1,0... | responses_input | first_user_message | null | null | null | null | null | null |
End of preview. Expand in Data Studio
Nemotron-RL-ReasoningGym-v1-prompt-only
Prompt-only extraction from nvidia/Nemotron-RL-ReasoningGym-v1.
Files:
prompts.csv: one prompt extraction record per source row. Records includeprompt, separatedsystem_prompt, and structuredtoolswhen the source row defines available tools. Nested values are JSON-encoded inside CSV cells.summary.md: source row counts, extracted row counts, count deltas, and failed prompt counts.null_or_empty_rows.md: row indexes where prompt extraction produced a null or empty prompt.
Summary:
- extracted rows: 15000
- failed prompt rows: 0
- row count delta: 0
Uploaded under jamesdborin from the Nemotron Post-Training v3 prompt extractor workflow.
- Downloads last month
- 99