prompt stringlengths 144 465 | answer stringlengths 5 127 | metadata stringlengths 308 686 | task stringclasses 9
values | mode stringclasses 1
value | level int64 0 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; PUSH x1; PUSH x3; PUSH x5; POP; POP; PUSH x55; PUSH x2; POP; PUSH x27; PUSH x33; PUSH x4; PUSH x17; PUSH x62; PUSH x32; PUSH x18; POP; PUSH x15; POP;... | x27 x55 x1 x56 | {'task': 'stack', 'seq': ['PUSH x56', 'PUSH x1', 'PUSH x3', 'PUSH x5', 'POP', 'POP', 'PUSH x55', 'PUSH x2', 'POP', 'PUSH x27', 'PUSH x33', 'PUSH x4', 'PUSH x17', 'PUSH x62', 'PUSH x32', 'PUSH x18', 'POP', 'PUSH x15', 'POP', 'PUSH x1', 'POP', 'PUSH x48', 'PUSH x23', 'POP', 'POP', 'POP', 'POP', 'PUSH x57', 'POP', 'POP', ... | stack | instruct | 0 |
Reverse the sequence.
(SEQUENCE)
x49 x42 x43 x52 x55 x52 x20 x8 x2 x48 x49 x52 x15 x47 x25 x57 x41 x35 x49 x23 x48 x8 x61 x56 x1 x50 x42 x55 x23 x35 x27 x20 | x20 x27 x35 x23 x55 x42 x50 x1 x56 x61 x8 x48 x23 x49 x35 x41 x57 x25 x47 x15 x52 x49 x48 x2 x8 x20 x52 x55 x52 x43 x42 x49 | {'task': 'reverse', 'seq': ['x49', 'x42', 'x43', 'x52', 'x55', 'x52', 'x20', 'x8', 'x2', 'x48', 'x49', 'x52', 'x15', 'x47', 'x25', 'x57', 'x41', 'x35', 'x49', 'x23', 'x48', 'x8', 'x61', 'x56', 'x1', 'x50', 'x42', 'x55', 'x23', 'x35', 'x27', 'x20'], 'k': 4, 'n': 32, '_time': 0.00028252601623535156, '_task': 'basic_proce... | reverse | instruct | 0 |
Delete the first occurrence of TARGET from SEQUENCE. If TARGET is absent, return SEQUENCE unchanged.
(SEQUENCE)
x34 x19 x33 x46 x53 x32 x9 x35 x63 x54 x49 x64 x44 x16 x20 x18 x7 x1 x39 x22 x28 x8 x62 x35 x16 x39 x30 x2 x26 x45 x25 x22
(TARGET)
x49 | x34 x19 x33 x46 x53 x32 x9 x35 x63 x54 x64 x44 x16 x20 x18 x7 x1 x39 x22 x28 x8 x62 x35 x16 x39 x30 x2 x26 x45 x25 x22 | {'task': 'delete', 'seq': [['x34', 'x19', 'x33', 'x46', 'x53', 'x32', 'x9', 'x35', 'x63', 'x54', 'x49', 'x64', 'x44', 'x16', 'x20', 'x18', 'x7', 'x1', 'x39', 'x22', 'x28', 'x8', 'x62', 'x35', 'x16', 'x39', 'x30', 'x2', 'x26', 'x45', 'x25', 'x22'], 'x49'], 'k': 4, 'n': 32, '_time': 0.00030517578125, '_task': 'basic_proc... | 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 x58; PUSH x7; POP; PUSH x16; PUSH x55; PUSH x36; POP; PUSH x26; PUSH x54; PUSH x47; PUSH x22; PUSH x50; PUSH x6; PUSH x39; PUSH x61; PUSH x29; POP; PUSH x... | x39 x6 x50 x22 x47 x54 x26 x55 x16 x58 | {'task': 'stack', 'seq': ['PUSH x58', 'PUSH x7', 'POP', 'PUSH x16', 'PUSH x55', 'PUSH x36', 'POP', 'PUSH x26', 'PUSH x54', 'PUSH x47', 'PUSH x22', 'PUSH x50', 'PUSH x6', 'PUSH x39', 'PUSH x61', 'PUSH x29', 'POP', 'PUSH x32', 'PUSH x46', 'POP', 'PUSH x3', 'PUSH x22', 'PUSH x59', 'POP', 'POP', 'PUSH x21', 'POP', 'POP', '... | stack | instruct | 0 |
Reverse the sequence.
(SEQUENCE)
x52 x38 x13 x48 x58 x59 x16 x44 x26 x45 x15 x31 x31 x27 x21 x45 x27 x41 x37 x64 x41 x11 x41 x24 x38 x23 x39 x3 x16 x39 x45 x39 | x39 x45 x39 x16 x3 x39 x23 x38 x24 x41 x11 x41 x64 x37 x41 x27 x45 x21 x27 x31 x31 x15 x45 x26 x44 x16 x59 x58 x48 x13 x38 x52 | {'task': 'reverse', 'seq': ['x52', 'x38', 'x13', 'x48', 'x58', 'x59', 'x16', 'x44', 'x26', 'x45', 'x15', 'x31', 'x31', 'x27', 'x21', 'x45', 'x27', 'x41', 'x37', 'x64', 'x41', 'x11', 'x41', 'x24', 'x38', 'x23', 'x39', 'x3', 'x16', 'x39', 'x45', 'x39'], 'k': 4, 'n': 32, '_time': 0.00028395652770996094, '_task': 'basic_pr... | reverse | instruct | 0 |
Execute the stack operations. PUSH x pushes x. POP removes the top item. Return the final stack from top to bottom, or EMPTY if the stack is empty.
(OPERATIONS)
PUSH x63; POP; PUSH x16; PUSH x16; POP; PUSH x47; PUSH x23; PUSH x15; PUSH x45; POP; PUSH x45; PUSH x25; PUSH x55; POP; POP; PUSH x52; PUSH x16; PUSH x25; PUSH... | x57 x15 x26 x61 x25 x16 x52 x45 x15 x23 x47 x16 | {'task': 'stack', 'seq': ['PUSH x63', 'POP', 'PUSH x16', 'PUSH x16', 'POP', 'PUSH x47', 'PUSH x23', 'PUSH x15', 'PUSH x45', 'POP', 'PUSH x45', 'PUSH x25', 'PUSH x55', 'POP', 'POP', 'PUSH x52', 'PUSH x16', 'PUSH x25', 'PUSH x61', 'PUSH x26', 'PUSH x4', 'PUSH x53', 'PUSH x16', 'PUSH x31', 'PUSH x2', 'POP', 'POP', 'POP', ... | 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)
x34 x45 x51 x55 x60 x7 x8 x18 x38 x29 x17 x47 x62 x45 x48 x2
(B)
x33 x23 x42 x4 x36 x4 x64 x59 x44 x55 x62 x57 x59 x21 x4 x56 | x34 x45 x51 x55 x60 x7 x8 x18 x38 x29 x17 x47 x62 x48 x2 x33 x23 x42 x4 x36 x64 x59 x44 x57 x21 x56 | {'task': 'union', 'seq': [['x34', 'x45', 'x51', 'x55', 'x60', 'x7', 'x8', 'x18', 'x38', 'x29', 'x17', 'x47', 'x62', 'x45', 'x48', 'x2'], ['x33', 'x23', 'x42', 'x4', 'x36', 'x4', 'x64', 'x59', 'x44', 'x55', 'x62', 'x57', 'x59', 'x21', 'x4', 'x56']], 'k': 4, 'n': 32, '_time': 0.00045108795166015625, '_task': 'basic_proce... | union | instruct | 0 |
Return the unique elements of the sequence in order of first appearance.
(SEQUENCE)
x22 x9 x48 x2 x36 x25 x62 x4 x2 x22 x8 x40 x43 x22 x36 x21 x21 x9 x61 x30 x44 x53 x60 x14 x43 x25 x9 x59 x26 x46 x57 x38 | x22 x9 x48 x2 x36 x25 x62 x4 x8 x40 x43 x21 x61 x30 x44 x53 x60 x14 x59 x26 x46 x57 x38 | {'task': 'set', 'seq': ['x22', 'x9', 'x48', 'x2', 'x36', 'x25', 'x62', 'x4', 'x2', 'x22', 'x8', 'x40', 'x43', 'x22', 'x36', 'x21', 'x21', 'x9', 'x61', 'x30', 'x44', 'x53', 'x60', 'x14', 'x43', 'x25', 'x9', 'x59', 'x26', 'x46', 'x57', 'x38'], 'k': 4, 'n': 32, '_time': 0.0003330707550048828, '_task': 'basic_procedural', ... | set | instruct | 0 |
Sort the sequence in ascending numeric order, where x2 < x10.
(SEQUENCE)
x29 x16 x32 x2 x8 x7 x19 x54 x21 x57 x28 x50 x33 x9 x62 x27 x21 x6 x62 x10 x21 x34 x23 x27 x62 x51 x20 x25 x62 x31 x58 x20 | x2 x6 x7 x8 x9 x10 x16 x19 x20 x20 x21 x21 x21 x23 x25 x27 x27 x28 x29 x31 x32 x33 x34 x50 x51 x54 x57 x58 x62 x62 x62 x62 | {'task': 'sort', 'seq': ['x29', 'x16', 'x32', 'x2', 'x8', 'x7', 'x19', 'x54', 'x21', 'x57', 'x28', 'x50', 'x33', 'x9', 'x62', 'x27', 'x21', 'x6', 'x62', 'x10', 'x21', 'x34', 'x23', 'x27', 'x62', 'x51', 'x20', 'x25', 'x62', 'x31', 'x58', 'x20'], 'k': 4, 'n': 32, '_time': 0.00029778480529785156, '_task': 'basic_procedura... | sort | instruct | 0 |
Delete the first occurrence of TARGET from SEQUENCE. If TARGET is absent, return SEQUENCE unchanged.
(SEQUENCE)
x55 x18 x37 x6 x38 x5 x62 x62 x37 x48 x37 x8 x11 x32 x59 x58 x6 x57 x36 x24 x50 x41 x32 x6 x62 x59 x38 x18 x34 x19 x19 x24
(TARGET)
x58 | x55 x18 x37 x6 x38 x5 x62 x62 x37 x48 x37 x8 x11 x32 x59 x6 x57 x36 x24 x50 x41 x32 x6 x62 x59 x38 x18 x34 x19 x19 x24 | {'task': 'delete', 'seq': [['x55', 'x18', 'x37', 'x6', 'x38', 'x5', 'x62', 'x62', 'x37', 'x48', 'x37', 'x8', 'x11', 'x32', 'x59', 'x58', 'x6', 'x57', 'x36', 'x24', 'x50', 'x41', 'x32', 'x6', 'x62', 'x59', 'x38', 'x18', 'x34', 'x19', 'x19', 'x24'], 'x58'], 'k': 4, 'n': 32, '_time': 0.0004506111145019531, '_task': 'basic... | delete | instruct | 0 |
Return the unique elements of the sequence in order of first appearance.
(SEQUENCE)
x32 x30 x9 x59 x37 x6 x63 x47 x2 x46 x17 x20 x59 x19 x16 x51 x32 x21 x20 x24 x61 x49 x13 x33 x50 x47 x51 x44 x21 x1 x40 x24 | x32 x30 x9 x59 x37 x6 x63 x47 x2 x46 x17 x20 x19 x16 x51 x21 x24 x61 x49 x13 x33 x50 x44 x1 x40 | {'task': 'set', 'seq': ['x32', 'x30', 'x9', 'x59', 'x37', 'x6', 'x63', 'x47', 'x2', 'x46', 'x17', 'x20', 'x59', 'x19', 'x16', 'x51', 'x32', 'x21', 'x20', 'x24', 'x61', 'x49', 'x13', 'x33', 'x50', 'x47', 'x51', 'x44', 'x21', 'x1', 'x40', 'x24'], 'k': 4, 'n': 32, '_time': 0.0003490447998046875, '_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)
x19 x57 x61 x11 x10 x2 x23 x31 x17 x36 x55 x1 x49 x32 x58 x9
(B)
x52 x41 x19 x15 x62 x5 x39 x12 x12 x60 x55 x47 x52 x22 x60 x42 | x19 x57 x61 x11 x10 x2 x23 x31 x17 x36 x55 x1 x49 x32 x58 x9 x52 x41 x15 x62 x5 x39 x12 x60 x47 x22 x42 | {'task': 'union', 'seq': [['x19', 'x57', 'x61', 'x11', 'x10', 'x2', 'x23', 'x31', 'x17', 'x36', 'x55', 'x1', 'x49', 'x32', 'x58', 'x9'], ['x52', 'x41', 'x19', 'x15', 'x62', 'x5', 'x39', 'x12', 'x12', 'x60', 'x55', 'x47', 'x52', 'x22', 'x60', 'x42']], 'k': 4, 'n': 32, '_time': 0.0004165172576904297, '_task': 'basic_proc... | union | instruct | 0 |
Copy the sequence exactly.
(SEQUENCE)
x23 x62 x49 x7 x49 x36 x4 x57 x48 x28 x30 x24 x28 x48 x51 x7 x63 x20 x31 x27 x41 x19 x7 x2 x12 x57 x62 x35 x36 x4 x6 x3 | x23 x62 x49 x7 x49 x36 x4 x57 x48 x28 x30 x24 x28 x48 x51 x7 x63 x20 x31 x27 x41 x19 x7 x2 x12 x57 x62 x35 x36 x4 x6 x3 | {'task': 'identity', 'seq': ['x23', 'x62', 'x49', 'x7', 'x49', 'x36', 'x4', 'x57', 'x48', 'x28', 'x30', 'x24', 'x28', 'x48', 'x51', 'x7', 'x63', 'x20', 'x31', 'x27', 'x41', 'x19', 'x7', 'x2', 'x12', 'x57', 'x62', 'x35', 'x36', 'x4', 'x6', 'x3'], 'k': 4, 'n': 32, '_time': 0.00028252601623535156, '_task': 'basic_procedur... | identity | instruct | 0 |
Delete the first occurrence of TARGET from SEQUENCE. If TARGET is absent, return SEQUENCE unchanged.
(SEQUENCE)
x20 x1 x41 x27 x5 x11 x50 x4 x42 x46 x23 x59 x12 x12 x5 x10 x23 x57 x33 x12 x4 x32 x56 x52 x16 x23 x53 x28 x54 x8 x45 x64
(TARGET)
x56 | x20 x1 x41 x27 x5 x11 x50 x4 x42 x46 x23 x59 x12 x12 x5 x10 x23 x57 x33 x12 x4 x32 x52 x16 x23 x53 x28 x54 x8 x45 x64 | {'task': 'delete', 'seq': [['x20', 'x1', 'x41', 'x27', 'x5', 'x11', 'x50', 'x4', 'x42', 'x46', 'x23', 'x59', 'x12', 'x12', 'x5', 'x10', 'x23', 'x57', 'x33', 'x12', 'x4', 'x32', 'x56', 'x52', 'x16', 'x23', 'x53', 'x28', 'x54', 'x8', 'x45', 'x64'], 'x56'], 'k': 4, 'n': 32, '_time': 0.00043320655822753906, '_task': 'basic... | delete | instruct | 0 |
Copy the sequence exactly.
(SEQUENCE)
x27 x17 x18 x7 x26 x34 x60 x41 x4 x52 x42 x1 x1 x58 x64 x33 x6 x54 x31 x27 x10 x26 x59 x53 x53 x61 x47 x23 x40 x61 x56 x47 | x27 x17 x18 x7 x26 x34 x60 x41 x4 x52 x42 x1 x1 x58 x64 x33 x6 x54 x31 x27 x10 x26 x59 x53 x53 x61 x47 x23 x40 x61 x56 x47 | {'task': 'identity', 'seq': ['x27', 'x17', 'x18', 'x7', 'x26', 'x34', 'x60', 'x41', 'x4', 'x52', 'x42', 'x1', 'x1', 'x58', 'x64', 'x33', 'x6', 'x54', 'x31', 'x27', 'x10', 'x26', 'x59', 'x53', 'x53', 'x61', 'x47', 'x23', 'x40', 'x61', 'x56', 'x47'], 'k': 4, 'n': 32, '_time': 0.00035119056701660156, '_task': 'basic_proce... | 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 x51; PUSH x27; POP; POP; PUSH x53; POP; PUSH x52; POP; PUSH x36; PUSH x45; POP; PUSH x5; POP; PUSH x56; PUSH x4; PUSH x26; PUSH x20; POP; POP; POP; PUSH x... | EMPTY | {'task': 'stack', 'seq': ['PUSH x51', 'PUSH x27', 'POP', 'POP', 'PUSH x53', 'POP', 'PUSH x52', 'POP', 'PUSH x36', 'PUSH x45', 'POP', 'PUSH x5', 'POP', 'PUSH x56', 'PUSH x4', 'PUSH x26', 'PUSH x20', 'POP', 'POP', 'POP', 'PUSH x51', 'PUSH x15', 'POP', 'POP', 'POP', 'POP', 'PUSH x56', 'POP', 'PUSH x9', 'POP', 'PUSH x49', ... | stack | instruct | 0 |
Return the unique elements of the sequence in order of first appearance.
(SEQUENCE)
x5 x19 x34 x37 x56 x45 x23 x43 x7 x60 x53 x23 x59 x50 x11 x44 x27 x8 x41 x9 x46 x24 x4 x42 x45 x51 x8 x27 x16 x48 x13 x59 | x5 x19 x34 x37 x56 x45 x23 x43 x7 x60 x53 x59 x50 x11 x44 x27 x8 x41 x9 x46 x24 x4 x42 x51 x16 x48 x13 | {'task': 'set', 'seq': ['x5', 'x19', 'x34', 'x37', 'x56', 'x45', 'x23', 'x43', 'x7', 'x60', 'x53', 'x23', 'x59', 'x50', 'x11', 'x44', 'x27', 'x8', 'x41', 'x9', 'x46', 'x24', 'x4', 'x42', 'x45', 'x51', 'x8', 'x27', 'x16', 'x48', 'x13', 'x59'], 'k': 4, 'n': 32, '_time': 0.0004248619079589844, '_task': 'basic_procedural',... | set | instruct | 0 |
Sort the sequence in ascending numeric order, where x2 < x10.
(SEQUENCE)
x8 x54 x61 x50 x44 x59 x36 x12 x30 x11 x17 x33 x31 x61 x22 x44 x43 x26 x19 x63 x50 x4 x20 x38 x35 x51 x13 x22 x21 x60 x33 x37 | x4 x8 x11 x12 x13 x17 x19 x20 x21 x22 x22 x26 x30 x31 x33 x33 x35 x36 x37 x38 x43 x44 x44 x50 x50 x51 x54 x59 x60 x61 x61 x63 | {'task': 'sort', 'seq': ['x8', 'x54', 'x61', 'x50', 'x44', 'x59', 'x36', 'x12', 'x30', 'x11', 'x17', 'x33', 'x31', 'x61', 'x22', 'x44', 'x43', 'x26', 'x19', 'x63', 'x50', 'x4', 'x20', 'x38', 'x35', 'x51', 'x13', 'x22', 'x21', 'x60', 'x33', 'x37'], 'k': 4, 'n': 32, '_time': 0.0003552436828613281, '_task': 'basic_procedu... | sort | instruct | 0 |
Reverse the sequence.
(SEQUENCE)
x50 x19 x51 x28 x37 x58 x12 x59 x53 x15 x3 x8 x52 x23 x32 x24 x19 x46 x2 x64 x50 x63 x37 x6 x57 x56 x32 x36 x45 x2 x62 x3 | x3 x62 x2 x45 x36 x32 x56 x57 x6 x37 x63 x50 x64 x2 x46 x19 x24 x32 x23 x52 x8 x3 x15 x53 x59 x12 x58 x37 x28 x51 x19 x50 | {'task': 'reverse', 'seq': ['x50', 'x19', 'x51', 'x28', 'x37', 'x58', 'x12', 'x59', 'x53', 'x15', 'x3', 'x8', 'x52', 'x23', 'x32', 'x24', 'x19', 'x46', 'x2', 'x64', 'x50', 'x63', 'x37', 'x6', 'x57', 'x56', 'x32', 'x36', 'x45', 'x2', 'x62', 'x3'], 'k': 4, 'n': 32, '_time': 0.0004191398620605469, '_task': 'basic_procedur... | reverse | instruct | 0 |
Delete the first occurrence of TARGET from SEQUENCE. If TARGET is absent, return SEQUENCE unchanged.
(SEQUENCE)
x50 x53 x34 x25 x11 x63 x48 x63 x58 x63 x52 x43 x54 x39 x38 x48 x41 x42 x13 x1 x12 x37 x34 x10 x22 x19 x22 x12 x27 x27 x63 x49
(TARGET)
x34 | x50 x53 x25 x11 x63 x48 x63 x58 x63 x52 x43 x54 x39 x38 x48 x41 x42 x13 x1 x12 x37 x34 x10 x22 x19 x22 x12 x27 x27 x63 x49 | {'task': 'delete', 'seq': [['x50', 'x53', 'x34', 'x25', 'x11', 'x63', 'x48', 'x63', 'x58', 'x63', 'x52', 'x43', 'x54', 'x39', 'x38', 'x48', 'x41', 'x42', 'x13', 'x1', 'x12', 'x37', 'x34', 'x10', 'x22', 'x19', 'x22', 'x12', 'x27', 'x27', 'x63', 'x49'], 'x34'], 'k': 4, 'n': 32, '_time': 0.0003001689910888672, '_task': 'b... | 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. | o3 o0 c0 o0 c0 c3 o3 c3 o3 o3 o0 c0 c3 o1 c1 o1 c1 c3 o3 c3 o2 o2 o1 c1 o3 c3 o1 c1 o1 c1 c2 c2 | {'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.000263214111328125, '_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)
x59 x40 x19 x14 x3 x3 x34 x7 x20 x14 x17 x63 x33 x61 x50 x19 x40 x59 x28 x24 x60 x2 x58 x56 x36 x2 x10 x23 x49 x60 x64 x37
(TARGET)
x14 | x59 x40 x19 x3 x3 x34 x7 x20 x14 x17 x63 x33 x61 x50 x19 x40 x59 x28 x24 x60 x2 x58 x56 x36 x2 x10 x23 x49 x60 x64 x37 | {'task': 'delete', 'seq': [['x59', 'x40', 'x19', 'x14', 'x3', 'x3', 'x34', 'x7', 'x20', 'x14', 'x17', 'x63', 'x33', 'x61', 'x50', 'x19', 'x40', 'x59', 'x28', 'x24', 'x60', 'x2', 'x58', 'x56', 'x36', 'x2', 'x10', 'x23', 'x49', 'x60', 'x64', 'x37'], 'x14'], 'k': 4, 'n': 32, '_time': 0.00043511390686035156, '_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 o3 c3 o1 o2 c1 o3 o2 c2 o1 o2 c1 o2 c1 c3 c2 c2 c2 o3 o3 o1 o1 c1 c1 c3 c3 o0 c0 o0 o3 c0 c3 | {'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 |
Reverse the sequence.
(SEQUENCE)
x49 x52 x38 x34 x6 x30 x33 x48 x58 x62 x45 x34 x55 x62 x64 x36 x9 x57 x37 x21 x63 x61 x25 x57 x5 x41 x61 x31 x34 x62 x22 x9 | x9 x22 x62 x34 x31 x61 x41 x5 x57 x25 x61 x63 x21 x37 x57 x9 x36 x64 x62 x55 x34 x45 x62 x58 x48 x33 x30 x6 x34 x38 x52 x49 | {'task': 'reverse', 'seq': ['x49', 'x52', 'x38', 'x34', 'x6', 'x30', 'x33', 'x48', 'x58', 'x62', 'x45', 'x34', 'x55', 'x62', 'x64', 'x36', 'x9', 'x57', 'x37', 'x21', 'x63', 'x61', 'x25', 'x57', 'x5', 'x41', 'x61', 'x31', 'x34', 'x62', 'x22', 'x9'], 'k': 4, 'n': 32, '_time': 0.0002830028533935547, '_task': 'basic_proced... | reverse | instruct | 0 |
Sort the sequence in ascending numeric order, where x2 < x10.
(SEQUENCE)
x8 x4 x19 x5 x21 x51 x12 x30 x15 x13 x32 x20 x22 x50 x56 x4 x28 x57 x1 x26 x50 x21 x62 x14 x44 x7 x38 x18 x62 x20 x46 x25 | x1 x4 x4 x5 x7 x8 x12 x13 x14 x15 x18 x19 x20 x20 x21 x21 x22 x25 x26 x28 x30 x32 x38 x44 x46 x50 x50 x51 x56 x57 x62 x62 | {'task': 'sort', 'seq': ['x8', 'x4', 'x19', 'x5', 'x21', 'x51', 'x12', 'x30', 'x15', 'x13', 'x32', 'x20', 'x22', 'x50', 'x56', 'x4', 'x28', 'x57', 'x1', 'x26', 'x50', 'x21', 'x62', 'x14', 'x44', 'x7', 'x38', 'x18', 'x62', 'x20', 'x46', 'x25'], 'k': 4, 'n': 32, '_time': 0.00034999847412109375, '_task': 'basic_procedural... | sort | instruct | 0 |
Return the unique elements of the sequence in order of first appearance.
(SEQUENCE)
x58 x21 x6 x44 x38 x57 x19 x37 x60 x45 x62 x52 x62 x12 x44 x20 x3 x13 x11 x63 x3 x36 x38 x15 x7 x13 x30 x40 x19 x8 x5 x13 | x58 x21 x6 x44 x38 x57 x19 x37 x60 x45 x62 x52 x12 x20 x3 x13 x11 x63 x36 x15 x7 x30 x40 x8 x5 | {'task': 'set', 'seq': ['x58', 'x21', 'x6', 'x44', 'x38', 'x57', 'x19', 'x37', 'x60', 'x45', 'x62', 'x52', 'x62', 'x12', 'x44', 'x20', 'x3', 'x13', 'x11', 'x63', 'x3', 'x36', 'x38', 'x15', 'x7', 'x13', 'x30', 'x40', 'x19', 'x8', 'x5', 'x13'], 'k': 4, 'n': 32, '_time': 0.0002875328063964844, '_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)
x7 x50 x8 x54 x43 x33 x37 x31 x37 x20 x49 x50 x48 x49 x34 x9
(B)
x59 x14 x13 x32 x37 x42 x21 x56 x24 x36 x48 x52 x13 x54 x16 x1 | x7 x50 x8 x54 x43 x33 x37 x31 x20 x49 x48 x34 x9 x59 x14 x13 x32 x42 x21 x56 x24 x36 x52 x16 x1 | {'task': 'union', 'seq': [['x7', 'x50', 'x8', 'x54', 'x43', 'x33', 'x37', 'x31', 'x37', 'x20', 'x49', 'x50', 'x48', 'x49', 'x34', 'x9'], ['x59', 'x14', 'x13', 'x32', 'x37', 'x42', 'x21', 'x56', 'x24', 'x36', 'x48', 'x52', 'x13', 'x54', 'x16', 'x1']], 'k': 4, 'n': 32, '_time': 0.00045037269592285156, '_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. | o3 o1 o1 o0 o1 c1 c0 o2 c2 c1 c1 o3 c3 c3 o2 c2 o0 o3 c3 c0 o0 o2 c2 c0 o0 o2 o2 c2 c2 o3 c3 c0 | {'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.00038504600524902344, '_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 o3 c3 o1 c1 o3 o3 o1 c1 c3 o3 o1 c1 o2 c2 o3 c3 o2 o2 c2 c2 c3 c3 c0 o3 c3 o2 o1 c1 c2 | {'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0002696514129638672, '_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 o1 o3 o3 c3 o0 o0 o0 o3 o3 c3 o2 o1 o3 o2 c2 c3 c1 o3 o1 o2 c2 c1 c3 c2 c3 c0 c0 c0 c3 c1 | {'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0002613067626953125, '_task': 'basic_procedural', '_level': 0, '_config': {'c': 1.0, 'level': 0, 'seed': None, 'size': None, 'task': 'mixed', 'seq_len': 32, 'vocab_size': 64, 'k': 4, 'p_open': 0.49, 'max_depth': 16}, '_prompt_tokens': 39, '_answer_tokens': 64} | dyck | instruct | 0 |
Generate one valid shuffle-Dyck-4 sequence of exactly 32 tokens. Each close ci must match a previously opened oi of the same type, but closing order may be interleaved across types. Return only the sequence. | o2 c2 o1 c1 o2 o2 o0 c0 o1 c1 o2 c2 c2 c2 o0 o0 o1 o0 o0 c1 c0 o1 o3 o0 c1 c0 o3 c3 c0 c3 c0 c0 | {'task': 'dyck_shuffle', 'seq': [], 'k': 4, 'n': 32, '_time': 0.00033092498779296875, '_task': 'basic_procedural', '_level': 0, '_config': {'c': 1.0, 'level': 0, 'seed': None, 'size': None, 'task': 'mixed', 'seq_len': 32, 'vocab_size': 64, 'k': 4, 'p_open': 0.49, 'max_depth': 16}, '_prompt_tokens': 46, '_answer_tokens'... | dyck_shuffle | instruct | 0 |
Delete the first occurrence of TARGET from SEQUENCE. If TARGET is absent, return SEQUENCE unchanged.
(SEQUENCE)
x51 x43 x35 x13 x14 x1 x12 x15 x60 x53 x17 x43 x39 x41 x50 x43 x19 x51 x60 x52 x7 x16 x45 x40 x6 x18 x6 x56 x48 x56 x51 x4
(TARGET)
x13 | x51 x43 x35 x14 x1 x12 x15 x60 x53 x17 x43 x39 x41 x50 x43 x19 x51 x60 x52 x7 x16 x45 x40 x6 x18 x6 x56 x48 x56 x51 x4 | {'task': 'delete', 'seq': [['x51', 'x43', 'x35', 'x13', 'x14', 'x1', 'x12', 'x15', 'x60', 'x53', 'x17', 'x43', 'x39', 'x41', 'x50', 'x43', 'x19', 'x51', 'x60', 'x52', 'x7', 'x16', 'x45', 'x40', 'x6', 'x18', 'x6', 'x56', 'x48', 'x56', 'x51', 'x4'], 'x13'], 'k': 4, 'n': 32, '_time': 0.0004324913024902344, '_task': 'basic... | 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 x42; PUSH x12; PUSH x36; POP; POP; PUSH x30; POP; POP; PUSH x60; PUSH x37; PUSH x62; PUSH x59; PUSH x37; PUSH x45; POP; POP; POP; PUSH x34; PUSH x45; PUSH... | x37 x60 | {'task': 'stack', 'seq': ['PUSH x42', 'PUSH x12', 'PUSH x36', 'POP', 'POP', 'PUSH x30', 'POP', 'POP', 'PUSH x60', 'PUSH x37', 'PUSH x62', 'PUSH x59', 'PUSH x37', 'PUSH x45', 'POP', 'POP', 'POP', 'PUSH x34', 'PUSH x45', 'PUSH x57', 'PUSH x11', 'POP', 'POP', 'POP', 'POP', 'PUSH x11', 'PUSH x50', 'POP', 'PUSH x41', 'POP',... | stack | instruct | 0 |
Sort the sequence in ascending numeric order, where x2 < x10.
(SEQUENCE)
x36 x1 x14 x45 x33 x45 x57 x9 x12 x54 x47 x55 x64 x21 x40 x64 x9 x19 x41 x12 x62 x13 x18 x41 x15 x31 x55 x64 x12 x20 x15 x31 | x1 x9 x9 x12 x12 x12 x13 x14 x15 x15 x18 x19 x20 x21 x31 x31 x33 x36 x40 x41 x41 x45 x45 x47 x54 x55 x55 x57 x62 x64 x64 x64 | {'task': 'sort', 'seq': ['x36', 'x1', 'x14', 'x45', 'x33', 'x45', 'x57', 'x9', 'x12', 'x54', 'x47', 'x55', 'x64', 'x21', 'x40', 'x64', 'x9', 'x19', 'x41', 'x12', 'x62', 'x13', 'x18', 'x41', 'x15', 'x31', 'x55', 'x64', 'x12', 'x20', 'x15', 'x31'], 'k': 4, 'n': 32, '_time': 0.0002989768981933594, '_task': 'basic_procedur... | sort | instruct | 0 |
Execute the stack operations. PUSH x pushes x. POP removes the top item. Return the final stack from top to bottom, or EMPTY if the stack is empty.
(OPERATIONS)
PUSH x37; POP; PUSH x32; PUSH x22; PUSH x1; PUSH x31; PUSH x54; POP; PUSH x47; PUSH x6; POP; PUSH x45; PUSH x63; PUSH x61; PUSH x2; PUSH x25; PUSH x34; PUSH x5... | x31 x1 x22 x32 | {'task': 'stack', 'seq': ['PUSH x37', 'POP', 'PUSH x32', 'PUSH x22', 'PUSH x1', 'PUSH x31', 'PUSH x54', 'POP', 'PUSH x47', 'PUSH x6', 'POP', 'PUSH x45', 'PUSH x63', 'PUSH x61', 'PUSH x2', 'PUSH x25', 'PUSH x34', 'PUSH x54', 'PUSH x28', 'POP', 'PUSH x6', 'PUSH x12', 'POP', 'POP', 'POP', 'POP', 'POP', 'POP', 'POP', 'POP'... | 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)
x11 x29 x32 x33 x56 x60 x3 x8 x20 x63 x12 x43 x29 x24 x25 x51
(B)
x46 x43 x13 x14 x25 x8 x30 x41 x63 x22 x4 x47 x52 x17 x6 x20 | x11 x29 x32 x33 x56 x60 x3 x8 x20 x63 x12 x43 x24 x25 x51 x46 x13 x14 x30 x41 x22 x4 x47 x52 x17 x6 | {'task': 'union', 'seq': [['x11', 'x29', 'x32', 'x33', 'x56', 'x60', 'x3', 'x8', 'x20', 'x63', 'x12', 'x43', 'x29', 'x24', 'x25', 'x51'], ['x46', 'x43', 'x13', 'x14', 'x25', 'x8', 'x30', 'x41', 'x63', 'x22', 'x4', 'x47', 'x52', 'x17', 'x6', 'x20']], 'k': 4, 'n': 32, '_time': 0.000457763671875, '_task': 'basic_procedura... | 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. | o2 o3 c3 c2 o0 o0 o1 o1 o0 c0 o3 o1 c1 o0 o2 c2 o2 c2 c0 c3 c1 c1 o2 c2 c0 c0 o1 o1 c1 o1 c1 c1 | {'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.00026535987854003906, '_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)
x44 x61 x58 x51 x18 x36 x11 x57 x56 x52 x54 x63 x18 x30 x53 x51 x50 x40 x14 x55 x29 x23 x14 x44 x27 x28 x23 x35 x5 x22 x50 x20 | x44 x61 x58 x51 x18 x36 x11 x57 x56 x52 x54 x63 x30 x53 x50 x40 x14 x55 x29 x23 x27 x28 x35 x5 x22 x20 | {'task': 'set', 'seq': ['x44', 'x61', 'x58', 'x51', 'x18', 'x36', 'x11', 'x57', 'x56', 'x52', 'x54', 'x63', 'x18', 'x30', 'x53', 'x51', 'x50', 'x40', 'x14', 'x55', 'x29', 'x23', 'x14', 'x44', 'x27', 'x28', 'x23', 'x35', 'x5', 'x22', 'x50', 'x20'], 'k': 4, 'n': 32, '_time': 0.0004267692565917969, '_task': 'basic_procedu... | set | instruct | 0 |
Sort the sequence in ascending numeric order, where x2 < x10.
(SEQUENCE)
x13 x50 x8 x10 x32 x31 x32 x62 x47 x30 x63 x28 x11 x47 x22 x21 x12 x18 x38 x37 x35 x8 x46 x50 x5 x54 x34 x50 x32 x52 x22 x8 | x5 x8 x8 x8 x10 x11 x12 x13 x18 x21 x22 x22 x28 x30 x31 x32 x32 x32 x34 x35 x37 x38 x46 x47 x47 x50 x50 x50 x52 x54 x62 x63 | {'task': 'sort', 'seq': ['x13', 'x50', 'x8', 'x10', 'x32', 'x31', 'x32', 'x62', 'x47', 'x30', 'x63', 'x28', 'x11', 'x47', 'x22', 'x21', 'x12', 'x18', 'x38', 'x37', 'x35', 'x8', 'x46', 'x50', 'x5', 'x54', 'x34', 'x50', 'x32', 'x52', 'x22', 'x8'], 'k': 4, 'n': 32, '_time': 0.0003566741943359375, '_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 x29 x8 x55 x56 x20 x47 x56 x5 x18 x40 x53 x59 x30 x29 x49
(B)
x59 x22 x35 x61 x32 x55 x4 x61 x44 x31 x3 x53 x7 x48 x64 x25 | x7 x29 x8 x55 x56 x20 x47 x5 x18 x40 x53 x59 x30 x49 x22 x35 x61 x32 x4 x44 x31 x3 x48 x64 x25 | {'task': 'union', 'seq': [['x7', 'x29', 'x8', 'x55', 'x56', 'x20', 'x47', 'x56', 'x5', 'x18', 'x40', 'x53', 'x59', 'x30', 'x29', 'x49'], ['x59', 'x22', 'x35', 'x61', 'x32', 'x55', 'x4', 'x61', 'x44', 'x31', 'x3', 'x53', 'x7', 'x48', 'x64', 'x25']], 'k': 4, 'n': 32, '_time': 0.0004487037658691406, '_task': 'basic_proced... | union | instruct | 0 |
Execute the stack operations. PUSH x pushes x. POP removes the top item. Return the final stack from top to bottom, or EMPTY if the stack is empty.
(OPERATIONS)
PUSH x9; PUSH x43; PUSH x59; PUSH x9; PUSH x63; PUSH x23; PUSH x45; PUSH x64; POP; PUSH x28; PUSH x24; POP; POP; PUSH x56; PUSH x60; PUSH x14; PUSH x5; PUSH x1... | x23 x63 x9 x59 x43 x9 | {'task': 'stack', 'seq': ['PUSH x9', 'PUSH x43', 'PUSH x59', 'PUSH x9', 'PUSH x63', 'PUSH x23', 'PUSH x45', 'PUSH x64', 'POP', 'PUSH x28', 'PUSH x24', 'POP', 'POP', 'PUSH x56', 'PUSH x60', 'PUSH x14', 'PUSH x5', 'PUSH x1', 'PUSH x55', 'POP', 'PUSH x37', 'POP', 'POP', 'POP', 'POP', 'POP', 'PUSH x12', 'POP', 'POP', 'PUSH... | stack | instruct | 0 |
Return the unique elements of the sequence in order of first appearance.
(SEQUENCE)
x24 x40 x5 x43 x60 x12 x11 x53 x33 x44 x2 x13 x25 x27 x22 x36 x27 x23 x10 x9 x7 x9 x58 x57 x57 x63 x59 x3 x24 x42 x57 x24 | x24 x40 x5 x43 x60 x12 x11 x53 x33 x44 x2 x13 x25 x27 x22 x36 x23 x10 x9 x7 x58 x57 x63 x59 x3 x42 | {'task': 'set', 'seq': ['x24', 'x40', 'x5', 'x43', 'x60', 'x12', 'x11', 'x53', 'x33', 'x44', 'x2', 'x13', 'x25', 'x27', 'x22', 'x36', 'x27', 'x23', 'x10', 'x9', 'x7', 'x9', 'x58', 'x57', 'x57', 'x63', 'x59', 'x3', 'x24', 'x42', 'x57', 'x24'], 'k': 4, 'n': 32, '_time': 0.0004227161407470703, '_task': 'basic_procedural',... | set | instruct | 0 |
Delete the first occurrence of TARGET from SEQUENCE. If TARGET is absent, return SEQUENCE unchanged.
(SEQUENCE)
x64 x62 x52 x16 x21 x26 x38 x38 x39 x48 x8 x48 x58 x46 x45 x63 x64 x3 x20 x20 x51 x45 x25 x40 x63 x47 x42 x13 x44 x22 x31 x17
(TARGET)
x38 | x64 x62 x52 x16 x21 x26 x38 x39 x48 x8 x48 x58 x46 x45 x63 x64 x3 x20 x20 x51 x45 x25 x40 x63 x47 x42 x13 x44 x22 x31 x17 | {'task': 'delete', 'seq': [['x64', 'x62', 'x52', 'x16', 'x21', 'x26', 'x38', 'x38', 'x39', 'x48', 'x8', 'x48', 'x58', 'x46', 'x45', 'x63', 'x64', 'x3', 'x20', 'x20', 'x51', 'x45', 'x25', 'x40', 'x63', 'x47', 'x42', 'x13', 'x44', 'x22', 'x31', 'x17'], 'x38'], 'k': 4, 'n': 32, '_time': 0.00037384033203125, '_task': 'basi... | delete | instruct | 0 |
Return the unique elements of the sequence in order of first appearance.
(SEQUENCE)
x11 x61 x42 x61 x44 x6 x2 x20 x45 x21 x48 x49 x11 x2 x29 x52 x7 x56 x62 x8 x41 x40 x12 x17 x12 x6 x53 x55 x29 x34 x17 x5 | x11 x61 x42 x44 x6 x2 x20 x45 x21 x48 x49 x29 x52 x7 x56 x62 x8 x41 x40 x12 x17 x53 x55 x34 x5 | {'task': 'set', 'seq': ['x11', 'x61', 'x42', 'x61', 'x44', 'x6', 'x2', 'x20', 'x45', 'x21', 'x48', 'x49', 'x11', 'x2', 'x29', 'x52', 'x7', 'x56', 'x62', 'x8', 'x41', 'x40', 'x12', 'x17', 'x12', 'x6', 'x53', 'x55', 'x29', 'x34', 'x17', 'x5'], 'k': 4, 'n': 32, '_time': 0.0002868175506591797, '_task': 'basic_procedural', ... | set | instruct | 0 |
Delete the first occurrence of TARGET from SEQUENCE. If TARGET is absent, return SEQUENCE unchanged.
(SEQUENCE)
x35 x32 x20 x47 x64 x56 x42 x47 x60 x51 x52 x1 x15 x47 x39 x57 x7 x33 x21 x6 x52 x8 x64 x18 x36 x8 x60 x56 x43 x28 x35 x52
(TARGET)
x52 | x35 x32 x20 x47 x64 x56 x42 x47 x60 x51 x1 x15 x47 x39 x57 x7 x33 x21 x6 x52 x8 x64 x18 x36 x8 x60 x56 x43 x28 x35 x52 | {'task': 'delete', 'seq': [['x35', 'x32', 'x20', 'x47', 'x64', 'x56', 'x42', 'x47', 'x60', 'x51', 'x52', 'x1', 'x15', 'x47', 'x39', 'x57', 'x7', 'x33', 'x21', 'x6', 'x52', 'x8', 'x64', 'x18', 'x36', 'x8', 'x60', 'x56', 'x43', 'x28', 'x35', 'x52'], 'x52'], 'k': 4, 'n': 32, '_time': 0.0004355907440185547, '_task': 'basic... | delete | instruct | 0 |
Generate one valid shuffle-Dyck-4 sequence of exactly 32 tokens. Each close ci must match a previously opened oi of the same type, but closing order may be interleaved across types. Return only the sequence. | o3 o0 o1 c0 c3 c1 o1 c1 o3 c3 o1 c1 o1 o3 o2 c3 c2 c1 o0 o0 c0 o1 o2 c2 c0 o3 c3 c1 o1 o2 c2 c1 | {'task': 'dyck_shuffle', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0003495216369628906, '_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)
x29 x25 x64 x38 x33 x52 x44 x51 x40 x45 x36 x48 x11 x29 x43 x37
(B)
x49 x34 x15 x17 x18 x12 x6 x12 x53 x60 x12 x64 x58 x46 x44 x3 | x29 x25 x64 x38 x33 x52 x44 x51 x40 x45 x36 x48 x11 x43 x37 x49 x34 x15 x17 x18 x12 x6 x53 x60 x58 x46 x3 | {'task': 'union', 'seq': [['x29', 'x25', 'x64', 'x38', 'x33', 'x52', 'x44', 'x51', 'x40', 'x45', 'x36', 'x48', 'x11', 'x29', 'x43', 'x37'], ['x49', 'x34', 'x15', 'x17', 'x18', 'x12', 'x6', 'x12', 'x53', 'x60', 'x12', 'x64', 'x58', 'x46', 'x44', 'x3']], 'k': 4, 'n': 32, '_time': 0.00045990943908691406, '_task': 'basic_p... | union | instruct | 0 |
Return the unique elements of the sequence in order of first appearance.
(SEQUENCE)
x13 x2 x7 x38 x27 x35 x39 x8 x34 x52 x42 x36 x12 x30 x13 x12 x38 x3 x54 x54 x41 x15 x41 x28 x5 x8 x10 x2 x40 x13 x3 x49 | x13 x2 x7 x38 x27 x35 x39 x8 x34 x52 x42 x36 x12 x30 x3 x54 x41 x15 x28 x5 x10 x40 x49 | {'task': 'set', 'seq': ['x13', 'x2', 'x7', 'x38', 'x27', 'x35', 'x39', 'x8', 'x34', 'x52', 'x42', 'x36', 'x12', 'x30', 'x13', 'x12', 'x38', 'x3', 'x54', 'x54', 'x41', 'x15', 'x41', 'x28', 'x5', 'x8', 'x10', 'x2', 'x40', 'x13', 'x3', 'x49'], 'k': 4, 'n': 32, '_time': 0.00028514862060546875, '_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 o0 c0 o3 o2 c2 c3 o0 c0 o0 o2 c0 o0 o3 c2 o0 c3 o1 c0 c0 o0 c0 c1 o2 c2 o0 c0 o1 c1 o3 c3 | {'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)
x25 x11 x64 x9 x29 x2 x14 x9 x5 x2 x1 x33 x23 x48 x43 x31
(B)
x32 x11 x7 x37 x2 x60 x61 x60 x21 x53 x44 x39 x25 x61 x19 x63 | x25 x11 x64 x9 x29 x2 x14 x5 x1 x33 x23 x48 x43 x31 x32 x7 x37 x60 x61 x21 x53 x44 x39 x19 x63 | {'task': 'union', 'seq': [['x25', 'x11', 'x64', 'x9', 'x29', 'x2', 'x14', 'x9', 'x5', 'x2', 'x1', 'x33', 'x23', 'x48', 'x43', 'x31'], ['x32', 'x11', 'x7', 'x37', 'x2', 'x60', 'x61', 'x60', 'x21', 'x53', 'x44', 'x39', 'x25', 'x61', 'x19', 'x63']], 'k': 4, 'n': 32, '_time': 0.00032830238342285156, '_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. | o3 o3 o2 o2 o2 o1 o1 c1 c1 o1 c1 c2 o0 c0 o1 o1 c1 o0 c0 c1 c2 o0 o1 o3 o2 c2 c3 c1 c0 c2 c3 c3 | {'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.00026106834411621094, '_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 x8; PUSH x4; PUSH x60; PUSH x42; PUSH x9; PUSH x40; POP; PUSH x30; PUSH x62; PUSH x23; POP; PUSH x60; PUSH x50; POP; PUSH x19; PUSH x53; POP; POP; PUSH x2... | x30 x9 x42 x60 x4 x8 | {'task': 'stack', 'seq': ['PUSH x8', 'PUSH x4', 'PUSH x60', 'PUSH x42', 'PUSH x9', 'PUSH x40', 'POP', 'PUSH x30', 'PUSH x62', 'PUSH x23', 'POP', 'PUSH x60', 'PUSH x50', 'POP', 'PUSH x19', 'PUSH x53', 'POP', 'POP', 'PUSH x26', 'PUSH x6', 'PUSH x31', 'PUSH x2', 'PUSH x50', 'POP', 'POP', 'POP', 'POP', 'POP', 'POP', 'POP',... | 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)
x27 x15 x43 x26 x39 x19 x52 x63 x61 x25 x52 x29 x55 x64 x8 x45
(B)
x27 x19 x56 x60 x9 x49 x29 x29 x44 x24 x22 x1 x39 x19 x17 x46 | x27 x15 x43 x26 x39 x19 x52 x63 x61 x25 x29 x55 x64 x8 x45 x56 x60 x9 x49 x44 x24 x22 x1 x17 x46 | {'task': 'union', 'seq': [['x27', 'x15', 'x43', 'x26', 'x39', 'x19', 'x52', 'x63', 'x61', 'x25', 'x52', 'x29', 'x55', 'x64', 'x8', 'x45'], ['x27', 'x19', 'x56', 'x60', 'x9', 'x49', 'x29', 'x29', 'x44', 'x24', 'x22', 'x1', 'x39', 'x19', 'x17', 'x46']], 'k': 4, 'n': 32, '_time': 0.0004470348358154297, '_task': 'basic_pro... | union | instruct | 0 |
Copy the sequence exactly.
(SEQUENCE)
x45 x15 x1 x9 x57 x36 x12 x5 x29 x29 x49 x5 x5 x34 x2 x40 x32 x40 x12 x59 x53 x64 x60 x31 x43 x20 x34 x2 x22 x3 x45 x15 | x45 x15 x1 x9 x57 x36 x12 x5 x29 x29 x49 x5 x5 x34 x2 x40 x32 x40 x12 x59 x53 x64 x60 x31 x43 x20 x34 x2 x22 x3 x45 x15 | {'task': 'identity', 'seq': ['x45', 'x15', 'x1', 'x9', 'x57', 'x36', 'x12', 'x5', 'x29', 'x29', 'x49', 'x5', 'x5', 'x34', 'x2', 'x40', 'x32', 'x40', 'x12', 'x59', 'x53', 'x64', 'x60', 'x31', 'x43', 'x20', 'x34', 'x2', 'x22', 'x3', 'x45', 'x15'], 'k': 4, 'n': 32, '_time': 0.00037670135498046875, '_task': 'basic_procedur... | identity | instruct | 0 |
Return the unique elements of the sequence in order of first appearance.
(SEQUENCE)
x32 x26 x18 x35 x1 x36 x46 x15 x32 x62 x50 x38 x51 x22 x35 x29 x63 x62 x47 x18 x37 x2 x49 x18 x32 x43 x51 x33 x16 x62 x53 x19 | x32 x26 x18 x35 x1 x36 x46 x15 x62 x50 x38 x51 x22 x29 x63 x47 x37 x2 x49 x43 x33 x16 x53 x19 | {'task': 'set', 'seq': ['x32', 'x26', 'x18', 'x35', 'x1', 'x36', 'x46', 'x15', 'x32', 'x62', 'x50', 'x38', 'x51', 'x22', 'x35', 'x29', 'x63', 'x62', 'x47', 'x18', 'x37', 'x2', 'x49', 'x18', 'x32', 'x43', 'x51', 'x33', 'x16', 'x62', 'x53', 'x19'], 'k': 4, 'n': 32, '_time': 0.00028634071350097656, '_task': 'basic_procedu... | set | instruct | 0 |
Sort the sequence in ascending numeric order, where x2 < x10.
(SEQUENCE)
x40 x7 x41 x21 x8 x43 x20 x22 x12 x20 x11 x41 x32 x14 x53 x62 x47 x41 x37 x18 x55 x51 x46 x50 x29 x25 x37 x51 x60 x24 x50 x23 | x7 x8 x11 x12 x14 x18 x20 x20 x21 x22 x23 x24 x25 x29 x32 x37 x37 x40 x41 x41 x41 x43 x46 x47 x50 x50 x51 x51 x53 x55 x60 x62 | {'task': 'sort', 'seq': ['x40', 'x7', 'x41', 'x21', 'x8', 'x43', 'x20', 'x22', 'x12', 'x20', 'x11', 'x41', 'x32', 'x14', 'x53', 'x62', 'x47', 'x41', 'x37', 'x18', 'x55', 'x51', 'x46', 'x50', 'x29', 'x25', 'x37', 'x51', 'x60', 'x24', 'x50', 'x23'], 'k': 4, 'n': 32, '_time': 0.0003497600555419922, '_task': 'basic_procedu... | sort | instruct | 0 |
Return the unique elements of the sequence in order of first appearance.
(SEQUENCE)
x23 x41 x52 x38 x3 x5 x29 x30 x51 x7 x22 x17 x2 x57 x21 x37 x40 x25 x18 x58 x43 x60 x43 x40 x32 x25 x36 x54 x55 x34 x54 x15 | x23 x41 x52 x38 x3 x5 x29 x30 x51 x7 x22 x17 x2 x57 x21 x37 x40 x25 x18 x58 x43 x60 x32 x36 x54 x55 x34 x15 | {'task': 'set', 'seq': ['x23', 'x41', 'x52', 'x38', 'x3', 'x5', 'x29', 'x30', 'x51', 'x7', 'x22', 'x17', 'x2', 'x57', 'x21', 'x37', 'x40', 'x25', 'x18', 'x58', 'x43', 'x60', 'x43', 'x40', 'x32', 'x25', 'x36', 'x54', 'x55', 'x34', 'x54', 'x15'], 'k': 4, 'n': 32, '_time': 0.0004260540008544922, '_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 c2 o2 c2 o2 c2 o0 o3 c3 c0 o1 c1 o1 o3 o3 c3 c3 o0 c0 c1 o3 o0 o2 c2 c0 c3 o3 c3 o1 c1 o3 c3 | {'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0002605915069580078, '_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)
x17 x22 x50 x47 x42 x15 x59 x51 x25 x4 x56 x36 x30 x1 x52 x61
(B)
x36 x38 x19 x6 x25 x60 x54 x26 x30 x25 x28 x12 x25 x22 x6 x33 | x17 x22 x50 x47 x42 x15 x59 x51 x25 x4 x56 x36 x30 x1 x52 x61 x38 x19 x6 x60 x54 x26 x28 x12 x33 | {'task': 'union', 'seq': [['x17', 'x22', 'x50', 'x47', 'x42', 'x15', 'x59', 'x51', 'x25', 'x4', 'x56', 'x36', 'x30', 'x1', 'x52', 'x61'], ['x36', 'x38', 'x19', 'x6', 'x25', 'x60', 'x54', 'x26', 'x30', 'x25', 'x28', 'x12', 'x25', 'x22', 'x6', 'x33']], 'k': 4, 'n': 32, '_time': 0.0003752708435058594, '_task': 'basic_proc... | 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 x45; PUSH x53; PUSH x47; PUSH x28; PUSH x62; PUSH x49; PUSH x25; PUSH x37; PUSH x47; PUSH x35; POP; PUSH x21; PUSH x52; POP; PUSH x22; PUSH x53; POP; PUSH... | x37 x25 x49 x62 x28 x47 x53 x45 | {'task': 'stack', 'seq': ['PUSH x45', 'PUSH x53', 'PUSH x47', 'PUSH x28', 'PUSH x62', 'PUSH x49', 'PUSH x25', 'PUSH x37', 'PUSH x47', 'PUSH x35', 'POP', 'PUSH x21', 'PUSH x52', 'POP', 'PUSH x22', 'PUSH x53', 'POP', 'PUSH x47', 'PUSH x47', 'POP', 'PUSH x64', 'PUSH x60', 'POP', 'PUSH x14', 'POP', 'POP', 'POP', 'POP', 'PU... | 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. | o0 c0 o3 o0 c0 o1 c1 o0 c0 o2 c2 c3 o1 o0 c0 c1 o0 o0 c0 c0 o2 c2 o3 o0 c0 o2 c2 o2 c2 c3 o1 c1 | {'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0002624988555908203, '_task': 'basic_procedural', '_level': 0, '_config': {'c': 1.0, 'level': 0, 'seed': None, 'size': None, 'task': 'mixed', 'seq_len': 32, 'vocab_size': 64, 'k': 4, 'p_open': 0.49, 'max_depth': 16}, '_prompt_tokens': 39, '_answer_tokens': 64} | dyck | instruct | 0 |
Delete the first occurrence of TARGET from SEQUENCE. If TARGET is absent, return SEQUENCE unchanged.
(SEQUENCE)
x24 x27 x58 x22 x51 x14 x31 x44 x20 x19 x45 x9 x9 x57 x33 x6 x5 x30 x62 x5 x11 x13 x46 x41 x54 x26 x41 x45 x52 x5 x3 x54
(TARGET)
x5 | x24 x27 x58 x22 x51 x14 x31 x44 x20 x19 x45 x9 x9 x57 x33 x6 x30 x62 x5 x11 x13 x46 x41 x54 x26 x41 x45 x52 x5 x3 x54 | {'task': 'delete', 'seq': [['x24', 'x27', 'x58', 'x22', 'x51', 'x14', 'x31', 'x44', 'x20', 'x19', 'x45', 'x9', 'x9', 'x57', 'x33', 'x6', 'x5', 'x30', 'x62', 'x5', 'x11', 'x13', 'x46', 'x41', 'x54', 'x26', 'x41', 'x45', 'x52', 'x5', 'x3', 'x54'], 'x5'], 'k': 4, 'n': 32, '_time': 0.00043487548828125, '_task': 'basic_proc... | 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)
x2 x10 x60 x1 x49 x17 x39 x53 x29 x14 x28 x14 x11 x25 x22 x7
(B)
x14 x61 x18 x48 x16 x1 x22 x57 x32 x43 x32 x43 x11 x17 x1 x38 | x2 x10 x60 x1 x49 x17 x39 x53 x29 x14 x28 x11 x25 x22 x7 x61 x18 x48 x16 x57 x32 x43 x38 | {'task': 'union', 'seq': [['x2', 'x10', 'x60', 'x1', 'x49', 'x17', 'x39', 'x53', 'x29', 'x14', 'x28', 'x14', 'x11', 'x25', 'x22', 'x7'], ['x14', 'x61', 'x18', 'x48', 'x16', 'x1', 'x22', 'x57', 'x32', 'x43', 'x32', 'x43', 'x11', 'x17', 'x1', 'x38']], 'k': 4, 'n': 32, '_time': 0.0003829002380371094, '_task': 'basic_proce... | union | instruct | 0 |
Reverse the sequence.
(SEQUENCE)
x27 x39 x64 x58 x42 x27 x1 x12 x6 x38 x54 x2 x17 x25 x12 x50 x22 x64 x34 x52 x7 x20 x58 x17 x4 x4 x37 x6 x34 x50 x31 x24 | x24 x31 x50 x34 x6 x37 x4 x4 x17 x58 x20 x7 x52 x34 x64 x22 x50 x12 x25 x17 x2 x54 x38 x6 x12 x1 x27 x42 x58 x64 x39 x27 | {'task': 'reverse', 'seq': ['x27', 'x39', 'x64', 'x58', 'x42', 'x27', 'x1', 'x12', 'x6', 'x38', 'x54', 'x2', 'x17', 'x25', 'x12', 'x50', 'x22', 'x64', 'x34', 'x52', 'x7', 'x20', 'x58', 'x17', 'x4', 'x4', 'x37', 'x6', 'x34', 'x50', 'x31', 'x24'], 'k': 4, 'n': 32, '_time': 0.0004134178161621094, '_task': 'basic_procedura... | 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. | o1 o3 c1 c3 o1 c1 o1 o0 o2 o2 o1 c2 o0 o2 o0 c1 c0 o0 o0 o2 c1 c0 c2 o3 c2 o0 c3 c2 c0 c0 c0 c0 | {'task': 'dyck_shuffle', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0004525184631347656, '_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)
x52 x11 x31 x61 x19 x7 x29 x54 x17 x10 x38 x20 x33 x54 x26 x54 x38 x43 x36 x3 x48 x58 x5 x53 x60 x20 x27 x49 x63 x48 x38 x3 | x52 x11 x31 x61 x19 x7 x29 x54 x17 x10 x38 x20 x33 x26 x43 x36 x3 x48 x58 x5 x53 x60 x27 x49 x63 | {'task': 'set', 'seq': ['x52', 'x11', 'x31', 'x61', 'x19', 'x7', 'x29', 'x54', 'x17', 'x10', 'x38', 'x20', 'x33', 'x54', 'x26', 'x54', 'x38', 'x43', 'x36', 'x3', 'x48', 'x58', 'x5', 'x53', 'x60', 'x20', 'x27', 'x49', 'x63', 'x48', 'x38', 'x3'], 'k': 4, 'n': 32, '_time': 0.0003688335418701172, '_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)
x46 x15 x30 x37 x52 x27 x55 x4 x39 x57 x33 x24 x64 x49 x50 x32
(B)
x13 x27 x55 x35 x28 x14 x32 x41 x30 x56 x11 x3 x16 x25 x12 x41 | x46 x15 x30 x37 x52 x27 x55 x4 x39 x57 x33 x24 x64 x49 x50 x32 x13 x35 x28 x14 x41 x56 x11 x3 x16 x25 x12 | {'task': 'union', 'seq': [['x46', 'x15', 'x30', 'x37', 'x52', 'x27', 'x55', 'x4', 'x39', 'x57', 'x33', 'x24', 'x64', 'x49', 'x50', 'x32'], ['x13', 'x27', 'x55', 'x35', 'x28', 'x14', 'x32', 'x41', 'x30', 'x56', 'x11', 'x3', 'x16', 'x25', 'x12', 'x41']], 'k': 4, 'n': 32, '_time': 0.00030803680419921875, '_task': 'basic_p... | union | instruct | 0 |
Reverse the sequence.
(SEQUENCE)
x47 x7 x59 x34 x29 x52 x59 x22 x63 x30 x41 x20 x33 x50 x16 x56 x22 x39 x35 x60 x15 x15 x31 x9 x1 x31 x30 x13 x64 x33 x5 x55 | x55 x5 x33 x64 x13 x30 x31 x1 x9 x31 x15 x15 x60 x35 x39 x22 x56 x16 x50 x33 x20 x41 x30 x63 x22 x59 x52 x29 x34 x59 x7 x47 | {'task': 'reverse', 'seq': ['x47', 'x7', 'x59', 'x34', 'x29', 'x52', 'x59', 'x22', 'x63', 'x30', 'x41', 'x20', 'x33', 'x50', 'x16', 'x56', 'x22', 'x39', 'x35', 'x60', 'x15', 'x15', 'x31', 'x9', 'x1', 'x31', 'x30', 'x13', 'x64', 'x33', 'x5', 'x55'], 'k': 4, 'n': 32, '_time': 0.0004127025604248047, '_task': 'basic_proced... | 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 c2 o1 o2 c1 c2 o2 o0 c0 o1 o3 o2 o0 o1 o2 c0 c1 c2 o2 o2 c2 c1 c2 o0 o3 c3 c0 o1 c2 c1 c2 c3 | {'task': 'dyck_shuffle', 'seq': [], 'k': 4, 'n': 32, '_time': 0.00045108795166015625, '_task': 'basic_procedural', '_level': 0, '_config': {'c': 1.0, 'level': 0, 'seed': None, 'size': None, 'task': 'mixed', 'seq_len': 32, 'vocab_size': 64, 'k': 4, 'p_open': 0.49, 'max_depth': 16}, '_prompt_tokens': 46, '_answer_tokens'... | dyck_shuffle | instruct | 0 |
Delete the first occurrence of TARGET from SEQUENCE. If TARGET is absent, return SEQUENCE unchanged.
(SEQUENCE)
x6 x52 x46 x29 x12 x17 x46 x57 x22 x24 x61 x19 x28 x32 x7 x5 x54 x47 x25 x61 x61 x55 x6 x17 x20 x14 x23 x46 x45 x52 x61 x32
(TARGET)
x29 | x6 x52 x46 x12 x17 x46 x57 x22 x24 x61 x19 x28 x32 x7 x5 x54 x47 x25 x61 x61 x55 x6 x17 x20 x14 x23 x46 x45 x52 x61 x32 | {'task': 'delete', 'seq': [['x6', 'x52', 'x46', 'x29', 'x12', 'x17', 'x46', 'x57', 'x22', 'x24', 'x61', 'x19', 'x28', 'x32', 'x7', 'x5', 'x54', 'x47', 'x25', 'x61', 'x61', 'x55', 'x6', 'x17', 'x20', 'x14', 'x23', 'x46', 'x45', 'x52', 'x61', 'x32'], 'x29'], 'k': 4, 'n': 32, '_time': 0.00031113624572753906, '_task': 'bas... | delete | instruct | 0 |
Return the unique elements of the sequence in order of first appearance.
(SEQUENCE)
x60 x1 x14 x63 x29 x55 x20 x38 x34 x35 x7 x35 x8 x59 x12 x26 x61 x8 x18 x23 x54 x62 x36 x9 x3 x1 x56 x1 x63 x52 x16 x14 | x60 x1 x14 x63 x29 x55 x20 x38 x34 x35 x7 x8 x59 x12 x26 x61 x18 x23 x54 x62 x36 x9 x3 x56 x52 x16 | {'task': 'set', 'seq': ['x60', 'x1', 'x14', 'x63', 'x29', 'x55', 'x20', 'x38', 'x34', 'x35', 'x7', 'x35', 'x8', 'x59', 'x12', 'x26', 'x61', 'x8', 'x18', 'x23', 'x54', 'x62', 'x36', 'x9', 'x3', 'x1', 'x56', 'x1', 'x63', 'x52', 'x16', 'x14'], 'k': 4, 'n': 32, '_time': 0.00028824806213378906, '_task': 'basic_procedural', ... | set | instruct | 0 |
Execute the stack operations. PUSH x pushes x. POP removes the top item. Return the final stack from top to bottom, or EMPTY if the stack is empty.
(OPERATIONS)
PUSH x35; PUSH x51; PUSH x11; POP; POP; PUSH x58; PUSH x22; PUSH x33; POP; PUSH x33; PUSH x46; PUSH x32; PUSH x34; PUSH x47; PUSH x50; PUSH x52; PUSH x39; PUSH... | x33 x22 x58 x35 | {'task': 'stack', 'seq': ['PUSH x35', 'PUSH x51', 'PUSH x11', 'POP', 'POP', 'PUSH x58', 'PUSH x22', 'PUSH x33', 'POP', 'PUSH x33', 'PUSH x46', 'PUSH x32', 'PUSH x34', 'PUSH x47', 'PUSH x50', 'PUSH x52', 'PUSH x39', 'PUSH x46', 'PUSH x7', 'POP', 'POP', 'PUSH x44', 'PUSH x39', 'POP', 'POP', 'POP', 'POP', 'POP', 'POP', 'P... | stack | instruct | 0 |
Sort the sequence in ascending numeric order, where x2 < x10.
(SEQUENCE)
x7 x41 x22 x59 x35 x14 x51 x51 x35 x31 x28 x50 x52 x14 x62 x16 x2 x10 x1 x18 x47 x7 x22 x61 x64 x57 x52 x13 x22 x54 x34 x14 | x1 x2 x7 x7 x10 x13 x14 x14 x14 x16 x18 x22 x22 x22 x28 x31 x34 x35 x35 x41 x47 x50 x51 x51 x52 x52 x54 x57 x59 x61 x62 x64 | {'task': 'sort', 'seq': ['x7', 'x41', 'x22', 'x59', 'x35', 'x14', 'x51', 'x51', 'x35', 'x31', 'x28', 'x50', 'x52', 'x14', 'x62', 'x16', 'x2', 'x10', 'x1', 'x18', 'x47', 'x7', 'x22', 'x61', 'x64', 'x57', 'x52', 'x13', 'x22', 'x54', 'x34', 'x14'], 'k': 4, 'n': 32, '_time': 0.0003490447998046875, '_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)
x29 x34 x44 x23 x40 x36 x48 x60 x30 x36 x50 x19 x17 x59 x58 x3
(B)
x46 x64 x4 x58 x23 x29 x5 x16 x9 x40 x61 x5 x9 x6 x34 x18 | x29 x34 x44 x23 x40 x36 x48 x60 x30 x50 x19 x17 x59 x58 x3 x46 x64 x4 x5 x16 x9 x61 x6 x18 | {'task': 'union', 'seq': [['x29', 'x34', 'x44', 'x23', 'x40', 'x36', 'x48', 'x60', 'x30', 'x36', 'x50', 'x19', 'x17', 'x59', 'x58', 'x3'], ['x46', 'x64', 'x4', 'x58', 'x23', 'x29', 'x5', 'x16', 'x9', 'x40', 'x61', 'x5', 'x9', 'x6', 'x34', 'x18']], 'k': 4, 'n': 32, '_time': 0.00045108795166015625, '_task': 'basic_proced... | union | instruct | 0 |
Copy the sequence exactly.
(SEQUENCE)
x26 x60 x25 x39 x31 x38 x39 x41 x47 x38 x51 x59 x2 x57 x30 x36 x4 x18 x43 x31 x50 x63 x47 x59 x39 x3 x8 x17 x46 x47 x55 x45 | x26 x60 x25 x39 x31 x38 x39 x41 x47 x38 x51 x59 x2 x57 x30 x36 x4 x18 x43 x31 x50 x63 x47 x59 x39 x3 x8 x17 x46 x47 x55 x45 | {'task': 'identity', 'seq': ['x26', 'x60', 'x25', 'x39', 'x31', 'x38', 'x39', 'x41', 'x47', 'x38', 'x51', 'x59', 'x2', 'x57', 'x30', 'x36', 'x4', 'x18', 'x43', 'x31', 'x50', 'x63', 'x47', 'x59', 'x39', 'x3', 'x8', 'x17', 'x46', 'x47', 'x55', 'x45'], 'k': 4, 'n': 32, '_time': 0.0002815723419189453, '_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)
x13 x62 x4 x18 x48 x30 x8 x28 x31 x20 x38 x56 x46 x13 x47 x60
(B)
x64 x31 x19 x2 x58 x8 x58 x44 x7 x37 x39 x13 x21 x38 x48 x17 | x13 x62 x4 x18 x48 x30 x8 x28 x31 x20 x38 x56 x46 x47 x60 x64 x19 x2 x58 x44 x7 x37 x39 x21 x17 | {'task': 'union', 'seq': [['x13', 'x62', 'x4', 'x18', 'x48', 'x30', 'x8', 'x28', 'x31', 'x20', 'x38', 'x56', 'x46', 'x13', 'x47', 'x60'], ['x64', 'x31', 'x19', 'x2', 'x58', 'x8', 'x58', 'x44', 'x7', 'x37', 'x39', 'x13', 'x21', 'x38', 'x48', 'x17']], 'k': 4, 'n': 32, '_time': 0.0004470348358154297, '_task': 'basic_proce... | union | instruct | 0 |
Return the unique elements of the sequence in order of first appearance.
(SEQUENCE)
x29 x63 x52 x33 x22 x58 x31 x10 x6 x4 x55 x57 x55 x44 x41 x5 x63 x12 x2 x35 x4 x62 x26 x32 x7 x58 x12 x56 x52 x31 x46 x61 | x29 x63 x52 x33 x22 x58 x31 x10 x6 x4 x55 x57 x44 x41 x5 x12 x2 x35 x62 x26 x32 x7 x56 x46 x61 | {'task': 'set', 'seq': ['x29', 'x63', 'x52', 'x33', 'x22', 'x58', 'x31', 'x10', 'x6', 'x4', 'x55', 'x57', 'x55', 'x44', 'x41', 'x5', 'x63', 'x12', 'x2', 'x35', 'x4', 'x62', 'x26', 'x32', 'x7', 'x58', 'x12', 'x56', 'x52', 'x31', 'x46', 'x61'], 'k': 4, 'n': 32, '_time': 0.0002899169921875, '_task': 'basic_procedural', '_... | set | instruct | 0 |
Return the unique elements of the sequence in order of first appearance.
(SEQUENCE)
x7 x56 x21 x23 x46 x17 x17 x45 x5 x47 x45 x25 x38 x10 x22 x34 x46 x45 x8 x13 x16 x18 x33 x49 x32 x57 x15 x6 x8 x55 x51 x55 | x7 x56 x21 x23 x46 x17 x45 x5 x47 x25 x38 x10 x22 x34 x8 x13 x16 x18 x33 x49 x32 x57 x15 x6 x55 x51 | {'task': 'set', 'seq': ['x7', 'x56', 'x21', 'x23', 'x46', 'x17', 'x17', 'x45', 'x5', 'x47', 'x45', 'x25', 'x38', 'x10', 'x22', 'x34', 'x46', 'x45', 'x8', 'x13', 'x16', 'x18', 'x33', 'x49', 'x32', 'x57', 'x15', 'x6', 'x8', 'x55', 'x51', 'x55'], 'k': 4, 'n': 32, '_time': 0.00028896331787109375, '_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)
x53 x45 x17 x10 x25 x46 x5 x17 x55 x62 x47 x32 x21 x16 x6 x27
(B)
x14 x52 x26 x52 x45 x40 x36 x60 x11 x33 x27 x31 x32 x7 x52 x31 | x53 x45 x17 x10 x25 x46 x5 x55 x62 x47 x32 x21 x16 x6 x27 x14 x52 x26 x40 x36 x60 x11 x33 x31 x7 | {'task': 'union', 'seq': [['x53', 'x45', 'x17', 'x10', 'x25', 'x46', 'x5', 'x17', 'x55', 'x62', 'x47', 'x32', 'x21', 'x16', 'x6', 'x27'], ['x14', 'x52', 'x26', 'x52', 'x45', 'x40', 'x36', 'x60', 'x11', 'x33', 'x27', 'x31', 'x32', 'x7', 'x52', 'x31']], 'k': 4, 'n': 32, '_time': 0.00041961669921875, '_task': 'basic_proce... | 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)
x6 x36 x16 x7 x24 x13 x29 x50 x51 x3 x13 x58 x22 x55 x54 x35
(B)
x59 x64 x5 x45 x19 x17 x40 x33 x30 x9 x16 x50 x55 x7 x60 x17 | x6 x36 x16 x7 x24 x13 x29 x50 x51 x3 x58 x22 x55 x54 x35 x59 x64 x5 x45 x19 x17 x40 x33 x30 x9 x60 | {'task': 'union', 'seq': [['x6', 'x36', 'x16', 'x7', 'x24', 'x13', 'x29', 'x50', 'x51', 'x3', 'x13', 'x58', 'x22', 'x55', 'x54', 'x35'], ['x59', 'x64', 'x5', 'x45', 'x19', 'x17', 'x40', 'x33', 'x30', 'x9', 'x16', 'x50', 'x55', 'x7', 'x60', 'x17']], 'k': 4, 'n': 32, '_time': 0.0002808570861816406, '_task': 'basic_proced... | union | instruct | 0 |
Delete the first occurrence of TARGET from SEQUENCE. If TARGET is absent, return SEQUENCE unchanged.
(SEQUENCE)
x30 x18 x53 x34 x12 x34 x54 x6 x8 x14 x28 x52 x57 x14 x46 x17 x3 x17 x56 x52 x7 x47 x48 x20 x44 x38 x22 x47 x47 x4 x26 x54
(TARGET)
x17 | x30 x18 x53 x34 x12 x34 x54 x6 x8 x14 x28 x52 x57 x14 x46 x3 x17 x56 x52 x7 x47 x48 x20 x44 x38 x22 x47 x47 x4 x26 x54 | {'task': 'delete', 'seq': [['x30', 'x18', 'x53', 'x34', 'x12', 'x34', 'x54', 'x6', 'x8', 'x14', 'x28', 'x52', 'x57', 'x14', 'x46', 'x17', 'x3', 'x17', 'x56', 'x52', 'x7', 'x47', 'x48', 'x20', 'x44', 'x38', 'x22', 'x47', 'x47', 'x4', 'x26', 'x54'], 'x17'], 'k': 4, 'n': 32, '_time': 0.0004372596740722656, '_task': 'basic... | delete | instruct | 0 |
Return the ordered union of the two sequences: keep each token the first time it appears while scanning A then B.
(A)
x39 x21 x2 x25 x18 x30 x6 x55 x34 x22 x15 x4 x55 x20 x4 x63
(B)
x9 x35 x2 x25 x37 x50 x49 x36 x42 x22 x34 x3 x16 x6 x44 x19 | x39 x21 x2 x25 x18 x30 x6 x55 x34 x22 x15 x4 x20 x63 x9 x35 x37 x50 x49 x36 x42 x3 x16 x44 x19 | {'task': 'union', 'seq': [['x39', 'x21', 'x2', 'x25', 'x18', 'x30', 'x6', 'x55', 'x34', 'x22', 'x15', 'x4', 'x55', 'x20', 'x4', 'x63'], ['x9', 'x35', 'x2', 'x25', 'x37', 'x50', 'x49', 'x36', 'x42', 'x22', 'x34', 'x3', 'x16', 'x6', 'x44', 'x19']], 'k': 4, 'n': 32, '_time': 0.0003082752227783203, '_task': 'basic_procedur... | union | instruct | 0 |
Return the unique elements of the sequence in order of first appearance.
(SEQUENCE)
x10 x10 x45 x61 x22 x54 x58 x5 x48 x31 x49 x52 x31 x26 x14 x24 x62 x54 x10 x39 x17 x37 x35 x63 x4 x34 x27 x19 x36 x11 x37 x26 | x10 x45 x61 x22 x54 x58 x5 x48 x31 x49 x52 x26 x14 x24 x62 x39 x17 x37 x35 x63 x4 x34 x27 x19 x36 x11 | {'task': 'set', 'seq': ['x10', 'x10', 'x45', 'x61', 'x22', 'x54', 'x58', 'x5', 'x48', 'x31', 'x49', 'x52', 'x31', 'x26', 'x14', 'x24', 'x62', 'x54', 'x10', 'x39', 'x17', 'x37', 'x35', 'x63', 'x4', 'x34', 'x27', 'x19', 'x36', 'x11', 'x37', 'x26'], 'k': 4, 'n': 32, '_time': 0.0002505779266357422, '_task': 'basic_procedur... | set | instruct | 0 |
Return the unique elements of the sequence in order of first appearance.
(SEQUENCE)
x52 x37 x11 x14 x3 x26 x41 x58 x64 x27 x61 x33 x42 x52 x10 x30 x13 x4 x11 x22 x20 x28 x57 x43 x23 x28 x29 x50 x56 x25 x17 x36 | x52 x37 x11 x14 x3 x26 x41 x58 x64 x27 x61 x33 x42 x10 x30 x13 x4 x22 x20 x28 x57 x43 x23 x29 x50 x56 x25 x17 x36 | {'task': 'set', 'seq': ['x52', 'x37', 'x11', 'x14', 'x3', 'x26', 'x41', 'x58', 'x64', 'x27', 'x61', 'x33', 'x42', 'x52', 'x10', 'x30', 'x13', 'x4', 'x11', 'x22', 'x20', 'x28', 'x57', 'x43', 'x23', 'x28', 'x29', 'x50', 'x56', 'x25', 'x17', 'x36'], 'k': 4, 'n': 32, '_time': 0.0004253387451171875, '_task': 'basic_procedur... | set | instruct | 0 |
Copy the sequence exactly.
(SEQUENCE)
x8 x34 x16 x30 x48 x19 x3 x2 x46 x24 x7 x7 x20 x46 x54 x38 x19 x47 x44 x62 x28 x45 x28 x13 x21 x48 x21 x13 x48 x25 x13 x48 | x8 x34 x16 x30 x48 x19 x3 x2 x46 x24 x7 x7 x20 x46 x54 x38 x19 x47 x44 x62 x28 x45 x28 x13 x21 x48 x21 x13 x48 x25 x13 x48 | {'task': 'identity', 'seq': ['x8', 'x34', 'x16', 'x30', 'x48', 'x19', 'x3', 'x2', 'x46', 'x24', 'x7', 'x7', 'x20', 'x46', 'x54', 'x38', 'x19', 'x47', 'x44', 'x62', 'x28', 'x45', 'x28', 'x13', 'x21', 'x48', 'x21', 'x13', 'x48', 'x25', 'x13', 'x48'], 'k': 4, 'n': 32, '_time': 0.0004105567932128906, '_task': 'basic_proced... | identity | instruct | 0 |
Return the unique elements of the sequence in order of first appearance.
(SEQUENCE)
x47 x29 x3 x42 x13 x61 x62 x59 x5 x61 x21 x49 x27 x34 x27 x32 x36 x14 x31 x22 x8 x63 x62 x12 x45 x16 x60 x25 x12 x9 x32 x37 | x47 x29 x3 x42 x13 x61 x62 x59 x5 x21 x49 x27 x34 x32 x36 x14 x31 x22 x8 x63 x12 x45 x16 x60 x25 x9 x37 | {'task': 'set', 'seq': ['x47', 'x29', 'x3', 'x42', 'x13', 'x61', 'x62', 'x59', 'x5', 'x61', 'x21', 'x49', 'x27', 'x34', 'x27', 'x32', 'x36', 'x14', 'x31', 'x22', 'x8', 'x63', 'x62', 'x12', 'x45', 'x16', 'x60', 'x25', 'x12', 'x9', 'x32', 'x37'], 'k': 4, 'n': 32, '_time': 0.0002906322479248047, '_task': 'basic_procedural... | set | instruct | 0 |
Reverse the sequence.
(SEQUENCE)
x56 x3 x9 x36 x5 x8 x55 x45 x40 x13 x33 x61 x28 x54 x25 x56 x58 x8 x30 x61 x8 x60 x37 x60 x9 x24 x36 x44 x27 x51 x53 x22 | x22 x53 x51 x27 x44 x36 x24 x9 x60 x37 x60 x8 x61 x30 x8 x58 x56 x25 x54 x28 x61 x33 x13 x40 x45 x55 x8 x5 x36 x9 x3 x56 | {'task': 'reverse', 'seq': ['x56', 'x3', 'x9', 'x36', 'x5', 'x8', 'x55', 'x45', 'x40', 'x13', 'x33', 'x61', 'x28', 'x54', 'x25', 'x56', 'x58', 'x8', 'x30', 'x61', 'x8', 'x60', 'x37', 'x60', 'x9', 'x24', 'x36', 'x44', 'x27', 'x51', 'x53', 'x22'], 'k': 4, 'n': 32, '_time': 0.00024199485778808594, '_task': 'basic_procedur... | reverse | instruct | 0 |
Copy the sequence exactly.
(SEQUENCE)
x38 x20 x40 x17 x60 x20 x23 x19 x13 x3 x60 x3 x50 x54 x1 x49 x33 x40 x29 x32 x18 x32 x51 x10 x26 x10 x10 x16 x36 x9 x33 x14 | x38 x20 x40 x17 x60 x20 x23 x19 x13 x3 x60 x3 x50 x54 x1 x49 x33 x40 x29 x32 x18 x32 x51 x10 x26 x10 x10 x16 x36 x9 x33 x14 | {'task': 'identity', 'seq': ['x38', 'x20', 'x40', 'x17', 'x60', 'x20', 'x23', 'x19', 'x13', 'x3', 'x60', 'x3', 'x50', 'x54', 'x1', 'x49', 'x33', 'x40', 'x29', 'x32', 'x18', 'x32', 'x51', 'x10', 'x26', 'x10', 'x10', 'x16', 'x36', 'x9', 'x33', 'x14'], 'k': 4, 'n': 32, '_time': 0.0002827644348144531, '_task': 'basic_proce... | identity | instruct | 0 |
Reverse the sequence.
(SEQUENCE)
x13 x48 x30 x60 x34 x28 x50 x10 x39 x42 x37 x46 x46 x55 x21 x7 x19 x37 x8 x53 x41 x40 x43 x56 x47 x42 x22 x50 x20 x50 x42 x52 | x52 x42 x50 x20 x50 x22 x42 x47 x56 x43 x40 x41 x53 x8 x37 x19 x7 x21 x55 x46 x46 x37 x42 x39 x10 x50 x28 x34 x60 x30 x48 x13 | {'task': 'reverse', 'seq': ['x13', 'x48', 'x30', 'x60', 'x34', 'x28', 'x50', 'x10', 'x39', 'x42', 'x37', 'x46', 'x46', 'x55', 'x21', 'x7', 'x19', 'x37', 'x8', 'x53', 'x41', 'x40', 'x43', 'x56', 'x47', 'x42', 'x22', 'x50', 'x20', 'x50', 'x42', 'x52'], 'k': 4, 'n': 32, '_time': 0.00041413307189941406, '_task': 'basic_pro... | 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. | o0 c0 o1 c1 o1 c1 o0 c0 o0 c0 o0 o3 o2 o1 o0 c0 c1 c0 o3 o2 o0 o2 o2 c3 o2 c2 c2 c3 c2 c0 c2 c2 | {'task': 'dyck_shuffle', 'seq': [], 'k': 4, 'n': 32, '_time': 0.00045013427734375, '_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': 6... | dyck_shuffle | instruct | 0 |
Sort the sequence in ascending numeric order, where x2 < x10.
(SEQUENCE)
x40 x47 x41 x37 x9 x5 x44 x12 x38 x18 x27 x21 x52 x25 x18 x42 x15 x23 x47 x60 x27 x1 x30 x5 x35 x59 x14 x9 x44 x19 x52 x19 | x1 x5 x5 x9 x9 x12 x14 x15 x18 x18 x19 x19 x21 x23 x25 x27 x27 x30 x35 x37 x38 x40 x41 x42 x44 x44 x47 x47 x52 x52 x59 x60 | {'task': 'sort', 'seq': ['x40', 'x47', 'x41', 'x37', 'x9', 'x5', 'x44', 'x12', 'x38', 'x18', 'x27', 'x21', 'x52', 'x25', 'x18', 'x42', 'x15', 'x23', 'x47', 'x60', 'x27', 'x1', 'x30', 'x5', 'x35', 'x59', 'x14', 'x9', 'x44', 'x19', 'x52', 'x19'], 'k': 4, 'n': 32, '_time': 0.00038552284240722656, '_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)
x47 x36 x40 x8 x23 x5 x47 x16 x2 x54 x50 x47 x60 x13 x52 x28
(B)
x19 x47 x61 x34 x6 x2 x44 x60 x7 x20 x48 x20 x15 x2 x22 x31 | x47 x36 x40 x8 x23 x5 x16 x2 x54 x50 x60 x13 x52 x28 x19 x61 x34 x6 x44 x7 x20 x48 x15 x22 x31 | {'task': 'union', 'seq': [['x47', 'x36', 'x40', 'x8', 'x23', 'x5', 'x47', 'x16', 'x2', 'x54', 'x50', 'x47', 'x60', 'x13', 'x52', 'x28'], ['x19', 'x47', 'x61', 'x34', 'x6', 'x2', 'x44', 'x60', 'x7', 'x20', 'x48', 'x20', 'x15', 'x2', 'x22', 'x31']], 'k': 4, 'n': 32, '_time': 0.0004115104675292969, '_task': 'basic_procedu... | union | instruct | 0 |
Copy the sequence exactly.
(SEQUENCE)
x4 x59 x59 x21 x24 x18 x28 x34 x61 x46 x62 x57 x24 x61 x61 x54 x51 x19 x37 x50 x27 x43 x22 x62 x61 x44 x31 x29 x29 x16 x38 x27 | x4 x59 x59 x21 x24 x18 x28 x34 x61 x46 x62 x57 x24 x61 x61 x54 x51 x19 x37 x50 x27 x43 x22 x62 x61 x44 x31 x29 x29 x16 x38 x27 | {'task': 'identity', 'seq': ['x4', 'x59', 'x59', 'x21', 'x24', 'x18', 'x28', 'x34', 'x61', 'x46', 'x62', 'x57', 'x24', 'x61', 'x61', 'x54', 'x51', 'x19', 'x37', 'x50', 'x27', 'x43', 'x22', 'x62', 'x61', 'x44', 'x31', 'x29', 'x29', 'x16', 'x38', 'x27'], 'k': 4, 'n': 32, '_time': 0.0004107952117919922, '_task': 'basic_pr... | identity | instruct | 0 |
Return the unique elements of the sequence in order of first appearance.
(SEQUENCE)
x43 x1 x14 x61 x53 x46 x32 x28 x13 x44 x41 x32 x37 x29 x48 x38 x58 x55 x52 x52 x23 x29 x33 x63 x27 x17 x4 x50 x32 x60 x62 x28 | x43 x1 x14 x61 x53 x46 x32 x28 x13 x44 x41 x37 x29 x48 x38 x58 x55 x52 x23 x33 x63 x27 x17 x4 x50 x60 x62 | {'task': 'set', 'seq': ['x43', 'x1', 'x14', 'x61', 'x53', 'x46', 'x32', 'x28', 'x13', 'x44', 'x41', 'x32', 'x37', 'x29', 'x48', 'x38', 'x58', 'x55', 'x52', 'x52', 'x23', 'x29', 'x33', 'x63', 'x27', 'x17', 'x4', 'x50', 'x32', 'x60', 'x62', 'x28'], 'k': 4, 'n': 32, '_time': 0.0004239082336425781, '_task': 'basic_procedur... | set | instruct | 0 |
Sort the sequence in ascending numeric order, where x2 < x10.
(SEQUENCE)
x3 x55 x30 x58 x61 x60 x21 x43 x35 x14 x37 x14 x1 x57 x52 x4 x59 x57 x12 x37 x46 x58 x6 x41 x32 x37 x25 x61 x27 x52 x47 x51 | x1 x3 x4 x6 x12 x14 x14 x21 x25 x27 x30 x32 x35 x37 x37 x37 x41 x43 x46 x47 x51 x52 x52 x55 x57 x57 x58 x58 x59 x60 x61 x61 | {'task': 'sort', 'seq': ['x3', 'x55', 'x30', 'x58', 'x61', 'x60', 'x21', 'x43', 'x35', 'x14', 'x37', 'x14', 'x1', 'x57', 'x52', 'x4', 'x59', 'x57', 'x12', 'x37', 'x46', 'x58', 'x6', 'x41', 'x32', 'x37', 'x25', 'x61', 'x27', 'x52', 'x47', 'x51'], 'k': 4, 'n': 32, '_time': 0.00040149688720703125, '_task': 'basic_procedur... | sort | instruct | 0 |
Return the unique elements of the sequence in order of first appearance.
(SEQUENCE)
x38 x40 x23 x52 x6 x1 x5 x56 x8 x30 x17 x20 x28 x47 x45 x53 x2 x40 x51 x17 x55 x61 x44 x28 x49 x51 x18 x21 x13 x4 x62 x51 | x38 x40 x23 x52 x6 x1 x5 x56 x8 x30 x17 x20 x28 x47 x45 x53 x2 x51 x55 x61 x44 x49 x18 x21 x13 x4 x62 | {'task': 'set', 'seq': ['x38', 'x40', 'x23', 'x52', 'x6', 'x1', 'x5', 'x56', 'x8', 'x30', 'x17', 'x20', 'x28', 'x47', 'x45', 'x53', 'x2', 'x40', 'x51', 'x17', 'x55', 'x61', 'x44', 'x28', 'x49', 'x51', 'x18', 'x21', 'x13', 'x4', 'x62', 'x51'], 'k': 4, 'n': 32, '_time': 0.0003724098205566406, '_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)
x34 x20 x60 x34 x40 x17 x25 x34 x52 x42 x18 x4 x54 x4 x47 x39
(B)
x46 x50 x31 x11 x49 x9 x17 x56 x9 x57 x17 x2 x47 x12 x7 x1 | x34 x20 x60 x40 x17 x25 x52 x42 x18 x4 x54 x47 x39 x46 x50 x31 x11 x49 x9 x56 x57 x2 x12 x7 x1 | {'task': 'union', 'seq': [['x34', 'x20', 'x60', 'x34', 'x40', 'x17', 'x25', 'x34', 'x52', 'x42', 'x18', 'x4', 'x54', 'x4', 'x47', 'x39'], ['x46', 'x50', 'x31', 'x11', 'x49', 'x9', 'x17', 'x56', 'x9', 'x57', 'x17', 'x2', 'x47', 'x12', 'x7', 'x1']], 'k': 4, 'n': 32, '_time': 0.0003635883331298828, '_task': 'basic_procedu... | union | instruct | 0 |
Execute the stack operations. PUSH x pushes x. POP removes the top item. Return the final stack from top to bottom, or EMPTY if the stack is empty.
(OPERATIONS)
PUSH x5; PUSH x29; POP; PUSH x64; POP; PUSH x56; PUSH x60; POP; POP; PUSH x56; PUSH x52; PUSH x6; PUSH x47; POP; PUSH x57; POP; PUSH x21; PUSH x61; PUSH x3; PU... | EMPTY | {'task': 'stack', 'seq': ['PUSH x5', 'PUSH x29', 'POP', 'PUSH x64', 'POP', 'PUSH x56', 'PUSH x60', 'POP', 'POP', 'PUSH x56', 'PUSH x52', 'PUSH x6', 'PUSH x47', 'POP', 'PUSH x57', 'POP', 'PUSH x21', 'PUSH x61', 'PUSH x3', 'PUSH x11', 'PUSH x33', 'PUSH x5', 'POP', 'POP', 'POP', 'POP', 'POP', 'POP', 'POP', 'POP', 'POP', '... | 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)
x24 x29 x40 x24 x64 x9 x39 x7 x36 x9 x30 x50 x5 x45 x35 x34
(B)
x49 x32 x52 x10 x43 x52 x61 x49 x20 x17 x64 x63 x27 x62 x58 x57 | x24 x29 x40 x64 x9 x39 x7 x36 x30 x50 x5 x45 x35 x34 x49 x32 x52 x10 x43 x61 x20 x17 x63 x27 x62 x58 x57 | {'task': 'union', 'seq': [['x24', 'x29', 'x40', 'x24', 'x64', 'x9', 'x39', 'x7', 'x36', 'x9', 'x30', 'x50', 'x5', 'x45', 'x35', 'x34'], ['x49', 'x32', 'x52', 'x10', 'x43', 'x52', 'x61', 'x49', 'x20', 'x17', 'x64', 'x63', 'x27', 'x62', 'x58', 'x57']], 'k': 4, 'n': 32, '_time': 0.00045108795166015625, '_task': 'basic_pro... | union | instruct | 0 |
Delete the first occurrence of TARGET from SEQUENCE. If TARGET is absent, return SEQUENCE unchanged.
(SEQUENCE)
x3 x14 x39 x47 x35 x41 x1 x59 x48 x19 x36 x34 x5 x15 x56 x13 x11 x52 x39 x43 x44 x54 x35 x11 x17 x46 x61 x16 x19 x10 x47 x34
(TARGET)
x17 | x3 x14 x39 x47 x35 x41 x1 x59 x48 x19 x36 x34 x5 x15 x56 x13 x11 x52 x39 x43 x44 x54 x35 x11 x46 x61 x16 x19 x10 x47 x34 | {'task': 'delete', 'seq': [['x3', 'x14', 'x39', 'x47', 'x35', 'x41', 'x1', 'x59', 'x48', 'x19', 'x36', 'x34', 'x5', 'x15', 'x56', 'x13', 'x11', 'x52', 'x39', 'x43', 'x44', 'x54', 'x35', 'x11', 'x17', 'x46', 'x61', 'x16', 'x19', 'x10', 'x47', 'x34'], 'x17'], 'k': 4, 'n': 32, '_time': 0.0004010200500488281, '_task': 'bas... | delete | instruct | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.