fix prompt template

reasoning_gym/algorithmic/ab.py

@@ -102,19 +102,7 @@ def __getitem__(self, idx: int) -> dict:
     B# #B ... becomes ... nothing
 
 In other words, whenever two neighbor tokens have their '#' facing each-other,
-they must be rewritten according to the corresponding rule. For example, the
-first example shown here is computed as:
-
-    B# A# #B #A B# =
-    B# #B A# #A B# =
-    A# #A B# =
-    B#
-
-The steps were:
-1. We replaced `A# #B` by `#B A#`.
-2. We replaced `B# #B` by nothing.
-3. We replaced `A# #A` by nothing.
-The final result was just `B#`.
+they must be rewritten according to the corresponding rule.
 
 Now, consider the following program:
 

reasoning_gym/algorithmic/base_conversion.py

@@ -10,19 +10,6 @@
 
 If the target base is > 10, use lowercase letters a-z for digits above 9.
 
-Example:
-- Input: Convert the base-9 number 440 to base-5
-- Output: 2420
-- Explanation
-    - First, we convert the base-9 number 440 to base-10: 4 * 9**2 + 4 * 9**1 + 0 * 9**0 = 324 + 36 + 0 = 360
-    - Next, we convert the base-10 number 360 to base-5:
-        - 360 // 5 = 72 remainder 0
-        - 72 // 5 = 14 remainder 2
-        - 14 // 5 = 2 remainder 4
-        - 2 // 5 = 0 remainder 2
-    - Reading the remainders in reverse order gives us the base-5 number 2 4 2 0
-    - Hence, the final answer is 2420
-
 Now, convert the {source_name} number {source_repr} to {target_name}
 """
 

reasoning_gym/algorithmic/binary_alternation.py

@@ -15,10 +15,6 @@
 
 Any two characters may be swapped, even if they are not adjacent.
 
-Example:
-- Input: Determine the minimum number of swaps to make the following binary string alternating: 111000
-- Output: 1
-
 Now, determine the minimum number of swaps to make the following binary string alternating: {string}
 """
 

reasoning_gym/algorithmic/binary_matrix.py

@@ -13,15 +13,7 @@
 
 QUESTION_TEMPLATE = """Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
 
-Example:
-- Input: Find the distance to the nearest 0 for each cell in the matrix below:
-0 0 0
-0 1 0
-1 1 1
-- Output:
-0 0 0
-0 1 0
-1 2 1
+The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
 
 Find the distance to the nearest 0 for each cell in the matrix below:
 {matrix}

reasoning_gym/algorithmic/cryptarithm.py

@@ -17,16 +17,6 @@
 
 from ..factory import ProceduralDataset, register_dataset
 
-EXAMPLE_CASE = """- Input:
-  BASE
-+ BALL
-------
- GAMES
-
-- Output: B=7, A=4, S=8, E=3, L=5, M=9, G=1
-
-"""
-
 
 @dataclass
 class CryptarithmConfig:
@@ -35,7 +25,6 @@ class CryptarithmConfig:
     min_words: int = 2  # Minimum number of addends
     max_words: int = 3  # Maximum number of addends
     allow_leading_zero: bool = False
-    include_example: bool = True
     seed: Optional[int] = None
     size: int = 500  # Number of puzzle instances to generate
 
@@ -179,8 +168,6 @@ def int_to_letter_str(num: int) -> str:
             )
             + '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)\n'
         )
-        if self.config.include_example:
-            question_str += "\nHere's an example:\n" + EXAMPLE_CASE
 
         # 8) Create a human-readable answer, e.g. "A=1,B=0,C=9,..."
         sorted_letter_keys = sorted(letter_to_digit.keys())

reasoning_gym/algorithmic/group_anagrams.py

@@ -21,12 +21,7 @@
 
 Your job is to group the anagrams together. You can return the answer in any order.
 
-Example:
-Input: ["eat", "tea", "tan", "ate", "nat", "bat"]
-Output: [["bat"], ["nat", "tan"], ["ate", "eat", "tea"]]
-Explanation:
-    - There is no string in the input that can be rearranged to form "bat".
-    - The strings "nat" and "tan" are anagrams as they can be rearranged to form each other.
+The output is a list of lists of strings, where each outer list contains a group of anagrams, e.g. [["eat", "tea"], ["tan", "nat"]].
 
 Group the following list of words into anagrams:
 {words}

reasoning_gym/algorithmic/isomorphic_strings.py

@@ -18,19 +18,6 @@
 
 No two characters may map to the same character, but a character may map to itself.
 
-Example 1:
-Input: egg add
-Output: True
-Explanation: The strings s and t can be made identical by:
-    - Mapping 'e' to 'a'.
-    - Mapping 'g' to 'd'.
-
-Example 2:
-Input: foo bar
-Output: False
-Explanation:
-    - The strings cannot be made identical as 'o' needs to be mapped to both 'a' and 'r'.
-
 Return True if the following two strings are isomorphic, or False otherwise:
 {s} {t}
 """

