prompt stringlengths 144 465 | answer stringlengths 5 127 | metadata stringlengths 308 686 | task stringclasses 9
values | mode stringclasses 1
value | level int64 0 0 |
|---|---|---|---|---|---|
Generate one valid Dyck-4 balanced-bracket sequence of exactly 32 tokens.
Use tokens o0..ok for opens and c0..ck for matching closes. Return only the sequence. | o1 c1 o1 o0 o3 c3 o1 c1 c0 c1 o0 c0 o1 c1 o2 o2 c2 o3 o3 c3 c3 c2 o2 o3 o0 o3 o3 c3 c3 c0 c3 c2 | {'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0003204345703125, '_task': 'basic_procedural', '_level': 0, '_config': {'c': 1.0, 'level': 0, 'seed': None, 'size': None, 'task': 'mixed', 'seq_len': 32, 'vocab_size': 64, 'k': 4, 'p_open': 0.49, 'max_depth': 16}, '_prompt_tokens': 39, '_answer_tokens': 64} | dyck | instruct | 0 |
Reverse the sequence.
(SEQUENCE)
x45 x49 x64 x40 x5 x33 x32 x25 x36 x28 x47 x57 x40 x21 x13 x28 x63 x36 x39 x60 x60 x43 x17 x54 x20 x13 x30 x39 x15 x19 x18 x41 | x41 x18 x19 x15 x39 x30 x13 x20 x54 x17 x43 x60 x60 x39 x36 x63 x28 x13 x21 x40 x57 x47 x28 x36 x25 x32 x33 x5 x40 x64 x49 x45 | {'task': 'reverse', 'seq': ['x45', 'x49', 'x64', 'x40', 'x5', 'x33', 'x32', 'x25', 'x36', 'x28', 'x47', 'x57', 'x40', 'x21', 'x13', 'x28', 'x63', 'x36', 'x39', 'x60', 'x60', 'x43', 'x17', 'x54', 'x20', 'x13', 'x30', 'x39', 'x15', 'x19', 'x18', 'x41'], 'k': 4, 'n': 32, '_time': 0.00037741661071777344, '_task': 'basic_pr... | reverse | instruct | 0 |
Execute the stack operations. PUSH x pushes x. POP removes the top item. Return the final stack from top to bottom, or EMPTY if the stack is empty.
(OPERATIONS)
PUSH x10; PUSH x54; POP; POP; PUSH x8; PUSH x30; PUSH x12; PUSH x7; PUSH x29; PUSH x40; POP; PUSH x12; PUSH x18; PUSH x37; PUSH x55; PUSH x51; PUSH x62; PUSH x... | x51 x55 x37 x18 x12 x29 x7 x12 x30 x8 | {'task': 'stack', 'seq': ['PUSH x10', 'PUSH x54', 'POP', 'POP', 'PUSH x8', 'PUSH x30', 'PUSH x12', 'PUSH x7', 'PUSH x29', 'PUSH x40', 'POP', 'PUSH x12', 'PUSH x18', 'PUSH x37', 'PUSH x55', 'PUSH x51', 'PUSH x62', 'PUSH x56', 'POP', 'POP', 'PUSH x24', 'PUSH x40', 'PUSH x14', 'POP', 'PUSH x64', 'PUSH x36', 'POP', 'PUSH x... | stack | instruct | 0 |
Return the ordered union of the two sequences: keep each token the first time it appears while scanning A then B.
(A)
x39 x4 x63 x7 x62 x36 x16 x6 x32 x21 x55 x28 x25 x63 x33 x17
(B)
x28 x20 x50 x10 x59 x19 x60 x17 x20 x12 x32 x43 x43 x61 x13 x19 | x39 x4 x63 x7 x62 x36 x16 x6 x32 x21 x55 x28 x25 x33 x17 x20 x50 x10 x59 x19 x60 x12 x43 x61 x13 | {'task': 'union', 'seq': [['x39', 'x4', 'x63', 'x7', 'x62', 'x36', 'x16', 'x6', 'x32', 'x21', 'x55', 'x28', 'x25', 'x63', 'x33', 'x17'], ['x28', 'x20', 'x50', 'x10', 'x59', 'x19', 'x60', 'x17', 'x20', 'x12', 'x32', 'x43', 'x43', 'x61', 'x13', 'x19']], 'k': 4, 'n': 32, '_time': 0.00042891502380371094, '_task': 'basic_pr... | union | instruct | 0 |
Copy the sequence exactly.
(SEQUENCE)
x13 x3 x32 x51 x41 x60 x63 x57 x32 x61 x3 x61 x47 x12 x3 x10 x43 x44 x61 x32 x57 x18 x61 x50 x19 x58 x13 x12 x60 x59 x2 x23 | x13 x3 x32 x51 x41 x60 x63 x57 x32 x61 x3 x61 x47 x12 x3 x10 x43 x44 x61 x32 x57 x18 x61 x50 x19 x58 x13 x12 x60 x59 x2 x23 | {'task': 'identity', 'seq': ['x13', 'x3', 'x32', 'x51', 'x41', 'x60', 'x63', 'x57', 'x32', 'x61', 'x3', 'x61', 'x47', 'x12', 'x3', 'x10', 'x43', 'x44', 'x61', 'x32', 'x57', 'x18', 'x61', 'x50', 'x19', 'x58', 'x13', 'x12', 'x60', 'x59', 'x2', 'x23'], 'k': 4, 'n': 32, '_time': 0.00035881996154785156, '_task': 'basic_proc... | identity | instruct | 0 |
Sort the sequence in ascending numeric order, where x2 < x10.
(SEQUENCE)
x37 x11 x23 x43 x29 x46 x8 x11 x47 x35 x54 x64 x59 x28 x25 x45 x26 x18 x4 x5 x56 x15 x3 x7 x50 x25 x26 x23 x10 x37 x26 x1 | x1 x3 x4 x5 x7 x8 x10 x11 x11 x15 x18 x23 x23 x25 x25 x26 x26 x26 x28 x29 x35 x37 x37 x43 x45 x46 x47 x50 x54 x56 x59 x64 | {'task': 'sort', 'seq': ['x37', 'x11', 'x23', 'x43', 'x29', 'x46', 'x8', 'x11', 'x47', 'x35', 'x54', 'x64', 'x59', 'x28', 'x25', 'x45', 'x26', 'x18', 'x4', 'x5', 'x56', 'x15', 'x3', 'x7', 'x50', 'x25', 'x26', 'x23', 'x10', 'x37', 'x26', 'x1'], 'k': 4, 'n': 32, '_time': 0.0004425048828125, '_task': 'basic_procedural', '... | sort | instruct | 0 |
Reverse the sequence.
(SEQUENCE)
x2 x28 x47 x58 x14 x26 x25 x50 x44 x37 x44 x1 x40 x34 x42 x2 x51 x39 x39 x24 x47 x60 x9 x13 x16 x38 x57 x11 x47 x19 x42 x10 | x10 x42 x19 x47 x11 x57 x38 x16 x13 x9 x60 x47 x24 x39 x39 x51 x2 x42 x34 x40 x1 x44 x37 x44 x50 x25 x26 x14 x58 x47 x28 x2 | {'task': 'reverse', 'seq': ['x2', 'x28', 'x47', 'x58', 'x14', 'x26', 'x25', 'x50', 'x44', 'x37', 'x44', 'x1', 'x40', 'x34', 'x42', 'x2', 'x51', 'x39', 'x39', 'x24', 'x47', 'x60', 'x9', 'x13', 'x16', 'x38', 'x57', 'x11', 'x47', 'x19', 'x42', 'x10'], 'k': 4, 'n': 32, '_time': 0.0003521442413330078, '_task': 'basic_proced... | reverse | instruct | 0 |
Return the unique elements of the sequence in order of first appearance.
(SEQUENCE)
x27 x23 x47 x14 x49 x29 x53 x50 x64 x27 x25 x47 x59 x64 x7 x45 x38 x44 x6 x10 x22 x8 x45 x18 x16 x23 x5 x32 x28 x35 x59 x2 | x27 x23 x47 x14 x49 x29 x53 x50 x64 x25 x59 x7 x45 x38 x44 x6 x10 x22 x8 x18 x16 x5 x32 x28 x35 x2 | {'task': 'set', 'seq': ['x27', 'x23', 'x47', 'x14', 'x49', 'x29', 'x53', 'x50', 'x64', 'x27', 'x25', 'x47', 'x59', 'x64', 'x7', 'x45', 'x38', 'x44', 'x6', 'x10', 'x22', 'x8', 'x45', 'x18', 'x16', 'x23', 'x5', 'x32', 'x28', 'x35', 'x59', 'x2'], 'k': 4, 'n': 32, '_time': 0.0004220008850097656, '_task': 'basic_procedural'... | set | instruct | 0 |
Delete the first occurrence of TARGET from SEQUENCE. If TARGET is absent, return SEQUENCE unchanged.
(SEQUENCE)
x28 x17 x37 x29 x52 x49 x18 x6 x48 x63 x10 x37 x56 x38 x4 x47 x63 x62 x58 x61 x49 x2 x57 x21 x23 x36 x30 x25 x40 x52 x54 x29
(TARGET)
x4 | x28 x17 x37 x29 x52 x49 x18 x6 x48 x63 x10 x37 x56 x38 x47 x63 x62 x58 x61 x49 x2 x57 x21 x23 x36 x30 x25 x40 x52 x54 x29 | {'task': 'delete', 'seq': [['x28', 'x17', 'x37', 'x29', 'x52', 'x49', 'x18', 'x6', 'x48', 'x63', 'x10', 'x37', 'x56', 'x38', 'x4', 'x47', 'x63', 'x62', 'x58', 'x61', 'x49', 'x2', 'x57', 'x21', 'x23', 'x36', 'x30', 'x25', 'x40', 'x52', 'x54', 'x29'], 'x4'], 'k': 4, 'n': 32, '_time': 0.00044155120849609375, '_task': 'bas... | delete | instruct | 0 |
Generate one valid shuffle-Dyck-4 sequence of exactly 32 tokens. Each close ci must match a previously opened oi of the same type, but closing order may be interleaved across types. Return only the sequence. | o0 o0 c0 o3 o3 c3 c0 c3 o0 o3 o2 c0 o1 o0 c1 c0 c2 o3 c3 o0 c3 o3 o0 c3 c0 c0 o3 c3 o2 o2 c2 c2 | {'task': 'dyck_shuffle', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0004353523254394531, '_task': 'basic_procedural', '_level': 0, '_config': {'c': 1.0, 'level': 0, 'seed': None, 'size': None, 'task': 'mixed', 'seq_len': 32, 'vocab_size': 64, 'k': 4, 'p_open': 0.49, 'max_depth': 16}, '_prompt_tokens': 46, '_answer_tokens':... | dyck_shuffle | instruct | 0 |
Return the ordered union of the two sequences: keep each token the first time it appears while scanning A then B.
(A)
x57 x57 x4 x8 x50 x10 x28 x43 x26 x53 x10 x3 x60 x53 x11 x27
(B)
x51 x29 x19 x56 x34 x24 x44 x57 x54 x9 x14 x9 x41 x59 x26 x28 | x57 x4 x8 x50 x10 x28 x43 x26 x53 x3 x60 x11 x27 x51 x29 x19 x56 x34 x24 x44 x54 x9 x14 x41 x59 | {'task': 'union', 'seq': [['x57', 'x57', 'x4', 'x8', 'x50', 'x10', 'x28', 'x43', 'x26', 'x53', 'x10', 'x3', 'x60', 'x53', 'x11', 'x27'], ['x51', 'x29', 'x19', 'x56', 'x34', 'x24', 'x44', 'x57', 'x54', 'x9', 'x14', 'x9', 'x41', 'x59', 'x26', 'x28']], 'k': 4, 'n': 32, '_time': 0.00038695335388183594, '_task': 'basic_proc... | union | instruct | 0 |
Delete the first occurrence of TARGET from SEQUENCE. If TARGET is absent, return SEQUENCE unchanged.
(SEQUENCE)
x25 x59 x37 x21 x45 x18 x47 x42 x38 x49 x21 x34 x26 x40 x48 x55 x30 x23 x44 x23 x31 x55 x59 x5 x31 x3 x37 x34 x26 x20 x59 x22
(TARGET)
x3 | x25 x59 x37 x21 x45 x18 x47 x42 x38 x49 x21 x34 x26 x40 x48 x55 x30 x23 x44 x23 x31 x55 x59 x5 x31 x37 x34 x26 x20 x59 x22 | {'task': 'delete', 'seq': [['x25', 'x59', 'x37', 'x21', 'x45', 'x18', 'x47', 'x42', 'x38', 'x49', 'x21', 'x34', 'x26', 'x40', 'x48', 'x55', 'x30', 'x23', 'x44', 'x23', 'x31', 'x55', 'x59', 'x5', 'x31', 'x3', 'x37', 'x34', 'x26', 'x20', 'x59', 'x22'], 'x3'], 'k': 4, 'n': 32, '_time': 0.00043392181396484375, '_task': 'ba... | delete | instruct | 0 |
Generate one valid shuffle-Dyck-4 sequence of exactly 32 tokens. Each close ci must match a previously opened oi of the same type, but closing order may be interleaved across types. Return only the sequence. | o1 c1 o2 c2 o0 c0 o2 o1 c1 o0 c2 c0 o0 c0 o1 o2 c1 c2 o2 o3 c3 o2 c2 o1 o1 c2 o0 c0 o1 c1 c1 c1 | {'task': 'dyck_shuffle', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0004477500915527344, '_task': 'basic_procedural', '_level': 0, '_config': {'c': 1.0, 'level': 0, 'seed': None, 'size': None, 'task': 'mixed', 'seq_len': 32, 'vocab_size': 64, 'k': 4, 'p_open': 0.49, 'max_depth': 16}, '_prompt_tokens': 46, '_answer_tokens':... | dyck_shuffle | instruct | 0 |
Delete the first occurrence of TARGET from SEQUENCE. If TARGET is absent, return SEQUENCE unchanged.
(SEQUENCE)
x24 x26 x51 x50 x24 x43 x16 x42 x5 x51 x25 x32 x25 x18 x17 x46 x14 x49 x53 x43 x36 x11 x3 x5 x49 x23 x5 x37 x34 x20 x26 x37
(TARGET)
x36 | x24 x26 x51 x50 x24 x43 x16 x42 x5 x51 x25 x32 x25 x18 x17 x46 x14 x49 x53 x43 x11 x3 x5 x49 x23 x5 x37 x34 x20 x26 x37 | {'task': 'delete', 'seq': [['x24', 'x26', 'x51', 'x50', 'x24', 'x43', 'x16', 'x42', 'x5', 'x51', 'x25', 'x32', 'x25', 'x18', 'x17', 'x46', 'x14', 'x49', 'x53', 'x43', 'x36', 'x11', 'x3', 'x5', 'x49', 'x23', 'x5', 'x37', 'x34', 'x20', 'x26', 'x37'], 'x36'], 'k': 4, 'n': 32, '_time': 0.000370025634765625, '_task': 'basic... | delete | instruct | 0 |
Return the ordered union of the two sequences: keep each token the first time it appears while scanning A then B.
(A)
x7 x35 x24 x19 x33 x42 x43 x11 x57 x26 x62 x16 x48 x41 x26 x37
(B)
x62 x51 x5 x22 x44 x32 x21 x3 x38 x36 x50 x41 x15 x62 x58 x37 | x7 x35 x24 x19 x33 x42 x43 x11 x57 x26 x62 x16 x48 x41 x37 x51 x5 x22 x44 x32 x21 x3 x38 x36 x50 x15 x58 | {'task': 'union', 'seq': [['x7', 'x35', 'x24', 'x19', 'x33', 'x42', 'x43', 'x11', 'x57', 'x26', 'x62', 'x16', 'x48', 'x41', 'x26', 'x37'], ['x62', 'x51', 'x5', 'x22', 'x44', 'x32', 'x21', 'x3', 'x38', 'x36', 'x50', 'x41', 'x15', 'x62', 'x58', 'x37']], 'k': 4, 'n': 32, '_time': 0.0003752708435058594, '_task': 'basic_pro... | union | instruct | 0 |
Return the unique elements of the sequence in order of first appearance.
(SEQUENCE)
x20 x63 x52 x2 x15 x14 x12 x6 x6 x25 x14 x6 x39 x23 x44 x16 x60 x1 x34 x56 x18 x1 x34 x34 x17 x24 x55 x37 x30 x49 x26 x1 | x20 x63 x52 x2 x15 x14 x12 x6 x25 x39 x23 x44 x16 x60 x1 x34 x56 x18 x17 x24 x55 x37 x30 x49 x26 | {'task': 'set', 'seq': ['x20', 'x63', 'x52', 'x2', 'x15', 'x14', 'x12', 'x6', 'x6', 'x25', 'x14', 'x6', 'x39', 'x23', 'x44', 'x16', 'x60', 'x1', 'x34', 'x56', 'x18', 'x1', 'x34', 'x34', 'x17', 'x24', 'x55', 'x37', 'x30', 'x49', 'x26', 'x1'], 'k': 4, 'n': 32, '_time': 0.0004191398620605469, '_task': 'basic_procedural', ... | set | instruct | 0 |
Copy the sequence exactly.
(SEQUENCE)
x28 x31 x48 x49 x5 x37 x6 x31 x23 x50 x27 x38 x27 x14 x19 x59 x50 x50 x6 x62 x29 x5 x23 x37 x57 x3 x38 x40 x14 x38 x32 x34 | x28 x31 x48 x49 x5 x37 x6 x31 x23 x50 x27 x38 x27 x14 x19 x59 x50 x50 x6 x62 x29 x5 x23 x37 x57 x3 x38 x40 x14 x38 x32 x34 | {'task': 'identity', 'seq': ['x28', 'x31', 'x48', 'x49', 'x5', 'x37', 'x6', 'x31', 'x23', 'x50', 'x27', 'x38', 'x27', 'x14', 'x19', 'x59', 'x50', 'x50', 'x6', 'x62', 'x29', 'x5', 'x23', 'x37', 'x57', 'x3', 'x38', 'x40', 'x14', 'x38', 'x32', 'x34'], 'k': 4, 'n': 32, '_time': 0.0003573894500732422, '_task': 'basic_proced... | identity | instruct | 0 |
Return the ordered union of the two sequences: keep each token the first time it appears while scanning A then B.
(A)
x24 x10 x41 x29 x8 x3 x17 x20 x61 x8 x8 x13 x62 x54 x10 x64
(B)
x37 x57 x55 x46 x7 x8 x34 x26 x12 x37 x57 x9 x19 x2 x38 x39 | x24 x10 x41 x29 x8 x3 x17 x20 x61 x13 x62 x54 x64 x37 x57 x55 x46 x7 x34 x26 x12 x9 x19 x2 x38 x39 | {'task': 'union', 'seq': [['x24', 'x10', 'x41', 'x29', 'x8', 'x3', 'x17', 'x20', 'x61', 'x8', 'x8', 'x13', 'x62', 'x54', 'x10', 'x64'], ['x37', 'x57', 'x55', 'x46', 'x7', 'x8', 'x34', 'x26', 'x12', 'x37', 'x57', 'x9', 'x19', 'x2', 'x38', 'x39']], 'k': 4, 'n': 32, '_time': 0.0003571510314941406, '_task': 'basic_procedur... | union | instruct | 0 |
Execute the stack operations. PUSH x pushes x. POP removes the top item. Return the final stack from top to bottom, or EMPTY if the stack is empty.
(OPERATIONS)
PUSH x58; PUSH x51; POP; PUSH x61; PUSH x47; POP; POP; PUSH x58; PUSH x25; PUSH x19; POP; PUSH x34; PUSH x27; PUSH x47; POP; POP; PUSH x8; PUSH x61; PUSH x32; ... | x34 x25 x58 x58 | {'task': 'stack', 'seq': ['PUSH x58', 'PUSH x51', 'POP', 'PUSH x61', 'PUSH x47', 'POP', 'POP', 'PUSH x58', 'PUSH x25', 'PUSH x19', 'POP', 'PUSH x34', 'PUSH x27', 'PUSH x47', 'POP', 'POP', 'PUSH x8', 'PUSH x61', 'PUSH x32', 'PUSH x44', 'PUSH x33', 'PUSH x62', 'POP', 'POP', 'POP', 'POP', 'POP', 'PUSH x39', 'PUSH x5', 'PO... | stack | instruct | 0 |
Generate one valid shuffle-Dyck-4 sequence of exactly 32 tokens. Each close ci must match a previously opened oi of the same type, but closing order may be interleaved across types. Return only the sequence. | o1 c1 o2 c2 o2 o1 o1 c2 o3 c1 o0 o2 c0 o2 c1 o3 o0 c0 o2 o0 o3 o3 o1 c1 c3 c3 c0 c3 c2 c3 c2 c2 | {'task': 'dyck_shuffle', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0004467964172363281, '_task': 'basic_procedural', '_level': 0, '_config': {'c': 1.0, 'level': 0, 'seed': None, 'size': None, 'task': 'mixed', 'seq_len': 32, 'vocab_size': 64, 'k': 4, 'p_open': 0.49, 'max_depth': 16}, '_prompt_tokens': 46, '_answer_tokens':... | dyck_shuffle | instruct | 0 |
Reverse the sequence.
(SEQUENCE)
x19 x7 x26 x14 x33 x62 x53 x15 x9 x10 x34 x18 x12 x41 x9 x27 x29 x26 x44 x64 x20 x64 x11 x37 x44 x7 x52 x42 x61 x11 x29 x9 | x9 x29 x11 x61 x42 x52 x7 x44 x37 x11 x64 x20 x64 x44 x26 x29 x27 x9 x41 x12 x18 x34 x10 x9 x15 x53 x62 x33 x14 x26 x7 x19 | {'task': 'reverse', 'seq': ['x19', 'x7', 'x26', 'x14', 'x33', 'x62', 'x53', 'x15', 'x9', 'x10', 'x34', 'x18', 'x12', 'x41', 'x9', 'x27', 'x29', 'x26', 'x44', 'x64', 'x20', 'x64', 'x11', 'x37', 'x44', 'x7', 'x52', 'x42', 'x61', 'x11', 'x29', 'x9'], 'k': 4, 'n': 32, '_time': 0.0004107952117919922, '_task': 'basic_procedu... | reverse | instruct | 0 |
Reverse the sequence.
(SEQUENCE)
x10 x49 x54 x62 x11 x55 x28 x30 x3 x13 x58 x46 x29 x55 x28 x43 x36 x29 x62 x18 x5 x36 x3 x14 x24 x47 x54 x42 x15 x31 x23 x62 | x62 x23 x31 x15 x42 x54 x47 x24 x14 x3 x36 x5 x18 x62 x29 x36 x43 x28 x55 x29 x46 x58 x13 x3 x30 x28 x55 x11 x62 x54 x49 x10 | {'task': 'reverse', 'seq': ['x10', 'x49', 'x54', 'x62', 'x11', 'x55', 'x28', 'x30', 'x3', 'x13', 'x58', 'x46', 'x29', 'x55', 'x28', 'x43', 'x36', 'x29', 'x62', 'x18', 'x5', 'x36', 'x3', 'x14', 'x24', 'x47', 'x54', 'x42', 'x15', 'x31', 'x23', 'x62'], 'k': 4, 'n': 32, '_time': 0.00035309791564941406, '_task': 'basic_proc... | reverse | instruct | 0 |
Sort the sequence in ascending numeric order, where x2 < x10.
(SEQUENCE)
x35 x35 x33 x51 x42 x62 x32 x39 x41 x22 x5 x36 x53 x20 x44 x48 x22 x51 x23 x30 x35 x55 x29 x32 x46 x11 x27 x33 x47 x43 x13 x56 | x5 x11 x13 x20 x22 x22 x23 x27 x29 x30 x32 x32 x33 x33 x35 x35 x35 x36 x39 x41 x42 x43 x44 x46 x47 x48 x51 x51 x53 x55 x56 x62 | {'task': 'sort', 'seq': ['x35', 'x35', 'x33', 'x51', 'x42', 'x62', 'x32', 'x39', 'x41', 'x22', 'x5', 'x36', 'x53', 'x20', 'x44', 'x48', 'x22', 'x51', 'x23', 'x30', 'x35', 'x55', 'x29', 'x32', 'x46', 'x11', 'x27', 'x33', 'x47', 'x43', 'x13', 'x56'], 'k': 4, 'n': 32, '_time': 0.00034499168395996094, '_task': 'basic_proce... | sort | instruct | 0 |
Generate one valid Dyck-4 balanced-bracket sequence of exactly 32 tokens.
Use tokens o0..ok for opens and c0..ck for matching closes. Return only the sequence. | o1 o3 c3 c1 o1 c1 o1 o3 o0 o3 c3 o0 o1 o0 c0 o2 o2 c2 o0 o2 c2 o0 c0 o3 c3 c0 c2 c1 c0 c0 c3 c1 | {'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.00038361549377441406, '_task': 'basic_procedural', '_level': 0, '_config': {'c': 1.0, 'level': 0, 'seed': None, 'size': None, 'task': 'mixed', 'seq_len': 32, 'vocab_size': 64, 'k': 4, 'p_open': 0.49, 'max_depth': 16}, '_prompt_tokens': 39, '_answer_tokens': 64} | dyck | instruct | 0 |
Generate one valid Dyck-4 balanced-bracket sequence of exactly 32 tokens.
Use tokens o0..ok for opens and c0..ck for matching closes. Return only the sequence. | o2 o3 c3 c2 o1 o2 c2 c1 o2 c2 o0 o1 o0 o0 c0 o1 c1 c0 o3 c3 c1 o1 o3 c3 o3 c3 o1 o2 c2 c1 c1 c0 | {'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.00038361549377441406, '_task': 'basic_procedural', '_level': 0, '_config': {'c': 1.0, 'level': 0, 'seed': None, 'size': None, 'task': 'mixed', 'seq_len': 32, 'vocab_size': 64, 'k': 4, 'p_open': 0.49, 'max_depth': 16}, '_prompt_tokens': 39, '_answer_tokens': 64} | dyck | instruct | 0 |
Generate one valid shuffle-Dyck-4 sequence of exactly 32 tokens. Each close ci must match a previously opened oi of the same type, but closing order may be interleaved across types. Return only the sequence. | o3 o3 o2 o3 c2 c3 o3 c3 o2 o2 c3 o3 o3 c3 c3 o0 c3 o1 o1 c2 o3 c3 o1 o2 c2 o3 c0 c3 c2 c1 c1 c1 | {'task': 'dyck_shuffle', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0003485679626464844, '_task': 'basic_procedural', '_level': 0, '_config': {'c': 1.0, 'level': 0, 'seed': None, 'size': None, 'task': 'mixed', 'seq_len': 32, 'vocab_size': 64, 'k': 4, 'p_open': 0.49, 'max_depth': 16}, '_prompt_tokens': 46, '_answer_tokens':... | dyck_shuffle | instruct | 0 |
Sort the sequence in ascending numeric order, where x2 < x10.
(SEQUENCE)
x7 x18 x22 x8 x11 x43 x23 x37 x14 x16 x59 x25 x64 x25 x51 x21 x52 x47 x25 x5 x5 x64 x47 x53 x37 x41 x7 x55 x11 x25 x6 x15 | x5 x5 x6 x7 x7 x8 x11 x11 x14 x15 x16 x18 x21 x22 x23 x25 x25 x25 x25 x37 x37 x41 x43 x47 x47 x51 x52 x53 x55 x59 x64 x64 | {'task': 'sort', 'seq': ['x7', 'x18', 'x22', 'x8', 'x11', 'x43', 'x23', 'x37', 'x14', 'x16', 'x59', 'x25', 'x64', 'x25', 'x51', 'x21', 'x52', 'x47', 'x25', 'x5', 'x5', 'x64', 'x47', 'x53', 'x37', 'x41', 'x7', 'x55', 'x11', 'x25', 'x6', 'x15'], 'k': 4, 'n': 32, '_time': 0.0003197193145751953, '_task': 'basic_procedural'... | sort | instruct | 0 |
Generate one valid Dyck-4 balanced-bracket sequence of exactly 32 tokens.
Use tokens o0..ok for opens and c0..ck for matching closes. Return only the sequence. | o3 o3 c3 c3 o2 c2 o3 c3 o0 o3 c3 o3 o2 o1 o3 c3 o2 c2 c1 c2 c3 o0 c0 o3 o0 c0 o1 o0 c0 c1 c3 c0 | {'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.00038361549377441406, '_task': 'basic_procedural', '_level': 0, '_config': {'c': 1.0, 'level': 0, 'seed': None, 'size': None, 'task': 'mixed', 'seq_len': 32, 'vocab_size': 64, 'k': 4, 'p_open': 0.49, 'max_depth': 16}, '_prompt_tokens': 39, '_answer_tokens': 64} | dyck | instruct | 0 |
Execute the stack operations. PUSH x pushes x. POP removes the top item. Return the final stack from top to bottom, or EMPTY if the stack is empty.
(OPERATIONS)
PUSH x1; POP; PUSH x51; PUSH x36; PUSH x23; PUSH x62; PUSH x20; POP; PUSH x42; PUSH x6; PUSH x46; PUSH x56; PUSH x10; PUSH x4; PUSH x57; PUSH x4; PUSH x57; POP... | x56 x46 x6 x42 x62 x23 x36 x51 | {'task': 'stack', 'seq': ['PUSH x1', 'POP', 'PUSH x51', 'PUSH x36', 'PUSH x23', 'PUSH x62', 'PUSH x20', 'POP', 'PUSH x42', 'PUSH x6', 'PUSH x46', 'PUSH x56', 'PUSH x10', 'PUSH x4', 'PUSH x57', 'PUSH x4', 'PUSH x57', 'POP', 'PUSH x13', 'PUSH x34', 'PUSH x7', 'PUSH x3', 'POP', 'POP', 'POP', 'PUSH x28', 'POP', 'POP', 'POP... | stack | instruct | 0 |
Delete the first occurrence of TARGET from SEQUENCE. If TARGET is absent, return SEQUENCE unchanged.
(SEQUENCE)
x57 x23 x56 x7 x40 x24 x11 x14 x12 x23 x48 x13 x32 x62 x15 x27 x62 x30 x61 x10 x61 x31 x33 x44 x22 x61 x52 x36 x49 x45 x15 x6
(TARGET)
x31 | x57 x23 x56 x7 x40 x24 x11 x14 x12 x23 x48 x13 x32 x62 x15 x27 x62 x30 x61 x10 x61 x33 x44 x22 x61 x52 x36 x49 x45 x15 x6 | {'task': 'delete', 'seq': [['x57', 'x23', 'x56', 'x7', 'x40', 'x24', 'x11', 'x14', 'x12', 'x23', 'x48', 'x13', 'x32', 'x62', 'x15', 'x27', 'x62', 'x30', 'x61', 'x10', 'x61', 'x31', 'x33', 'x44', 'x22', 'x61', 'x52', 'x36', 'x49', 'x45', 'x15', 'x6'], 'x31'], 'k': 4, 'n': 32, '_time': 0.0004353523254394531, '_task': 'ba... | delete | instruct | 0 |
Execute the stack operations. PUSH x pushes x. POP removes the top item. Return the final stack from top to bottom, or EMPTY if the stack is empty.
(OPERATIONS)
PUSH x16; PUSH x57; POP; PUSH x13; PUSH x25; PUSH x3; PUSH x5; POP; POP; PUSH x64; PUSH x1; POP; POP; PUSH x64; POP; PUSH x33; POP; PUSH x12; PUSH x5; PUSH x26... | EMPTY | {'task': 'stack', 'seq': ['PUSH x16', 'PUSH x57', 'POP', 'PUSH x13', 'PUSH x25', 'PUSH x3', 'PUSH x5', 'POP', 'POP', 'PUSH x64', 'PUSH x1', 'POP', 'POP', 'PUSH x64', 'POP', 'PUSH x33', 'POP', 'PUSH x12', 'PUSH x5', 'PUSH x26', 'POP', 'POP', 'POP', 'POP', 'PUSH x32', 'POP', 'POP', 'POP', 'PUSH x64', 'POP', 'PUSH x19', '... | stack | instruct | 0 |
Copy the sequence exactly.
(SEQUENCE)
x44 x50 x28 x10 x30 x2 x46 x30 x4 x34 x63 x62 x16 x5 x22 x58 x14 x20 x62 x61 x18 x51 x47 x52 x29 x50 x59 x10 x43 x46 x49 x23 | x44 x50 x28 x10 x30 x2 x46 x30 x4 x34 x63 x62 x16 x5 x22 x58 x14 x20 x62 x61 x18 x51 x47 x52 x29 x50 x59 x10 x43 x46 x49 x23 | {'task': 'identity', 'seq': ['x44', 'x50', 'x28', 'x10', 'x30', 'x2', 'x46', 'x30', 'x4', 'x34', 'x63', 'x62', 'x16', 'x5', 'x22', 'x58', 'x14', 'x20', 'x62', 'x61', 'x18', 'x51', 'x47', 'x52', 'x29', 'x50', 'x59', 'x10', 'x43', 'x46', 'x49', 'x23'], 'k': 4, 'n': 32, '_time': 0.00031638145446777344, '_task': 'basic_pro... | identity | instruct | 0 |
Reverse the sequence.
(SEQUENCE)
x45 x30 x63 x27 x43 x43 x12 x16 x2 x17 x24 x64 x29 x21 x55 x60 x18 x60 x23 x56 x36 x25 x31 x29 x28 x4 x11 x52 x64 x47 x42 x49 | x49 x42 x47 x64 x52 x11 x4 x28 x29 x31 x25 x36 x56 x23 x60 x18 x60 x55 x21 x29 x64 x24 x17 x2 x16 x12 x43 x43 x27 x63 x30 x45 | {'task': 'reverse', 'seq': ['x45', 'x30', 'x63', 'x27', 'x43', 'x43', 'x12', 'x16', 'x2', 'x17', 'x24', 'x64', 'x29', 'x21', 'x55', 'x60', 'x18', 'x60', 'x23', 'x56', 'x36', 'x25', 'x31', 'x29', 'x28', 'x4', 'x11', 'x52', 'x64', 'x47', 'x42', 'x49'], 'k': 4, 'n': 32, '_time': 0.00041294097900390625, '_task': 'basic_pro... | reverse | instruct | 0 |
Generate one valid Dyck-4 balanced-bracket sequence of exactly 32 tokens.
Use tokens o0..ok for opens and c0..ck for matching closes. Return only the sequence. | o2 c2 o1 o3 c3 c1 o1 o2 c2 o0 o2 o0 o3 c3 c0 c2 c0 c1 o2 o3 c3 o1 c1 c2 o1 c1 o2 c2 o3 c3 o2 c2 | {'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0003840923309326172, '_task': 'basic_procedural', '_level': 0, '_config': {'c': 1.0, 'level': 0, 'seed': None, 'size': None, 'task': 'mixed', 'seq_len': 32, 'vocab_size': 64, 'k': 4, 'p_open': 0.49, 'max_depth': 16}, '_prompt_tokens': 39, '_answer_tokens': 64} | dyck | instruct | 0 |
Generate one valid shuffle-Dyck-4 sequence of exactly 32 tokens. Each close ci must match a previously opened oi of the same type, but closing order may be interleaved across types. Return only the sequence. | o3 o3 c3 c3 o1 o2 o3 o1 o3 c3 o2 o3 c1 c3 c1 o0 c0 o1 c2 o1 c3 c2 c1 o3 c1 c3 o3 c3 o1 c1 o2 c2 | {'task': 'dyck_shuffle', 'seq': [], 'k': 4, 'n': 32, '_time': 0.00044846534729003906, '_task': 'basic_procedural', '_level': 0, '_config': {'c': 1.0, 'level': 0, 'seed': None, 'size': None, 'task': 'mixed', 'seq_len': 32, 'vocab_size': 64, 'k': 4, 'p_open': 0.49, 'max_depth': 16}, '_prompt_tokens': 46, '_answer_tokens'... | dyck_shuffle | instruct | 0 |
Generate one valid shuffle-Dyck-4 sequence of exactly 32 tokens. Each close ci must match a previously opened oi of the same type, but closing order may be interleaved across types. Return only the sequence. | o1 c1 o2 c2 o2 c2 o1 o1 c1 o3 o0 o0 o1 o0 c3 c0 c0 o0 o0 c1 c0 o2 o0 o2 c1 o0 c0 c2 c0 c0 c2 c0 | {'task': 'dyck_shuffle', 'seq': [], 'k': 4, 'n': 32, '_time': 0.00044727325439453125, '_task': 'basic_procedural', '_level': 0, '_config': {'c': 1.0, 'level': 0, 'seed': None, 'size': None, 'task': 'mixed', 'seq_len': 32, 'vocab_size': 64, 'k': 4, 'p_open': 0.49, 'max_depth': 16}, '_prompt_tokens': 46, '_answer_tokens'... | dyck_shuffle | instruct | 0 |
Return the ordered union of the two sequences: keep each token the first time it appears while scanning A then B.
(A)
x59 x38 x58 x48 x53 x14 x21 x15 x37 x33 x5 x39 x28 x44 x25 x2
(B)
x25 x54 x10 x42 x41 x61 x53 x59 x20 x6 x4 x1 x31 x38 x35 x23 | x59 x38 x58 x48 x53 x14 x21 x15 x37 x33 x5 x39 x28 x44 x25 x2 x54 x10 x42 x41 x61 x20 x6 x4 x1 x31 x35 x23 | {'task': 'union', 'seq': [['x59', 'x38', 'x58', 'x48', 'x53', 'x14', 'x21', 'x15', 'x37', 'x33', 'x5', 'x39', 'x28', 'x44', 'x25', 'x2'], ['x25', 'x54', 'x10', 'x42', 'x41', 'x61', 'x53', 'x59', 'x20', 'x6', 'x4', 'x1', 'x31', 'x38', 'x35', 'x23']], 'k': 4, 'n': 32, '_time': 0.0004749298095703125, '_task': 'basic_proce... | union | instruct | 0 |
Execute the stack operations. PUSH x pushes x. POP removes the top item. Return the final stack from top to bottom, or EMPTY if the stack is empty.
(OPERATIONS)
PUSH x32; PUSH x21; PUSH x53; PUSH x12; POP; PUSH x12; POP; PUSH x11; PUSH x55; PUSH x44; POP; PUSH x29; PUSH x15; PUSH x55; PUSH x26; PUSH x27; PUSH x47; PUSH... | x29 x55 x11 x53 x21 x32 | {'task': 'stack', 'seq': ['PUSH x32', 'PUSH x21', 'PUSH x53', 'PUSH x12', 'POP', 'PUSH x12', 'POP', 'PUSH x11', 'PUSH x55', 'PUSH x44', 'POP', 'PUSH x29', 'PUSH x15', 'PUSH x55', 'PUSH x26', 'PUSH x27', 'PUSH x47', 'PUSH x15', 'PUSH x28', 'PUSH x12', 'PUSH x30', 'POP', 'POP', 'POP', 'POP', 'POP', 'POP', 'PUSH x64', 'PO... | stack | instruct | 0 |
Execute the stack operations. PUSH x pushes x. POP removes the top item. Return the final stack from top to bottom, or EMPTY if the stack is empty.
(OPERATIONS)
PUSH x22; PUSH x11; PUSH x63; PUSH x35; POP; PUSH x59; PUSH x58; POP; PUSH x57; PUSH x56; PUSH x34; PUSH x6; POP; POP; PUSH x54; PUSH x36; PUSH x54; PUSH x21; ... | x36 x54 x56 x57 x59 x63 x11 x22 | {'task': 'stack', 'seq': ['PUSH x22', 'PUSH x11', 'PUSH x63', 'PUSH x35', 'POP', 'PUSH x59', 'PUSH x58', 'POP', 'PUSH x57', 'PUSH x56', 'PUSH x34', 'PUSH x6', 'POP', 'POP', 'PUSH x54', 'PUSH x36', 'PUSH x54', 'PUSH x21', 'PUSH x52', 'PUSH x2', 'PUSH x6', 'PUSH x25', 'POP', 'PUSH x2', 'POP', 'POP', 'POP', 'POP', 'PUSH x... | stack | instruct | 0 |
Sort the sequence in ascending numeric order, where x2 < x10.
(SEQUENCE)
x21 x13 x49 x12 x44 x2 x19 x7 x39 x11 x25 x51 x51 x23 x40 x28 x38 x51 x54 x22 x38 x2 x52 x9 x53 x62 x24 x10 x40 x32 x24 x11 | x2 x2 x7 x9 x10 x11 x11 x12 x13 x19 x21 x22 x23 x24 x24 x25 x28 x32 x38 x38 x39 x40 x40 x44 x49 x51 x51 x51 x52 x53 x54 x62 | {'task': 'sort', 'seq': ['x21', 'x13', 'x49', 'x12', 'x44', 'x2', 'x19', 'x7', 'x39', 'x11', 'x25', 'x51', 'x51', 'x23', 'x40', 'x28', 'x38', 'x51', 'x54', 'x22', 'x38', 'x2', 'x52', 'x9', 'x53', 'x62', 'x24', 'x10', 'x40', 'x32', 'x24', 'x11'], 'k': 4, 'n': 32, '_time': 0.00043582916259765625, '_task': 'basic_procedur... | sort | instruct | 0 |
Execute the stack operations. PUSH x pushes x. POP removes the top item. Return the final stack from top to bottom, or EMPTY if the stack is empty.
(OPERATIONS)
PUSH x36; POP; PUSH x61; PUSH x22; PUSH x29; PUSH x13; PUSH x27; PUSH x28; PUSH x62; PUSH x51; PUSH x59; PUSH x6; PUSH x16; PUSH x39; PUSH x42; PUSH x1; PUSH x... | x1 x42 x39 x16 x6 x59 x51 x62 x28 x27 x13 x29 x22 x61 | {'task': 'stack', 'seq': ['PUSH x36', 'POP', 'PUSH x61', 'PUSH x22', 'PUSH x29', 'PUSH x13', 'PUSH x27', 'PUSH x28', 'PUSH x62', 'PUSH x51', 'PUSH x59', 'PUSH x6', 'PUSH x16', 'PUSH x39', 'PUSH x42', 'PUSH x1', 'PUSH x10', 'PUSH x49', 'PUSH x47', 'PUSH x32', 'PUSH x11', 'PUSH x49', 'POP', 'POP', 'PUSH x63', 'POP', 'PUS... | stack | instruct | 0 |
Return the ordered union of the two sequences: keep each token the first time it appears while scanning A then B.
(A)
x35 x15 x56 x56 x53 x46 x13 x44 x57 x53 x27 x35 x19 x13 x64 x16
(B)
x47 x10 x46 x18 x29 x21 x27 x58 x34 x6 x10 x33 x61 x51 x2 x21 | x35 x15 x56 x53 x46 x13 x44 x57 x27 x19 x64 x16 x47 x10 x18 x29 x21 x58 x34 x6 x33 x61 x51 x2 | {'task': 'union', 'seq': [['x35', 'x15', 'x56', 'x56', 'x53', 'x46', 'x13', 'x44', 'x57', 'x53', 'x27', 'x35', 'x19', 'x13', 'x64', 'x16'], ['x47', 'x10', 'x46', 'x18', 'x29', 'x21', 'x27', 'x58', 'x34', 'x6', 'x10', 'x33', 'x61', 'x51', 'x2', 'x21']], 'k': 4, 'n': 32, '_time': 0.0004661083221435547, '_task': 'basic_pr... | union | instruct | 0 |
Generate one valid Dyck-4 balanced-bracket sequence of exactly 32 tokens.
Use tokens o0..ok for opens and c0..ck for matching closes. Return only the sequence. | o1 c1 o0 c0 o0 c0 o1 o2 o0 o1 o3 o3 o0 o2 c2 c0 c3 c3 o1 c1 o3 o1 c1 o3 o1 c1 c3 c3 c1 c0 c2 c1 | {'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.00034999847412109375, '_task': 'basic_procedural', '_level': 0, '_config': {'c': 1.0, 'level': 0, 'seed': None, 'size': None, 'task': 'mixed', 'seq_len': 32, 'vocab_size': 64, 'k': 4, 'p_open': 0.49, 'max_depth': 16}, '_prompt_tokens': 39, '_answer_tokens': 64} | dyck | instruct | 0 |
Execute the stack operations. PUSH x pushes x. POP removes the top item. Return the final stack from top to bottom, or EMPTY if the stack is empty.
(OPERATIONS)
PUSH x54; POP; PUSH x25; PUSH x48; POP; PUSH x25; PUSH x38; PUSH x36; PUSH x55; PUSH x61; PUSH x55; PUSH x22; PUSH x6; PUSH x15; POP; POP; POP; PUSH x30; PUSH ... | EMPTY | {'task': 'stack', 'seq': ['PUSH x54', 'POP', 'PUSH x25', 'PUSH x48', 'POP', 'PUSH x25', 'PUSH x38', 'PUSH x36', 'PUSH x55', 'PUSH x61', 'PUSH x55', 'PUSH x22', 'PUSH x6', 'PUSH x15', 'POP', 'POP', 'POP', 'PUSH x30', 'PUSH x13', 'PUSH x11', 'PUSH x10', 'POP', 'POP', 'POP', 'POP', 'POP', 'POP', 'POP', 'POP', 'POP', 'POP'... | stack | instruct | 0 |
Sort the sequence in ascending numeric order, where x2 < x10.
(SEQUENCE)
x44 x42 x36 x13 x36 x56 x64 x19 x54 x64 x64 x39 x47 x63 x10 x59 x29 x59 x25 x9 x19 x20 x31 x62 x31 x24 x44 x39 x58 x61 x41 x32 | x9 x10 x13 x19 x19 x20 x24 x25 x29 x31 x31 x32 x36 x36 x39 x39 x41 x42 x44 x44 x47 x54 x56 x58 x59 x59 x61 x62 x63 x64 x64 x64 | {'task': 'sort', 'seq': ['x44', 'x42', 'x36', 'x13', 'x36', 'x56', 'x64', 'x19', 'x54', 'x64', 'x64', 'x39', 'x47', 'x63', 'x10', 'x59', 'x29', 'x59', 'x25', 'x9', 'x19', 'x20', 'x31', 'x62', 'x31', 'x24', 'x44', 'x39', 'x58', 'x61', 'x41', 'x32'], 'k': 4, 'n': 32, '_time': 0.00043201446533203125, '_task': 'basic_proce... | sort | instruct | 0 |
Return the unique elements of the sequence in order of first appearance.
(SEQUENCE)
x34 x40 x56 x33 x44 x2 x34 x36 x33 x46 x63 x22 x46 x44 x18 x52 x45 x3 x38 x39 x5 x29 x49 x32 x54 x11 x43 x52 x18 x45 x5 x31 | x34 x40 x56 x33 x44 x2 x36 x46 x63 x22 x18 x52 x45 x3 x38 x39 x5 x29 x49 x32 x54 x11 x43 x31 | {'task': 'set', 'seq': ['x34', 'x40', 'x56', 'x33', 'x44', 'x2', 'x34', 'x36', 'x33', 'x46', 'x63', 'x22', 'x46', 'x44', 'x18', 'x52', 'x45', 'x3', 'x38', 'x39', 'x5', 'x29', 'x49', 'x32', 'x54', 'x11', 'x43', 'x52', 'x18', 'x45', 'x5', 'x31'], 'k': 4, 'n': 32, '_time': 0.0005695819854736328, '_task': 'basic_procedural... | set | instruct | 0 |
Delete the first occurrence of TARGET from SEQUENCE. If TARGET is absent, return SEQUENCE unchanged.
(SEQUENCE)
x14 x57 x22 x63 x57 x61 x58 x18 x26 x54 x64 x8 x42 x8 x37 x27 x14 x49 x5 x43 x7 x50 x15 x55 x60 x61 x34 x31 x32 x8 x1 x25
(TARGET)
x32 | x14 x57 x22 x63 x57 x61 x58 x18 x26 x54 x64 x8 x42 x8 x37 x27 x14 x49 x5 x43 x7 x50 x15 x55 x60 x61 x34 x31 x8 x1 x25 | {'task': 'delete', 'seq': [['x14', 'x57', 'x22', 'x63', 'x57', 'x61', 'x58', 'x18', 'x26', 'x54', 'x64', 'x8', 'x42', 'x8', 'x37', 'x27', 'x14', 'x49', 'x5', 'x43', 'x7', 'x50', 'x15', 'x55', 'x60', 'x61', 'x34', 'x31', 'x32', 'x8', 'x1', 'x25'], 'x32'], 'k': 4, 'n': 32, '_time': 0.00040030479431152344, '_task': 'basic... | delete | instruct | 0 |
Return the unique elements of the sequence in order of first appearance.
(SEQUENCE)
x54 x12 x48 x11 x17 x64 x33 x47 x60 x1 x39 x63 x29 x57 x45 x51 x32 x32 x5 x7 x44 x50 x10 x39 x37 x37 x3 x51 x5 x47 x56 x11 | x54 x12 x48 x11 x17 x64 x33 x47 x60 x1 x39 x63 x29 x57 x45 x51 x32 x5 x7 x44 x50 x10 x37 x3 x56 | {'task': 'set', 'seq': ['x54', 'x12', 'x48', 'x11', 'x17', 'x64', 'x33', 'x47', 'x60', 'x1', 'x39', 'x63', 'x29', 'x57', 'x45', 'x51', 'x32', 'x32', 'x5', 'x7', 'x44', 'x50', 'x10', 'x39', 'x37', 'x37', 'x3', 'x51', 'x5', 'x47', 'x56', 'x11'], 'k': 4, 'n': 32, '_time': 0.00041675567626953125, '_task': 'basic_procedural... | set | instruct | 0 |
Sort the sequence in ascending numeric order, where x2 < x10.
(SEQUENCE)
x11 x24 x48 x19 x1 x18 x17 x34 x19 x37 x13 x55 x25 x64 x11 x51 x37 x30 x62 x64 x52 x10 x3 x15 x22 x49 x20 x14 x20 x17 x47 x57 | x1 x3 x10 x11 x11 x13 x14 x15 x17 x17 x18 x19 x19 x20 x20 x22 x24 x25 x30 x34 x37 x37 x47 x48 x49 x51 x52 x55 x57 x62 x64 x64 | {'task': 'sort', 'seq': ['x11', 'x24', 'x48', 'x19', 'x1', 'x18', 'x17', 'x34', 'x19', 'x37', 'x13', 'x55', 'x25', 'x64', 'x11', 'x51', 'x37', 'x30', 'x62', 'x64', 'x52', 'x10', 'x3', 'x15', 'x22', 'x49', 'x20', 'x14', 'x20', 'x17', 'x47', 'x57'], 'k': 4, 'n': 32, '_time': 0.00043511390686035156, '_task': 'basic_proced... | sort | instruct | 0 |
Return the unique elements of the sequence in order of first appearance.
(SEQUENCE)
x42 x62 x19 x54 x43 x1 x39 x31 x3 x44 x59 x35 x39 x39 x48 x57 x1 x8 x50 x12 x34 x12 x1 x40 x30 x54 x26 x30 x27 x40 x6 x3 | x42 x62 x19 x54 x43 x1 x39 x31 x3 x44 x59 x35 x48 x57 x8 x50 x12 x34 x40 x30 x26 x27 x6 | {'task': 'set', 'seq': ['x42', 'x62', 'x19', 'x54', 'x43', 'x1', 'x39', 'x31', 'x3', 'x44', 'x59', 'x35', 'x39', 'x39', 'x48', 'x57', 'x1', 'x8', 'x50', 'x12', 'x34', 'x12', 'x1', 'x40', 'x30', 'x54', 'x26', 'x30', 'x27', 'x40', 'x6', 'x3'], 'k': 4, 'n': 32, '_time': 0.0003829002380371094, '_task': 'basic_procedural', ... | set | instruct | 0 |
Sort the sequence in ascending numeric order, where x2 < x10.
(SEQUENCE)
x57 x56 x45 x21 x14 x26 x50 x37 x46 x21 x39 x40 x21 x56 x29 x4 x50 x37 x5 x15 x31 x5 x60 x13 x18 x1 x29 x36 x56 x30 x31 x57 | x1 x4 x5 x5 x13 x14 x15 x18 x21 x21 x21 x26 x29 x29 x30 x31 x31 x36 x37 x37 x39 x40 x45 x46 x50 x50 x56 x56 x56 x57 x57 x60 | {'task': 'sort', 'seq': ['x57', 'x56', 'x45', 'x21', 'x14', 'x26', 'x50', 'x37', 'x46', 'x21', 'x39', 'x40', 'x21', 'x56', 'x29', 'x4', 'x50', 'x37', 'x5', 'x15', 'x31', 'x5', 'x60', 'x13', 'x18', 'x1', 'x29', 'x36', 'x56', 'x30', 'x31', 'x57'], 'k': 4, 'n': 32, '_time': 0.0006031990051269531, '_task': 'basic_procedura... | sort | instruct | 0 |
Copy the sequence exactly.
(SEQUENCE)
x9 x29 x24 x30 x21 x63 x17 x62 x32 x28 x16 x16 x56 x12 x22 x41 x24 x56 x28 x26 x34 x38 x16 x60 x30 x6 x26 x47 x24 x2 x3 x7 | x9 x29 x24 x30 x21 x63 x17 x62 x32 x28 x16 x16 x56 x12 x22 x41 x24 x56 x28 x26 x34 x38 x16 x60 x30 x6 x26 x47 x24 x2 x3 x7 | {'task': 'identity', 'seq': ['x9', 'x29', 'x24', 'x30', 'x21', 'x63', 'x17', 'x62', 'x32', 'x28', 'x16', 'x16', 'x56', 'x12', 'x22', 'x41', 'x24', 'x56', 'x28', 'x26', 'x34', 'x38', 'x16', 'x60', 'x30', 'x6', 'x26', 'x47', 'x24', 'x2', 'x3', 'x7'], 'k': 4, 'n': 32, '_time': 0.0004096031188964844, '_task': 'basic_proced... | identity | instruct | 0 |
Return the ordered union of the two sequences: keep each token the first time it appears while scanning A then B.
(A)
x11 x45 x50 x9 x51 x25 x22 x14 x38 x31 x7 x7 x55 x48 x45 x5
(B)
x34 x55 x57 x27 x60 x36 x47 x26 x30 x31 x58 x50 x47 x11 x2 x46 | x11 x45 x50 x9 x51 x25 x22 x14 x38 x31 x7 x55 x48 x5 x34 x57 x27 x60 x36 x47 x26 x30 x58 x2 x46 | {'task': 'union', 'seq': [['x11', 'x45', 'x50', 'x9', 'x51', 'x25', 'x22', 'x14', 'x38', 'x31', 'x7', 'x7', 'x55', 'x48', 'x45', 'x5'], ['x34', 'x55', 'x57', 'x27', 'x60', 'x36', 'x47', 'x26', 'x30', 'x31', 'x58', 'x50', 'x47', 'x11', 'x2', 'x46']], 'k': 4, 'n': 32, '_time': 0.0004100799560546875, '_task': 'basic_proce... | union | instruct | 0 |
Execute the stack operations. PUSH x pushes x. POP removes the top item. Return the final stack from top to bottom, or EMPTY if the stack is empty.
(OPERATIONS)
PUSH x22; PUSH x42; PUSH x62; PUSH x22; PUSH x58; PUSH x32; PUSH x25; PUSH x60; PUSH x62; PUSH x64; PUSH x1; PUSH x46; PUSH x4; PUSH x53; PUSH x61; PUSH x50; P... | x53 x4 x46 x1 x64 x62 x60 x25 x32 x58 x22 x62 x42 x22 | {'task': 'stack', 'seq': ['PUSH x22', 'PUSH x42', 'PUSH x62', 'PUSH x22', 'PUSH x58', 'PUSH x32', 'PUSH x25', 'PUSH x60', 'PUSH x62', 'PUSH x64', 'PUSH x1', 'PUSH x46', 'PUSH x4', 'PUSH x53', 'PUSH x61', 'PUSH x50', 'PUSH x24', 'PUSH x27', 'PUSH x47', 'PUSH x23', 'PUSH x59', 'PUSH x9', 'POP', 'POP', 'POP', 'POP', 'PUSH... | stack | instruct | 0 |
Return the unique elements of the sequence in order of first appearance.
(SEQUENCE)
x44 x8 x60 x57 x3 x20 x42 x2 x37 x44 x14 x16 x36 x29 x26 x29 x43 x31 x13 x14 x40 x25 x2 x11 x60 x18 x15 x10 x10 x22 x11 x50 | x44 x8 x60 x57 x3 x20 x42 x2 x37 x14 x16 x36 x29 x26 x43 x31 x13 x40 x25 x11 x18 x15 x10 x22 x50 | {'task': 'set', 'seq': ['x44', 'x8', 'x60', 'x57', 'x3', 'x20', 'x42', 'x2', 'x37', 'x44', 'x14', 'x16', 'x36', 'x29', 'x26', 'x29', 'x43', 'x31', 'x13', 'x14', 'x40', 'x25', 'x2', 'x11', 'x60', 'x18', 'x15', 'x10', 'x10', 'x22', 'x11', 'x50'], 'k': 4, 'n': 32, '_time': 0.0005109310150146484, '_task': 'basic_procedural... | set | instruct | 0 |
Execute the stack operations. PUSH x pushes x. POP removes the top item. Return the final stack from top to bottom, or EMPTY if the stack is empty.
(OPERATIONS)
PUSH x49; PUSH x64; PUSH x21; PUSH x60; PUSH x47; PUSH x52; PUSH x10; PUSH x48; POP; PUSH x19; POP; PUSH x40; PUSH x59; PUSH x38; PUSH x49; PUSH x46; POP; POP;... | x64 x49 | {'task': 'stack', 'seq': ['PUSH x49', 'PUSH x64', 'PUSH x21', 'PUSH x60', 'PUSH x47', 'PUSH x52', 'PUSH x10', 'PUSH x48', 'POP', 'PUSH x19', 'POP', 'PUSH x40', 'PUSH x59', 'PUSH x38', 'PUSH x49', 'PUSH x46', 'POP', 'POP', 'POP', 'PUSH x27', 'PUSH x12', 'PUSH x31', 'POP', 'POP', 'POP', 'POP', 'POP', 'POP', 'POP', 'POP',... | stack | instruct | 0 |
Generate one valid shuffle-Dyck-4 sequence of exactly 32 tokens. Each close ci must match a previously opened oi of the same type, but closing order may be interleaved across types. Return only the sequence. | o1 o0 o2 o3 c3 c1 c0 o2 c2 c2 o3 o0 c3 c0 o1 c1 o0 c0 o0 o1 o0 c0 o3 o3 o0 c1 o2 c2 c0 c3 c0 c3 | {'task': 'dyck_shuffle', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0004093647003173828, '_task': 'basic_procedural', '_level': 0, '_config': {'c': 1.0, 'level': 0, 'seed': None, 'size': None, 'task': 'mixed', 'seq_len': 32, 'vocab_size': 64, 'k': 4, 'p_open': 0.49, 'max_depth': 16}, '_prompt_tokens': 46, '_answer_tokens':... | dyck_shuffle | instruct | 0 |
Generate one valid shuffle-Dyck-4 sequence of exactly 32 tokens. Each close ci must match a previously opened oi of the same type, but closing order may be interleaved across types. Return only the sequence. | o0 o0 o2 o3 c2 o2 o0 c3 c0 o3 c0 c0 o1 o2 c3 o1 o3 c3 o1 c2 o3 o3 o2 c2 c1 o2 c1 c2 c1 c3 c2 c3 | {'task': 'dyck_shuffle', 'seq': [], 'k': 4, 'n': 32, '_time': 0.00045037269592285156, '_task': 'basic_procedural', '_level': 0, '_config': {'c': 1.0, 'level': 0, 'seed': None, 'size': None, 'task': 'mixed', 'seq_len': 32, 'vocab_size': 64, 'k': 4, 'p_open': 0.49, 'max_depth': 16}, '_prompt_tokens': 46, '_answer_tokens'... | dyck_shuffle | instruct | 0 |
Execute the stack operations. PUSH x pushes x. POP removes the top item. Return the final stack from top to bottom, or EMPTY if the stack is empty.
(OPERATIONS)
PUSH x51; PUSH x58; POP; PUSH x17; PUSH x53; PUSH x20; POP; PUSH x52; PUSH x18; PUSH x28; POP; POP; POP; PUSH x47; POP; POP; PUSH x28; PUSH x23; PUSH x35; PUSH... | x35 x51 | {'task': 'stack', 'seq': ['PUSH x51', 'PUSH x58', 'POP', 'PUSH x17', 'PUSH x53', 'PUSH x20', 'POP', 'PUSH x52', 'PUSH x18', 'PUSH x28', 'POP', 'POP', 'POP', 'PUSH x47', 'POP', 'POP', 'PUSH x28', 'PUSH x23', 'PUSH x35', 'PUSH x33', 'POP', 'POP', 'PUSH x62', 'POP', 'PUSH x40', 'POP', 'POP', 'PUSH x29', 'POP', 'POP', 'POP... | stack | instruct | 0 |
Generate one valid shuffle-Dyck-4 sequence of exactly 32 tokens. Each close ci must match a previously opened oi of the same type, but closing order may be interleaved across types. Return only the sequence. | o2 o1 o0 o3 c2 o2 o0 o3 o2 c0 o2 o3 c0 c1 c3 o2 o3 c3 o3 c2 o2 c2 o1 c3 o3 c1 c3 c3 c2 c2 c2 c3 | {'task': 'dyck_shuffle', 'seq': [], 'k': 4, 'n': 32, '_time': 0.000408172607421875, '_task': 'basic_procedural', '_level': 0, '_config': {'c': 1.0, 'level': 0, 'seed': None, 'size': None, 'task': 'mixed', 'seq_len': 32, 'vocab_size': 64, 'k': 4, 'p_open': 0.49, 'max_depth': 16}, '_prompt_tokens': 46, '_answer_tokens': ... | dyck_shuffle | instruct | 0 |
Generate one valid shuffle-Dyck-4 sequence of exactly 32 tokens. Each close ci must match a previously opened oi of the same type, but closing order may be interleaved across types. Return only the sequence. | o0 c0 o3 c3 o3 o3 o3 o0 c0 c3 o2 o2 c2 o3 c3 c2 c3 o1 o0 o0 o2 c1 c2 o2 o3 c3 o0 c2 c0 c0 c3 c0 | {'task': 'dyck_shuffle', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0004477500915527344, '_task': 'basic_procedural', '_level': 0, '_config': {'c': 1.0, 'level': 0, 'seed': None, 'size': None, 'task': 'mixed', 'seq_len': 32, 'vocab_size': 64, 'k': 4, 'p_open': 0.49, 'max_depth': 16}, '_prompt_tokens': 46, '_answer_tokens':... | dyck_shuffle | instruct | 0 |
Execute the stack operations. PUSH x pushes x. POP removes the top item. Return the final stack from top to bottom, or EMPTY if the stack is empty.
(OPERATIONS)
PUSH x63; PUSH x42; PUSH x11; PUSH x55; PUSH x57; PUSH x21; PUSH x34; PUSH x30; PUSH x22; PUSH x8; PUSH x55; PUSH x27; PUSH x11; PUSH x64; PUSH x18; PUSH x7; P... | x61 x11 x27 x55 x8 x22 x30 x34 x21 x57 x55 x11 x42 x63 | {'task': 'stack', 'seq': ['PUSH x63', 'PUSH x42', 'PUSH x11', 'PUSH x55', 'PUSH x57', 'PUSH x21', 'PUSH x34', 'PUSH x30', 'PUSH x22', 'PUSH x8', 'PUSH x55', 'PUSH x27', 'PUSH x11', 'PUSH x64', 'PUSH x18', 'PUSH x7', 'PUSH x18', 'PUSH x32', 'POP', 'PUSH x35', 'PUSH x34', 'PUSH x62', 'POP', 'POP', 'POP', 'POP', 'POP', 'P... | stack | instruct | 0 |
Return the unique elements of the sequence in order of first appearance.
(SEQUENCE)
x54 x27 x60 x24 x64 x15 x3 x16 x37 x63 x20 x9 x26 x21 x5 x34 x13 x49 x60 x53 x8 x22 x5 x50 x29 x19 x54 x8 x61 x14 x56 x29 | x54 x27 x60 x24 x64 x15 x3 x16 x37 x63 x20 x9 x26 x21 x5 x34 x13 x49 x53 x8 x22 x50 x29 x19 x61 x14 x56 | {'task': 'set', 'seq': ['x54', 'x27', 'x60', 'x24', 'x64', 'x15', 'x3', 'x16', 'x37', 'x63', 'x20', 'x9', 'x26', 'x21', 'x5', 'x34', 'x13', 'x49', 'x60', 'x53', 'x8', 'x22', 'x5', 'x50', 'x29', 'x19', 'x54', 'x8', 'x61', 'x14', 'x56', 'x29'], 'k': 4, 'n': 32, '_time': 0.0003495216369628906, '_task': 'basic_procedural',... | set | instruct | 0 |
Copy the sequence exactly.
(SEQUENCE)
x21 x11 x18 x49 x33 x8 x28 x63 x43 x18 x23 x7 x44 x13 x4 x13 x33 x23 x26 x49 x43 x57 x53 x46 x49 x15 x5 x31 x53 x46 x48 x6 | x21 x11 x18 x49 x33 x8 x28 x63 x43 x18 x23 x7 x44 x13 x4 x13 x33 x23 x26 x49 x43 x57 x53 x46 x49 x15 x5 x31 x53 x46 x48 x6 | {'task': 'identity', 'seq': ['x21', 'x11', 'x18', 'x49', 'x33', 'x8', 'x28', 'x63', 'x43', 'x18', 'x23', 'x7', 'x44', 'x13', 'x4', 'x13', 'x33', 'x23', 'x26', 'x49', 'x43', 'x57', 'x53', 'x46', 'x49', 'x15', 'x5', 'x31', 'x53', 'x46', 'x48', 'x6'], 'k': 4, 'n': 32, '_time': 0.0004093647003173828, '_task': 'basic_proced... | identity | instruct | 0 |
Generate one valid shuffle-Dyck-4 sequence of exactly 32 tokens. Each close ci must match a previously opened oi of the same type, but closing order may be interleaved across types. Return only the sequence. | o0 c0 o3 c3 o3 c3 o1 o0 o2 c0 o3 c2 c3 c1 o2 c2 o1 o0 c0 c1 o3 c3 o0 c0 o0 c0 o0 c0 o2 c2 o2 c2 | {'task': 'dyck_shuffle', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0003609657287597656, '_task': 'basic_procedural', '_level': 0, '_config': {'c': 1.0, 'level': 0, 'seed': None, 'size': None, 'task': 'mixed', 'seq_len': 32, 'vocab_size': 64, 'k': 4, 'p_open': 0.49, 'max_depth': 16}, '_prompt_tokens': 46, '_answer_tokens':... | dyck_shuffle | instruct | 0 |
Reverse the sequence.
(SEQUENCE)
x54 x21 x11 x14 x51 x24 x21 x62 x2 x37 x60 x11 x16 x47 x42 x19 x37 x40 x33 x28 x30 x53 x27 x22 x7 x7 x44 x64 x23 x40 x44 x54 | x54 x44 x40 x23 x64 x44 x7 x7 x22 x27 x53 x30 x28 x33 x40 x37 x19 x42 x47 x16 x11 x60 x37 x2 x62 x21 x24 x51 x14 x11 x21 x54 | {'task': 'reverse', 'seq': ['x54', 'x21', 'x11', 'x14', 'x51', 'x24', 'x21', 'x62', 'x2', 'x37', 'x60', 'x11', 'x16', 'x47', 'x42', 'x19', 'x37', 'x40', 'x33', 'x28', 'x30', 'x53', 'x27', 'x22', 'x7', 'x7', 'x44', 'x64', 'x23', 'x40', 'x44', 'x54'], 'k': 4, 'n': 32, '_time': 0.0004189014434814453, '_task': 'basic_proce... | reverse | instruct | 0 |
Reverse the sequence.
(SEQUENCE)
x59 x50 x47 x22 x4 x4 x36 x19 x30 x34 x57 x63 x24 x2 x28 x60 x24 x11 x40 x41 x24 x39 x30 x7 x61 x23 x10 x4 x12 x42 x51 x57 | x57 x51 x42 x12 x4 x10 x23 x61 x7 x30 x39 x24 x41 x40 x11 x24 x60 x28 x2 x24 x63 x57 x34 x30 x19 x36 x4 x4 x22 x47 x50 x59 | {'task': 'reverse', 'seq': ['x59', 'x50', 'x47', 'x22', 'x4', 'x4', 'x36', 'x19', 'x30', 'x34', 'x57', 'x63', 'x24', 'x2', 'x28', 'x60', 'x24', 'x11', 'x40', 'x41', 'x24', 'x39', 'x30', 'x7', 'x61', 'x23', 'x10', 'x4', 'x12', 'x42', 'x51', 'x57'], 'k': 4, 'n': 32, '_time': 0.0003399848937988281, '_task': 'basic_procedu... | reverse | instruct | 0 |
Return the ordered union of the two sequences: keep each token the first time it appears while scanning A then B.
(A)
x15 x21 x18 x29 x26 x59 x6 x4 x54 x36 x2 x35 x38 x63 x14 x16
(B)
x7 x16 x61 x36 x56 x41 x23 x53 x13 x23 x10 x28 x62 x6 x24 x23 | x15 x21 x18 x29 x26 x59 x6 x4 x54 x36 x2 x35 x38 x63 x14 x16 x7 x61 x56 x41 x23 x53 x13 x10 x28 x62 x24 | {'task': 'union', 'seq': [['x15', 'x21', 'x18', 'x29', 'x26', 'x59', 'x6', 'x4', 'x54', 'x36', 'x2', 'x35', 'x38', 'x63', 'x14', 'x16'], ['x7', 'x16', 'x61', 'x36', 'x56', 'x41', 'x23', 'x53', 'x13', 'x23', 'x10', 'x28', 'x62', 'x6', 'x24', 'x23']], 'k': 4, 'n': 32, '_time': 0.0004489421844482422, '_task': 'basic_proce... | union | instruct | 0 |
Generate one valid shuffle-Dyck-4 sequence of exactly 32 tokens. Each close ci must match a previously opened oi of the same type, but closing order may be interleaved across types. Return only the sequence. | o3 c3 o3 o1 c1 c3 o2 c2 o2 c2 o1 c1 o1 o0 o1 o0 c0 o0 c0 o3 o0 o0 o3 c1 o3 c1 c3 c0 c0 c0 c3 c3 | {'task': 'dyck_shuffle', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0003552436828613281, '_task': 'basic_procedural', '_level': 0, '_config': {'c': 1.0, 'level': 0, 'seed': None, 'size': None, 'task': 'mixed', 'seq_len': 32, 'vocab_size': 64, 'k': 4, 'p_open': 0.49, 'max_depth': 16}, '_prompt_tokens': 46, '_answer_tokens':... | dyck_shuffle | instruct | 0 |
Return the unique elements of the sequence in order of first appearance.
(SEQUENCE)
x57 x30 x25 x14 x17 x35 x12 x64 x49 x45 x12 x27 x55 x13 x11 x31 x41 x11 x64 x53 x5 x31 x39 x20 x28 x17 x61 x22 x4 x57 x13 x52 | x57 x30 x25 x14 x17 x35 x12 x64 x49 x45 x27 x55 x13 x11 x31 x41 x53 x5 x39 x20 x28 x61 x22 x4 x52 | {'task': 'set', 'seq': ['x57', 'x30', 'x25', 'x14', 'x17', 'x35', 'x12', 'x64', 'x49', 'x45', 'x12', 'x27', 'x55', 'x13', 'x11', 'x31', 'x41', 'x11', 'x64', 'x53', 'x5', 'x31', 'x39', 'x20', 'x28', 'x17', 'x61', 'x22', 'x4', 'x57', 'x13', 'x52'], 'k': 4, 'n': 32, '_time': 0.00041747093200683594, '_task': 'basic_procedu... | set | instruct | 0 |
Generate one valid Dyck-4 balanced-bracket sequence of exactly 32 tokens.
Use tokens o0..ok for opens and c0..ck for matching closes. Return only the sequence. | o0 o0 o0 c0 c0 c0 o1 o3 o2 c2 o1 c1 c3 o1 c1 c1 o0 o3 c3 c0 o0 o1 o0 c0 c1 o3 o3 o2 c2 c3 c3 c0 | {'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0003044605255126953, '_task': 'basic_procedural', '_level': 0, '_config': {'c': 1.0, 'level': 0, 'seed': None, 'size': None, 'task': 'mixed', 'seq_len': 32, 'vocab_size': 64, 'k': 4, 'p_open': 0.49, 'max_depth': 16}, '_prompt_tokens': 39, '_answer_tokens': 64} | dyck | instruct | 0 |
Reverse the sequence.
(SEQUENCE)
x2 x10 x34 x52 x17 x62 x29 x27 x27 x47 x41 x32 x51 x16 x30 x63 x29 x62 x8 x29 x47 x35 x63 x59 x8 x59 x34 x14 x54 x33 x24 x49 | x49 x24 x33 x54 x14 x34 x59 x8 x59 x63 x35 x47 x29 x8 x62 x29 x63 x30 x16 x51 x32 x41 x47 x27 x27 x29 x62 x17 x52 x34 x10 x2 | {'task': 'reverse', 'seq': ['x2', 'x10', 'x34', 'x52', 'x17', 'x62', 'x29', 'x27', 'x27', 'x47', 'x41', 'x32', 'x51', 'x16', 'x30', 'x63', 'x29', 'x62', 'x8', 'x29', 'x47', 'x35', 'x63', 'x59', 'x8', 'x59', 'x34', 'x14', 'x54', 'x33', 'x24', 'x49'], 'k': 4, 'n': 32, '_time': 0.00034165382385253906, '_task': 'basic_proc... | reverse | instruct | 0 |
Sort the sequence in ascending numeric order, where x2 < x10.
(SEQUENCE)
x18 x10 x20 x1 x47 x58 x36 x38 x50 x37 x64 x59 x37 x1 x20 x26 x28 x6 x46 x64 x62 x44 x52 x19 x63 x60 x40 x61 x57 x12 x51 x15 | x1 x1 x6 x10 x12 x15 x18 x19 x20 x20 x26 x28 x36 x37 x37 x38 x40 x44 x46 x47 x50 x51 x52 x57 x58 x59 x60 x61 x62 x63 x64 x64 | {'task': 'sort', 'seq': ['x18', 'x10', 'x20', 'x1', 'x47', 'x58', 'x36', 'x38', 'x50', 'x37', 'x64', 'x59', 'x37', 'x1', 'x20', 'x26', 'x28', 'x6', 'x46', 'x64', 'x62', 'x44', 'x52', 'x19', 'x63', 'x60', 'x40', 'x61', 'x57', 'x12', 'x51', 'x15'], 'k': 4, 'n': 32, '_time': 0.0004329681396484375, '_task': 'basic_procedur... | sort | instruct | 0 |
Generate one valid Dyck-4 balanced-bracket sequence of exactly 32 tokens.
Use tokens o0..ok for opens and c0..ck for matching closes. Return only the sequence. | o3 c3 o0 o3 c3 c0 o2 c2 o3 o1 c1 c3 o2 c2 o0 o1 o1 o1 o3 o3 c3 c3 c1 o2 o2 c2 c2 o2 c2 c1 c1 c0 | {'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.00038433074951171875, '_task': 'basic_procedural', '_level': 0, '_config': {'c': 1.0, 'level': 0, 'seed': None, 'size': None, 'task': 'mixed', 'seq_len': 32, 'vocab_size': 64, 'k': 4, 'p_open': 0.49, 'max_depth': 16}, '_prompt_tokens': 39, '_answer_tokens': 64} | dyck | instruct | 0 |
Return the ordered union of the two sequences: keep each token the first time it appears while scanning A then B.
(A)
x25 x12 x57 x59 x26 x46 x48 x10 x62 x48 x14 x62 x56 x58 x18 x21
(B)
x51 x39 x17 x21 x55 x19 x45 x53 x41 x6 x38 x56 x8 x19 x41 x3 | x25 x12 x57 x59 x26 x46 x48 x10 x62 x14 x56 x58 x18 x21 x51 x39 x17 x55 x19 x45 x53 x41 x6 x38 x8 x3 | {'task': 'union', 'seq': [['x25', 'x12', 'x57', 'x59', 'x26', 'x46', 'x48', 'x10', 'x62', 'x48', 'x14', 'x62', 'x56', 'x58', 'x18', 'x21'], ['x51', 'x39', 'x17', 'x21', 'x55', 'x19', 'x45', 'x53', 'x41', 'x6', 'x38', 'x56', 'x8', 'x19', 'x41', 'x3']], 'k': 4, 'n': 32, '_time': 0.0003159046173095703, '_task': 'basic_pro... | union | instruct | 0 |
Reverse the sequence.
(SEQUENCE)
x36 x5 x3 x34 x64 x30 x39 x25 x16 x9 x18 x18 x30 x57 x29 x27 x10 x49 x37 x40 x40 x54 x36 x43 x60 x29 x29 x12 x22 x63 x4 x40 | x40 x4 x63 x22 x12 x29 x29 x60 x43 x36 x54 x40 x40 x37 x49 x10 x27 x29 x57 x30 x18 x18 x9 x16 x25 x39 x30 x64 x34 x3 x5 x36 | {'task': 'reverse', 'seq': ['x36', 'x5', 'x3', 'x34', 'x64', 'x30', 'x39', 'x25', 'x16', 'x9', 'x18', 'x18', 'x30', 'x57', 'x29', 'x27', 'x10', 'x49', 'x37', 'x40', 'x40', 'x54', 'x36', 'x43', 'x60', 'x29', 'x29', 'x12', 'x22', 'x63', 'x4', 'x40'], 'k': 4, 'n': 32, '_time': 0.0002968311309814453, '_task': 'basic_proced... | reverse | instruct | 0 |
Execute the stack operations. PUSH x pushes x. POP removes the top item. Return the final stack from top to bottom, or EMPTY if the stack is empty.
(OPERATIONS)
PUSH x26; PUSH x34; POP; PUSH x15; POP; PUSH x40; PUSH x22; POP; PUSH x52; PUSH x52; POP; PUSH x13; PUSH x57; PUSH x34; PUSH x63; PUSH x35; POP; PUSH x34; PUSH... | x13 x52 x40 x26 | {'task': 'stack', 'seq': ['PUSH x26', 'PUSH x34', 'POP', 'PUSH x15', 'POP', 'PUSH x40', 'PUSH x22', 'POP', 'PUSH x52', 'PUSH x52', 'POP', 'PUSH x13', 'PUSH x57', 'PUSH x34', 'PUSH x63', 'PUSH x35', 'POP', 'PUSH x34', 'PUSH x58', 'PUSH x56', 'PUSH x39', 'POP', 'POP', 'POP', 'POP', 'POP', 'POP', 'PUSH x7', 'POP', 'POP', ... | stack | instruct | 0 |
Delete the first occurrence of TARGET from SEQUENCE. If TARGET is absent, return SEQUENCE unchanged.
(SEQUENCE)
x30 x12 x1 x43 x55 x47 x48 x25 x54 x43 x10 x38 x32 x43 x46 x10 x42 x28 x14 x53 x63 x16 x61 x23 x9 x3 x52 x64 x53 x22 x54 x14
(TARGET)
x13 | x30 x12 x1 x43 x55 x47 x48 x25 x54 x43 x10 x38 x32 x43 x46 x10 x42 x28 x14 x53 x63 x16 x61 x23 x9 x3 x52 x64 x53 x22 x54 x14 | {'task': 'delete', 'seq': [['x30', 'x12', 'x1', 'x43', 'x55', 'x47', 'x48', 'x25', 'x54', 'x43', 'x10', 'x38', 'x32', 'x43', 'x46', 'x10', 'x42', 'x28', 'x14', 'x53', 'x63', 'x16', 'x61', 'x23', 'x9', 'x3', 'x52', 'x64', 'x53', 'x22', 'x54', 'x14'], 'x13'], 'k': 4, 'n': 32, '_time': 0.0004582405090332031, '_task': 'bas... | delete | instruct | 0 |
Generate one valid shuffle-Dyck-4 sequence of exactly 32 tokens. Each close ci must match a previously opened oi of the same type, but closing order may be interleaved across types. Return only the sequence. | o1 c1 o0 c0 o2 c2 o3 c3 o2 o2 o1 o3 o0 c1 o2 o2 c0 o2 o0 c3 c2 o0 o3 c2 o2 c3 c2 c2 c2 c2 c0 c0 | {'task': 'dyck_shuffle', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0003132820129394531, '_task': 'basic_procedural', '_level': 0, '_config': {'c': 1.0, 'level': 0, 'seed': None, 'size': None, 'task': 'mixed', 'seq_len': 32, 'vocab_size': 64, 'k': 4, 'p_open': 0.49, 'max_depth': 16}, '_prompt_tokens': 46, '_answer_tokens':... | dyck_shuffle | instruct | 0 |
Generate one valid Dyck-4 balanced-bracket sequence of exactly 32 tokens.
Use tokens o0..ok for opens and c0..ck for matching closes. Return only the sequence. | o2 o2 c2 c2 o3 o0 o0 c0 c0 o2 o1 o3 c3 o0 o0 c0 o3 c3 o1 c1 c0 o1 o2 c2 o1 c1 c1 c1 o1 c1 c2 c3 | {'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0002777576446533203, '_task': 'basic_procedural', '_level': 0, '_config': {'c': 1.0, 'level': 0, 'seed': None, 'size': None, 'task': 'mixed', 'seq_len': 32, 'vocab_size': 64, 'k': 4, 'p_open': 0.49, 'max_depth': 16}, '_prompt_tokens': 39, '_answer_tokens': 64} | dyck | instruct | 0 |
Return the ordered union of the two sequences: keep each token the first time it appears while scanning A then B.
(A)
x60 x24 x47 x33 x3 x44 x14 x58 x12 x32 x12 x50 x12 x60 x59 x45
(B)
x63 x49 x37 x4 x21 x22 x27 x4 x27 x4 x39 x58 x12 x17 x26 x25 | x60 x24 x47 x33 x3 x44 x14 x58 x12 x32 x50 x59 x45 x63 x49 x37 x4 x21 x22 x27 x39 x17 x26 x25 | {'task': 'union', 'seq': [['x60', 'x24', 'x47', 'x33', 'x3', 'x44', 'x14', 'x58', 'x12', 'x32', 'x12', 'x50', 'x12', 'x60', 'x59', 'x45'], ['x63', 'x49', 'x37', 'x4', 'x21', 'x22', 'x27', 'x4', 'x27', 'x4', 'x39', 'x58', 'x12', 'x17', 'x26', 'x25']], 'k': 4, 'n': 32, '_time': 0.0004520416259765625, '_task': 'basic_proc... | union | instruct | 0 |
Generate one valid Dyck-4 balanced-bracket sequence of exactly 32 tokens.
Use tokens o0..ok for opens and c0..ck for matching closes. Return only the sequence. | o0 o2 o0 c0 c2 c0 o1 o3 o2 c2 o2 c2 c3 c1 o0 c0 o1 c1 o2 o1 o1 c1 c1 c2 o2 c2 o0 c0 o0 c0 o1 c1 | {'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0003840923309326172, '_task': 'basic_procedural', '_level': 0, '_config': {'c': 1.0, 'level': 0, 'seed': None, 'size': None, 'task': 'mixed', 'seq_len': 32, 'vocab_size': 64, 'k': 4, 'p_open': 0.49, 'max_depth': 16}, '_prompt_tokens': 39, '_answer_tokens': 64} | dyck | instruct | 0 |
Reverse the sequence.
(SEQUENCE)
x46 x1 x41 x59 x53 x49 x52 x46 x51 x4 x40 x10 x15 x57 x48 x53 x27 x55 x58 x6 x53 x44 x64 x36 x53 x53 x41 x64 x36 x29 x50 x62 | x62 x50 x29 x36 x64 x41 x53 x53 x36 x64 x44 x53 x6 x58 x55 x27 x53 x48 x57 x15 x10 x40 x4 x51 x46 x52 x49 x53 x59 x41 x1 x46 | {'task': 'reverse', 'seq': ['x46', 'x1', 'x41', 'x59', 'x53', 'x49', 'x52', 'x46', 'x51', 'x4', 'x40', 'x10', 'x15', 'x57', 'x48', 'x53', 'x27', 'x55', 'x58', 'x6', 'x53', 'x44', 'x64', 'x36', 'x53', 'x53', 'x41', 'x64', 'x36', 'x29', 'x50', 'x62'], 'k': 4, 'n': 32, '_time': 0.0002968311309814453, '_task': 'basic_proce... | reverse | instruct | 0 |
Reverse the sequence.
(SEQUENCE)
x58 x40 x9 x33 x21 x9 x13 x36 x28 x42 x16 x47 x25 x59 x57 x13 x35 x23 x9 x28 x23 x51 x32 x17 x53 x2 x3 x42 x4 x54 x33 x47 | x47 x33 x54 x4 x42 x3 x2 x53 x17 x32 x51 x23 x28 x9 x23 x35 x13 x57 x59 x25 x47 x16 x42 x28 x36 x13 x9 x21 x33 x9 x40 x58 | {'task': 'reverse', 'seq': ['x58', 'x40', 'x9', 'x33', 'x21', 'x9', 'x13', 'x36', 'x28', 'x42', 'x16', 'x47', 'x25', 'x59', 'x57', 'x13', 'x35', 'x23', 'x9', 'x28', 'x23', 'x51', 'x32', 'x17', 'x53', 'x2', 'x3', 'x42', 'x4', 'x54', 'x33', 'x47'], 'k': 4, 'n': 32, '_time': 0.0002903938293457031, '_task': 'basic_procedur... | reverse | instruct | 0 |
Delete the first occurrence of TARGET from SEQUENCE. If TARGET is absent, return SEQUENCE unchanged.
(SEQUENCE)
x28 x13 x55 x60 x61 x64 x55 x51 x5 x56 x19 x58 x34 x49 x9 x63 x32 x4 x18 x2 x27 x22 x28 x64 x11 x59 x63 x63 x27 x29 x39 x25
(TARGET)
x3 | x28 x13 x55 x60 x61 x64 x55 x51 x5 x56 x19 x58 x34 x49 x9 x63 x32 x4 x18 x2 x27 x22 x28 x64 x11 x59 x63 x63 x27 x29 x39 x25 | {'task': 'delete', 'seq': [['x28', 'x13', 'x55', 'x60', 'x61', 'x64', 'x55', 'x51', 'x5', 'x56', 'x19', 'x58', 'x34', 'x49', 'x9', 'x63', 'x32', 'x4', 'x18', 'x2', 'x27', 'x22', 'x28', 'x64', 'x11', 'x59', 'x63', 'x63', 'x27', 'x29', 'x39', 'x25'], 'x3'], 'k': 4, 'n': 32, '_time': 0.00045990943908691406, '_task': 'basi... | delete | instruct | 0 |
Return the ordered union of the two sequences: keep each token the first time it appears while scanning A then B.
(A)
x64 x17 x57 x21 x58 x33 x10 x33 x64 x27 x20 x48 x55 x19 x54 x40
(B)
x38 x43 x4 x31 x50 x21 x44 x7 x20 x29 x28 x2 x36 x41 x22 x4 | x64 x17 x57 x21 x58 x33 x10 x27 x20 x48 x55 x19 x54 x40 x38 x43 x4 x31 x50 x44 x7 x29 x28 x2 x36 x41 x22 | {'task': 'union', 'seq': [['x64', 'x17', 'x57', 'x21', 'x58', 'x33', 'x10', 'x33', 'x64', 'x27', 'x20', 'x48', 'x55', 'x19', 'x54', 'x40'], ['x38', 'x43', 'x4', 'x31', 'x50', 'x21', 'x44', 'x7', 'x20', 'x29', 'x28', 'x2', 'x36', 'x41', 'x22', 'x4']], 'k': 4, 'n': 32, '_time': 0.0004494190216064453, '_task': 'basic_proc... | union | instruct | 0 |
Return the ordered union of the two sequences: keep each token the first time it appears while scanning A then B.
(A)
x40 x52 x13 x3 x37 x7 x35 x55 x63 x13 x12 x3 x20 x48 x2 x35
(B)
x63 x1 x51 x28 x52 x30 x16 x32 x40 x5 x18 x9 x27 x41 x34 x27 | x40 x52 x13 x3 x37 x7 x35 x55 x63 x12 x20 x48 x2 x1 x51 x28 x30 x16 x32 x5 x18 x9 x27 x41 x34 | {'task': 'union', 'seq': [['x40', 'x52', 'x13', 'x3', 'x37', 'x7', 'x35', 'x55', 'x63', 'x13', 'x12', 'x3', 'x20', 'x48', 'x2', 'x35'], ['x63', 'x1', 'x51', 'x28', 'x52', 'x30', 'x16', 'x32', 'x40', 'x5', 'x18', 'x9', 'x27', 'x41', 'x34', 'x27']], 'k': 4, 'n': 32, '_time': 0.00032258033752441406, '_task': 'basic_proced... | union | instruct | 0 |
Execute the stack operations. PUSH x pushes x. POP removes the top item. Return the final stack from top to bottom, or EMPTY if the stack is empty.
(OPERATIONS)
PUSH x35; PUSH x53; PUSH x14; POP; PUSH x1; PUSH x32; PUSH x30; POP; PUSH x44; PUSH x18; PUSH x17; PUSH x12; PUSH x16; POP; PUSH x55; PUSH x50; POP; PUSH x61; ... | x53 x35 | {'task': 'stack', 'seq': ['PUSH x35', 'PUSH x53', 'PUSH x14', 'POP', 'PUSH x1', 'PUSH x32', 'PUSH x30', 'POP', 'PUSH x44', 'PUSH x18', 'PUSH x17', 'PUSH x12', 'PUSH x16', 'POP', 'PUSH x55', 'PUSH x50', 'POP', 'PUSH x61', 'PUSH x51', 'PUSH x45', 'POP', 'POP', 'POP', 'POP', 'POP', 'PUSH x29', 'POP', 'POP', 'POP', 'POP', ... | stack | instruct | 0 |
Generate one valid Dyck-4 balanced-bracket sequence of exactly 32 tokens.
Use tokens o0..ok for opens and c0..ck for matching closes. Return only the sequence. | o1 c1 o2 c2 o0 o2 c2 c0 o3 c3 o1 o1 c1 c1 o0 o3 c3 o2 c2 c0 o1 o0 c0 c1 o3 o0 o1 c1 o2 c2 c0 c3 | {'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0003800392150878906, '_task': 'basic_procedural', '_level': 0, '_config': {'c': 1.0, 'level': 0, 'seed': None, 'size': None, 'task': 'mixed', 'seq_len': 32, 'vocab_size': 64, 'k': 4, 'p_open': 0.49, 'max_depth': 16}, '_prompt_tokens': 39, '_answer_tokens': 64} | dyck | instruct | 0 |
Return the ordered union of the two sequences: keep each token the first time it appears while scanning A then B.
(A)
x21 x57 x52 x55 x2 x28 x63 x29 x5 x17 x57 x50 x40 x53 x46 x56
(B)
x1 x3 x1 x18 x50 x12 x1 x8 x51 x41 x63 x5 x41 x10 x27 x33 | x21 x57 x52 x55 x2 x28 x63 x29 x5 x17 x50 x40 x53 x46 x56 x1 x3 x18 x12 x8 x51 x41 x10 x27 x33 | {'task': 'union', 'seq': [['x21', 'x57', 'x52', 'x55', 'x2', 'x28', 'x63', 'x29', 'x5', 'x17', 'x57', 'x50', 'x40', 'x53', 'x46', 'x56'], ['x1', 'x3', 'x1', 'x18', 'x50', 'x12', 'x1', 'x8', 'x51', 'x41', 'x63', 'x5', 'x41', 'x10', 'x27', 'x33']], 'k': 4, 'n': 32, '_time': 0.00035572052001953125, '_task': 'basic_procedu... | union | instruct | 0 |
Delete the first occurrence of TARGET from SEQUENCE. If TARGET is absent, return SEQUENCE unchanged.
(SEQUENCE)
x24 x59 x55 x54 x18 x28 x21 x16 x12 x58 x47 x47 x17 x9 x10 x33 x6 x5 x25 x2 x29 x28 x23 x29 x62 x51 x43 x44 x5 x36 x41 x15
(TARGET)
x59 | x24 x55 x54 x18 x28 x21 x16 x12 x58 x47 x47 x17 x9 x10 x33 x6 x5 x25 x2 x29 x28 x23 x29 x62 x51 x43 x44 x5 x36 x41 x15 | {'task': 'delete', 'seq': [['x24', 'x59', 'x55', 'x54', 'x18', 'x28', 'x21', 'x16', 'x12', 'x58', 'x47', 'x47', 'x17', 'x9', 'x10', 'x33', 'x6', 'x5', 'x25', 'x2', 'x29', 'x28', 'x23', 'x29', 'x62', 'x51', 'x43', 'x44', 'x5', 'x36', 'x41', 'x15'], 'x59'], 'k': 4, 'n': 32, '_time': 0.0004382133483886719, '_task': 'basic... | delete | instruct | 0 |
Generate one valid shuffle-Dyck-4 sequence of exactly 32 tokens. Each close ci must match a previously opened oi of the same type, but closing order may be interleaved across types. Return only the sequence. | o3 o0 c0 o3 o1 c1 c3 o3 c3 o2 c2 o1 c3 c1 o0 o1 c0 c1 o1 c1 o2 o2 c2 c2 o2 c2 o2 o1 o1 c2 c1 c1 | {'task': 'dyck_shuffle', 'seq': [], 'k': 4, 'n': 32, '_time': 0.00036787986755371094, '_task': 'basic_procedural', '_level': 0, '_config': {'c': 1.0, 'level': 0, 'seed': None, 'size': None, 'task': 'mixed', 'seq_len': 32, 'vocab_size': 64, 'k': 4, 'p_open': 0.49, 'max_depth': 16}, '_prompt_tokens': 46, '_answer_tokens'... | dyck_shuffle | instruct | 0 |
Copy the sequence exactly.
(SEQUENCE)
x26 x36 x13 x41 x41 x47 x41 x53 x31 x34 x10 x1 x56 x46 x40 x17 x39 x11 x16 x54 x30 x48 x27 x17 x61 x44 x17 x19 x10 x63 x40 x5 | x26 x36 x13 x41 x41 x47 x41 x53 x31 x34 x10 x1 x56 x46 x40 x17 x39 x11 x16 x54 x30 x48 x27 x17 x61 x44 x17 x19 x10 x63 x40 x5 | {'task': 'identity', 'seq': ['x26', 'x36', 'x13', 'x41', 'x41', 'x47', 'x41', 'x53', 'x31', 'x34', 'x10', 'x1', 'x56', 'x46', 'x40', 'x17', 'x39', 'x11', 'x16', 'x54', 'x30', 'x48', 'x27', 'x17', 'x61', 'x44', 'x17', 'x19', 'x10', 'x63', 'x40', 'x5'], 'k': 4, 'n': 32, '_time': 0.0003268718719482422, '_task': 'basic_pro... | identity | instruct | 0 |
Return the ordered union of the two sequences: keep each token the first time it appears while scanning A then B.
(A)
x19 x42 x10 x59 x13 x20 x53 x7 x8 x35 x36 x12 x24 x2 x48 x8
(B)
x11 x33 x22 x6 x49 x17 x6 x25 x48 x8 x22 x34 x31 x46 x19 x32 | x19 x42 x10 x59 x13 x20 x53 x7 x8 x35 x36 x12 x24 x2 x48 x11 x33 x22 x6 x49 x17 x25 x34 x31 x46 x32 | {'task': 'union', 'seq': [['x19', 'x42', 'x10', 'x59', 'x13', 'x20', 'x53', 'x7', 'x8', 'x35', 'x36', 'x12', 'x24', 'x2', 'x48', 'x8'], ['x11', 'x33', 'x22', 'x6', 'x49', 'x17', 'x6', 'x25', 'x48', 'x8', 'x22', 'x34', 'x31', 'x46', 'x19', 'x32']], 'k': 4, 'n': 32, '_time': 0.00044846534729003906, '_task': 'basic_proced... | union | instruct | 0 |
Sort the sequence in ascending numeric order, where x2 < x10.
(SEQUENCE)
x44 x39 x17 x51 x38 x30 x21 x24 x48 x23 x26 x21 x29 x47 x47 x45 x25 x6 x17 x38 x30 x10 x43 x32 x14 x6 x36 x6 x23 x21 x53 x58 | x6 x6 x6 x10 x14 x17 x17 x21 x21 x21 x23 x23 x24 x25 x26 x29 x30 x30 x32 x36 x38 x38 x39 x43 x44 x45 x47 x47 x48 x51 x53 x58 | {'task': 'sort', 'seq': ['x44', 'x39', 'x17', 'x51', 'x38', 'x30', 'x21', 'x24', 'x48', 'x23', 'x26', 'x21', 'x29', 'x47', 'x47', 'x45', 'x25', 'x6', 'x17', 'x38', 'x30', 'x10', 'x43', 'x32', 'x14', 'x6', 'x36', 'x6', 'x23', 'x21', 'x53', 'x58'], 'k': 4, 'n': 32, '_time': 0.0004367828369140625, '_task': 'basic_procedur... | sort | instruct | 0 |
Return the ordered union of the two sequences: keep each token the first time it appears while scanning A then B.
(A)
x49 x12 x24 x7 x23 x9 x22 x51 x51 x30 x18 x14 x1 x58 x38 x9
(B)
x33 x52 x8 x37 x51 x1 x18 x10 x30 x1 x39 x18 x10 x37 x49 x59 | x49 x12 x24 x7 x23 x9 x22 x51 x30 x18 x14 x1 x58 x38 x33 x52 x8 x37 x10 x39 x59 | {'task': 'union', 'seq': [['x49', 'x12', 'x24', 'x7', 'x23', 'x9', 'x22', 'x51', 'x51', 'x30', 'x18', 'x14', 'x1', 'x58', 'x38', 'x9'], ['x33', 'x52', 'x8', 'x37', 'x51', 'x1', 'x18', 'x10', 'x30', 'x1', 'x39', 'x18', 'x10', 'x37', 'x49', 'x59']], 'k': 4, 'n': 32, '_time': 0.0003504753112792969, '_task': 'basic_procedu... | union | instruct | 0 |
Execute the stack operations. PUSH x pushes x. POP removes the top item. Return the final stack from top to bottom, or EMPTY if the stack is empty.
(OPERATIONS)
PUSH x14; PUSH x33; PUSH x30; PUSH x30; PUSH x32; PUSH x7; PUSH x19; PUSH x8; PUSH x51; PUSH x19; PUSH x19; POP; PUSH x6; PUSH x7; PUSH x59; PUSH x46; PUSH x42... | x53 x42 x46 x59 x7 x6 x19 x51 x8 x19 x7 x32 x30 x30 x33 x14 | {'task': 'stack', 'seq': ['PUSH x14', 'PUSH x33', 'PUSH x30', 'PUSH x30', 'PUSH x32', 'PUSH x7', 'PUSH x19', 'PUSH x8', 'PUSH x51', 'PUSH x19', 'PUSH x19', 'POP', 'PUSH x6', 'PUSH x7', 'PUSH x59', 'PUSH x46', 'PUSH x42', 'PUSH x53', 'PUSH x26', 'PUSH x44', 'PUSH x11', 'POP', 'POP', 'PUSH x15', 'PUSH x7', 'POP', 'POP', ... | stack | instruct | 0 |
Generate one valid Dyck-4 balanced-bracket sequence of exactly 32 tokens.
Use tokens o0..ok for opens and c0..ck for matching closes. Return only the sequence. | o2 o3 o2 o1 o2 o2 o0 o3 o2 o2 c2 o3 o0 c0 c3 c2 o3 c3 o3 c3 c3 c0 c2 o1 o1 c1 c1 c2 c1 c2 c3 c2 | {'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0003826618194580078, '_task': 'basic_procedural', '_level': 0, '_config': {'c': 1.0, 'level': 0, 'seed': None, 'size': None, 'task': 'mixed', 'seq_len': 32, 'vocab_size': 64, 'k': 4, 'p_open': 0.49, 'max_depth': 16}, '_prompt_tokens': 39, '_answer_tokens': 64} | dyck | instruct | 0 |
Delete the first occurrence of TARGET from SEQUENCE. If TARGET is absent, return SEQUENCE unchanged.
(SEQUENCE)
x24 x59 x30 x23 x35 x3 x33 x34 x28 x19 x32 x28 x60 x22 x10 x36 x23 x10 x35 x43 x27 x19 x22 x64 x36 x9 x64 x42 x9 x63 x53 x25
(TARGET)
x10 | x24 x59 x30 x23 x35 x3 x33 x34 x28 x19 x32 x28 x60 x22 x36 x23 x10 x35 x43 x27 x19 x22 x64 x36 x9 x64 x42 x9 x63 x53 x25 | {'task': 'delete', 'seq': [['x24', 'x59', 'x30', 'x23', 'x35', 'x3', 'x33', 'x34', 'x28', 'x19', 'x32', 'x28', 'x60', 'x22', 'x10', 'x36', 'x23', 'x10', 'x35', 'x43', 'x27', 'x19', 'x22', 'x64', 'x36', 'x9', 'x64', 'x42', 'x9', 'x63', 'x53', 'x25'], 'x10'], 'k': 4, 'n': 32, '_time': 0.00028705596923828125, '_task': 'ba... | delete | instruct | 0 |
Reverse the sequence.
(SEQUENCE)
x1 x23 x12 x62 x1 x41 x38 x25 x26 x36 x45 x11 x42 x15 x17 x58 x9 x45 x36 x27 x37 x51 x59 x4 x2 x57 x10 x8 x37 x44 x9 x63 | x63 x9 x44 x37 x8 x10 x57 x2 x4 x59 x51 x37 x27 x36 x45 x9 x58 x17 x15 x42 x11 x45 x36 x26 x25 x38 x41 x1 x62 x12 x23 x1 | {'task': 'reverse', 'seq': ['x1', 'x23', 'x12', 'x62', 'x1', 'x41', 'x38', 'x25', 'x26', 'x36', 'x45', 'x11', 'x42', 'x15', 'x17', 'x58', 'x9', 'x45', 'x36', 'x27', 'x37', 'x51', 'x59', 'x4', 'x2', 'x57', 'x10', 'x8', 'x37', 'x44', 'x9', 'x63'], 'k': 4, 'n': 32, '_time': 0.00027370452880859375, '_task': 'basic_procedur... | reverse | instruct | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.