task stringclasses 54
values | level int64 0 6 | prompt stringlengths 39 8.45k | options listlengths 2 13 | option_scores listlengths 2 13 | label int64 0 12 | answer stringlengths 1 3.52k | id stringlengths 32 32 |
|---|---|---|---|---|---|---|---|
multistep_abduction | 0 | Premise:
[0] bruno helps alice.
[1] bruno is trained.
[2] For all x, y, if x helps y and y is trusted, then x is verified.
[3] Every verified entity is careful.
Hypothesis:
bruno is careful.
Candidate Facts:
[0] david is approved.
[1] alice is active.
[2] alice is trusted.
[3] bruno is trusted.
[4] alice is not trust... | [
"4",
"0",
"3",
"1",
"5",
"2"
] | [
0,
0,
0,
0,
0,
1
] | 5 | 2 | 34dd1530e1aacce7cf4ef6359ae36b74 |
finite_automaton_execution | 0 | States:
states 0..4, start state 4, accepting states {1, 2, 3, 4}
Alphabet:
{a, b}
Transitions:
state 0: on a -> {3, 4}; on b -> {0}
state 1: on a -> {1}; on b -> {2}
state 2: on a -> {3}; on b -> {3}
state 3: on a -> {2, 4}; on b -> {1, 4}
state 4: on a -> {0, 3}; on b -> {1, 2}
Word:
the input word is 'bbbba' (len... | [
"2",
"3",
"1",
"4",
"5",
"0"
] | [
1,
0,
0,
0,
0,
0
] | 0 | 2 | 481d95af3b23d71d7bd7ff156e9f886b |
parsing_derivation | 2 | (START)
start
(GRAMMAR)
R0: expr -> '[' seq ']'
R1: start -> seq
R2: expr -> '(' seq ')'
R3: seq -> expr seq
R4: seq ->
R5: expr -> '<' seq '>'
(STRING)
< ( ) < > ( ) >
(QUESTION)
The answer is the rule labels used in the leftmost derivation of STRING, in order, separated by spaces. | [
"R1 R3 R4 R3 R5 R3 R2 R0 R0 R0 R0",
"R2 R5 R4 R5 R1 R3 R5 R1 R3 R3 R5 R1 R3 R3",
"R1 R5 R2 R5 R0 R3 R3 R5 R4 R3 R3",
"R1 R3 R5 R3 R2 R4 R3 R5 R4 R3 R2 R4 R4 R4",
"R5 R4 R1 R4 R3 R2 R2 R4 R1 R2 R2",
"R2 R1 R3 R5 R1 R4 R5 R1 R3 R5 R5",
"R2 R4 R0 R5 R4 R3 R5 R4 R1 R5 R5",
"R1 R4 R5 R0 R4 R3 R4 R2 R0 R0 R... | [
0.5825714285714287,
0.55,
0.5825714285714287,
1,
0.5105714285714286,
0.5105714285714286,
0.5105714285714286,
0.5645161290322581,
0.6225806451612903,
0.48571428571428577,
0.5645161290322581,
0.6142857142857142,
0.48571428571428577
] | 3 | R1 R3 R5 R3 R2 R4 R3 R5 R4 R3 R2 R4 R4 R4 | 147aa794b7ee94c135d01944426cf652 |
rule_switching | 1 | Maintain the register values while executing the program. The current mode determines each opcode's meaning. For an instruction on registers (a,b,c): rotate-left maps their values to (b,c,a); rotate-right to (c,a,b); swap-first-two to (b,a,c); swap-last-two to (a,c,b); and swap-outer to (c,b,a). Mode changes affect fol... | [
"D",
"A",
"B",
"C",
"E"
] | [
0,
0,
1,
0,
0
] | 2 | B | 96acadcb9bc8d125a7f9615dd5431651 |
logic_derivation | 1 | Premise:
0: Bruno is delta tagged.
1: Bruno is charlie tagged.
2: Bruno is echo tagged.
3: Alice is gamma-linked to David.
4: If a person is delta tagged and charlie tagged, then that person is alpha tagged.
5: Anyone who is alpha tagged and echo tagged is bravo tagged.
6: For all x, if x is charlie tagged and x is gam... | [
"3: 0 1 => Alice is alpha tagged\n4: @0 2 => Alice is bravo tagged\n6: 2 @1 => Alice is not echo tagged",
"4: 0 1 => Bruno is alpha tagged\n5: @0 2 => Bruno is bravo tagged\n9: 2 1 => Bruno is foxtrot tagged\n8: @1 @2 => Bruno is not gamma tagged",
"3: 0 1 => Bruno is gamma-linked to Bruno\n4: @0 => Bruno is br... | [
0,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0
] | 1 | 4: 0 1 => Bruno is alpha tagged
5: @0 2 => Bruno is bravo tagged
9: 2 1 => Bruno is foxtrot tagged
8: @1 @2 => Bruno is not gamma tagged | 9b1b10dbc5509352b3de1d84d39e5760 |
defeasible_nli | 1 | An `unless` condition must be shown to block its rule.
Facts:
David is alpha-tagged and foxtrot-tagged.
Elena is alpha-tagged, bravo-tagged, foxtrot-tagged, gamma-tagged, and lambda-tagged.
Clara is delta-tagged.
Alice is gamma-tagged.
Bruno is charlie-tagged.
David is alpha-linked to Elena.
David is alpha-linked to B... | [
"Yes",
"Maybe",
"No"
] | [
0,
1,
0
] | 1 | Maybe | 3c4cef41a3060c09a23e4a53fdee53cd |
qualitative_reasoning | 3 | There are 8 entities labeled 0 through 7.
Read 'i rel j' as 'entity i is rel to entity j'.
Facts:
- 1 before 3
- 4 contains 1
- 2 overlapped-by 4
- 0 before 3
- 6 equals 2
- 7 before 2
- 5 contains 2
- 1 meets 2
- 1 meets 6
- 2 meets 3
- 0 starts 4
- 0 before 2
What is the relation of the horizontal extent of box 6 to... | [
"met-by",
"finished-by",
"overlapped-by",
"during",
"before",
"contains",
"started-by",
"overlaps",
"equals",
"starts",
"meets",
"finishes",
"after"
] | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
1
] | 12 | after | 77a9c5e7caf4bd9f6f93cf7720ce03f8 |
process_inversion | 0 | Jar A starts with an unknown number of cards. Then:
Step 1: 6 cards were added to jar A.
Step 2: the count in jar A was cut to a third.
Step 3: the count in jar A was doubled.
At the end, jar A holds 10.
How many cards were in jar A right after step 2? Answer with a number. | [
"3",
"5",
"7",
"25",
"6",
"8",
"9",
"45",
"15",
"0",
"2",
"1",
"4"
] | [
0,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0
] | 1 | 5 | f0d8e107df007ae402bd65d21d857653 |
set_missing_element | 2 | Answer with the missing elements in the ordered span of ['2021-12-14', '2021-12-20', '2021-12-11', '2021-12-17', '2021-12-19', '2021-12-09', '2021-12-16', '2021-12-21', '2021-12-13', '2021-12-12', '2021-12-18', '2021-12-15', '2021-12-10'] as a Python set. | [
"{15, 17}",
"{}",
"{17}"
] | [
0,
1,
0
] | 1 | {} | f75d33a5704a1fbdb1b27bffa1e6e43a |
set_missing_element | 2 | Answer with the missing elements in the ordered span of ['2021-02-22', '2021-02-23', '2021-02-13', '2021-02-17', '2021-02-21', '2021-02-19', '2021-02-20', '2021-02-18', '2021-02-16', '2021-02-24', '2021-02-15', '2021-02-25', '2021-02-14', '2021-02-26'] as a Python set. | [
"{}",
"{23, 26}"
] | [
1,
0
] | 0 | {} | f13312bb4385660a92f133de821c2c47 |
unification_entailment | 4 | Compute a most general unifier of the equations. Apply it to both sides of the candidate equality. Answer Yes if the instantiated candidate terms are identical, otherwise answer No. The equations are guaranteed to be unifiable.
Equations:
- h(p(x21, x2), x25) = h(p(h(x5, x5), f(x15)), x25)
- r(p(x14, x10), x13, x21) =... | [
"Yes",
"No"
] | [
0,
1
] | 1 | No | 8f6ec9fbd583c3dab7f3565b274bb635 |
lambda_reduction | 0 | Reduce the following untyped λ-term to β-normal form.
Syntax: `\x.body` is λx.body; juxtaposition is left-associative application; free identifiers are constants.
Term: (((\v0.((\v1.((\v2.v0) v1)) (v0 (v0 d)))) ((\v0.(\v1.(\v1.(v0 v1)))) v1)) b)
The answer is the β-normal form (compared up to α-equivalence). | [
"(\\x0.(v1 x0))",
"(\\x0.(a (\\x1.(v1 x1))))",
"(\\x0.(d a))",
"(\\x0.(v2 c))",
"(d (\\x0.x0))",
"(\\x0.(v1 (\\x1.v1)))",
"(\\x0.(v1 v1))",
"(\\x0.x0)",
"(\\x0.(d c))",
"(v1 (d (\\x0.(v1 (d x0)))))",
"(\\x0.(x0 x0))",
"(\\x0.(v1 (\\x1.c)))",
"(\\x0.(\\x1.c))"
] | [
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0
] | 0 | (\x0.(v1 x0)) | 06c7f3663ff1ec93c8e1072eab648c0c |
most_probable_evidence | 3 | Factor b is independently true with probability 0.4.
Factor d is independently true with probability 0.7.
Factor e is independently true with probability 0.8.
Factor f is independently true with probability 0.4.
The observation holds exactly when not ((if (if (factor d and factor f is false), then (factor b or factor e... | [
"1 3 4 7",
"0 3 4 6",
"1 3 4 6 8",
"0 2 4 7",
"1 3 5 7 8",
"1 2 4 7 8",
"1 3 4 6",
"1 3 4 7 8",
"1 3 5 7",
"0 3 4 7 8",
"0 3 4 7",
"1 3 5 6",
"1 2 4 7"
] | [
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0
] | 0 | 1 3 4 7 | f009fe02d9ba183ff3a68dfbefb66223 |
code_analysis | 1 | Program:
```python
import random
x, locked = 0, False
def step():
global x, locked
if (not locked) or (x >= 1):
x = 0 if locked else x
locked = random.choice([False, True])
elif x != 1:
x = random.choice([0, 1])
locked = random.choice([False, True])
else:
x = (x... | [
"[(1, 1, False)]",
"[(0, 1), (0, 0), (1, 0)]",
"[(1, False, True), (1, True, True)]",
"[(0, False), (0, True), (1, False), (1, True)]",
"[(0, 1)]",
"[(0, False), (1, False)]",
"[(0, 1, 0), (1, 0, 0), (1, 0, 1)]",
"[(0, 2), (1, 2), (2, 2)]",
"[(0, False), (1, False), (1, True)]",
"[(0, 1, 1), (1, 2... | [
0,
0,
0,
0,
0,
1,
0,
0,
0,
0,
0,
0
] | 5 | [(0, False), (1, False)] | b7e58c9c9c40b7c9e648cb90ec4a5713 |
metamath_entailment | 0 | Which premise set makes the conjecture follow using only the listed rules?
Exactly one of A and B is sufficient.
Rules instantiate only by renaming variables.
The answer is A or B.
Premise Set A:
1. ctx => P2(x, y)
2. P2(z, x)
3. P2(x, y)
4. ctx => P2(y, u)
Premise Set B:
1. ctx => P2(x, y)
2. P2(u, x)
3. P2(x, y)
4.... | [
"B",
"A"
] | [
1,
0
] | 0 | B | 08c8a0b7b4864658f2dbe3778fd3bfeb |
set_missing_element | 1 | Answer with the missing elements in the ordered span of [436, 442, 441, 435, 437, 434] as a Python set. | [
"{236, 237, 238}",
"{548, 550}",
"{136, 139}",
"{438, 439, 440}",
"{401, 402, 404}",
"{547, 548, 549}",
"{543, 546, 547}",
"{388, 393, 394}",
"{475, 476, 477}",
"{38, 42, 43}",
"{593, 595, 596}",
"{462, 463, 467}",
"{478, 479}"
] | [
0,
0,
0,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0
] | 3 | {438, 439, 440} | c36c898087e7344fc9005bf2a4ceb9d4 |
multistep_nli | 1 | Premise:
elena is a parent of bruno.
clara is a parent of david.
david is minor.
clara is not female.
david is trusted.
Whenever x is a parent of y, x is an ancestor of y.
If one person is a parent of a second person, and the second is an ancestor of a third person, then the first is an ancestor of the third.
Whenever ... | [
"No",
"Maybe",
"Yes"
] | [
0,
1,
0
] | 1 | Maybe | 434e5363421c7aad871d4d2b07f5af15 |
set_expression | 6 | B = {'two hundred and fifty-five', 'two hundred and sixty-seven', 'two hundred and ninety-four', 'forty', 'two hundred and five', 'three hundred and eighteen', 'seventy-eight', 'one hundred and eighty-eight', 'two hundred and sixty-one', 'fifty-three', 'three hundred', 'sixty-two', 'three hundred and twenty-six', 'thre... | [
"3",
"82",
"36",
"2",
"38",
"28",
"42",
"37",
"29",
"93",
"33",
"32",
"34"
] | [
0.03333333333333333,
0.0196078431372549,
0.2,
0.03225806451612903,
0.14285714285714285,
0.2,
0.09090909090909091,
0.16666666666666666,
0.25,
0.016129032258064516,
0.5,
1,
0.3333333333333333
] | 11 | 32 | 053c0afc001f4cdc60eb6f9a52534519 |
equation_system | 3 | Solve the following system of equations for the variable 'X4'.
System:
-112*X1 - 224*X2 - 614*X3 - 781*X4 + 383*X5 - 2662 = 0
-7*X1 - 13*X2 - 42*X3 - 43*X4 + 20*X5 - 144 = 0
-7*X1 - 14*X2 - 38*X3 - 48*X4 + 24*X5 - 172 = 0
2*X1 + 4*X2 + 10*X3 + 14*X4 - 7*X5 + 47 = 0
X4 - 7 = 0
17*X1 + 35*X2 + 90*X3 + 124*X4... | [
"7",
"14",
"17",
"13",
"24",
"-2",
"4",
"2",
"20",
"10",
"-17"
] | [
1,
0.00015846132511575126,
0.000003726653172078671,
0.0005530843701478336,
5.905303998944039e-10,
0.00001300729765406762,
0.023517745856009107,
0.0019304541362277093,
8.764248219443636e-8,
0.023517745856009107,
9.357622968840175e-14
] | 0 | 7 | 9ab108bba7107614e9be06121488d805 |
finite_automaton_execution | 2 | States:
states 0..8, start state 8, accepting states {0, 1, 3, 4, 5, 7, 8}
Alphabet:
{a, b}
Transitions:
state 0: on a -> {0}; on b -> {2}
state 1: on a -> {1, 4}; on b -> {7}
state 2: on a -> {4}; on b -> {2}
state 3: on a -> {0, 8}; on b -> {6}
state 4: on a -> {6, 7}; on b -> {7}
state 5: on a -> {5}; on b -> {7}
... | [
"7",
"2",
"8",
"5",
"6",
"3",
"4",
"0",
"1",
"9"
] | [
0,
0,
0,
0,
0,
1,
0,
0,
0,
0
] | 5 | 3 | b19a1446c74ddbab1101d8b8f2e9e140 |
unification_entailment | 3 | Compute a most general unifier of the equations. Apply it to both sides of the candidate equality. Answer Yes if the instantiated candidate terms are identical, otherwise answer No. The equations are guaranteed to be unifiable.
Equations:
- h(x5, x9) = h(g(x1), x9)
- r(x2, x5, x17) = r(g(x3), x18, f(c))
- q(x6, x2, x0... | [
"Yes",
"No"
] | [
1,
0
] | 0 | Yes | 0b4500ab05db0cff1e259ac218ada405 |
game_best_move | 4 | In this graph game, choose player's best move. Player chooses on player turns; opponent chooses on opponent turns. Opponent minimizes player score.
Start: n3. Turns alternate player, opponent. Move along one edge per turn, for at most 4 moves. Play ends upon reaching a leaf or the move horizon; in either case, player'... | [
"n2",
"n1",
"n4",
"n5",
"n8",
"n10",
"n7",
"n3",
"n9",
"n6"
] | [
0,
0,
0,
0,
0,
1,
0,
0,
0,
0
] | 5 | n10 | 35a8de503a4af950b1602c3fdfef7403 |
planar_geometry_relations | 0 | Given points: E=(-5, -1); M=(1, -3); P=(-4, 2); U=(-5, -3); V=(5, -3); W=(0, 4); Z=(0, -6).
Question: Order points W, Z, U, M by increasing x-coordinate, breaking ties by increasing y-coordinate.
Answer with comma-separated labels, for example A,C,B,D. | [
"U,Z,W,M",
"U",
"C,A,B,W",
"U,Y,P,C"
] | [
1,
0,
0,
0
] | 0 | U,Z,W,M | 1983f4f138fbdcfc67dc024146245a46 |
logic_derivation | 1 | Premise:
0: Bruno is beta-linked to David.
1: David is gamma-linked to Elena.
2: David is not foxtrot tagged.
3: Alice is gamma tagged.
4: Alice is not delta-related to David.
5: If one person is beta-linked to a second person, and the second is gamma-linked to a third person, then the first is delta-related to the thi... | [
"5: 0 1 => Bruno is charlie tagged\n7: 2 @0 => Bruno is not delta tagged",
"4: 0 1 => Bruno is charlie tagged\n5: @0 => Bruno is foxtrot tagged\n7: @0 @1 => Bruno is gamma tagged",
"7: 1 0 => Bruno is delta tagged\n5: 2 @0 => Bruno is not charlie tagged",
"5: 0 1 => Bruno is delta-related to Elena\n6: @0 => B... | [
0,
0,
0,
1,
0
] | 3 | 5: 0 1 => Bruno is delta-related to Elena
6: @0 => Bruno is foxtrot tagged
7: @0 @1 => Elena is charlie tagged | 6aca1c62b56a14dc08c1dbf5eda6fa72 |
multistep_abduction | 1 | Premise:
[0] clara checks bruno.
[1] alice is trained.
[2] alice is not alert.
[3] clara does not stand in the helps relation to bruno.
[4] If a person checks a approved person, then that person is careful.
[5] Being careful implies being trained.
Hypothesis:
clara is trained.
Candidate Facts:
[0] bruno is approved.
... | [
"2",
"1",
"4 7",
"7",
"0 1",
"3",
"5",
"0 4",
"0",
"0 5",
"4",
"2 3",
"6"
] | [
0,
0,
0,
0,
0,
0,
0,
0,
1,
0,
0,
0,
0
] | 8 | 0 | d6fb472721f9d1b7a500af3341986e9a |
analogical_case_matching | 4 | Which case can be embedded into Query? A case matches when every fact maps to a Query fact under one-to-one entity and relation renaming, with an optional consistent direction reversal for each relation. Query may contain additional facts. Answer with its ID.
M0: a alpha h, c alpha e, e beta d, f beta a, f beta b, g b... | [
"M0",
"M4",
"M6",
"M5",
"M3",
"M1",
"M2"
] | [
1,
0,
0,
0,
0,
0,
0
] | 0 | M0 | 2068dda1e76c3873544f2beba581ee4a |
most_probable_evidence | 1 | Factor d is independently true with probability 0.9.
Factor e is independently true with probability 0.1.
Factor f is independently true with probability 0.6.
The observation holds exactly when ((factor d is false or factor e) and (factor d or not (factor f))).
We observe it.
Which hidden fact values form the most prob... | [
"1 2 4",
"0 2 5 6",
"0 3 4 6",
"1 2 5",
"1 3 4 6",
"0 3 4",
"0 2 5",
"1 2 5 6",
"0 2 4",
"0 2 4 6",
"1 3 4",
"0 3 5",
"1 2 4 6"
] | [
0,
0,
0,
0,
0,
0,
0,
0,
1,
0,
0,
0,
0
] | 8 | 0 2 4 | cc35f95a039baac9db669590d1510a95 |
planar_geometry_relations | 4 | Given points: A=(-6, 8); B=(2, -7); C=(416/7, -60/7); M=(412/7, -12); N=(-9, -5); O=(436/7, -88/7); U=(-8, -8); Y=(7, -9); Z=(-2, -8).
Definitions: X is the 90-degree counterclockwise rotation of B about A. H is the translation of U by vector XB. R is the 90-degree counterclockwise rotation of H about X. G is the inter... | [
"parallel",
"perpendicular",
"L,R,U,F",
"neither"
] | [
1,
0,
0,
0
] | 0 | parallel | 8ba5e948d892e407af51f1ded8cafb45 |
defeasible_nli | 3 | An `unless` condition must be shown to block its rule.
Facts:
David is alpha-tagged and foxtrot-tagged.
Alice is alpha-tagged, delta-tagged, foxtrot-tagged, gamma-tagged, and lambda-tagged.
Clara is charlie-tagged.
George is delta-tagged and not kappa-tagged.
Elena is alpha-tagged.
David is alpha-linked to Alice.
Fara... | [
"Maybe",
"No",
"Yes"
] | [
0,
1,
0
] | 1 | No | ecb94bb2e20f9edefc9a6ad585e0a29a |
game_forced_win | 3 | In this graph game, decide whether player can force a win. Player chooses on player turns; opponent chooses on opponent turns. Opponent minimizes player score. A win means final player score is greater than 50.
Start: n0. Turns alternate player, opponent. Move along one edge per turn, for at most 4 moves. Play ends up... | [
"Yes",
"No"
] | [
0,
1
] | 1 | No | e4dcce0610a04ac7c007f80e6f3ef047 |
multistep_evidence_retrieval | 0 | Premise:
[0] If one person is inside a second person, and the second is inside a third person, then the first is inside the third.
[1] If one person is inside another, then the second contains the first.
[2] Whenever x is not above y, y is not below x.
[3] lamp is inside map.
[4] map is inside key.
Hypothesis:
key con... | [
"1 2 3 4",
"0 1 2 3 4",
"0 1 2 3",
"0 1 3 4",
"0 1 2 4",
"2 3 4",
"0 2 3 4"
] | [
0,
0,
0,
1,
0,
0,
0
] | 3 | 0 1 3 4 | f555d0261264da2b4b3db809fac0eb0f |
constraint_satisfaction | 4 | Each membership variable is 0 (not selected) or 1 (selected).
Constraints:
1. At most 1 of [m0 = 1; m5 = 1; m6 = 1]
2. Exactly 2 of [m1 = 1; m3 = 1; m4 = 1]
3. (At most 1 of [m0 = 1; m1 = 1; m4 = 1]) xor (m4 = 1)
4. Exactly 2 of [m3 = 1; m5 = 1]
5. At most 1 of [m2 = 1; m3 = 1; m6 = 1]
Question: Is m1 selected (1 or ... | [
"3",
"2",
"5",
"4",
"0",
"1"
] | [
0,
0,
0,
0,
0,
1
] | 5 | 1 | 2536e99e11396f994c58843250b10b42 |
set_expression | 0 | A = {7, 13, 31, 32, 26, 20}
B = {20, 31, 24, 12, 30, 29}
Evaluate (B - A). | [
"{12, 24, 29, 30}",
"[13, 20]"
] | [
1,
0
] | 0 | {12, 24, 29, 30} | b0ef22dd2ab1bb4147380445206b6134 |
most_probable_evidence | 0 | Factor b is independently true with probability 0.1.
Factor c is independently true with probability 0.3.
Factor e is independently true with probability 0.2.
The observation holds exactly when (factor b or (not (factor c) and factor e)).
We observe it.
Which hidden fact values form the most probable complete explanati... | [
"1 2 4",
"0 3 4",
"0 3 5",
"0 2 4",
"0 2 5",
"1 3 4",
"0 2",
"1 3 5",
"0 3",
"1 3",
"1 2",
"1 2 5"
] | [
0,
0,
0,
0,
0,
0,
0,
1,
0,
0,
0,
0
] | 7 | 1 3 5 | 13c72ecd912092346cbb452dcbd7b779 |
qualitative_causal_reasoning | 1 | Assume linear causal relations, independent noise, and no exact cancellations.
- X3 directly increases X7.
- X5 directly decreases X2.
- X5 directly decreases X4.
- X5 directly decreases X9.
- X6 directly increases X1.
- X7 directly increases X0.
- X7 directly increases X9.
- X8 directly decreases X2.
- X8 directly de... | [
"decrease",
"increase",
"ambiguous",
"associated",
"independent",
"no_association"
] | [
0,
0,
0,
0,
0,
1
] | 5 | no_association | 057df389d5f8d873d8c798549498a36d |
analogical_case_matching | 6 | Which case can be embedded into Query? A case matches when every fact maps to a Query fact under one-to-one entity and relation renaming, with an optional consistent direction reversal for each relation. Query may contain additional facts. Answer with its ID.
M0: e alpha d, f alpha j, i alpha h, j beta c, k beta i, c ... | [
"M7",
"M0",
"M1",
"M8",
"M4",
"M3",
"M6",
"M5",
"M2"
] | [
1,
0,
0,
0,
0,
0,
0,
0,
0
] | 0 | M7 | a6b03aa8722d128ba3097d17bdb122d0 |
regex_reasoning | 5 | A = ((((a*)d*e*?)))
B = a*d*e*
Do A and B accept exactly the same set of strings?
The answer is Yes or No. | [
"b",
"e",
"d",
"Yes",
"a",
"No"
] | [
0,
0,
0,
1,
0,
0
] | 3 | Yes | 14d02effccec4ba9448a57599d5d9d44 |
string_transduction | 4 | String: fdeefebbecaeccef
Operations:
- sort descending
- sort ascending
- rotate left by 7
- dedupe adjacent repeats
- caesar shift by 2
- caesar shift by 24
Answer with the final string. | [
"bddd",
"fhbcde",
"edfdcefagdcbab",
"efabcd",
"bd",
"eedfeeafggabfdgd",
"edfefbecfgbedae",
"ef",
"fddd",
"cefgbadebbcacddac",
"gfda",
"efhi",
"feefacafedfegb"
] | [
0.16666666666666663,
0.5,
0.2857142857142857,
1,
0.33333333333333337,
0.3125,
0.33333333333333337,
0.33333333333333337,
0.33333333333333337,
0.3529411764705882,
0.16666666666666663,
0.33333333333333337,
0.2857142857142857
] | 3 | efabcd | 7a33aeac7aacff0a600ae08eba115151 |
function_manipulation | 4 | Let $s(x)=-1 - \frac{2}{3}\left(x+\frac{11}{3}\right)$.
Define $h(x)=\frac{d}{dx}\left(s\left(\frac{d}{dx}\left(\frac{d}{dx}\left(\left(\log\left(1+\left(\left(\left(x\right)-\left(2\left(x-2\right)\right)\right)-2\right)\right)\right)\left(1 + \frac{4}{3}\left(x-2\right)\right)\right)\right)\right)\right)$.
Compute $h... | [
"-3",
"-2/3*x^2 + 4*x + 3",
"2",
"-4",
"-4/3",
"1/4",
"4",
"4/3",
"-2",
"3"
] | [
0,
0,
0,
0,
0,
0,
1,
0,
0,
0
] | 6 | 4 | 20a8875c44e1fe6a817927fb6a9f363b |
equation_system | 4 | Solve the following system of equations for the variable 'X6'.
System:
4*X1 - 20*X2 + X3 + 6*X6 - 377 = 0
-4*X1 + 3*X2 + 10*X3 + X4 - X5 - 13*X6 + 115 = 0
71*X1 - 97*X2 - 30*X3 - 13*X4 + 9*X5 + 93*X6 - 1339 = 0
-4*X1 + 5*X2 - 3*X3 + 12 = 0
12*X1 - 14*X2 + 6*X3 - 2*X4 + X5 + 4*X6 - 44 = 0
-X1 + 6*X2 - 2*X6 ... | [
"-9",
"-7",
"18",
"8",
"-3",
"-2",
"-5",
"-8",
"-18",
"-1",
"28",
"-6",
"-28"
] | [
0.32919298780790557,
0.32919298780790557,
2.8425948654473276e-13,
1.901994297910288e-8,
0.0038659201394728076,
0.001272633801339809,
0.03567399334725241,
1,
0.000014945338524781451,
0.0004189421234483841,
4.248354255291589e-18,
0.10836802322189586,
2.233631436203166e-10
] | 7 | -8 | 2389c37a9ed2064e368adcb76f5e1459 |
multistep_evidence_retrieval | 4 | Premise:
[0] Anyone who is alert and trusted is not approved.
[1] For all x, if x is trusted and x is alert, then x is trained.
[2] From x is quiet and x is alert, it follows that x is trusted.
[3] If a person is eligible and skilled, then that person is quiet.
[4] If a person is verified and active, then that person i... | [
"0 4 6 9 10 13",
"2 3 4 6 9 13",
"3 4 6 9 11 12",
"1 4 6 8 10 14",
"2 4 9 10 13 14",
"0 3 5 9 10 13",
"0 4 8 9 11 13",
"3 4 6 9 11 14",
"1 2 6 9 10 14",
"0 6 8 9 10 11",
"0 1 6 9 12 13",
"1 2 5 9 10 13",
"0 4 5 6 10 13"
] | [
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0
] | 0 | 0 4 6 9 10 13 | 16cf0941d8926cf641c18863221467d4 |
planning | 1 | Initial true facts: active(amber), dry(coral), fixed(harbor), marked(linen), stable(coral). All other facts are false.
Actions (preconditions -> effects; !fact means false):
guide(linen,birch): fixed(harbor),stable(coral) -> safe(amber),!active(amber),!fixed(harbor)
carry(jade,elm): open(linen),stable(coral) -> dry(ke... | [
"guide(linen,birch)\nroute(kestrel,amber)\nlift(harbor,fjord)\nrelease(linen,fjord)",
"lift(birch,linen)\nfasten(harbor,coral)\nclose(grove,indigo)\nopen(birch,fjord)",
"open(elm,kestrel)\nopen(elm,amber)\nopen(kestrel,fjord)\ncool(harbor,birch)",
"close(grove,kestrel)\nopen(fjord,harbor)\nopen(harbor,kestrel... | [
1,
0,
0,
0
] | 0 | guide(linen,birch)
route(kestrel,amber)
lift(harbor,fjord)
release(linen,fjord) | 79dc7f9e58d6afd435920783eab1bdfa |
rewrite_system | 0 | Normalize by the ordered rewrite rules. At each step, scan subterm positions outermost-first and left-to-right. Stop at the first position matched by at least one rule, then apply the earliest matching rule in the listed order (position priority first; rule priority second).
Rules:
- len(nil) -> 0
- append(cons(X,XS),... | [
"append(0,c)",
"head(nil)",
"len(0)",
"tail(0)",
"append(append(c,tail(a)),head(s(0)))",
"append(nil,head(0))",
"len(len(a))",
"s(head(a))"
] | [
1,
0,
0,
0,
0,
0,
0,
0
] | 0 | append(0,c) | b9e81abd2053763fbd3323e23c3c349e |
multistep_nli | 6 | Premise:
lamp is left of vase.
vase is left of map.
map is left of coin.
coin is left of key.
key is left of box.
box is fragile.
box is inside key.
book is right of box.
map is visible.
Whenever x is right of y, y is left of x.
From x is not left of y, it follows that y is not right of x.
Whenever x is not right of y,... | [
"Yes",
"No",
"Maybe"
] | [
0,
1,
0
] | 1 | No | a5e7482ac32fdbeffd12c6e9365d8809 |
qualitative_reasoning | 0 | There are 5 entities labeled 0 through 4.
Read 'i rel j' as 'entity i is rel to entity j'.
Facts:
- 3 after 2
- 1 overlaps 2
- 4 before 3
- 0 meets 3
- 0 started-by 4
- 0 started-by 2
- 0 overlapped-by 1
- 2 equals 4
What is the relation of the horizontal extent of box 1 to that of box 4?
The answer is exactly one of:... | [
"equals",
"after",
"before",
"finishes",
"overlaps",
"meets",
"met-by",
"during",
"starts",
"started-by",
"overlapped-by",
"finished-by",
"contains"
] | [
0,
0,
0,
0,
1,
0,
0,
0,
0,
0,
0,
0,
0
] | 4 | overlaps | c1f949c29eb707400f715f8506e28320 |
code_analysis | 6 | Program:
```python
stage, phase, active = 'done', 'hold', False
def step():
global stage, phase, active
if stage != 'retry':
phase = {'hold': 'done', 'wait': 'retry', 'fail': 'idle', 'done': 'hold', 'retry': 'wait', 'idle': 'fail'}[phase]
active, stage = bool(stage != 'idle'), {'done': 'hold', 'hol... | [
"3",
"Yes",
"2",
"5",
"[(1, 3, 'done'), (0, 1, 'done'), (3, 1, 'done'), (3, 3, 'retry'), (3, 3, 'hold'), (0, 3, 'idle')]",
"No",
"[(1, 0, True, 3), (1, 1, True, 3), (1, 2, True, 3)]",
"[(0, False, True, 0), (0, False, True, 2), (0, True, True, 0), (0, True, True, 2), (3, False, True, 0), (3, True, Tru... | [
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0
] | 0 | 3 | 34df31c437c134ae88379567cb6160ce |
game_forced_win | 1 | In this graph game, decide whether player can force a win. Player chooses on player turns; opponent chooses on opponent turns. Opponent minimizes player score. A win means final player score is greater than 50.
Start: n2. Turns alternate player, opponent. Move along one edge per turn, for at most 3 moves. Play ends up... | [
"Yes",
"No"
] | [
0,
1
] | 1 | No | f0c3ae7e7fccc50550a1c0ecadb6a921 |
most_probable_evidence | 1 | Factor a is independently true with probability 0.8.
Factor b is independently true with probability 0.1.
Factor c is independently true with probability 0.7.
Factor d is independently true with probability 0.4.
The observation holds exactly when (not ((factor c or (factor a is false or factor d is false))) or factor b... | [
"0 3 5 7",
"1 2 5 6",
"1 2 5 7",
"1 3 5 6",
"1 2 4 7",
"1 2 4",
"0 2 4 7",
"1 2 5",
"0 2 5",
"0 2 5 6",
"1 2 4 6",
"0 2 5 7",
"1 3 5 7"
] | [
0,
0,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0
] | 2 | 1 2 5 7 | 592be8b410229a5ad41c9822dcf33185 |
logic_derivation | 0 | Premise:
0: bruno helps clara.
1: clara is trained.
2: Whenever x helps y and y is trained, x is approved.
3: From x is approved, it follows that x is active.
4: For all x, y, if x trusts y, then y helps x.
Target:
bruno is active.
Give derivation lines as Rule: Input... => Deduction.
Use premise IDs and @0, @1, ... ... | [
"2: 0 1 => bruno is approved\n3: @0 => bruno is active",
"3: 0 1 => bruno is trained\n4: @0 => bruno is active",
"3: 0 1 => clara is approved\n4: @0 => clara is active"
] | [
1,
0,
0
] | 0 | 2: 0 1 => bruno is approved
3: @0 => bruno is active | 76b313b6fd5cdfcd1af6c660bb7db6f1 |
process_inversion | 1 | Jar A starts with 2 stamps. Then:
Step 1: 11 stamps were added to jar A.
Step 2: some stamps were added to jar A.
Step 3: 4 stamps were removed from jar A.
Step 4: 7 stamps were added to jar A.
At the end, jar A holds 24.
How many stamps were in jar A right after step 2? Answer with a number. | [
"29",
"2",
"12",
"18",
"82",
"11",
"1",
"15",
"20",
"21",
"24",
"10",
"42"
] | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
1,
0,
0,
0
] | 9 | 21 | d141eabbfcfa136260efdc5fd58bc136 |
rewrite_system | 2 | Normalize by the ordered rewrite rules. At each step, scan subterm positions outermost-first and left-to-right. Stop at the first position matched by at least one rule, then apply the earliest matching rule in the listed order (position priority first; rule priority second).
Rules:
- let(unit,X) -> X
- snd(pair(X,Y)) ... | [
"if(let(snd(false),pair(let(c,b),b)),fst(a),a)",
"snd(if(pair(fst(let(b,a)),a),false,pair(a,a)))",
"snd(if(if(let(c,c),true,c),true,pair(unit,c)))",
"let(fst(id(false)),pair(fst(true),b))",
"snd(if(snd(a),snd(b),pair(a,unit)))",
"fst(let(let(b,true),let(true,a)))",
"if(pair(if(unit,b,fst(pair(false,true... | [
0,
0,
0,
0,
0,
0,
1,
0,
0,
0,
0,
0,
0
] | 6 | if(pair(if(unit,b,fst(pair(false,true))),pair(true,pair(fst(true),b))),b,id(if(a,a,c))) | 84f29d2bb57319e692f07f443d9eba0d |
code_analysis | 2 | Program:
```python
import random
status, y = 'new', 0
def step():
global status, y
y, status = (y + y + 2) % 3, 'closed' if status != 'busy' else status
status = random.choice(['new', 'busy', 'closed', 'open'])
```
Start from the assignments above; each transition calls `step()`.
Each `random.choice` o... | [
"[(0, 'closed', 'open')]",
"2",
"[('closed', 'closed')]",
"Yes",
"No",
"3"
] | [
0,
0,
0,
0,
1,
0
] | 4 | No | bfe6b7a774b860b9c7cd4632381d4909 |
function_manipulation | 1 | Let $f(x)=-1 - 2\left(x+1\right) + 2\left(x+1\right)^{2}$.
Define $h(x)=\left(\left(\frac{d}{dx}\left(f\left(x\right)\right)\right)+\left(-\frac{1}{2}\left(x+1\right)\right)\right)+\left(-\frac{1}{2}\left(x+1\right)\right)$.
Compute $h'(-1)$.
The answer is a reduced rational number. | [
"13/3",
"16/3",
"1/3",
"5/3",
"2/3",
"-7/3",
"3/4",
"-3/2",
"-3",
"3/2",
"4/3",
"-1/3",
"3"
] | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
1
] | 12 | 3 | 80e24f102305fd98043b8b0887e78c62 |
equation_system | 6 | Solve the following system of equations for the variable 'X2'.
System:
90*X1 + 8*X2 - 23*X3 - 7*X4 - 97*X5 + 274*X6 - 95*X7 + 13*X8 - 2568 = 0
-25*X1 + 9*X3 + 4*X4 + 5*X5 - 57*X6 + 18*X7 - 45 = 0
-14*X1 + 6*X3 + X4 - 30*X6 + 8*X7 - 79 = 0
-95*X1 - 6*X2 + 28*X3 + 8*X4 + 74*X5 - 265*X6 + 88*X7 - 10*X8 + 1773 = 0... | [
"9",
"13",
"-7",
"7",
"5",
"27",
"6",
"22",
"10",
"-27",
"4",
"8",
"28"
] | [
0.0820849986238988,
0.0005530843701478336,
2.510999155743982e-8,
1,
0.0820849986238988,
1.3887943864964021e-11,
0.2865047968601901,
7.194133030325383e-9,
0.023517745856009107,
3.4872615319944465e-19,
0.023517745856009107,
0.2865047968601901,
3.97896253583724e-12
] | 3 | 7 | 8cdec82961431c283de7f6c8edcedfde |
grid_navigation | 1 | Grid [0,5]x[0,5], N=+y, E=+x.
Initial Facts:
- D is left of B.
- A is below C.
- B is above D.
- D is left of C.
- B starts at (5, 5).
- D is above C.
- B is right of C.
- A starts at (1, 1).
- B is right of A.
Steps:
1. D moves by (-1, 0).
2. C and D swap positions.
What is the final spatial relation of C to D? The ... | [
"(left, below)",
"(5, 2)",
"(aligned, below)",
"(right, below)",
"(0, 5)",
"(2, 5)",
"(aligned, above)",
"(right, above)",
"(left, above)",
"(left, aligned)",
"(right, aligned)",
"(5, 1)",
"(1, 5)"
] | [
0,
0,
0,
0,
0,
0,
0,
0,
1,
0,
0,
0,
0
] | 8 | (left, above) | 59cd14526427835d28b8aecd964ef369 |
most_probable_evidence | 6 | Factor a is independently true with probability 0.4.
Factor b is independently true with probability 0.6.
Factor c is independently true with probability 0.6.
Factor d is independently true with probability 0.3.
Factor e is independently true with probability 0.3.
Factor f is independently true with probability 0.3.
Th... | [
"0 2 5 6 8 10",
"0 2 4 6 9 11",
"0 2 5 6 9 10",
"1 2 5 6 8 10",
"0 3 5 6 9 10",
"0 2 5 7 9 11",
"0 2 5 6 8 11",
"0 3 5 6 9 11",
"1 2 5 6 9 10",
"0 2 5 7 9 10",
"1 3 5 6 9 10",
"1 2 5 6 9 11",
"0 2 5 6 8"
] | [
0,
0,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0
] | 2 | 0 2 5 6 9 10 | 11fbd7de7a80bc2d8e1ddfb9df2f88eb |
multistep_abduction | 5 | Premise:
[0] george contacts clara.
[1] alice is active.
[2] clara is not verified.
[3] alice contacts elena.
[4] david trusts george.
[5] george advises bruno.
[6] george is active.
[7] bruno is alert.
[8] david contacts clara.
[9] david does not stand in the reports to relation to george.
[10] george is careful.
[11]... | [
"11",
"2 11",
"10",
"1 10",
"12",
"13",
"6 11",
"14",
"2 15",
"7 15",
"1",
"15",
"9 15"
] | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
1,
0,
0
] | 10 | 1 | e1fcbb9e7427ef8017e2ce8999bed944 |
arithmetics | 6 | Evaluate max(round((-13 - -4.5)**2 // (-12 + -3) + 11 + -11.0 + 1 - 7 // 5 % 1 * 0.2 + 1), 5.5 % (9.9 / (-3)) + -1 + -8 - 1 * max(8, -5) + max(11, 6) % is_prime(59) * -8.2) % 5.0 - -11.1.
The answer is a number. | [
"-12.2",
"13.1",
"13.7",
"-1.6",
"3.8",
"-3.2",
"-13.3",
"7.1",
"1.6"
] | [
1.611907616542249e-8,
1,
0.6534221277144157,
0.000029665318703487837,
0.0013661691717927061,
0.000009537456827749755,
7.388033388591949e-9,
0.014188561758514401,
0.0002869999923687635
] | 1 | 13.1 | d2d5350e0f85efbd5bdad58aa4482cc3 |
rule_switching | 3 | Maintain the register values while executing the program. The current mode determines each opcode's meaning. For an instruction on registers (a,b,c): rotate-left maps their values to (b,c,a); rotate-right to (c,a,b); swap-first-two to (b,a,c); swap-last-two to (a,c,b); and swap-outer to (c,b,a). Mode changes affect fol... | [
"C",
"B",
"D",
"F",
"A",
"E"
] | [
0,
0,
0,
1,
0,
0
] | 3 | F | 1b1425a27144616c2a867e01e7c565b3 |
syntax_error_detection | 3 | (START)
start
(GRAMMAR)
conj ::= 'but'
vp_sg ::= is adj
adj ::= 'sad'
decl ::= decl_simple ',' conj decl_simple
pro_sg_subj ::= 'she'
np_sg_subj ::= pro_sg_subj
is ::= 'is'
decl_simple ::= np_sg_subj vp_sg
root ::= decl '.'
start ::= root
(STRING)
she is sad , but sad she is sad .
Answer OK, INCOMPLETE, or ERROR tok... | [
"ERROR ⟧@2",
"ERROR are@2",
"ERROR a@1",
"ERROR do@2",
"ERROR a@2",
"ERROR sad@2",
"ERROR and@2",
"ERROR ?@2",
"ERROR start",
"ERROR >@2",
"ERROR is@2",
"ERROR ⟫@2",
"ERROR ]@2"
] | [
0,
0,
0,
0,
0,
1,
0,
0,
0,
0,
0,
0,
0
] | 5 | ERROR sad@2 | 7245b0c123971a923344f17281f8ef02 |
rule_switching | 3 | Maintain the register values while executing the program. The current mode determines each opcode's meaning. For an instruction on registers (a,b,c): rotate-left maps their values to (b,c,a); rotate-right to (c,a,b); swap-first-two to (b,a,c); swap-last-two to (a,c,b); and swap-outer to (c,b,a). Mode changes affect fol... | [
"D",
"B",
"A",
"G",
"C",
"E",
"F"
] | [
0,
0,
1,
0,
0,
0,
0
] | 2 | A | f8c37fc510da63683eacb053501fe620 |
set_missing_element | 1 | Answer with the missing elements in the ordered span of ['eight hundred and nine', 'eight hundred and thirteen', 'eight hundred and twelve', 'eight hundred and seven', 'eight hundred and fourteen', 'eight hundred and eleven', 'eight hundred and fifteen'] as a Python set. | [
"{'nine hundred and eight', 'nine hundred and eleven', 'nine hundred and seven'}",
"{'four hundred and eight', 'four hundred and ten', 'four hundred and twelve'}",
"{'five hundred and nine', 'five hundred and seven'}",
"{'eight hundred and fifty-eight', 'eight hundred and fifty-nine', 'eight hundred and sixty... | [
0,
0,
0,
0,
0,
0,
1,
0,
0,
0,
0,
0,
0
] | 6 | {'eight hundred and eight', 'eight hundred and ten'} | 43dcf29f9fae0765029ad7e2f0330829 |
function_manipulation | 0 | Define $h(x)=\int_{2}^{x}\left(\left(t_{1}\right)+\left(\left(t_{1}-2\right)\right)\right)\,dt_{1}$.
Compute $h'(2)$.
The answer is a reduced rational number. | [
"-1/2*x^2",
"-2",
"x^2 + x",
"-1/2",
"1/2*x^2 - x + 1/2",
"x + 1/2",
"1/2*x^2 - 2",
"2",
"1/2",
"2*x + 1",
"1/2*x^2 + 2*x + 2",
"x - 2",
"-2*x + 1"
] | [
0,
0,
0,
0,
0,
0,
0,
1,
0,
0,
0,
0,
0
] | 7 | 2 | b19be0e8a387f84ff4304f9b69820f41 |
math_word_problem | 1 | A jar holds 7 cards. 2 cards removed; then multiplied by 4; then 20 more cards added; then cut to a fifth; then multiplied by 3. How many cards are in the jar now? Answer with a number. | [
"240",
"14",
"4",
"40",
"28",
"24",
"21",
"12",
"2",
"27",
"23",
"34",
"22"
] | [
2.998863950472602e-38,
0.01831563888873418,
0.00033546262790251185,
0.001661557273173934,
0.20189651799465538,
1,
0.30119421191220214,
0.00822974704902003,
0.0001507330750954765,
0.30119421191220214,
0.6703200460356393,
0.01831563888873418,
0.44932896411722156
] | 5 | 24 | a8b0162d90d427e35ee756102b237b7b |
constraint_satisfaction | 4 | Domains: x0 in {0, 1, 2, 3}, x1 in {0, 1, 2, 3}, x2 in {0, 1, 2, 3}, x3 in {0, 1, 2}, x4 in {0, 1, 2}.
All variables are integers in their listed finite domains.
Constraints:
1. (x2 - 4*x4 == -4) or ((x2) % 5 = 1)
2. 3*x0 + 4*x1 - 3*x3 == 11
3. (3*x0 - 2*x2) % 5 = 0
Question: Are these constraints consistent?
Answer ... | [
"SAT",
"3",
"5",
"1",
"4",
"UNSAT",
"0",
"2"
] | [
0,
0,
0,
0,
0,
1,
0,
0
] | 5 | UNSAT | 7a6abfd2aac668ff10596f3cb675adc5 |
systems_trace | 4 | A cache holds at most 3 keys and starts empty. On an access, a key already in the cache is a hit; otherwise it is a miss and the key is inserted, and if the cache is full you first evict the resident key whose most recent access is oldest (LRU). Accesses, in order: 6 6 4 3 5 6 0 5 6 0 4 6 2 2 1 4.
Which keys are in the... | [
"4 6 1 3 1 6",
"2 3 4 6",
"0 1 3 4",
"6 3 2 5 3 0 4",
"2 3 0 1 2",
"1 6 3 1 3",
"1 3 6 2 1 3",
"2 4 1 3",
"3 5 1 2 0 3",
"0 3 4",
"6 4 1 2 5",
"2 1 6",
"1 2 4"
] | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
1
] | 12 | 1 2 4 | 9771a2d76c5563fe953cf78e4f87fddd |
dynamic_programming | 6 | States: A B C D E
Observations: 2 1 3 3 1 0 1 2 3 0 2 3
Start: A=-5 B=1 C=4 D=-2 E=5
Transitions (rows=from, columns=A B C D E):
A: -4 1 -3 1 -2
B: -1 2 1 1 2
C: -4 -2 3 -2 3
D: -3 -4 1 4 4
E: 1 2 -1 -1 -1
Emissions (rows=state, columns=0..3):
A: 4 4 0 -3
B: 4 3 2 -3
C: 4 3 2 1
D: 2 -3 0 -3
E: -1 1 -4 5
Score a state s... | [
"C C C E B C C C E B B E",
"D B C B E E B C B C B C B",
"C C C C C B A E B C C C",
"A B E E B C E C B C E A",
"E D B E B E D B B D C C",
"B E B E B B B E B B E B",
"C C C C C C C C E D D B",
"D E B A B C E B A B E B",
"D D E B E D B C E D B C",
"B E B E B E B C E B E A",
"C C B C C B C B C C C B... | [
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0
] | 0 | C C C E B C C C E B B E | d470252254b106f116c7ed55ddd20e3a |
sequential_induction | 0 | Infer U[n]. Max recurrence degree: 1. Ops: +, -, *.
Use U[n - 1] and n. Give the simplified polynomial RHS.
Sequence: [2, -25, 785, -23515, 705485, -21164515, 634935485, -19048064515]
Initial terms: [2]
The answer is the RHS only. | [
"-8 * U[n - 1] + 11",
"-7 * U[n - 1] + 245",
"27 * U[n - 1] + 36",
"-49 * U[n - 1] + 6",
"-5 * U[n - 1] + 19",
"-9 * U[n - 1] + 43",
"63 * U[n - 1] + 378",
"-3 * U[n - 1] + 120",
"-30 * U[n - 1] - 42",
"20 * U[n - 1] + 25",
"-54 * U[n - 1] + 378",
"-30 * U[n - 1] + 35",
"15 * U[n - 1] + 3"
] | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
1,
0
] | 11 | -30 * U[n - 1] + 35 | b283f3c87827c17da3cf4ad9370ec2cb |
qualitative_causal_reasoning | 2 | Assume linear causal relations, independent noise, and no exact cancellations.
- X0 directly decreases X2.
- X1 directly decreases X11.
- X1 directly increases X7.
- X12 directly decreases X0.
- X12 directly increases X10.
- X12 directly decreases X16.
- X12 directly decreases X4.
- X13 directly decreases X11.
- X13 d... | [
"independent",
"ambiguous",
"no_effect",
"increase",
"decrease"
] | [
0,
1,
0,
0,
0
] | 1 | ambiguous | ca87a5f2641e668c2b934ddfe7583a64 |
controlled_code_execution | 0 | Predict the value returned by this Python call.
```python
def endpoint():
state = [2, -2, 3]
alias0 = state
alias0[1] += 2
state[0] += alias0[1]
bias1 = -4
def f1(x, bias=bias1):
return x + bias + state[1]
bias1 += -3
state[2] = f1(state[2])
return state
```
Call: `endpoint()... | [
"[-1, 2, -1]",
"[2, 2, -1]",
"[2, 2, 1]",
"[0, 0, -2]",
"[-2, -1, -1]",
"[2, -4, 1]",
"[-1, 0, 1]",
"[2, 1, 1]",
"[2, 2, -3]",
"[4, 0, -4]",
"[0, -3, -1]",
"[2, -2, -3]",
"[2, 0, -1]"
] | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
1
] | 12 | [2, 0, -1] | 472b4e5bf5e8fff8349bc0944cedadd1 |
finite_automaton_execution | 6 | States:
states 0..16, start state 3, accepting states {0, 7, 12, 15}
Alphabet:
{a, b, c, d, e, f}
Transitions:
state 0: on a -> {12}; on b -> {8}; on c -> {12}; on d -> {4, 7, 14}; on e -> {5, 11, 16}; on f -> {0}
state 1: on a -> {1, 7, 9}; on b -> {5, 7, 8}; on c -> {5, 6, 8}; on d -> {2, 13, 15}; on e -> {4, 12}; ... | [
"7",
"10",
"17",
"4",
"6",
"12",
"11",
"14",
"1",
"5",
"16",
"13",
"15"
] | [
0,
0,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0
] | 2 | 17 | 8b81df633bd29721c5bf8ce344778903 |
lambda_reduction | 2 | Reduce the following untyped λ-term to β-normal form.
Syntax: `\x.body` is λx.body; juxtaposition is left-associative application; free identifiers are constants.
Term: ((c c) (d (\v0.((\_7.(a (((\_1.(b (_1 _7))) (_7 (\v1.d))) (((\_5.(\_0.(a ((b (((\_3.(\_2.((\_6.b) (\v0.(_7 b))))) (_5 b)) a)) _7)))) (\_4.d)) d)))) v0... | [
"((b (c (a ((a c) (d (\\x0.c)))))) ((b (\\x1.(\\x2.x1))) (a (\\x3.a))))",
"((a (d c)) (\\x0.(b (\\x1.(\\x2.((x0 (\\x3.b)) (\\x4.x0)))))))",
"((a d) (b (\\x0.((x0 (\\x1.(\\x2.(x2 a)))) x0))))",
"(a ((c (d (\\x0.((x0 (\\x1.(\\x2.x1))) ((x0 ((x0 x0) x0)) x0))))) (\\x3.c)))",
"(\\x0.(x0 (\\x1.((x1 (d ((x1 ((x0 ... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
1
] | 12 | ((c c) (d (\x0.(a ((b ((x0 (\x1.d)) x0)) (a ((b b) x0))))))) | e6b94cb8b00fe483396b5ee9a06cdb5d |
rule_switching | 1 | Maintain the register values while executing the program. The current mode determines each opcode's meaning. For an instruction on registers (a,b,c): rotate-left maps their values to (b,c,a); rotate-right to (c,a,b); swap-first-two to (b,a,c); swap-last-two to (a,c,b); and swap-outer to (c,b,a). Mode changes affect fol... | [
"F",
"D",
"C",
"B",
"A",
"E"
] | [
0,
0,
0,
0,
1,
0
] | 4 | A | 18be0ff50c60fda80250a50bf1b2bcca |
qualitative_causal_reasoning | 0 | Assume linear causal relations, independent noise, and no exact cancellations.
- X5 directly increases X7.
- X5 directly increases X8.
- X6 directly increases X1.
- X7 directly increases X3.
- X7 directly increases X4.
If we intervene to increase X3, what happens to X4?
Answer with: increase, decrease, no_effect, or ... | [
"independent",
"decrease",
"no_effect",
"increase",
"ambiguous"
] | [
0,
0,
1,
0,
0
] | 2 | no_effect | 0270a4a21699eedb59bdc13eb7463495 |
graph_pathfinding | 2 | Find the minimum-cost directed path from node 0 to node 2. Break ties lexicographically. Return space-separated nodes.
Graph:
Nodes [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11]. Directed Edges: 0->10(5), 1->7(7), 2->3(9), 2->8(1), 3->2(2), 4->7(8), 5->9(5), 5->10(2), 6->2(2), 6->7(6), 7->1(2), 10->2(6), 11->1(3) | [
"6 1 2",
"1 0 2 10 11",
"4 10 6",
"6 2 0 10",
"11 0 10 9 1",
"0 10 2",
"6 9 10 7",
"2 0 10",
"11 0 1 2",
"4 10 2",
"5 1 2",
"5 10 0",
"10 5 2"
] | [
0,
0,
0,
0,
0,
1,
0,
0,
0,
0,
0,
0,
0
] | 5 | 0 10 2 | a060bb217febad9a26ddabc0a0fb5f3f |
graph_successors | 0 | For each query (x, k), give the k-th successor of x by following directed edges k times.
Answer with space-separated integers in query order.
Graph:
Directed Edges: 0->1, 1->4, 2->2, 3->5, 4->0, 5->3
Queries:
[(0, 1)] | [
"4",
"2",
"1",
"0",
"5",
"3"
] | [
0,
0,
1,
0,
0,
0
] | 2 | 1 | 409ada67c62cc73a47da5058ff072308 |
regex_following | 3 | The answer is the shortest non-empty visible non-whitespace ASCII string that fully matches this regular expression, with lexicographic tie-breaks: ((attack{1,5}|[e-z]*)(\d)[K-s]{1,2})((?:modern)[e-e]*|station{3}) | [
"amonggg",
"side!",
"Cenjoy",
"UhopeIgu",
"enddd",
".board",
"never",
"0Kmodern",
"beyondd",
"certainly",
"leader",
"f1drea",
"scene"
] | [
0,
0,
0,
0,
0,
0,
0,
1,
0,
0,
0,
0,
0
] | 7 | 0Kmodern | fc2dc72a2cf06bf17f232689b2305e36 |
code_analysis | 3 | Program:
```python
import random
index, status, stage = 2, 'amber', 'retry'
def step():
global index, status, stage
if (stage != 'done') and (stage != 'done'):
status = random.choice(['amber', 'red', 'white', 'green', 'blue'])
return
match stage:
case 'done':
status = r... | [
"[('blue', 1, 1), ('green', 0, 1), ('red', 0, 1)]",
"[(0, 'amber', 'green'), (0, 'blue', 'white'), (0, 'blue', 'blue'), (0, 'blue', 'red'), (0, 'blue', 'amber')]",
"[('idle', 'red', 0)]",
"[('green', 1, 'green'), ('green', 1, 'white'), ('green', 2, 'red'), ('green', 2, 'white')]",
"[(0, 1, 'amber'), (1, 0, ... | [
0,
0,
0,
0,
0,
0,
0,
0,
1
] | 8 | [(2, 'green', 'retry')] | a52c030e4e6488ce512f80f144d4b4d1 |
grid_navigation | 0 | Grid [0,4]x[0,4], N=+y, E=+x.
Initial Facts:
- B is right of A.
- A is in the same column as C.
- A is below C.
- C starts at (0, 3).
- C is in the same row as B.
- A is below B.
- A starts at (0, 0).
- B is right of C.
Steps:
1. C jumps to B's position offset by (-2, 0).
What is the final Manhattan distance between ... | [
"(4, 2)",
"(1, 0)",
"(0, 1)",
"1",
"4",
"(1, 2)",
"(4, 4)",
"2",
"(4, 3)",
"3",
"(1, 3)",
"(0, 0)",
"(3, 2)"
] | [
0,
0,
0,
0,
0,
0,
0,
1,
0,
0,
0,
0,
0
] | 7 | 2 | ffba780fb87eccfa0af4848c664fac9c |
qualitative_causal_reasoning | 1 | Assume linear causal relations, independent noise, and no exact cancellations.
- X10 directly decreases X2.
- X10 directly increases X5.
- X12 directly decreases X0.
- X12 directly increases X2.
- X12 directly increases X8.
- X13 directly decreases X2.
- X13 directly increases X7.
- X5 directly decreases X2.
- X5 dire... | [
"no_association",
"decrease",
"associated",
"increase",
"independent",
"ambiguous"
] | [
0,
0,
0,
1,
0,
0
] | 3 | increase | 83eb6df8b8df2b54cb0ded15810c3fe6 |
combinatorics_formula | 1 | Write the counting expression. C(n,k) is unordered; P(n,k) is ordered.
Problem:
Choose one of 3 projects, appoint its chair from 12 people, then choose an unordered 5-person committee from the remaining people.
The answer must have the form:
3*X1*C(X2,X3)
where:
X1 := 3 | 12 | 11
X2 := 11 | 3 | 12
X3 := 11 | 3 | 5
An... | [
"C(11,3)",
"C(12,5)",
"C(11,5)",
"P(11,3)",
"3*12*C(11,3)",
"3*12*C(11,5)"
] | [
0,
0,
0,
0,
0,
1
] | 5 | 3*12*C(11,5) | 1fb651d781d426a14cbe6f44e6dd14bc |
grid_navigation | 2 | Grid [0,6]x[0,6], N=+y, E=+x.
Initial Facts:
- A is in the same column as E.
- D is left of C.
- C is in the same row as D.
- B is in the same row as D.
- E is in the same row as B.
- C is below A.
- B is left of A.
- B is right of C.
Steps:
1. A and D swap positions.
2. B jumps to C's position offset by (0, -1).
3. B... | [
"3",
"(0, 3)",
"(6, 2)",
"2",
"(left, below)",
"(1, 3)",
"(0, 2)",
"(6, 3)",
"(3, 1)",
"6",
"(1, 1)",
"(1, 0)",
"1"
] | [
0,
0,
0,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0
] | 3 | 2 | 668a75a6092715ad183629dce54af533 |
rule_switching | 1 | Maintain the register values while executing the program. The current mode determines each opcode's meaning. For an instruction on registers (a,b,c): rotate-left maps their values to (b,c,a); rotate-right to (c,a,b); swap-first-two to (b,a,c); swap-last-two to (a,c,b); and swap-outer to (c,b,a). Mode changes affect fol... | [
"E",
"C",
"B",
"A",
"D"
] | [
0,
0,
0,
1,
0
] | 3 | A | 3d8094f0c9609a9841242dde768b3866 |
inverse_math | 1 | Find all eigenvalues of the matrix with rows [41, -24]; [60, -35].
The answer is the eigenvalues in increasing order, repeated according to algebraic multiplicity, separated by commas.
Use plain notation, e.g. 3*x^2*exp(x) + log(x)/2. | [
"-4, -1, 1",
"-2, 0, 5",
"-5, 1, 3",
"2, 5, 5",
"-3, 1, 5",
"-15",
"-1, 1, 5",
"15/2",
"-1, -1, 3",
"4, 5, 5",
"-4, -1, 4",
"-3, -3, 5",
"1, 5"
] | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
1
] | 12 | 1, 5 | 166d6a64117ef18b7b52bc010e329a86 |
code_runnability | 0 | Predict whether this Python call runs successfully or raises an exception.
```python
def recur5(n6, z7):
if n6 <= 0:
return z7
return recur5(n6 - 1, z7 + n6)
def endpoint(arg1):
seq8 = [arg1 + arg1 if arg1 >= arg1 else arg1 // (abs(arg1) + 1), fn2(arg1 - arg1, arg1 if arg1 > arg1 else arg1), fn2(ar... | [
"OK",
"ZeroDivisionError",
"ValueError",
"KeyError",
"IndexError"
] | [
0,
1,
0,
0,
0
] | 1 | ZeroDivisionError | b7c95878bf3e9c50b0dec972202df9ae |
process_inversion | 0 | Jar A starts with an unknown number of shells. Then:
Step 1: 5 shells were added to jar A.
Step 2: the count in jar A was cut to half.
Step 3: 6 shells were added to jar A.
At the end, jar A holds 10.
How many shells were in jar A right after step 2? Answer with a number. | [
"7",
"40",
"14",
"4",
"9",
"6",
"5",
"0",
"8",
"1",
"3",
"48",
"24"
] | [
0,
0,
0,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0
] | 3 | 4 | d9e2ea3080c44a13a8ed384f52d8ec40 |
process_inversion | 4 | Jar A starts with 6 beads, jar B starts with an unknown number of beads, jar C starts with 3 beads. Then:
Step 1: the count in jar A was quadrupled.
Step 2: the count in jar C was quadrupled.
Step 3: 1 beads were moved from jar A to jar C.
Step 4: 4 beads were moved from jar C to jar B.
Step 5: the count in jar C was t... | [
"5",
"2",
"9",
"10",
"1",
"7",
"17",
"3",
"8",
"6",
"4",
"37"
] | [
0,
0,
0,
0,
0,
1,
0,
0,
0,
0,
0,
0
] | 5 | 7 | 408205af1de7229438a9788d9616218c |
game_forced_win | 2 | In this graph game, decide whether player can force a win. Player chooses on player turns; opponent chooses on opponent turns. Opponent minimizes player score. A win means final player score is greater than 50.
Start: n0. Turns alternate player, opponent. Move along one edge per turn, for at most 3 moves. Play ends up... | [
"Yes",
"No"
] | [
0,
1
] | 1 | No | 9c3f1a4bdd1a7a5320dfdd56f5766a17 |
math_word_problem | 6 | A jar holds some coins. 12 coins removed; then 53 more coins added. The jar now holds 73 coins. How many coins did it start with? Answer with a number. | [
"30",
"382",
"12",
"23",
"39",
"27",
"63",
"24",
"73",
"32",
"13",
"28",
"2"
] | [
0.5454955638202434,
8.678887134261594e-47,
0.002332986527749615,
0.06539740322986021,
0.11988622377030095,
0.2197748831002536,
0.00008322694587016918,
0.08854517331628878,
0.00000401994464936656,
1,
0.0031587599238165963,
0.2975654101475653,
0.00011268558050780087
] | 9 | 32 | ede9b0dd852e3b92ed20f32bc476092a |
constraint_satisfaction | 4 | Each membership variable is 0 (not selected) or 1 (selected).
Constraints:
1. At most 1 of [m2 = 1; m4 = 1; m5 = 1]
2. (m2 = 1) xor (if m1 = 1, then m5 = 0)
3. Exactly 2 of [m1 = 1; m2 = 1; m6 = 1]
4. Exactly 0 of [m3 = 1; m5 = 1]
Question: Are these constraints consistent?
Answer with SAT or UNSAT. | [
"1",
"3",
"4",
"SAT",
"0",
"UNSAT",
"2"
] | [
0,
0,
0,
1,
0,
0,
0
] | 3 | SAT | 1dec06addf4ef4ff380ae4acf65dca40 |
metamath_entailment | 2 | Which premise set makes the conjecture follow using only the listed rules?
Exactly one of A and B is sufficient.
Rules instantiate only by renaming variables.
The answer is A or B.
Premise Set A:
1. ctx => P2(F1(x, C2), D1)
2. ctx => P2(x, D2)
3. ctx => P3(C0, x)
4. ctx => P2(y, D3)
Premise Set B:
1. ctx => P2(F1(x, ... | [
"A",
"B"
] | [
1,
0
] | 0 | A | 33465b55265c5b18ec412fbdae4e96f5 |
function_manipulation | 4 | Let $f(x)=-3 - x - x^{2} - x^{3}$.
Define $h(x)=f\left(\left(\int_{-1}^{x}\left(\left(t_{1}\right)\left(1 + 2\left(t_{1}+1\right)\right)\right)\,dt_{1}\right)+\left(\frac{1}{3}\left(x+1\right) - \frac{3}{2}\left(x+1\right)^{2}\right)\right)$.
Compute $h'(-1)$.
The answer is a reduced rational number. | [
"-1/3",
"3",
"2/3",
"-2",
"2",
"-3"
] | [
0,
0,
1,
0,
0,
0
] | 2 | 2/3 | 9967c3d58b65d41407490f99fb416484 |
belief_tracking | 5 | Initially, everyone knows that the ring is in the drawer, the map is in the bin, and the card is in the drawer.
Story: Grace moves the map to the bin. No one else sees the move. Carol moves the map to the drawer. Unknown to the others, Eve watches through a window. Eve moves the ring to the bowl. Eve, Grace, and Bob w... | [
"drawer",
"crate",
"cabinet",
"bowl",
"tray",
"bin"
] | [
1,
0,
0,
0,
0,
0
] | 0 | drawer | 7988b57f9192f2c2f6e054cca7d6c168 |
rule_switching | 1 | Maintain the register values while executing the program. The current mode determines each opcode's meaning. For an instruction on registers (a,b,c): rotate-left maps their values to (b,c,a); rotate-right to (c,a,b); swap-first-two to (b,a,c); swap-last-two to (a,c,b); and swap-outer to (c,b,a). Mode changes affect fol... | [
"F",
"D",
"C",
"B",
"E",
"A"
] | [
1,
0,
0,
0,
0,
0
] | 0 | F | 3bac3bdf617fd2cb23e94bbc90258b49 |
game_forced_win | 4 | In this graph game, decide whether player can force a win. Player chooses on player turns; opponent chooses on opponent turns. Opponent minimizes player score. A win means final player score is greater than 50.
Start: n3. Turns alternate player, opponent. Move along one edge per turn, for at most 4 moves. Play ends up... | [
"No",
"Yes"
] | [
0,
1
] | 1 | Yes | dbbf8a642da1633be32e449ab0d2c4f2 |
table_equivalence | 6 | Do these tables contain the same data?
Ignore row order, column order, and table syntax; match values by column name.
Treat numeric grouping and trailing zeros as formatting, ISO and English month-name dates as dates, and — and NULL as missing. Repeated rows count.
Table A:
event_date amount customer c... | [
"Yes",
"No"
] | [
0,
1
] | 1 | No | 2d827e09cb05047279355f7fa2bbfa59 |
syntax_error_detection | 5 | (START)
start
(GRAMMAR)
n_thing_pl -> 'ideas'
are -> 'are'
root -> decl '.'
det_pl_indef -> 'many'
there -> 'there'
decl -> decl_simple
decl_simple -> there are det_pl_indef n_thing_pl
start -> root
(STRING)
there are many there ideas .
Answer OK, INCOMPLETE, or ERROR token for the first invalid token. If that token... | [
"ERROR idea@2",
"ERROR writer",
"ERROR are@2",
"ERROR there@3",
"ERROR are@4",
"ERROR he",
"ERROR there@2",
"ERROR message@2",
"ERROR three",
"ERROR who@2",
"ERROR )@2",
"ERROR put@2",
"ERROR yet@2"
] | [
0,
0,
0,
0,
0,
0,
1,
0,
0,
0,
0,
0,
0
] | 6 | ERROR there@2 | 73c6c3148f31c2c71b22f88a5addc873 |
inverse_math | 0 | Factor completely over the integers: 96*x^4 + 192*x^3 + 192*x^2 + 192*x + 96
The answer is a product of irreducible integer polynomials (and an integer constant).
Use plain notation, e.g. 3*x^2*exp(x) + log(x)/2. | [
"-(3*x + 4)*(x^2 + 3)",
"-(5*x + 1)*(x^2 - 2*x - 1)",
"2*(x - 3)^2*(x - 2)^2",
"96*(x + 1)^2*(x^2 + 1)",
"12*(x + 2)^2*(5*x - 2)^2",
"2*(x + 1)*(x^2 - 3*x + 3)",
"(5*x + 3)^2*(5*x^2 - 3)",
"-2*(x + 1)*(5*x^2 - 1)",
"6*x*(x^3 + 4*x^2 + 4)",
"(x + 6)*(3*x + 4)",
"36*x^2*(x^2 + 2*x - 1)",
"(x - 4... | [
0,
0,
0,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0
] | 3 | 96*(x + 1)^2*(x^2 + 1) | 00228ec5deb8a43a889b9c5812178e72 |
planning | 2 | Initial true facts: cool(fjord), linked(fjord), ready(linen), safe(delta). All other facts are false.
Actions (preconditions -> effects; !fact means false):
bind(jade,coral): cool(fjord),ready(fjord),!clear(elm),!stable(amber) -> ready(linen)
join(coral,kestrel): cool(fjord),!clear(elm),!ready(fjord),!stable(amber) ->... | [
"join(coral,kestrel)\nclose(indigo,elm)\nshift(indigo,birch)\nroute(delta,birch)\nrelease(fjord,indigo)",
"shift(linen,coral)\nprime(birch,linen)\nroute(indigo,amber)\nprime(jade,birch)\nlift(fjord,elm)"
] | [
1,
0
] | 0 | join(coral,kestrel)
close(indigo,elm)
shift(indigo,birch)
route(delta,birch)
release(fjord,indigo) | ab95f1ea16a70139f8061ebc4ec1705d |
shift_reduce_parsing | 4 | Rules:
R0: N0 -> d
R1: N1 -> a
R2: N2 -> d
R3: N3 -> N2 N2
R4: N4 -> N1 N2
R5: N5 -> N1 N0
R6: N6 -> N5 N2 N1
Input: a d d a
Shift tokens left to right. After every shift, repeatedly reduce the longest stack suffix matching a rule RHS; ties use the lowest rule number.
What is the stack after consuming 3 tokens? The ans... | [
"N5 N1 N1",
"N5 N1",
"N5 N3 N0 N0",
"N5 N0",
"N5 N0 N0",
"N2 N0",
"N5 N2 N0",
"N5 N3",
"N3 N0",
"N5 N4 N1",
"N5 N3 N0",
"N5 N5",
"N4 N0"
] | [
0,
0,
0,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0
] | 3 | N5 N0 | b0f1bbf3b8e555e6b77a4dbfdf8f9ae6 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.