question stringclasses 10
values | answer stringclasses 8
values | metadata unknown |
|---|---|---|
Restore the correct order of words in the following sentence: ' every one exclaims present. | ' exclaims every one present. | {
"source_dataset": "sentence_reordering",
"source_index": 0,
"word_count": 4,
"difficulty": {
"words_in_sentence": [
3,
20
]
}
} |
A very special island is inhabited only by saints and sinners. Saints always tell the truth, and sinners always lie. You meet 2 inhabitants: Samuel, and Jacob. Samuel expressed that if Samuel is a saint then Jacob is a sinner. Jacob was heard saying, "if Samuel is a saint then Samuel is a sinner". So who is a saint and... | Samuel is a saint, and Jacob is a sinner. | {
"source_dataset": "knights_knaves",
"source_index": 1,
"statements": [
[
"->",
[
"telling-truth",
0
],
[
"lying",
1
]
],
[
"->",
[
"telling-truth",
0
],
[
"lying",
0
]
]
... |
Susan has 3 brothers and she also has 5 sisters. How many sisters does Susan's brother have? | 6 | {
"source_dataset": "aiw",
"source_index": 2,
"task_type": "siblings",
"difficulty": {
"task_type_weights": [
0.33333333330000003,
0.33333333330000003,
0.33333333330000003
],
"num_entities": 6
}
} |
Consider these statements:
1. All dolphins are dogs
2. All dogs are teachers
Does it logically follow that:
All dolphins are teachers?
(Answer Yes or No) | Yes | {
"source_dataset": "syllogism",
"source_index": 3,
"premise1": "All dolphins are dogs",
"premise2": "All dogs are teachers",
"conclusion": "All dolphins are teachers",
"is_valid": true,
"type": "syllogism"
} |
Your task is to find the shortest path from the start to the destination point in a grid.
The grid is represented as a matrix with the following types of cells:
- *: your starting point
- #: your destination point
- O: an open cell
- X: a blocked cell
Therefore, you need to find the shortest path from * to #, moving ... | infeasible | {
"source_dataset": "shortest_path",
"source_index": 4,
"matrix": [
[
"O",
"X",
"O",
"O",
"X"
],
[
"O",
"X",
"O",
"O",
"X"
],
[
"X",
"#",
"O",
"O",
"X"
],
[
"O",
"X",
"X",
... |
The following question is a propositional logic reasoning question.
In the question we provide a list of premises. The task is to infer a correct conclusion from the premise.
FORMAT INSTRUCTIONS:
- Return the conclusion logic statement, as your final answer.
- Use the following notation to denote symbols
- OR = ∨... | null | {
"source_dataset": "propositional_logic",
"source_index": 5,
"premises": [
"((P ∨ Q) ∨ (Q → Q))",
"¬(Q → Q)",
"((P ∧ Q) ∧ (Q ∧ P))",
"(Q ↔ Q)"
],
"variables": [
"P",
"Q"
],
"complexity": 4,
"example_answer": "(¬P ∨ Q)",
"difficulty": {
"vars": [
2,
4
],
... |
How many times does the letter "r" appear in the text: "trademark license is very easy"? | 3 | {
"source_dataset": "letter_counting",
"source_index": 6,
"span_length": 5,
"target_letter": "r",
"span": [
"trademark",
"license",
"is",
"very",
"easy"
],
"difficulty": {
"words": [
5,
15
]
}
} |
A very special island is inhabited only by altruists and egoists. Altruists always tell the truth, and egoists always lie. You meet 2 inhabitants: Riley, and Lily. Riley commented, "Riley is an altruist if and only if Lily is an altruist". In Lily's words: "Riley is an egoist". So who is an altruist and who is an egois... | Riley is an egoist, and Lily is an altruist. | {
"source_dataset": "knights_knaves",
"source_index": 7,
"statements": [
[
"<=>",
[
"telling-truth",
0
],
[
"telling-truth",
1
]
],
[
"not",
[
"telling-truth",
0
]
]
],
"solution": [
false,
... |
Spell this word backward (example: sun -> nus): kecky | ykcek | {
"source_dataset": "spell_backward",
"source_index": 8,
"word": "kecky",
"word_len": 5,
"difficulty": {
"word_len": [
3,
10
]
}
} |
Consider these statements:
1. Some teachers are ants
2. Some ants are not dolphins
Does it logically follow that:
Some ants are teachers?
(Answer Yes or No) | Yes | {
"source_dataset": "syllogism",
"source_index": 9,
"premise1": "Some teachers are ants",
"premise2": "Some ants are not dolphins",
"selected_premise": 1,
"conclusion": "Some ants are teachers",
"is_valid": true,
"type": "inversion"
} |
No dataset card yet
- Downloads last month
- 37