reasoning_gym/algorithmic/letter_jumble.py

@@ -15,9 +15,7 @@
 
 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.).
 
-Example:
-- Input: Unscramble these words: raendgmeins yWh nya hilcd anc od hatt
-- Output: meanderings Why any child can do that
+Your output should be a sentence with the words unscrambled.
 
 Now, unscramble these words: {words}
 """

reasoning_gym/algorithmic/palindrome_generation.py

@@ -11,9 +11,7 @@
 
 If there are multiple possible answers, only respond with one of them. You must use all the letters provided.
 
-Example:
-- Input: Form a valid palindrome using the following letters: a, a, b
-- Output: aba
+Your output should be a single string, with no spaces or punctuation.
 
 Now, form a valid palindrome using the following letters: {letters}
 """

reasoning_gym/algorithmic/palindrome_partitioning.py

@@ -18,9 +18,7 @@
 
 You may return all possible palindrome partitioning in any order.
 
-Example:
-- Input: Partition the following string into palindromes: aab
-- Output: [["a","a","b"],["aa","b"]]
+Your output should be a list of lists, where each list represents a palindrome partition, e.g. [["a","a","b"],["aa","b"]].
 
 Partition the following string into palindromes: {string}
 """

reasoning_gym/algorithmic/pool_matrix.py

@@ -11,25 +11,7 @@
 QUESTION_TEMPLATE = """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.
 
-Example 1:
-- Input: Perform max pooling on the following matrix with a kernel size of 2:
-1 2 3 4
-5 6 7 8
-9 10 11 12
-13 14 15 16
-- Output:
-6 8
-14 16
-
-Example 2:
-- Input: Perform average pooling on the following matrix with a kernel size of 2:
-1 2 3 4
-5 6 7 8
-9 10 11 12
-13 14 15 16
-- Output:
-3.5 5.5
-11.5 13.5
+Your output should be a matrix in the same format as the input matrix.
 
 Perform {pool_type} pooling on the following matrix with a kernel size of {pool_size}:
 {matrix}

reasoning_gym/algorithmic/rotate_matrix.py

@@ -13,17 +13,7 @@
 
 QUESTION_TEMPLATE = """Given a square matrix, your job is to rotate it clockwise.
 
-Example:
-
-Input: Rotate the matrix below by 90 degrees clockwise:
-1 2 3
-4 5 6
-7 8 9
-
-Output:
-7 4 1
-8 5 2
-9 6 3
+Your output should be a matrix in the same format as the input.
 
 Rotate the matrix below by {degrees} degrees clockwise:
 {matrix}

reasoning_gym/algorithmic/rotten_oranges.py

@@ -21,13 +21,6 @@
 Your task is determine the minimum number of minutes that must elapse until no cell has a fresh orange.
 If this is impossible, return -1.
 
-Example:
-- Input: Determine the minimum number of minutes that must elapse until no cell in the grid below has a fresh orange:
-    2 1 1
-    1 1 0
-    0 1 1
-- Output: 4
-
 Now, determine the minimum number of minutes that must elapse until no cell in the grid below has a fresh orange:
 {matrix}
 """

reasoning_gym/algorithmic/spiral_matrix.py

@@ -12,12 +12,7 @@
 
 QUESTION_TEMPLATE = """Given a matrix, your job is to generate a list of elements in spiral order, starting from the top-left element.
 
-Example:
-- Input: For the matrix below, what is the list of elements in spiral order?
-1 2 3
-4 5 6
-7 8 9
-- Output: 1 2 3 6 9 8 7 4 5
+Your output should be a space-separated list of integers, e.g. 1 2 3 4 5 6
 
 For the matrix below, what is the list of elements in spiral order?
 {matrix}

reasoning_gym/algorithmic/string_insertion.py

@@ -18,9 +18,7 @@
 
 Once you have inserted a character, you have to skip over the substring and the inserted character and continue the search from the next character.
 
-Example
-- Input: DDABCDEEDEAB
-- Output: DDABCDAEEDEABD
+Your output should be a string that has been modified according to the pattern.
 
 Given the following string, provide the answer after inserting the characters according to the pattern: {string}
 """

reasoning_gym/algorithmic/string_manipulation.py

