id stringlengths 21 41 | task_type stringclasses 2
values | incontext_examples listlengths 3 3 | tool_test_set listlengths 0 8 | target_question stringlengths 0 1.04k | target_answer stringlengths 0 75 | tool_constraints dict | metadata dict |
|---|---|---|---|---|---|---|---|
polynomial_equations-train-build-48 | build | [
{
"answer": "1.4",
"question": "Determine the real value(s) of b that satisfies: 5*b - 7 = 0\nIn solving equations, please follow these instructions:\n1. Provide all answers as comma-separated decimal values. For example: \"-0.3773, 0.4005\"\n2. For solutions that can be expressed in exact form (like \"u = ... | [
{
"answer": "0.8169",
"question": "Find the real value(s) of k in the equation: -11*k**3 - 6*k**2 + 10 = 0\nIn solving equations, please follow these instructions:\n1. Provide all answers as comma-separated decimal values. For example: \"-0.3773, 0.4005\"\n2. For solutions that can be expressed in exact for... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/polynomial_equations",
"task_name": "polynomial_equations"
} | ||
polynomial_equations-train-build-365 | build | [
{
"answer": "0.0, 0.45",
"question": "Determine the real value(s) of q that satisfies: 20*q**2 - 9*q = 0\nIn solving equations, please follow these instructions:\n1. Provide all answers as comma-separated decimal values. For example: \"-0.3773, 0.4005\"\n2. For solutions that can be expressed in exact form ... | [
{
"answer": "-18.6398, -2.0423, -1.3908",
"question": "Solve the polynomial equation for real q:\nq**5 + 21*q**4 + 44*q**3 + 45 = 0\nIn solving equations, please follow these instructions:\n1. Provide all answers as comma-separated decimal values. For example: \"-0.3773, 0.4005\"\n2. For solutions that can ... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/polynomial_equations",
"task_name": "polynomial_equations"
} | ||
bitwise_arithmetic-train-build-159 | build | [
{
"answer": "0x18321a54a",
"question": "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.\n(((0x3a00 >> 0x0) - (0x25f... | [
{
"answer": "0x2b6a540c04c",
"question": "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.\n((0xb24a - 0x7a21) * (0x... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/bitwise_arithmetic",
"task_name": "bitwise_arithmetic"
} | ||
count_bits-train-build-823 | build | [
{
"answer": "13",
"question": "How many 1 bits are there in the binary representation of the number 5823209?"
},
{
"answer": "9",
"question": "How many 1 bits are there in the binary representation of the number 339872?"
},
{
"answer": "8",
"question": "How many 1 bits are there in t... | [
{
"answer": "14",
"question": "How many 1 bits are there in the binary representation of the number 76778227?"
},
{
"answer": "12",
"question": "How many 1 bits are there in the binary representation of the number 9923116?"
},
{
"answer": "11",
"question": "How many 1 bits are there ... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/count_bits",
"task_name": "count_bits"
} | ||
spell_backward-train-build-623 | build | [
{
"answer": "amater",
"question": "Spell this word backward (example: sun -> nus): retama"
},
{
"answer": "modtleC",
"question": "Spell this word backward (example: sun -> nus): Celtdom"
},
{
"answer": "ocicauG",
"question": "Spell this word backward (example: sun -> nus): Guacico"
... | [
{
"answer": "anniP",
"question": "Spell this word backward (example: sun -> nus): Pinna"
},
{
"answer": "gnippols",
"question": "Spell this word backward (example: sun -> nus): slopping"
},
{
"answer": "ecafthgil",
"question": "Spell this word backward (example: sun -> nus): lightfac... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/spell_backward",
"task_name": "spell_backward"
} | ||
polynomial_multiplication-train-use-215 | use | [
{
"answer": "6*y**4 - 16*y**3 + 8*y**2",
"question": "Simplify this expression: (-3*y**2 + 2*y)*(-2*y**2 + 4*y)\nWhen performing calculations, please follow these guidelines:\n1. Use ** instead of ^ to represent exponents. For example, write 7*X**2 instead of 7*X^2.\n2. Always include the * symbol for all m... | [] | Calculate the following: (-2*x**3 + 3*x**2)*(6*x**3 + 7*x**2)
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, wr... | -12*x**6 + 4*x**5 + 21*x**4 | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/polynomial_multiplication",
"task_name": "polynomial_multiplication"
} |
polynomial_equations-train-build-362 | build | [
{
"answer": "-0.7017, 0.0, 1.5142",
"question": "Determine the real value(s) of h that satisfies: -16*h**3 + 13*h**2 + 17*h = 0\nIn solving equations, please follow these instructions:\n1. Provide all answers as comma-separated decimal values. For example: \"-0.3773, 0.4005\"\n2. For solutions that can be e... | [
{
"answer": "0.7778",
"question": "Solve the polynomial equation for real h:\n7 - 9*h = 0\nIn solving equations, please follow these instructions:\n1. Provide all answers as comma-separated decimal values. For example: \"-0.3773, 0.4005\"\n2. For solutions that can be expressed in exact form (like \"u = 2 +... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/polynomial_equations",
"task_name": "polynomial_equations"
} | ||
knights_knaves-train-build-128 | build | [
{
"answer": "Mason is a fool, and Noah is a fool.",
"question": "A very special island is inhabited only by sages and fools. Sages always tell the truth, and fools always lie. You meet 2 inhabitants: Mason, and Noah. Mason noted, \"Noah is a sage\". \"Mason is a fool if and only if Noah is a sage,\" Noah cl... | [
{
"answer": "Sofia is an altruist, Lily is an altruist, and Oliver is an altruist.",
"question": "A very special island is inhabited only by altruists and egoists. Altruists always tell the truth, and egoists always lie. You meet 3 inhabitants: Sofia, Lily, and Oliver. According to Sofia, \"Oliver is an alt... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/knights_knaves",
"task_name": "knights_knaves"
} | ||
count_bits-train-build-197 | build | [
{
"answer": "10",
"question": "How many 1 bits are there in the binary representation of the number 153045?"
},
{
"answer": "12",
"question": "How many 1 bits are there in the binary representation of the number 5694524?"
},
{
"answer": "10",
"question": "How many 1 bits are there in... | [
{
"answer": "13",
"question": "How many 1 bits are there in the binary representation of the number 2986985?"
},
{
"answer": "10",
"question": "How many 1 bits are there in the binary representation of the number 609383?"
},
{
"answer": "14",
"question": "How many 1 bits are there in... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/count_bits",
"task_name": "count_bits"
} | ||
countdown-train-build-446 | build | [
{
"answer": "69*77/77 - 79 + 83",
"question": "Using all the numbers 83, 77, 79, 69, 77, create an expression that equals 73.\nYou can only use each number once.\n\nFinal answer format instructions:\n1. Provide your solution as a arithmetic expression (no '=' sign).\n2. Do not include the target number in t... | [
{
"answer": "24 + 92 - 50 - 17",
"question": "Calculate 49 using all of these numbers: 17, 50, 24, 92.\nEach number may be used at most once.\n\nFinal answer format instructions:\n1. Provide your solution as a arithmetic expression (no '=' sign).\n2. Do not include the target number in the expression.\n3. U... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/countdown",
"task_name": "countdown"
} | ||
polynomial_multiplication-train-build-870 | build | [
{
"answer": "-32*z**4 + 8*z**3",
"question": "Calculate the following: -4*z**2*(8*z**2 - 2*z)\nWhen performing calculations, please follow these guidelines:\n1. Use ** instead of ^ to represent exponents. For example, write 7*X**2 instead of 7*X^2.\n2. Always include the * symbol for all multiplication oper... | [
{
"answer": "-8*z**4 - 16*z**3 + 10*z**2",
"question": "Calculate the following: (-2*z**2 - 5*z)*(4*z**2 - 2*z)\nWhen performing calculations, please follow these guidelines:\n1. Use ** instead of ^ to represent exponents. For example, write 7*X**2 instead of 7*X^2.\n2. Always include the * symbol for all m... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/polynomial_multiplication",
"task_name": "polynomial_multiplication"
} | ||
cryptarithm-train-use-393 | use | [
{
"answer": "{'T': 7, 'W': 6, 'O': 5, 'F': 1, 'U': 3, 'R': 0}",
"question": "Solve the cryptarithmetic puzzle: TWO + TWO = FOUR. Each letter represents a unique digit (0-9), and leading letters (F, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2... | [] | Solve the cryptarithmetic puzzle: HALF + HALF = WHOLE. Each letter represents a unique digit (0-9), and leading letters (H, W) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'H': 5, 'A': 6, 'L': 4, 'F': 7, 'W': 1, 'O': 0, 'E': 2} | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/cryptarithm",
"task_name": "cryptarithm"
} |
count_bits-train-build-784 | build | [
{
"answer": "8",
"question": "How many 1 bits are there in the binary representation of the number 467172?"
},
{
"answer": "12",
"question": "How many 1 bits are there in the binary representation of the number 2738605?"
},
{
"answer": "8",
"question": "How many 1 bits are there in t... | [
{
"answer": "9",
"question": "How many 1 bits are there in the binary representation of the number 46438920?"
},
{
"answer": "13",
"question": "How many 1 bits are there in the binary representation of the number 37336184?"
},
{
"answer": "12",
"question": "How many 1 bits are there ... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/count_bits",
"task_name": "count_bits"
} | ||
polynomial_multiplication-train-build-801 | build | [
{
"answer": "-78*z**6 - 169*z**5",
"question": "Calculate the following: 13*z**3*(-6*z**3 - 13*z**2)\nWhen performing calculations, please follow these guidelines:\n1. Use ** instead of ^ to represent exponents. For example, write 7*X**2 instead of 7*X^2.\n2. Always include the * symbol for all multiplicati... | [
{
"answer": "-10*x**3",
"question": "Simplify this expression: -10*x**3\nWhen performing calculations, please follow these guidelines:\n1. Use ** instead of ^ to represent exponents. For example, write 7*X**2 instead of 7*X^2.\n2. Always include the * symbol for all multiplication operations in your reasoni... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/polynomial_multiplication",
"task_name": "polynomial_multiplication"
} | ||
polynomial_multiplication-train-build-354 | build | [
{
"answer": "4*x**3 + x**2",
"question": "Simplify this expression: x*(4*x**2 + x)\nWhen performing calculations, please follow these guidelines:\n1. Use ** instead of ^ to represent exponents. For example, write 7*X**2 instead of 7*X^2.\n2. Always include the * symbol for all multiplication operations in y... | [
{
"answer": "-2*y**5 + 24*y**4",
"question": "Calculate the following: -2*y**2*(y**3 - 12*y**2)\nWhen performing calculations, please follow these guidelines:\n1. Use ** instead of ^ to represent exponents. For example, write 7*X**2 instead of 7*X^2.\n2. Always include the * symbol for all multiplication op... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/polynomial_multiplication",
"task_name": "polynomial_multiplication"
} | ||
count_bits-train-build-49 | build | [
{
"answer": "7",
"question": "How many 1 bits are there in the binary representation of the number 66530?"
},
{
"answer": "11",
"question": "How many 1 bits are there in the binary representation of the number 768650?"
},
{
"answer": "16",
"question": "How many 1 bits are there in th... | [
{
"answer": "11",
"question": "How many 1 bits are there in the binary representation of the number 958025?"
},
{
"answer": "14",
"question": "How many 1 bits are there in the binary representation of the number 71243317?"
},
{
"answer": "12",
"question": "How many 1 bits are there i... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/count_bits",
"task_name": "count_bits"
} | ||
count_bits-train-build-340 | build | [
{
"answer": "9",
"question": "How many 1 bits are there in the binary representation of the number 430381?"
},
{
"answer": "8",
"question": "How many 1 bits are there in the binary representation of the number 267941?"
},
{
"answer": "13",
"question": "How many 1 bits are there in th... | [
{
"answer": "10",
"question": "How many 1 bits are there in the binary representation of the number 3443924?"
},
{
"answer": "8",
"question": "How many 1 bits are there in the binary representation of the number 3306498?"
},
{
"answer": "13",
"question": "How many 1 bits are there in... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/count_bits",
"task_name": "count_bits"
} | ||
polynomial_equations-train-use-941 | use | [
{
"answer": "-6.7896",
"question": "Find the real value(s) of y in the equation: -3*y**3 - 20*y**2 - 17 = 0\nIn solving equations, please follow these instructions:\n1. Provide all answers as comma-separated decimal values. For example: \"-0.3773, 0.4005\"\n2. For solutions that can be expressed in exact fo... | [] | Determine the real value(s) of w that satisfies: 6*w - 12 = 0
In solving equations, please follow these instructions:
1. Provide all answers as comma-separated decimal values. For example: "-0.3773, 0.4005"
2. For solutions that can be expressed in exact form (like "u = 2 + sqrt(4560)/172" and "u = 2 - sqrt(4560)/172")... | 2.0 | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/polynomial_equations",
"task_name": "polynomial_equations"
} |
spell_backward-train-build-830 | build | [
{
"answer": "uoliap",
"question": "Spell this word backward (example: sun -> nus): pailou"
},
{
"answer": "dicaorcus",
"question": "Spell this word backward (example: sun -> nus): sucroacid"
},
{
"answer": "yllavart",
"question": "Spell this word backward (example: sun -> nus): trava... | [
{
"answer": "yttort",
"question": "Spell this word backward (example: sun -> nus): trotty"
},
{
"answer": "eneris",
"question": "Spell this word backward (example: sun -> nus): sirene"
},
{
"answer": "yltuo",
"question": "Spell this word backward (example: sun -> nus): outly"
},
... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/spell_backward",
"task_name": "spell_backward"
} | ||
count_bits-train-use-416 | use | [
{
"answer": "12",
"question": "How many 1 bits are there in the binary representation of the number 9923116?"
},
{
"answer": "10",
"question": "How many 1 bits are there in the binary representation of the number 113735?"
},
{
"answer": "13",
"question": "How many 1 bits are there in... | [] | How many 1 bits are there in the binary representation of the number 284257? | 8 | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/count_bits",
"task_name": "count_bits"
} |
bitwise_arithmetic-train-use-724 | use | [
{
"answer": "0xeac33c",
"question": "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.\n(((0x10dd << 0x2) - (0x3960 >... | [] | 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.
(((0x4c10 >> 0x2) >> 0x2) + ((0x8400 << 0x1) + (0xea16 >> 0x2))) | 0x14746 | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/bitwise_arithmetic",
"task_name": "bitwise_arithmetic"
} |
knights_knaves-train-build-35 | build | [
{
"answer": "Emma is an angel, and Riley is an angel.",
"question": "A very special island is inhabited only by angels and devils. Angels always tell the truth, and devils always lie. You meet 2 inhabitants: Emma, and Riley. According to Emma, \"Riley is a devil or Emma is an angel or Riley is an angel\". R... | [
{
"answer": "Owen is a pioneer, and Jackson is a pioneer.",
"question": "A very special island is inhabited only by pioneers and laggards. Pioneers always tell the truth, and laggards always lie. You meet 2 inhabitants: Owen, and Jackson. As Owen put it, \"Jackson is a pioneer or Jackson is a laggard or Owe... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/knights_knaves",
"task_name": "knights_knaves"
} | ||
bitwise_arithmetic-train-build-160 | build | [
{
"answer": "0xd93841f8",
"question": "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.\n(((0xec7d * 0xeb24) + (0x6b... | [
{
"answer": "-0x372487a99",
"question": "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.\n(((((0xbd99 + 0x75b8) + (... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/bitwise_arithmetic",
"task_name": "bitwise_arithmetic"
} | ||
count_bits-train-build-456 | build | [
{
"answer": "13",
"question": "How many 1 bits are there in the binary representation of the number 6787939?"
},
{
"answer": "10",
"question": "How many 1 bits are there in the binary representation of the number 91695?"
},
{
"answer": "8",
"question": "How many 1 bits are there in t... | [
{
"answer": "9",
"question": "How many 1 bits are there in the binary representation of the number 152397?"
},
{
"answer": "9",
"question": "How many 1 bits are there in the binary representation of the number 44634?"
},
{
"answer": "13",
"question": "How many 1 bits are there in the... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/count_bits",
"task_name": "count_bits"
} | ||
bitwise_arithmetic-train-build-220 | build | [
{
"answer": "0x381cae138b00",
"question": "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.\n(((0x6a4a << 0x3) + (0x... | [
{
"answer": "0x19598afb",
"question": "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.\n(((0x7d75 + 0x5c80) * (0x77... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/bitwise_arithmetic",
"task_name": "bitwise_arithmetic"
} | ||
spell_backward-train-use-224 | use | [
{
"answer": "rotcel",
"question": "Spell this word backward (example: sun -> nus): lector"
},
{
"answer": "leinaD",
"question": "Spell this word backward (example: sun -> nus): Daniel"
},
{
"answer": "yrtlus",
"question": "Spell this word backward (example: sun -> nus): sultry"
}
] | [] | Spell this word backward (example: sun -> nus): boatwise | esiwtaob | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/spell_backward",
"task_name": "spell_backward"
} |
count_bits-train-build-795 | build | [
{
"answer": "15",
"question": "How many 1 bits are there in the binary representation of the number 3108247?"
},
{
"answer": "9",
"question": "How many 1 bits are there in the binary representation of the number 3084704?"
},
{
"answer": "8",
"question": "How many 1 bits are there in ... | [
{
"answer": "15",
"question": "How many 1 bits are there in the binary representation of the number 91956660?"
},
{
"answer": "10",
"question": "How many 1 bits are there in the binary representation of the number 29506689?"
},
{
"answer": "11",
"question": "How many 1 bits are there... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/count_bits",
"task_name": "count_bits"
} | ||
knights_knaves-train-use-45 | use | [
{
"answer": "Sebastian is a saint, and Matthew is a sinner.",
"question": "A very special island is inhabited only by saints and sinners. Saints always tell the truth, and sinners always lie. You meet 2 inhabitants: Sebastian, and Matthew. Sebastian expressed that Matthew is a sinner. Matthew commented, \"S... | [] | A very special island is inhabited only by knights and knaves. Knights always tell the truth, and knaves always lie. You meet 3 inhabitants: Charlotte, Emma, and Elizabeth. Charlotte expressed that it is not the case that (Elizabeth is a knave). In Emma's words: "it is not the case that (Charlotte is a knave or Charlot... | Charlotte is a knight, Emma is a knave, and Elizabeth is a knight. | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/knights_knaves",
"task_name": "knights_knaves"
} |
cryptarithm-train-build-97 | build | [
{
"answer": "{'B': 7, 'A': 8, 'S': 3, 'E': 2, 'L': 5, 'G': 1, 'M': 0}",
"question": "Solve the cryptarithmetic puzzle: BASE + BALL = GAMES. Each letter represents a unique digit (0-9), and leading letters (B, G) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A'... | [
{
"answer": "{'T': 7, 'W': 6, 'O': 5, 'F': 1, 'U': 3, 'R': 0}",
"question": "Solve the cryptarithmetic puzzle: TWO + TWO = FOUR. Each letter represents a unique digit (0-9), and leading letters (F, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/cryptarithm",
"task_name": "cryptarithm"
} | ||
countdown-train-use-311 | use | [
{
"answer": "1 + (48 + 48)/1",
"question": "Using all the numbers 48, 48, 1, 1, create an expression that equals 97.\nYou can only use each number once.\n\nFinal answer format instructions:\n1. Provide your solution as a arithmetic expression (no '=' sign).\n2. Do not include the target number in the expres... | [] | Using all the numbers 51, 63, 41, 99, create an expression that equals 26.
You can only use each number once.
Final answer format instructions:
1. Provide your solution as a arithmetic expression (no '=' sign).
2. Do not include the target number in the expression.
3. Use '*' for multiplication.
4. Use '/' for divisio... | 41 - 63 - 51 + 99 | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/countdown",
"task_name": "countdown"
} |
polynomial_equations-train-use-148 | use | [
{
"answer": "0.0, 0.75",
"question": "Find the real value(s) of n in the equation: -8*n**2 + 6*n = 0\nIn solving equations, please follow these instructions:\n1. Provide all answers as comma-separated decimal values. For example: \"-0.3773, 0.4005\"\n2. For solutions that can be expressed in exact form (lik... | [] | Solve for real d: 16*d - 10 = 0
In solving equations, please follow these instructions:
1. Provide all answers as comma-separated decimal values. For example: "-0.3773, 0.4005"
2. For solutions that can be expressed in exact form (like "u = 2 + sqrt(4560)/172" and "u = 2 - sqrt(4560)/172"), convert them to decimal form... | 0.625 | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/polynomial_equations",
"task_name": "polynomial_equations"
} |
count_bits-train-use-247 | use | [
{
"answer": "9",
"question": "How many 1 bits are there in the binary representation of the number 152397?"
},
{
"answer": "9",
"question": "How many 1 bits are there in the binary representation of the number 801938?"
},
{
"answer": "13",
"question": "How many 1 bits are there in th... | [] | How many 1 bits are there in the binary representation of the number 146747? | 11 | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/count_bits",
"task_name": "count_bits"
} |
countdown-train-use-216 | use | [
{
"answer": "62 - 93 - 13 + 69",
"question": "Using all the numbers 69, 62, 13, 93, create an expression that equals 25.\nYou can only use each number once.\n\nFinal answer format instructions:\n1. Provide your solution as a arithmetic expression (no '=' sign).\n2. Do not include the target number in the ex... | [] | Calculate 30 using all of these numbers: 66, 80, 86, 42.
Each number may be used at most once.
Final answer format instructions:
1. Provide your solution as a arithmetic expression (no '=' sign).
2. Do not include the target number in the expression.
3. Use '*' for multiplication.
4. Use '/' for division.
5. Do not in... | 66 + 86 - 80 - 42 | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/countdown",
"task_name": "countdown"
} |
spell_backward-train-build-418 | build | [
{
"answer": "emirpnu",
"question": "Spell this word backward (example: sun -> nus): unprime"
},
{
"answer": "atatsoC",
"question": "Spell this word backward (example: sun -> nus): Costata"
},
{
"answer": "aurepE",
"question": "Spell this word backward (example: sun -> nus): Eperua"
... | [
{
"answer": "yfiroproc",
"question": "Spell this word backward (example: sun -> nus): corporify"
},
{
"answer": "yllaS",
"question": "Spell this word backward (example: sun -> nus): Sally"
},
{
"answer": "yldetpurba",
"question": "Spell this word backward (example: sun -> nus): abrup... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/spell_backward",
"task_name": "spell_backward"
} | ||
bitwise_arithmetic-train-use-9 | use | [
{
"answer": "0x3604",
"question": "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.\n((0xd81 << 0x0) << 0x2)"
},
... | [] | 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.
(((0x726e >> 0x2) - (0xe768 << 0x0)) * ((0xa095 << 0x0) << 0x1)) | -0xfe6c52a2 | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/bitwise_arithmetic",
"task_name": "bitwise_arithmetic"
} |
polynomial_equations-train-use-548 | use | [
{
"answer": "0.6934",
"question": "Solve for real t: 1 - 3*t**3 = 0\nIn solving equations, please follow these instructions:\n1. Provide all answers as comma-separated decimal values. For example: \"-0.3773, 0.4005\"\n2. For solutions that can be expressed in exact form (like \"u = 2 + sqrt(4560)/172\" and ... | [] | Determine the real value(s) of l that satisfies: -9*l**2 - 12*l = 0
In solving equations, please follow these instructions:
1. Provide all answers as comma-separated decimal values. For example: "-0.3773, 0.4005"
2. For solutions that can be expressed in exact form (like "u = 2 + sqrt(4560)/172" and "u = 2 - sqrt(4560)... | -1.3333, 0.0 | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/polynomial_equations",
"task_name": "polynomial_equations"
} |
knights_knaves-train-use-344 | use | [
{
"answer": "Isabella is an altruist, and Jack is an altruist.",
"question": "A very special island is inhabited only by altruists and egoists. Altruists always tell the truth, and egoists always lie. You meet 2 inhabitants: Isabella, and Jack. \"Jack is an altruist or Isabella is an altruist or Jack is an ... | [] | A very special island is inhabited only by angels and devils. Angels always tell the truth, and devils always lie. You meet 3 inhabitants: Emma, Penelope, and Sebastian. According to Emma, "if (Sebastian is an angel and Penelope is an angel and Sebastian is a devil) then (Sebastian is a devil if and only if Sebastian i... | Emma is an angel, Penelope is a devil, and Sebastian is an angel. | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/knights_knaves",
"task_name": "knights_knaves"
} |
countdown-train-build-80 | build | [
{
"answer": "58 + 79 + 54 - 37 - 75",
"question": "Calculate 79 using all of these numbers: 75, 79, 54, 37, 58.\nEach number may be used at most once.\n\nFinal answer format instructions:\n1. Provide your solution as a arithmetic expression (no '=' sign).\n2. Do not include the target number in the expressi... | [
{
"answer": "61 + 44 - 57 + 43 - 10 + 30",
"question": "Using all the numbers 61, 57, 30, 44, 10, 43, create an expression that equals 111.\nYou can only use each number once.\n\nFinal answer format instructions:\n1. Provide your solution as a arithmetic expression (no '=' sign).\n2. Do not include the targ... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/countdown",
"task_name": "countdown"
} | ||
cryptarithm-train-build-98 | build | [
{
"answer": "{'T': 7, 'W': 6, 'O': 5, 'F': 1, 'U': 3, 'R': 0}",
"question": "Solve the cryptarithmetic puzzle: TWO + TWO = FOUR. Each letter represents a unique digit (0-9), and leading letters (F, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2... | [
{
"answer": "{'F': 2, 'O': 9, 'R': 7, 'T': 8, 'Y': 0, 'E': 5, 'N': 6, 'S': 3, 'I': 1, 'X': 4}",
"question": "Solve the cryptarithmetic puzzle: FORTY + TEN + TEN = SIXTY. Each letter represents a unique digit (0-9), and leading letters (F, S, T) cannot be zero. Provide your answer as a dictionary mapping eac... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/cryptarithm",
"task_name": "cryptarithm"
} | ||
spell_backward-train-use-794 | use | [
{
"answer": "evA",
"question": "Spell this word backward (example: sun -> nus): Ave"
},
{
"answer": "ydemer",
"question": "Spell this word backward (example: sun -> nus): remedy"
},
{
"answer": "vos",
"question": "Spell this word backward (example: sun -> nus): sov"
}
] | [] | Spell this word backward (example: sun -> nus): Palenque | euqnelaP | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/spell_backward",
"task_name": "spell_backward"
} |
bitwise_arithmetic-train-use-800 | use | [
{
"answer": "0x43009",
"question": "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.\n((0xa3cf << 0x3) - (0x501f + 0... | [] | 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.
(((0x1d94 - 0x686a) << 0x1) - ((0x5749 - 0x81a8) + (0x7467 * 0xeeeb))) | -0x6ca307da | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/bitwise_arithmetic",
"task_name": "bitwise_arithmetic"
} |
bitwise_arithmetic-train-build-19 | build | [
{
"answer": "0x430ef",
"question": "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.\n((0x96a7 << 0x3) - (0xd0d + 0x... | [
{
"answer": "0x9c2",
"question": "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.\n((0x4e17 >> 0x3) >> 0x0)"
},
... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/bitwise_arithmetic",
"task_name": "bitwise_arithmetic"
} | ||
knights_knaves-train-build-425 | build | [
{
"answer": "Penelope is an angel, and Ella is a devil.",
"question": "A very special island is inhabited only by angels and devils. Angels always tell the truth, and devils always lie. You meet 2 inhabitants: Penelope, and Ella. Penelope stated, \"Ella is an angel or Ella is a devil or Penelope is an angel... | [
{
"answer": "Noah is a knave, Sophia is a knight, Emily is a knight, and Oliver is a knave.",
"question": "A very special island is inhabited only by knights and knaves. Knights always tell the truth, and knaves always lie. You meet 4 inhabitants: Noah, Sophia, Emily, and Oliver. Noah expressed that Emily i... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/knights_knaves",
"task_name": "knights_knaves"
} | ||
spell_backward-train-build-397 | build | [
{
"answer": "porp",
"question": "Spell this word backward (example: sun -> nus): prop"
},
{
"answer": "ysteB",
"question": "Spell this word backward (example: sun -> nus): Betsy"
},
{
"answer": "mhogeb",
"question": "Spell this word backward (example: sun -> nus): begohm"
}
] | [
{
"answer": "relluc",
"question": "Spell this word backward (example: sun -> nus): culler"
},
{
"answer": "elbariuqni",
"question": "Spell this word backward (example: sun -> nus): inquirable"
},
{
"answer": "esuohneh",
"question": "Spell this word backward (example: sun -> nus): hen... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/spell_backward",
"task_name": "spell_backward"
} | ||
polynomial_multiplication-train-use-494 | use | [
{
"answer": "-2*y**6 + 7*y**5 + 49*y**4",
"question": "Calculate the following: (-2*y**3 - 7*y**2)*(y**3 - 7*y**2)\nWhen performing calculations, please follow these guidelines:\n1. Use ** instead of ^ to represent exponents. For example, write 7*X**2 instead of 7*X^2.\n2. Always include the * symbol for al... | [] | Simplify this expression: 6*x**2*(x**2 - 3*x)
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 `-3*X**3*sin... | 6*x**4 - 18*x**3 | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/polynomial_multiplication",
"task_name": "polynomial_multiplication"
} |
count_bits-train-build-986 | build | [
{
"answer": "13",
"question": "How many 1 bits are there in the binary representation of the number 5798231?"
},
{
"answer": "9",
"question": "How many 1 bits are there in the binary representation of the number 670482?"
},
{
"answer": "10",
"question": "How many 1 bits are there in ... | [
{
"answer": "8",
"question": "How many 1 bits are there in the binary representation of the number 2187976?"
},
{
"answer": "7",
"question": "How many 1 bits are there in the binary representation of the number 76994?"
},
{
"answer": "14",
"question": "How many 1 bits are there in th... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/count_bits",
"task_name": "count_bits"
} | ||
spell_backward-train-build-657 | build | [
{
"answer": "leinaD",
"question": "Spell this word backward (example: sun -> nus): Daniel"
},
{
"answer": "arygoxE",
"question": "Spell this word backward (example: sun -> nus): Exogyra"
},
{
"answer": "nrocib",
"question": "Spell this word backward (example: sun -> nus): bicorn"
}... | [
{
"answer": "kcatnu",
"question": "Spell this word backward (example: sun -> nus): untack"
},
{
"answer": "emaneb",
"question": "Spell this word backward (example: sun -> nus): bename"
},
{
"answer": "naphsa",
"question": "Spell this word backward (example: sun -> nus): ashpan"
},
... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/spell_backward",
"task_name": "spell_backward"
} | ||
count_bits-train-build-73 | build | [
{
"answer": "8",
"question": "How many 1 bits are there in the binary representation of the number 265908?"
},
{
"answer": "9",
"question": "How many 1 bits are there in the binary representation of the number 816649?"
},
{
"answer": "11",
"question": "How many 1 bits are there in th... | [
{
"answer": "14",
"question": "How many 1 bits are there in the binary representation of the number 70511409?"
},
{
"answer": "15",
"question": "How many 1 bits are there in the binary representation of the number 92831326?"
},
{
"answer": "9",
"question": "How many 1 bits are there ... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/count_bits",
"task_name": "count_bits"
} | ||
knights_knaves-train-build-71 | build | [
{
"answer": "Liam is a sinner, Luke is a saint, and Henry is a saint.",
"question": "A very special island is inhabited only by saints and sinners. Saints always tell the truth, and sinners always lie. You meet 3 inhabitants: Liam, Luke, and Henry. Liam told you that (Henry is a saint and Liam is a saint an... | [
{
"answer": "Benjamin is a pioneer, Jacob is a pioneer, Charlotte is a pioneer, and Grace is a laggard.",
"question": "A very special island is inhabited only by pioneers and laggards. Pioneers always tell the truth, and laggards always lie. You meet 4 inhabitants: Benjamin, Jacob, Charlotte, and Grace. Ben... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/knights_knaves",
"task_name": "knights_knaves"
} | ||
knights_knaves-train-build-4 | build | [
{
"answer": "Riley is a saint, and Scarlett is a saint.",
"question": "A very special island is inhabited only by saints and sinners. Saints always tell the truth, and sinners always lie. You meet 2 inhabitants: Riley, and Scarlett. Riley commented, \"Riley is a saint or Scarlett is a saint\". \"Riley is a ... | [
{
"answer": "Penelope is a fool, Ava is a fool, Logan is a sage, and Lucas is a sage.",
"question": "A very special island is inhabited only by sages and fools. Sages always tell the truth, and fools always lie. You meet 4 inhabitants: Penelope, Ava, Logan, and Lucas. According to Penelope, \"(Lucas is a fo... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/knights_knaves",
"task_name": "knights_knaves"
} | ||
spell_backward-train-build-912 | build | [
{
"answer": "noobab",
"question": "Spell this word backward (example: sun -> nus): baboon"
},
{
"answer": "ycnedaced",
"question": "Spell this word backward (example: sun -> nus): decadency"
},
{
"answer": "gnivigtuo",
"question": "Spell this word backward (example: sun -> nus): outg... | [
{
"answer": "eanipA",
"question": "Spell this word backward (example: sun -> nus): Apinae"
},
{
"answer": "nocitsuocA",
"question": "Spell this word backward (example: sun -> nus): Acousticon"
},
{
"answer": "lotxe",
"question": "Spell this word backward (example: sun -> nus): extol"... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/spell_backward",
"task_name": "spell_backward"
} |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 51