prompt stringlengths 144 465 | answer stringlengths 5 127 | metadata stringlengths 308 686 | task stringclasses 9
values | mode stringclasses 1
value | level int64 0 0 |
|---|---|---|---|---|---|
Reverse the sequence.
(SEQUENCE)
x12 x23 x32 x6 x22 x10 x55 x14 x52 x48 x50 x11 x28 x49 x57 x52 x23 x1 x54 x63 x37 x35 x36 x53 x44 x3 x39 x27 x43 x15 x63 x38 | x38 x63 x15 x43 x27 x39 x3 x44 x53 x36 x35 x37 x63 x54 x1 x23 x52 x57 x49 x28 x11 x50 x48 x52 x14 x55 x10 x22 x6 x32 x23 x12 | {'task': 'reverse', 'seq': ['x12', 'x23', 'x32', 'x6', 'x22', 'x10', 'x55', 'x14', 'x52', 'x48', 'x50', 'x11', 'x28', 'x49', 'x57', 'x52', 'x23', 'x1', 'x54', 'x63', 'x37', 'x35', 'x36', 'x53', 'x44', 'x3', 'x39', 'x27', 'x43', 'x15', 'x63', 'x38'], 'k': 4, 'n': 32, '_time': 0.00044274330139160156, '_task': 'basic_proc... | reverse | instruct | 0 |
Delete the first occurrence of TARGET from SEQUENCE. If TARGET is absent, return SEQUENCE unchanged.
(SEQUENCE)
x28 x27 x12 x59 x59 x64 x24 x58 x51 x32 x59 x31 x9 x26 x30 x24 x35 x23 x37 x43 x2 x20 x3 x51 x51 x2 x47 x55 x48 x54 x25 x33
(TARGET)
x25 | x28 x27 x12 x59 x59 x64 x24 x58 x51 x32 x59 x31 x9 x26 x30 x24 x35 x23 x37 x43 x2 x20 x3 x51 x51 x2 x47 x55 x48 x54 x33 | {'task': 'delete', 'seq': [['x28', 'x27', 'x12', 'x59', 'x59', 'x64', 'x24', 'x58', 'x51', 'x32', 'x59', 'x31', 'x9', 'x26', 'x30', 'x24', 'x35', 'x23', 'x37', 'x43', 'x2', 'x20', 'x3', 'x51', 'x51', 'x2', 'x47', 'x55', 'x48', 'x54', 'x25', 'x33'], 'x25'], 'k': 4, 'n': 32, '_time': 0.00047206878662109375, '_task': 'bas... | 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)
x25 x61 x14 x8 x38 x40 x11 x28 x52 x62 x4 x57 x62 x21 x64 x3
(B)
x48 x37 x52 x59 x34 x35 x41 x40 x51 x19 x32 x9 x2 x58 x16 x28 | x25 x61 x14 x8 x38 x40 x11 x28 x52 x62 x4 x57 x21 x64 x3 x48 x37 x59 x34 x35 x41 x51 x19 x32 x9 x2 x58 x16 | {'task': 'union', 'seq': [['x25', 'x61', 'x14', 'x8', 'x38', 'x40', 'x11', 'x28', 'x52', 'x62', 'x4', 'x57', 'x62', 'x21', 'x64', 'x3'], ['x48', 'x37', 'x52', 'x59', 'x34', 'x35', 'x41', 'x40', 'x51', 'x19', 'x32', 'x9', 'x2', 'x58', 'x16', 'x28']], 'k': 4, 'n': 32, '_time': 0.0004980564117431641, '_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 x42; PUSH x40; PUSH x54; POP; POP; PUSH x4; PUSH x7; PUSH x55; PUSH x52; POP; PUSH x44; POP; PUSH x3; POP; PUSH x37; POP; PUSH x7; POP; PUSH x8; PUSH x33;... | x42 x58 x33 x8 x55 x7 x4 x42 | {'task': 'stack', 'seq': ['PUSH x42', 'PUSH x40', 'PUSH x54', 'POP', 'POP', 'PUSH x4', 'PUSH x7', 'PUSH x55', 'PUSH x52', 'POP', 'PUSH x44', 'POP', 'PUSH x3', 'POP', 'PUSH x37', 'POP', 'PUSH x7', 'POP', 'PUSH x8', 'PUSH x33', 'PUSH x58', 'PUSH x7', 'PUSH x42', 'PUSH x37', 'POP', 'POP', 'POP', 'PUSH x62', 'POP', 'PUSH x... | stack | instruct | 0 |
Copy the sequence exactly.
(SEQUENCE)
x60 x56 x19 x30 x21 x24 x45 x13 x51 x42 x13 x22 x8 x57 x55 x5 x6 x55 x28 x57 x16 x40 x19 x6 x6 x54 x60 x51 x53 x32 x56 x42 | x60 x56 x19 x30 x21 x24 x45 x13 x51 x42 x13 x22 x8 x57 x55 x5 x6 x55 x28 x57 x16 x40 x19 x6 x6 x54 x60 x51 x53 x32 x56 x42 | {'task': 'identity', 'seq': ['x60', 'x56', 'x19', 'x30', 'x21', 'x24', 'x45', 'x13', 'x51', 'x42', 'x13', 'x22', 'x8', 'x57', 'x55', 'x5', 'x6', 'x55', 'x28', 'x57', 'x16', 'x40', 'x19', 'x6', 'x6', 'x54', 'x60', 'x51', 'x53', 'x32', 'x56', 'x42'], 'k': 4, 'n': 32, '_time': 0.0004439353942871094, '_task': 'basic_proced... | identity | 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 x62; PUSH x21; PUSH x48; PUSH x30; POP; PUSH x39; PUSH x34; PUSH x32; PUSH x55; PUSH x59; PUSH x46; PUSH x51; POP; PUSH x1; PUSH x42; PUSH x61; PUSH x3; P... | x3 x45 x59 x55 x32 x34 x39 x48 x21 x62 | {'task': 'stack', 'seq': ['PUSH x62', 'PUSH x21', 'PUSH x48', 'PUSH x30', 'POP', 'PUSH x39', 'PUSH x34', 'PUSH x32', 'PUSH x55', 'PUSH x59', 'PUSH x46', 'PUSH x51', 'POP', 'PUSH x1', 'PUSH x42', 'PUSH x61', 'PUSH x3', 'PUSH x44', 'POP', 'PUSH x29', 'PUSH x6', 'PUSH x34', 'POP', 'POP', 'POP', 'POP', 'POP', 'POP', 'POP',... | stack | instruct | 0 |
Reverse the sequence.
(SEQUENCE)
x42 x63 x3 x16 x13 x11 x48 x11 x23 x23 x51 x56 x5 x21 x50 x47 x4 x34 x10 x23 x20 x45 x47 x61 x53 x54 x17 x38 x14 x60 x43 x38 | x38 x43 x60 x14 x38 x17 x54 x53 x61 x47 x45 x20 x23 x10 x34 x4 x47 x50 x21 x5 x56 x51 x23 x23 x11 x48 x11 x13 x16 x3 x63 x42 | {'task': 'reverse', 'seq': ['x42', 'x63', 'x3', 'x16', 'x13', 'x11', 'x48', 'x11', 'x23', 'x23', 'x51', 'x56', 'x5', 'x21', 'x50', 'x47', 'x4', 'x34', 'x10', 'x23', 'x20', 'x45', 'x47', 'x61', 'x53', 'x54', 'x17', 'x38', 'x14', 'x60', 'x43', 'x38'], 'k': 4, 'n': 32, '_time': 0.0004456043243408203, '_task': 'basic_proce... | 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)
x44 x49 x16 x57 x55 x57 x49 x62 x20 x52 x58 x49 x59 x54 x17 x55
(B)
x51 x60 x45 x34 x45 x43 x55 x40 x36 x55 x61 x19 x33 x59 x15 x30 | x44 x49 x16 x57 x55 x62 x20 x52 x58 x59 x54 x17 x51 x60 x45 x34 x43 x40 x36 x61 x19 x33 x15 x30 | {'task': 'union', 'seq': [['x44', 'x49', 'x16', 'x57', 'x55', 'x57', 'x49', 'x62', 'x20', 'x52', 'x58', 'x49', 'x59', 'x54', 'x17', 'x55'], ['x51', 'x60', 'x45', 'x34', 'x45', 'x43', 'x55', 'x40', 'x36', 'x55', 'x61', 'x19', 'x33', 'x59', 'x15', 'x30']], 'k': 4, 'n': 32, '_time': 0.0004761219024658203, '_task': 'basic_... | union | instruct | 0 |
Sort the sequence in ascending numeric order, where x2 < x10.
(SEQUENCE)
x15 x64 x8 x29 x8 x10 x25 x8 x5 x3 x60 x33 x13 x27 x44 x27 x12 x4 x40 x8 x32 x59 x32 x48 x3 x2 x20 x2 x9 x31 x16 x61 | x2 x2 x3 x3 x4 x5 x8 x8 x8 x8 x9 x10 x12 x13 x15 x16 x20 x25 x27 x27 x29 x31 x32 x32 x33 x40 x44 x48 x59 x60 x61 x64 | {'task': 'sort', 'seq': ['x15', 'x64', 'x8', 'x29', 'x8', 'x10', 'x25', 'x8', 'x5', 'x3', 'x60', 'x33', 'x13', 'x27', 'x44', 'x27', 'x12', 'x4', 'x40', 'x8', 'x32', 'x59', 'x32', 'x48', 'x3', 'x2', 'x20', 'x2', 'x9', 'x31', 'x16', 'x61'], 'k': 4, 'n': 32, '_time': 0.0004699230194091797, '_task': 'basic_procedural', '_l... | sort | instruct | 0 |
Reverse the sequence.
(SEQUENCE)
x60 x52 x47 x39 x39 x43 x18 x18 x18 x1 x58 x56 x36 x53 x52 x12 x19 x16 x26 x32 x57 x64 x20 x54 x8 x45 x47 x19 x6 x3 x57 x58 | x58 x57 x3 x6 x19 x47 x45 x8 x54 x20 x64 x57 x32 x26 x16 x19 x12 x52 x53 x36 x56 x58 x1 x18 x18 x18 x43 x39 x39 x47 x52 x60 | {'task': 'reverse', 'seq': ['x60', 'x52', 'x47', 'x39', 'x39', 'x43', 'x18', 'x18', 'x18', 'x1', 'x58', 'x56', 'x36', 'x53', 'x52', 'x12', 'x19', 'x16', 'x26', 'x32', 'x57', 'x64', 'x20', 'x54', 'x8', 'x45', 'x47', 'x19', 'x6', 'x3', 'x57', 'x58'], 'k': 4, 'n': 32, '_time': 0.00045180320739746094, '_task': 'basic_proce... | reverse | instruct | 0 |
Return the unique elements of the sequence in order of first appearance.
(SEQUENCE)
x53 x7 x39 x59 x59 x62 x34 x55 x9 x57 x30 x30 x28 x6 x53 x33 x7 x56 x4 x10 x10 x62 x15 x56 x47 x1 x13 x64 x16 x21 x3 x38 | x53 x7 x39 x59 x62 x34 x55 x9 x57 x30 x28 x6 x33 x56 x4 x10 x15 x47 x1 x13 x64 x16 x21 x3 x38 | {'task': 'set', 'seq': ['x53', 'x7', 'x39', 'x59', 'x59', 'x62', 'x34', 'x55', 'x9', 'x57', 'x30', 'x30', 'x28', 'x6', 'x53', 'x33', 'x7', 'x56', 'x4', 'x10', 'x10', 'x62', 'x15', 'x56', 'x47', 'x1', 'x13', 'x64', 'x16', 'x21', 'x3', 'x38'], 'k': 4, 'n': 32, '_time': 0.00046062469482421875, '_task': 'basic_procedural',... | set | 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 o1 c1 o2 o3 c3 o0 o1 o2 c0 o2 c1 o1 o1 o2 c1 c2 o3 c3 o1 c2 c1 o1 c2 o3 c2 c1 c3 o0 c0 c1 | {'task': 'dyck_shuffle', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0004832744598388672, '_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)
x6 x4 x19 x62 x56 x20 x26 x16 x18 x22 x54 x45 x10 x37 x19 x14 x37 x37 x4 x59 x41 x11 x43 x9 x42 x5 x2 x34 x64 x5 x44 x30 | x2 x4 x4 x5 x5 x6 x9 x10 x11 x14 x16 x18 x19 x19 x20 x22 x26 x30 x34 x37 x37 x37 x41 x42 x43 x44 x45 x54 x56 x59 x62 x64 | {'task': 'sort', 'seq': ['x6', 'x4', 'x19', 'x62', 'x56', 'x20', 'x26', 'x16', 'x18', 'x22', 'x54', 'x45', 'x10', 'x37', 'x19', 'x14', 'x37', 'x37', 'x4', 'x59', 'x41', 'x11', 'x43', 'x9', 'x42', 'x5', 'x2', 'x34', 'x64', 'x5', 'x44', 'x30'], 'k': 4, 'n': 32, '_time': 0.000469207763671875, '_task': 'basic_procedural', ... | sort | 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 o2 c2 c2 o2 o0 c0 c2 o3 o0 o1 c1 o2 o2 c3 o3 o2 o0 c2 o2 c3 c2 o0 c2 o3 c0 c0 o3 c2 c3 c3 c0 | {'task': 'dyck_shuffle', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0004801750183105469, '_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)
x54 x47 x55 x28 x28 x17 x23 x26 x28 x5 x21 x2 x60 x11 x61 x16 x11 x29 x13 x50 x61 x22 x48 x12 x55 x24 x39 x32 x60 x27 x6 x16 | x54 x47 x55 x28 x17 x23 x26 x5 x21 x2 x60 x11 x61 x16 x29 x13 x50 x22 x48 x12 x24 x39 x32 x27 x6 | {'task': 'set', 'seq': ['x54', 'x47', 'x55', 'x28', 'x28', 'x17', 'x23', 'x26', 'x28', 'x5', 'x21', 'x2', 'x60', 'x11', 'x61', 'x16', 'x11', 'x29', 'x13', 'x50', 'x61', 'x22', 'x48', 'x12', 'x55', 'x24', 'x39', 'x32', 'x60', 'x27', 'x6', 'x16'], 'k': 4, 'n': 32, '_time': 0.00045299530029296875, '_task': 'basic_procedur... | set | instruct | 0 |
Reverse the sequence.
(SEQUENCE)
x9 x62 x18 x47 x12 x38 x17 x63 x7 x55 x13 x15 x37 x21 x36 x22 x26 x44 x34 x14 x35 x50 x11 x30 x26 x26 x8 x15 x34 x29 x21 x57 | x57 x21 x29 x34 x15 x8 x26 x26 x30 x11 x50 x35 x14 x34 x44 x26 x22 x36 x21 x37 x15 x13 x55 x7 x63 x17 x38 x12 x47 x18 x62 x9 | {'task': 'reverse', 'seq': ['x9', 'x62', 'x18', 'x47', 'x12', 'x38', 'x17', 'x63', 'x7', 'x55', 'x13', 'x15', 'x37', 'x21', 'x36', 'x22', 'x26', 'x44', 'x34', 'x14', 'x35', 'x50', 'x11', 'x30', 'x26', 'x26', 'x8', 'x15', 'x34', 'x29', 'x21', 'x57'], 'k': 4, 'n': 32, '_time': 0.0004425048828125, '_task': 'basic_procedur... | 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. | o3 c3 o1 o2 o3 c3 c2 c1 o2 c2 o2 o3 c3 c2 o0 c0 o2 c2 o1 o3 o1 c1 c3 c1 o3 o1 o3 o3 c3 c3 c1 c3 | {'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0004220008850097656, '_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. | o1 c1 o3 c3 o1 o0 c0 c1 o0 o0 c0 o0 c0 c0 o0 o1 o2 o2 c2 o3 c3 c2 o3 o1 c1 o3 c3 o3 c3 c3 c1 c0 | {'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.000415802001953125, '_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 |
Sort the sequence in ascending numeric order, where x2 < x10.
(SEQUENCE)
x9 x49 x10 x37 x3 x6 x12 x28 x12 x12 x13 x39 x10 x16 x25 x56 x60 x34 x9 x6 x50 x25 x13 x38 x45 x22 x63 x52 x22 x19 x7 x20 | x3 x6 x6 x7 x9 x9 x10 x10 x12 x12 x12 x13 x13 x16 x19 x20 x22 x22 x25 x25 x28 x34 x37 x38 x39 x45 x49 x50 x52 x56 x60 x63 | {'task': 'sort', 'seq': ['x9', 'x49', 'x10', 'x37', 'x3', 'x6', 'x12', 'x28', 'x12', 'x12', 'x13', 'x39', 'x10', 'x16', 'x25', 'x56', 'x60', 'x34', 'x9', 'x6', 'x50', 'x25', 'x13', 'x38', 'x45', 'x22', 'x63', 'x52', 'x22', 'x19', 'x7', 'x20'], 'k': 4, 'n': 32, '_time': 0.0004634857177734375, '_task': 'basic_procedural'... | 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 x4; PUSH x38; PUSH x31; PUSH x10; POP; PUSH x56; PUSH x27; POP; POP; PUSH x60; POP; PUSH x48; PUSH x37; PUSH x40; PUSH x28; POP; PUSH x8; PUSH x61; PUSH x... | x18 x40 x61 x8 x40 x37 x48 x31 x38 x4 | {'task': 'stack', 'seq': ['PUSH x4', 'PUSH x38', 'PUSH x31', 'PUSH x10', 'POP', 'PUSH x56', 'PUSH x27', 'POP', 'POP', 'PUSH x60', 'POP', 'PUSH x48', 'PUSH x37', 'PUSH x40', 'PUSH x28', 'POP', 'PUSH x8', 'PUSH x61', 'PUSH x23', 'POP', 'PUSH x40', 'PUSH x18', 'PUSH x54', 'PUSH x37', 'PUSH x59', 'PUSH x62', '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. | o3 o1 o0 o2 o3 o3 o1 o3 o3 c3 o3 o1 o2 c2 c1 o1 o1 o2 o0 c0 c2 c1 c1 c3 c3 c1 c3 c3 c2 c0 c1 c3 | {'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.00041174888610839844, '_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)
x38 x32 x32 x16 x9 x15 x52 x35 x31 x41 x36 x27 x34 x41 x38 x4 x44 x60 x40 x21 x17 x52 x38 x16 x36 x51 x49 x42 x16 x62 x2 x22
(TARGET)
x41 | x38 x32 x32 x16 x9 x15 x52 x35 x31 x36 x27 x34 x41 x38 x4 x44 x60 x40 x21 x17 x52 x38 x16 x36 x51 x49 x42 x16 x62 x2 x22 | {'task': 'delete', 'seq': [['x38', 'x32', 'x32', 'x16', 'x9', 'x15', 'x52', 'x35', 'x31', 'x41', 'x36', 'x27', 'x34', 'x41', 'x38', 'x4', 'x44', 'x60', 'x40', 'x21', 'x17', 'x52', 'x38', 'x16', 'x36', 'x51', 'x49', 'x42', 'x16', 'x62', 'x2', 'x22'], 'x41'], 'k': 4, 'n': 32, '_time': 0.0004706382751464844, '_task': 'bas... | delete | instruct | 0 |
Copy the sequence exactly.
(SEQUENCE)
x12 x43 x14 x60 x40 x41 x27 x40 x64 x27 x41 x11 x18 x48 x51 x45 x32 x53 x46 x17 x42 x1 x13 x24 x6 x48 x9 x40 x1 x48 x32 x47 | x12 x43 x14 x60 x40 x41 x27 x40 x64 x27 x41 x11 x18 x48 x51 x45 x32 x53 x46 x17 x42 x1 x13 x24 x6 x48 x9 x40 x1 x48 x32 x47 | {'task': 'identity', 'seq': ['x12', 'x43', 'x14', 'x60', 'x40', 'x41', 'x27', 'x40', 'x64', 'x27', 'x41', 'x11', 'x18', 'x48', 'x51', 'x45', 'x32', 'x53', 'x46', 'x17', 'x42', 'x1', 'x13', 'x24', 'x6', 'x48', 'x9', 'x40', 'x1', 'x48', 'x32', 'x47'], 'k': 4, 'n': 32, '_time': 0.0004379749298095703, '_task': 'basic_proce... | 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)
x8 x24 x26 x41 x48 x32 x10 x34 x44 x46 x24 x39 x50 x61 x51 x63
(B)
x13 x47 x48 x50 x7 x36 x32 x17 x37 x22 x25 x64 x6 x7 x17 x33 | x8 x24 x26 x41 x48 x32 x10 x34 x44 x46 x39 x50 x61 x51 x63 x13 x47 x7 x36 x17 x37 x22 x25 x64 x6 x33 | {'task': 'union', 'seq': [['x8', 'x24', 'x26', 'x41', 'x48', 'x32', 'x10', 'x34', 'x44', 'x46', 'x24', 'x39', 'x50', 'x61', 'x51', 'x63'], ['x13', 'x47', 'x48', 'x50', 'x7', 'x36', 'x32', 'x17', 'x37', 'x22', 'x25', 'x64', 'x6', 'x7', 'x17', 'x33']], 'k': 4, 'n': 32, '_time': 0.0004811286926269531, '_task': 'basic_proc... | 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. | o1 c1 o0 c0 o3 c3 o1 c1 o3 c3 o1 o2 c1 o1 o1 c1 o2 o3 o2 o2 c3 c2 c2 o3 c1 o2 c2 o1 c1 c3 c2 c2 | {'task': 'dyck_shuffle', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0004961490631103516, '_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)
x57 x15 x21 x44 x22 x37 x48 x30 x28 x58 x56 x22 x42 x43 x9 x29 x60 x42 x52 x61 x48 x16 x4 x32 x59 x54 x17 x18 x56 x26 x15 x29 | x4 x9 x15 x15 x16 x17 x18 x21 x22 x22 x26 x28 x29 x29 x30 x32 x37 x42 x42 x43 x44 x48 x48 x52 x54 x56 x56 x57 x58 x59 x60 x61 | {'task': 'sort', 'seq': ['x57', 'x15', 'x21', 'x44', 'x22', 'x37', 'x48', 'x30', 'x28', 'x58', 'x56', 'x22', 'x42', 'x43', 'x9', 'x29', 'x60', 'x42', 'x52', 'x61', 'x48', 'x16', 'x4', 'x32', 'x59', 'x54', 'x17', 'x18', 'x56', 'x26', 'x15', 'x29'], 'k': 4, 'n': 32, '_time': 0.00047087669372558594, '_task': 'basic_proced... | sort | instruct | 0 |
Reverse the sequence.
(SEQUENCE)
x33 x38 x45 x41 x22 x45 x4 x21 x26 x46 x18 x23 x9 x30 x56 x19 x47 x56 x13 x27 x10 x38 x4 x22 x58 x32 x64 x38 x27 x24 x56 x40 | x40 x56 x24 x27 x38 x64 x32 x58 x22 x4 x38 x10 x27 x13 x56 x47 x19 x56 x30 x9 x23 x18 x46 x26 x21 x4 x45 x22 x41 x45 x38 x33 | {'task': 'reverse', 'seq': ['x33', 'x38', 'x45', 'x41', 'x22', 'x45', 'x4', 'x21', 'x26', 'x46', 'x18', 'x23', 'x9', 'x30', 'x56', 'x19', 'x47', 'x56', 'x13', 'x27', 'x10', 'x38', 'x4', 'x22', 'x58', 'x32', 'x64', 'x38', 'x27', 'x24', 'x56', 'x40'], 'k': 4, 'n': 32, '_time': 0.0004436969757080078, '_task': 'basic_proce... | 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 x20; PUSH x28; POP; POP; PUSH x33; PUSH x16; PUSH x28; PUSH x51; PUSH x52; PUSH x36; POP; PUSH x9; PUSH x6; POP; PUSH x52; POP; PUSH x35; PUSH x47; PUSH x... | x4 x28 x16 x33 | {'task': 'stack', 'seq': ['PUSH x20', 'PUSH x28', 'POP', 'POP', 'PUSH x33', 'PUSH x16', 'PUSH x28', 'PUSH x51', 'PUSH x52', 'PUSH x36', 'POP', 'PUSH x9', 'PUSH x6', 'POP', 'PUSH x52', 'POP', 'PUSH x35', 'PUSH x47', 'PUSH x47', 'PUSH x45', 'PUSH x16', 'POP', 'POP', 'PUSH x59', 'POP', 'POP', '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. | o2 o1 c1 c2 o3 o3 c3 c3 o2 o2 c2 o2 c2 c2 o1 c1 o3 o1 c1 o2 o0 o1 c1 o0 c0 c0 o0 c0 o1 c1 c2 c3 | {'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0004127025604248047, '_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. | o3 c3 o2 o2 o1 c1 o1 o3 c3 o1 c1 c1 o0 c0 c2 o1 o1 c1 c1 c2 o0 o2 c2 c0 o3 c3 o2 o0 c0 c2 o0 c0 | {'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0004165172576904297, '_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 |
Sort the sequence in ascending numeric order, where x2 < x10.
(SEQUENCE)
x10 x47 x20 x64 x51 x56 x34 x55 x9 x50 x47 x58 x2 x54 x12 x41 x48 x47 x7 x4 x56 x30 x19 x27 x49 x23 x61 x49 x51 x64 x51 x24 | x2 x4 x7 x9 x10 x12 x19 x20 x23 x24 x27 x30 x34 x41 x47 x47 x47 x48 x49 x49 x50 x51 x51 x51 x54 x55 x56 x56 x58 x61 x64 x64 | {'task': 'sort', 'seq': ['x10', 'x47', 'x20', 'x64', 'x51', 'x56', 'x34', 'x55', 'x9', 'x50', 'x47', 'x58', 'x2', 'x54', 'x12', 'x41', 'x48', 'x47', 'x7', 'x4', 'x56', 'x30', 'x19', 'x27', 'x49', 'x23', 'x61', 'x49', 'x51', 'x64', 'x51', 'x24'], 'k': 4, 'n': 32, '_time': 0.0004773139953613281, '_task': 'basic_procedura... | 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)
x7 x13 x34 x32 x3 x39 x60 x16 x60 x11 x45 x21 x9 x24 x10 x20
(B)
x11 x20 x50 x33 x34 x34 x8 x10 x38 x52 x1 x56 x23 x23 x32 x35 | x7 x13 x34 x32 x3 x39 x60 x16 x11 x45 x21 x9 x24 x10 x20 x50 x33 x8 x38 x52 x1 x56 x23 x35 | {'task': 'union', 'seq': [['x7', 'x13', 'x34', 'x32', 'x3', 'x39', 'x60', 'x16', 'x60', 'x11', 'x45', 'x21', 'x9', 'x24', 'x10', 'x20'], ['x11', 'x20', 'x50', 'x33', 'x34', 'x34', 'x8', 'x10', 'x38', 'x52', 'x1', 'x56', 'x23', 'x23', 'x32', 'x35']], 'k': 4, 'n': 32, '_time': 0.00048613548278808594, '_task': 'basic_proc... | union | instruct | 0 |
Return the unique elements of the sequence in order of first appearance.
(SEQUENCE)
x45 x26 x35 x15 x8 x62 x30 x34 x27 x38 x60 x23 x29 x64 x19 x16 x9 x36 x17 x62 x12 x48 x34 x25 x57 x32 x42 x57 x49 x15 x17 x25 | x45 x26 x35 x15 x8 x62 x30 x34 x27 x38 x60 x23 x29 x64 x19 x16 x9 x36 x17 x12 x48 x25 x57 x32 x42 x49 | {'task': 'set', 'seq': ['x45', 'x26', 'x35', 'x15', 'x8', 'x62', 'x30', 'x34', 'x27', 'x38', 'x60', 'x23', 'x29', 'x64', 'x19', 'x16', 'x9', 'x36', 'x17', 'x62', 'x12', 'x48', 'x34', 'x25', 'x57', 'x32', 'x42', 'x57', 'x49', 'x15', 'x17', 'x25'], 'k': 4, 'n': 32, '_time': 0.0004553794860839844, '_task': 'basic_procedur... | set | instruct | 0 |
Sort the sequence in ascending numeric order, where x2 < x10.
(SEQUENCE)
x16 x10 x55 x39 x58 x9 x21 x20 x26 x29 x20 x6 x1 x54 x39 x27 x17 x4 x16 x33 x34 x34 x60 x38 x42 x12 x64 x32 x44 x22 x7 x15 | x1 x4 x6 x7 x9 x10 x12 x15 x16 x16 x17 x20 x20 x21 x22 x26 x27 x29 x32 x33 x34 x34 x38 x39 x39 x42 x44 x54 x55 x58 x60 x64 | {'task': 'sort', 'seq': ['x16', 'x10', 'x55', 'x39', 'x58', 'x9', 'x21', 'x20', 'x26', 'x29', 'x20', 'x6', 'x1', 'x54', 'x39', 'x27', 'x17', 'x4', 'x16', 'x33', 'x34', 'x34', 'x60', 'x38', 'x42', 'x12', 'x64', 'x32', 'x44', 'x22', 'x7', 'x15'], 'k': 4, 'n': 32, '_time': 0.0004680156707763672, '_task': 'basic_procedural... | 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)
x15 x37 x15 x2 x16 x42 x29 x50 x33 x33 x39 x22 x39 x63 x31 x56
(B)
x19 x25 x37 x36 x53 x50 x22 x17 x52 x27 x44 x23 x64 x27 x13 x35 | x15 x37 x2 x16 x42 x29 x50 x33 x39 x22 x63 x31 x56 x19 x25 x36 x53 x17 x52 x27 x44 x23 x64 x13 x35 | {'task': 'union', 'seq': [['x15', 'x37', 'x15', 'x2', 'x16', 'x42', 'x29', 'x50', 'x33', 'x33', 'x39', 'x22', 'x39', 'x63', 'x31', 'x56'], ['x19', 'x25', 'x37', 'x36', 'x53', 'x50', 'x22', 'x17', 'x52', 'x27', 'x44', 'x23', 'x64', 'x27', 'x13', 'x35']], 'k': 4, 'n': 32, '_time': 0.0004782676696777344, '_task': 'basic_p... | 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)
x61 x49 x35 x48 x8 x23 x15 x28 x58 x12 x61 x43 x6 x18 x37 x53
(B)
x28 x46 x13 x7 x4 x46 x33 x63 x11 x9 x61 x60 x2 x29 x16 x47 | x61 x49 x35 x48 x8 x23 x15 x28 x58 x12 x43 x6 x18 x37 x53 x46 x13 x7 x4 x33 x63 x11 x9 x60 x2 x29 x16 x47 | {'task': 'union', 'seq': [['x61', 'x49', 'x35', 'x48', 'x8', 'x23', 'x15', 'x28', 'x58', 'x12', 'x61', 'x43', 'x6', 'x18', 'x37', 'x53'], ['x28', 'x46', 'x13', 'x7', 'x4', 'x46', 'x33', 'x63', 'x11', 'x9', 'x61', 'x60', 'x2', 'x29', 'x16', 'x47']], 'k': 4, 'n': 32, '_time': 0.0004851818084716797, '_task': 'basic_proced... | 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)
x14 x62 x13 x8 x52 x59 x63 x60 x25 x50 x10 x55 x19 x1 x8 x52
(B)
x26 x26 x14 x4 x26 x52 x43 x46 x10 x44 x2 x49 x52 x62 x32 x12 | x14 x62 x13 x8 x52 x59 x63 x60 x25 x50 x10 x55 x19 x1 x26 x4 x43 x46 x44 x2 x49 x32 x12 | {'task': 'union', 'seq': [['x14', 'x62', 'x13', 'x8', 'x52', 'x59', 'x63', 'x60', 'x25', 'x50', 'x10', 'x55', 'x19', 'x1', 'x8', 'x52'], ['x26', 'x26', 'x14', 'x4', 'x26', 'x52', 'x43', 'x46', 'x10', 'x44', 'x2', 'x49', 'x52', 'x62', 'x32', 'x12']], 'k': 4, 'n': 32, '_time': 0.0004811286926269531, '_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 x12; PUSH x38; PUSH x14; PUSH x31; PUSH x59; PUSH x22; POP; PUSH x12; PUSH x51; PUSH x41; PUSH x57; PUSH x17; POP; PUSH x4; PUSH x6; PUSH x8; PUSH x51; PU... | x54 x23 x14 x51 x8 x6 x4 x57 x41 x51 x12 x59 x31 x14 x38 x12 | {'task': 'stack', 'seq': ['PUSH x12', 'PUSH x38', 'PUSH x14', 'PUSH x31', 'PUSH x59', 'PUSH x22', 'POP', 'PUSH x12', 'PUSH x51', 'PUSH x41', 'PUSH x57', 'PUSH x17', 'POP', 'PUSH x4', 'PUSH x6', 'PUSH x8', 'PUSH x51', 'PUSH x14', 'PUSH x23', 'PUSH x53', 'PUSH x41', 'PUSH x25', 'PUSH x13', 'PUSH x35', 'POP', 'PUSH x56', ... | 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 c2 o3 c3 o3 c3 o2 c2 o3 o0 c0 c3 o1 c1 o1 o0 o2 o1 c1 c1 c2 c0 o1 o1 c1 o1 o2 o2 c1 c1 c2 c2 | {'task': 'dyck_shuffle', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0004818439483642578, '_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)
x44 x12 x7 x60 x37 x19 x27 x8 x63 x64 x5 x26 x55 x7 x42 x62 x45 x8 x37 x59 x4 x58 x53 x4 x61 x37 x63 x27 x40 x20 x48 x31 | x44 x12 x7 x60 x37 x19 x27 x8 x63 x64 x5 x26 x55 x42 x62 x45 x59 x4 x58 x53 x61 x40 x20 x48 x31 | {'task': 'set', 'seq': ['x44', 'x12', 'x7', 'x60', 'x37', 'x19', 'x27', 'x8', 'x63', 'x64', 'x5', 'x26', 'x55', 'x7', 'x42', 'x62', 'x45', 'x8', 'x37', 'x59', 'x4', 'x58', 'x53', 'x4', 'x61', 'x37', 'x63', 'x27', 'x40', 'x20', 'x48', 'x31'], 'k': 4, 'n': 32, '_time': 0.00044918060302734375, '_task': 'basic_procedural',... | set | 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 c2 o0 o1 c0 o1 c1 o2 o0 o3 c1 c2 c3 o3 c3 c0 o1 c1 o3 o1 c3 c1 o2 c2 o3 c3 o2 o3 c2 o1 c3 c1 | {'task': 'dyck_shuffle', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0004868507385253906, '_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)
x41 x55 x49 x44 x31 x14 x3 x11 x13 x42 x59 x19 x60 x62 x18 x11
(B)
x57 x38 x13 x48 x27 x45 x18 x46 x41 x20 x11 x58 x52 x3 x58 x20 | x41 x55 x49 x44 x31 x14 x3 x11 x13 x42 x59 x19 x60 x62 x18 x57 x38 x48 x27 x45 x46 x20 x58 x52 | {'task': 'union', 'seq': [['x41', 'x55', 'x49', 'x44', 'x31', 'x14', 'x3', 'x11', 'x13', 'x42', 'x59', 'x19', 'x60', 'x62', 'x18', 'x11'], ['x57', 'x38', 'x13', 'x48', 'x27', 'x45', 'x18', 'x46', 'x41', 'x20', 'x11', 'x58', 'x52', 'x3', 'x58', 'x20']], 'k': 4, 'n': 32, '_time': 0.0004811286926269531, '_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. | o0 o1 o2 c2 c1 c0 o2 o3 c3 c2 o3 o2 c2 c3 o2 c2 o0 c0 o1 o3 c3 c1 o3 c3 o2 c2 o0 o1 c1 o3 c3 c0 | {'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0004115104675292969, '_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 |
Copy the sequence exactly.
(SEQUENCE)
x36 x57 x58 x10 x9 x2 x9 x26 x26 x63 x18 x3 x62 x58 x49 x24 x42 x50 x32 x3 x15 x44 x54 x20 x20 x60 x9 x30 x39 x46 x19 x33 | x36 x57 x58 x10 x9 x2 x9 x26 x26 x63 x18 x3 x62 x58 x49 x24 x42 x50 x32 x3 x15 x44 x54 x20 x20 x60 x9 x30 x39 x46 x19 x33 | {'task': 'identity', 'seq': ['x36', 'x57', 'x58', 'x10', 'x9', 'x2', 'x9', 'x26', 'x26', 'x63', 'x18', 'x3', 'x62', 'x58', 'x49', 'x24', 'x42', 'x50', 'x32', 'x3', 'x15', 'x44', 'x54', 'x20', 'x20', 'x60', 'x9', 'x30', 'x39', 'x46', 'x19', 'x33'], 'k': 4, 'n': 32, '_time': 0.0004432201385498047, '_task': 'basic_procedu... | identity | 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 x44; PUSH x14; PUSH x13; POP; PUSH x26; PUSH x25; PUSH x18; POP; PUSH x22; PUSH x43; PUSH x48; PUSH x49; POP; PUSH x7; POP; PUSH x16; PUSH x46; PUSH x27; ... | x16 x48 x43 x22 x25 x26 x14 x44 | {'task': 'stack', 'seq': ['PUSH x44', 'PUSH x14', 'PUSH x13', 'POP', 'PUSH x26', 'PUSH x25', 'PUSH x18', 'POP', 'PUSH x22', 'PUSH x43', 'PUSH x48', 'PUSH x49', 'POP', 'PUSH x7', 'POP', 'PUSH x16', 'PUSH x46', 'PUSH x27', 'POP', 'POP', 'PUSH x32', 'PUSH x40', 'PUSH x26', 'POP', 'PUSH x11', 'PUSH x35', 'PUSH x8', 'POP', ... | stack | instruct | 0 |
Return the unique elements of the sequence in order of first appearance.
(SEQUENCE)
x51 x29 x52 x36 x41 x57 x43 x55 x20 x23 x9 x3 x26 x30 x34 x34 x38 x45 x16 x49 x37 x42 x32 x60 x64 x12 x6 x2 x60 x43 x48 x23 | x51 x29 x52 x36 x41 x57 x43 x55 x20 x23 x9 x3 x26 x30 x34 x38 x45 x16 x49 x37 x42 x32 x60 x64 x12 x6 x2 x48 | {'task': 'set', 'seq': ['x51', 'x29', 'x52', 'x36', 'x41', 'x57', 'x43', 'x55', 'x20', 'x23', 'x9', 'x3', 'x26', 'x30', 'x34', 'x34', 'x38', 'x45', 'x16', 'x49', 'x37', 'x42', 'x32', 'x60', 'x64', 'x12', 'x6', 'x2', 'x60', 'x43', 'x48', 'x23'], 'k': 4, 'n': 32, '_time': 0.0004665851593017578, '_task': 'basic_procedural... | set | instruct | 0 |
Delete the first occurrence of TARGET from SEQUENCE. If TARGET is absent, return SEQUENCE unchanged.
(SEQUENCE)
x2 x3 x64 x23 x48 x61 x12 x15 x12 x56 x11 x7 x32 x4 x15 x42 x37 x5 x14 x24 x22 x51 x20 x19 x8 x5 x7 x50 x45 x58 x51 x12
(TARGET)
x5 | x2 x3 x64 x23 x48 x61 x12 x15 x12 x56 x11 x7 x32 x4 x15 x42 x37 x14 x24 x22 x51 x20 x19 x8 x5 x7 x50 x45 x58 x51 x12 | {'task': 'delete', 'seq': [['x2', 'x3', 'x64', 'x23', 'x48', 'x61', 'x12', 'x15', 'x12', 'x56', 'x11', 'x7', 'x32', 'x4', 'x15', 'x42', 'x37', 'x5', 'x14', 'x24', 'x22', 'x51', 'x20', 'x19', 'x8', 'x5', 'x7', 'x50', 'x45', 'x58', 'x51', 'x12'], 'x5'], 'k': 4, 'n': 32, '_time': 0.0004665851593017578, '_task': 'basic_pro... | delete | instruct | 0 |
Sort the sequence in ascending numeric order, where x2 < x10.
(SEQUENCE)
x13 x29 x16 x26 x14 x45 x41 x4 x59 x48 x55 x56 x25 x11 x52 x53 x18 x58 x10 x23 x61 x33 x52 x60 x19 x37 x28 x15 x4 x10 x42 x47 | x4 x4 x10 x10 x11 x13 x14 x15 x16 x18 x19 x23 x25 x26 x28 x29 x33 x37 x41 x42 x45 x47 x48 x52 x52 x53 x55 x56 x58 x59 x60 x61 | {'task': 'sort', 'seq': ['x13', 'x29', 'x16', 'x26', 'x14', 'x45', 'x41', 'x4', 'x59', 'x48', 'x55', 'x56', 'x25', 'x11', 'x52', 'x53', 'x18', 'x58', 'x10', 'x23', 'x61', 'x33', 'x52', 'x60', 'x19', 'x37', 'x28', 'x15', 'x4', 'x10', 'x42', 'x47'], 'k': 4, 'n': 32, '_time': 0.00046563148498535156, '_task': 'basic_proced... | 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 x12; PUSH x6; PUSH x10; PUSH x38; PUSH x20; POP; PUSH x42; PUSH x27; POP; PUSH x29; PUSH x23; PUSH x23; PUSH x18; POP; PUSH x59; POP; POP; PUSH x45; PUSH ... | x6 x12 | {'task': 'stack', 'seq': ['PUSH x12', 'PUSH x6', 'PUSH x10', 'PUSH x38', 'PUSH x20', 'POP', 'PUSH x42', 'PUSH x27', 'POP', 'PUSH x29', 'PUSH x23', 'PUSH x23', 'PUSH x18', 'POP', 'PUSH x59', 'POP', 'POP', 'PUSH x45', 'PUSH x63', 'PUSH x9', 'PUSH x24', 'PUSH x38', 'POP', 'POP', 'POP', 'POP', 'POP', 'POP', 'POP', 'POP', '... | stack | instruct | 0 |
Copy the sequence exactly.
(SEQUENCE)
x42 x62 x36 x42 x6 x15 x58 x51 x50 x9 x53 x4 x11 x4 x2 x7 x50 x15 x37 x16 x33 x23 x44 x25 x22 x61 x33 x31 x18 x36 x37 x57 | x42 x62 x36 x42 x6 x15 x58 x51 x50 x9 x53 x4 x11 x4 x2 x7 x50 x15 x37 x16 x33 x23 x44 x25 x22 x61 x33 x31 x18 x36 x37 x57 | {'task': 'identity', 'seq': ['x42', 'x62', 'x36', 'x42', 'x6', 'x15', 'x58', 'x51', 'x50', 'x9', 'x53', 'x4', 'x11', 'x4', 'x2', 'x7', 'x50', 'x15', 'x37', 'x16', 'x33', 'x23', 'x44', 'x25', 'x22', 'x61', 'x33', 'x31', 'x18', 'x36', 'x37', 'x57'], 'k': 4, 'n': 32, '_time': 0.0003829002380371094, '_task': 'basic_procedu... | 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. | o3 c3 o2 o1 c2 o1 o3 o1 o2 c2 c3 o1 o1 c1 c1 o0 c0 c1 c1 c1 o0 c0 o1 c1 o3 o2 c3 o1 o3 c1 c3 c2 | {'task': 'dyck_shuffle', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0004820823669433594, '_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)
x18 x3 x42 x49 x15 x44 x52 x20 x60 x62 x57 x47 x51 x22 x37 x58
(B)
x38 x11 x7 x11 x52 x30 x49 x49 x7 x51 x61 x41 x16 x46 x33 x7 | x18 x3 x42 x49 x15 x44 x52 x20 x60 x62 x57 x47 x51 x22 x37 x58 x38 x11 x7 x30 x61 x41 x16 x46 x33 | {'task': 'union', 'seq': [['x18', 'x3', 'x42', 'x49', 'x15', 'x44', 'x52', 'x20', 'x60', 'x62', 'x57', 'x47', 'x51', 'x22', 'x37', 'x58'], ['x38', 'x11', 'x7', 'x11', 'x52', 'x30', 'x49', 'x49', 'x7', 'x51', 'x61', 'x41', 'x16', 'x46', 'x33', 'x7']], 'k': 4, 'n': 32, '_time': 0.0004773139953613281, '_task': 'basic_proc... | union | instruct | 0 |
Sort the sequence in ascending numeric order, where x2 < x10.
(SEQUENCE)
x46 x54 x8 x41 x57 x50 x34 x8 x5 x37 x63 x27 x50 x7 x14 x2 x3 x7 x27 x2 x6 x59 x27 x24 x16 x41 x27 x50 x12 x4 x13 x50 | x2 x2 x3 x4 x5 x6 x7 x7 x8 x8 x12 x13 x14 x16 x24 x27 x27 x27 x27 x34 x37 x41 x41 x46 x50 x50 x50 x50 x54 x57 x59 x63 | {'task': 'sort', 'seq': ['x46', 'x54', 'x8', 'x41', 'x57', 'x50', 'x34', 'x8', 'x5', 'x37', 'x63', 'x27', 'x50', 'x7', 'x14', 'x2', 'x3', 'x7', 'x27', 'x2', 'x6', 'x59', 'x27', 'x24', 'x16', 'x41', 'x27', 'x50', 'x12', 'x4', 'x13', 'x50'], 'k': 4, 'n': 32, '_time': 0.00046443939208984375, '_task': 'basic_procedural', '... | sort | instruct | 0 |
Return the unique elements of the sequence in order of first appearance.
(SEQUENCE)
x7 x20 x25 x1 x35 x41 x44 x54 x59 x47 x29 x3 x59 x26 x14 x13 x2 x46 x29 x47 x19 x2 x16 x24 x51 x61 x38 x49 x6 x60 x31 x19 | x7 x20 x25 x1 x35 x41 x44 x54 x59 x47 x29 x3 x26 x14 x13 x2 x46 x19 x16 x24 x51 x61 x38 x49 x6 x60 x31 | {'task': 'set', 'seq': ['x7', 'x20', 'x25', 'x1', 'x35', 'x41', 'x44', 'x54', 'x59', 'x47', 'x29', 'x3', 'x59', 'x26', 'x14', 'x13', 'x2', 'x46', 'x29', 'x47', 'x19', 'x2', 'x16', 'x24', 'x51', 'x61', 'x38', 'x49', 'x6', 'x60', 'x31', 'x19'], 'k': 4, 'n': 32, '_time': 0.0004553794860839844, '_task': 'basic_procedural',... | set | instruct | 0 |
Return the unique elements of the sequence in order of first appearance.
(SEQUENCE)
x63 x51 x48 x23 x15 x46 x45 x46 x64 x12 x17 x29 x27 x46 x1 x45 x39 x55 x32 x39 x16 x5 x43 x15 x62 x27 x11 x15 x5 x62 x22 x1 | x63 x51 x48 x23 x15 x46 x45 x64 x12 x17 x29 x27 x1 x39 x55 x32 x16 x5 x43 x62 x11 x22 | {'task': 'set', 'seq': ['x63', 'x51', 'x48', 'x23', 'x15', 'x46', 'x45', 'x46', 'x64', 'x12', 'x17', 'x29', 'x27', 'x46', 'x1', 'x45', 'x39', 'x55', 'x32', 'x39', 'x16', 'x5', 'x43', 'x15', 'x62', 'x27', 'x11', 'x15', 'x5', 'x62', 'x22', 'x1'], 'k': 4, 'n': 32, '_time': 0.0004513263702392578, '_task': 'basic_procedural... | set | 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 c2 o0 o3 o1 o0 o0 o0 c1 c3 o0 c0 o2 c0 c0 o0 c0 o1 o2 c1 o0 o0 o1 o3 c2 c1 c2 c3 c0 c0 c0 c0 | {'task': 'dyck_shuffle', 'seq': [], 'k': 4, 'n': 32, '_time': 0.00048279762268066406, '_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 x26; PUSH x49; POP; PUSH x25; PUSH x24; PUSH x6; POP; PUSH x7; PUSH x15; PUSH x44; PUSH x2; POP; PUSH x1; PUSH x19; PUSH x13; PUSH x47; POP; PUSH x32; PUS... | x26 x1 x44 x15 x7 x24 x25 x26 | {'task': 'stack', 'seq': ['PUSH x26', 'PUSH x49', 'POP', 'PUSH x25', 'PUSH x24', 'PUSH x6', 'POP', 'PUSH x7', 'PUSH x15', 'PUSH x44', 'PUSH x2', 'POP', 'PUSH x1', 'PUSH x19', 'PUSH x13', 'PUSH x47', 'POP', 'PUSH x32', 'PUSH x10', 'POP', 'PUSH x42', 'POP', 'POP', 'POP', 'POP', 'PUSH x56', 'POP', 'PUSH x26', 'PUSH x62', ... | stack | instruct | 0 |
Return the unique elements of the sequence in order of first appearance.
(SEQUENCE)
x49 x29 x33 x61 x43 x39 x38 x2 x14 x41 x14 x6 x1 x11 x46 x16 x3 x48 x26 x29 x54 x26 x39 x41 x30 x54 x26 x22 x3 x5 x50 x34 | x49 x29 x33 x61 x43 x39 x38 x2 x14 x41 x6 x1 x11 x46 x16 x3 x48 x26 x54 x30 x22 x5 x50 x34 | {'task': 'set', 'seq': ['x49', 'x29', 'x33', 'x61', 'x43', 'x39', 'x38', 'x2', 'x14', 'x41', 'x14', 'x6', 'x1', 'x11', 'x46', 'x16', 'x3', 'x48', 'x26', 'x29', 'x54', 'x26', 'x39', 'x41', 'x30', 'x54', 'x26', 'x22', 'x3', 'x5', 'x50', 'x34'], 'k': 4, 'n': 32, '_time': 0.0004494190216064453, '_task': 'basic_procedural',... | set | instruct | 0 |
Copy the sequence exactly.
(SEQUENCE)
x46 x59 x57 x29 x14 x27 x53 x49 x35 x32 x16 x11 x29 x39 x48 x41 x10 x21 x46 x4 x18 x62 x47 x18 x22 x38 x34 x43 x45 x31 x17 x27 | x46 x59 x57 x29 x14 x27 x53 x49 x35 x32 x16 x11 x29 x39 x48 x41 x10 x21 x46 x4 x18 x62 x47 x18 x22 x38 x34 x43 x45 x31 x17 x27 | {'task': 'identity', 'seq': ['x46', 'x59', 'x57', 'x29', 'x14', 'x27', 'x53', 'x49', 'x35', 'x32', 'x16', 'x11', 'x29', 'x39', 'x48', 'x41', 'x10', 'x21', 'x46', 'x4', 'x18', 'x62', 'x47', 'x18', 'x22', 'x38', 'x34', 'x43', 'x45', 'x31', 'x17', 'x27'], 'k': 4, 'n': 32, '_time': 0.0004401206970214844, '_task': 'basic_pr... | identity | 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 o1 o3 c3 o0 c0 c1 c0 o1 c1 o2 o0 o0 c0 c0 c2 o3 o3 c3 c3 o2 c2 o1 o3 o2 o0 o1 c1 c0 c2 c3 c1 | {'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0004177093505859375, '_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 |
Sort the sequence in ascending numeric order, where x2 < x10.
(SEQUENCE)
x31 x19 x31 x34 x50 x42 x2 x44 x28 x2 x47 x4 x43 x35 x44 x24 x26 x51 x13 x54 x26 x45 x41 x26 x45 x3 x3 x8 x37 x46 x18 x24 | x2 x2 x3 x3 x4 x8 x13 x18 x19 x24 x24 x26 x26 x26 x28 x31 x31 x34 x35 x37 x41 x42 x43 x44 x44 x45 x45 x46 x47 x50 x51 x54 | {'task': 'sort', 'seq': ['x31', 'x19', 'x31', 'x34', 'x50', 'x42', 'x2', 'x44', 'x28', 'x2', 'x47', 'x4', 'x43', 'x35', 'x44', 'x24', 'x26', 'x51', 'x13', 'x54', 'x26', 'x45', 'x41', 'x26', 'x45', 'x3', 'x3', 'x8', 'x37', 'x46', 'x18', 'x24'], 'k': 4, 'n': 32, '_time': 0.0004673004150390625, '_task': 'basic_procedural'... | sort | instruct | 0 |
Reverse the sequence.
(SEQUENCE)
x32 x33 x33 x16 x50 x16 x20 x24 x49 x42 x51 x63 x54 x40 x52 x62 x52 x50 x46 x20 x18 x29 x12 x64 x38 x13 x42 x56 x58 x18 x50 x48 | x48 x50 x18 x58 x56 x42 x13 x38 x64 x12 x29 x18 x20 x46 x50 x52 x62 x52 x40 x54 x63 x51 x42 x49 x24 x20 x16 x50 x16 x33 x33 x32 | {'task': 'reverse', 'seq': ['x32', 'x33', 'x33', 'x16', 'x50', 'x16', 'x20', 'x24', 'x49', 'x42', 'x51', 'x63', 'x54', 'x40', 'x52', 'x62', 'x52', 'x50', 'x46', 'x20', 'x18', 'x29', 'x12', 'x64', 'x38', 'x13', 'x42', 'x56', 'x58', 'x18', 'x50', 'x48'], 'k': 4, 'n': 32, '_time': 0.00043892860412597656, '_task': 'basic_p... | reverse | instruct | 0 |
Reverse the sequence.
(SEQUENCE)
x42 x16 x61 x62 x13 x63 x28 x21 x47 x52 x10 x22 x27 x47 x11 x58 x64 x51 x33 x1 x21 x42 x60 x44 x2 x2 x2 x49 x26 x42 x26 x44 | x44 x26 x42 x26 x49 x2 x2 x2 x44 x60 x42 x21 x1 x33 x51 x64 x58 x11 x47 x27 x22 x10 x52 x47 x21 x28 x63 x13 x62 x61 x16 x42 | {'task': 'reverse', 'seq': ['x42', 'x16', 'x61', 'x62', 'x13', 'x63', 'x28', 'x21', 'x47', 'x52', 'x10', 'x22', 'x27', 'x47', 'x11', 'x58', 'x64', 'x51', 'x33', 'x1', 'x21', 'x42', 'x60', 'x44', 'x2', 'x2', 'x2', 'x49', 'x26', 'x42', 'x26', 'x44'], 'k': 4, 'n': 32, '_time': 0.00044274330139160156, '_task': 'basic_proce... | 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)
x21 x50 x60 x51 x48 x60 x63 x13 x30 x35 x30 x27 x48 x19 x5 x49
(B)
x9 x54 x39 x9 x11 x58 x39 x3 x9 x50 x43 x17 x50 x26 x52 x3 | x21 x50 x60 x51 x48 x63 x13 x30 x35 x27 x19 x5 x49 x9 x54 x39 x11 x58 x3 x43 x17 x26 x52 | {'task': 'union', 'seq': [['x21', 'x50', 'x60', 'x51', 'x48', 'x60', 'x63', 'x13', 'x30', 'x35', 'x30', 'x27', 'x48', 'x19', 'x5', 'x49'], ['x9', 'x54', 'x39', 'x9', 'x11', 'x58', 'x39', 'x3', 'x9', 'x50', 'x43', 'x17', 'x50', 'x26', 'x52', 'x3']], 'k': 4, 'n': 32, '_time': 0.00048041343688964844, '_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. | o1 c1 o1 c1 o3 c3 o1 c1 o3 c3 o0 c0 o0 o1 o0 c1 c0 c0 o1 o3 o1 c3 c1 o1 o2 c1 c1 o1 c2 o0 c1 c0 | {'task': 'dyck_shuffle', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0005152225494384766, '_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)
x31 x36 x53 x52 x3 x13 x52 x38 x6 x42 x45 x37 x11 x2 x33 x18 x50 x28 x37 x20 x53 x34 x13 x22 x9 x51 x34 x52 x10 x47 x61 x53 | x53 x61 x47 x10 x52 x34 x51 x9 x22 x13 x34 x53 x20 x37 x28 x50 x18 x33 x2 x11 x37 x45 x42 x6 x38 x52 x13 x3 x52 x53 x36 x31 | {'task': 'reverse', 'seq': ['x31', 'x36', 'x53', 'x52', 'x3', 'x13', 'x52', 'x38', 'x6', 'x42', 'x45', 'x37', 'x11', 'x2', 'x33', 'x18', 'x50', 'x28', 'x37', 'x20', 'x53', 'x34', 'x13', 'x22', 'x9', 'x51', 'x34', 'x52', 'x10', 'x47', 'x61', 'x53'], 'k': 4, 'n': 32, '_time': 0.0004374980926513672, '_task': 'basic_proced... | reverse | instruct | 0 |
Return the unique elements of the sequence in order of first appearance.
(SEQUENCE)
x31 x14 x5 x42 x29 x19 x25 x35 x7 x35 x11 x2 x41 x23 x29 x23 x16 x60 x38 x37 x7 x20 x12 x20 x53 x32 x50 x3 x48 x33 x13 x13 | x31 x14 x5 x42 x29 x19 x25 x35 x7 x11 x2 x41 x23 x16 x60 x38 x37 x20 x12 x53 x32 x50 x3 x48 x33 x13 | {'task': 'set', 'seq': ['x31', 'x14', 'x5', 'x42', 'x29', 'x19', 'x25', 'x35', 'x7', 'x35', 'x11', 'x2', 'x41', 'x23', 'x29', 'x23', 'x16', 'x60', 'x38', 'x37', 'x7', 'x20', 'x12', 'x20', 'x53', 'x32', 'x50', 'x3', 'x48', 'x33', 'x13', 'x13'], 'k': 4, 'n': 32, '_time': 0.0004432201385498047, '_task': 'basic_procedural'... | set | instruct | 0 |
Return the unique elements of the sequence in order of first appearance.
(SEQUENCE)
x44 x3 x5 x21 x24 x4 x9 x19 x61 x13 x42 x19 x27 x15 x26 x15 x24 x31 x12 x42 x60 x22 x52 x6 x38 x21 x7 x25 x49 x17 x35 x55 | x44 x3 x5 x21 x24 x4 x9 x19 x61 x13 x42 x27 x15 x26 x31 x12 x60 x22 x52 x6 x38 x7 x25 x49 x17 x35 x55 | {'task': 'set', 'seq': ['x44', 'x3', 'x5', 'x21', 'x24', 'x4', 'x9', 'x19', 'x61', 'x13', 'x42', 'x19', 'x27', 'x15', 'x26', 'x15', 'x24', 'x31', 'x12', 'x42', 'x60', 'x22', 'x52', 'x6', 'x38', 'x21', 'x7', 'x25', 'x49', 'x17', 'x35', 'x55'], 'k': 4, 'n': 32, '_time': 0.00044608116149902344, '_task': 'basic_procedural'... | set | 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 o1 o0 o2 c2 o1 o0 o3 c1 o3 o2 c2 c1 c0 c0 o1 c1 c3 o3 o1 c3 o0 c1 o2 c3 c2 c0 c1 o0 c0 o0 c0 | {'task': 'dyck_shuffle', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0004937648773193359, '_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)
x3 x57 x58 x24 x50 x14 x38 x41 x41 x17 x9 x53 x11 x50 x32 x63
(B)
x24 x50 x32 x42 x54 x51 x33 x39 x27 x41 x41 x13 x8 x18 x13 x11 | x3 x57 x58 x24 x50 x14 x38 x41 x17 x9 x53 x11 x32 x63 x42 x54 x51 x33 x39 x27 x13 x8 x18 | {'task': 'union', 'seq': [['x3', 'x57', 'x58', 'x24', 'x50', 'x14', 'x38', 'x41', 'x41', 'x17', 'x9', 'x53', 'x11', 'x50', 'x32', 'x63'], ['x24', 'x50', 'x32', 'x42', 'x54', 'x51', 'x33', 'x39', 'x27', 'x41', 'x41', 'x13', 'x8', 'x18', 'x13', 'x11']], 'k': 4, 'n': 32, '_time': 0.0004696846008300781, '_task': 'basic_pro... | 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 o2 o3 c2 c3 o2 o0 o3 c3 o1 o3 o3 o3 c2 o0 c1 o3 o3 o1 o0 o2 c3 c2 c3 c1 c0 c0 c0 c3 c3 c3 | {'task': 'dyck_shuffle', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0004737377166748047, '_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 x18; PUSH x57; PUSH x14; PUSH x15; PUSH x56; PUSH x15; PUSH x13; POP; POP; POP; POP; PUSH x50; PUSH x5; PUSH x46; POP; PUSH x12; PUSH x58; PUSH x15; PUSH ... | x57 x18 | {'task': 'stack', 'seq': ['PUSH x18', 'PUSH x57', 'PUSH x14', 'PUSH x15', 'PUSH x56', 'PUSH x15', 'PUSH x13', 'POP', 'POP', 'POP', 'POP', 'PUSH x50', 'PUSH x5', 'PUSH x46', 'POP', 'PUSH x12', 'PUSH x58', 'PUSH x15', 'PUSH x57', 'PUSH x37', 'PUSH x30', 'PUSH x10', 'POP', 'POP', 'POP', 'POP', 'POP', 'POP', 'POP', 'POP', ... | stack | instruct | 0 |
Reverse the sequence.
(SEQUENCE)
x6 x18 x59 x52 x35 x6 x36 x63 x20 x36 x20 x22 x11 x6 x2 x9 x7 x64 x55 x19 x50 x56 x49 x33 x54 x34 x30 x35 x61 x7 x28 x47 | x47 x28 x7 x61 x35 x30 x34 x54 x33 x49 x56 x50 x19 x55 x64 x7 x9 x2 x6 x11 x22 x20 x36 x20 x63 x36 x6 x35 x52 x59 x18 x6 | {'task': 'reverse', 'seq': ['x6', 'x18', 'x59', 'x52', 'x35', 'x6', 'x36', 'x63', 'x20', 'x36', 'x20', 'x22', 'x11', 'x6', 'x2', 'x9', 'x7', 'x64', 'x55', 'x19', 'x50', 'x56', 'x49', 'x33', 'x54', 'x34', 'x30', 'x35', 'x61', 'x7', 'x28', 'x47'], 'k': 4, 'n': 32, '_time': 0.00045943260192871094, '_task': 'basic_procedur... | 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)
x19 x21 x29 x30 x11 x26 x10 x63 x43 x41 x63 x36 x45 x28 x12 x13
(B)
x36 x57 x19 x48 x58 x53 x57 x62 x22 x62 x18 x10 x60 x6 x13 x64 | x19 x21 x29 x30 x11 x26 x10 x63 x43 x41 x36 x45 x28 x12 x13 x57 x48 x58 x53 x62 x22 x18 x60 x6 x64 | {'task': 'union', 'seq': [['x19', 'x21', 'x29', 'x30', 'x11', 'x26', 'x10', 'x63', 'x43', 'x41', 'x63', 'x36', 'x45', 'x28', 'x12', 'x13'], ['x36', 'x57', 'x19', 'x48', 'x58', 'x53', 'x57', 'x62', 'x22', 'x62', 'x18', 'x10', 'x60', 'x6', 'x13', 'x64']], 'k': 4, 'n': 32, '_time': 0.0004718303680419922, '_task': 'basic_p... | 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. | o0 o3 c0 c3 o0 c0 o1 c1 o3 o0 o2 o1 o2 c3 c1 o2 o0 o1 c0 o3 c2 o1 c1 c2 c0 o2 o2 c3 c2 c2 c1 c2 | {'task': 'dyck_shuffle', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0004744529724121094, '_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 x54; POP; PUSH x23; PUSH x7; PUSH x14; POP; PUSH x34; PUSH x63; PUSH x34; POP; PUSH x37; PUSH x61; PUSH x35; PUSH x13; PUSH x5; PUSH x22; PUSH x34; PUSH x... | x31 x34 x22 x5 x13 x35 x61 x37 x63 x34 x7 x23 | {'task': 'stack', 'seq': ['PUSH x54', 'POP', 'PUSH x23', 'PUSH x7', 'PUSH x14', 'POP', 'PUSH x34', 'PUSH x63', 'PUSH x34', 'POP', 'PUSH x37', 'PUSH x61', 'PUSH x35', 'PUSH x13', 'PUSH x5', 'PUSH x22', 'PUSH x34', 'PUSH x31', 'PUSH x3', 'POP', 'PUSH x31', 'PUSH x45', 'PUSH x18', 'POP', 'PUSH x18', 'POP', 'POP', 'PUSH x2... | 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 o3 o0 c0 c3 o2 c2 o3 o2 c2 c3 c1 o1 o2 o1 o2 c2 c1 c2 o0 c0 c1 o2 c2 o0 c0 o2 c2 o2 c2 o0 c0 | {'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0004248619079589844, '_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)
x42 x58 x26 x42 x21 x58 x41 x57 x33 x54 x7 x13 x50 x19 x34 x19 x30 x31 x3 x43 x32 x31 x18 x28 x41 x38 x54 x37 x22 x7 x64 x6
(TARGET)
x3 | x42 x58 x26 x42 x21 x58 x41 x57 x33 x54 x7 x13 x50 x19 x34 x19 x30 x31 x43 x32 x31 x18 x28 x41 x38 x54 x37 x22 x7 x64 x6 | {'task': 'delete', 'seq': [['x42', 'x58', 'x26', 'x42', 'x21', 'x58', 'x41', 'x57', 'x33', 'x54', 'x7', 'x13', 'x50', 'x19', 'x34', 'x19', 'x30', 'x31', 'x3', 'x43', 'x32', 'x31', 'x18', 'x28', 'x41', 'x38', 'x54', 'x37', 'x22', 'x7', 'x64', 'x6'], 'x3'], 'k': 4, 'n': 32, '_time': 0.00045800209045410156, '_task': 'basi... | 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 x56; POP; PUSH x5; PUSH x12; PUSH x28; POP; PUSH x13; PUSH x46; PUSH x48; PUSH x32; PUSH x49; POP; PUSH x61; PUSH x36; POP; PUSH x48; PUSH x46; POP; PUSH ... | x60 x25 x46 x13 x12 x5 | {'task': 'stack', 'seq': ['PUSH x56', 'POP', 'PUSH x5', 'PUSH x12', 'PUSH x28', 'POP', 'PUSH x13', 'PUSH x46', 'PUSH x48', 'PUSH x32', 'PUSH x49', 'POP', 'PUSH x61', 'PUSH x36', 'POP', 'PUSH x48', 'PUSH x46', 'POP', 'PUSH x2', 'PUSH x21', 'PUSH x16', 'PUSH x53', 'POP', 'POP', 'POP', 'POP', '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. | o2 c2 o0 o2 c2 c0 o3 c3 o1 o0 o0 o1 c1 o2 c2 c0 o2 c2 o3 o1 o1 o3 c3 c1 o1 c1 o3 c3 c1 c3 c0 c1 | {'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.00039196014404296875, '_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)
x42 x9 x17 x36 x57 x4 x35 x59 x56 x8 x42 x42 x60 x9 x42 x41
(B)
x7 x50 x64 x46 x40 x54 x64 x25 x19 x2 x61 x49 x44 x53 x49 x38 | x42 x9 x17 x36 x57 x4 x35 x59 x56 x8 x60 x41 x7 x50 x64 x46 x40 x54 x25 x19 x2 x61 x49 x44 x53 x38 | {'task': 'union', 'seq': [['x42', 'x9', 'x17', 'x36', 'x57', 'x4', 'x35', 'x59', 'x56', 'x8', 'x42', 'x42', 'x60', 'x9', 'x42', 'x41'], ['x7', 'x50', 'x64', 'x46', 'x40', 'x54', 'x64', 'x25', 'x19', 'x2', 'x61', 'x49', 'x44', 'x53', 'x49', 'x38']], 'k': 4, 'n': 32, '_time': 0.00047779083251953125, '_task': 'basic_proce... | union | instruct | 0 |
Sort the sequence in ascending numeric order, where x2 < x10.
(SEQUENCE)
x25 x9 x49 x32 x54 x18 x56 x36 x59 x39 x21 x23 x13 x31 x62 x39 x17 x17 x64 x37 x25 x26 x1 x46 x64 x44 x46 x37 x36 x64 x29 x26 | x1 x9 x13 x17 x17 x18 x21 x23 x25 x25 x26 x26 x29 x31 x32 x36 x36 x37 x37 x39 x39 x44 x46 x46 x49 x54 x56 x59 x62 x64 x64 x64 | {'task': 'sort', 'seq': ['x25', 'x9', 'x49', 'x32', 'x54', 'x18', 'x56', 'x36', 'x59', 'x39', 'x21', 'x23', 'x13', 'x31', 'x62', 'x39', 'x17', 'x17', 'x64', 'x37', 'x25', 'x26', 'x1', 'x46', 'x64', 'x44', 'x46', 'x37', 'x36', 'x64', 'x29', 'x26'], 'k': 4, 'n': 32, '_time': 0.00048542022705078125, '_task': 'basic_proced... | 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 c1 o3 o0 c0 c3 o0 c0 o3 o0 c0 c3 o2 o2 o0 o0 c0 o0 c0 o1 o1 c1 o2 o2 c2 c2 o2 c2 c1 c0 c2 c2 | {'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.00040793418884277344, '_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)
x37 x44 x10 x13 x16 x51 x51 x13 x41 x5 x42 x23 x43 x64 x38 x23
(B)
x35 x36 x42 x36 x4 x11 x7 x4 x36 x16 x43 x4 x26 x27 x54 x32 | x37 x44 x10 x13 x16 x51 x41 x5 x42 x23 x43 x64 x38 x35 x36 x4 x11 x7 x26 x27 x54 x32 | {'task': 'union', 'seq': [['x37', 'x44', 'x10', 'x13', 'x16', 'x51', 'x51', 'x13', 'x41', 'x5', 'x42', 'x23', 'x43', 'x64', 'x38', 'x23'], ['x35', 'x36', 'x42', 'x36', 'x4', 'x11', 'x7', 'x4', 'x36', 'x16', 'x43', 'x4', 'x26', 'x27', 'x54', 'x32']], 'k': 4, 'n': 32, '_time': 0.0004363059997558594, '_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. | o0 o2 c0 o0 c0 o0 o0 c2 o2 c0 o3 o2 c0 o1 c1 c2 c3 o2 c2 c2 o1 c1 o0 c0 o3 c3 o3 o1 c3 o0 c0 c1 | {'task': 'dyck_shuffle', 'seq': [], 'k': 4, 'n': 32, '_time': 0.00047659873962402344, '_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)
x14 x64 x30 x58 x36 x37 x44 x30 x41 x18 x27 x20 x43 x15 x16 x26 x25 x64 x62 x39 x54 x54 x30 x57 x14 x44 x50 x1 x50 x54 x26 x24 | x24 x26 x54 x50 x1 x50 x44 x14 x57 x30 x54 x54 x39 x62 x64 x25 x26 x16 x15 x43 x20 x27 x18 x41 x30 x44 x37 x36 x58 x30 x64 x14 | {'task': 'reverse', 'seq': ['x14', 'x64', 'x30', 'x58', 'x36', 'x37', 'x44', 'x30', 'x41', 'x18', 'x27', 'x20', 'x43', 'x15', 'x16', 'x26', 'x25', 'x64', 'x62', 'x39', 'x54', 'x54', 'x30', 'x57', 'x14', 'x44', 'x50', 'x1', 'x50', 'x54', 'x26', 'x24'], 'k': 4, 'n': 32, '_time': 0.0004355907440185547, '_task': 'basic_pro... | 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 x49; PUSH x7; PUSH x1; POP; PUSH x41; POP; PUSH x50; POP; PUSH x56; PUSH x5; POP; PUSH x15; PUSH x28; POP; PUSH x64; PUSH x54; PUSH x51; POP; PUSH x45; PO... | EMPTY | {'task': 'stack', 'seq': ['PUSH x49', 'PUSH x7', 'PUSH x1', 'POP', 'PUSH x41', 'POP', 'PUSH x50', 'POP', 'PUSH x56', 'PUSH x5', 'POP', 'PUSH x15', 'PUSH x28', 'POP', 'PUSH x64', 'PUSH x54', 'PUSH x51', 'POP', 'PUSH x45', 'POP', 'PUSH x10', 'PUSH x49', 'POP', 'POP', 'POP', 'POP', 'POP', 'POP', 'POP', 'POP', 'PUSH x29', ... | 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)
x61 x52 x46 x44 x48 x12 x28 x61 x39 x63 x21 x50 x42 x37 x31 x25
(B)
x58 x50 x43 x34 x28 x41 x43 x45 x15 x3 x15 x43 x38 x25 x46 x58 | x61 x52 x46 x44 x48 x12 x28 x39 x63 x21 x50 x42 x37 x31 x25 x58 x43 x34 x41 x45 x15 x3 x38 | {'task': 'union', 'seq': [['x61', 'x52', 'x46', 'x44', 'x48', 'x12', 'x28', 'x61', 'x39', 'x63', 'x21', 'x50', 'x42', 'x37', 'x31', 'x25'], ['x58', 'x50', 'x43', 'x34', 'x28', 'x41', 'x43', 'x45', 'x15', 'x3', 'x15', 'x43', 'x38', 'x25', 'x46', 'x58']], 'k': 4, 'n': 32, '_time': 0.0004940032958984375, '_task': 'basic_p... | union | instruct | 0 |
Copy the sequence exactly.
(SEQUENCE)
x3 x45 x8 x63 x18 x9 x10 x18 x51 x2 x43 x57 x19 x33 x43 x47 x13 x54 x43 x30 x58 x35 x57 x33 x37 x44 x18 x32 x21 x14 x45 x41 | x3 x45 x8 x63 x18 x9 x10 x18 x51 x2 x43 x57 x19 x33 x43 x47 x13 x54 x43 x30 x58 x35 x57 x33 x37 x44 x18 x32 x21 x14 x45 x41 | {'task': 'identity', 'seq': ['x3', 'x45', 'x8', 'x63', 'x18', 'x9', 'x10', 'x18', 'x51', 'x2', 'x43', 'x57', 'x19', 'x33', 'x43', 'x47', 'x13', 'x54', 'x43', 'x30', 'x58', 'x35', 'x57', 'x33', 'x37', 'x44', 'x18', 'x32', 'x21', 'x14', 'x45', 'x41'], 'k': 4, 'n': 32, '_time': 0.0004379749298095703, '_task': 'basic_proce... | identity | instruct | 0 |
Reverse the sequence.
(SEQUENCE)
x40 x62 x12 x33 x18 x7 x23 x2 x59 x62 x1 x11 x39 x16 x42 x21 x15 x62 x20 x59 x2 x22 x64 x43 x23 x63 x30 x35 x60 x39 x21 x39 | x39 x21 x39 x60 x35 x30 x63 x23 x43 x64 x22 x2 x59 x20 x62 x15 x21 x42 x16 x39 x11 x1 x62 x59 x2 x23 x7 x18 x33 x12 x62 x40 | {'task': 'reverse', 'seq': ['x40', 'x62', 'x12', 'x33', 'x18', 'x7', 'x23', 'x2', 'x59', 'x62', 'x1', 'x11', 'x39', 'x16', 'x42', 'x21', 'x15', 'x62', 'x20', 'x59', 'x2', 'x22', 'x64', 'x43', 'x23', 'x63', 'x30', 'x35', 'x60', 'x39', 'x21', 'x39'], 'k': 4, 'n': 32, '_time': 0.0004355907440185547, '_task': 'basic_proced... | 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. | o1 o0 c0 c1 o1 o2 c2 o1 c1 o3 o0 o2 o1 o0 c0 o3 o3 o0 o0 o0 c0 o2 c2 c0 c0 c3 c3 c1 c2 c0 c3 c1 | {'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.00041794776916503906, '_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)
x40 x10 x58 x34 x7 x34 x39 x50 x60 x41 x32 x20 x36 x52 x19 x57
(B)
x18 x58 x55 x10 x49 x36 x18 x37 x35 x45 x2 x64 x62 x64 x22 x3 | x40 x10 x58 x34 x7 x39 x50 x60 x41 x32 x20 x36 x52 x19 x57 x18 x55 x49 x37 x35 x45 x2 x64 x62 x22 x3 | {'task': 'union', 'seq': [['x40', 'x10', 'x58', 'x34', 'x7', 'x34', 'x39', 'x50', 'x60', 'x41', 'x32', 'x20', 'x36', 'x52', 'x19', 'x57'], ['x18', 'x58', 'x55', 'x10', 'x49', 'x36', 'x18', 'x37', 'x35', 'x45', 'x2', 'x64', 'x62', 'x64', 'x22', 'x3']], 'k': 4, 'n': 32, '_time': 0.0005114078521728516, '_task': 'basic_pro... | 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 o1 c1 c0 o0 o3 o0 c0 c3 c0 o1 o2 o2 c2 o0 c0 c2 c1 o0 o3 o3 c3 o1 c1 c3 c0 o2 o0 o0 c0 c0 c2 | {'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0004165172576904297, '_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 |
Sort the sequence in ascending numeric order, where x2 < x10.
(SEQUENCE)
x64 x31 x3 x40 x28 x60 x50 x31 x24 x4 x4 x52 x13 x12 x55 x28 x17 x60 x21 x46 x25 x23 x62 x10 x26 x6 x64 x50 x9 x10 x8 x16 | x3 x4 x4 x6 x8 x9 x10 x10 x12 x13 x16 x17 x21 x23 x24 x25 x26 x28 x28 x31 x31 x40 x46 x50 x50 x52 x55 x60 x60 x62 x64 x64 | {'task': 'sort', 'seq': ['x64', 'x31', 'x3', 'x40', 'x28', 'x60', 'x50', 'x31', 'x24', 'x4', 'x4', 'x52', 'x13', 'x12', 'x55', 'x28', 'x17', 'x60', 'x21', 'x46', 'x25', 'x23', 'x62', 'x10', 'x26', 'x6', 'x64', 'x50', 'x9', 'x10', 'x8', 'x16'], 'k': 4, 'n': 32, '_time': 0.00046181678771972656, '_task': 'basic_procedural... | 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)
x40 x18 x43 x36 x45 x11 x46 x8 x39 x49 x40 x52 x35 x52 x56 x59
(B)
x1 x63 x18 x44 x8 x63 x53 x25 x16 x55 x53 x24 x8 x10 x33 x53 | x40 x18 x43 x36 x45 x11 x46 x8 x39 x49 x52 x35 x56 x59 x1 x63 x44 x53 x25 x16 x55 x24 x10 x33 | {'task': 'union', 'seq': [['x40', 'x18', 'x43', 'x36', 'x45', 'x11', 'x46', 'x8', 'x39', 'x49', 'x40', 'x52', 'x35', 'x52', 'x56', 'x59'], ['x1', 'x63', 'x18', 'x44', 'x8', 'x63', 'x53', 'x25', 'x16', 'x55', 'x53', 'x24', 'x8', 'x10', 'x33', 'x53']], 'k': 4, 'n': 32, '_time': 0.0004730224609375, '_task': 'basic_procedu... | 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 c0 o2 o1 o1 c1 o3 o3 c3 o2 c2 o0 o1 o3 c3 o3 c3 c1 o3 o1 c1 o1 c1 c3 o1 c1 o1 c1 c0 c3 c1 c2 | {'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.00042438507080078125, '_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 unique elements of the sequence in order of first appearance.
(SEQUENCE)
x43 x29 x64 x48 x56 x57 x41 x33 x21 x22 x17 x15 x59 x2 x36 x13 x17 x42 x55 x20 x46 x2 x47 x50 x53 x24 x51 x4 x10 x48 x32 x44 | x43 x29 x64 x48 x56 x57 x41 x33 x21 x22 x17 x15 x59 x2 x36 x13 x42 x55 x20 x46 x47 x50 x53 x24 x51 x4 x10 x32 x44 | {'task': 'set', 'seq': ['x43', 'x29', 'x64', 'x48', 'x56', 'x57', 'x41', 'x33', 'x21', 'x22', 'x17', 'x15', 'x59', 'x2', 'x36', 'x13', 'x17', 'x42', 'x55', 'x20', 'x46', 'x2', 'x47', 'x50', 'x53', 'x24', 'x51', 'x4', 'x10', 'x48', 'x32', 'x44'], 'k': 4, 'n': 32, '_time': 0.00044727325439453125, '_task': 'basic_procedur... | 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 x33; PUSH x11; PUSH x6; PUSH x11; PUSH x29; PUSH x56; POP; PUSH x59; PUSH x35; PUSH x43; POP; POP; POP; POP; PUSH x14; PUSH x3; PUSH x39; PUSH x18; PUSH x... | x3 x14 x11 x6 x11 x33 | {'task': 'stack', 'seq': ['PUSH x33', 'PUSH x11', 'PUSH x6', 'PUSH x11', 'PUSH x29', 'PUSH x56', 'POP', 'PUSH x59', 'PUSH x35', 'PUSH x43', 'POP', 'POP', 'POP', 'POP', 'PUSH x14', 'PUSH x3', 'PUSH x39', 'PUSH x18', 'PUSH x15', 'PUSH x58', 'PUSH x45', 'PUSH x2', 'POP', 'POP', 'POP', 'POP', 'POP', 'PUSH x56', 'POP', 'POP... | stack | instruct | 0 |
Delete the first occurrence of TARGET from SEQUENCE. If TARGET is absent, return SEQUENCE unchanged.
(SEQUENCE)
x51 x19 x34 x1 x62 x5 x37 x49 x49 x55 x13 x4 x44 x39 x20 x14 x2 x29 x13 x1 x35 x13 x5 x60 x60 x10 x54 x53 x1 x29 x6 x39
(TARGET)
x53 | x51 x19 x34 x1 x62 x5 x37 x49 x49 x55 x13 x4 x44 x39 x20 x14 x2 x29 x13 x1 x35 x13 x5 x60 x60 x10 x54 x1 x29 x6 x39 | {'task': 'delete', 'seq': [['x51', 'x19', 'x34', 'x1', 'x62', 'x5', 'x37', 'x49', 'x49', 'x55', 'x13', 'x4', 'x44', 'x39', 'x20', 'x14', 'x2', 'x29', 'x13', 'x1', 'x35', 'x13', 'x5', 'x60', 'x60', 'x10', 'x54', 'x53', 'x1', 'x29', 'x6', 'x39'], 'x53'], 'k': 4, 'n': 32, '_time': 0.0005233287811279297, '_task': 'basic_pr... | 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)
x34 x17 x15 x49 x4 x46 x46 x34 x20 x24 x30 x9 x27 x29 x11 x11
(B)
x58 x25 x49 x6 x12 x12 x9 x3 x42 x24 x47 x41 x52 x43 x39 x62 | x34 x17 x15 x49 x4 x46 x20 x24 x30 x9 x27 x29 x11 x58 x25 x6 x12 x3 x42 x47 x41 x52 x43 x39 x62 | {'task': 'union', 'seq': [['x34', 'x17', 'x15', 'x49', 'x4', 'x46', 'x46', 'x34', 'x20', 'x24', 'x30', 'x9', 'x27', 'x29', 'x11', 'x11'], ['x58', 'x25', 'x49', 'x6', 'x12', 'x12', 'x9', 'x3', 'x42', 'x24', 'x47', 'x41', 'x52', 'x43', 'x39', 'x62']], 'k': 4, 'n': 32, '_time': 0.0004208087921142578, '_task': 'basic_proce... | union | instruct | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.