prompt
stringlengths
144
465
answer
stringlengths
5
127
metadata
stringlengths
308
686
task
stringclasses
9 values
mode
stringclasses
1 value
level
int64
0
0
Generate one valid Dyck-4 balanced-bracket sequence of exactly 32 tokens. Use tokens o0..ok for opens and c0..ck for matching closes. Return only the sequence.
o1 o3 o3 c3 c3 c1 o3 c3 o3 o1 c1 o3 o0 c0 c3 o3 o0 o0 o2 c2 o3 o1 o0 c0 o1 c1 c1 c3 c0 c0 c3 c3
{'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0002543926239013672, '_task': 'basic_procedural', '_level': 0, '_config': {'c': 1.0, 'level': 0, 'seed': None, 'size': None, 'task': 'mixed', 'seq_len': 32, 'vocab_size': 64, 'k': 4, 'p_open': 0.49, 'max_depth': 16}, '_prompt_tokens': 39, '_answer_tokens': 64}
dyck
instruct
0
Generate one valid Dyck-4 balanced-bracket sequence of exactly 32 tokens. Use tokens o0..ok for opens and c0..ck for matching closes. Return only the sequence.
o1 c1 o3 c3 o1 c1 o2 o1 o0 c0 o1 o1 o2 o3 o0 c0 c3 c2 c1 o2 c2 c1 o1 c1 c1 c2 o2 o0 c0 c2 o3 c3
{'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.00038433074951171875, '_task': 'basic_procedural', '_level': 0, '_config': {'c': 1.0, 'level': 0, 'seed': None, 'size': None, 'task': 'mixed', 'seq_len': 32, 'vocab_size': 64, 'k': 4, 'p_open': 0.49, 'max_depth': 16}, '_prompt_tokens': 39, '_answer_tokens': 64}
dyck
instruct
0
Return the unique elements of the sequence in order of first appearance. (SEQUENCE) x56 x60 x4 x53 x54 x22 x2 x21 x58 x23 x28 x52 x28 x1 x45 x49 x54 x30 x36 x21 x10 x11 x46 x25 x16 x63 x1 x8 x60 x22 x54 x4
x56 x60 x4 x53 x54 x22 x2 x21 x58 x23 x28 x52 x1 x45 x49 x30 x36 x10 x11 x46 x25 x16 x63 x8
{'task': 'set', 'seq': ['x56', 'x60', 'x4', 'x53', 'x54', 'x22', 'x2', 'x21', 'x58', 'x23', 'x28', 'x52', 'x28', 'x1', 'x45', 'x49', 'x54', 'x30', 'x36', 'x21', 'x10', 'x11', 'x46', 'x25', 'x16', 'x63', 'x1', 'x8', 'x60', 'x22', 'x54', 'x4'], 'k': 4, 'n': 32, '_time': 0.0002808570861816406, '_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) x43 x14 x60 x9 x51 x6 x42 x60 x61 x24 x12 x16 x59 x61 x42 x30 (B) x33 x39 x8 x1 x42 x24 x63 x2 x20 x61 x26 x6 x56 x14 x62 x64
x43 x14 x60 x9 x51 x6 x42 x61 x24 x12 x16 x59 x30 x33 x39 x8 x1 x63 x2 x20 x26 x56 x62 x64
{'task': 'union', 'seq': [['x43', 'x14', 'x60', 'x9', 'x51', 'x6', 'x42', 'x60', 'x61', 'x24', 'x12', 'x16', 'x59', 'x61', 'x42', 'x30'], ['x33', 'x39', 'x8', 'x1', 'x42', 'x24', 'x63', 'x2', 'x20', 'x61', 'x26', 'x6', 'x56', 'x14', 'x62', 'x64']], 'k': 4, 'n': 32, '_time': 0.0004458427429199219, '_task': 'basic_proced...
union
instruct
0
Return the ordered union of the two sequences: keep each token the first time it appears while scanning A then B. (A) x29 x5 x34 x21 x30 x37 x51 x3 x54 x22 x4 x37 x44 x51 x7 x21 (B) x10 x33 x44 x13 x44 x2 x57 x57 x57 x2 x3 x3 x5 x31 x12 x22
x29 x5 x34 x21 x30 x37 x51 x3 x54 x22 x4 x44 x7 x10 x33 x13 x2 x57 x31 x12
{'task': 'union', 'seq': [['x29', 'x5', 'x34', 'x21', 'x30', 'x37', 'x51', 'x3', 'x54', 'x22', 'x4', 'x37', 'x44', 'x51', 'x7', 'x21'], ['x10', 'x33', 'x44', 'x13', 'x44', 'x2', 'x57', 'x57', 'x57', 'x2', 'x3', 'x3', 'x5', 'x31', 'x12', 'x22']], 'k': 4, 'n': 32, '_time': 0.000293731689453125, '_task': 'basic_procedural...
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 o0 c0 c2 o3 c3 o1 c1 o3 c3 o2 c2 o1 o0 c0 c1 o3 o3 c3 c3 o0 c0 o3 o0 c0 o1 o0 c0 o3 c3 c1 c3
{'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.00025463104248046875, '_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 x43; POP; PUSH x35; POP; PUSH x48; PUSH x30; PUSH x62; POP; PUSH x34; PUSH x5; PUSH x23; PUSH x60; PUSH x34; PUSH x17; PUSH x50; POP; PUSH x48; POP; POP; ...
EMPTY
{'task': 'stack', 'seq': ['PUSH x43', 'POP', 'PUSH x35', 'POP', 'PUSH x48', 'PUSH x30', 'PUSH x62', 'POP', 'PUSH x34', 'PUSH x5', 'PUSH x23', 'PUSH x60', 'PUSH x34', 'PUSH x17', 'PUSH x50', 'POP', 'PUSH x48', 'POP', 'POP', 'POP', 'PUSH x4', 'PUSH x58', 'POP', 'POP', 'POP', 'POP', 'POP', 'POP', 'POP', 'POP', 'PUSH x41',...
stack
instruct
0
Sort the sequence in ascending numeric order, where x2 < x10. (SEQUENCE) x17 x3 x21 x43 x43 x34 x8 x52 x48 x35 x27 x10 x35 x26 x14 x9 x45 x3 x13 x36 x33 x44 x10 x39 x10 x60 x51 x56 x55 x24 x15 x19
x3 x3 x8 x9 x10 x10 x10 x13 x14 x15 x17 x19 x21 x24 x26 x27 x33 x34 x35 x35 x36 x39 x43 x43 x44 x45 x48 x51 x52 x55 x56 x60
{'task': 'sort', 'seq': ['x17', 'x3', 'x21', 'x43', 'x43', 'x34', 'x8', 'x52', 'x48', 'x35', 'x27', 'x10', 'x35', 'x26', 'x14', 'x9', 'x45', 'x3', 'x13', 'x36', 'x33', 'x44', 'x10', 'x39', 'x10', 'x60', 'x51', 'x56', 'x55', 'x24', 'x15', 'x19'], 'k': 4, 'n': 32, '_time': 0.00026488304138183594, '_task': 'basic_procedur...
sort
instruct
0
Generate one valid shuffle-Dyck-4 sequence of exactly 32 tokens. Each close ci must match a previously opened oi of the same type, but closing order may be interleaved across types. Return only the sequence.
o0 o1 o1 o0 c0 o3 o0 c0 c1 o3 c3 c1 c3 c0 o1 c1 o0 c0 o3 c3 o3 c3 o1 c1 o2 c2 o0 o1 o3 c0 c1 c3
{'task': 'dyck_shuffle', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0002994537353515625, '_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) x25 x29 x25 x40 x55 x41 x1 x64 x10 x4 x36 x28 x47 x27 x34 x28 x27 x61 x56 x61 x56 x53 x20 x33 x64 x58 x18 x40 x62 x6 x26 x55
x25 x29 x25 x40 x55 x41 x1 x64 x10 x4 x36 x28 x47 x27 x34 x28 x27 x61 x56 x61 x56 x53 x20 x33 x64 x58 x18 x40 x62 x6 x26 x55
{'task': 'identity', 'seq': ['x25', 'x29', 'x25', 'x40', 'x55', 'x41', 'x1', 'x64', 'x10', 'x4', 'x36', 'x28', 'x47', 'x27', 'x34', 'x28', 'x27', 'x61', 'x56', 'x61', 'x56', 'x53', 'x20', 'x33', 'x64', 'x58', 'x18', 'x40', 'x62', 'x6', 'x26', 'x55'], 'k': 4, 'n': 32, '_time': 0.0004088878631591797, '_task': 'basic_proc...
identity
instruct
0
Sort the sequence in ascending numeric order, where x2 < x10. (SEQUENCE) x18 x3 x27 x9 x61 x52 x50 x17 x51 x58 x37 x8 x49 x9 x32 x34 x35 x32 x59 x12 x44 x28 x55 x57 x24 x18 x21 x52 x26 x30 x24 x4
x3 x4 x8 x9 x9 x12 x17 x18 x18 x21 x24 x24 x26 x27 x28 x30 x32 x32 x34 x35 x37 x44 x49 x50 x51 x52 x52 x55 x57 x58 x59 x61
{'task': 'sort', 'seq': ['x18', 'x3', 'x27', 'x9', 'x61', 'x52', 'x50', 'x17', 'x51', 'x58', 'x37', 'x8', 'x49', 'x9', 'x32', 'x34', 'x35', 'x32', 'x59', 'x12', 'x44', 'x28', 'x55', 'x57', 'x24', 'x18', 'x21', 'x52', 'x26', 'x30', 'x24', 'x4'], 'k': 4, 'n': 32, '_time': 0.0004131793975830078, '_task': 'basic_procedural...
sort
instruct
0
Return the unique elements of the sequence in order of first appearance. (SEQUENCE) x18 x55 x21 x26 x40 x36 x15 x46 x35 x50 x21 x6 x51 x23 x11 x33 x53 x21 x9 x43 x60 x27 x59 x46 x54 x61 x64 x51 x32 x32 x44 x33
x18 x55 x21 x26 x40 x36 x15 x46 x35 x50 x6 x51 x23 x11 x33 x53 x9 x43 x60 x27 x59 x54 x61 x64 x32 x44
{'task': 'set', 'seq': ['x18', 'x55', 'x21', 'x26', 'x40', 'x36', 'x15', 'x46', 'x35', 'x50', 'x21', 'x6', 'x51', 'x23', 'x11', 'x33', 'x53', 'x21', 'x9', 'x43', 'x60', 'x27', 'x59', 'x46', 'x54', 'x61', 'x64', 'x51', 'x32', 'x32', 'x44', 'x33'], 'k': 4, 'n': 32, '_time': 0.0002799034118652344, '_task': 'basic_procedur...
set
instruct
0
Generate one valid shuffle-Dyck-4 sequence of exactly 32 tokens. Each close ci must match a previously opened oi of the same type, but closing order may be interleaved across types. Return only the sequence.
o1 o3 c3 o0 c1 c0 o1 c1 o1 c1 o1 c1 o3 o3 c3 o2 c3 c2 o0 o1 o1 o0 c1 o1 c0 c1 c1 o3 o0 c3 c0 c0
{'task': 'dyck_shuffle', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0004508495330810547, '_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 x23; PUSH x23; POP; PUSH x50; PUSH x50; PUSH x8; PUSH x36; PUSH x10; PUSH x9; PUSH x48; POP; PUSH x54; PUSH x19; PUSH x10; PUSH x47; PUSH x11; POP; PUSH x...
x10 x36 x8 x50 x50 x23
{'task': 'stack', 'seq': ['PUSH x23', 'PUSH x23', 'POP', 'PUSH x50', 'PUSH x50', 'PUSH x8', 'PUSH x36', 'PUSH x10', 'PUSH x9', 'PUSH x48', 'POP', 'PUSH x54', 'PUSH x19', 'PUSH x10', 'PUSH x47', 'PUSH x11', 'POP', 'PUSH x40', 'PUSH x19', 'POP', 'PUSH x44', 'POP', 'POP', 'POP', 'POP', 'POP', 'PUSH x42', 'POP', 'PUSH x28'...
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 o2 c2 o1 o1 c1 o3 o3 c1 c3 c3 c3 o1 o2 o3 o3 o0 c3 o2 o1 o2 o0 c1 o2 c3 c0 c1 c2 c2 c0 c2 c2
{'task': 'dyck_shuffle', 'seq': [], 'k': 4, 'n': 32, '_time': 0.00044918060302734375, '_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) x57 x39 x15 x48 x40 x39 x30 x62 x32 x35 x50 x59 x44 x4 x51 x37 x10 x23 x38 x38 x49 x62 x48 x51 x36 x43 x38 x60 x31 x24 x6 x42
x42 x6 x24 x31 x60 x38 x43 x36 x51 x48 x62 x49 x38 x38 x23 x10 x37 x51 x4 x44 x59 x50 x35 x32 x62 x30 x39 x40 x48 x15 x39 x57
{'task': 'reverse', 'seq': ['x57', 'x39', 'x15', 'x48', 'x40', 'x39', 'x30', 'x62', 'x32', 'x35', 'x50', 'x59', 'x44', 'x4', 'x51', 'x37', 'x10', 'x23', 'x38', 'x38', 'x49', 'x62', 'x48', 'x51', 'x36', 'x43', 'x38', 'x60', 'x31', 'x24', 'x6', 'x42'], 'k': 4, 'n': 32, '_time': 0.000274658203125, '_task': 'basic_procedur...
reverse
instruct
0
Sort the sequence in ascending numeric order, where x2 < x10. (SEQUENCE) x28 x9 x39 x37 x23 x32 x20 x48 x23 x27 x55 x53 x36 x11 x40 x10 x62 x34 x15 x14 x20 x34 x16 x52 x21 x1 x20 x58 x58 x37 x15 x1
x1 x1 x9 x10 x11 x14 x15 x15 x16 x20 x20 x20 x21 x23 x23 x27 x28 x32 x34 x34 x36 x37 x37 x39 x40 x48 x52 x53 x55 x58 x58 x62
{'task': 'sort', 'seq': ['x28', 'x9', 'x39', 'x37', 'x23', 'x32', 'x20', 'x48', 'x23', 'x27', 'x55', 'x53', 'x36', 'x11', 'x40', 'x10', 'x62', 'x34', 'x15', 'x14', 'x20', 'x34', 'x16', 'x52', 'x21', 'x1', 'x20', 'x58', 'x58', 'x37', 'x15', 'x1'], 'k': 4, 'n': 32, '_time': 0.00029206275939941406, '_task': 'basic_procedu...
sort
instruct
0
Delete the first occurrence of TARGET from SEQUENCE. If TARGET is absent, return SEQUENCE unchanged. (SEQUENCE) x22 x55 x6 x46 x15 x57 x29 x9 x22 x55 x52 x27 x15 x21 x31 x28 x63 x5 x59 x56 x6 x48 x14 x32 x19 x42 x11 x37 x29 x40 x24 x15 (TARGET) x31
x22 x55 x6 x46 x15 x57 x29 x9 x22 x55 x52 x27 x15 x21 x28 x63 x5 x59 x56 x6 x48 x14 x32 x19 x42 x11 x37 x29 x40 x24 x15
{'task': 'delete', 'seq': [['x22', 'x55', 'x6', 'x46', 'x15', 'x57', 'x29', 'x9', 'x22', 'x55', 'x52', 'x27', 'x15', 'x21', 'x31', 'x28', 'x63', 'x5', 'x59', 'x56', 'x6', 'x48', 'x14', 'x32', 'x19', 'x42', 'x11', 'x37', 'x29', 'x40', 'x24', 'x15'], 'x31'], 'k': 4, 'n': 32, '_time': 0.00025963783264160156, '_task': 'bas...
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.
o0 o3 c3 c0 o3 o1 c1 o1 c1 c3 o0 o0 c0 o1 o3 c3 c1 c0 o1 o2 o1 o0 o0 o2 o2 c2 c2 c0 c0 c1 c2 c1
{'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.00038623809814453125, '_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) x39 x48 x55 x59 x6 x27 x46 x18 x7 x3 x7 x38 x36 x47 x32 x24 x36 x20 x9 x9 x24 x34 x38 x58 x30 x21 x52 x38 x13 x19 x42 x60
x39 x48 x55 x59 x6 x27 x46 x18 x7 x3 x7 x38 x36 x47 x32 x24 x36 x20 x9 x9 x24 x34 x38 x58 x30 x21 x52 x38 x13 x19 x42 x60
{'task': 'identity', 'seq': ['x39', 'x48', 'x55', 'x59', 'x6', 'x27', 'x46', 'x18', 'x7', 'x3', 'x7', 'x38', 'x36', 'x47', 'x32', 'x24', 'x36', 'x20', 'x9', 'x9', 'x24', 'x34', 'x38', 'x58', 'x30', 'x21', 'x52', 'x38', 'x13', 'x19', 'x42', 'x60'], 'k': 4, 'n': 32, '_time': 0.000274658203125, '_task': 'basic_procedural'...
identity
instruct
0
Return the unique elements of the sequence in order of first appearance. (SEQUENCE) x35 x7 x17 x24 x62 x33 x5 x11 x31 x4 x39 x62 x52 x20 x35 x34 x30 x1 x42 x20 x9 x23 x15 x17 x49 x45 x26 x30 x9 x18 x30 x57
x35 x7 x17 x24 x62 x33 x5 x11 x31 x4 x39 x52 x20 x34 x30 x1 x42 x9 x23 x15 x49 x45 x26 x18 x57
{'task': 'set', 'seq': ['x35', 'x7', 'x17', 'x24', 'x62', 'x33', 'x5', 'x11', 'x31', 'x4', 'x39', 'x62', 'x52', 'x20', 'x35', 'x34', 'x30', 'x1', 'x42', 'x20', 'x9', 'x23', 'x15', 'x17', 'x49', 'x45', 'x26', 'x30', 'x9', 'x18', 'x30', 'x57'], 'k': 4, 'n': 32, '_time': 0.00027942657470703125, '_task': 'basic_procedural'...
set
instruct
0
Delete the first occurrence of TARGET from SEQUENCE. If TARGET is absent, return SEQUENCE unchanged. (SEQUENCE) x44 x61 x19 x17 x4 x62 x52 x2 x25 x44 x59 x29 x5 x52 x6 x54 x26 x64 x1 x47 x59 x18 x11 x64 x21 x37 x46 x27 x22 x52 x38 x1 (TARGET) x12
x44 x61 x19 x17 x4 x62 x52 x2 x25 x44 x59 x29 x5 x52 x6 x54 x26 x64 x1 x47 x59 x18 x11 x64 x21 x37 x46 x27 x22 x52 x38 x1
{'task': 'delete', 'seq': [['x44', 'x61', 'x19', 'x17', 'x4', 'x62', 'x52', 'x2', 'x25', 'x44', 'x59', 'x29', 'x5', 'x52', 'x6', 'x54', 'x26', 'x64', 'x1', 'x47', 'x59', 'x18', 'x11', 'x64', 'x21', 'x37', 'x46', 'x27', 'x22', 'x52', 'x38', 'x1'], 'x12'], 'k': 4, 'n': 32, '_time': 0.0002760887145996094, '_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) x50 x25 x34 x44 x37 x52 x24 x56 x57 x52 x56 x42 x46 x47 x4 x15 (B) x44 x31 x19 x52 x28 x60 x37 x50 x24 x19 x9 x55 x32 x13 x1 x34
x50 x25 x34 x44 x37 x52 x24 x56 x57 x42 x46 x47 x4 x15 x31 x19 x28 x60 x9 x55 x32 x13 x1
{'task': 'union', 'seq': [['x50', 'x25', 'x34', 'x44', 'x37', 'x52', 'x24', 'x56', 'x57', 'x52', 'x56', 'x42', 'x46', 'x47', 'x4', 'x15'], ['x44', 'x31', 'x19', 'x52', 'x28', 'x60', 'x37', 'x50', 'x24', 'x19', 'x9', 'x55', 'x32', 'x13', 'x1', 'x34']], 'k': 4, 'n': 32, '_time': 0.0002968311309814453, '_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 x33; PUSH x21; PUSH x6; PUSH x25; PUSH x46; PUSH x42; POP; POP; PUSH x47; PUSH x27; PUSH x4; PUSH x7; PUSH x26; PUSH x19; PUSH x38; POP; PUSH x19; PUSH x4...
x7 x4 x27 x47 x25 x6 x21 x33
{'task': 'stack', 'seq': ['PUSH x33', 'PUSH x21', 'PUSH x6', 'PUSH x25', 'PUSH x46', 'PUSH x42', 'POP', 'POP', 'PUSH x47', 'PUSH x27', 'PUSH x4', 'PUSH x7', 'PUSH x26', 'PUSH x19', 'PUSH x38', 'POP', 'PUSH x19', 'PUSH x49', 'PUSH x55', 'PUSH x10', 'PUSH x42', 'POP', 'POP', 'POP', 'PUSH x28', 'POP', 'POP', 'POP', 'PUSH ...
stack
instruct
0
Generate one valid Dyck-4 balanced-bracket sequence of exactly 32 tokens. Use tokens o0..ok for opens and c0..ck for matching closes. Return only the sequence.
o3 o0 o0 o2 c2 o2 o3 c3 o1 o1 c1 o1 c1 o0 o0 o3 c3 c0 c0 o2 c2 o0 o1 o2 c2 c1 c0 c1 c2 c0 c0 c3
{'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0003845691680908203, '_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) x6 x62 x61 x42 x22 x20 x59 x12 x6 x31 x18 x55 x31 x9 x45 x5 x49 x63 x40 x16 x42 x20 x61 x29 x36 x11 x1 x62 x22 x5 x31 x59
x6 x62 x61 x42 x22 x20 x59 x12 x31 x18 x55 x9 x45 x5 x49 x63 x40 x16 x29 x36 x11 x1
{'task': 'set', 'seq': ['x6', 'x62', 'x61', 'x42', 'x22', 'x20', 'x59', 'x12', 'x6', 'x31', 'x18', 'x55', 'x31', 'x9', 'x45', 'x5', 'x49', 'x63', 'x40', 'x16', 'x42', 'x20', 'x61', 'x29', 'x36', 'x11', 'x1', 'x62', 'x22', 'x5', 'x31', 'x59'], 'k': 4, 'n': 32, '_time': 0.0002777576446533203, '_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.
o1 c1 o2 o0 o1 o1 o0 c0 c1 o1 o2 o0 c0 c2 c1 c1 o0 c0 o2 c2 o2 c2 c0 c2 o0 o2 c2 o2 c2 c0 o2 c2
{'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0002548694610595703, '_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) x14 x47 x59 x51 x40 x63 x2 x9 x42 x40 x2 x10 x17 x25 x45 x8 (B) x24 x41 x42 x12 x57 x54 x34 x12 x62 x58 x55 x5 x42 x16 x25 x24
x14 x47 x59 x51 x40 x63 x2 x9 x42 x10 x17 x25 x45 x8 x24 x41 x12 x57 x54 x34 x62 x58 x55 x5 x16
{'task': 'union', 'seq': [['x14', 'x47', 'x59', 'x51', 'x40', 'x63', 'x2', 'x9', 'x42', 'x40', 'x2', 'x10', 'x17', 'x25', 'x45', 'x8'], ['x24', 'x41', 'x42', 'x12', 'x57', 'x54', 'x34', 'x12', 'x62', 'x58', 'x55', 'x5', 'x42', 'x16', 'x25', 'x24']], 'k': 4, 'n': 32, '_time': 0.00030493736267089844, '_task': 'basic_proc...
union
instruct
0
Sort the sequence in ascending numeric order, where x2 < x10. (SEQUENCE) x55 x48 x25 x12 x64 x46 x20 x28 x49 x24 x46 x1 x33 x40 x4 x52 x42 x39 x57 x29 x33 x17 x62 x3 x36 x17 x28 x3 x4 x31 x40 x52
x1 x3 x3 x4 x4 x12 x17 x17 x20 x24 x25 x28 x28 x29 x31 x33 x33 x36 x39 x40 x40 x42 x46 x46 x48 x49 x52 x52 x55 x57 x62 x64
{'task': 'sort', 'seq': ['x55', 'x48', 'x25', 'x12', 'x64', 'x46', 'x20', 'x28', 'x49', 'x24', 'x46', 'x1', 'x33', 'x40', 'x4', 'x52', 'x42', 'x39', 'x57', 'x29', 'x33', 'x17', 'x62', 'x3', 'x36', 'x17', 'x28', 'x3', 'x4', 'x31', 'x40', 'x52'], 'k': 4, 'n': 32, '_time': 0.0004374980926513672, '_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) x50 x64 x42 x44 x31 x15 x32 x6 x10 x21 x48 x25 x30 x49 x34 x18 (B) x2 x52 x14 x12 x56 x30 x31 x18 x45 x28 x30 x37 x21 x30 x19 x22
x50 x64 x42 x44 x31 x15 x32 x6 x10 x21 x48 x25 x30 x49 x34 x18 x2 x52 x14 x12 x56 x45 x28 x37 x19 x22
{'task': 'union', 'seq': [['x50', 'x64', 'x42', 'x44', 'x31', 'x15', 'x32', 'x6', 'x10', 'x21', 'x48', 'x25', 'x30', 'x49', 'x34', 'x18'], ['x2', 'x52', 'x14', 'x12', 'x56', 'x30', 'x31', 'x18', 'x45', 'x28', 'x30', 'x37', 'x21', 'x30', 'x19', 'x22']], 'k': 4, 'n': 32, '_time': 0.0004546642303466797, '_task': 'basic_pr...
union
instruct
0
Copy the sequence exactly. (SEQUENCE) x33 x63 x13 x47 x49 x14 x58 x16 x47 x28 x25 x40 x24 x15 x31 x51 x17 x55 x58 x27 x43 x55 x33 x52 x10 x45 x13 x23 x4 x36 x17 x15
x33 x63 x13 x47 x49 x14 x58 x16 x47 x28 x25 x40 x24 x15 x31 x51 x17 x55 x58 x27 x43 x55 x33 x52 x10 x45 x13 x23 x4 x36 x17 x15
{'task': 'identity', 'seq': ['x33', 'x63', 'x13', 'x47', 'x49', 'x14', 'x58', 'x16', 'x47', 'x28', 'x25', 'x40', 'x24', 'x15', 'x31', 'x51', 'x17', 'x55', 'x58', 'x27', 'x43', 'x55', 'x33', 'x52', 'x10', 'x45', 'x13', 'x23', 'x4', 'x36', 'x17', 'x15'], 'k': 4, 'n': 32, '_time': 0.00027370452880859375, '_task': 'basic_p...
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 c2 o3 o1 c1 o2 o3 c3 o3 o0 o1 o1 o3 o3 o0 o0 o1 c1 c0 c0 c3 c3 o3 o0 c0 c3 c1 c1 c0 c3 c2 c3
{'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.00025725364685058594, '_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) x44 x26 x40 x3 x32 x10 x63 x26 x36 x10 x60 x29 x63 x27 x41 x32 x17 x59 x49 x43 x42 x33 x6 x49 x17 x31 x8 x22 x6 x25 x12 x12
x44 x26 x40 x3 x32 x10 x63 x26 x36 x10 x60 x29 x63 x27 x41 x32 x17 x59 x49 x43 x42 x33 x6 x49 x17 x31 x8 x22 x6 x25 x12 x12
{'task': 'identity', 'seq': ['x44', 'x26', 'x40', 'x3', 'x32', 'x10', 'x63', 'x26', 'x36', 'x10', 'x60', 'x29', 'x63', 'x27', 'x41', 'x32', 'x17', 'x59', 'x49', 'x43', 'x42', 'x33', 'x6', 'x49', 'x17', 'x31', 'x8', 'x22', 'x6', 'x25', 'x12', 'x12'], 'k': 4, 'n': 32, '_time': 0.0002739429473876953, '_task': 'basic_proce...
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.
o3 o0 o2 c2 c0 c3 o1 c1 o0 c0 o0 o0 c0 o1 c1 c0 o2 o3 c3 o1 c1 o0 o1 o0 o2 o0 c0 c2 c0 c1 c0 c2
{'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.00038242340087890625, '_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 x36; PUSH x15; PUSH x38; PUSH x49; PUSH x63; PUSH x58; POP; PUSH x40; PUSH x44; PUSH x5; PUSH x6; PUSH x30; POP; PUSH x11; PUSH x5; PUSH x28; POP; PUSH x3...
x19 x5 x11 x6 x5 x44 x40 x63 x49 x38 x15 x36
{'task': 'stack', 'seq': ['PUSH x36', 'PUSH x15', 'PUSH x38', 'PUSH x49', 'PUSH x63', 'PUSH x58', 'POP', 'PUSH x40', 'PUSH x44', 'PUSH x5', 'PUSH x6', 'PUSH x30', 'POP', 'PUSH x11', 'PUSH x5', 'PUSH x28', 'POP', 'PUSH x34', 'PUSH x26', 'POP', 'PUSH x40', 'PUSH x36', 'PUSH x3', 'PUSH x23', 'POP', 'POP', '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) x56 x9 x63 x27 x36 x11 x12 x35 x20 x53 x15 x29 x60 x19 x64 x8 (B) x8 x45 x45 x30 x31 x62 x27 x35 x53 x43 x14 x19 x61 x12 x32 x29
x56 x9 x63 x27 x36 x11 x12 x35 x20 x53 x15 x29 x60 x19 x64 x8 x45 x30 x31 x62 x43 x14 x61 x32
{'task': 'union', 'seq': [['x56', 'x9', 'x63', 'x27', 'x36', 'x11', 'x12', 'x35', 'x20', 'x53', 'x15', 'x29', 'x60', 'x19', 'x64', 'x8'], ['x8', 'x45', 'x45', 'x30', 'x31', 'x62', 'x27', 'x35', 'x53', 'x43', 'x14', 'x19', 'x61', 'x12', 'x32', 'x29']], 'k': 4, 'n': 32, '_time': 0.0002980232238769531, '_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 x16; PUSH x24; PUSH x16; PUSH x56; PUSH x39; PUSH x7; PUSH x15; PUSH x35; POP; PUSH x46; PUSH x43; PUSH x44; POP; PUSH x23; POP; PUSH x63; PUSH x12; PUSH ...
x63 x43 x46 x15 x7 x39 x56 x16 x24 x16
{'task': 'stack', 'seq': ['PUSH x16', 'PUSH x24', 'PUSH x16', 'PUSH x56', 'PUSH x39', 'PUSH x7', 'PUSH x15', 'PUSH x35', 'POP', 'PUSH x46', 'PUSH x43', 'PUSH x44', 'POP', 'PUSH x23', 'POP', 'PUSH x63', 'PUSH x12', 'PUSH x41', 'PUSH x33', 'PUSH x47', 'POP', 'PUSH x48', 'POP', 'POP', 'POP', 'PUSH x63', 'POP', 'PUSH x44',...
stack
instruct
0
Reverse the sequence. (SEQUENCE) x62 x47 x12 x32 x11 x61 x55 x28 x24 x1 x15 x14 x40 x23 x41 x47 x8 x36 x34 x59 x53 x23 x39 x36 x64 x33 x39 x41 x43 x25 x16 x1
x1 x16 x25 x43 x41 x39 x33 x64 x36 x39 x23 x53 x59 x34 x36 x8 x47 x41 x23 x40 x14 x15 x1 x24 x28 x55 x61 x11 x32 x12 x47 x62
{'task': 'reverse', 'seq': ['x62', 'x47', 'x12', 'x32', 'x11', 'x61', 'x55', 'x28', 'x24', 'x1', 'x15', 'x14', 'x40', 'x23', 'x41', 'x47', 'x8', 'x36', 'x34', 'x59', 'x53', 'x23', 'x39', 'x36', 'x64', 'x33', 'x39', 'x41', 'x43', 'x25', 'x16', 'x1'], 'k': 4, 'n': 32, '_time': 0.00042057037353515625, '_task': 'basic_proc...
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 o2 o3 c2 c3 c2 o3 c3 o0 c0 o2 c2 o3 c3 o2 o2 c2 o0 o1 o2 c0 c1 o0 o2 c2 c2 o1 c0 c2 c1 o1 c1
{'task': 'dyck_shuffle', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0002989768981933594, '_task': 'basic_procedural', '_level': 0, '_config': {'c': 1.0, 'level': 0, 'seed': None, 'size': None, 'task': 'mixed', 'seq_len': 32, 'vocab_size': 64, 'k': 4, 'p_open': 0.49, 'max_depth': 16}, '_prompt_tokens': 46, '_answer_tokens':...
dyck_shuffle
instruct
0
Sort the sequence in ascending numeric order, where x2 < x10. (SEQUENCE) x24 x2 x42 x59 x53 x22 x39 x41 x37 x49 x14 x36 x5 x43 x24 x21 x14 x61 x2 x3 x20 x43 x2 x58 x45 x62 x37 x31 x8 x13 x38 x49
x2 x2 x2 x3 x5 x8 x13 x14 x14 x20 x21 x22 x24 x24 x31 x36 x37 x37 x38 x39 x41 x42 x43 x43 x45 x49 x49 x53 x58 x59 x61 x62
{'task': 'sort', 'seq': ['x24', 'x2', 'x42', 'x59', 'x53', 'x22', 'x39', 'x41', 'x37', 'x49', 'x14', 'x36', 'x5', 'x43', 'x24', 'x21', 'x14', 'x61', 'x2', 'x3', 'x20', 'x43', 'x2', 'x58', 'x45', 'x62', 'x37', 'x31', 'x8', 'x13', 'x38', 'x49'], 'k': 4, 'n': 32, '_time': 0.0004353523254394531, '_task': 'basic_procedural'...
sort
instruct
0
Reverse the sequence. (SEQUENCE) x44 x35 x15 x7 x1 x45 x64 x37 x60 x18 x5 x1 x16 x19 x15 x30 x15 x48 x29 x13 x57 x63 x49 x2 x61 x18 x9 x39 x55 x27 x40 x13
x13 x40 x27 x55 x39 x9 x18 x61 x2 x49 x63 x57 x13 x29 x48 x15 x30 x15 x19 x16 x1 x5 x18 x60 x37 x64 x45 x1 x7 x15 x35 x44
{'task': 'reverse', 'seq': ['x44', 'x35', 'x15', 'x7', 'x1', 'x45', 'x64', 'x37', 'x60', 'x18', 'x5', 'x1', 'x16', 'x19', 'x15', 'x30', 'x15', 'x48', 'x29', 'x13', 'x57', 'x63', 'x49', 'x2', 'x61', 'x18', 'x9', 'x39', 'x55', 'x27', 'x40', 'x13'], 'k': 4, 'n': 32, '_time': 0.00027489662170410156, '_task': 'basic_procedu...
reverse
instruct
0
Copy the sequence exactly. (SEQUENCE) x63 x37 x39 x14 x2 x6 x64 x23 x47 x21 x45 x39 x58 x13 x19 x60 x51 x2 x39 x27 x11 x26 x59 x21 x11 x35 x6 x53 x60 x51 x5 x13
x63 x37 x39 x14 x2 x6 x64 x23 x47 x21 x45 x39 x58 x13 x19 x60 x51 x2 x39 x27 x11 x26 x59 x21 x11 x35 x6 x53 x60 x51 x5 x13
{'task': 'identity', 'seq': ['x63', 'x37', 'x39', 'x14', 'x2', 'x6', 'x64', 'x23', 'x47', 'x21', 'x45', 'x39', 'x58', 'x13', 'x19', 'x60', 'x51', 'x2', 'x39', 'x27', 'x11', 'x26', 'x59', 'x21', 'x11', 'x35', 'x6', 'x53', 'x60', 'x51', 'x5', 'x13'], 'k': 4, 'n': 32, '_time': 0.0004131793975830078, '_task': 'basic_proced...
identity
instruct
0
Execute the stack operations. PUSH x pushes x. POP removes the top item. Return the final stack from top to bottom, or EMPTY if the stack is empty. (OPERATIONS) PUSH x18; PUSH x20; PUSH x13; PUSH x25; PUSH x63; POP; PUSH x46; PUSH x63; PUSH x9; PUSH x20; PUSH x40; POP; PUSH x56; PUSH x5; PUSH x5; POP; PUSH x57; PUSH x3...
x25 x13 x20 x18
{'task': 'stack', 'seq': ['PUSH x18', 'PUSH x20', 'PUSH x13', 'PUSH x25', 'PUSH x63', 'POP', 'PUSH x46', 'PUSH x63', 'PUSH x9', 'PUSH x20', 'PUSH x40', 'POP', 'PUSH x56', 'PUSH x5', 'PUSH x5', 'POP', 'PUSH x57', 'PUSH x33', 'POP', 'PUSH x5', 'PUSH x17', 'POP', 'POP', 'POP', 'PUSH x29', 'POP', 'POP', 'POP', 'POP', '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 x34; POP; PUSH x63; PUSH x59; PUSH x6; PUSH x48; PUSH x48; POP; PUSH x40; PUSH x31; POP; POP; PUSH x61; POP; PUSH x1; PUSH x34; POP; PUSH x15; PUSH x29; P...
x46 x29 x15 x1 x48 x6 x59 x63
{'task': 'stack', 'seq': ['PUSH x34', 'POP', 'PUSH x63', 'PUSH x59', 'PUSH x6', 'PUSH x48', 'PUSH x48', 'POP', 'PUSH x40', 'PUSH x31', 'POP', 'POP', 'PUSH x61', 'POP', 'PUSH x1', 'PUSH x34', 'POP', 'PUSH x15', 'PUSH x29', 'PUSH x46', 'PUSH x3', 'PUSH x39', 'PUSH x5', 'PUSH x8', 'PUSH x38', 'POP', 'POP', 'POP', '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 x58; PUSH x15; PUSH x44; PUSH x21; PUSH x40; PUSH x50; PUSH x60; PUSH x16; POP; PUSH x6; PUSH x10; PUSH x6; PUSH x32; POP; PUSH x24; PUSH x26; PUSH x45; P...
x26 x24 x6 x10 x6 x60 x50 x40 x21 x44 x15 x58
{'task': 'stack', 'seq': ['PUSH x58', 'PUSH x15', 'PUSH x44', 'PUSH x21', 'PUSH x40', 'PUSH x50', 'PUSH x60', 'PUSH x16', 'POP', 'PUSH x6', 'PUSH x10', 'PUSH x6', 'PUSH x32', 'POP', 'PUSH x24', 'PUSH x26', 'PUSH x45', 'POP', 'PUSH x42', 'PUSH x53', 'PUSH x53', 'PUSH x24', 'POP', 'POP', 'PUSH x32', 'POP', 'PUSH x34', 'P...
stack
instruct
0
Copy the sequence exactly. (SEQUENCE) x32 x36 x42 x14 x62 x63 x39 x45 x27 x15 x57 x64 x11 x64 x18 x58 x4 x40 x36 x3 x32 x24 x4 x15 x44 x23 x38 x26 x47 x41 x31 x43
x32 x36 x42 x14 x62 x63 x39 x45 x27 x15 x57 x64 x11 x64 x18 x58 x4 x40 x36 x3 x32 x24 x4 x15 x44 x23 x38 x26 x47 x41 x31 x43
{'task': 'identity', 'seq': ['x32', 'x36', 'x42', 'x14', 'x62', 'x63', 'x39', 'x45', 'x27', 'x15', 'x57', 'x64', 'x11', 'x64', 'x18', 'x58', 'x4', 'x40', 'x36', 'x3', 'x32', 'x24', 'x4', 'x15', 'x44', 'x23', 'x38', 'x26', 'x47', 'x41', 'x31', 'x43'], 'k': 4, 'n': 32, '_time': 0.0002474784851074219, '_task': 'basic_proc...
identity
instruct
0
Sort the sequence in ascending numeric order, where x2 < x10. (SEQUENCE) x21 x18 x54 x54 x3 x64 x52 x61 x50 x17 x25 x38 x2 x41 x60 x1 x33 x27 x5 x18 x36 x28 x49 x8 x49 x62 x37 x47 x40 x9 x23 x55
x1 x2 x3 x5 x8 x9 x17 x18 x18 x21 x23 x25 x27 x28 x33 x36 x37 x38 x40 x41 x47 x49 x49 x50 x52 x54 x54 x55 x60 x61 x62 x64
{'task': 'sort', 'seq': ['x21', 'x18', 'x54', 'x54', 'x3', 'x64', 'x52', 'x61', 'x50', 'x17', 'x25', 'x38', 'x2', 'x41', 'x60', 'x1', 'x33', 'x27', 'x5', 'x18', 'x36', 'x28', 'x49', 'x8', 'x49', 'x62', 'x37', 'x47', 'x40', 'x9', 'x23', 'x55'], 'k': 4, 'n': 32, '_time': 0.0002808570861816406, '_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 o2 o0 o0 o2 o0 c0 o2 o1 c1 o3 c3 c2 o2 o0 o0 o3 c3 c0 c0 c2 o3 o3 c3 c3 c2 c0 c0 c2 o0 c0 c0
{'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.00038361549377441406, '_task': 'basic_procedural', '_level': 0, '_config': {'c': 1.0, 'level': 0, 'seed': None, 'size': None, 'task': 'mixed', 'seq_len': 32, 'vocab_size': 64, 'k': 4, 'p_open': 0.49, 'max_depth': 16}, '_prompt_tokens': 39, '_answer_tokens': 64}
dyck
instruct
0
Sort the sequence in ascending numeric order, where x2 < x10. (SEQUENCE) x57 x58 x11 x9 x12 x44 x12 x19 x43 x1 x60 x52 x19 x5 x6 x14 x15 x54 x32 x45 x35 x15 x56 x14 x8 x50 x5 x19 x19 x43 x56 x43
x1 x5 x5 x6 x8 x9 x11 x12 x12 x14 x14 x15 x15 x19 x19 x19 x19 x32 x35 x43 x43 x43 x44 x45 x50 x52 x54 x56 x56 x57 x58 x60
{'task': 'sort', 'seq': ['x57', 'x58', 'x11', 'x9', 'x12', 'x44', 'x12', 'x19', 'x43', 'x1', 'x60', 'x52', 'x19', 'x5', 'x6', 'x14', 'x15', 'x54', 'x32', 'x45', 'x35', 'x15', 'x56', 'x14', 'x8', 'x50', 'x5', 'x19', 'x19', 'x43', 'x56', 'x43'], 'k': 4, 'n': 32, '_time': 0.0004360675811767578, '_task': 'basic_procedural'...
sort
instruct
0
Delete the first occurrence of TARGET from SEQUENCE. If TARGET is absent, return SEQUENCE unchanged. (SEQUENCE) x45 x29 x44 x21 x60 x39 x53 x44 x64 x7 x26 x51 x10 x42 x17 x12 x9 x2 x32 x17 x7 x64 x25 x64 x35 x15 x14 x4 x8 x38 x24 x54 (TARGET) x40
x45 x29 x44 x21 x60 x39 x53 x44 x64 x7 x26 x51 x10 x42 x17 x12 x9 x2 x32 x17 x7 x64 x25 x64 x35 x15 x14 x4 x8 x38 x24 x54
{'task': 'delete', 'seq': [['x45', 'x29', 'x44', 'x21', 'x60', 'x39', 'x53', 'x44', 'x64', 'x7', 'x26', 'x51', 'x10', 'x42', 'x17', 'x12', 'x9', 'x2', 'x32', 'x17', 'x7', 'x64', 'x25', 'x64', 'x35', 'x15', 'x14', 'x4', 'x8', 'x38', 'x24', 'x54'], 'x40'], 'k': 4, 'n': 32, '_time': 0.0003063678741455078, '_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.
o1 o1 o2 o0 o3 o2 o2 o2 c1 o2 o3 o0 c3 o0 o1 c0 o1 c3 c0 c2 c2 o2 c2 c0 c1 o3 c1 c3 c1 c2 c2 c2
{'task': 'dyck_shuffle', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0004093647003173828, '_task': 'basic_procedural', '_level': 0, '_config': {'c': 1.0, 'level': 0, 'seed': None, 'size': None, 'task': 'mixed', 'seq_len': 32, 'vocab_size': 64, 'k': 4, 'p_open': 0.49, 'max_depth': 16}, '_prompt_tokens': 46, '_answer_tokens':...
dyck_shuffle
instruct
0
Return the unique elements of the sequence in order of first appearance. (SEQUENCE) x64 x59 x33 x38 x23 x63 x9 x15 x27 x25 x29 x62 x41 x18 x5 x13 x41 x30 x34 x3 x19 x8 x24 x43 x23 x8 x9 x8 x21 x41 x10 x38
x64 x59 x33 x38 x23 x63 x9 x15 x27 x25 x29 x62 x41 x18 x5 x13 x30 x34 x3 x19 x8 x24 x43 x21 x10
{'task': 'set', 'seq': ['x64', 'x59', 'x33', 'x38', 'x23', 'x63', 'x9', 'x15', 'x27', 'x25', 'x29', 'x62', 'x41', 'x18', 'x5', 'x13', 'x41', 'x30', 'x34', 'x3', 'x19', 'x8', 'x24', 'x43', 'x23', 'x8', 'x9', 'x8', 'x21', 'x41', 'x10', 'x38'], 'k': 4, 'n': 32, '_time': 0.0002791881561279297, '_task': 'basic_procedural', ...
set
instruct
0
Sort the sequence in ascending numeric order, where x2 < x10. (SEQUENCE) x42 x42 x28 x11 x7 x18 x6 x50 x30 x3 x28 x2 x33 x48 x35 x45 x58 x35 x8 x60 x40 x64 x16 x21 x51 x1 x22 x7 x60 x64 x11 x61
x1 x2 x3 x6 x7 x7 x8 x11 x11 x16 x18 x21 x22 x28 x28 x30 x33 x35 x35 x40 x42 x42 x45 x48 x50 x51 x58 x60 x60 x61 x64 x64
{'task': 'sort', 'seq': ['x42', 'x42', 'x28', 'x11', 'x7', 'x18', 'x6', 'x50', 'x30', 'x3', 'x28', 'x2', 'x33', 'x48', 'x35', 'x45', 'x58', 'x35', 'x8', 'x60', 'x40', 'x64', 'x16', 'x21', 'x51', 'x1', 'x22', 'x7', 'x60', 'x64', 'x11', 'x61'], 'k': 4, 'n': 32, '_time': 0.0002923011779785156, '_task': 'basic_procedural',...
sort
instruct
0
Generate one valid shuffle-Dyck-4 sequence of exactly 32 tokens. Each close ci must match a previously opened oi of the same type, but closing order may be interleaved across types. Return only the sequence.
o3 o1 c3 c1 o0 c0 o0 c0 o0 o1 c0 o3 o1 c3 o3 c1 c1 o3 o3 o1 o1 o2 o1 c2 c1 o2 c2 c3 c1 c1 c3 c3
{'task': 'dyck_shuffle', 'seq': [], 'k': 4, 'n': 32, '_time': 0.00044798851013183594, '_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) x40 x61 x57 x59 x10 x24 x34 x60 x39 x29 x2 x19 x53 x18 x48 x16 (B) x33 x27 x42 x29 x45 x35 x49 x1 x26 x34 x50 x4 x48 x18 x40 x54
x40 x61 x57 x59 x10 x24 x34 x60 x39 x29 x2 x19 x53 x18 x48 x16 x33 x27 x42 x45 x35 x49 x1 x26 x50 x4 x54
{'task': 'union', 'seq': [['x40', 'x61', 'x57', 'x59', 'x10', 'x24', 'x34', 'x60', 'x39', 'x29', 'x2', 'x19', 'x53', 'x18', 'x48', 'x16'], ['x33', 'x27', 'x42', 'x29', 'x45', 'x35', 'x49', 'x1', 'x26', 'x34', 'x50', 'x4', 'x48', 'x18', 'x40', 'x54']], 'k': 4, 'n': 32, '_time': 0.0004506111145019531, '_task': 'basic_pro...
union
instruct
0
Reverse the sequence. (SEQUENCE) x56 x25 x15 x11 x3 x14 x4 x51 x6 x50 x50 x37 x24 x13 x40 x17 x31 x4 x51 x34 x30 x6 x19 x64 x32 x24 x31 x19 x40 x9 x55 x34
x34 x55 x9 x40 x19 x31 x24 x32 x64 x19 x6 x30 x34 x51 x4 x31 x17 x40 x13 x24 x37 x50 x50 x6 x51 x4 x14 x3 x11 x15 x25 x56
{'task': 'reverse', 'seq': ['x56', 'x25', 'x15', 'x11', 'x3', 'x14', 'x4', 'x51', 'x6', 'x50', 'x50', 'x37', 'x24', 'x13', 'x40', 'x17', 'x31', 'x4', 'x51', 'x34', 'x30', 'x6', 'x19', 'x64', 'x32', 'x24', 'x31', 'x19', 'x40', 'x9', 'x55', 'x34'], 'k': 4, 'n': 32, '_time': 0.0002808570861816406, '_task': 'basic_procedur...
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 x3; PUSH x29; PUSH x52; POP; PUSH x28; PUSH x59; PUSH x36; PUSH x11; POP; PUSH x35; POP; PUSH x45; PUSH x5; PUSH x55; PUSH x18; PUSH x11; PUSH x25; POP; P...
x26 x43 x45 x36 x59 x28 x29 x3
{'task': 'stack', 'seq': ['PUSH x3', 'PUSH x29', 'PUSH x52', 'POP', 'PUSH x28', 'PUSH x59', 'PUSH x36', 'PUSH x11', 'POP', 'PUSH x35', 'POP', 'PUSH x45', 'PUSH x5', 'PUSH x55', 'PUSH x18', 'PUSH x11', 'PUSH x25', 'POP', 'POP', 'POP', 'POP', 'PUSH x6', 'POP', 'POP', 'PUSH x43', 'PUSH x48', 'PUSH x47', 'PUSH x34', 'POP',...
stack
instruct
0
Delete the first occurrence of TARGET from SEQUENCE. If TARGET is absent, return SEQUENCE unchanged. (SEQUENCE) x26 x58 x56 x28 x46 x55 x1 x25 x6 x26 x16 x59 x2 x3 x56 x47 x21 x53 x25 x60 x3 x47 x17 x54 x54 x32 x16 x6 x8 x41 x30 x34 (TARGET) x10
x26 x58 x56 x28 x46 x55 x1 x25 x6 x26 x16 x59 x2 x3 x56 x47 x21 x53 x25 x60 x3 x47 x17 x54 x54 x32 x16 x6 x8 x41 x30 x34
{'task': 'delete', 'seq': [['x26', 'x58', 'x56', 'x28', 'x46', 'x55', 'x1', 'x25', 'x6', 'x26', 'x16', 'x59', 'x2', 'x3', 'x56', 'x47', 'x21', 'x53', 'x25', 'x60', 'x3', 'x47', 'x17', 'x54', 'x54', 'x32', 'x16', 'x6', 'x8', 'x41', 'x30', 'x34'], 'x10'], 'k': 4, 'n': 32, '_time': 0.0004591941833496094, '_task': 'basic_p...
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) x26 x48 x35 x63 x18 x5 x37 x54 x50 x9 x51 x44 x20 x31 x8 x2 (B) x44 x56 x17 x31 x30 x34 x6 x2 x62 x12 x61 x28 x9 x15 x49 x25
x26 x48 x35 x63 x18 x5 x37 x54 x50 x9 x51 x44 x20 x31 x8 x2 x56 x17 x30 x34 x6 x62 x12 x61 x28 x15 x49 x25
{'task': 'union', 'seq': [['x26', 'x48', 'x35', 'x63', 'x18', 'x5', 'x37', 'x54', 'x50', 'x9', 'x51', 'x44', 'x20', 'x31', 'x8', 'x2'], ['x44', 'x56', 'x17', 'x31', 'x30', 'x34', 'x6', 'x2', 'x62', 'x12', 'x61', 'x28', 'x9', 'x15', 'x49', 'x25']], 'k': 4, 'n': 32, '_time': 0.0004527568817138672, '_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 x36; PUSH x61; PUSH x35; PUSH x11; PUSH x64; POP; PUSH x43; PUSH x60; PUSH x37; PUSH x17; PUSH x42; POP; POP; PUSH x41; POP; PUSH x21; POP; PUSH x61; PUSH...
x52 x7 x11 x35 x61 x36
{'task': 'stack', 'seq': ['PUSH x36', 'PUSH x61', 'PUSH x35', 'PUSH x11', 'PUSH x64', 'POP', 'PUSH x43', 'PUSH x60', 'PUSH x37', 'PUSH x17', 'PUSH x42', 'POP', 'POP', 'PUSH x41', 'POP', 'PUSH x21', 'POP', 'PUSH x61', 'PUSH x16', 'PUSH x37', 'PUSH x55', 'POP', 'POP', 'POP', 'POP', 'POP', 'POP', 'POP', 'PUSH x7', 'PUSH x...
stack
instruct
0
Generate one valid Dyck-4 balanced-bracket sequence of exactly 32 tokens. Use tokens o0..ok for opens and c0..ck for matching closes. Return only the sequence.
o2 o0 c0 o3 c3 c2 o0 c0 o0 c0 o2 c2 o0 o0 c0 o2 o0 o1 o0 o3 c3 o2 o2 o0 c0 c2 c2 c0 c1 c0 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
Return the unique elements of the sequence in order of first appearance. (SEQUENCE) x4 x37 x59 x61 x11 x53 x55 x21 x47 x54 x17 x29 x44 x55 x25 x24 x45 x58 x7 x13 x37 x37 x17 x58 x10 x51 x52 x56 x11 x12 x61 x27
x4 x37 x59 x61 x11 x53 x55 x21 x47 x54 x17 x29 x44 x25 x24 x45 x58 x7 x13 x10 x51 x52 x56 x12 x27
{'task': 'set', 'seq': ['x4', 'x37', 'x59', 'x61', 'x11', 'x53', 'x55', 'x21', 'x47', 'x54', 'x17', 'x29', 'x44', 'x55', 'x25', 'x24', 'x45', 'x58', 'x7', 'x13', 'x37', 'x37', 'x17', 'x58', 'x10', 'x51', 'x52', 'x56', 'x11', 'x12', 'x61', 'x27'], 'k': 4, 'n': 32, '_time': 0.0002791881561279297, '_task': 'basic_procedur...
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) x50 x29 x3 x49 x56 x56 x34 x29 x41 x39 x4 x5 x63 x41 x27 x61 (B) x23 x51 x28 x43 x62 x9 x51 x20 x19 x60 x60 x45 x30 x55 x21 x36
x50 x29 x3 x49 x56 x34 x41 x39 x4 x5 x63 x27 x61 x23 x51 x28 x43 x62 x9 x20 x19 x60 x45 x30 x55 x21 x36
{'task': 'union', 'seq': [['x50', 'x29', 'x3', 'x49', 'x56', 'x56', 'x34', 'x29', 'x41', 'x39', 'x4', 'x5', 'x63', 'x41', 'x27', 'x61'], ['x23', 'x51', 'x28', 'x43', 'x62', 'x9', 'x51', 'x20', 'x19', 'x60', 'x60', 'x45', 'x30', 'x55', 'x21', 'x36']], 'k': 4, 'n': 32, '_time': 0.0004520416259765625, '_task': 'basic_proc...
union
instruct
0
Generate one valid Dyck-4 balanced-bracket sequence of exactly 32 tokens. Use tokens o0..ok for opens and c0..ck for matching closes. Return only the sequence.
o2 o2 c2 o2 o2 o2 o2 c2 o2 o3 o1 o2 c2 o3 o0 c0 o0 o0 c0 o1 o2 c2 c1 c0 c3 c1 c3 c2 c2 c2 c2 c2
{'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.00026917457580566406, '_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) x58 x27 x11 x61 x50 x37 x35 x24 x13 x51 x52 x33 x35 x54 x20 x33 x44 x20 x64 x37 x11 x47 x4 x46 x50 x36 x9 x48 x12 x41 x13 x51
x58 x27 x11 x61 x50 x37 x35 x24 x13 x51 x52 x33 x54 x20 x44 x64 x47 x4 x46 x36 x9 x48 x12 x41
{'task': 'set', 'seq': ['x58', 'x27', 'x11', 'x61', 'x50', 'x37', 'x35', 'x24', 'x13', 'x51', 'x52', 'x33', 'x35', 'x54', 'x20', 'x33', 'x44', 'x20', 'x64', 'x37', 'x11', 'x47', 'x4', 'x46', 'x50', 'x36', 'x9', 'x48', 'x12', 'x41', 'x13', 'x51'], 'k': 4, 'n': 32, '_time': 0.0004162788391113281, '_task': 'basic_procedur...
set
instruct
0
Sort the sequence in ascending numeric order, where x2 < x10. (SEQUENCE) x49 x21 x52 x2 x56 x3 x33 x16 x62 x10 x56 x9 x19 x14 x12 x61 x6 x54 x54 x33 x13 x24 x63 x16 x32 x10 x18 x23 x41 x55 x42 x64
x2 x3 x6 x9 x10 x10 x12 x13 x14 x16 x16 x18 x19 x21 x23 x24 x32 x33 x33 x41 x42 x49 x52 x54 x54 x55 x56 x56 x61 x62 x63 x64
{'task': 'sort', 'seq': ['x49', 'x21', 'x52', 'x2', 'x56', 'x3', 'x33', 'x16', 'x62', 'x10', 'x56', 'x9', 'x19', 'x14', 'x12', 'x61', 'x6', 'x54', 'x54', 'x33', 'x13', 'x24', 'x63', 'x16', 'x32', 'x10', 'x18', 'x23', 'x41', 'x55', 'x42', 'x64'], 'k': 4, 'n': 32, '_time': 0.0004448890686035156, '_task': 'basic_procedura...
sort
instruct
0
Reverse the sequence. (SEQUENCE) x27 x25 x28 x10 x35 x22 x19 x29 x8 x7 x59 x43 x19 x16 x18 x46 x25 x44 x63 x62 x1 x23 x31 x5 x47 x29 x58 x57 x55 x4 x26 x24
x24 x26 x4 x55 x57 x58 x29 x47 x5 x31 x23 x1 x62 x63 x44 x25 x46 x18 x16 x19 x43 x59 x7 x8 x29 x19 x22 x35 x10 x28 x25 x27
{'task': 'reverse', 'seq': ['x27', 'x25', 'x28', 'x10', 'x35', 'x22', 'x19', 'x29', 'x8', 'x7', 'x59', 'x43', 'x19', 'x16', 'x18', 'x46', 'x25', 'x44', 'x63', 'x62', 'x1', 'x23', 'x31', 'x5', 'x47', 'x29', 'x58', 'x57', 'x55', 'x4', 'x26', 'x24'], 'k': 4, 'n': 32, '_time': 0.00028204917907714844, '_task': 'basic_proced...
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) x45 x7 x54 x3 x16 x25 x52 x63 x14 x24 x2 x48 x49 x57 x5 x41 (B) x28 x58 x58 x61 x26 x12 x26 x62 x50 x57 x39 x52 x28 x36 x62 x57
x45 x7 x54 x3 x16 x25 x52 x63 x14 x24 x2 x48 x49 x57 x5 x41 x28 x58 x61 x26 x12 x62 x50 x39 x36
{'task': 'union', 'seq': [['x45', 'x7', 'x54', 'x3', 'x16', 'x25', 'x52', 'x63', 'x14', 'x24', 'x2', 'x48', 'x49', 'x57', 'x5', 'x41'], ['x28', 'x58', 'x58', 'x61', 'x26', 'x12', 'x26', 'x62', 'x50', 'x57', 'x39', 'x52', 'x28', 'x36', 'x62', 'x57']], 'k': 4, 'n': 32, '_time': 0.00031447410583496094, '_task': 'basic_pro...
union
instruct
0
Return the unique elements of the sequence in order of first appearance. (SEQUENCE) x54 x53 x15 x22 x3 x38 x27 x24 x40 x33 x30 x10 x8 x26 x48 x29 x33 x22 x44 x30 x32 x30 x58 x36 x43 x54 x46 x36 x42 x20 x19 x18
x54 x53 x15 x22 x3 x38 x27 x24 x40 x33 x30 x10 x8 x26 x48 x29 x44 x32 x58 x36 x43 x46 x42 x20 x19 x18
{'task': 'set', 'seq': ['x54', 'x53', 'x15', 'x22', 'x3', 'x38', 'x27', 'x24', 'x40', 'x33', 'x30', 'x10', 'x8', 'x26', 'x48', 'x29', 'x33', 'x22', 'x44', 'x30', 'x32', 'x30', 'x58', 'x36', 'x43', 'x54', 'x46', 'x36', 'x42', 'x20', 'x19', 'x18'], 'k': 4, 'n': 32, '_time': 0.0002810955047607422, '_task': 'basic_procedur...
set
instruct
0
Delete the first occurrence of TARGET from SEQUENCE. If TARGET is absent, return SEQUENCE unchanged. (SEQUENCE) x14 x42 x57 x56 x6 x34 x25 x41 x44 x30 x14 x7 x35 x33 x14 x7 x42 x12 x34 x28 x25 x42 x20 x28 x54 x9 x47 x22 x55 x7 x6 x13 (TARGET) x44
x14 x42 x57 x56 x6 x34 x25 x41 x30 x14 x7 x35 x33 x14 x7 x42 x12 x34 x28 x25 x42 x20 x28 x54 x9 x47 x22 x55 x7 x6 x13
{'task': 'delete', 'seq': [['x14', 'x42', 'x57', 'x56', 'x6', 'x34', 'x25', 'x41', 'x44', 'x30', 'x14', 'x7', 'x35', 'x33', 'x14', 'x7', 'x42', 'x12', 'x34', 'x28', 'x25', 'x42', 'x20', 'x28', 'x54', 'x9', 'x47', 'x22', 'x55', 'x7', 'x6', 'x13'], 'x44'], 'k': 4, 'n': 32, '_time': 0.0004355907440185547, '_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.
o0 c0 o3 o3 o3 c3 c3 c3 o3 c3 o2 o2 o0 o0 o3 c3 c0 c0 c2 c2 o1 c1 o2 c2 o2 c2 o0 c0 o1 c1 o3 c3
{'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
Reverse the sequence. (SEQUENCE) x20 x8 x9 x50 x47 x63 x11 x47 x16 x14 x4 x45 x7 x18 x30 x21 x5 x63 x49 x32 x49 x49 x18 x22 x35 x23 x31 x52 x64 x46 x47 x14
x14 x47 x46 x64 x52 x31 x23 x35 x22 x18 x49 x49 x32 x49 x63 x5 x21 x30 x18 x7 x45 x4 x14 x16 x47 x11 x63 x47 x50 x9 x8 x20
{'task': 'reverse', 'seq': ['x20', 'x8', 'x9', 'x50', 'x47', 'x63', 'x11', 'x47', 'x16', 'x14', 'x4', 'x45', 'x7', 'x18', 'x30', 'x21', 'x5', 'x63', 'x49', 'x32', 'x49', 'x49', 'x18', 'x22', 'x35', 'x23', 'x31', 'x52', 'x64', 'x46', 'x47', 'x14'], 'k': 4, 'n': 32, '_time': 0.0002906322479248047, '_task': 'basic_procedu...
reverse
instruct
0
Sort the sequence in ascending numeric order, where x2 < x10. (SEQUENCE) x2 x13 x4 x16 x3 x4 x5 x41 x22 x14 x2 x2 x27 x37 x63 x35 x50 x5 x58 x42 x57 x42 x21 x52 x58 x25 x55 x7 x3 x37 x55 x7
x2 x2 x2 x3 x3 x4 x4 x5 x5 x7 x7 x13 x14 x16 x21 x22 x25 x27 x35 x37 x37 x41 x42 x42 x50 x52 x55 x55 x57 x58 x58 x63
{'task': 'sort', 'seq': ['x2', 'x13', 'x4', 'x16', 'x3', 'x4', 'x5', 'x41', 'x22', 'x14', 'x2', 'x2', 'x27', 'x37', 'x63', 'x35', 'x50', 'x5', 'x58', 'x42', 'x57', 'x42', 'x21', 'x52', 'x58', 'x25', 'x55', 'x7', 'x3', 'x37', 'x55', 'x7'], 'k': 4, 'n': 32, '_time': 0.0002913475036621094, '_task': 'basic_procedural', '_l...
sort
instruct
0
Return the unique elements of the sequence in order of first appearance. (SEQUENCE) x60 x53 x1 x28 x42 x61 x27 x39 x19 x6 x43 x53 x62 x1 x9 x57 x62 x40 x13 x28 x52 x22 x21 x51 x46 x11 x41 x31 x33 x55 x61 x42
x60 x53 x1 x28 x42 x61 x27 x39 x19 x6 x43 x62 x9 x57 x40 x13 x52 x22 x21 x51 x46 x11 x41 x31 x33 x55
{'task': 'set', 'seq': ['x60', 'x53', 'x1', 'x28', 'x42', 'x61', 'x27', 'x39', 'x19', 'x6', 'x43', 'x53', 'x62', 'x1', 'x9', 'x57', 'x62', 'x40', 'x13', 'x28', 'x52', 'x22', 'x21', 'x51', 'x46', 'x11', 'x41', 'x31', 'x33', 'x55', 'x61', 'x42'], 'k': 4, 'n': 32, '_time': 0.0004208087921142578, '_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) x25 x41 x10 x64 x63 x25 x34 x1 x43 x10 x19 x46 x37 x19 x36 x37 (B) x43 x32 x34 x17 x58 x16 x59 x48 x36 x14 x42 x26 x62 x19 x38 x57
x25 x41 x10 x64 x63 x34 x1 x43 x19 x46 x37 x36 x32 x17 x58 x16 x59 x48 x14 x42 x26 x62 x38 x57
{'task': 'union', 'seq': [['x25', 'x41', 'x10', 'x64', 'x63', 'x25', 'x34', 'x1', 'x43', 'x10', 'x19', 'x46', 'x37', 'x19', 'x36', 'x37'], ['x43', 'x32', 'x34', 'x17', 'x58', 'x16', 'x59', 'x48', 'x36', 'x14', 'x42', 'x26', 'x62', 'x19', 'x38', 'x57']], 'k': 4, 'n': 32, '_time': 0.0003132820129394531, '_task': 'basic_p...
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 c2 o1 c1 o3 o2 o1 c1 c2 c3 o3 c3 o1 o3 c3 c1 o0 o2 o3 c3 o2 o1 c1 c2 o2 o1 c1 c2 o1 c1 c2 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
Sort the sequence in ascending numeric order, where x2 < x10. (SEQUENCE) x3 x48 x34 x20 x31 x7 x42 x36 x48 x27 x30 x2 x44 x12 x1 x9 x27 x13 x18 x40 x61 x50 x21 x31 x26 x38 x56 x4 x37 x53 x61 x62
x1 x2 x3 x4 x7 x9 x12 x13 x18 x20 x21 x26 x27 x27 x30 x31 x31 x34 x36 x37 x38 x40 x42 x44 x48 x48 x50 x53 x56 x61 x61 x62
{'task': 'sort', 'seq': ['x3', 'x48', 'x34', 'x20', 'x31', 'x7', 'x42', 'x36', 'x48', 'x27', 'x30', 'x2', 'x44', 'x12', 'x1', 'x9', 'x27', 'x13', 'x18', 'x40', 'x61', 'x50', 'x21', 'x31', 'x26', 'x38', 'x56', 'x4', 'x37', 'x53', 'x61', 'x62'], 'k': 4, 'n': 32, '_time': 0.0002899169921875, '_task': 'basic_procedural', '...
sort
instruct
0
Return the unique elements of the sequence in order of first appearance. (SEQUENCE) x47 x29 x29 x60 x60 x16 x61 x50 x1 x36 x47 x59 x23 x64 x6 x8 x1 x19 x36 x50 x23 x11 x1 x26 x60 x15 x16 x6 x24 x19 x3 x4
x47 x29 x60 x16 x61 x50 x1 x36 x59 x23 x64 x6 x8 x19 x11 x26 x15 x24 x3 x4
{'task': 'set', 'seq': ['x47', 'x29', 'x29', 'x60', 'x60', 'x16', 'x61', 'x50', 'x1', 'x36', 'x47', 'x59', 'x23', 'x64', 'x6', 'x8', 'x1', 'x19', 'x36', 'x50', 'x23', 'x11', 'x1', 'x26', 'x60', 'x15', 'x16', 'x6', 'x24', 'x19', 'x3', 'x4'], 'k': 4, 'n': 32, '_time': 0.00041103363037109375, '_task': 'basic_procedural', ...
set
instruct
0
Return the unique elements of the sequence in order of first appearance. (SEQUENCE) x7 x25 x25 x38 x43 x11 x18 x30 x40 x37 x39 x54 x24 x57 x38 x4 x31 x37 x33 x1 x22 x56 x63 x18 x58 x9 x37 x50 x25 x49 x34 x51
x7 x25 x38 x43 x11 x18 x30 x40 x37 x39 x54 x24 x57 x4 x31 x33 x1 x22 x56 x63 x58 x9 x50 x49 x34 x51
{'task': 'set', 'seq': ['x7', 'x25', 'x25', 'x38', 'x43', 'x11', 'x18', 'x30', 'x40', 'x37', 'x39', 'x54', 'x24', 'x57', 'x38', 'x4', 'x31', 'x37', 'x33', 'x1', 'x22', 'x56', 'x63', 'x18', 'x58', 'x9', 'x37', 'x50', 'x25', 'x49', 'x34', 'x51'], 'k': 4, 'n': 32, '_time': 0.0002961158752441406, '_task': 'basic_procedural...
set
instruct
0
Sort the sequence in ascending numeric order, where x2 < x10. (SEQUENCE) x18 x22 x36 x13 x50 x28 x5 x49 x52 x27 x35 x1 x41 x17 x26 x60 x47 x49 x60 x29 x14 x32 x7 x31 x39 x63 x2 x22 x18 x16 x33 x6
x1 x2 x5 x6 x7 x13 x14 x16 x17 x18 x18 x22 x22 x26 x27 x28 x29 x31 x32 x33 x35 x36 x39 x41 x47 x49 x49 x50 x52 x60 x60 x63
{'task': 'sort', 'seq': ['x18', 'x22', 'x36', 'x13', 'x50', 'x28', 'x5', 'x49', 'x52', 'x27', 'x35', 'x1', 'x41', 'x17', 'x26', 'x60', 'x47', 'x49', 'x60', 'x29', 'x14', 'x32', 'x7', 'x31', 'x39', 'x63', 'x2', 'x22', 'x18', 'x16', 'x33', 'x6'], 'k': 4, 'n': 32, '_time': 0.00043654441833496094, '_task': 'basic_procedura...
sort
instruct
0
Delete the first occurrence of TARGET from SEQUENCE. If TARGET is absent, return SEQUENCE unchanged. (SEQUENCE) x16 x18 x4 x61 x10 x5 x49 x55 x35 x18 x37 x44 x60 x42 x17 x11 x24 x42 x30 x38 x14 x43 x52 x9 x64 x28 x12 x50 x23 x53 x45 x49 (TARGET) x49
x16 x18 x4 x61 x10 x5 x55 x35 x18 x37 x44 x60 x42 x17 x11 x24 x42 x30 x38 x14 x43 x52 x9 x64 x28 x12 x50 x23 x53 x45 x49
{'task': 'delete', 'seq': [['x16', 'x18', 'x4', 'x61', 'x10', 'x5', 'x49', 'x55', 'x35', 'x18', 'x37', 'x44', 'x60', 'x42', 'x17', 'x11', 'x24', 'x42', 'x30', 'x38', 'x14', 'x43', 'x52', 'x9', 'x64', 'x28', 'x12', 'x50', 'x23', 'x53', 'x45', 'x49'], 'x49'], 'k': 4, 'n': 32, '_time': 0.0002903938293457031, '_task': 'bas...
delete
instruct
0
Sort the sequence in ascending numeric order, where x2 < x10. (SEQUENCE) x7 x38 x23 x29 x50 x33 x27 x40 x2 x48 x61 x55 x5 x36 x45 x46 x52 x27 x55 x35 x58 x6 x9 x34 x33 x19 x24 x8 x17 x63 x56 x13
x2 x5 x6 x7 x8 x9 x13 x17 x19 x23 x24 x27 x27 x29 x33 x33 x34 x35 x36 x38 x40 x45 x46 x48 x50 x52 x55 x55 x56 x58 x61 x63
{'task': 'sort', 'seq': ['x7', 'x38', 'x23', 'x29', 'x50', 'x33', 'x27', 'x40', 'x2', 'x48', 'x61', 'x55', 'x5', 'x36', 'x45', 'x46', 'x52', 'x27', 'x55', 'x35', 'x58', 'x6', 'x9', 'x34', 'x33', 'x19', 'x24', 'x8', 'x17', 'x63', 'x56', 'x13'], 'k': 4, 'n': 32, '_time': 0.00043487548828125, '_task': 'basic_procedural', ...
sort
instruct
0
Reverse the sequence. (SEQUENCE) x8 x9 x52 x52 x22 x34 x14 x61 x23 x50 x8 x30 x29 x29 x62 x53 x2 x62 x14 x63 x19 x56 x25 x17 x49 x29 x31 x47 x13 x14 x11 x25
x25 x11 x14 x13 x47 x31 x29 x49 x17 x25 x56 x19 x63 x14 x62 x2 x53 x62 x29 x29 x30 x8 x50 x23 x61 x14 x34 x22 x52 x52 x9 x8
{'task': 'reverse', 'seq': ['x8', 'x9', 'x52', 'x52', 'x22', 'x34', 'x14', 'x61', 'x23', 'x50', 'x8', 'x30', 'x29', 'x29', 'x62', 'x53', 'x2', 'x62', 'x14', 'x63', 'x19', 'x56', 'x25', 'x17', 'x49', 'x29', 'x31', 'x47', 'x13', 'x14', 'x11', 'x25'], 'k': 4, 'n': 32, '_time': 0.0003745555877685547, '_task': 'basic_proced...
reverse
instruct
0
Execute the stack operations. PUSH x pushes x. POP removes the top item. Return the final stack from top to bottom, or EMPTY if the stack is empty. (OPERATIONS) PUSH x47; PUSH x23; PUSH x53; POP; PUSH x11; PUSH x53; POP; PUSH x41; POP; POP; PUSH x52; PUSH x7; PUSH x16; POP; PUSH x59; POP; POP; PUSH x60; POP; PUSH x47; ...
x23 x47
{'task': 'stack', 'seq': ['PUSH x47', 'PUSH x23', 'PUSH x53', 'POP', 'PUSH x11', 'PUSH x53', 'POP', 'PUSH x41', 'POP', 'POP', 'PUSH x52', 'PUSH x7', 'PUSH x16', 'POP', 'PUSH x59', 'POP', 'POP', 'PUSH x60', 'POP', 'PUSH x47', 'PUSH x9', 'PUSH x29', 'PUSH x1', 'POP', 'POP', 'POP', 'PUSH x9', 'PUSH x61', 'POP', 'POP', 'PO...
stack
instruct
0
Execute the stack operations. PUSH x pushes x. POP removes the top item. Return the final stack from top to bottom, or EMPTY if the stack is empty. (OPERATIONS) PUSH x37; PUSH x33; POP; POP; PUSH x51; PUSH x34; POP; PUSH x40; PUSH x56; PUSH x45; PUSH x14; POP; PUSH x38; PUSH x14; PUSH x15; PUSH x29; PUSH x15; POP; PUSH...
x18 x38 x45 x56 x40 x51
{'task': 'stack', 'seq': ['PUSH x37', 'PUSH x33', 'POP', 'POP', 'PUSH x51', 'PUSH x34', 'POP', 'PUSH x40', 'PUSH x56', 'PUSH x45', 'PUSH x14', 'POP', 'PUSH x38', 'PUSH x14', 'PUSH x15', 'PUSH x29', 'PUSH x15', 'POP', 'PUSH x37', 'POP', 'PUSH x3', 'PUSH x61', 'PUSH x48', 'POP', 'PUSH x25', 'POP', 'POP', '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) x29 x32 x29 x53 x59 x8 x32 x23 x1 x46 x17 x11 x28 x55 x55 x48 (B) x63 x49 x59 x46 x27 x20 x16 x32 x37 x59 x21 x12 x61 x57 x59 x38
x29 x32 x53 x59 x8 x23 x1 x46 x17 x11 x28 x55 x48 x63 x49 x27 x20 x16 x37 x21 x12 x61 x57 x38
{'task': 'union', 'seq': [['x29', 'x32', 'x29', 'x53', 'x59', 'x8', 'x32', 'x23', 'x1', 'x46', 'x17', 'x11', 'x28', 'x55', 'x55', 'x48'], ['x63', 'x49', 'x59', 'x46', 'x27', 'x20', 'x16', 'x32', 'x37', 'x59', 'x21', 'x12', 'x61', 'x57', 'x59', 'x38']], 'k': 4, 'n': 32, '_time': 0.00044608116149902344, '_task': 'basic_p...
union
instruct
0
Sort the sequence in ascending numeric order, where x2 < x10. (SEQUENCE) x31 x7 x28 x27 x18 x6 x17 x54 x64 x25 x13 x28 x1 x8 x32 x18 x11 x38 x23 x24 x20 x15 x31 x18 x29 x10 x53 x48 x40 x30 x8 x58
x1 x6 x7 x8 x8 x10 x11 x13 x15 x17 x18 x18 x18 x20 x23 x24 x25 x27 x28 x28 x29 x30 x31 x31 x32 x38 x40 x48 x53 x54 x58 x64
{'task': 'sort', 'seq': ['x31', 'x7', 'x28', 'x27', 'x18', 'x6', 'x17', 'x54', 'x64', 'x25', 'x13', 'x28', 'x1', 'x8', 'x32', 'x18', 'x11', 'x38', 'x23', 'x24', 'x20', 'x15', 'x31', 'x18', 'x29', 'x10', 'x53', 'x48', 'x40', 'x30', 'x8', 'x58'], 'k': 4, 'n': 32, '_time': 0.00039315223693847656, '_task': 'basic_procedura...
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 x15; POP; PUSH x42; POP; PUSH x10; PUSH x50; PUSH x36; PUSH x46; POP; POP; PUSH x59; POP; PUSH x59; PUSH x3; PUSH x33; POP; PUSH x55; POP; PUSH x31; PUSH ...
x50 x10
{'task': 'stack', 'seq': ['PUSH x15', 'POP', 'PUSH x42', 'POP', 'PUSH x10', 'PUSH x50', 'PUSH x36', 'PUSH x46', 'POP', 'POP', 'PUSH x59', 'POP', 'PUSH x59', 'PUSH x3', 'PUSH x33', 'POP', 'PUSH x55', 'POP', 'PUSH x31', 'PUSH x29', 'POP', 'PUSH x51', 'PUSH x47', 'PUSH x63', 'POP', 'POP', 'POP', 'POP', 'PUSH x6', 'POP', '...
stack
instruct
0
Sort the sequence in ascending numeric order, where x2 < x10. (SEQUENCE) x57 x59 x8 x50 x17 x2 x52 x46 x54 x10 x61 x13 x54 x4 x58 x41 x37 x64 x60 x50 x62 x29 x31 x63 x8 x23 x7 x26 x41 x45 x43 x13
x2 x4 x7 x8 x8 x10 x13 x13 x17 x23 x26 x29 x31 x37 x41 x41 x43 x45 x46 x50 x50 x52 x54 x54 x57 x58 x59 x60 x61 x62 x63 x64
{'task': 'sort', 'seq': ['x57', 'x59', 'x8', 'x50', 'x17', 'x2', 'x52', 'x46', 'x54', 'x10', 'x61', 'x13', 'x54', 'x4', 'x58', 'x41', 'x37', 'x64', 'x60', 'x50', 'x62', 'x29', 'x31', 'x63', 'x8', 'x23', 'x7', 'x26', 'x41', 'x45', 'x43', 'x13'], 'k': 4, 'n': 32, '_time': 0.0002913475036621094, '_task': 'basic_procedural...
sort
instruct
0
Copy the sequence exactly. (SEQUENCE) x50 x43 x37 x58 x17 x24 x61 x9 x26 x39 x18 x64 x33 x4 x45 x13 x56 x39 x22 x5 x2 x40 x13 x18 x22 x22 x49 x51 x21 x56 x22 x11
x50 x43 x37 x58 x17 x24 x61 x9 x26 x39 x18 x64 x33 x4 x45 x13 x56 x39 x22 x5 x2 x40 x13 x18 x22 x22 x49 x51 x21 x56 x22 x11
{'task': 'identity', 'seq': ['x50', 'x43', 'x37', 'x58', 'x17', 'x24', 'x61', 'x9', 'x26', 'x39', 'x18', 'x64', 'x33', 'x4', 'x45', 'x13', 'x56', 'x39', 'x22', 'x5', 'x2', 'x40', 'x13', 'x18', 'x22', 'x22', 'x49', 'x51', 'x21', 'x56', 'x22', 'x11'], 'k': 4, 'n': 32, '_time': 0.0004134178161621094, '_task': 'basic_proce...
identity
instruct
0
Return the unique elements of the sequence in order of first appearance. (SEQUENCE) x18 x50 x7 x62 x5 x29 x30 x12 x52 x20 x60 x2 x13 x47 x2 x15 x7 x10 x42 x44 x59 x58 x48 x7 x44 x14 x56 x56 x16 x15 x61 x58
x18 x50 x7 x62 x5 x29 x30 x12 x52 x20 x60 x2 x13 x47 x15 x10 x42 x44 x59 x58 x48 x14 x56 x16 x61
{'task': 'set', 'seq': ['x18', 'x50', 'x7', 'x62', 'x5', 'x29', 'x30', 'x12', 'x52', 'x20', 'x60', 'x2', 'x13', 'x47', 'x2', 'x15', 'x7', 'x10', 'x42', 'x44', 'x59', 'x58', 'x48', 'x7', 'x44', 'x14', 'x56', 'x56', 'x16', 'x15', 'x61', 'x58'], 'k': 4, 'n': 32, '_time': 0.0002799034118652344, '_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) x24 x27 x54 x4 x20 x30 x30 x56 x40 x44 x35 x5 x33 x15 x36 x18 (B) x19 x28 x39 x42 x48 x32 x20 x62 x8 x12 x60 x59 x5 x63 x10 x60
x24 x27 x54 x4 x20 x30 x56 x40 x44 x35 x5 x33 x15 x36 x18 x19 x28 x39 x42 x48 x32 x62 x8 x12 x60 x59 x63 x10
{'task': 'union', 'seq': [['x24', 'x27', 'x54', 'x4', 'x20', 'x30', 'x30', 'x56', 'x40', 'x44', 'x35', 'x5', 'x33', 'x15', 'x36', 'x18'], ['x19', 'x28', 'x39', 'x42', 'x48', 'x32', 'x20', 'x62', 'x8', 'x12', 'x60', 'x59', 'x5', 'x63', 'x10', 'x60']], 'k': 4, 'n': 32, '_time': 0.00030040740966796875, '_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 x47; POP; PUSH x50; POP; PUSH x38; PUSH x21; PUSH x2; PUSH x15; POP; POP; PUSH x33; PUSH x11; PUSH x63; PUSH x7; PUSH x27; PUSH x41; PUSH x32; PUSH x36; P...
x11 x33 x21 x38
{'task': 'stack', 'seq': ['PUSH x47', 'POP', 'PUSH x50', 'POP', 'PUSH x38', 'PUSH x21', 'PUSH x2', 'PUSH x15', 'POP', 'POP', 'PUSH x33', 'PUSH x11', 'PUSH x63', 'PUSH x7', 'PUSH x27', 'PUSH x41', 'PUSH x32', 'PUSH x36', 'PUSH x29', 'POP', 'PUSH x33', 'PUSH x29', 'POP', 'POP', 'POP', 'POP', 'POP', 'POP', 'POP', 'PUSH x2...
stack
instruct
0
Copy the sequence exactly. (SEQUENCE) x40 x39 x16 x51 x40 x51 x8 x15 x29 x58 x57 x4 x51 x62 x11 x19 x39 x22 x46 x45 x59 x58 x21 x32 x36 x46 x9 x48 x47 x62 x9 x48
x40 x39 x16 x51 x40 x51 x8 x15 x29 x58 x57 x4 x51 x62 x11 x19 x39 x22 x46 x45 x59 x58 x21 x32 x36 x46 x9 x48 x47 x62 x9 x48
{'task': 'identity', 'seq': ['x40', 'x39', 'x16', 'x51', 'x40', 'x51', 'x8', 'x15', 'x29', 'x58', 'x57', 'x4', 'x51', 'x62', 'x11', 'x19', 'x39', 'x22', 'x46', 'x45', 'x59', 'x58', 'x21', 'x32', 'x36', 'x46', 'x9', 'x48', 'x47', 'x62', 'x9', 'x48'], 'k': 4, 'n': 32, '_time': 0.0004124641418457031, '_task': 'basic_proce...
identity
instruct
0
Delete the first occurrence of TARGET from SEQUENCE. If TARGET is absent, return SEQUENCE unchanged. (SEQUENCE) x3 x4 x22 x34 x47 x23 x26 x25 x13 x13 x58 x23 x37 x9 x6 x40 x11 x11 x33 x23 x49 x36 x10 x48 x52 x45 x26 x17 x25 x39 x25 x24 (TARGET) x33
x3 x4 x22 x34 x47 x23 x26 x25 x13 x13 x58 x23 x37 x9 x6 x40 x11 x11 x23 x49 x36 x10 x48 x52 x45 x26 x17 x25 x39 x25 x24
{'task': 'delete', 'seq': [['x3', 'x4', 'x22', 'x34', 'x47', 'x23', 'x26', 'x25', 'x13', 'x13', 'x58', 'x23', 'x37', 'x9', 'x6', 'x40', 'x11', 'x11', 'x33', 'x23', 'x49', 'x36', 'x10', 'x48', 'x52', 'x45', 'x26', 'x17', 'x25', 'x39', 'x25', 'x24'], 'x33'], 'k': 4, 'n': 32, '_time': 0.0002899169921875, '_task': 'basic_p...
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 o3 o1 c1 c3 c0 o3 c3 o3 o2 o2 c2 o1 o1 o3 o0 c0 o0 c0 o3 o1 o1 c1 c1 c3 c3 c1 c1 c2 c3
{'task': 'dyck', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0002541542053222656, '_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) x33 x51 x10 x54 x19 x45 x22 x63 x24 x15 x14 x26 x47 x64 x59 x62 x37 x5 x41 x2 x33 x3 x32 x59 x37 x19 x62 x33 x52 x57 x59 x60
x33 x51 x10 x54 x19 x45 x22 x63 x24 x15 x14 x26 x47 x64 x59 x62 x37 x5 x41 x2 x33 x3 x32 x59 x37 x19 x62 x33 x52 x57 x59 x60
{'task': 'identity', 'seq': ['x33', 'x51', 'x10', 'x54', 'x19', 'x45', 'x22', 'x63', 'x24', 'x15', 'x14', 'x26', 'x47', 'x64', 'x59', 'x62', 'x37', 'x5', 'x41', 'x2', 'x33', 'x3', 'x32', 'x59', 'x37', 'x19', 'x62', 'x33', 'x52', 'x57', 'x59', 'x60'], 'k': 4, 'n': 32, '_time': 0.00024366378784179688, '_task': 'basic_pro...
identity
instruct
0
Return the ordered union of the two sequences: keep each token the first time it appears while scanning A then B. (A) x55 x2 x13 x1 x46 x15 x18 x34 x46 x28 x14 x30 x20 x51 x29 x46 (B) x59 x54 x22 x64 x3 x10 x20 x34 x23 x21 x42 x50 x54 x12 x25 x45
x55 x2 x13 x1 x46 x15 x18 x34 x28 x14 x30 x20 x51 x29 x59 x54 x22 x64 x3 x10 x23 x21 x42 x50 x12 x25 x45
{'task': 'union', 'seq': [['x55', 'x2', 'x13', 'x1', 'x46', 'x15', 'x18', 'x34', 'x46', 'x28', 'x14', 'x30', 'x20', 'x51', 'x29', 'x46'], ['x59', 'x54', 'x22', 'x64', 'x3', 'x10', 'x20', 'x34', 'x23', 'x21', 'x42', 'x50', 'x54', 'x12', 'x25', 'x45']], 'k': 4, 'n': 32, '_time': 0.00045013427734375, '_task': 'basic_proce...
union
instruct
0
Return the unique elements of the sequence in order of first appearance. (SEQUENCE) x10 x64 x44 x20 x48 x42 x15 x41 x58 x23 x44 x27 x55 x1 x22 x20 x58 x9 x60 x60 x16 x42 x26 x53 x14 x35 x29 x13 x22 x28 x12 x17
x10 x64 x44 x20 x48 x42 x15 x41 x58 x23 x27 x55 x1 x22 x9 x60 x16 x26 x53 x14 x35 x29 x13 x28 x12 x17
{'task': 'set', 'seq': ['x10', 'x64', 'x44', 'x20', 'x48', 'x42', 'x15', 'x41', 'x58', 'x23', 'x44', 'x27', 'x55', 'x1', 'x22', 'x20', 'x58', 'x9', 'x60', 'x60', 'x16', 'x42', 'x26', 'x53', 'x14', 'x35', 'x29', 'x13', 'x22', 'x28', 'x12', 'x17'], 'k': 4, 'n': 32, '_time': 0.00027871131896972656, '_task': 'basic_procedu...
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 o3 o3 c3 o1 c3 o2 c1 c2 o1 c1 o3 o0 o0 o3 c0 c3 c0 o3 o1 c1 c3 c3 o1 c1 o2 c2 o2 o0 c0 c2
{'task': 'dyck_shuffle', 'seq': [], 'k': 4, 'n': 32, '_time': 0.0003032684326171875, '_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