prompt stringlengths 144 465 | answer stringlengths 5 127 | metadata stringlengths 308 686 | task stringclasses 9
values | mode stringclasses 1
value | level int64 0 0 |
|---|---|---|---|---|---|
Return the ordered union of the two sequences: keep each token the first time it appears while scanning A then B.
(A)
x53 x11 x11 x45 x24 x49 x62 x30 x2 x22 x48 x41 x37 x60 x13 x56
(B)
x53 x4 x49 x19 x3 x34 x32 x52 x25 x30 x47 x26 x55 x63 x26 x39 | x53 x11 x45 x24 x49 x62 x30 x2 x22 x48 x41 x37 x60 x13 x56 x4 x19 x3 x34 x32 x52 x25 x47 x26 x55 x63 x39 | {'task': 'union', 'seq': [['x53', 'x11', 'x11', 'x45', 'x24', 'x49', 'x62', 'x30', 'x2', 'x22', 'x48', 'x41', 'x37', 'x60', 'x13', 'x56'], ['x53', 'x4', 'x49', 'x19', 'x3', 'x34', 'x32', 'x52', 'x25', 'x30', 'x47', 'x26', 'x55', 'x63', 'x26', 'x39']], 'k': 4, 'n': 32, '_time': 0.0004520416259765625, '_task': 'basic_pro... | 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)
x33 x40 x55 x30 x42 x49 x29 x53 x3 x59 x38 x42 x42 x42 x11 x14
(B)
x46 x54 x24 x34 x47 x3 x33 x19 x51 x49 x9 x22 x7 x8 x19 x54 | x33 x40 x55 x30 x42 x49 x29 x53 x3 x59 x38 x11 x14 x46 x54 x24 x34 x47 x19 x51 x9 x22 x7 x8 | {'task': 'union', 'seq': [['x33', 'x40', 'x55', 'x30', 'x42', 'x49', 'x29', 'x53', 'x3', 'x59', 'x38', 'x42', 'x42', 'x42', 'x11', 'x14'], ['x46', 'x54', 'x24', 'x34', 'x47', 'x3', 'x33', 'x19', 'x51', 'x49', 'x9', 'x22', 'x7', 'x8', 'x19', 'x54']], 'k': 4, 'n': 32, '_time': 0.00032067298889160156, '_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. | o1 c1 o1 o0 c0 c1 o1 c1 o2 o2 o1 o0 o2 o1 c1 c2 c0 o2 o0 o2 c2 o3 o0 o3 c3 c0 c3 c0 c2 c1 c2 c2 | {'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0003910064697265625, '_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 x60; PUSH x43; POP; PUSH x53; POP; PUSH x1; PUSH x21; POP; POP; PUSH x21; PUSH x46; PUSH x2; PUSH x5; PUSH x25; PUSH x35; PUSH x60; POP; PUSH x45; POP; PU... | x25 x5 x2 x46 x21 x60 | {'task': 'stack', 'seq': ['PUSH x60', 'PUSH x43', 'POP', 'PUSH x53', 'POP', 'PUSH x1', 'PUSH x21', 'POP', 'POP', 'PUSH x21', 'PUSH x46', 'PUSH x2', 'PUSH x5', 'PUSH x25', 'PUSH x35', 'PUSH x60', 'POP', 'PUSH x45', 'POP', 'PUSH x57', 'PUSH x5', 'PUSH x57', 'PUSH x61', 'POP', 'PUSH x7', 'POP', 'POP', 'PUSH x33', 'POP', '... | stack | instruct | 0 |
Sort the sequence in ascending numeric order, where x2 < x10.
(SEQUENCE)
x50 x20 x34 x58 x4 x3 x6 x9 x9 x44 x35 x48 x45 x25 x62 x25 x16 x25 x55 x41 x7 x15 x26 x5 x4 x17 x18 x46 x29 x55 x46 x22 | x3 x4 x4 x5 x6 x7 x9 x9 x15 x16 x17 x18 x20 x22 x25 x25 x25 x26 x29 x34 x35 x41 x44 x45 x46 x46 x48 x50 x55 x55 x58 x62 | {'task': 'sort', 'seq': ['x50', 'x20', 'x34', 'x58', 'x4', 'x3', 'x6', 'x9', 'x9', 'x44', 'x35', 'x48', 'x45', 'x25', 'x62', 'x25', 'x16', 'x25', 'x55', 'x41', 'x7', 'x15', 'x26', 'x5', 'x4', 'x17', 'x18', 'x46', 'x29', 'x55', 'x46', 'x22'], 'k': 4, 'n': 32, '_time': 0.0002892017364501953, '_task': 'basic_procedural', ... | sort | instruct | 0 |
Return the unique elements of the sequence in order of first appearance.
(SEQUENCE)
x39 x56 x19 x62 x36 x59 x14 x12 x40 x54 x43 x61 x10 x51 x54 x15 x56 x38 x37 x15 x33 x38 x45 x20 x24 x33 x18 x49 x31 x58 x24 x53 | x39 x56 x19 x62 x36 x59 x14 x12 x40 x54 x43 x61 x10 x51 x15 x38 x37 x33 x45 x20 x24 x18 x49 x31 x58 x53 | {'task': 'set', 'seq': ['x39', 'x56', 'x19', 'x62', 'x36', 'x59', 'x14', 'x12', 'x40', 'x54', 'x43', 'x61', 'x10', 'x51', 'x54', 'x15', 'x56', 'x38', 'x37', 'x15', 'x33', 'x38', 'x45', 'x20', 'x24', 'x33', 'x18', 'x49', 'x31', 'x58', 'x24', 'x53'], 'k': 4, 'n': 32, '_time': 0.0004200935363769531, '_task': 'basic_proced... | set | instruct | 0 |
Sort the sequence in ascending numeric order, where x2 < x10.
(SEQUENCE)
x58 x37 x3 x35 x15 x48 x31 x33 x13 x49 x1 x26 x31 x60 x31 x48 x7 x1 x18 x58 x1 x13 x60 x3 x13 x39 x55 x14 x20 x49 x9 x21 | x1 x1 x1 x3 x3 x7 x9 x13 x13 x13 x14 x15 x18 x20 x21 x26 x31 x31 x31 x33 x35 x37 x39 x48 x48 x49 x49 x55 x58 x58 x60 x60 | {'task': 'sort', 'seq': ['x58', 'x37', 'x3', 'x35', 'x15', 'x48', 'x31', 'x33', 'x13', 'x49', 'x1', 'x26', 'x31', 'x60', 'x31', 'x48', 'x7', 'x1', 'x18', 'x58', 'x1', 'x13', 'x60', 'x3', 'x13', 'x39', 'x55', 'x14', 'x20', 'x49', 'x9', 'x21'], 'k': 4, 'n': 32, '_time': 0.00029778480529785156, '_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)
x64 x25 x37 x54 x39 x64 x25 x13 x49 x6 x52 x29 x62 x55 x55 x28
(B)
x38 x10 x51 x52 x60 x55 x55 x39 x29 x40 x54 x12 x11 x44 x43 x61 | x64 x25 x37 x54 x39 x13 x49 x6 x52 x29 x62 x55 x28 x38 x10 x51 x60 x40 x12 x11 x44 x43 x61 | {'task': 'union', 'seq': [['x64', 'x25', 'x37', 'x54', 'x39', 'x64', 'x25', 'x13', 'x49', 'x6', 'x52', 'x29', 'x62', 'x55', 'x55', 'x28'], ['x38', 'x10', 'x51', 'x52', 'x60', 'x55', 'x55', 'x39', 'x29', 'x40', 'x54', 'x12', 'x11', 'x44', 'x43', 'x61']], 'k': 4, 'n': 32, '_time': 0.00044465065002441406, '_task': 'basic_... | union | instruct | 0 |
Copy the sequence exactly.
(SEQUENCE)
x8 x45 x48 x60 x35 x6 x15 x64 x62 x57 x63 x24 x3 x38 x42 x53 x11 x7 x26 x60 x19 x64 x32 x14 x50 x15 x51 x38 x31 x30 x4 x58 | x8 x45 x48 x60 x35 x6 x15 x64 x62 x57 x63 x24 x3 x38 x42 x53 x11 x7 x26 x60 x19 x64 x32 x14 x50 x15 x51 x38 x31 x30 x4 x58 | {'task': 'identity', 'seq': ['x8', 'x45', 'x48', 'x60', 'x35', 'x6', 'x15', 'x64', 'x62', 'x57', 'x63', 'x24', 'x3', 'x38', 'x42', 'x53', 'x11', 'x7', 'x26', 'x60', 'x19', 'x64', 'x32', 'x14', 'x50', 'x15', 'x51', 'x38', 'x31', 'x30', 'x4', 'x58'], 'k': 4, 'n': 32, '_time': 0.0003781318664550781, '_task': 'basic_proced... | identity | instruct | 0 |
Return the unique elements of the sequence in order of first appearance.
(SEQUENCE)
x24 x9 x64 x31 x63 x29 x8 x40 x50 x23 x55 x25 x12 x17 x51 x57 x9 x20 x25 x14 x60 x23 x1 x58 x15 x45 x42 x21 x25 x39 x59 x1 | x24 x9 x64 x31 x63 x29 x8 x40 x50 x23 x55 x25 x12 x17 x51 x57 x20 x14 x60 x1 x58 x15 x45 x42 x21 x39 x59 | {'task': 'set', 'seq': ['x24', 'x9', 'x64', 'x31', 'x63', 'x29', 'x8', 'x40', 'x50', 'x23', 'x55', 'x25', 'x12', 'x17', 'x51', 'x57', 'x9', 'x20', 'x25', 'x14', 'x60', 'x23', 'x1', 'x58', 'x15', 'x45', 'x42', 'x21', 'x25', 'x39', 'x59', 'x1'], 'k': 4, 'n': 32, '_time': 0.00028061866760253906, '_task': 'basic_procedural... | 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. | o2 o3 o1 c1 o0 o1 c1 c0 c3 c2 o3 c3 o0 o3 o1 o1 c1 o1 o1 o0 o0 o2 c2 o0 c0 c0 c0 c1 c1 c1 c3 c0 | {'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0002560615539550781, '_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. | o0 c0 o0 c0 o3 o2 o0 c0 c2 c3 o3 o2 c2 o3 c3 c3 o3 c3 o0 c0 o3 c3 o0 o1 c1 o2 c2 c0 o3 o1 c1 c3 | {'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0003859996795654297, '_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)
x13 x64 x50 x23 x35 x53 x26 x26 x29 x25 x36 x62 x6 x8 x31 x47 x30 x53 x15 x61 x58 x48 x38 x43 x60 x6 x32 x2 x14 x19 x19 x49
(TARGET)
x30 | x13 x64 x50 x23 x35 x53 x26 x26 x29 x25 x36 x62 x6 x8 x31 x47 x53 x15 x61 x58 x48 x38 x43 x60 x6 x32 x2 x14 x19 x19 x49 | {'task': 'delete', 'seq': [['x13', 'x64', 'x50', 'x23', 'x35', 'x53', 'x26', 'x26', 'x29', 'x25', 'x36', 'x62', 'x6', 'x8', 'x31', 'x47', 'x30', 'x53', 'x15', 'x61', 'x58', 'x48', 'x38', 'x43', 'x60', 'x6', 'x32', 'x2', 'x14', 'x19', 'x19', 'x49'], 'x30'], 'k': 4, 'n': 32, '_time': 0.0003056526184082031, '_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)
x17 x48 x49 x8 x33 x15 x37 x57 x56 x12 x29 x62 x47 x21 x1 x56
(B)
x39 x17 x30 x26 x25 x45 x32 x54 x26 x8 x23 x38 x55 x64 x24 x8 | x17 x48 x49 x8 x33 x15 x37 x57 x56 x12 x29 x62 x47 x21 x1 x39 x30 x26 x25 x45 x32 x54 x23 x38 x55 x64 x24 | {'task': 'union', 'seq': [['x17', 'x48', 'x49', 'x8', 'x33', 'x15', 'x37', 'x57', 'x56', 'x12', 'x29', 'x62', 'x47', 'x21', 'x1', 'x56'], ['x39', 'x17', 'x30', 'x26', 'x25', 'x45', 'x32', 'x54', 'x26', 'x8', 'x23', 'x38', 'x55', 'x64', 'x24', 'x8']], 'k': 4, 'n': 32, '_time': 0.00045180320739746094, '_task': 'basic_pro... | 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 x59; PUSH x15; POP; PUSH x56; PUSH x44; PUSH x5; POP; PUSH x16; PUSH x52; POP; PUSH x22; PUSH x60; PUSH x10; PUSH x31; PUSH x12; PUSH x1; PUSH x... | x10 x60 x22 x16 x44 x56 x59 x32 | {'task': 'stack', 'seq': ['PUSH x32', 'PUSH x59', 'PUSH x15', 'POP', 'PUSH x56', 'PUSH x44', 'PUSH x5', 'POP', 'PUSH x16', 'PUSH x52', 'POP', 'PUSH x22', 'PUSH x60', 'PUSH x10', 'PUSH x31', 'PUSH x12', 'PUSH x1', 'PUSH x26', 'PUSH x40', 'PUSH x49', 'PUSH x4', 'PUSH x18', 'POP', 'POP', 'POP', 'PUSH x5', 'POP', 'POP', 'P... | 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)
x37 x5 x23 x32 x64 x37 x17 x12 x30 x29 x26 x56 x26 x13 x31 x2
(B)
x36 x7 x55 x54 x62 x25 x35 x28 x38 x35 x16 x14 x9 x33 x2 x35 | x37 x5 x23 x32 x64 x17 x12 x30 x29 x26 x56 x13 x31 x2 x36 x7 x55 x54 x62 x25 x35 x28 x38 x16 x14 x9 x33 | {'task': 'union', 'seq': [['x37', 'x5', 'x23', 'x32', 'x64', 'x37', 'x17', 'x12', 'x30', 'x29', 'x26', 'x56', 'x26', 'x13', 'x31', 'x2'], ['x36', 'x7', 'x55', 'x54', 'x62', 'x25', 'x35', 'x28', 'x38', 'x35', 'x16', 'x14', 'x9', 'x33', 'x2', 'x35']], 'k': 4, 'n': 32, '_time': 0.00045108795166015625, '_task': 'basic_proc... | union | instruct | 0 |
Return the unique elements of the sequence in order of first appearance.
(SEQUENCE)
x21 x64 x51 x23 x31 x3 x2 x6 x5 x17 x28 x54 x9 x20 x55 x28 x63 x35 x25 x31 x40 x37 x49 x12 x15 x30 x34 x26 x17 x4 x10 x35 | x21 x64 x51 x23 x31 x3 x2 x6 x5 x17 x28 x54 x9 x20 x55 x63 x35 x25 x40 x37 x49 x12 x15 x30 x34 x26 x4 x10 | {'task': 'set', 'seq': ['x21', 'x64', 'x51', 'x23', 'x31', 'x3', 'x2', 'x6', 'x5', 'x17', 'x28', 'x54', 'x9', 'x20', 'x55', 'x28', 'x63', 'x35', 'x25', 'x31', 'x40', 'x37', 'x49', 'x12', 'x15', 'x30', 'x34', 'x26', 'x17', 'x4', 'x10', 'x35'], 'k': 4, 'n': 32, '_time': 0.0002913475036621094, '_task': 'basic_procedural',... | set | instruct | 0 |
Return the ordered union of the two sequences: keep each token the first time it appears while scanning A then B.
(A)
x28 x3 x42 x64 x38 x18 x62 x13 x61 x34 x13 x11 x53 x42 x61 x58
(B)
x35 x46 x37 x44 x12 x4 x27 x14 x43 x53 x11 x51 x32 x28 x38 x50 | x28 x3 x42 x64 x38 x18 x62 x13 x61 x34 x11 x53 x58 x35 x46 x37 x44 x12 x4 x27 x14 x43 x51 x32 x50 | {'task': 'union', 'seq': [['x28', 'x3', 'x42', 'x64', 'x38', 'x18', 'x62', 'x13', 'x61', 'x34', 'x13', 'x11', 'x53', 'x42', 'x61', 'x58'], ['x35', 'x46', 'x37', 'x44', 'x12', 'x4', 'x27', 'x14', 'x43', 'x53', 'x11', 'x51', 'x32', 'x28', 'x38', 'x50']], 'k': 4, 'n': 32, '_time': 0.0002970695495605469, '_task': 'basic_pr... | union | instruct | 0 |
Copy the sequence exactly.
(SEQUENCE)
x24 x19 x64 x19 x11 x1 x25 x46 x60 x60 x50 x59 x40 x56 x18 x13 x61 x20 x5 x56 x32 x19 x28 x58 x48 x15 x53 x51 x50 x8 x5 x63 | x24 x19 x64 x19 x11 x1 x25 x46 x60 x60 x50 x59 x40 x56 x18 x13 x61 x20 x5 x56 x32 x19 x28 x58 x48 x15 x53 x51 x50 x8 x5 x63 | {'task': 'identity', 'seq': ['x24', 'x19', 'x64', 'x19', 'x11', 'x1', 'x25', 'x46', 'x60', 'x60', 'x50', 'x59', 'x40', 'x56', 'x18', 'x13', 'x61', 'x20', 'x5', 'x56', 'x32', 'x19', 'x28', 'x58', 'x48', 'x15', 'x53', 'x51', 'x50', 'x8', 'x5', 'x63'], 'k': 4, 'n': 32, '_time': 0.0004134178161621094, '_task': 'basic_proce... | 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 o3 c3 o0 c0 o3 o2 o1 c2 c3 o1 o1 o0 c1 c1 c0 o2 o1 c1 o0 c1 o2 c0 o3 o2 o2 c3 c3 c2 c2 c2 c2 | {'task': 'dyck_shuffle', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0004496574401855469, '_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)
x46 x61 x19 x35 x29 x22 x24 x6 x62 x56 x36 x50 x60 x3 x30 x57
(B)
x51 x51 x1 x40 x60 x7 x11 x30 x61 x43 x36 x52 x60 x9 x40 x9 | x46 x61 x19 x35 x29 x22 x24 x6 x62 x56 x36 x50 x60 x3 x30 x57 x51 x1 x40 x7 x11 x43 x52 x9 | {'task': 'union', 'seq': [['x46', 'x61', 'x19', 'x35', 'x29', 'x22', 'x24', 'x6', 'x62', 'x56', 'x36', 'x50', 'x60', 'x3', 'x30', 'x57'], ['x51', 'x51', 'x1', 'x40', 'x60', 'x7', 'x11', 'x30', 'x61', 'x43', 'x36', 'x52', 'x60', 'x9', 'x40', 'x9']], 'k': 4, 'n': 32, '_time': 0.0002982616424560547, '_task': 'basic_proced... | union | instruct | 0 |
Delete the first occurrence of TARGET from SEQUENCE. If TARGET is absent, return SEQUENCE unchanged.
(SEQUENCE)
x55 x5 x24 x26 x22 x1 x17 x8 x32 x30 x19 x29 x14 x58 x22 x23 x39 x60 x7 x24 x47 x23 x55 x13 x31 x16 x63 x16 x19 x44 x11 x31
(TARGET)
x2 | x55 x5 x24 x26 x22 x1 x17 x8 x32 x30 x19 x29 x14 x58 x22 x23 x39 x60 x7 x24 x47 x23 x55 x13 x31 x16 x63 x16 x19 x44 x11 x31 | {'task': 'delete', 'seq': [['x55', 'x5', 'x24', 'x26', 'x22', 'x1', 'x17', 'x8', 'x32', 'x30', 'x19', 'x29', 'x14', 'x58', 'x22', 'x23', 'x39', 'x60', 'x7', 'x24', 'x47', 'x23', 'x55', 'x13', 'x31', 'x16', 'x63', 'x16', 'x19', 'x44', 'x11', 'x31'], 'x2'], 'k': 4, 'n': 32, '_time': 0.00029587745666503906, '_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)
x59 x2 x55 x26 x30 x40 x46 x38 x3 x4 x47 x56 x62 x53 x5 x32
(B)
x29 x6 x35 x29 x15 x53 x2 x8 x16 x10 x1 x50 x61 x9 x11 x45 | x59 x2 x55 x26 x30 x40 x46 x38 x3 x4 x47 x56 x62 x53 x5 x32 x29 x6 x35 x15 x8 x16 x10 x1 x50 x61 x9 x11 x45 | {'task': 'union', 'seq': [['x59', 'x2', 'x55', 'x26', 'x30', 'x40', 'x46', 'x38', 'x3', 'x4', 'x47', 'x56', 'x62', 'x53', 'x5', 'x32'], ['x29', 'x6', 'x35', 'x29', 'x15', 'x53', 'x2', 'x8', 'x16', 'x10', 'x1', 'x50', 'x61', 'x9', 'x11', 'x45']], 'k': 4, 'n': 32, '_time': 0.0004611015319824219, '_task': 'basic_procedura... | union | instruct | 0 |
Sort the sequence in ascending numeric order, where x2 < x10.
(SEQUENCE)
x50 x64 x34 x9 x35 x34 x56 x2 x5 x23 x62 x5 x31 x64 x16 x46 x7 x61 x6 x10 x24 x29 x64 x2 x10 x28 x31 x64 x51 x52 x54 x29 | x2 x2 x5 x5 x6 x7 x9 x10 x10 x16 x23 x24 x28 x29 x29 x31 x31 x34 x34 x35 x46 x50 x51 x52 x54 x56 x61 x62 x64 x64 x64 x64 | {'task': 'sort', 'seq': ['x50', 'x64', 'x34', 'x9', 'x35', 'x34', 'x56', 'x2', 'x5', 'x23', 'x62', 'x5', 'x31', 'x64', 'x16', 'x46', 'x7', 'x61', 'x6', 'x10', 'x24', 'x29', 'x64', 'x2', 'x10', 'x28', 'x31', 'x64', 'x51', 'x52', 'x54', 'x29'], 'k': 4, 'n': 32, '_time': 0.00028705596923828125, '_task': 'basic_procedural'... | sort | instruct | 0 |
Copy the sequence exactly.
(SEQUENCE)
x51 x36 x46 x43 x51 x12 x36 x59 x38 x59 x15 x40 x9 x39 x2 x46 x48 x19 x63 x50 x24 x55 x37 x11 x42 x31 x22 x27 x6 x13 x14 x42 | x51 x36 x46 x43 x51 x12 x36 x59 x38 x59 x15 x40 x9 x39 x2 x46 x48 x19 x63 x50 x24 x55 x37 x11 x42 x31 x22 x27 x6 x13 x14 x42 | {'task': 'identity', 'seq': ['x51', 'x36', 'x46', 'x43', 'x51', 'x12', 'x36', 'x59', 'x38', 'x59', 'x15', 'x40', 'x9', 'x39', 'x2', 'x46', 'x48', 'x19', 'x63', 'x50', 'x24', 'x55', 'x37', 'x11', 'x42', 'x31', 'x22', 'x27', 'x6', 'x13', 'x14', 'x42'], 'k': 4, 'n': 32, '_time': 0.00041294097900390625, '_task': 'basic_pro... | 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. | o2 o2 c2 c2 o3 o3 o2 c2 c3 o0 o2 c2 o0 c0 o1 o1 c1 c1 c0 o1 o1 c1 c1 c3 o0 o1 o1 c1 c1 o2 c2 c0 | {'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.000255584716796875, '_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. | o0 o3 c3 c0 o3 c3 o2 c2 o0 o0 o2 c2 o0 c0 o0 o3 o0 c0 o1 o2 o1 o1 c1 c1 c2 c1 c3 o1 c1 c0 c0 c0 | {'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0003838539123535156, '_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 x55; PUSH x27; PUSH x50; POP; PUSH x28; POP; POP; POP; PUSH x27; PUSH x57; PUSH x3; PUSH x57; PUSH x29; PUSH x20; PUSH x25; POP; PUSH x28; PUSH x56; PUSH ... | x22 x3 x57 x27 | {'task': 'stack', 'seq': ['PUSH x55', 'PUSH x27', 'PUSH x50', 'POP', 'PUSH x28', 'POP', 'POP', 'POP', 'PUSH x27', 'PUSH x57', 'PUSH x3', 'PUSH x57', 'PUSH x29', 'PUSH x20', 'PUSH x25', 'POP', 'PUSH x28', 'PUSH x56', 'PUSH x29', 'POP', 'POP', 'PUSH x23', 'POP', 'PUSH x15', 'POP', 'POP', 'PUSH x51', '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. | o3 o1 c1 c3 o3 o3 o3 c3 o1 o1 c1 o0 c1 o1 c3 o2 o2 o1 c1 c1 o3 c3 o0 c0 o1 c0 o1 c3 c1 c2 c1 c2 | {'task': 'dyck_shuffle', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0003268718719482422, '_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 o3 o2 c2 c3 o2 c2 o0 c0 c2 o2 c2 o3 c3 o0 c0 o2 c2 o1 o0 o3 o0 c0 c3 c0 c1 o0 c0 o1 c1 o1 c1 | {'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 |
Sort the sequence in ascending numeric order, where x2 < x10.
(SEQUENCE)
x28 x6 x41 x12 x4 x39 x19 x63 x60 x13 x48 x49 x1 x10 x21 x49 x60 x53 x45 x47 x8 x30 x57 x51 x9 x50 x24 x12 x19 x47 x3 x43 | x1 x3 x4 x6 x8 x9 x10 x12 x12 x13 x19 x19 x21 x24 x28 x30 x39 x41 x43 x45 x47 x47 x48 x49 x49 x50 x51 x53 x57 x60 x60 x63 | {'task': 'sort', 'seq': ['x28', 'x6', 'x41', 'x12', 'x4', 'x39', 'x19', 'x63', 'x60', 'x13', 'x48', 'x49', 'x1', 'x10', 'x21', 'x49', 'x60', 'x53', 'x45', 'x47', 'x8', 'x30', 'x57', 'x51', 'x9', 'x50', 'x24', 'x12', 'x19', 'x47', 'x3', 'x43'], 'k': 4, 'n': 32, '_time': 0.00040340423583984375, '_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. | o0 c0 o0 c0 o2 o1 c1 o1 o2 c2 c1 o0 c0 c2 o2 o2 o3 o3 c3 c3 o1 o3 o2 o2 o0 c0 c2 c2 c3 c1 c2 c2 | {'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0003790855407714844, '_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 x57; PUSH x35; PUSH x3; POP; PUSH x57; PUSH x23; PUSH x27; PUSH x30; POP; PUSH x56; PUSH x9; PUSH x18; PUSH x35; PUSH x13; PUSH x41; PUSH x23; PUSH x56; P... | x18 x9 x56 x27 x23 x57 x35 x57 | {'task': 'stack', 'seq': ['PUSH x57', 'PUSH x35', 'PUSH x3', 'POP', 'PUSH x57', 'PUSH x23', 'PUSH x27', 'PUSH x30', 'POP', 'PUSH x56', 'PUSH x9', 'PUSH x18', 'PUSH x35', 'PUSH x13', 'PUSH x41', 'PUSH x23', 'PUSH x56', 'PUSH x8', 'PUSH x57', 'POP', 'POP', 'POP', 'POP', 'POP', 'POP', 'POP', 'PUSH x3', 'PUSH x14', 'POP', ... | 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 x19; PUSH x51; PUSH x50; PUSH x25; POP; PUSH x6; PUSH x31; PUSH x55; PUSH x42; PUSH x58; PUSH x25; POP; PUSH x49; POP; PUSH x30; POP; POP; PUSH x9; PUSH x... | x19 x50 x51 x19 | {'task': 'stack', 'seq': ['PUSH x19', 'PUSH x51', 'PUSH x50', 'PUSH x25', 'POP', 'PUSH x6', 'PUSH x31', 'PUSH x55', 'PUSH x42', 'PUSH x58', 'PUSH x25', 'POP', 'PUSH x49', 'POP', 'PUSH x30', 'POP', 'POP', 'PUSH x9', 'PUSH x18', 'PUSH x26', 'POP', 'POP', 'POP', 'PUSH x25', 'PUSH x19', 'POP', 'POP', 'POP', 'POP', 'POP', '... | stack | instruct | 0 |
Delete the first occurrence of TARGET from SEQUENCE. If TARGET is absent, return SEQUENCE unchanged.
(SEQUENCE)
x55 x44 x21 x45 x33 x5 x12 x47 x31 x16 x57 x14 x44 x24 x31 x63 x6 x18 x8 x37 x62 x43 x39 x11 x24 x37 x2 x38 x15 x40 x10 x4
(TARGET)
x57 | x55 x44 x21 x45 x33 x5 x12 x47 x31 x16 x14 x44 x24 x31 x63 x6 x18 x8 x37 x62 x43 x39 x11 x24 x37 x2 x38 x15 x40 x10 x4 | {'task': 'delete', 'seq': [['x55', 'x44', 'x21', 'x45', 'x33', 'x5', 'x12', 'x47', 'x31', 'x16', 'x57', 'x14', 'x44', 'x24', 'x31', 'x63', 'x6', 'x18', 'x8', 'x37', 'x62', 'x43', 'x39', 'x11', 'x24', 'x37', 'x2', 'x38', 'x15', 'x40', 'x10', 'x4'], 'x57'], 'k': 4, 'n': 32, '_time': 0.00039458274841308594, '_task': 'basi... | delete | instruct | 0 |
Copy the sequence exactly.
(SEQUENCE)
x42 x15 x59 x20 x47 x51 x43 x17 x50 x22 x37 x18 x18 x20 x36 x22 x40 x42 x34 x35 x2 x2 x64 x41 x20 x41 x6 x49 x48 x48 x52 x59 | x42 x15 x59 x20 x47 x51 x43 x17 x50 x22 x37 x18 x18 x20 x36 x22 x40 x42 x34 x35 x2 x2 x64 x41 x20 x41 x6 x49 x48 x48 x52 x59 | {'task': 'identity', 'seq': ['x42', 'x15', 'x59', 'x20', 'x47', 'x51', 'x43', 'x17', 'x50', 'x22', 'x37', 'x18', 'x18', 'x20', 'x36', 'x22', 'x40', 'x42', 'x34', 'x35', 'x2', 'x2', 'x64', 'x41', 'x20', 'x41', 'x6', 'x49', 'x48', 'x48', 'x52', 'x59'], 'k': 4, 'n': 32, '_time': 0.0002722740173339844, '_task': 'basic_proc... | identity | instruct | 0 |
Delete the first occurrence of TARGET from SEQUENCE. If TARGET is absent, return SEQUENCE unchanged.
(SEQUENCE)
x7 x58 x52 x47 x6 x25 x43 x13 x38 x34 x26 x52 x56 x22 x6 x16 x39 x53 x57 x46 x54 x4 x60 x29 x57 x7 x55 x4 x60 x47 x49 x46
(TARGET)
x34 | x7 x58 x52 x47 x6 x25 x43 x13 x38 x26 x52 x56 x22 x6 x16 x39 x53 x57 x46 x54 x4 x60 x29 x57 x7 x55 x4 x60 x47 x49 x46 | {'task': 'delete', 'seq': [['x7', 'x58', 'x52', 'x47', 'x6', 'x25', 'x43', 'x13', 'x38', 'x34', 'x26', 'x52', 'x56', 'x22', 'x6', 'x16', 'x39', 'x53', 'x57', 'x46', 'x54', 'x4', 'x60', 'x29', 'x57', 'x7', 'x55', 'x4', 'x60', 'x47', 'x49', 'x46'], 'x34'], 'k': 4, 'n': 32, '_time': 0.00029397010803222656, '_task': 'basic... | delete | instruct | 0 |
Reverse the sequence.
(SEQUENCE)
x18 x32 x16 x64 x17 x30 x35 x46 x61 x10 x45 x1 x25 x30 x52 x49 x45 x54 x1 x21 x16 x47 x31 x43 x11 x50 x10 x38 x59 x19 x50 x57 | x57 x50 x19 x59 x38 x10 x50 x11 x43 x31 x47 x16 x21 x1 x54 x45 x49 x52 x30 x25 x1 x45 x10 x61 x46 x35 x30 x17 x64 x16 x32 x18 | {'task': 'reverse', 'seq': ['x18', 'x32', 'x16', 'x64', 'x17', 'x30', 'x35', 'x46', 'x61', 'x10', 'x45', 'x1', 'x25', 'x30', 'x52', 'x49', 'x45', 'x54', 'x1', 'x21', 'x16', 'x47', 'x31', 'x43', 'x11', 'x50', 'x10', 'x38', 'x59', 'x19', 'x50', 'x57'], 'k': 4, 'n': 32, '_time': 0.0004146099090576172, '_task': 'basic_proc... | 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)
x8 x55 x3 x61 x45 x61 x15 x5 x29 x6 x61 x3 x22 x23 x48 x17
(B)
x16 x41 x8 x12 x25 x38 x28 x63 x33 x18 x34 x14 x35 x41 x41 x58 | x8 x55 x3 x61 x45 x15 x5 x29 x6 x22 x23 x48 x17 x16 x41 x12 x25 x38 x28 x63 x33 x18 x34 x14 x35 x58 | {'task': 'union', 'seq': [['x8', 'x55', 'x3', 'x61', 'x45', 'x61', 'x15', 'x5', 'x29', 'x6', 'x61', 'x3', 'x22', 'x23', 'x48', 'x17'], ['x16', 'x41', 'x8', 'x12', 'x25', 'x38', 'x28', 'x63', 'x33', 'x18', 'x34', 'x14', 'x35', 'x41', 'x41', 'x58']], 'k': 4, 'n': 32, '_time': 0.0004496574401855469, '_task': 'basic_proced... | 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 o0 o0 c0 o0 c0 c0 o1 o2 c0 c2 c1 o3 c3 o3 o2 o2 c3 c2 c2 o2 o1 o1 o2 o2 o0 c2 c2 c0 c2 c1 c1 | {'task': 'dyck_shuffle', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0003857612609863281, '_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 x15; POP; PUSH x23; PUSH x22; PUSH x57; PUSH x55; PUSH x7; PUSH x12; PUSH x10; PUSH x35; PUSH x46; PUSH x21; POP; PUSH x23; PUSH x9; POP; PUSH x15; POP; P... | x23 x46 x35 x10 x12 x7 x55 x57 x22 x23 | {'task': 'stack', 'seq': ['PUSH x15', 'POP', 'PUSH x23', 'PUSH x22', 'PUSH x57', 'PUSH x55', 'PUSH x7', 'PUSH x12', 'PUSH x10', 'PUSH x35', 'PUSH x46', 'PUSH x21', 'POP', 'PUSH x23', 'PUSH x9', 'POP', 'PUSH x15', 'POP', 'PUSH x32', 'POP', 'PUSH x35', 'PUSH x43', 'POP', 'POP', 'PUSH x28', 'PUSH x9', 'POP', 'PUSH x54', '... | stack | instruct | 0 |
Reverse the sequence.
(SEQUENCE)
x64 x36 x9 x7 x4 x30 x33 x7 x20 x45 x4 x23 x4 x60 x9 x23 x11 x56 x42 x47 x27 x34 x41 x33 x61 x48 x8 x49 x15 x10 x59 x6 | x6 x59 x10 x15 x49 x8 x48 x61 x33 x41 x34 x27 x47 x42 x56 x11 x23 x9 x60 x4 x23 x4 x45 x20 x7 x33 x30 x4 x7 x9 x36 x64 | {'task': 'reverse', 'seq': ['x64', 'x36', 'x9', 'x7', 'x4', 'x30', 'x33', 'x7', 'x20', 'x45', 'x4', 'x23', 'x4', 'x60', 'x9', 'x23', 'x11', 'x56', 'x42', 'x47', 'x27', 'x34', 'x41', 'x33', 'x61', 'x48', 'x8', 'x49', 'x15', 'x10', 'x59', 'x6'], 'k': 4, 'n': 32, '_time': 0.0002562999725341797, '_task': 'basic_procedural'... | 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)
x51 x1 x57 x26 x35 x33 x37 x3 x30 x20 x18 x24 x34 x10 x54 x62
(B)
x19 x1 x30 x27 x64 x30 x43 x6 x5 x3 x27 x5 x48 x16 x21 x20 | x51 x1 x57 x26 x35 x33 x37 x3 x30 x20 x18 x24 x34 x10 x54 x62 x19 x27 x64 x43 x6 x5 x48 x16 x21 | {'task': 'union', 'seq': [['x51', 'x1', 'x57', 'x26', 'x35', 'x33', 'x37', 'x3', 'x30', 'x20', 'x18', 'x24', 'x34', 'x10', 'x54', 'x62'], ['x19', 'x1', 'x30', 'x27', 'x64', 'x30', 'x43', 'x6', 'x5', 'x3', 'x27', 'x5', 'x48', 'x16', 'x21', 'x20']], 'k': 4, 'n': 32, '_time': 0.00045680999755859375, '_task': 'basic_proced... | union | instruct | 0 |
Reverse the sequence.
(SEQUENCE)
x39 x50 x51 x50 x62 x42 x16 x1 x36 x12 x27 x35 x63 x60 x31 x29 x31 x54 x29 x50 x7 x39 x17 x39 x31 x5 x15 x58 x18 x40 x23 x62 | x62 x23 x40 x18 x58 x15 x5 x31 x39 x17 x39 x7 x50 x29 x54 x31 x29 x31 x60 x63 x35 x27 x12 x36 x1 x16 x42 x62 x50 x51 x50 x39 | {'task': 'reverse', 'seq': ['x39', 'x50', 'x51', 'x50', 'x62', 'x42', 'x16', 'x1', 'x36', 'x12', 'x27', 'x35', 'x63', 'x60', 'x31', 'x29', 'x31', 'x54', 'x29', 'x50', 'x7', 'x39', 'x17', 'x39', 'x31', 'x5', 'x15', 'x58', 'x18', 'x40', 'x23', 'x62'], 'k': 4, 'n': 32, '_time': 0.0003769397735595703, '_task': 'basic_proce... | reverse | instruct | 0 |
Delete the first occurrence of TARGET from SEQUENCE. If TARGET is absent, return SEQUENCE unchanged.
(SEQUENCE)
x13 x34 x28 x61 x49 x30 x29 x12 x3 x2 x25 x41 x33 x50 x4 x42 x32 x32 x15 x10 x8 x20 x32 x52 x14 x28 x26 x22 x58 x55 x20 x46
(TARGET)
x40 | x13 x34 x28 x61 x49 x30 x29 x12 x3 x2 x25 x41 x33 x50 x4 x42 x32 x32 x15 x10 x8 x20 x32 x52 x14 x28 x26 x22 x58 x55 x20 x46 | {'task': 'delete', 'seq': [['x13', 'x34', 'x28', 'x61', 'x49', 'x30', 'x29', 'x12', 'x3', 'x2', 'x25', 'x41', 'x33', 'x50', 'x4', 'x42', 'x32', 'x32', 'x15', 'x10', 'x8', 'x20', 'x32', 'x52', 'x14', 'x28', 'x26', 'x22', 'x58', 'x55', 'x20', 'x46'], 'x40'], 'k': 4, 'n': 32, '_time': 0.0004591941833496094, '_task': 'basi... | delete | instruct | 0 |
Reverse the sequence.
(SEQUENCE)
x61 x38 x4 x32 x63 x3 x42 x1 x16 x46 x28 x46 x8 x41 x51 x17 x25 x45 x2 x47 x45 x47 x57 x33 x19 x7 x6 x38 x16 x12 x16 x24 | x24 x16 x12 x16 x38 x6 x7 x19 x33 x57 x47 x45 x47 x2 x45 x25 x17 x51 x41 x8 x46 x28 x46 x16 x1 x42 x3 x63 x32 x4 x38 x61 | {'task': 'reverse', 'seq': ['x61', 'x38', 'x4', 'x32', 'x63', 'x3', 'x42', 'x1', 'x16', 'x46', 'x28', 'x46', 'x8', 'x41', 'x51', 'x17', 'x25', 'x45', 'x2', 'x47', 'x45', 'x47', 'x57', 'x33', 'x19', 'x7', 'x6', 'x38', 'x16', 'x12', 'x16', 'x24'], 'k': 4, 'n': 32, '_time': 0.0004317760467529297, '_task': 'basic_procedura... | reverse | instruct | 0 |
Sort the sequence in ascending numeric order, where x2 < x10.
(SEQUENCE)
x18 x50 x16 x15 x53 x47 x9 x1 x14 x21 x58 x14 x4 x54 x19 x55 x37 x40 x27 x55 x32 x11 x35 x5 x40 x5 x21 x47 x36 x62 x39 x26 | x1 x4 x5 x5 x9 x11 x14 x14 x15 x16 x18 x19 x21 x21 x26 x27 x32 x35 x36 x37 x39 x40 x40 x47 x47 x50 x53 x54 x55 x55 x58 x62 | {'task': 'sort', 'seq': ['x18', 'x50', 'x16', 'x15', 'x53', 'x47', 'x9', 'x1', 'x14', 'x21', 'x58', 'x14', 'x4', 'x54', 'x19', 'x55', 'x37', 'x40', 'x27', 'x55', 'x32', 'x11', 'x35', 'x5', 'x40', 'x5', 'x21', 'x47', 'x36', 'x62', 'x39', 'x26'], 'k': 4, 'n': 32, '_time': 0.00044274330139160156, '_task': 'basic_procedura... | 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. | o2 c2 o0 o1 c1 c0 o3 c3 o2 c2 o2 c2 o1 o1 c1 o1 o3 c3 o3 o3 o3 c3 o0 c0 c3 o2 c2 o3 c3 c3 c1 c1 | {'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 |
Copy the sequence exactly.
(SEQUENCE)
x10 x39 x29 x33 x20 x45 x7 x7 x17 x63 x14 x43 x28 x25 x15 x24 x49 x11 x34 x21 x12 x30 x31 x33 x55 x62 x41 x55 x40 x44 x5 x35 | x10 x39 x29 x33 x20 x45 x7 x7 x17 x63 x14 x43 x28 x25 x15 x24 x49 x11 x34 x21 x12 x30 x31 x33 x55 x62 x41 x55 x40 x44 x5 x35 | {'task': 'identity', 'seq': ['x10', 'x39', 'x29', 'x33', 'x20', 'x45', 'x7', 'x7', 'x17', 'x63', 'x14', 'x43', 'x28', 'x25', 'x15', 'x24', 'x49', 'x11', 'x34', 'x21', 'x12', 'x30', 'x31', 'x33', 'x55', 'x62', 'x41', 'x55', 'x40', 'x44', 'x5', 'x35'], 'k': 4, 'n': 32, '_time': 0.0004134178161621094, '_task': 'basic_proc... | 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 x6; POP; PUSH x31; POP; PUSH x52; PUSH x12; POP; PUSH x46; PUSH x43; POP; PUSH x62; PUSH x20; POP; PUSH x39; PUSH x25; PUSH x47; POP; PUSH x29; POP; PUSH ... | x22 x25 x39 x62 x46 x52 | {'task': 'stack', 'seq': ['PUSH x6', 'POP', 'PUSH x31', 'POP', 'PUSH x52', 'PUSH x12', 'POP', 'PUSH x46', 'PUSH x43', 'POP', 'PUSH x62', 'PUSH x20', 'POP', 'PUSH x39', 'PUSH x25', 'PUSH x47', 'POP', 'PUSH x29', 'POP', 'PUSH x22', 'PUSH x43', 'PUSH x8', 'PUSH x8', 'PUSH x42', 'POP', 'PUSH x16', 'POP', 'POP', 'POP', 'PUS... | stack | instruct | 0 |
Copy the sequence exactly.
(SEQUENCE)
x6 x20 x27 x32 x55 x39 x24 x31 x31 x18 x51 x39 x33 x34 x52 x37 x27 x23 x48 x6 x24 x46 x3 x15 x62 x4 x61 x51 x2 x49 x10 x7 | x6 x20 x27 x32 x55 x39 x24 x31 x31 x18 x51 x39 x33 x34 x52 x37 x27 x23 x48 x6 x24 x46 x3 x15 x62 x4 x61 x51 x2 x49 x10 x7 | {'task': 'identity', 'seq': ['x6', 'x20', 'x27', 'x32', 'x55', 'x39', 'x24', 'x31', 'x31', 'x18', 'x51', 'x39', 'x33', 'x34', 'x52', 'x37', 'x27', 'x23', 'x48', 'x6', 'x24', 'x46', 'x3', 'x15', 'x62', 'x4', 'x61', 'x51', 'x2', 'x49', 'x10', 'x7'], 'k': 4, 'n': 32, '_time': 0.0003745555877685547, '_task': 'basic_procedu... | identity | instruct | 0 |
Return the unique elements of the sequence in order of first appearance.
(SEQUENCE)
x6 x57 x61 x25 x61 x9 x25 x17 x12 x10 x33 x56 x3 x46 x17 x18 x60 x22 x47 x19 x22 x6 x46 x57 x50 x36 x2 x42 x29 x5 x11 x41 | x6 x57 x61 x25 x9 x17 x12 x10 x33 x56 x3 x46 x18 x60 x22 x47 x19 x50 x36 x2 x42 x29 x5 x11 x41 | {'task': 'set', 'seq': ['x6', 'x57', 'x61', 'x25', 'x61', 'x9', 'x25', 'x17', 'x12', 'x10', 'x33', 'x56', 'x3', 'x46', 'x17', 'x18', 'x60', 'x22', 'x47', 'x19', 'x22', 'x6', 'x46', 'x57', 'x50', 'x36', 'x2', 'x42', 'x29', 'x5', 'x11', 'x41'], 'k': 4, 'n': 32, '_time': 0.0004038810729980469, '_task': 'basic_procedural',... | set | instruct | 0 |
Copy the sequence exactly.
(SEQUENCE)
x18 x32 x49 x33 x51 x20 x6 x40 x44 x55 x48 x43 x25 x17 x27 x24 x26 x26 x8 x58 x23 x19 x50 x60 x36 x29 x41 x26 x8 x39 x10 x60 | x18 x32 x49 x33 x51 x20 x6 x40 x44 x55 x48 x43 x25 x17 x27 x24 x26 x26 x8 x58 x23 x19 x50 x60 x36 x29 x41 x26 x8 x39 x10 x60 | {'task': 'identity', 'seq': ['x18', 'x32', 'x49', 'x33', 'x51', 'x20', 'x6', 'x40', 'x44', 'x55', 'x48', 'x43', 'x25', 'x17', 'x27', 'x24', 'x26', 'x26', 'x8', 'x58', 'x23', 'x19', 'x50', 'x60', 'x36', 'x29', 'x41', 'x26', 'x8', 'x39', 'x10', 'x60'], 'k': 4, 'n': 32, '_time': 0.0004172325134277344, '_task': 'basic_proc... | identity | instruct | 0 |
Delete the first occurrence of TARGET from SEQUENCE. If TARGET is absent, return SEQUENCE unchanged.
(SEQUENCE)
x14 x43 x40 x56 x52 x34 x63 x55 x50 x6 x39 x9 x27 x41 x39 x46 x62 x4 x34 x26 x28 x52 x13 x56 x9 x46 x56 x19 x5 x42 x24 x36
(TARGET)
x14 | x43 x40 x56 x52 x34 x63 x55 x50 x6 x39 x9 x27 x41 x39 x46 x62 x4 x34 x26 x28 x52 x13 x56 x9 x46 x56 x19 x5 x42 x24 x36 | {'task': 'delete', 'seq': [['x14', 'x43', 'x40', 'x56', 'x52', 'x34', 'x63', 'x55', 'x50', 'x6', 'x39', 'x9', 'x27', 'x41', 'x39', 'x46', 'x62', 'x4', 'x34', 'x26', 'x28', 'x52', 'x13', 'x56', 'x9', 'x46', 'x56', 'x19', 'x5', 'x42', 'x24', 'x36'], 'x14'], 'k': 4, 'n': 32, '_time': 0.00043654441833496094, '_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)
x19 x24 x35 x25 x21 x61 x10 x37 x33 x16 x9 x57 x61 x11 x21 x1
(B)
x21 x6 x63 x52 x48 x10 x58 x16 x62 x39 x40 x52 x56 x28 x23 x62 | x19 x24 x35 x25 x21 x61 x10 x37 x33 x16 x9 x57 x11 x1 x6 x63 x52 x48 x58 x62 x39 x40 x56 x28 x23 | {'task': 'union', 'seq': [['x19', 'x24', 'x35', 'x25', 'x21', 'x61', 'x10', 'x37', 'x33', 'x16', 'x9', 'x57', 'x61', 'x11', 'x21', 'x1'], ['x21', 'x6', 'x63', 'x52', 'x48', 'x10', 'x58', 'x16', 'x62', 'x39', 'x40', 'x52', 'x56', 'x28', 'x23', 'x62']], 'k': 4, 'n': 32, '_time': 0.00044989585876464844, '_task': 'basic_pr... | union | instruct | 0 |
Sort the sequence in ascending numeric order, where x2 < x10.
(SEQUENCE)
x27 x21 x36 x14 x51 x13 x2 x11 x30 x19 x19 x15 x62 x16 x31 x54 x53 x32 x52 x43 x50 x39 x31 x5 x59 x63 x39 x29 x28 x7 x37 x44 | x2 x5 x7 x11 x13 x14 x15 x16 x19 x19 x21 x27 x28 x29 x30 x31 x31 x32 x36 x37 x39 x39 x43 x44 x50 x51 x52 x53 x54 x59 x62 x63 | {'task': 'sort', 'seq': ['x27', 'x21', 'x36', 'x14', 'x51', 'x13', 'x2', 'x11', 'x30', 'x19', 'x19', 'x15', 'x62', 'x16', 'x31', 'x54', 'x53', 'x32', 'x52', 'x43', 'x50', 'x39', 'x31', 'x5', 'x59', 'x63', 'x39', 'x29', 'x28', 'x7', 'x37', 'x44'], 'k': 4, 'n': 32, '_time': 0.0004649162292480469, '_task': 'basic_procedur... | sort | instruct | 0 |
Sort the sequence in ascending numeric order, where x2 < x10.
(SEQUENCE)
x2 x54 x20 x45 x31 x27 x22 x22 x50 x37 x32 x19 x5 x55 x58 x15 x27 x2 x55 x48 x3 x43 x22 x38 x36 x55 x30 x1 x50 x26 x20 x36 | x1 x2 x2 x3 x5 x15 x19 x20 x20 x22 x22 x22 x26 x27 x27 x30 x31 x32 x36 x36 x37 x38 x43 x45 x48 x50 x50 x54 x55 x55 x55 x58 | {'task': 'sort', 'seq': ['x2', 'x54', 'x20', 'x45', 'x31', 'x27', 'x22', 'x22', 'x50', 'x37', 'x32', 'x19', 'x5', 'x55', 'x58', 'x15', 'x27', 'x2', 'x55', 'x48', 'x3', 'x43', 'x22', 'x38', 'x36', 'x55', 'x30', 'x1', 'x50', 'x26', 'x20', 'x36'], 'k': 4, 'n': 32, '_time': 0.0004649162292480469, '_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)
x28 x43 x46 x38 x14 x43 x14 x59 x5 x51 x64 x18 x11 x30 x20 x31
(B)
x53 x64 x54 x26 x63 x48 x7 x60 x63 x22 x31 x28 x22 x44 x21 x36 | x28 x43 x46 x38 x14 x59 x5 x51 x64 x18 x11 x30 x20 x31 x53 x54 x26 x63 x48 x7 x60 x22 x44 x21 x36 | {'task': 'union', 'seq': [['x28', 'x43', 'x46', 'x38', 'x14', 'x43', 'x14', 'x59', 'x5', 'x51', 'x64', 'x18', 'x11', 'x30', 'x20', 'x31'], ['x53', 'x64', 'x54', 'x26', 'x63', 'x48', 'x7', 'x60', 'x63', 'x22', 'x31', 'x28', 'x22', 'x44', 'x21', 'x36']], 'k': 4, 'n': 32, '_time': 0.0004487037658691406, '_task': 'basic_pr... | union | instruct | 0 |
Copy the sequence exactly.
(SEQUENCE)
x21 x34 x62 x45 x9 x30 x45 x48 x44 x47 x53 x45 x24 x24 x1 x10 x40 x26 x20 x59 x31 x7 x52 x31 x58 x25 x33 x32 x9 x51 x14 x13 | x21 x34 x62 x45 x9 x30 x45 x48 x44 x47 x53 x45 x24 x24 x1 x10 x40 x26 x20 x59 x31 x7 x52 x31 x58 x25 x33 x32 x9 x51 x14 x13 | {'task': 'identity', 'seq': ['x21', 'x34', 'x62', 'x45', 'x9', 'x30', 'x45', 'x48', 'x44', 'x47', 'x53', 'x45', 'x24', 'x24', 'x1', 'x10', 'x40', 'x26', 'x20', 'x59', 'x31', 'x7', 'x52', 'x31', 'x58', 'x25', 'x33', 'x32', 'x9', 'x51', 'x14', 'x13'], 'k': 4, 'n': 32, '_time': 0.0004131793975830078, '_task': 'basic_proce... | 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. | o1 c1 o2 o1 o1 o2 c1 o3 c3 c2 c1 c2 o0 c0 o2 o2 o1 o2 o1 o2 c1 o0 c0 o3 o1 c2 c2 c3 c2 c1 c1 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 |
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 x21; POP; PUSH x43; PUSH x48; PUSH x27; PUSH x34; PUSH x44; POP; PUSH x31; PUSH x13; POP; PUSH x46; PUSH x58; POP; PUSH x59; PUSH x43; PUSH x62; POP; PUSH... | x46 x31 x34 x27 x48 x43 | {'task': 'stack', 'seq': ['PUSH x21', 'POP', 'PUSH x43', 'PUSH x48', 'PUSH x27', 'PUSH x34', 'PUSH x44', 'POP', 'PUSH x31', 'PUSH x13', 'POP', 'PUSH x46', 'PUSH x58', 'POP', 'PUSH x59', 'PUSH x43', 'PUSH x62', 'POP', 'PUSH x35', 'POP', 'PUSH x39', 'POP', 'PUSH x54', 'POP', 'PUSH x13', 'POP', 'POP', 'POP', 'PUSH x4', 'P... | stack | instruct | 0 |
Sort the sequence in ascending numeric order, where x2 < x10.
(SEQUENCE)
x22 x19 x28 x5 x1 x59 x16 x44 x39 x39 x37 x4 x51 x56 x17 x49 x57 x46 x17 x49 x30 x5 x60 x63 x4 x1 x40 x8 x36 x58 x50 x21 | x1 x1 x4 x4 x5 x5 x8 x16 x17 x17 x19 x21 x22 x28 x30 x36 x37 x39 x39 x40 x44 x46 x49 x49 x50 x51 x56 x57 x58 x59 x60 x63 | {'task': 'sort', 'seq': ['x22', 'x19', 'x28', 'x5', 'x1', 'x59', 'x16', 'x44', 'x39', 'x39', 'x37', 'x4', 'x51', 'x56', 'x17', 'x49', 'x57', 'x46', 'x17', 'x49', 'x30', 'x5', 'x60', 'x63', 'x4', 'x1', 'x40', 'x8', 'x36', 'x58', 'x50', 'x21'], 'k': 4, 'n': 32, '_time': 0.00043702125549316406, '_task': 'basic_procedural'... | sort | instruct | 0 |
Delete the first occurrence of TARGET from SEQUENCE. If TARGET is absent, return SEQUENCE unchanged.
(SEQUENCE)
x18 x44 x56 x31 x41 x21 x34 x26 x64 x27 x15 x60 x22 x45 x52 x36 x23 x31 x8 x45 x21 x37 x52 x48 x8 x7 x42 x41 x14 x18 x20 x23
(TARGET)
x31 | x18 x44 x56 x41 x21 x34 x26 x64 x27 x15 x60 x22 x45 x52 x36 x23 x31 x8 x45 x21 x37 x52 x48 x8 x7 x42 x41 x14 x18 x20 x23 | {'task': 'delete', 'seq': [['x18', 'x44', 'x56', 'x31', 'x41', 'x21', 'x34', 'x26', 'x64', 'x27', 'x15', 'x60', 'x22', 'x45', 'x52', 'x36', 'x23', 'x31', 'x8', 'x45', 'x21', 'x37', 'x52', 'x48', 'x8', 'x7', 'x42', 'x41', 'x14', 'x18', 'x20', 'x23'], 'x31'], 'k': 4, 'n': 32, '_time': 0.00043487548828125, '_task': 'basic... | delete | 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 o2 o0 o2 o1 o3 c3 c1 o0 o2 c2 c0 c2 c0 c2 o1 o1 o2 o1 c1 c2 c1 o3 o3 o3 o2 c2 c3 c3 c3 c1 | {'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0002422332763671875, '_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)
x43 x46 x39 x6 x28 x44 x43 x50 x23 x54 x7 x2 x23 x10 x34 x7 x16 x43 x61 x30 x44 x18 x7 x62 x38 x61 x25 x3 x25 x60 x7 x51 | x2 x3 x6 x7 x7 x7 x7 x10 x16 x18 x23 x23 x25 x25 x28 x30 x34 x38 x39 x43 x43 x43 x44 x44 x46 x50 x51 x54 x60 x61 x61 x62 | {'task': 'sort', 'seq': ['x43', 'x46', 'x39', 'x6', 'x28', 'x44', 'x43', 'x50', 'x23', 'x54', 'x7', 'x2', 'x23', 'x10', 'x34', 'x7', 'x16', 'x43', 'x61', 'x30', 'x44', 'x18', 'x7', 'x62', 'x38', 'x61', 'x25', 'x3', 'x25', 'x60', 'x7', 'x51'], 'k': 4, 'n': 32, '_time': 0.0002880096435546875, '_task': 'basic_procedural',... | sort | instruct | 0 |
Return the unique elements of the sequence in order of first appearance.
(SEQUENCE)
x58 x62 x39 x52 x2 x25 x15 x42 x37 x11 x1 x51 x30 x59 x53 x22 x13 x22 x61 x53 x64 x3 x46 x62 x57 x2 x60 x62 x16 x63 x23 x33 | x58 x62 x39 x52 x2 x25 x15 x42 x37 x11 x1 x51 x30 x59 x53 x22 x13 x61 x64 x3 x46 x57 x60 x16 x63 x23 x33 | {'task': 'set', 'seq': ['x58', 'x62', 'x39', 'x52', 'x2', 'x25', 'x15', 'x42', 'x37', 'x11', 'x1', 'x51', 'x30', 'x59', 'x53', 'x22', 'x13', 'x22', 'x61', 'x53', 'x64', 'x3', 'x46', 'x62', 'x57', 'x2', 'x60', 'x62', 'x16', 'x63', 'x23', 'x33'], 'k': 4, 'n': 32, '_time': 0.00041103363037109375, '_task': 'basic_procedura... | set | instruct | 0 |
Return the unique elements of the sequence in order of first appearance.
(SEQUENCE)
x48 x50 x39 x41 x18 x1 x34 x43 x51 x6 x10 x58 x23 x51 x23 x55 x50 x62 x57 x57 x37 x64 x51 x8 x14 x33 x3 x3 x28 x10 x44 x43 | x48 x50 x39 x41 x18 x1 x34 x43 x51 x6 x10 x58 x23 x55 x62 x57 x37 x64 x8 x14 x33 x3 x28 x44 | {'task': 'set', 'seq': ['x48', 'x50', 'x39', 'x41', 'x18', 'x1', 'x34', 'x43', 'x51', 'x6', 'x10', 'x58', 'x23', 'x51', 'x23', 'x55', 'x50', 'x62', 'x57', 'x57', 'x37', 'x64', 'x51', 'x8', 'x14', 'x33', 'x3', 'x3', 'x28', 'x10', 'x44', 'x43'], 'k': 4, 'n': 32, '_time': 0.0003936290740966797, '_task': 'basic_procedural'... | 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. | o3 c3 o1 c1 o0 c0 o0 o1 o3 c3 o0 c0 o2 c2 o1 o1 o0 c0 o0 c0 c1 c1 o0 c0 o1 o1 o0 c0 c1 c1 c1 c0 | {'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0003838539123535156, '_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 x27; POP; PUSH x38; POP; PUSH x17; PUSH x61; POP; PUSH x37; PUSH x13; PUSH x56; PUSH x41; PUSH x59; POP; PUSH x2; PUSH x41; PUSH x14; PUSH x45; PUSH x22; ... | x13 x7 x2 x41 x56 x13 x37 x17 | {'task': 'stack', 'seq': ['PUSH x27', 'POP', 'PUSH x38', 'POP', 'PUSH x17', 'PUSH x61', 'POP', 'PUSH x37', 'PUSH x13', 'PUSH x56', 'PUSH x41', 'PUSH x59', 'POP', 'PUSH x2', 'PUSH x41', 'PUSH x14', 'PUSH x45', 'PUSH x22', 'POP', 'PUSH x52', 'POP', 'PUSH x26', 'POP', 'POP', 'POP', 'POP', 'PUSH x7', 'PUSH x39', 'POP', 'PU... | stack | instruct | 0 |
Return the unique elements of the sequence in order of first appearance.
(SEQUENCE)
x6 x5 x37 x24 x41 x51 x33 x21 x57 x14 x33 x14 x54 x62 x30 x21 x51 x1 x62 x51 x56 x4 x40 x34 x7 x19 x7 x21 x5 x18 x50 x15 | x6 x5 x37 x24 x41 x51 x33 x21 x57 x14 x54 x62 x30 x1 x56 x4 x40 x34 x7 x19 x18 x50 x15 | {'task': 'set', 'seq': ['x6', 'x5', 'x37', 'x24', 'x41', 'x51', 'x33', 'x21', 'x57', 'x14', 'x33', 'x14', 'x54', 'x62', 'x30', 'x21', 'x51', 'x1', 'x62', 'x51', 'x56', 'x4', 'x40', 'x34', 'x7', 'x19', 'x7', 'x21', 'x5', 'x18', 'x50', 'x15'], 'k': 4, 'n': 32, '_time': 0.0003910064697265625, '_task': 'basic_procedural', ... | set | instruct | 0 |
Delete the first occurrence of TARGET from SEQUENCE. If TARGET is absent, return SEQUENCE unchanged.
(SEQUENCE)
x47 x38 x19 x59 x31 x22 x27 x55 x60 x7 x33 x19 x5 x53 x8 x47 x35 x64 x12 x27 x62 x4 x40 x54 x39 x54 x53 x26 x55 x40 x59 x11
(TARGET)
x55 | x47 x38 x19 x59 x31 x22 x27 x60 x7 x33 x19 x5 x53 x8 x47 x35 x64 x12 x27 x62 x4 x40 x54 x39 x54 x53 x26 x55 x40 x59 x11 | {'task': 'delete', 'seq': [['x47', 'x38', 'x19', 'x59', 'x31', 'x22', 'x27', 'x55', 'x60', 'x7', 'x33', 'x19', 'x5', 'x53', 'x8', 'x47', 'x35', 'x64', 'x12', 'x27', 'x62', 'x4', 'x40', 'x54', 'x39', 'x54', 'x53', 'x26', 'x55', 'x40', 'x59', 'x11'], 'x55'], 'k': 4, 'n': 32, '_time': 0.0004360675811767578, '_task': 'basi... | 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 o1 o0 c1 o0 o1 o2 c2 c1 o1 c1 c0 o0 c0 o1 c0 o1 o2 o3 c2 o1 o3 o2 c1 c1 c2 c3 o3 c1 c3 c3 | {'task': 'dyck_shuffle', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0004582405090332031, '_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)
x17 x40 x57 x54 x15 x59 x36 x19 x36 x63 x11 x48 x60 x16 x37 x32
(B)
x8 x22 x38 x34 x11 x2 x60 x10 x51 x28 x45 x25 x36 x38 x42 x57 | x17 x40 x57 x54 x15 x59 x36 x19 x63 x11 x48 x60 x16 x37 x32 x8 x22 x38 x34 x2 x10 x51 x28 x45 x25 x42 | {'task': 'union', 'seq': [['x17', 'x40', 'x57', 'x54', 'x15', 'x59', 'x36', 'x19', 'x36', 'x63', 'x11', 'x48', 'x60', 'x16', 'x37', 'x32'], ['x8', 'x22', 'x38', 'x34', 'x11', 'x2', 'x60', 'x10', 'x51', 'x28', 'x45', 'x25', 'x36', 'x38', 'x42', 'x57']], 'k': 4, 'n': 32, '_time': 0.00043082237243652344, '_task': 'basic_p... | 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 x5; PUSH x42; PUSH x64; PUSH x15; POP; POP; PUSH x22; PUSH x58; POP; PUSH x4; PUSH x27; PUSH x44; POP; PUSH x32; POP; PUSH x64; POP; POP; PUSH x... | x34 x15 | {'task': 'stack', 'seq': ['PUSH x42', 'PUSH x5', 'PUSH x42', 'PUSH x64', 'PUSH x15', 'POP', 'POP', 'PUSH x22', 'PUSH x58', 'POP', 'PUSH x4', 'PUSH x27', 'PUSH x44', 'POP', 'PUSH x32', 'POP', 'PUSH x64', 'POP', 'POP', 'PUSH x45', 'POP', 'PUSH x18', 'POP', 'POP', 'POP', 'POP', 'POP', 'POP', 'PUSH x15', 'PUSH x32', 'POP',... | 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 x37; POP; PUSH x42; PUSH x5; PUSH x16; POP; PUSH x56; PUSH x51; POP; PUSH x28; PUSH x51; PUSH x61; PUSH x36; PUSH x51; PUSH x41; PUSH x3; PUSH x30; POP; P... | x51 x36 x61 x51 x28 x56 x5 x42 | {'task': 'stack', 'seq': ['PUSH x37', 'POP', 'PUSH x42', 'PUSH x5', 'PUSH x16', 'POP', 'PUSH x56', 'PUSH x51', 'POP', 'PUSH x28', 'PUSH x51', 'PUSH x61', 'PUSH x36', 'PUSH x51', 'PUSH x41', 'PUSH x3', 'PUSH x30', 'POP', 'PUSH x12', 'PUSH x36', 'PUSH x11', 'PUSH x3', 'POP', 'POP', 'POP', 'POP', 'POP', 'PUSH x64', 'POP',... | stack | instruct | 0 |
Return the unique elements of the sequence in order of first appearance.
(SEQUENCE)
x56 x35 x46 x48 x17 x43 x36 x34 x41 x31 x29 x25 x36 x8 x54 x6 x18 x53 x57 x48 x54 x50 x49 x26 x20 x55 x34 x12 x41 x62 x3 x5 | x56 x35 x46 x48 x17 x43 x36 x34 x41 x31 x29 x25 x8 x54 x6 x18 x53 x57 x50 x49 x26 x20 x55 x12 x62 x3 x5 | {'task': 'set', 'seq': ['x56', 'x35', 'x46', 'x48', 'x17', 'x43', 'x36', 'x34', 'x41', 'x31', 'x29', 'x25', 'x36', 'x8', 'x54', 'x6', 'x18', 'x53', 'x57', 'x48', 'x54', 'x50', 'x49', 'x26', 'x20', 'x55', 'x34', 'x12', 'x41', 'x62', 'x3', 'x5'], 'k': 4, 'n': 32, '_time': 0.0003898143768310547, '_task': 'basic_procedural... | set | instruct | 0 |
Sort the sequence in ascending numeric order, where x2 < x10.
(SEQUENCE)
x3 x31 x23 x30 x20 x35 x16 x35 x35 x4 x41 x2 x21 x44 x36 x37 x22 x58 x39 x48 x52 x30 x12 x53 x10 x2 x23 x53 x64 x52 x28 x8 | x2 x2 x3 x4 x8 x10 x12 x16 x20 x21 x22 x23 x23 x28 x30 x30 x31 x35 x35 x35 x36 x37 x39 x41 x44 x48 x52 x52 x53 x53 x58 x64 | {'task': 'sort', 'seq': ['x3', 'x31', 'x23', 'x30', 'x20', 'x35', 'x16', 'x35', 'x35', 'x4', 'x41', 'x2', 'x21', 'x44', 'x36', 'x37', 'x22', 'x58', 'x39', 'x48', 'x52', 'x30', 'x12', 'x53', 'x10', 'x2', 'x23', 'x53', 'x64', 'x52', 'x28', 'x8'], 'k': 4, 'n': 32, '_time': 0.0004336833953857422, '_task': 'basic_procedural... | sort | instruct | 0 |
Return the unique elements of the sequence in order of first appearance.
(SEQUENCE)
x42 x52 x12 x33 x55 x19 x34 x32 x14 x11 x41 x37 x57 x37 x19 x51 x60 x41 x39 x29 x11 x3 x47 x4 x25 x9 x11 x35 x51 x8 x12 x32 | x42 x52 x12 x33 x55 x19 x34 x32 x14 x11 x41 x37 x57 x51 x60 x39 x29 x3 x47 x4 x25 x9 x35 x8 | {'task': 'set', 'seq': ['x42', 'x52', 'x12', 'x33', 'x55', 'x19', 'x34', 'x32', 'x14', 'x11', 'x41', 'x37', 'x57', 'x37', 'x19', 'x51', 'x60', 'x41', 'x39', 'x29', 'x11', 'x3', 'x47', 'x4', 'x25', 'x9', 'x11', 'x35', 'x51', 'x8', 'x12', 'x32'], 'k': 4, 'n': 32, '_time': 0.000400543212890625, '_task': 'basic_procedural'... | set | instruct | 0 |
Return the unique elements of the sequence in order of first appearance.
(SEQUENCE)
x39 x50 x30 x35 x7 x59 x11 x39 x11 x37 x38 x55 x26 x63 x60 x14 x58 x54 x18 x19 x8 x59 x9 x49 x54 x31 x14 x11 x7 x60 x38 x36 | x39 x50 x30 x35 x7 x59 x11 x37 x38 x55 x26 x63 x60 x14 x58 x54 x18 x19 x8 x9 x49 x31 x36 | {'task': 'set', 'seq': ['x39', 'x50', 'x30', 'x35', 'x7', 'x59', 'x11', 'x39', 'x11', 'x37', 'x38', 'x55', 'x26', 'x63', 'x60', 'x14', 'x58', 'x54', 'x18', 'x19', 'x8', 'x59', 'x9', 'x49', 'x54', 'x31', 'x14', 'x11', 'x7', 'x60', 'x38', 'x36'], 'k': 4, 'n': 32, '_time': 0.0004153251647949219, '_task': 'basic_procedural... | set | instruct | 0 |
Sort the sequence in ascending numeric order, where x2 < x10.
(SEQUENCE)
x36 x22 x5 x57 x28 x41 x42 x15 x52 x2 x51 x53 x26 x27 x63 x32 x51 x41 x42 x32 x50 x15 x48 x57 x16 x64 x55 x15 x15 x32 x2 x19 | x2 x2 x5 x15 x15 x15 x15 x16 x19 x22 x26 x27 x28 x32 x32 x32 x36 x41 x41 x42 x42 x48 x50 x51 x51 x52 x53 x55 x57 x57 x63 x64 | {'task': 'sort', 'seq': ['x36', 'x22', 'x5', 'x57', 'x28', 'x41', 'x42', 'x15', 'x52', 'x2', 'x51', 'x53', 'x26', 'x27', 'x63', 'x32', 'x51', 'x41', 'x42', 'x32', 'x50', 'x15', 'x48', 'x57', 'x16', 'x64', 'x55', 'x15', 'x15', 'x32', 'x2', 'x19'], 'k': 4, 'n': 32, '_time': 0.0004429817199707031, '_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)
x25 x10 x45 x16 x46 x25 x7 x40 x15 x13 x27 x37 x61 x31 x49 x52
(B)
x10 x6 x8 x39 x49 x16 x3 x64 x5 x14 x59 x2 x58 x64 x58 x41 | x25 x10 x45 x16 x46 x7 x40 x15 x13 x27 x37 x61 x31 x49 x52 x6 x8 x39 x3 x64 x5 x14 x59 x2 x58 x41 | {'task': 'union', 'seq': [['x25', 'x10', 'x45', 'x16', 'x46', 'x25', 'x7', 'x40', 'x15', 'x13', 'x27', 'x37', 'x61', 'x31', 'x49', 'x52'], ['x10', 'x6', 'x8', 'x39', 'x49', 'x16', 'x3', 'x64', 'x5', 'x14', 'x59', 'x2', 'x58', 'x64', 'x58', 'x41']], 'k': 4, 'n': 32, '_time': 0.00044989585876464844, '_task': 'basic_proce... | union | instruct | 0 |
Delete the first occurrence of TARGET from SEQUENCE. If TARGET is absent, return SEQUENCE unchanged.
(SEQUENCE)
x10 x39 x21 x35 x2 x61 x36 x40 x15 x5 x17 x6 x32 x11 x22 x49 x32 x51 x46 x1 x10 x35 x36 x63 x48 x50 x45 x5 x23 x18 x41 x63
(TARGET)
x10 | x39 x21 x35 x2 x61 x36 x40 x15 x5 x17 x6 x32 x11 x22 x49 x32 x51 x46 x1 x10 x35 x36 x63 x48 x50 x45 x5 x23 x18 x41 x63 | {'task': 'delete', 'seq': [['x10', 'x39', 'x21', 'x35', 'x2', 'x61', 'x36', 'x40', 'x15', 'x5', 'x17', 'x6', 'x32', 'x11', 'x22', 'x49', 'x32', 'x51', 'x46', 'x1', 'x10', 'x35', 'x36', 'x63', 'x48', 'x50', 'x45', 'x5', 'x23', 'x18', 'x41', 'x63'], 'x10'], 'k': 4, 'n': 32, '_time': 0.0004551410675048828, '_task': 'basic... | delete | instruct | 0 |
Reverse the sequence.
(SEQUENCE)
x12 x31 x58 x63 x4 x51 x45 x19 x34 x20 x62 x6 x11 x53 x55 x10 x18 x28 x16 x52 x56 x42 x42 x49 x8 x4 x48 x17 x59 x22 x34 x6 | x6 x34 x22 x59 x17 x48 x4 x8 x49 x42 x42 x56 x52 x16 x28 x18 x10 x55 x53 x11 x6 x62 x20 x34 x19 x45 x51 x4 x63 x58 x31 x12 | {'task': 'reverse', 'seq': ['x12', 'x31', 'x58', 'x63', 'x4', 'x51', 'x45', 'x19', 'x34', 'x20', 'x62', 'x6', 'x11', 'x53', 'x55', 'x10', 'x18', 'x28', 'x16', 'x52', 'x56', 'x42', 'x42', 'x49', 'x8', 'x4', 'x48', 'x17', 'x59', 'x22', 'x34', 'x6'], 'k': 4, 'n': 32, '_time': 0.0004153251647949219, '_task': 'basic_procedu... | reverse | instruct | 0 |
Sort the sequence in ascending numeric order, where x2 < x10.
(SEQUENCE)
x49 x50 x47 x50 x26 x47 x37 x51 x59 x20 x15 x25 x1 x28 x32 x16 x53 x31 x55 x4 x31 x36 x13 x38 x64 x50 x25 x55 x28 x44 x17 x16 | x1 x4 x13 x15 x16 x16 x17 x20 x25 x25 x26 x28 x28 x31 x31 x32 x36 x37 x38 x44 x47 x47 x49 x50 x50 x50 x51 x53 x55 x55 x59 x64 | {'task': 'sort', 'seq': ['x49', 'x50', 'x47', 'x50', 'x26', 'x47', 'x37', 'x51', 'x59', 'x20', 'x15', 'x25', 'x1', 'x28', 'x32', 'x16', 'x53', 'x31', 'x55', 'x4', 'x31', 'x36', 'x13', 'x38', 'x64', 'x50', 'x25', 'x55', 'x28', 'x44', 'x17', 'x16'], 'k': 4, 'n': 32, '_time': 0.00043582916259765625, '_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 o2 c2 o2 o3 o1 o1 o3 c3 o1 c1 o2 o0 c0 c2 c1 c1 c3 o1 o3 c3 o2 c2 o0 c0 c1 c2 o1 c1 o0 c0 c1 | {'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0003876686096191406, '_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)
x48 x47 x53 x44 x62 x2 x13 x20 x2 x1 x10 x8 x20 x56 x33 x24 x42 x50 x63 x22 x2 x3 x24 x9 x50 x12 x46 x44 x55 x17 x55 x61
(TARGET)
x9 | x48 x47 x53 x44 x62 x2 x13 x20 x2 x1 x10 x8 x20 x56 x33 x24 x42 x50 x63 x22 x2 x3 x24 x50 x12 x46 x44 x55 x17 x55 x61 | {'task': 'delete', 'seq': [['x48', 'x47', 'x53', 'x44', 'x62', 'x2', 'x13', 'x20', 'x2', 'x1', 'x10', 'x8', 'x20', 'x56', 'x33', 'x24', 'x42', 'x50', 'x63', 'x22', 'x2', 'x3', 'x24', 'x9', 'x50', 'x12', 'x46', 'x44', 'x55', 'x17', 'x55', 'x61'], 'x9'], 'k': 4, 'n': 32, '_time': 0.00043582916259765625, '_task': 'basic_p... | delete | instruct | 0 |
Copy the sequence exactly.
(SEQUENCE)
x1 x31 x28 x52 x64 x44 x33 x21 x36 x62 x2 x22 x57 x54 x15 x39 x28 x31 x43 x16 x8 x63 x59 x1 x45 x51 x45 x18 x23 x14 x24 x45 | x1 x31 x28 x52 x64 x44 x33 x21 x36 x62 x2 x22 x57 x54 x15 x39 x28 x31 x43 x16 x8 x63 x59 x1 x45 x51 x45 x18 x23 x14 x24 x45 | {'task': 'identity', 'seq': ['x1', 'x31', 'x28', 'x52', 'x64', 'x44', 'x33', 'x21', 'x36', 'x62', 'x2', 'x22', 'x57', 'x54', 'x15', 'x39', 'x28', 'x31', 'x43', 'x16', 'x8', 'x63', 'x59', 'x1', 'x45', 'x51', 'x45', 'x18', 'x23', 'x14', 'x24', 'x45'], 'k': 4, 'n': 32, '_time': 0.0004138946533203125, '_task': 'basic_proce... | 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 o0 o0 o2 o3 o3 o1 c0 c3 c2 c3 c0 o0 o3 o1 c3 c1 c0 c1 o3 o0 o3 c0 o1 o1 c1 c1 o2 c2 c3 c3 | {'task': 'dyck_shuffle', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0004456043243408203, '_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)
x49 x56 x15 x20 x59 x20 x10 x31 x25 x27 x46 x16 x11 x29 x20 x24 x34 x41 x15 x58 x27 x60 x39 x21 x41 x53 x37 x34 x53 x12 x7 x39 | x49 x56 x15 x20 x59 x20 x10 x31 x25 x27 x46 x16 x11 x29 x20 x24 x34 x41 x15 x58 x27 x60 x39 x21 x41 x53 x37 x34 x53 x12 x7 x39 | {'task': 'identity', 'seq': ['x49', 'x56', 'x15', 'x20', 'x59', 'x20', 'x10', 'x31', 'x25', 'x27', 'x46', 'x16', 'x11', 'x29', 'x20', 'x24', 'x34', 'x41', 'x15', 'x58', 'x27', 'x60', 'x39', 'x21', 'x41', 'x53', 'x37', 'x34', 'x53', 'x12', 'x7', 'x39'], 'k': 4, 'n': 32, '_time': 0.0004248619079589844, '_task': 'basic_pr... | identity | instruct | 0 |
Reverse the sequence.
(SEQUENCE)
x18 x13 x13 x41 x36 x56 x23 x54 x7 x8 x22 x47 x45 x28 x28 x57 x27 x23 x13 x3 x3 x33 x20 x3 x33 x57 x52 x10 x8 x5 x6 x13 | x13 x6 x5 x8 x10 x52 x57 x33 x3 x20 x33 x3 x3 x13 x23 x27 x57 x28 x28 x45 x47 x22 x8 x7 x54 x23 x56 x36 x41 x13 x13 x18 | {'task': 'reverse', 'seq': ['x18', 'x13', 'x13', 'x41', 'x36', 'x56', 'x23', 'x54', 'x7', 'x8', 'x22', 'x47', 'x45', 'x28', 'x28', 'x57', 'x27', 'x23', 'x13', 'x3', 'x3', 'x33', 'x20', 'x3', 'x33', 'x57', 'x52', 'x10', 'x8', 'x5', 'x6', 'x13'], 'k': 4, 'n': 32, '_time': 0.0004138946533203125, '_task': 'basic_procedural... | reverse | 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 o0 o0 o3 c2 c3 o1 o3 o1 c0 o1 c1 o0 o2 c0 o1 o2 c2 o2 o0 o0 c3 o0 c1 c2 c2 c0 c0 c1 c0 c1 c0 | {'task': 'dyck_shuffle', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0004584789276123047, '_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 x52; PUSH x33; PUSH x33; POP; PUSH x6; PUSH x24; PUSH x42; PUSH x25; PUSH x10; POP; PUSH x64; PUSH x47; POP; POP; PUSH x34; POP; PUSH x19; POP; POP; PUSH ... | x24 x6 x33 x52 | {'task': 'stack', 'seq': ['PUSH x52', 'PUSH x33', 'PUSH x33', 'POP', 'PUSH x6', 'PUSH x24', 'PUSH x42', 'PUSH x25', 'PUSH x10', 'POP', 'PUSH x64', 'PUSH x47', 'POP', 'POP', 'PUSH x34', 'POP', 'PUSH x19', 'POP', 'POP', 'PUSH x4', 'PUSH x60', 'PUSH x27', 'PUSH x49', 'POP', 'PUSH x47', 'POP', 'POP', 'POP', 'POP', 'PUSH x5... | 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 o2 o1 c2 o3 o1 c3 c1 c1 o1 o3 o1 o3 c3 o3 c1 o1 o0 o1 o0 o0 c1 c0 o0 c0 c0 c1 c3 c3 c0 c1 | {'task': 'dyck_shuffle', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0004451274871826172, '_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. | o1 c1 o1 o2 c2 o3 o0 o1 c1 o2 c2 c0 o2 c2 o1 c1 o0 c0 c3 o2 o3 c3 o0 c0 c2 o3 c3 o3 c3 o2 c2 c1 | {'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0003838539123535156, '_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)
x52 x37 x41 x34 x50 x33 x13 x21 x45 x38 x24 x7 x60 x32 x54 x44
(B)
x14 x31 x12 x38 x47 x32 x30 x14 x56 x19 x16 x20 x8 x63 x47 x17 | x52 x37 x41 x34 x50 x33 x13 x21 x45 x38 x24 x7 x60 x32 x54 x44 x14 x31 x12 x47 x30 x56 x19 x16 x20 x8 x63 x17 | {'task': 'union', 'seq': [['x52', 'x37', 'x41', 'x34', 'x50', 'x33', 'x13', 'x21', 'x45', 'x38', 'x24', 'x7', 'x60', 'x32', 'x54', 'x44'], ['x14', 'x31', 'x12', 'x38', 'x47', 'x32', 'x30', 'x14', 'x56', 'x19', 'x16', 'x20', 'x8', 'x63', 'x47', 'x17']], 'k': 4, 'n': 32, '_time': 0.0004525184631347656, '_task': 'basic_pr... | 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)
x22 x38 x6 x1 x11 x52 x46 x14 x58 x35 x22 x31 x22 x62 x51 x10
(B)
x38 x63 x54 x49 x63 x48 x28 x40 x31 x28 x34 x11 x9 x3 x59 x13 | x22 x38 x6 x1 x11 x52 x46 x14 x58 x35 x31 x62 x51 x10 x63 x54 x49 x48 x28 x40 x34 x9 x3 x59 x13 | {'task': 'union', 'seq': [['x22', 'x38', 'x6', 'x1', 'x11', 'x52', 'x46', 'x14', 'x58', 'x35', 'x22', 'x31', 'x22', 'x62', 'x51', 'x10'], ['x38', 'x63', 'x54', 'x49', 'x63', 'x48', 'x28', 'x40', 'x31', 'x28', 'x34', 'x11', 'x9', 'x3', 'x59', 'x13']], 'k': 4, 'n': 32, '_time': 0.0004482269287109375, '_task': 'basic_proc... | union | instruct | 0 |
Delete the first occurrence of TARGET from SEQUENCE. If TARGET is absent, return SEQUENCE unchanged.
(SEQUENCE)
x12 x37 x14 x27 x10 x11 x23 x61 x54 x2 x50 x48 x34 x21 x10 x29 x31 x52 x40 x6 x31 x56 x6 x48 x45 x28 x36 x50 x10 x61 x22 x21
(TARGET)
x48 | x12 x37 x14 x27 x10 x11 x23 x61 x54 x2 x50 x34 x21 x10 x29 x31 x52 x40 x6 x31 x56 x6 x48 x45 x28 x36 x50 x10 x61 x22 x21 | {'task': 'delete', 'seq': [['x12', 'x37', 'x14', 'x27', 'x10', 'x11', 'x23', 'x61', 'x54', 'x2', 'x50', 'x48', 'x34', 'x21', 'x10', 'x29', 'x31', 'x52', 'x40', 'x6', 'x31', 'x56', 'x6', 'x48', 'x45', 'x28', 'x36', 'x50', 'x10', 'x61', 'x22', 'x21'], 'x48'], 'k': 4, 'n': 32, '_time': 0.00042939186096191406, '_task': 'ba... | delete | 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 o1 c1 o3 c3 o0 c0 o3 c3 o2 o1 o0 o0 o3 o3 c3 o2 c2 o3 c3 c3 c0 c0 c1 c2 o0 c0 o1 c1 | {'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.00036215782165527344, '_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)
x60 x54 x46 x64 x5 x21 x4 x28 x24 x31 x12 x4 x16 x46 x14 x48 x35 x13 x11 x15 x32 x2 x8 x31 x37 x58 x51 x37 x36 x40 x35 x18
(TARGET)
x20 | x60 x54 x46 x64 x5 x21 x4 x28 x24 x31 x12 x4 x16 x46 x14 x48 x35 x13 x11 x15 x32 x2 x8 x31 x37 x58 x51 x37 x36 x40 x35 x18 | {'task': 'delete', 'seq': [['x60', 'x54', 'x46', 'x64', 'x5', 'x21', 'x4', 'x28', 'x24', 'x31', 'x12', 'x4', 'x16', 'x46', 'x14', 'x48', 'x35', 'x13', 'x11', 'x15', 'x32', 'x2', 'x8', 'x31', 'x37', 'x58', 'x51', 'x37', 'x36', 'x40', 'x35', 'x18'], 'x20'], 'k': 4, 'n': 32, '_time': 0.00045871734619140625, '_task': 'basi... | delete | instruct | 0 |
Return the unique elements of the sequence in order of first appearance.
(SEQUENCE)
x61 x58 x34 x48 x45 x34 x62 x39 x7 x51 x55 x52 x55 x11 x52 x55 x58 x31 x44 x54 x11 x5 x34 x22 x31 x27 x14 x2 x2 x62 x31 x45 | x61 x58 x34 x48 x45 x62 x39 x7 x51 x55 x52 x11 x31 x44 x54 x5 x22 x27 x14 x2 | {'task': 'set', 'seq': ['x61', 'x58', 'x34', 'x48', 'x45', 'x34', 'x62', 'x39', 'x7', 'x51', 'x55', 'x52', 'x55', 'x11', 'x52', 'x55', 'x58', 'x31', 'x44', 'x54', 'x11', 'x5', 'x34', 'x22', 'x31', 'x27', 'x14', 'x2', 'x2', 'x62', 'x31', 'x45'], 'k': 4, 'n': 32, '_time': 0.00027370452880859375, '_task': 'basic_procedura... | set | instruct | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.