conversation listlengths 2 2 | seed int64 48.3k 200M | task_id int64 5.39M 900M | task_metadata dict | task_type stringclasses 8
values | usage dict |
|---|---|---|---|---|---|
[
{
"content": "A sequence of brackets was cut, and only the end remains:\n\n\">)){}}()]<><>)>>>)]]}>)>]})}>]\"\n\nRestore the missing beginning so that:\n- Every closing bracket has its opening partner\n- No extra brackets are added\n- The sequence is properly nested\n\nPlease provide your final answer (the rest... | 161,616,133 | 561,616,133 | {
"closing_sequence": null,
"depth": null,
"difficulty": null,
"digit_map": null,
"dyck_sequence": null,
"error_indices": null,
"expression": null,
"expressions": null,
"fill_length": 22,
"full_sequence": "[<{({[<(<{[[(<<<([{((<>)){}}()]<><>)>>>)]]}>)>]})}>]",
"generation_error": null,
"generati... | dyck_language2 | {
"completion_tokens": 1579,
"completion_tokens_details": null,
"prompt_tokens": 88,
"prompt_tokens_details": null,
"total_tokens": 1667
} |
[
{
"content": "As a Dyck language expert, you need to verify the correctness of bracket matching reasoning steps.\n\nA Dyck sequence must have all brackets properly matched and nested. The reasoning process tracks a stack: opening brackets are pushed, and closing brackets pop the matching opening bracket.\n\nSeq... | 27,716,238 | 827,716,238 | {
"closing_sequence": null,
"depth": null,
"difficulty": null,
"digit_map": null,
"dyck_sequence": "()(([])[][{[]{[[]][()]}}][][])",
"error_indices": [
14,
16,
23,
29
],
"expression": null,
"expressions": null,
"fill_length": null,
"full_sequence": null,
"generation_error": null,... | dyck_language_reasoning_errors | {
"completion_tokens": 474,
"completion_tokens_details": null,
"prompt_tokens": 493,
"prompt_tokens_details": null,
"total_tokens": 967
} |
[
{
"content": "As a Dyck language expert, you need to verify the correctness of bracket matching reasoning steps.\n\nA Dyck sequence must have all brackets properly matched and nested. The reasoning process tracks a stack: opening brackets are pushed, and closing brackets pop the matching opening bracket.\n\nSeq... | 43,379,825 | 843,379,825 | {
"closing_sequence": null,
"depth": null,
"difficulty": null,
"digit_map": null,
"dyck_sequence": "[]()({()})[]",
"error_indices": [
5,
9
],
"expression": null,
"expressions": null,
"fill_length": null,
"full_sequence": null,
"generation_error": null,
"generation_failed": null,
"gen... | dyck_language_reasoning_errors | {
"completion_tokens": 208,
"completion_tokens_details": null,
"prompt_tokens": 274,
"prompt_tokens_details": null,
"total_tokens": 482
} |
[
{
"content": "考虑以下布尔表达式：\n\nA. ((not not ((尼日利亚的首都是曼谷。) or (not ((4 * -19) < (-14 * -5))))) and (not ((2 ** 2) > (3 - 10)))) and (((not (波兰的货币是兹罗提。)) and (((火烈鸟是鸟类。) or (1924年奥运会在巴黎举办。)) and ((鸡有2条腿。) or (越南的首都是哈瓦那。)))) or ((2024年奥运会在巴黎举办。) or (((-10 * -10 + 1 * -2) > (-17 + 18)) or (443是斐波那契数。)) or (((企鹅能飞翔。) ... | 80,125,444 | 680,125,444 | {
"closing_sequence": null,
"depth": 5,
"difficulty": null,
"digit_map": null,
"dyck_sequence": null,
"error_indices": null,
"expression": null,
"expressions": [
[
"((not not ((尼日利亚的首都是曼谷。) or (not ((4 * -19) < (-14 * -5))))) and (not ((2 ** 2) > (3 - 10)))) and (((not (波兰的货币是兹罗提。)) and (((火烈鸟... | boolean_expressions | {
"completion_tokens": 1464,
"completion_tokens_details": null,
"prompt_tokens": 638,
"prompt_tokens_details": null,
"total_tokens": 2102
} |
[
{
"content": "You are given the ending portion of a bracket sequence. Find the beginning.\n\nEnding: ()}<>()\n\nYour task:\n- Determine what opening brackets must come before this ending\n- The result must be a valid, balanced bracket sequence\n- Use the minimum number of opening brackets necessary\n\nPlease pr... | 47,295,526 | 447,295,526 | {
"closing_sequence": null,
"depth": null,
"difficulty": null,
"digit_map": null,
"dyck_sequence": null,
"error_indices": null,
"expression": null,
"expressions": null,
"fill_length": 1,
"full_sequence": "{()}<>()",
"generation_error": null,
"generation_failed": null,
"generation_traceback": n... | dyck_language2 | {
"completion_tokens": 282,
"completion_tokens_details": null,
"prompt_tokens": 84,
"prompt_tokens_details": null,
"total_tokens": 366
} |
[
{
"content": "You are an expert in Dyck language, where you must complete bracket sequences (e.g., [], {}, <>). You need to analyze whether the bracket matching steps are correct according to Dyck language rules.\n\nGiven an initial Dyck language sequence and steps for deriving the closing bracket sequence (giv... | 11,765,978 | 811,765,978 | {
"closing_sequence": null,
"depth": null,
"difficulty": null,
"digit_map": null,
"dyck_sequence": "{}((){}{})[{()}][()[]][][][]",
"error_indices": [
17,
23
],
"expression": null,
"expressions": null,
"fill_length": null,
"full_sequence": null,
"generation_error": null,
"generation_fai... | dyck_language_reasoning_errors | {
"completion_tokens": 383,
"completion_tokens_details": null,
"prompt_tokens": 523,
"prompt_tokens_details": null,
"total_tokens": 906
} |
[
{
"content": "As a Dyck language expert, you need to verify the correctness of bracket matching reasoning steps.\n\nA Dyck sequence must have all brackets properly matched and nested. The reasoning process tracks a stack: opening brackets are pushed, and closing brackets pop the matching opening bracket.\n\nSeq... | 45,190,154 | 845,190,154 | {
"closing_sequence": null,
"depth": null,
"difficulty": null,
"digit_map": null,
"dyck_sequence": "({{}({}[]{})}[])",
"error_indices": [
6,
8,
9,
13
],
"expression": null,
"expressions": null,
"fill_length": null,
"full_sequence": null,
"generation_error": null,
"generation_fa... | dyck_language_reasoning_errors | {
"completion_tokens": 306,
"completion_tokens_details": null,
"prompt_tokens": 324,
"prompt_tokens_details": null,
"total_tokens": 630
} |
[
{
"content": "As a Dyck language expert, you need to verify the correctness of bracket matching reasoning steps.\n\nA Dyck sequence must have all brackets properly matched and nested. The reasoning process tracks a stack: opening brackets are pushed, and closing brackets pop the matching opening bracket.\n\nSeq... | 65,697,496 | 865,697,496 | {
"closing_sequence": null,
"depth": null,
"difficulty": null,
"digit_map": null,
"dyck_sequence": "{()}{}()([][])[]{{}}",
"error_indices": [
5,
19
],
"expression": null,
"expressions": null,
"fill_length": null,
"full_sequence": null,
"generation_error": null,
"generation_failed": nul... | dyck_language_reasoning_errors | {
"completion_tokens": 302,
"completion_tokens_details": null,
"prompt_tokens": 363,
"prompt_tokens_details": null,
"total_tokens": 665
} |
[
{
"content": "A sequence of brackets was cut, and only the end remains:\n\n\"()>}()})[]}]<>()[]()\"\n\nRestore the missing beginning so that:\n- Every closing bracket has its opening partner\n- No extra brackets are added\n- The sequence is properly nested\n\nPlease provide your final answer (the restored compl... | 62,644,014 | 462,644,014 | {
"closing_sequence": null,
"depth": null,
"difficulty": null,
"digit_map": null,
"dyck_sequence": null,
"error_indices": null,
"expression": null,
"expressions": null,
"fill_length": 6,
"full_sequence": "[{({{<()>}()})[]}]<>()[]()",
"generation_error": null,
"generation_failed": null,
"genera... | dyck_language2 | {
"completion_tokens": 609,
"completion_tokens_details": null,
"prompt_tokens": 83,
"prompt_tokens_details": null,
"total_tokens": 692
} |
[
{
"content": "Given the following boolean expressions:\n\nA. not (((not not (not (There are 30 days in September.))) or ((not not (not not ((-9 * 9) <= (15 + -6)))) or (The chemical symbol for Sodium is Mn.))) and (not (not not ((The currency of Nigeria is the Forint.) and (((20 * -7) < (18 - -12)) and (Saturn ... | 11,563,831 | 611,563,831 | {
"closing_sequence": null,
"depth": 6,
"difficulty": null,
"digit_map": null,
"dyck_sequence": null,
"error_indices": null,
"expression": null,
"expressions": [
[
"not (((not not (not (There are 30 days in September.))) or ((not not (not not ((-9 * 9) <= (15 + -6)))) or (The chemical symbol f... | boolean_expressions | {
"completion_tokens": 1728,
"completion_tokens_details": null,
"prompt_tokens": 765,
"prompt_tokens_details": null,
"total_tokens": 2493
} |
[
{
"content": "Given the following boolean expressions:\n\nA. (not not (((Morocco is in Africa.) and (Water is a gas at room temperature.)) and ((A human is a mammal.) or ((0 * 5) < (-13 * 6))))) and (not not (not not ((5 * -10 + -10 * 3) < (2 * 10 * -9 * 9))))\nB. (not not ((not not (The 2008 Olympics were held... | 64,997,826 | 664,997,826 | {
"closing_sequence": null,
"depth": 4,
"difficulty": null,
"digit_map": null,
"dyck_sequence": null,
"error_indices": null,
"expression": null,
"expressions": [
[
"(not not (((Morocco is in Africa.) and (Water is a gas at room temperature.)) and ((A human is a mammal.) or ((0 * 5) < (-13 * 6)... | boolean_expressions | {
"completion_tokens": 454,
"completion_tokens_details": null,
"prompt_tokens": 217,
"prompt_tokens_details": null,
"total_tokens": 671
} |
[
{
"content": "Let S = \"())⟦⟧⟨⟩<>]>()\" be a suffix of a Dyck word.\n\nFind the minimal prefix P such that P + S forms a valid Dyck word.\n\nPlease provide your final answer (P + S, the complete Dyck word) in backticks like `answer`.",
"reasoning_content": null,
"role": "user"
},
{
"content": "`... | 38,282,667 | 438,282,667 | {
"closing_sequence": null,
"depth": null,
"difficulty": null,
"digit_map": null,
"dyck_sequence": null,
"error_indices": null,
"expression": null,
"expressions": null,
"fill_length": 3,
"full_sequence": "<[(())⟦⟧⟨⟩<>]>()",
"generation_error": null,
"generation_failed": null,
"generation_trace... | dyck_language2 | {
"completion_tokens": 430,
"completion_tokens_details": null,
"prompt_tokens": 72,
"prompt_tokens_details": null,
"total_tokens": 502
} |
[
{
"content": "定义 ◇，规则如下：\n当x大于y时，x ◇ y = x + y + x；\n其他情况下，x ◇ y = x - y - y。\n运算优先级：◇ > ** > * = / = % > + = -。\n括号具有最高优先级，先计算括号内的表达式。\n请计算表达式的值: 7 * 9 + 9 ◇ 8\n请将最终答案填入\\boxed{}中。",
"reasoning_content": null,
"role": "user"
},
{
"content": "根据给定的运算规则，◇ 的优先级高于乘法和加法。首先计算 9 ◇ 8：由于 9 > 8，所以 9 ... | 9,293,513 | 209,293,513 | {
"closing_sequence": null,
"depth": null,
"difficulty": null,
"digit_map": null,
"dyck_sequence": null,
"error_indices": null,
"expression": "7 * 9 + 9 ◇ 8",
"expressions": null,
"fill_length": null,
"full_sequence": null,
"generation_error": null,
"generation_failed": null,
"generation_trace... | operation | {
"completion_tokens": 777,
"completion_tokens_details": null,
"prompt_tokens": 113,
"prompt_tokens_details": null,
"total_tokens": 890
} |
[
{
"content": "数字：[6, 7, 8, 10, 12, 12]，运算符：['+', '-', '*']，目标：100。\n\n在回答的最后，请输出一个 ```python 代码块。代码块中仅包含一个代表答案的表达式，并且该表达式可以直接被 Python 中的 eval() 函数求值。如果无解，请输出 ```python\\nNone\\n```。",
"reasoning_content": null,
"role": "user"
},
{
"content": "```python\n6*(7+8)+10+12-12\n```",
"reasoning_con... | 21,878,507 | 121,878,507 | {
"closing_sequence": null,
"depth": null,
"difficulty": null,
"digit_map": null,
"dyck_sequence": null,
"error_indices": null,
"expression": null,
"expressions": null,
"fill_length": null,
"full_sequence": null,
"generation_error": null,
"generation_failed": null,
"generation_traceback": null... | game_of_24 | {
"completion_tokens": 3033,
"completion_tokens_details": null,
"prompt_tokens": 102,
"prompt_tokens_details": null,
"total_tokens": 3135
} |
[
{
"content": "You are an expert in Dyck language, where you must complete bracket sequences (e.g., [], {}, <>). You need to analyze whether the bracket matching steps are correct according to Dyck language rules.\n\nGiven an initial Dyck language sequence and steps for deriving the closing bracket sequence (giv... | 36,956,323 | 836,956,323 | {
"closing_sequence": null,
"depth": null,
"difficulty": null,
"digit_map": null,
"dyck_sequence": "[](())((())([]())([]))[]()",
"error_indices": [
5,
14,
19
],
"expression": null,
"expressions": null,
"fill_length": null,
"full_sequence": null,
"generation_error": null,
"generatio... | dyck_language_reasoning_errors | {
"completion_tokens": 391,
"completion_tokens_details": null,
"prompt_tokens": 506,
"prompt_tokens_details": null,
"total_tokens": 897
} |
[
{
"content": "Fill in the blank:\n\n_____ + ⟩)> = valid Dyck sequence\n\nRules:\n- The blank contains only opening brackets\n- Use the minimum required\n\nPlease provide your final answer (the complete filled sequence) in backticks like `answer`.",
"reasoning_content": null,
"role": "user"
},
{
... | 124,609,269 | 524,609,269 | {
"closing_sequence": null,
"depth": null,
"difficulty": null,
"digit_map": null,
"dyck_sequence": null,
"error_indices": null,
"expression": null,
"expressions": null,
"fill_length": 3,
"full_sequence": "<(⟨⟩)>",
"generation_error": null,
"generation_failed": null,
"generation_traceback": nul... | dyck_language2 | {
"completion_tokens": 291,
"completion_tokens_details": null,
"prompt_tokens": 60,
"prompt_tokens_details": null,
"total_tokens": 351
} |
[
{
"content": "Analyze these boolean expressions:\n\nA. not (not not (Humans have three lungs.))\nB. ((((Australia is in Oceania.) and (A lizard is a reptile.)) or (not (Mars is the 4th planet from the Sun.))) or ((18 + -10) <= (-15 + -6)) or (not ((Vietnam is in South America.) and (The 2016 Olympics were held ... | 70,080,892 | 670,080,892 | {
"closing_sequence": null,
"depth": 4,
"difficulty": null,
"digit_map": null,
"dyck_sequence": null,
"error_indices": null,
"expression": null,
"expressions": [
[
"not (not not (Humans have three lungs.))",
"True"
],
[
"((((Australia is in Oceania.) and (A lizard is a rept... | boolean_expressions | {
"completion_tokens": 784,
"completion_tokens_details": null,
"prompt_tokens": 348,
"prompt_tokens_details": null,
"total_tokens": 1132
} |
[
{
"content": "Let S = \")⟧⟧)>⦄])⟧>}}⟩>⟩\" be a suffix of a Dyck word.\n\nFind the minimal prefix P such that P + S forms a valid Dyck word.\n\nPlease provide your final answer (P + S, the complete Dyck word) in backticks like `answer`.",
"reasoning_content": null,
"role": "user"
},
{
"content": ... | 101,706,456 | 501,706,456 | {
"closing_sequence": null,
"depth": null,
"difficulty": null,
"digit_map": null,
"dyck_sequence": null,
"error_indices": null,
"expression": null,
"expressions": null,
"fill_length": 15,
"full_sequence": "⟨<⟨{{<⟦([⦃<(⟦⟦()⟧⟧)>⦄])⟧>}}⟩>⟩",
"generation_error": null,
"generation_failed": null,
"g... | dyck_language2 | {
"completion_tokens": 1048,
"completion_tokens_details": null,
"prompt_tokens": 76,
"prompt_tokens_details": null,
"total_tokens": 1124
} |
[
{
"content": "Fill in the blank:\n\n_____ + {}]⟩]<>]]()>)[]⟩}<>[][]⟨⟩{}<><>[][] = valid Dyck sequence\n\nRules:\n- The blank contains only opening brackets\n- Use the minimum required\n\nPlease provide your final answer (the complete filled sequence) in backticks like `answer`.",
"reasoning_content": null,
... | 75,985,816 | 475,985,816 | {
"closing_sequence": null,
"depth": null,
"difficulty": null,
"digit_map": null,
"dyck_sequence": null,
"error_indices": null,
"expression": null,
"expressions": null,
"fill_length": 9,
"full_sequence": "{⟨(<[[[⟨[{}]⟩]<>]]()>)[]⟩}<>[][]⟨⟩{}<><>[][]",
"generation_error": null,
"generation_failed... | dyck_language2 | {
"completion_tokens": 970,
"completion_tokens_details": null,
"prompt_tokens": 77,
"prompt_tokens_details": null,
"total_tokens": 1047
} |
[
{
"content": "A sequence of brackets was cut, and only the end remains:\n\n\"()<>⦃⦄()}⟧⦄>⟩]⟧⟧>>}⟧⦄}⟧}⟧⟧⟩⦄\"\n\nRestore the missing beginning so that:\n- Every closing bracket has its opening partner\n- No extra brackets are added\n- The sequence is properly nested\n\nPlease provide your final answer (the restor... | 82,811,652 | 482,811,652 | {
"closing_sequence": null,
"depth": null,
"difficulty": null,
"digit_map": null,
"dyck_sequence": null,
"error_indices": null,
"expression": null,
"expressions": null,
"fill_length": 20,
"full_sequence": "⦃⟨⟦⟦{⟦{⦃⟦{<<⟦⟦[⟨<⦃⟦{()<>⦃⦄()}⟧⦄>⟩]⟧⟧>>}⟧⦄}⟧}⟧⟧⟩⦄",
"generation_error": null,
"generation_f... | dyck_language2 | {
"completion_tokens": 1709,
"completion_tokens_details": null,
"prompt_tokens": 101,
"prompt_tokens_details": null,
"total_tokens": 1810
} |
[
{
"content": "Use the numbers [9, 10, 19, 20] with ['+', '-'] to reach 72.\n\nAt the end of your response, please output a ```python code block. The code block should contain only a single expression representing the answer, which can be directly evaluated using Python's eval() function. If there is no solution... | 68,065,045 | 168,065,045 | {
"closing_sequence": null,
"depth": null,
"difficulty": null,
"digit_map": null,
"dyck_sequence": null,
"error_indices": null,
"expression": null,
"expressions": null,
"fill_length": null,
"full_sequence": null,
"generation_error": null,
"generation_failed": null,
"generation_traceback": null... | game_of_24 | {
"completion_tokens": 2835,
"completion_tokens_details": null,
"prompt_tokens": 94,
"prompt_tokens_details": null,
"total_tokens": 2929
} |
[
{
"content": "定义 ⊙，规则如下：\n实数域上，x ⊙ y = x + y + x。\n和 △，规则如下：\n当x是偶数时，x △ y = y ⊙ 4 + (x) - y * x；\n其他情况下，x △ y = (x - y ⊙ y) + x + 5。\n和 ▽，规则如下：\n实数域上，x ▽ y = y * x / 5 - x + 1。\n运算优先级：⊙ = △ = ▽ > ** > * = / = % > + = -。\n括号具有最高优先级，先计算括号内的表达式。\n请计算表达式的值: 2 ▽ 7 ⊙ 10 △ 9\n请将最终答案填入\\boxed{}中。",
"reason... | 24,369,862 | 224,369,862 | {
"closing_sequence": null,
"depth": null,
"difficulty": null,
"digit_map": null,
"dyck_sequence": null,
"error_indices": null,
"expression": "2 ▽ 7 ⊙ 10 △ 9",
"expressions": null,
"fill_length": null,
"full_sequence": null,
"generation_error": null,
"generation_failed": null,
"generation_trac... | operation | {
"completion_tokens": 1097,
"completion_tokens_details": null,
"prompt_tokens": 193,
"prompt_tokens_details": null,
"total_tokens": 1290
} |
[
{
"content": "Given the numbers [3, 5, 6, 7], apply ['+', '-'] to get 100.\n\nAt the end of your response, please output a ```python code block. The code block should contain only a single expression representing the answer, which can be directly evaluated using Python's eval() function. If there is no solution... | 62,537,380 | 162,537,380 | {
"closing_sequence": null,
"depth": null,
"difficulty": null,
"digit_map": null,
"dyck_sequence": null,
"error_indices": null,
"expression": null,
"expressions": null,
"fill_length": null,
"full_sequence": null,
"generation_error": null,
"generation_failed": null,
"generation_traceback": null... | game_of_24 | {
"completion_tokens": 3961,
"completion_tokens_details": null,
"prompt_tokens": 92,
"prompt_tokens_details": null,
"total_tokens": 4053
} |
[
{
"content": "用这些数字 [3, 5, 7, 7, 9] 通过 ['+', '-', '*'] 算出 72。\n\n在回答的最后，请输出一个 ```python 代码块。代码块中仅包含一个代表答案的表达式，并且该表达式可以直接被 Python 中的 eval() 函数求值。如果无解，请输出 ```python\\nNone\\n```。",
"reasoning_content": null,
"role": "user"
},
{
"content": "通过使用数字 [3, 5, 7, 7, 9] 和运算符 ['+', '-', '*']，可以构造表达式 `(3 + ... | 24,586,459 | 124,586,459 | {
"closing_sequence": null,
"depth": null,
"difficulty": null,
"digit_map": null,
"dyck_sequence": null,
"error_indices": null,
"expression": null,
"expressions": null,
"fill_length": null,
"full_sequence": null,
"generation_error": null,
"generation_failed": null,
"generation_traceback": null... | game_of_24 | {
"completion_tokens": 3962,
"completion_tokens_details": null,
"prompt_tokens": 96,
"prompt_tokens_details": null,
"total_tokens": 4058
} |
[
{
"content": "Given: RTIRP + PRIRN = DDDIPR, where each letter represents a unique digit (RTIRP is a 5-digit number, PRIRN is a 5-digit number, and DDDIPR is a 6-digit number). Find the numeric equation that makes the equality valid. Please end your response in the last line with the following format: The answe... | 53,122,457 | 353,122,457 | {
"closing_sequence": null,
"depth": null,
"difficulty": null,
"digit_map": {
"A": null,
"B": null,
"C": null,
"D": 1,
"E": null,
"F": null,
"G": null,
"H": null,
"I": 0,
"J": null,
"K": null,
"L": null,
"M": null,
"N": 6,
"O": null,
"P": 7,
"Q... | cryptarithm | {
"completion_tokens": 4002,
"completion_tokens_details": null,
"prompt_tokens": 110,
"prompt_tokens_details": null,
"total_tokens": 4112
} |
[
{
"content": "Bracket Puzzle: What's missing at the start?\n\nGiven suffix: ⟩>[]}<>)]⟩)}]]⟩⟩>}\n\nSolve:\n1. Each closing bracket needs a matching opening bracket\n2. Add the minimal opening brackets to the left\n3. The final sequence must be properly nested\n\nPlease provide your final answer (the full balance... | 54,031,710 | 454,031,710 | {
"closing_sequence": null,
"depth": null,
"difficulty": null,
"digit_map": null,
"dyck_sequence": null,
"error_indices": null,
"expression": null,
"expressions": null,
"fill_length": 14,
"full_sequence": "{<⟨⟨[[{(⟨[({<⟨⟩>[]}<>)]⟩)}]]⟩⟩>}",
"generation_error": null,
"generation_failed": null,
... | dyck_language2 | {
"completion_tokens": 983,
"completion_tokens_details": null,
"prompt_tokens": 89,
"prompt_tokens_details": null,
"total_tokens": 1072
} |
[
{
"content": "评估以下每个表达式：\n\nA. (((1948年奥运会在伦敦举办。) and ((not (智利位于欧洲。)) or (not not (人类只使用了大脑的10%。)))) and ((((2 * 7 + -7 * -4) < (-17 - 6)) and ((1 + -20) == (-17 - -3))) and (泰坦尼克号沉没发生在1910年。))) or ((((1 ** 2) >= (-1 - -15)) and ((1916年是闰年。) and ((声音在真空中传播更快。) or (猪是哺乳动物。)))) or (((澳大利亚位于南美洲。) or ((22 % 9) < (... | 69,391,229 | 669,391,229 | {
"closing_sequence": null,
"depth": 5,
"difficulty": null,
"digit_map": null,
"dyck_sequence": null,
"error_indices": null,
"expression": null,
"expressions": [
[
"(((1948年奥运会在伦敦举办。) and ((not (智利位于欧洲。)) or (not not (人类只使用了大脑的10%。)))) and ((((2 * 7 + -7 * -4) < (-17 - 6)) and ((1 + -20) == (-... | boolean_expressions | {
"completion_tokens": 3837,
"completion_tokens_details": null,
"prompt_tokens": 1592,
"prompt_tokens_details": null,
"total_tokens": 5429
} |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 2