question
stringlengths
92
1.35k
answer
stringlengths
1
46
metadata
stringlengths
88
517
dataset_source
stringclasses
7 values
Mary has 2 male friends and she also has 2 female friends. They all are friends with each other and have no other friends aside. How many female friends does William, a male friend of Mary, have?
3
{"source_dataset": "aiw", "source_index": 0, "task_type": "friends", "difficulty": {"task_type_weight": [0.3333333333333333, 0.3333333333333333, 0.3333333333333333], "num_entities": 6}}
aiw
Jennifer has 3 brothers and she also has 6 sisters. How many sisters does Jennifer's brother have?
7
{"source_dataset": "aiw", "source_index": 1, "task_type": "siblings", "difficulty": {"task_type_weight": [0.3333333333333333, 0.3333333333333333, 0.3333333333333333], "num_entities": 6}}
aiw
Sarah has 2 male friends and she also has 4 female friends. They all are friends with each other and have no other friends aside. How many female friends does John, a male friend of Sarah, have?
5
{"source_dataset": "aiw", "source_index": 2, "task_type": "friends", "difficulty": {"task_type_weight": [0.3333333333333333, 0.3333333333333333, 0.3333333333333333], "num_entities": 6}}
aiw
Jessica has 3 sisters and she also has 1 brothers. How many sisters does William's brother have?
4
{"source_dataset": "aiw", "source_index": 3, "task_type": "siblings", "difficulty": {"task_type_weight": [0.3333333333333333, 0.3333333333333333, 0.3333333333333333], "num_entities": 6}}
aiw
Susan has 5 male colleagues and she also has 5 female colleagues. These are all colleagues that Susan has. All these mentioned persons around Susan are colleagues of each other. James has 2 male colleagues and 6 female colleagues in total. All these mentioned persons around James are colleagues of each other. The peopl...
6
{"source_dataset": "aiw", "source_index": 4, "task_type": "colleagues", "difficulty": {"task_type_weight": [0.3333333333333333, 0.3333333333333333, 0.3333333333333333], "num_entities": 6}}
aiw
Susan has 4 male friends and she also has 5 female friends. They all are friends with each other and have no other friends aside. How many female friends does Thomas, a male friend of Susan, have?
6
{"source_dataset": "aiw", "source_index": 5, "task_type": "friends", "difficulty": {"task_type_weight": [0.3333333333333333, 0.3333333333333333, 0.3333333333333333], "num_entities": 6}}
aiw
Jennifer has 6 male friends and she also has 5 female friends. They all are friends with each other and have no other friends aside. How many female friends does Thomas, a male friend of Jennifer, have?
6
{"source_dataset": "aiw", "source_index": 6, "task_type": "friends", "difficulty": {"task_type_weight": [0.3333333333333333, 0.3333333333333333, 0.3333333333333333], "num_entities": 6}}
aiw
Susan has 3 brothers and she also has 5 sisters. How many sisters does Susan's brother have?
6
{"source_dataset": "aiw", "source_index": 7, "task_type": "siblings", "difficulty": {"task_type_weight": [0.3333333333333333, 0.3333333333333333, 0.3333333333333333], "num_entities": 6}}
aiw
Elizabeth has 6 male friends and she also has 2 female friends. They all are friends with each other and have no other friends aside. How many female friends does David, a male friend of Elizabeth, have?
3
{"source_dataset": "aiw", "source_index": 8, "task_type": "friends", "difficulty": {"task_type_weight": [0.3333333333333333, 0.3333333333333333, 0.3333333333333333], "num_entities": 6}}
aiw
Sarah has 2 brothers and she also has 2 sisters. How many sisters does Sarah's brother have?
3
{"source_dataset": "aiw", "source_index": 9, "task_type": "siblings", "difficulty": {"task_type_weight": [0.3333333333333333, 0.3333333333333333, 0.3333333333333333], "num_entities": 6}}
aiw
Mary has 4 male colleagues and she also has 3 female colleagues. These are all colleagues that Mary has. All these mentioned persons around Mary are colleagues of each other. Thomas has 4 male colleagues and 1 female colleagues in total. All these mentioned persons around Thomas are colleagues of each other. The people...
4
{"source_dataset": "aiw", "source_index": 10, "task_type": "colleagues", "difficulty": {"task_type_weight": [0.3333333333333333, 0.3333333333333333, 0.3333333333333333], "num_entities": 6}}
aiw
Linda has 5 male friends and she also has 6 female friends. They all are friends with each other and have no other friends aside. How many female friends does Joseph, a male friend of Linda, have?
7
{"source_dataset": "aiw", "source_index": 11, "task_type": "friends", "difficulty": {"task_type_weight": [0.3333333333333333, 0.3333333333333333, 0.3333333333333333], "num_entities": 6}}
aiw
Jennifer has 5 male colleagues and she also has 3 female colleagues. These are all colleagues that Jennifer has. All these mentioned persons around Jennifer are colleagues of each other. Joseph has 4 male colleagues and 4 female colleagues in total. All these mentioned persons around Joseph are colleagues of each other...
4
{"source_dataset": "aiw", "source_index": 12, "task_type": "colleagues", "difficulty": {"task_type_weight": [0.3333333333333333, 0.3333333333333333, 0.3333333333333333], "num_entities": 6}}
aiw
Linda has 6 brothers and she also has 3 sisters. How many sisters does Linda's brother have?
4
{"source_dataset": "aiw", "source_index": 13, "task_type": "siblings", "difficulty": {"task_type_weight": [0.3333333333333333, 0.3333333333333333, 0.3333333333333333], "num_entities": 6}}
aiw
Sarah has 4 male colleagues and she also has 6 female colleagues. These are all colleagues that Sarah has. All these mentioned persons around Sarah are colleagues of each other. James has 5 male colleagues and 3 female colleagues in total. All these mentioned persons around James are colleagues of each other. The peopl...
7
{"source_dataset": "aiw", "source_index": 14, "task_type": "colleagues", "difficulty": {"task_type_weight": [0.3333333333333333, 0.3333333333333333, 0.3333333333333333], "num_entities": 6}}
aiw
Margaret has 2 sisters and she also has 1 brothers. How many sisters does Charles's brother have?
3
{"source_dataset": "aiw", "source_index": 15, "task_type": "siblings", "difficulty": {"task_type_weight": [0.3333333333333333, 0.3333333333333333, 0.3333333333333333], "num_entities": 6}}
aiw
Linda has 2 male friends and she also has 1 female friends. They all are friends with each other and have no other friends aside. How many female friends does Bob, a male friend of Linda, have?
2
{"source_dataset": "aiw", "source_index": 16, "task_type": "friends", "difficulty": {"task_type_weight": [0.3333333333333333, 0.3333333333333333, 0.3333333333333333], "num_entities": 6}}
aiw
Alice has 2 sisters and she also has 1 brothers. How many sisters does Joseph's brother have?
3
{"source_dataset": "aiw", "source_index": 17, "task_type": "siblings", "difficulty": {"task_type_weight": [0.3333333333333333, 0.3333333333333333, 0.3333333333333333], "num_entities": 6}}
aiw
Margaret has 2 sisters and she also has 3 brothers. How many sisters does Robert's brother have?
3
{"source_dataset": "aiw", "source_index": 18, "task_type": "siblings", "difficulty": {"task_type_weight": [0.3333333333333333, 0.3333333333333333, 0.3333333333333333], "num_entities": 6}}
aiw
Sarah has 3 male friends and she also has 3 female friends. They all are friends with each other and have no other friends aside. How many female friends does Michael, a male friend of Sarah, have?
4
{"source_dataset": "aiw", "source_index": 19, "task_type": "friends", "difficulty": {"task_type_weight": [0.3333333333333333, 0.3333333333333333, 0.3333333333333333], "num_entities": 6}}
aiw
Below is a randomly generated logic circuit. A: ─────────────────┐ B: ───────────────┐ │ C: ─────────────┐ │ │ D: ───────────┐ │ │ │ E: ─────────┐ │ │ │ │ F: ───────┐ │ │ │ │ │ G: ─────┐ │ │ │ │ │ │ H: ───┐ │ │ │ │ │ │ │ I: ─┐ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ ├─>o─│&& │ │ │ │ │ │ │ │ ├────│&&───┐ │ │ │ │ │ ...
1
{"source_dataset": "circuit_logic", "source_index": 8, "expression": "(A'&A&B'&A')+(C&D&D&E')+(C'&F&A&C)+(G\u2295E'\u2295H)+(B'\u2191E\u2191I\u2191H)", "assignments": {"A": 1, "B": 0, "C": 1, "D": 1, "E": 0, "F": 1, "G": 0, "H": 0, "I": 0}, "term_strings": ["A'&A&B'&A'", "C&D&D&E'", "C'&F&A&C", "G\u2295E'\u2295H", "B'\...
circuit_logic
Below is a randomly generated logic circuit. A: ───────┐ B: ─────┐ │ C: ───┐ │ │ D: ─┐ │ │ │ │ │ │ ├────│⊕⊕──┐ │ │ │ ├────│⊕⊕ │ │ │ │ │ │ │ │ │ ├────│↑↑ │ │ │ ├──────│↑↑─┐└──│⊕⊕ │ └────────│↑↑ └───│⊕⊕─── OUT │ │ ├────│↑↑ ┌──│⊕⊕ │ │ │ │ │ │ └────│&& │ │ ...
1
{"source_dataset": "circuit_logic", "source_index": 3, "expression": "(A\u2295A)\u2295(A\u2191B\u2191C\u2191A)\u2295(A&B&D)", "assignments": {"A": 1, "B": 0, "C": 0, "D": 0}, "term_strings": ["A\u2295A", "A\u2191B\u2191C\u2191A", "A&B&D"], "final_gate": "XOR", "inputs": ["A", "B", "C", "D"], "difficulty": {"terms": [3,...
circuit_logic
Below is a randomly generated logic circuit. A: ─────────┐ B: ───────┐ │ C: ─────┐ │ │ D: ───┐ │ │ │ E: ─┐ │ │ │ │ │ │ │ │ ├─>o─│&& │ │ │ │ ├────│&&───┐ │ │ │ │ ├────│&& │ │ │ │ │ │ │ │ │ │ │ ├────│↑↑ │ │ │ │ │ ├────│↑↑──┐│ │ │ │ │ ├────│↑↑ │└──│++ │ │ │ │ ├─>o─│↑↑ └───│+...
1
{"source_dataset": "circuit_logic", "source_index": 4, "expression": "(A'&A&A)+(A\u2191A\u2191A\u2191A')+(A'\u2295A'\u2295A)+(B&C&D&E)", "assignments": {"A": 1, "B": 1, "C": 0, "D": 0, "E": 1}, "term_strings": ["A'&A&A", "A\u2191A\u2191A\u2191A'", "A'\u2295A'\u2295A", "B&C&D&E"], "final_gate": "OR", "inputs": ["A", "B"...
circuit_logic
Below is a randomly generated logic circuit. A: ─────┐ B: ───┐ │ C: ─┐ │ │ │ │ ├─>o─│↑↑ │ │ ├────│↑↑───┐ │ │ ├────│↑↑ │ │ │ │ │ │ │ ├─>o─│⊕⊕ │ │ ├──────│⊕⊕──┐│ │ ├───>o─│⊕⊕ │└──│&& │ │ └────│⊕⊕ └───│&& │ │ ┌────│&&─── OUT │ ├───>o─│&& │┌───│&& │ ├────...
0
{"source_dataset": "circuit_logic", "source_index": 2, "expression": "(A'\u2191A\u2191A)&(A'\u2295B\u2295B'\u2295A)&(B'&B&B)&(C&C&C)", "assignments": {"A": 1, "B": 0, "C": 1}, "term_strings": ["A'\u2191A\u2191A", "A'\u2295B\u2295B'\u2295A", "B'&B&B", "C&C&C"], "final_gate": "AND", "inputs": ["A", "B", "C"], "difficulty...
circuit_logic
Below is a randomly generated logic circuit. A: ─────────┐ B: ───────┐ │ C: ─────┐ │ │ D: ───┐ │ │ │ E: ─┐ │ │ │ │ │ │ │ │ ├────│&& │ │ │ ├──────│&&──┐ │ │ │ │ └─>o─│&& │ │ │ └────────│&& │ │ │ │ └──│&& │ │ └──────│&&─────│&&─── OUT │ ├──────────│&& ┌──│&& │ │ ...
0
{"source_dataset": "circuit_logic", "source_index": 4, "expression": "(A&B&A'&C)&(B&D)&(E&D&E)", "assignments": {"A": 1, "B": 0, "C": 1, "D": 1, "E": 1}, "term_strings": ["A&B&A'&C", "B&D", "E&D&E"], "final_gate": "AND", "inputs": ["A", "B", "C", "D", "E"], "difficulty": {"terms": [3, 5], "inputs": [2, 4]}}
circuit_logic
Below is a randomly generated logic circuit. A: ───────────────┐ B: ─────────────┐ │ C: ───────────┐ │ │ D: ─────────┐ │ │ │ E: ───────┐ │ │ │ │ F: ─────┐ │ │ │ │ │ G: ───┐ │ │ │ │ │ │ H: ─┐ │ │ │ │ │ │ │ │ │ │ │ │ │ │ ├────│↑↑ │ │ │ │ │ │ │ ├────│↑↑───┐ │ │ │ │ │ │ │ └────│↑↑ │ │ │ │ │ │ │ ├───>o─│↑...
1
{"source_dataset": "circuit_logic", "source_index": 7, "expression": "(A\u2191A\u2191A\u2191B')+(C\u2191D\u2191C\u2191C)+(B'\u2191E\u2191C'\u2191F)+(G\u2191H)", "assignments": {"A": 0, "B": 1, "C": 0, "D": 1, "E": 1, "F": 1, "G": 0, "H": 1}, "term_strings": ["A\u2191A\u2191A\u2191B'", "C\u2191D\u2191C\u2191C", "B'\u219...
circuit_logic
Below is a randomly generated logic circuit. A: ─────────────┐ B: ───────────┐ │ C: ─────────┐ │ │ D: ───────┐ │ │ │ E: ─────┐ │ │ │ │ F: ───┐ │ │ │ │ │ G: ─┐ │ │ │ │ │ │ │ │ │ │ │ │ ├────│&& │ │ │ │ │ │ ├────│&&───┐ │ │ │ │ │ │ ├────│&& │ │ │ │ │ │ ├───>o─│&& │ │ │ │ │ │ │ │ │ │ │...
1
{"source_dataset": "circuit_logic", "source_index": 6, "expression": "(A&A&A&B')\u2295(A\u2295B')\u2295(A'\u2191C\u2191D'\u2191C)\u2295(E\u2295B\u2295F)\u2295(C\u2191G)", "assignments": {"A": 0, "B": 0, "C": 0, "D": 1, "E": 1, "F": 1, "G": 1}, "term_strings": ["A&A&A&B'", "A\u2295B'", "A'\u2191C\u2191D'\u2191C", "E\u22...
circuit_logic
Below is a randomly generated logic circuit. A: ─────────┐ B: ───────┐ │ C: ─────┐ │ │ D: ───┐ │ │ │ E: ─┐ │ │ │ │ │ │ │ │ ├────│↑↑──┐ │ │ │ └──────│↑↑ │ │ │ │ │ │ │ │ └─────>o─│⊕⊕─┐└──│⊕⊕ │ │ └────│⊕⊕ └───│⊕⊕─── OUT │ │ ┌──│⊕⊕ │ └──────────│⊕⊕──┘ └─────────...
0
{"source_dataset": "circuit_logic", "source_index": 4, "expression": "(A\u2191B)\u2295(C'\u2295A)\u2295(D\u2295E)", "assignments": {"A": 0, "B": 0, "C": 0, "D": 1, "E": 1}, "term_strings": ["A\u2191B", "C'\u2295A", "D\u2295E"], "final_gate": "XOR", "inputs": ["A", "B", "C", "D", "E"], "difficulty": {"terms": [3, 5], "i...
circuit_logic
Below is a randomly generated logic circuit. A: ───────────────┐ B: ─────────────┐ │ C: ───────────┐ │ │ D: ─────────┐ │ │ │ E: ───────┐ │ │ │ │ F: ─────┐ │ │ │ │ │ G: ───┐ │ │ │ │ │ │ H: ─┐ │ │ │ │ │ │ │ │ │ │ │ │ │ │ └────│↑↑ │ │ │ │ │ │ ├──────│↑↑───┐ │ │ │ │ │ │ └───>o─│↑↑ │ │ │ │ │ │ ├────────│↑...
0
{"source_dataset": "circuit_logic", "source_index": 7, "expression": "(A\u2191B\u2191B'\u2191C)\u2295(D\u2191C)\u2295(E\u2295F\u2295G)\u2295(C'\u2295H\u2295H')", "assignments": {"A": 1, "B": 0, "C": 1, "D": 0, "E": 0, "F": 1, "G": 0, "H": 1}, "term_strings": ["A\u2191B\u2191B'\u2191C", "D\u2191C", "E\u2295F\u2295G", "C...
circuit_logic
Below is a randomly generated logic circuit. A: ─────┐ B: ───┐ │ C: ─┐ │ │ │ │ ├────│&&──┐ │ │ ├────│&& │ │ │ │ │ │ ├──────│↑↑ │ │ ├──────│↑↑─┐└──│↓↓ │ │ └────│↑↑ └───│↓↓─── OUT │ ├───>o─│↑↑ ┌──│↓↓ │ │ │ │ └──────│⊕⊕──┘ └────────│⊕⊕ Legend for gates: &&: A...
0
{"source_dataset": "circuit_logic", "source_index": 2, "expression": "(A&A)\u2193(B\u2191B\u2191A\u2191B')\u2193(B\u2295C)", "assignments": {"A": 0, "B": 0, "C": 1}, "term_strings": ["A&A", "B\u2191B\u2191A\u2191B'", "B\u2295C"], "final_gate": "NOR", "inputs": ["A", "B", "C"], "difficulty": {"terms": [3, 5], "inputs": ...
circuit_logic
Below is a randomly generated logic circuit. A: ───────────────────┐ B: ─────────────────┐ │ C: ───────────────┐ │ │ D: ─────────────┐ │ │ │ E: ───────────┐ │ │ │ │ F: ─────────┐ │ │ │ │ │ G: ───────┐ │ │ │ │ │ │ H: ─────┐ │ │ │ │ │ │ │ I: ───┐ │ │ │ │ │ │ │ │ J: ─┐ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ ├────│⊕⊕ ...
1
{"source_dataset": "circuit_logic", "source_index": 9, "expression": "(A\u2295B\u2295C'\u2295D)+(A'&A'&D')+(E\u2191F\u2191G)+(H\u2295I'\u2295J)", "assignments": {"A": 0, "B": 1, "C": 0, "D": 1, "E": 0, "F": 1, "G": 1, "H": 0, "I": 0, "J": 0}, "term_strings": ["A\u2295B\u2295C'\u2295D", "A'&A'&D'", "E\u2191F\u2191G", "H...
circuit_logic
Below is a randomly generated logic circuit. A: ─────────────────┐ B: ───────────────┐ │ C: ─────────────┐ │ │ D: ───────────┐ │ │ │ E: ─────────┐ │ │ │ │ F: ───────┐ │ │ │ │ │ G: ─────┐ │ │ │ │ │ │ H: ───┐ │ │ │ │ │ │ │ I: ─┐ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ ├────│↑↑ │ │ │ │ │ │ │ └──────│↑↑───┐ │ │ │ │ │ ...
0
{"source_dataset": "circuit_logic", "source_index": 8, "expression": "(A\u2191B\u2191C\u2191D')\u2193(E'&F'&D')\u2193(F&G)\u2193(A&H&I)\u2193(H'&D)", "assignments": {"A": 0, "B": 0, "C": 0, "D": 0, "E": 1, "F": 1, "G": 1, "H": 1, "I": 0}, "term_strings": ["A\u2191B\u2191C\u2191D'", "E'&F'&D'", "F&G", "A&H&I", "H'&D"], ...
circuit_logic
Below is a randomly generated logic circuit. A: ───────────┐ B: ─────────┐ │ C: ───────┐ │ │ D: ─────┐ │ │ │ E: ───┐ │ │ │ │ F: ─┐ │ │ │ │ │ │ │ │ │ │ └────│⊕⊕ │ │ │ │ ├──────│⊕⊕──┐ │ │ │ │ ├──────│⊕⊕ │ │ │ │ │ │ │ │ │ │ │ └──────│&& └──│&& │ │ │ └────────│&&─────│&&─── OUT │ │ ...
0
{"source_dataset": "circuit_logic", "source_index": 5, "expression": "(A\u2295B\u2295B)&(B&C&D&E')&(F'&D)", "assignments": {"A": 0, "B": 1, "C": 0, "D": 1, "E": 1, "F": 0}, "term_strings": ["A\u2295B\u2295B", "B&C&D&E'", "F'&D"], "final_gate": "AND", "inputs": ["A", "B", "C", "D", "E", "F"], "difficulty": {"terms": [3,...
circuit_logic
Below is a randomly generated logic circuit. A: ───┐ B: ─┐ │ │ ├────│&& │ ├────│&&──┐ │ ├────│&& │ │ ├────│&& │ │ │ │ ├───>o─│↑↑ │ │ ├────│↑↑─┐└──│↓↓ ├──────│↑↑ └───│↓↓─── OUT │ ├─>o─│↑↑ ┌──│↓↓ │ │ │ │ ├────│⊕⊕ │ ├──────│⊕⊕──┘ └──────│⊕⊕ └─...
0
{"source_dataset": "circuit_logic", "source_index": 1, "expression": "(A&A&A&A)\u2193(B'\u2191A\u2191B\u2191A')\u2193(A\u2295B\u2295B\u2295A')", "assignments": {"A": 0, "B": 0}, "term_strings": ["A&A&A&A", "B'\u2191A\u2191B\u2191A'", "A\u2295B\u2295B\u2295A'"], "final_gate": "NOR", "inputs": ["A", "B"], "difficulty": {...
circuit_logic
Below is a randomly generated logic circuit. A: ─────────────────┐ B: ───────────────┐ │ C: ─────────────┐ │ │ D: ───────────┐ │ │ │ E: ─────────┐ │ │ │ │ F: ───────┐ │ │ │ │ │ G: ─────┐ │ │ │ │ │ │ H: ───┐ │ │ │ │ │ │ │ I: ─┐ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ ├────│↑↑ │ │ │ │ │ │ │ ├──────│↑↑───┐ │ │ │ │ │ ...
1
{"source_dataset": "circuit_logic", "source_index": 8, "expression": "(A\u2191B\u2191A'\u2191C)+(C'\u2191D\u2191A\u2191B')+(E\u2295F')+(G\u2295B')+(H'\u2191I\u2191A\u2191H)", "assignments": {"A": 1, "B": 1, "C": 1, "D": 0, "E": 1, "F": 1, "G": 0, "H": 0, "I": 0}, "term_strings": ["A\u2191B\u2191A'\u2191C", "C'\u2191D\u...
circuit_logic
Below is a randomly generated logic circuit. A: ───────────────┐ B: ─────────────┐ │ C: ───────────┐ │ │ D: ─────────┐ │ │ │ E: ───────┐ │ │ │ │ F: ─────┐ │ │ │ │ │ G: ───┐ │ │ │ │ │ │ H: ─┐ │ │ │ │ │ │ │ │ │ │ │ │ │ │ ├─>o─│⊕⊕ │ │ │ │ │ │ ├──────│⊕⊕──┐ │ │ │ │ │ │ └──────│⊕⊕ │ │ │ │ │ │ └─────>o─│⊕⊕ ...
0
{"source_dataset": "circuit_logic", "source_index": 7, "expression": "(A'\u2295B\u2295B\u2295C')\u2295(D\u2295A)\u2295(E\u2295F\u2295G'\u2295H')", "assignments": {"A": 1, "B": 0, "C": 1, "D": 1, "E": 0, "F": 0, "G": 1, "H": 1}, "term_strings": ["A'\u2295B\u2295B\u2295C'", "D\u2295A", "E\u2295F\u2295G'\u2295H'"], "final...
circuit_logic
Below is a randomly generated logic circuit. A: ─────────────────┐ B: ───────────────┐ │ C: ─────────────┐ │ │ D: ───────────┐ │ │ │ E: ─────────┐ │ │ │ │ F: ───────┐ │ │ │ │ │ G: ─────┐ │ │ │ │ │ │ H: ───┐ │ │ │ │ │ │ │ I: ─┐ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ ├────│&& │ │ │ │ │ │ │ ├───>o─│&&───┐ │ │ │ │ │ ...
0
{"source_dataset": "circuit_logic", "source_index": 8, "expression": "(A&B'&B&C')\u2193(C'\u2191B\u2191C\u2191A)\u2193(B&D&E)\u2193(B'&F')\u2193(G\u2191H\u2191I\u2191G')", "assignments": {"A": 1, "B": 0, "C": 1, "D": 0, "E": 0, "F": 1, "G": 0, "H": 0, "I": 0}, "term_strings": ["A&B'&B&C'", "C'\u2191B\u2191C\u2191A", "B...
circuit_logic
Below is a randomly generated logic circuit. A: ───────┐ B: ─────┐ │ C: ───┐ │ │ D: ─┐ │ │ │ │ │ │ ├─>o─│⊕⊕ │ │ └──────│⊕⊕──┐ │ ├─────>o─│⊕⊕ │ │ │ │ │ │ ├─────>o─│↑↑ └──│++ │ └────────│↑↑─────│++─── OUT └──────────│↑↑ ┌──│++ │ │ ├────│⊕⊕──┘ ...
1
{"source_dataset": "circuit_logic", "source_index": 3, "expression": "(A'\u2295B\u2295C')+(C'\u2191C\u2191D)+(A\u2295A')", "assignments": {"A": 0, "B": 0, "C": 1, "D": 1}, "term_strings": ["A'\u2295B\u2295C'", "C'\u2191C\u2191D", "A\u2295A'"], "final_gate": "OR", "inputs": ["A", "B", "C", "D"], "difficulty": {"terms": ...
circuit_logic
Below is a randomly generated logic circuit. A: ─────────────┐ B: ───────────┐ │ C: ─────────┐ │ │ D: ───────┐ │ │ │ E: ─────┐ │ │ │ │ F: ───┐ │ │ │ │ │ G: ─┐ │ │ │ │ │ │ │ │ │ │ │ │ ├─>o─│⊕⊕───┐ │ │ │ │ │ └──────│⊕⊕ │ │ │ │ │ │ │ │ │ │ │ │ └────────│↑↑──┐│ │ │ │ └───────>o─│↑↑ │└──│⊕...
0
{"source_dataset": "circuit_logic", "source_index": 6, "expression": "(A'\u2295B)\u2295(C\u2191D')\u2295(A\u2191E')\u2295(F'\u2295G\u2295E'\u2295A)", "assignments": {"A": 0, "B": 1, "C": 0, "D": 1, "E": 0, "F": 0, "G": 0}, "term_strings": ["A'\u2295B", "C\u2191D'", "A\u2191E'", "F'\u2295G\u2295E'\u2295A"], "final_gate"...
circuit_logic
Below is a randomly generated logic circuit. A: ─────┐ B: ───┐ │ C: ─┐ │ │ │ │ ├────│⊕⊕───┐ │ │ ├────│⊕⊕ │ │ │ │ │ │ │ ├────│&& │ │ │ ├────│&&──┐└──│↓↓ │ │ ├────│&& └───│↓↓ │ │ │ ┌────│↓↓─── OUT │ │ ├─>o─│↑↑─┘┌───│↓↓ │ │ └────│↑↑ │ │ │ │ │ └──...
0
{"source_dataset": "circuit_logic", "source_index": 2, "expression": "(A\u2295A)\u2193(A&A&A)\u2193(A'\u2191A)\u2193(B\u2191C\u2191C)", "assignments": {"A": 1, "B": 1, "C": 0}, "term_strings": ["A\u2295A", "A&A&A", "A'\u2191A", "B\u2191C\u2191C"], "final_gate": "NOR", "inputs": ["A", "B", "C"], "difficulty": {"terms": ...
circuit_logic
A very special island is inhabited only by sages and fools. Sages always tell the truth, and fools always lie. You meet 2 inhabitants: Zoey, and Riley. Zoey commented, "Riley is a fool". In Riley's words: "Zoey is a sage or Riley is a sage". So who is a sage and who is a fool? (Format your answer like: "Zoey is a sage/...
Zoey is a fool, and Riley is a sage.
{"source_dataset": "knights_knaves", "source_index": 0, "statements": [["lying", 1], ["or", ["telling-truth", 0], ["telling-truth", 1]]], "solution": [false, true], "names": ["Zoey", "Riley"], "knight_knave_terms": {"knight": "sage", "knave": "fool", "a_knight": "a sage", "a_knave": "a fool", "Knight": "Sage", "Knave":...
knights_knaves
A very special island is inhabited only by pioneers and laggards. Pioneers always tell the truth, and laggards always lie. You meet 2 inhabitants: Riley, and Olivia. "if Riley is a pioneer then Olivia is a laggard" - Riley. Olivia stated, "Olivia is a pioneer and Riley is a laggard". So who is a pioneer and who is a la...
Riley is a pioneer, and Olivia is a laggard.
{"source_dataset": "knights_knaves", "source_index": 1, "statements": [["->", ["telling-truth", 0], ["lying", 1]], ["and", ["telling-truth", 1], ["lying", 0]]], "solution": [true, false], "names": ["Riley", "Olivia"], "knight_knave_terms": {"knight": "pioneer", "knave": "laggard", "a_knight": "a pioneer", "a_knave": "a...
knights_knaves
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": 2, "statements": [["->", ["telling-truth", 0], ["lying", 1]], ["->", ["telling-truth", 0], ["lying", 0]]], "solution": [true, false], "names": ["Samuel", "Jacob"], "knight_knave_terms": {"knight": "saint", "knave": "sinner", "a_knight": "a saint", "a_knave": "a sinne...
knights_knaves
A very special island is inhabited only by pioneers and laggards. Pioneers always tell the truth, and laggards always lie. You meet 2 inhabitants: Olivia, and Lily. "Lily is a laggard and Lily is a pioneer" - Olivia. Lily noted, "if Olivia is a pioneer then Lily is a pioneer". So who is a pioneer and who is a laggard? ...
Olivia is a laggard, and Lily is a pioneer.
{"source_dataset": "knights_knaves", "source_index": 3, "statements": [["and", ["lying", 1], ["telling-truth", 1]], ["->", ["telling-truth", 0], ["telling-truth", 1]]], "solution": [false, true], "names": ["Olivia", "Lily"], "knight_knave_terms": {"knight": "pioneer", "knave": "laggard", "a_knight": "a pioneer", "a_kna...
knights_knaves
A very special island is inhabited only by altruists and egoists. Altruists always tell the truth, and egoists always lie. You meet 2 inhabitants: Mason, and Jack. Mason expressed that if Jack is an egoist then Mason is an altruist. In Jack's words: "Mason is an egoist". So who is an altruist and who is an egoist? (For...
Mason is an altruist, and Jack is an egoist.
{"source_dataset": "knights_knaves", "source_index": 4, "statements": [["->", ["lying", 1], ["telling-truth", 0]], ["not", ["telling-truth", 0]]], "solution": [true, false], "names": ["Mason", "Jack"], "knight_knave_terms": {"knight": "altruist", "knave": "egoist", "a_knight": "an altruist", "a_knave": "an egoist", "Kn...
knights_knaves
A very special island is inhabited only by heros and villains. Heros always tell the truth, and villains always lie. You meet 2 inhabitants: Benjamin, and Oliver. Benjamin noted, "Oliver is a villain or Benjamin is a hero". Oliver commented, "if Oliver is a hero then Benjamin is a villain". So who is a hero and who is ...
Benjamin is a villain, and Oliver is a hero.
{"source_dataset": "knights_knaves", "source_index": 5, "statements": [["or", ["lying", 1], ["telling-truth", 0]], ["->", ["telling-truth", 1], ["lying", 0]]], "solution": [false, true], "names": ["Benjamin", "Oliver"], "knight_knave_terms": {"knight": "hero", "knave": "villain", "a_knight": "a hero", "a_knave": "a vil...
knights_knaves
A very special island is inhabited only by saints and sinners. Saints always tell the truth, and sinners always lie. You meet 2 inhabitants: Alexander, and Sofia. Alexander expressed that Sofia is a saint and Sofia is a sinner. "Alexander is a saint," Sofia claimed. So who is a saint and who is a sinner? (Format your a...
Alexander is a sinner, and Sofia is a sinner.
{"source_dataset": "knights_knaves", "source_index": 6, "statements": [["and", ["telling-truth", 1], ["lying", 1]], ["not", ["lying", 0]]], "solution": [false, false], "names": ["Alexander", "Sofia"], "knight_knave_terms": {"knight": "saint", "knave": "sinner", "a_knight": "a saint", "a_knave": "a sinner", "Knight": "S...
knights_knaves
A very special island is inhabited only by altruists and egoists. Altruists always tell the truth, and egoists always lie. You meet 2 inhabitants: Sophia, and Oliver. Sophia said that Sophia is an altruist if and only if Oliver is an egoist. Oliver noted, "Sophia is an egoist if and only if Oliver is an altruist". So w...
Sophia is an egoist, and Oliver is an egoist.
{"source_dataset": "knights_knaves", "source_index": 7, "statements": [["<=>", ["telling-truth", 0], ["lying", 1]], ["<=>", ["lying", 0], ["telling-truth", 1]]], "solution": [false, false], "names": ["Sophia", "Oliver"], "knight_knave_terms": {"knight": "altruist", "knave": "egoist", "a_knight": "an altruist", "a_knave...
knights_knaves
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": 8, "statements": [["<=>", ["telling-truth", 0], ["telling-truth", 1]], ["not", ["telling-truth", 0]]], "solution": [false, true], "names": ["Riley", "Lily"], "knight_knave_terms": {"knight": "altruist", "knave": "egoist", "a_knight": "an altruist", "a_knave": "an ego...
knights_knaves
A very special island is inhabited only by sages and fools. Sages always tell the truth, and fools always lie. You meet 2 inhabitants: Abigail, and Lily. "Lily is a sage," Abigail mentioned. As Lily put it, "Abigail is a fool or Abigail is a sage". So who is a sage and who is a fool? (Format your answer like: "Abigail ...
Abigail is a sage, and Lily is a sage.
{"source_dataset": "knights_knaves", "source_index": 9, "statements": [["not", ["lying", 1]], ["or", ["lying", 0], ["telling-truth", 0]]], "solution": [true, true], "names": ["Abigail", "Lily"], "knight_knave_terms": {"knight": "sage", "knave": "fool", "a_knight": "a sage", "a_knave": "a fool", "Knight": "Sage", "Knave...
knights_knaves
A very special island is inhabited only by heros and villains. Heros always tell the truth, and villains always lie. You meet 2 inhabitants: Benjamin, and Chloe. As Benjamin put it, "if Chloe is a hero then Benjamin is a hero". Chloe expressed that Benjamin is a hero and Benjamin is a villain. So who is a hero and who ...
Benjamin is a hero, and Chloe is a villain.
{"source_dataset": "knights_knaves", "source_index": 10, "statements": [["->", ["telling-truth", 1], ["telling-truth", 0]], ["and", ["telling-truth", 0], ["lying", 0]]], "solution": [true, false], "names": ["Benjamin", "Chloe"], "knight_knave_terms": {"knight": "hero", "knave": "villain", "a_knight": "a hero", "a_knave...
knights_knaves
A very special island is inhabited only by sages and fools. Sages always tell the truth, and fools always lie. You meet 2 inhabitants: Ethan, and Noah. In a statement by Ethan: "Noah is a fool and Noah is a sage". Noah was heard saying, "if Ethan is a sage then Ethan is a fool". So who is a sage and who is a fool? (For...
Ethan is a fool, and Noah is a sage.
{"source_dataset": "knights_knaves", "source_index": 11, "statements": [["and", ["lying", 1], ["telling-truth", 1]], ["->", ["telling-truth", 0], ["lying", 0]]], "solution": [false, true], "names": ["Ethan", "Noah"], "knight_knave_terms": {"knight": "sage", "knave": "fool", "a_knight": "a sage", "a_knave": "a fool", "K...
knights_knaves
A very special island is inhabited only by sages and fools. Sages always tell the truth, and fools always lie. You meet 2 inhabitants: Jacob, and Emma. Jacob noted, "Emma is a sage if and only if Emma is a fool". "Jacob is a sage if and only if Jacob is a fool," Emma claimed. So who is a sage and who is a fool? (Format...
Jacob is a fool, and Emma is a fool.
{"source_dataset": "knights_knaves", "source_index": 12, "statements": [["<=>", ["telling-truth", 1], ["lying", 1]], ["<=>", ["telling-truth", 0], ["lying", 0]]], "solution": [false, false], "names": ["Jacob", "Emma"], "knight_knave_terms": {"knight": "sage", "knave": "fool", "a_knight": "a sage", "a_knave": "a fool", ...
knights_knaves
A very special island is inhabited only by saints and sinners. Saints always tell the truth, and sinners always lie. You meet 2 inhabitants: Aria, and Sofia. As Aria put it, "Sofia is a saint". "Aria is a sinner or Aria is a saint," Sofia declared. So who is a saint and who is a sinner? (Format your answer like: "Aria ...
Aria is a saint, and Sofia is a saint.
{"source_dataset": "knights_knaves", "source_index": 13, "statements": [["not", ["lying", 1]], ["or", ["lying", 0], ["telling-truth", 0]]], "solution": [true, true], "names": ["Aria", "Sofia"], "knight_knave_terms": {"knight": "saint", "knave": "sinner", "a_knight": "a saint", "a_knave": "a sinner", "Knight": "Saint", ...
knights_knaves
A very special island is inhabited only by saints and sinners. Saints always tell the truth, and sinners always lie. You meet 2 inhabitants: Aria, and Jacob. "Jacob is a saint" - Aria. "Aria is a sinner and Aria is a saint," Jacob declared. So who is a saint and who is a sinner? (Format your answer like: "Aria is a sai...
Aria is a sinner, and Jacob is a sinner.
{"source_dataset": "knights_knaves", "source_index": 14, "statements": [["telling-truth", 1], ["and", ["lying", 0], ["telling-truth", 0]]], "solution": [false, false], "names": ["Aria", "Jacob"], "knight_knave_terms": {"knight": "saint", "knave": "sinner", "a_knight": "a saint", "a_knave": "a sinner", "Knight": "Saint"...
knights_knaves
A very special island is inhabited only by sages and fools. Sages always tell the truth, and fools always lie. You meet 2 inhabitants: Lucas, and Jacob. In a statement by Lucas: "Lucas is a sage if and only if Jacob is a sage". Jacob remarked, "if Jacob is a sage then Lucas is a fool". So who is a sage and who is a foo...
Lucas is a fool, and Jacob is a sage.
{"source_dataset": "knights_knaves", "source_index": 15, "statements": [["<=>", ["telling-truth", 0], ["telling-truth", 1]], ["->", ["telling-truth", 1], ["lying", 0]]], "solution": [false, true], "names": ["Lucas", "Jacob"], "knight_knave_terms": {"knight": "sage", "knave": "fool", "a_knight": "a sage", "a_knave": "a ...
knights_knaves
A very special island is inhabited only by heros and villains. Heros always tell the truth, and villains always lie. You meet 2 inhabitants: Olivia, and Sofia. In Olivia's words: "Sofia is a hero and Sofia is a villain". Sofia remarked, "Olivia is a villain or Sofia is a hero". So who is a hero and who is a villain? (F...
Olivia is a villain, and Sofia is a hero.
{"source_dataset": "knights_knaves", "source_index": 16, "statements": [["and", ["telling-truth", 1], ["lying", 1]], ["or", ["lying", 0], ["telling-truth", 1]]], "solution": [false, true], "names": ["Olivia", "Sofia"], "knight_knave_terms": {"knight": "hero", "knave": "villain", "a_knight": "a hero", "a_knave": "a vill...
knights_knaves
A very special island is inhabited only by heros and villains. Heros always tell the truth, and villains always lie. You meet 2 inhabitants: David, and Mia. David asserted: "Mia is a hero". In Mia's words: "David is a hero or David is a villain". So who is a hero and who is a villain? (Format your answer like: "David i...
David is a hero, and Mia is a hero.
{"source_dataset": "knights_knaves", "source_index": 17, "statements": [["not", ["lying", 1]], ["or", ["telling-truth", 0], ["lying", 0]]], "solution": [true, true], "names": ["David", "Mia"], "knight_knave_terms": {"knight": "hero", "knave": "villain", "a_knight": "a hero", "a_knave": "a villain", "Knight": "Hero", "K...
knights_knaves
A very special island is inhabited only by pioneers and laggards. Pioneers always tell the truth, and laggards always lie. You meet 2 inhabitants: Benjamin, and Sofia. Benjamin asserted: "Benjamin is a pioneer or Sofia is a laggard". Sofia commented, "Benjamin is a pioneer if and only if Benjamin is a laggard". So who ...
Benjamin is a pioneer, and Sofia is a laggard.
{"source_dataset": "knights_knaves", "source_index": 18, "statements": [["or", ["telling-truth", 0], ["lying", 1]], ["<=>", ["telling-truth", 0], ["lying", 0]]], "solution": [true, false], "names": ["Benjamin", "Sofia"], "knight_knave_terms": {"knight": "pioneer", "knave": "laggard", "a_knight": "a pioneer", "a_knave":...
knights_knaves
A very special island is inhabited only by knights and knaves. Knights always tell the truth, and knaves always lie. You meet 2 inhabitants: Sebastian, and Zoey. "Zoey is a knight or Zoey is a knave," Sebastian claimed. Zoey remarked, "Sebastian is a knight". So who is a knight and who is a knave? (Format your answer l...
Sebastian is a knight, and Zoey is a knight.
{"source_dataset": "knights_knaves", "source_index": 19, "statements": [["or", ["telling-truth", 1], ["lying", 1]], ["telling-truth", 0]], "solution": [true, true], "names": ["Sebastian", "Zoey"], "knight_knave_terms": {"knight": "knight", "knave": "knave", "a_knight": "a knight", "a_knave": "a knave", "Knight": "Knigh...
knights_knaves
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 = ∨...
None
{"source_dataset": "propositional_logic", "source_index": 0, "premises": ["R", "Q"], "variables": ["P", "Q", "R", "S"], "complexity": 3, "example_answer": "(P \u2228 Q)", "difficulty": {"vars": [2, 4], "statements": [2, 4], "complexity": [1, 3]}}
propositional_logic
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 = ∨...
None
{"source_dataset": "propositional_logic", "source_index": 1, "premises": ["((Q \u2192 P) \u2228 (Q \u2192 P))", "((Q \u2194 Q) \u2192 (P \u2192 P))", "P"], "variables": ["P", "Q"], "complexity": 3, "example_answer": "(Q \u2228 P)", "difficulty": {"vars": [2, 4], "statements": [2, 4], "complexity": [1, 3]}}
propositional_logic
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 = ∨...
None
{"source_dataset": "propositional_logic", "source_index": 2, "premises": ["((Q \u2228 P) \u2227 \u00acP)", "P", "((P \u2227 R) \u2227 \u00acR)", "((Q \u2194 R) \u2192 \u00acQ)"], "variables": ["P", "Q", "R"], "complexity": 3, "example_answer": "(Q \u2227 Q)", "difficulty": {"vars": [2, 4], "statements": [2, 4], "comple...
propositional_logic
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 = ∨...
None
{"source_dataset": "propositional_logic", "source_index": 3, "premises": ["\u00acP", "\u00acP", "Q"], "variables": ["P", "Q", "R"], "complexity": 3, "example_answer": "(Q \u2228 R)", "difficulty": {"vars": [2, 4], "statements": [2, 4], "complexity": [1, 3]}}
propositional_logic
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 = ∨...
None
{"source_dataset": "propositional_logic", "source_index": 4, "premises": ["P", "((P \u2228 P) \u2194 (Q \u2227 P))", "P"], "variables": ["P", "Q"], "complexity": 3, "example_answer": "(Q \u2227 Q)", "difficulty": {"vars": [2, 4], "statements": [2, 4], "complexity": [1, 3]}}
propositional_logic
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 = ∨...
None
{"source_dataset": "propositional_logic", "source_index": 5, "premises": ["(Q \u2194 R)", "\u00acR"], "variables": ["P", "Q", "R"], "complexity": 4, "example_answer": "(\u00acQ \u2228 R)", "difficulty": {"vars": [2, 4], "statements": [2, 4], "complexity": [1, 3]}}
propositional_logic
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 = ∨...
None
{"source_dataset": "propositional_logic", "source_index": 6, "premises": ["R", "((Q \u2192 Q) \u2228 (S \u2227 Q))", "Q"], "variables": ["P", "Q", "R", "S"], "complexity": 3, "example_answer": "(S \u2228 Q)", "difficulty": {"vars": [2, 4], "statements": [2, 4], "complexity": [1, 3]}}
propositional_logic
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 = ∨...
None
{"source_dataset": "propositional_logic", "source_index": 7, "premises": ["(Q \u2227 P)", "(\u00acP \u2227 (P \u2192 P))", "\u00ac(Q \u2194 Q)"], "variables": ["P", "Q"], "complexity": 3, "example_answer": "(P \u2227 P)", "difficulty": {"vars": [2, 4], "statements": [2, 4], "complexity": [1, 3]}}
propositional_logic
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 = ∨...
None
{"source_dataset": "propositional_logic", "source_index": 8, "premises": ["(R \u2228 Q)", "(R \u2227 Q)", "R"], "variables": ["P", "Q", "R"], "complexity": 3, "example_answer": "(Q \u2194 R)", "difficulty": {"vars": [2, 4], "statements": [2, 4], "complexity": [1, 3]}}
propositional_logic
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 = ∨...
None
{"source_dataset": "propositional_logic", "source_index": 9, "premises": ["((P \u2228 Q) \u2228 (Q \u2192 Q))", "\u00ac(Q \u2192 Q)", "((P \u2227 Q) \u2227 (Q \u2227 P))", "(Q \u2194 Q)"], "variables": ["P", "Q"], "complexity": 4, "example_answer": "(\u00acP \u2228 Q)", "difficulty": {"vars": [2, 4], "statements": [2, ...
propositional_logic
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 = ∨...
None
{"source_dataset": "propositional_logic", "source_index": 10, "premises": ["((Q \u2192 Q) \u2194 (P \u2227 P))", "(Q \u2228 Q)"], "variables": ["P", "Q", "R"], "complexity": 4, "example_answer": "(\u00acQ \u2228 P)", "difficulty": {"vars": [2, 4], "statements": [2, 4], "complexity": [1, 3]}}
propositional_logic
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 = ∨...
None
{"source_dataset": "propositional_logic", "source_index": 11, "premises": ["(S \u2194 R)", "((P \u2227 Q) \u2192 \u00acQ)"], "variables": ["P", "Q", "R", "S"], "complexity": 3, "example_answer": "(S \u2194 R)", "difficulty": {"vars": [2, 4], "statements": [2, 4], "complexity": [1, 3]}}
propositional_logic
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 = ∨...
None
{"source_dataset": "propositional_logic", "source_index": 12, "premises": ["\u00ac(Q \u2192 Q)", "Q", "(Q \u2194 P)"], "variables": ["P", "Q"], "complexity": 3, "example_answer": "(P \u2228 Q)", "difficulty": {"vars": [2, 4], "statements": [2, 4], "complexity": [1, 3]}}
propositional_logic
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 = ∨...
None
{"source_dataset": "propositional_logic", "source_index": 13, "premises": ["Q", "P"], "variables": ["P", "Q"], "complexity": 4, "example_answer": "(\u00acP \u2228 Q)", "difficulty": {"vars": [2, 4], "statements": [2, 4], "complexity": [1, 3]}}
propositional_logic
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 = ∨...
None
{"source_dataset": "propositional_logic", "source_index": 14, "premises": ["(R \u2194 S)", "((R \u2227 P) \u2228 \u00acR)"], "variables": ["P", "Q", "R", "S"], "complexity": 3, "example_answer": "(R \u2194 S)", "difficulty": {"vars": [2, 4], "statements": [2, 4], "complexity": [1, 3]}}
propositional_logic
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 = ∨...
None
{"source_dataset": "propositional_logic", "source_index": 15, "premises": ["((P \u2227 Q) \u2194 (Q \u2192 Q))", "((P \u2227 Q) \u2192 (Q \u2192 P))", "((Q \u2192 P) \u2194 (P \u2194 P))"], "variables": ["P", "Q"], "complexity": 4, "example_answer": "(\u00acP \u2228 Q)", "difficulty": {"vars": [2, 4], "statements": [2,...
propositional_logic
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 = ∨...
None
{"source_dataset": "propositional_logic", "source_index": 16, "premises": ["Q", "Q"], "variables": ["P", "Q", "R", "S"], "complexity": 3, "example_answer": "(Q \u2228 S)", "difficulty": {"vars": [2, 4], "statements": [2, 4], "complexity": [1, 3]}}
propositional_logic
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 = ∨...
None
{"source_dataset": "propositional_logic", "source_index": 17, "premises": ["((P \u2227 Q) \u2192 (P \u2227 Q))", "(Q \u2192 P)"], "variables": ["P", "Q"], "complexity": 4, "example_answer": "(\u00acQ \u2228 P)", "difficulty": {"vars": [2, 4], "statements": [2, 4], "complexity": [1, 3]}}
propositional_logic
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 = ∨...
None
{"source_dataset": "propositional_logic", "source_index": 18, "premises": ["(\u00acP \u2228 (Q \u2192 Q))", "P", "((Q \u2228 P) \u2228 (R \u2228 P))"], "variables": ["P", "Q", "R"], "complexity": 4, "example_answer": "(\u00acR \u2228 P)", "difficulty": {"vars": [2, 4], "statements": [2, 4], "complexity": [1, 3]}}
propositional_logic
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 = ∨...
None
{"source_dataset": "propositional_logic", "source_index": 19, "premises": ["(\u00acQ \u2228 \u00acR)", "Q"], "variables": ["P", "Q", "R"], "complexity": 3, "example_answer": "(Q \u2227 Q)", "difficulty": {"vars": [2, 4], "statements": [2, 4], "complexity": [1, 3]}}
propositional_logic
Given the truthfulness of these statements, please tell me the number of possible solutions: - Statement 1: 'At least 1 of these 7 statements are true.' - Statement 2: 'At most 3 of these 7 statements are false.' - Statement 3: 'Exactly 4 of these 7 statements are true.' - Statement 4: 'Exactly 3 of these 7 statem...
4
{"source_dataset": "self_reference", "source_index": 0, "difficulty": {"difficulty": 5}}
self_reference
Given the truthfulness of these statements, please tell me the number of possible solutions: - Statement 1: 'At least 4 of these 7 statements are true.' - Statement 2: 'At most 5 of these 7 statements are false.' - Statement 3: 'Exactly 7 of these 7 statements are true.' - Statement 4: 'Exactly 1 of these 7 statem...
4
{"source_dataset": "self_reference", "source_index": 1, "difficulty": {"difficulty": 5}}
self_reference
Given the truthfulness of these statements, please tell me the number of possible solutions: - Statement 1: 'At least 2 of these 7 statements are true.' - Statement 2: 'At most 5 of these 7 statements are false.' - Statement 3: 'Exactly 0 of these 7 statements are true.' - Statement 4: 'Exactly 3 of these 7 statem...
2
{"source_dataset": "self_reference", "source_index": 2, "difficulty": {"difficulty": 5}}
self_reference
Given the truthfulness of these statements, please tell me the number of possible solutions: - Statement 1: 'At least 7 of these 7 statements are true.' - Statement 2: 'At most 2 of these 7 statements are false.' - Statement 3: 'Exactly 0 of these 7 statements are true.' - Statement 4: 'Exactly 4 of these 7 statem...
1
{"source_dataset": "self_reference", "source_index": 3, "difficulty": {"difficulty": 5}}
self_reference
Given the truthfulness of these statements, please tell me the number of possible solutions: - Statement 1: 'At least 5 of these 7 statements are true.' - Statement 2: 'At most 0 of these 7 statements are false.' - Statement 3: 'Exactly 5 of these 7 statements are true.' - Statement 4: 'Exactly 4 of these 7 statem...
2
{"source_dataset": "self_reference", "source_index": 4, "difficulty": {"difficulty": 5}}
self_reference
Given the truthfulness of these statements, please tell me the number of possible solutions: - Statement 1: 'At least 2 of these 7 statements are true.' - Statement 2: 'At most 3 of these 7 statements are false.' - Statement 3: 'Exactly 5 of these 7 statements are true.' - Statement 4: 'Exactly 2 of these 7 statem...
5
{"source_dataset": "self_reference", "source_index": 5, "difficulty": {"difficulty": 5}}
self_reference
Given the truthfulness of these statements, please tell me the number of possible solutions: - Statement 1: 'At least 6 of these 7 statements are true.' - Statement 2: 'At most 7 of these 7 statements are false.' - Statement 3: 'Exactly 5 of these 7 statements are true.' - Statement 4: 'Exactly 2 of these 7 statem...
2
{"source_dataset": "self_reference", "source_index": 6, "difficulty": {"difficulty": 5}}
self_reference
Given the truthfulness of these statements, please tell me the number of possible solutions: - Statement 1: 'At least 4 of these 7 statements are true.' - Statement 2: 'At most 3 of these 7 statements are false.' - Statement 3: 'Exactly 0 of these 7 statements are true.' - Statement 4: 'Exactly 2 of these 7 statem...
2
{"source_dataset": "self_reference", "source_index": 7, "difficulty": {"difficulty": 5}}
self_reference
Given the truthfulness of these statements, please tell me the number of possible solutions: - Statement 1: 'At least 4 of these 7 statements are true.' - Statement 2: 'At most 1 of these 7 statements are false.' - Statement 3: 'Exactly 4 of these 7 statements are true.' - Statement 4: 'Exactly 3 of these 7 statem...
2
{"source_dataset": "self_reference", "source_index": 8, "difficulty": {"difficulty": 5}}
self_reference
Given the truthfulness of these statements, please tell me the number of possible solutions: - Statement 1: 'At least 7 of these 7 statements are true.' - Statement 2: 'At most 1 of these 7 statements are false.' - Statement 3: 'Exactly 1 of these 7 statements are true.' - Statement 4: 'Exactly 7 of these 7 statem...
0
{"source_dataset": "self_reference", "source_index": 9, "difficulty": {"difficulty": 5}}
self_reference
Given the truthfulness of these statements, please tell me the number of possible solutions: - Statement 1: 'At least 3 of these 7 statements are true.' - Statement 2: 'At most 3 of these 7 statements are false.' - Statement 3: 'Exactly 7 of these 7 statements are true.' - Statement 4: 'Exactly 2 of these 7 statem...
4
{"source_dataset": "self_reference", "source_index": 10, "difficulty": {"difficulty": 5}}
self_reference
Given the truthfulness of these statements, please tell me the number of possible solutions: - Statement 1: 'At least 7 of these 7 statements are true.' - Statement 2: 'At most 7 of these 7 statements are false.' - Statement 3: 'Exactly 5 of these 7 statements are true.' - Statement 4: 'Exactly 2 of these 7 statem...
2
{"source_dataset": "self_reference", "source_index": 11, "difficulty": {"difficulty": 5}}
self_reference
Given the truthfulness of these statements, please tell me the number of possible solutions: - Statement 1: 'At least 7 of these 7 statements are true.' - Statement 2: 'At most 2 of these 7 statements are false.' - Statement 3: 'Exactly 4 of these 7 statements are true.' - Statement 4: 'Exactly 5 of these 7 statem...
2
{"source_dataset": "self_reference", "source_index": 12, "difficulty": {"difficulty": 5}}
self_reference
Given the truthfulness of these statements, please tell me the number of possible solutions: - Statement 1: 'At least 3 of these 7 statements are true.' - Statement 2: 'At most 1 of these 7 statements are false.' - Statement 3: 'Exactly 6 of these 7 statements are true.' - Statement 4: 'Exactly 2 of these 7 statem...
3
{"source_dataset": "self_reference", "source_index": 13, "difficulty": {"difficulty": 5}}
self_reference
Given the truthfulness of these statements, please tell me the number of possible solutions: - Statement 1: 'At least 5 of these 7 statements are true.' - Statement 2: 'At most 5 of these 7 statements are false.' - Statement 3: 'Exactly 5 of these 7 statements are true.' - Statement 4: 'Exactly 2 of these 7 statem...
5
{"source_dataset": "self_reference", "source_index": 14, "difficulty": {"difficulty": 5}}
self_reference
Given the truthfulness of these statements, please tell me the number of possible solutions: - Statement 1: 'At least 4 of these 7 statements are true.' - Statement 2: 'At most 4 of these 7 statements are false.' - Statement 3: 'Exactly 5 of these 7 statements are true.' - Statement 4: 'Exactly 0 of these 7 statem...
4
{"source_dataset": "self_reference", "source_index": 15, "difficulty": {"difficulty": 5}}
self_reference
Given the truthfulness of these statements, please tell me the number of possible solutions: - Statement 1: 'At least 1 of these 7 statements are true.' - Statement 2: 'At most 3 of these 7 statements are false.' - Statement 3: 'Exactly 5 of these 7 statements are true.' - Statement 4: 'Exactly 4 of these 7 statem...
3
{"source_dataset": "self_reference", "source_index": 16, "difficulty": {"difficulty": 5}}
self_reference
Given the truthfulness of these statements, please tell me the number of possible solutions: - Statement 1: 'At least 2 of these 7 statements are true.' - Statement 2: 'At most 0 of these 7 statements are false.' - Statement 3: 'Exactly 1 of these 7 statements are true.' - Statement 4: 'Exactly 7 of these 7 statem...
2
{"source_dataset": "self_reference", "source_index": 17, "difficulty": {"difficulty": 5}}
self_reference
Given the truthfulness of these statements, please tell me the number of possible solutions: - Statement 1: 'At least 5 of these 7 statements are true.' - Statement 2: 'At most 2 of these 7 statements are false.' - Statement 3: 'Exactly 3 of these 7 statements are true.' - Statement 4: 'Exactly 1 of these 7 statem...
2
{"source_dataset": "self_reference", "source_index": 18, "difficulty": {"difficulty": 5}}
self_reference
Given the truthfulness of these statements, please tell me the number of possible solutions: - Statement 1: 'At least 6 of these 7 statements are true.' - Statement 2: 'At most 3 of these 7 statements are false.' - Statement 3: 'Exactly 4 of these 7 statements are true.' - Statement 4: 'Exactly 3 of these 7 statem...
2
{"source_dataset": "self_reference", "source_index": 19, "difficulty": {"difficulty": 5}}
self_reference