@@ -17,15 +17,7 @@
 Once you have applied a rule, repeat the process with the new string until no further transformations can be performed (i.e. the string doesn't change), or a state is repeated.
 If a state is repeated, the process is terminated, and the repeated state is discarded (i.e. is not considered as the final answer) and the state before the repeated state is considered as the final answer.
 
-Example:
-- Input:
-    - String: abbac
-    - Rules:
-        1. If the string prefix is 'ab', replace it with 'ca'.
-        2. If the string prefix is 'ca', replace it with 'bb' and append 'c' to the end.
-        3. If the string ends with 'aa', replace it with 'cc'.
-- Output: bbbacc
-
+Your output should be the final transformed string after applying all the rules.
 
 Transform the following string according to the above list of rules:
 {string}

reasoning_gym/algorithmic/string_splitting.py

@@ -23,10 +23,6 @@
 The output should be the count of each machine and part type after the rules have been exhaustively applied in the following order: A B C X Y Z.
 For example 1 0 1 5 4 3 means that you have 1 machine A, 0 machine B, 1 machine C, 5 part X, 4 part Y, and 3 part Z.
 
-Example:
-- Input: You have 2 machines A, 0 machines B, and 1 machine C.
-- Output: 0 0 1 2 0 2
-
 Now, you have {A_machine} machine A, {B_machine} machine B, and {C_machine} machine C. Provide the count of each machine and part type after applying the above rules.
 """
 

reasoning_gym/algorithmic/string_synthesis.py

@@ -23,10 +23,6 @@
 The output should be the count of each block type after the rules have been applied in the order they are listed above.
 For example 1 0 3 0 2 0 0 0 1 means that you have 1 [A] 0 [B] 3 [C] 0 {{A}} 2 {{B}} 0 {{C}} 0 (A) 0 (B) 1 (C).
 
-Example:
-- Input: You have 2 [A], 3 [B], and 3 [C].
-- Output: 0 0 0 2 1 0 0 0 0
-
 Now, you have {A_square} [A], {B_square} [B], and {C_square} [C] blocks. Provide the count of each block type after applying the above rules.
 """
 

reasoning_gym/algorithmic/word_sorting.py

@@ -21,9 +21,7 @@ class TextTransformation(StrEnum):
 
 QUESTION_TEMPLATE = """Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
 
-Example:
-- Input: Sort these words in ascending order (using ASCII/Unicode ordering) and return them as a comma-separated list: freely, idea, indemnify, last, END, solving
-- Output: END, freely, idea, indemnify, last, solving
+Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
 
 Now, sort these words in {direction} order (using ASCII/Unicode ordering) and return them as a comma-separated list: {words}
 """

reasoning_gym/arithmetic/leg_counting.py

@@ -56,10 +56,6 @@
 
 QUESTION_TEMPLATE = """Your task is to count how many legs there are in total when given a list of animals.
 
-Example:
-- Input: How many legs are there in total if you have 1 duck, 2 deers, 1 spider, 3 cows?
-- Output: 30
-
 Now, how many legs are there in total if you have {animals}?
 """
 

reasoning_gym/arithmetic/number_format.py

@@ -8,9 +8,7 @@
 
 QUESTION_TEMPLATE = """Your task is to pick the largest/smallest number out of several options.
 
-Example
-- Input: Pick the largest number of the following candidates: 857575.23 8.975554e+05 887,555.62
-- Output: 8.975554e+05
+Your output should be only the number of interest.
 
 Now, pick the {size} number of the following candidates: {numbers}
 """

reasoning_gym/arithmetic/power_function.py

@@ -9,14 +9,6 @@
 
 QUESTION_TEMPLATE = """Your task is to compute an exponentiation of a number.
 
-Example:
-- Input: Compute 2^3
-- Output: 8
-
-Example:
-- Input: Compute 412.5^3
-- Output: 70189453.125
-
 Compute {base}^{exponent}
 """
 

reasoning_gym/cognition/rectangle_count.py

@@ -8,29 +8,7 @@
 
 Single rectangles are outlined with a '#', overlapping rectangles (max 2) are shown with '█'.
 
-Example:
-- Input: How many rectangles are in the grid below?
-
-              ####
-              #  #
-              ####
-
-
-
-
-
-
-
-
-
-
- #########
- #       █##
- #       █ #
- ########█ #
-         # #
-         ###
-- Output: 3
+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 below?
 {puzzle}

reasoning_gym/games/countdown.py

@@ -9,6 +9,7 @@
 from ..factory import ProceduralDataset, register_dataset
 
 QUESTION_FORMAT_TEMPLATE = """{question}
+
 Final answer format instructions:
 1. Provide your solution as a arithmetic expression (no '=' sign).
 2. Do not include the target number in the expression.