quiz stringlengths 627 1.05k | names listlengths 9 11 | knight_knave dict | solution listlengths 9 11 | solution_text stringlengths 162 232 | solution_text_format stringlengths 185 263 | cot_head stringclasses 1
value | cot_repeat_steps listlengths 9 215 | cot_foot stringclasses 1
value | statements stringlengths 207 548 | index int64 100 1.1k |
|---|---|---|---|---|---|---|---|---|---|---|
A very special island is inhabited only by knights and knaves. Knights always tell the truth, and knaves always lie. You meet 10 inhabitants: Jackson, Aiden, Elizabeth, Matthew, Emily, Victoria, Grace, Ava, Evelyn, and Olivia. "Evelyn is a knave and Evelyn is a knight" - Jackson. Aiden commented, "Victoria is a knight"... | [
"Jackson",
"Aiden",
"Elizabeth",
"Matthew",
"Emily",
"Victoria",
"Grace",
"Ava",
"Evelyn",
"Olivia"
] | {
"knight": "knight",
"knave": "knave",
"a_knight": "a knight",
"a_knave": "a knave",
"Knight": "Knight",
"Knave": "Knave"
} | [
false,
true,
true,
true,
false,
true,
true,
true,
false,
true
] | Jackson is a knave, Aiden is a knight, Elizabeth is a knight, Matthew is a knight, Emily is a knave, Victoria is a knight, Grace is a knight, Ava is a knight, Evelyn is a knave, and Olivia is a knight. | (1) Jackson is a knave
(2) Aiden is a knight
(3) Elizabeth is a knight
(4) Matthew is a knight
(5) Emily is a knave
(6) Victoria is a knight
(7) Grace is a knight
(8) Ava is a knight
(9) Evelyn is a knave
(10) Olivia is a knight | Let's think step by step, by considering whether each person is lying and if that leads to contradiction. | [
"Jackson cannot be a knight, because this would contradict the claim of their own that Evelyn is a knave and Evelyn is a knight.",
"Assume Jackson is a knave. No contradiction is found in their false claim that Evelyn is a knave and Evelyn is a knight.",
"Assume Evelyn is a knight. No contradiction is found in ... | This leads to a feasible solution. | (('and', ('lying', 8), ('telling-truth', 8)), ('telling-truth', 5), ('<=>', ('telling-truth', 9), ('telling-truth', 6)), ('or', ('telling-truth', 7), ('telling-truth', 6)), ('<=>', ('lying', 5), ('telling-truth', 1)), ('<=>', ('telling-truth', 6), ('telling-truth', 5)), ('<=>', ('telling-truth', 3), ('telling-truth', 5... | 100 |
A very special island is inhabited only by knights and knaves. Knights always tell the truth, and knaves always lie. You meet 10 inhabitants: Evelyn, Owen, Samuel, Sophia, Ethan, Michael, Abigail, Penelope, Amelia, and Isabella. Evelyn told you that Michael is a knave and Sophia is a knave. According to Owen, "Evelyn i... | [
"Evelyn",
"Owen",
"Samuel",
"Sophia",
"Ethan",
"Michael",
"Abigail",
"Penelope",
"Amelia",
"Isabella"
] | {
"knight": "knight",
"knave": "knave",
"a_knight": "a knight",
"a_knave": "a knave",
"Knight": "Knight",
"Knave": "Knave"
} | [
false,
true,
true,
true,
false,
false,
false,
true,
true,
true
] | Evelyn is a knave, Owen is a knight, Samuel is a knight, Sophia is a knight, Ethan is a knave, Michael is a knave, Abigail is a knave, Penelope is a knight, Amelia is a knight, and Isabella is a knight. | (1) Evelyn is a knave
(2) Owen is a knight
(3) Samuel is a knight
(4) Sophia is a knight
(5) Ethan is a knave
(6) Michael is a knave
(7) Abigail is a knave
(8) Penelope is a knight
(9) Amelia is a knight
(10) Isabella is a knight | Let's think step by step, by considering whether each person is lying and if that leads to contradiction. | [
"Assume Evelyn is a knight. No contradiction is found in their claim that Michael is a knave and Sophia is a knave.",
"Michael cannot be a knight, because this would contradict the claim of Evelyn that Michael is a knave and Sophia is a knave.",
"Assume Michael is a knave. No contradiction is found in their fal... | This leads to a feasible solution. | (('and', ('lying', 5), ('lying', 3)), ('or', ('lying', 0), ('lying', 9)), ('<=>', ('telling-truth', 0), ('lying', 3)), ('->', ('lying', 2), ('telling-truth', 9)), ('not', ('lying', 0)), ('or', ('lying', 2), ('lying', 3)), ('not', ('telling-truth', 7)), ('->', ('telling-truth', 6), ('lying', 0)), ('<=>', ('lying', 4), (... | 101 |
A very special island is inhabited only by knights and knaves. Knights always tell the truth, and knaves always lie. You meet 10 inhabitants: Riley, Amelia, Jacob, Charlotte, Luke, Aiden, Benjamin, Sebastian, Abigail, and Michael. Riley remarked, "Abigail is a knight if and only if Abigail is a knave". Amelia noted, "I... | [
"Riley",
"Amelia",
"Jacob",
"Charlotte",
"Luke",
"Aiden",
"Benjamin",
"Sebastian",
"Abigail",
"Michael"
] | {
"knight": "knight",
"knave": "knave",
"a_knight": "a knight",
"a_knave": "a knave",
"Knight": "Knight",
"Knave": "Knave"
} | [
false,
true,
false,
false,
false,
false,
true,
true,
true,
false
] | Riley is a knave, Amelia is a knight, Jacob is a knave, Charlotte is a knave, Luke is a knave, Aiden is a knave, Benjamin is a knight, Sebastian is a knight, Abigail is a knight, and Michael is a knave. | (1) Riley is a knave
(2) Amelia is a knight
(3) Jacob is a knave
(4) Charlotte is a knave
(5) Luke is a knave
(6) Aiden is a knave
(7) Benjamin is a knight
(8) Sebastian is a knight
(9) Abigail is a knight
(10) Michael is a knave | Let's think step by step, by considering whether each person is lying and if that leads to contradiction. | [
"Riley cannot be a knight, because this would contradict the claim of their own that Abigail is a knight if and only if Abigail is a knave.",
"Assume Riley is a knave. No contradiction is found in their false claim that Abigail is a knight if and only if Abigail is a knave.",
"Assume Abigail is a knight. No con... | This leads to a feasible solution. | (('<=>', ('telling-truth', 8), ('lying', 8)), ('->', ('lying', 4), ('lying', 0)), ('lying', 6), ('and', ('lying', 8), ('telling-truth', 2)), ('and', ('lying', 9), ('lying', 7)), ('lying', 8), ('or', ('lying', 5), ('telling-truth', 2)), ('not', ('telling-truth', 3)), ('<=>', ('telling-truth', 7), ('lying', 5)), ('<=>', ... | 102 |
A very special island is inhabited only by knights and knaves. Knights always tell the truth, and knaves always lie. You meet 10 inhabitants: Joseph, Sebastian, Isabella, Lily, Evelyn, Aurora, Amelia, Emily, Owen, and Elizabeth. Joseph noted, "Amelia is a knight". According to Sebastian, "Emily is a knave or Emily is a... | [
"Joseph",
"Sebastian",
"Isabella",
"Lily",
"Evelyn",
"Aurora",
"Amelia",
"Emily",
"Owen",
"Elizabeth"
] | {
"knight": "knight",
"knave": "knave",
"a_knight": "a knight",
"a_knave": "a knave",
"Knight": "Knight",
"Knave": "Knave"
} | [
true,
true,
true,
false,
false,
true,
true,
false,
false,
false
] | Joseph is a knight, Sebastian is a knight, Isabella is a knight, Lily is a knave, Evelyn is a knave, Aurora is a knight, Amelia is a knight, Emily is a knave, Owen is a knave, and Elizabeth is a knave. | (1) Joseph is a knight
(2) Sebastian is a knight
(3) Isabella is a knight
(4) Lily is a knave
(5) Evelyn is a knave
(6) Aurora is a knight
(7) Amelia is a knight
(8) Emily is a knave
(9) Owen is a knave
(10) Elizabeth is a knave | Let's think step by step, by considering whether each person is lying and if that leads to contradiction. | [
"Assume Joseph is a knight. No contradiction is found in their claim that Amelia is a knight.",
"Assume Amelia is a knight. No contradiction is found in their claim that If Joseph is a knight then Amelia is a knight.",
"Assume Sebastian is a knight. No contradiction is found in their claim that Emily is a knave... | This leads to a feasible solution. | (('telling-truth', 6), ('or', ('lying', 7), ('telling-truth', 7)), ('->', ('lying', 0), ('lying', 4)), ('and', ('telling-truth', 9), ('telling-truth', 0)), ('not', ('lying', 3)), ('and', ('lying', 9), ('telling-truth', 2)), ('->', ('telling-truth', 0), ('telling-truth', 6)), ('and', ('telling-truth', 6), ('telling-trut... | 103 |
A very special island is inhabited only by knights and knaves. Knights always tell the truth, and knaves always lie. You meet 10 inhabitants: Samuel, Evelyn, Lucas, Daniel, Henry, Avery, Scarlett, Amelia, Aurora, and James. "Daniel is a knave and Aurora is a knave," Samuel claimed. Evelyn commented, "If James is a knig... | [
"Samuel",
"Evelyn",
"Lucas",
"Daniel",
"Henry",
"Avery",
"Scarlett",
"Amelia",
"Aurora",
"James"
] | {
"knight": "knight",
"knave": "knave",
"a_knight": "a knight",
"a_knave": "a knave",
"Knight": "Knight",
"Knave": "Knave"
} | [
false,
true,
true,
false,
false,
true,
true,
true,
true,
false
] | Samuel is a knave, Evelyn is a knight, Lucas is a knight, Daniel is a knave, Henry is a knave, Avery is a knight, Scarlett is a knight, Amelia is a knight, Aurora is a knight, and James is a knave. | (1) Samuel is a knave
(2) Evelyn is a knight
(3) Lucas is a knight
(4) Daniel is a knave
(5) Henry is a knave
(6) Avery is a knight
(7) Scarlett is a knight
(8) Amelia is a knight
(9) Aurora is a knight
(10) James is a knave | Let's think step by step, by considering whether each person is lying and if that leads to contradiction. | [
"Assume Samuel is a knight. No contradiction is found in their claim that Daniel is a knave and Aurora is a knave.",
"Daniel cannot be a knight, because this would contradict the claim of Samuel that Daniel is a knave and Aurora is a knave.",
"Assume Daniel is a knave. No contradiction is found in their false c... | This leads to a feasible solution. | (('and', ('lying', 3), ('lying', 8)), ('->', ('telling-truth', 9), ('telling-truth', 4)), ('lying', 4), ('and', ('telling-truth', 5), ('telling-truth', 0)), ('and', ('lying', 5), ('telling-truth', 4)), ('not', ('telling-truth', 3)), ('->', ('telling-truth', 1), ('lying', 0)), ('not', ('telling-truth', 9)), ('<=>', ('te... | 104 |
A very special island is inhabited only by knights and knaves. Knights always tell the truth, and knaves always lie. You meet 10 inhabitants: Noah, Daniel, Aiden, Scarlett, Jack, Liam, Joseph, Charlotte, Owen, and Lily. As Noah put it, "If Liam is a knight then Daniel is a knave". Daniel asserted: "Joseph is a knave if... | [
"Noah",
"Daniel",
"Aiden",
"Scarlett",
"Jack",
"Liam",
"Joseph",
"Charlotte",
"Owen",
"Lily"
] | {
"knight": "knight",
"knave": "knave",
"a_knight": "a knight",
"a_knave": "a knave",
"Knight": "Knight",
"Knave": "Knave"
} | [
true,
false,
false,
false,
true,
true,
true,
false,
true,
false
] | Noah is a knight, Daniel is a knave, Aiden is a knave, Scarlett is a knave, Jack is a knight, Liam is a knight, Joseph is a knight, Charlotte is a knave, Owen is a knight, and Lily is a knave. | (1) Noah is a knight
(2) Daniel is a knave
(3) Aiden is a knave
(4) Scarlett is a knave
(5) Jack is a knight
(6) Liam is a knight
(7) Joseph is a knight
(8) Charlotte is a knave
(9) Owen is a knight
(10) Lily is a knave | Let's think step by step, by considering whether each person is lying and if that leads to contradiction. | [
"Assume Noah is a knight. No contradiction is found in their claim that If Liam is a knight then Daniel is a knave.",
"Assume Liam is a knight. No contradiction is found in their claim that Charlotte is a knave if and only if Daniel is a knave.",
"Assume Charlotte is a knight. No contradiction is found in their... | This leads to a feasible solution. | (('->', ('telling-truth', 5), ('lying', 1)), ('<=>', ('lying', 6), ('telling-truth', 8)), ('not', ('telling-truth', 6)), ('and', ('telling-truth', 7), ('lying', 7)), ('->', ('telling-truth', 4), ('telling-truth', 6)), ('<=>', ('lying', 7), ('lying', 1)), ('or', ('telling-truth', 9), ('telling-truth', 6)), ('and', ('lyi... | 105 |
A very special island is inhabited only by knights and knaves. Knights always tell the truth, and knaves always lie. You meet 10 inhabitants: Penelope, Matthew, Ethan, Liam, Owen, Michael, Sophia, Alexander, Charlotte, and Noah. Penelope said that Michael is a knight and Charlotte is a knave. "Ethan is a knave," Matthe... | [
"Penelope",
"Matthew",
"Ethan",
"Liam",
"Owen",
"Michael",
"Sophia",
"Alexander",
"Charlotte",
"Noah"
] | {
"knight": "knight",
"knave": "knave",
"a_knight": "a knight",
"a_knave": "a knave",
"Knight": "Knight",
"Knave": "Knave"
} | [
false,
true,
false,
true,
false,
false,
true,
false,
true,
false
] | Penelope is a knave, Matthew is a knight, Ethan is a knave, Liam is a knight, Owen is a knave, Michael is a knave, Sophia is a knight, Alexander is a knave, Charlotte is a knight, and Noah is a knave. | (1) Penelope is a knave
(2) Matthew is a knight
(3) Ethan is a knave
(4) Liam is a knight
(5) Owen is a knave
(6) Michael is a knave
(7) Sophia is a knight
(8) Alexander is a knave
(9) Charlotte is a knight
(10) Noah is a knave | Let's think step by step, by considering whether each person is lying and if that leads to contradiction. | [
"Assume Penelope is a knight. No contradiction is found in their claim that Michael is a knight and Charlotte is a knave.",
"Assume Michael is a knight. No contradiction is found in their claim that Charlotte is a knave or Alexander is a knight.",
"Charlotte cannot be a knight, because this would contradict the... | This leads to a feasible solution. | (('and', ('telling-truth', 5), ('lying', 8)), ('lying', 2), ('and', ('telling-truth', 0), ('lying', 7)), ('and', ('lying', 2), ('lying', 0)), ('telling-truth', 7), ('or', ('lying', 8), ('telling-truth', 7)), ('not', ('telling-truth', 7)), ('not', ('lying', 2)), ('not', ('telling-truth', 9)), ('<=>', ('telling-truth', 7... | 106 |
A very special island is inhabited only by knights and knaves. Knights always tell the truth, and knaves always lie. You meet 10 inhabitants: Chloe, Oliver, Noah, Ava, Lily, Ella, Amelia, Lucas, Evelyn, and Luke. Chloe noted, "If Lily is a knight then Ella is a knight". In Oliver's words: "Lucas is a knight and Evelyn ... | [
"Chloe",
"Oliver",
"Noah",
"Ava",
"Lily",
"Ella",
"Amelia",
"Lucas",
"Evelyn",
"Luke"
] | {
"knight": "knight",
"knave": "knave",
"a_knight": "a knight",
"a_knave": "a knave",
"Knight": "Knight",
"Knave": "Knave"
} | [
true,
true,
true,
false,
false,
true,
false,
true,
false,
false
] | Chloe is a knight, Oliver is a knight, Noah is a knight, Ava is a knave, Lily is a knave, Ella is a knight, Amelia is a knave, Lucas is a knight, Evelyn is a knave, and Luke is a knave. | (1) Chloe is a knight
(2) Oliver is a knight
(3) Noah is a knight
(4) Ava is a knave
(5) Lily is a knave
(6) Ella is a knight
(7) Amelia is a knave
(8) Lucas is a knight
(9) Evelyn is a knave
(10) Luke is a knave | Let's think step by step, by considering whether each person is lying and if that leads to contradiction. | [
"Assume Chloe is a knight. No contradiction is found in their claim that If Lily is a knight then Ella is a knight.",
"Assume Lily is a knight. No contradiction is found in their claim that If Ella is a knight then Luke is a knight.",
"Assume Ella is a knight. No contradiction is found in their claim that Ella ... | This leads to a feasible solution. | (('->', ('telling-truth', 4), ('telling-truth', 5)), ('and', ('telling-truth', 7), ('lying', 8)), ('->', ('lying', 5), ('telling-truth', 6)), ('lying', 0), ('->', ('telling-truth', 5), ('telling-truth', 9)), ('or', ('telling-truth', 5), ('lying', 0)), ('<=>', ('lying', 4), ('telling-truth', 4)), ('<=>', ('lying', 6), (... | 107 |
A very special island is inhabited only by knights and knaves. Knights always tell the truth, and knaves always lie. You meet 10 inhabitants: Aria, Evelyn, Harper, Aurora, Sebastian, Chloe, Penelope, Sophia, Mia, and Sofia. "Penelope is a knight or Evelyn is a knight" - Aria. Evelyn stated, "If Aria is a knave then Mia... | [
"Aria",
"Evelyn",
"Harper",
"Aurora",
"Sebastian",
"Chloe",
"Penelope",
"Sophia",
"Mia",
"Sofia"
] | {
"knight": "knight",
"knave": "knave",
"a_knight": "a knight",
"a_knave": "a knave",
"Knight": "Knight",
"Knave": "Knave"
} | [
true,
true,
false,
false,
true,
true,
false,
false,
true,
false
] | Aria is a knight, Evelyn is a knight, Harper is a knave, Aurora is a knave, Sebastian is a knight, Chloe is a knight, Penelope is a knave, Sophia is a knave, Mia is a knight, and Sofia is a knave. | (1) Aria is a knight
(2) Evelyn is a knight
(3) Harper is a knave
(4) Aurora is a knave
(5) Sebastian is a knight
(6) Chloe is a knight
(7) Penelope is a knave
(8) Sophia is a knave
(9) Mia is a knight
(10) Sofia is a knave | Let's think step by step, by considering whether each person is lying and if that leads to contradiction. | [
"Assume Aria is a knight. No contradiction is found in their claim that Penelope is a knight or Evelyn is a knight.",
"Assume Penelope is a knight. No contradiction is found in their claim that Aria is a knight if and only if Aurora is a knight.",
"Assume Aurora is a knight. No contradiction is found in their c... | This leads to a feasible solution. | (('or', ('telling-truth', 6), ('telling-truth', 1)), ('->', ('lying', 0), ('telling-truth', 8)), ('and', ('lying', 8), ('telling-truth', 1)), ('not', ('telling-truth', 4)), ('->', ('lying', 7), ('telling-truth', 4)), ('or', ('telling-truth', 1), ('telling-truth', 9)), ('<=>', ('telling-truth', 0), ('telling-truth', 3))... | 108 |
A very special island is inhabited only by knights and knaves. Knights always tell the truth, and knaves always lie. You meet 10 inhabitants: Jack, Victoria, Ella, Ethan, William, Lucas, Riley, Penelope, Sofia, and Olivia. Jack remarked, "If Olivia is a knave then William is a knave". Victoria commented, "Jack is a kna... | [
"Jack",
"Victoria",
"Ella",
"Ethan",
"William",
"Lucas",
"Riley",
"Penelope",
"Sofia",
"Olivia"
] | {
"knight": "knight",
"knave": "knave",
"a_knight": "a knight",
"a_knave": "a knave",
"Knight": "Knight",
"Knave": "Knave"
} | [
true,
false,
true,
true,
false,
false,
false,
true,
true,
false
] | Jack is a knight, Victoria is a knave, Ella is a knight, Ethan is a knight, William is a knave, Lucas is a knave, Riley is a knave, Penelope is a knight, Sofia is a knight, and Olivia is a knave. | (1) Jack is a knight
(2) Victoria is a knave
(3) Ella is a knight
(4) Ethan is a knight
(5) William is a knave
(6) Lucas is a knave
(7) Riley is a knave
(8) Penelope is a knight
(9) Sofia is a knight
(10) Olivia is a knave | Let's think step by step, by considering whether each person is lying and if that leads to contradiction. | [
"Assume Jack is a knight. No contradiction is found in their claim that If Olivia is a knave then William is a knave.",
"Assume Olivia is a knight. No contradiction is found in their claim that Ella is not a knight.",
"Ella cannot be a knight, because this would contradict the claim of Olivia that Ella is not a... | This leads to a feasible solution. | (('->', ('lying', 9), ('lying', 4)), ('and', ('lying', 0), ('lying', 9)), ('or', ('lying', 7), ('telling-truth', 0)), ('not', ('telling-truth', 4)), ('not', ('lying', 6)), ('<=>', ('telling-truth', 1), ('lying', 1)), ('or', ('lying', 8), ('telling-truth', 6)), ('->', ('telling-truth', 4), ('lying', 0)), ('<=>', ('lying... | 109 |
A very special island is inhabited only by knights and knaves. Knights always tell the truth, and knaves always lie. You meet 10 inhabitants: Michael, Charlotte, Evelyn, Benjamin, Liam, Elizabeth, Sofia, Emma, Samuel, and James. Michael said that James is a knave if and only if Sofia is a knave. "Evelyn is a knave and ... | [
"Michael",
"Charlotte",
"Evelyn",
"Benjamin",
"Liam",
"Elizabeth",
"Sofia",
"Emma",
"Samuel",
"James"
] | {
"knight": "knight",
"knave": "knave",
"a_knight": "a knight",
"a_knave": "a knave",
"Knight": "Knight",
"Knave": "Knave"
} | [
true,
false,
false,
false,
true,
false,
true,
false,
true,
true
] | Michael is a knight, Charlotte is a knave, Evelyn is a knave, Benjamin is a knave, Liam is a knight, Elizabeth is a knave, Sofia is a knight, Emma is a knave, Samuel is a knight, and James is a knight. | (1) Michael is a knight
(2) Charlotte is a knave
(3) Evelyn is a knave
(4) Benjamin is a knave
(5) Liam is a knight
(6) Elizabeth is a knave
(7) Sofia is a knight
(8) Emma is a knave
(9) Samuel is a knight
(10) James is a knight | Let's think step by step, by considering whether each person is lying and if that leads to contradiction. | [
"Assume Michael is a knight. No contradiction is found in their claim that James is a knave if and only if Sofia is a knave.",
"Assume James is a knight. No contradiction is found in their claim that If Emma is a knight then Samuel is a knave.",
"Assume Emma is a knight. No contradiction is found in their claim... | This leads to a feasible solution. | (('<=>', ('lying', 9), ('lying', 6)), ('and', ('lying', 2), ('telling-truth', 7)), ('telling-truth', 7), ('and', ('lying', 9), ('telling-truth', 8)), ('and', ('lying', 1), ('telling-truth', 6)), ('->', ('lying', 2), ('lying', 0)), ('->', ('telling-truth', 5), ('lying', 3)), ('telling-truth', 1), ('not', ('telling-truth... | 110 |
A very special island is inhabited only by knights and knaves. Knights always tell the truth, and knaves always lie. You meet 10 inhabitants: Elizabeth, Michael, Sofia, Logan, Aiden, Joseph, Ella, Grace, Penelope, and Sebastian. In a statement by Elizabeth: "Sofia is a knave or Sofia is a knight". Michael expressed tha... | [
"Elizabeth",
"Michael",
"Sofia",
"Logan",
"Aiden",
"Joseph",
"Ella",
"Grace",
"Penelope",
"Sebastian"
] | {
"knight": "knight",
"knave": "knave",
"a_knight": "a knight",
"a_knave": "a knave",
"Knight": "Knight",
"Knave": "Knave"
} | [
true,
false,
true,
false,
true,
true,
true,
false,
true,
false
] | Elizabeth is a knight, Michael is a knave, Sofia is a knight, Logan is a knave, Aiden is a knight, Joseph is a knight, Ella is a knight, Grace is a knave, Penelope is a knight, and Sebastian is a knave. | (1) Elizabeth is a knight
(2) Michael is a knave
(3) Sofia is a knight
(4) Logan is a knave
(5) Aiden is a knight
(6) Joseph is a knight
(7) Ella is a knight
(8) Grace is a knave
(9) Penelope is a knight
(10) Sebastian is a knave | Let's think step by step, by considering whether each person is lying and if that leads to contradiction. | [
"Assume Elizabeth is a knight. No contradiction is found in their claim that Sofia is a knave or Sofia is a knight.",
"Assume Sofia is a knight. No contradiction is found in their claim that If Ella is a knave then Sebastian is a knave.",
"Assume Ella is a knight. No contradiction is found in their claim that M... | This leads to a feasible solution. | (('or', ('lying', 2), ('telling-truth', 2)), ('not', ('telling-truth', 2)), ('->', ('lying', 6), ('lying', 9)), ('not', ('telling-truth', 0)), ('->', ('telling-truth', 3), ('telling-truth', 2)), ('lying', 1), ('not', ('telling-truth', 1)), ('->', ('lying', 1), ('telling-truth', 9)), ('not', ('telling-truth', 7)), ('not... | 111 |
A very special island is inhabited only by knights and knaves. Knights always tell the truth, and knaves always lie. You meet 10 inhabitants: Mason, Jackson, Elizabeth, Alexander, James, Amelia, Aurora, Emily, Joseph, and Victoria. Mason stated, "Amelia is a knight if and only if Emily is a knave". In a statement by Ja... | [
"Mason",
"Jackson",
"Elizabeth",
"Alexander",
"James",
"Amelia",
"Aurora",
"Emily",
"Joseph",
"Victoria"
] | {
"knight": "knight",
"knave": "knave",
"a_knight": "a knight",
"a_knave": "a knave",
"Knight": "Knight",
"Knave": "Knave"
} | [
true,
true,
false,
true,
true,
false,
true,
true,
false,
true
] | Mason is a knight, Jackson is a knight, Elizabeth is a knave, Alexander is a knight, James is a knight, Amelia is a knave, Aurora is a knight, Emily is a knight, Joseph is a knave, and Victoria is a knight. | (1) Mason is a knight
(2) Jackson is a knight
(3) Elizabeth is a knave
(4) Alexander is a knight
(5) James is a knight
(6) Amelia is a knave
(7) Aurora is a knight
(8) Emily is a knight
(9) Joseph is a knave
(10) Victoria is a knight | Let's think step by step, by considering whether each person is lying and if that leads to contradiction. | [
"Assume Mason is a knight. No contradiction is found in their claim that Amelia is a knight if and only if Emily is a knave.",
"Assume Amelia is a knight. No contradiction is found in their claim that Emily is a knave and Joseph is a knave.",
"Emily cannot be a knight, because this would contradict the claim of... | This leads to a feasible solution. | (('<=>', ('telling-truth', 5), ('lying', 7)), ('or', ('telling-truth', 1), ('telling-truth', 9)), ('lying', 6), ('not', ('lying', 9)), ('and', ('telling-truth', 1), ('lying', 2)), ('and', ('lying', 7), ('lying', 8)), ('->', ('lying', 9), ('telling-truth', 9)), ('or', ('telling-truth', 6), ('lying', 2)), ('and', ('telli... | 112 |
A very special island is inhabited only by knights and knaves. Knights always tell the truth, and knaves always lie. You meet 10 inhabitants: Sebastian, Mia, Joseph, Aurora, Emily, Noah, Sofia, Elizabeth, Henry, and Penelope. Sebastian was heard saying, "Joseph is not a knave". Mia expressed that Joseph is not a knight... | [
"Sebastian",
"Mia",
"Joseph",
"Aurora",
"Emily",
"Noah",
"Sofia",
"Elizabeth",
"Henry",
"Penelope"
] | {
"knight": "knight",
"knave": "knave",
"a_knight": "a knight",
"a_knave": "a knave",
"Knight": "Knight",
"Knave": "Knave"
} | [
true,
false,
true,
false,
true,
false,
false,
true,
true,
true
] | Sebastian is a knight, Mia is a knave, Joseph is a knight, Aurora is a knave, Emily is a knight, Noah is a knave, Sofia is a knave, Elizabeth is a knight, Henry is a knight, and Penelope is a knight. | (1) Sebastian is a knight
(2) Mia is a knave
(3) Joseph is a knight
(4) Aurora is a knave
(5) Emily is a knight
(6) Noah is a knave
(7) Sofia is a knave
(8) Elizabeth is a knight
(9) Henry is a knight
(10) Penelope is a knight | Let's think step by step, by considering whether each person is lying and if that leads to contradiction. | [
"Assume Sebastian is a knight. No contradiction is found in their claim that Joseph is not a knave.",
"Assume Joseph is a knight. No contradiction is found in their claim that Noah is a knave.",
"Noah cannot be a knight, because this would contradict the claim of Joseph that Noah is a knave.",
"Assume Noah is... | This leads to a feasible solution. | (('not', ('lying', 2)), ('not', ('telling-truth', 2)), ('lying', 5), ('not', ('telling-truth', 8)), ('not', ('telling-truth', 6)), ('and', ('lying', 8), ('telling-truth', 7)), ('and', ('telling-truth', 9), ('lying', 9)), ('not', ('telling-truth', 6)), ('->', ('telling-truth', 0), ('telling-truth', 2)), ('->', ('lying',... | 113 |
A very special island is inhabited only by knights and knaves. Knights always tell the truth, and knaves always lie. You meet 10 inhabitants: Avery, Scarlett, Matthew, Harper, Elizabeth, Chloe, Michael, Isabella, Liam, and Sofia. Avery stated, "Liam is a knave or Elizabeth is a knight". As Scarlett put it, "Elizabeth i... | [
"Avery",
"Scarlett",
"Matthew",
"Harper",
"Elizabeth",
"Chloe",
"Michael",
"Isabella",
"Liam",
"Sofia"
] | {
"knight": "knight",
"knave": "knave",
"a_knight": "a knight",
"a_knave": "a knave",
"Knight": "Knight",
"Knave": "Knave"
} | [
true,
true,
false,
false,
true,
false,
true,
false,
false,
false
] | Avery is a knight, Scarlett is a knight, Matthew is a knave, Harper is a knave, Elizabeth is a knight, Chloe is a knave, Michael is a knight, Isabella is a knave, Liam is a knave, and Sofia is a knave. | (1) Avery is a knight
(2) Scarlett is a knight
(3) Matthew is a knave
(4) Harper is a knave
(5) Elizabeth is a knight
(6) Chloe is a knave
(7) Michael is a knight
(8) Isabella is a knave
(9) Liam is a knave
(10) Sofia is a knave | Let's think step by step, by considering whether each person is lying and if that leads to contradiction. | [
"Assume Avery is a knight. No contradiction is found in their claim that Liam is a knave or Elizabeth is a knight.",
"Liam cannot be a knight, because this would contradict the claim of their own that Avery is a knave and Scarlett is a knave.",
"Assume Liam is a knave. No contradiction is found in their false c... | This leads to a feasible solution. | (('or', ('lying', 8), ('telling-truth', 4)), ('or', ('telling-truth', 4), ('lying', 9)), ('or', ('telling-truth', 5), ('lying', 1)), ('and', ('lying', 1), ('lying', 7)), ('<=>', ('telling-truth', 7), ('telling-truth', 9)), ('not', ('lying', 8)), ('or', ('telling-truth', 1), ('telling-truth', 5)), ('and', ('telling-trut... | 114 |
A very special island is inhabited only by knights and knaves. Knights always tell the truth, and knaves always lie. You meet 10 inhabitants: Oliver, Elizabeth, Avery, Aiden, Lucas, Aurora, James, Luke, Aria, and Sofia. Oliver remarked, "Aurora is a knight". Elizabeth remarked, "Avery is a knave if and only if Aiden is... | [
"Oliver",
"Elizabeth",
"Avery",
"Aiden",
"Lucas",
"Aurora",
"James",
"Luke",
"Aria",
"Sofia"
] | {
"knight": "knight",
"knave": "knave",
"a_knight": "a knight",
"a_knave": "a knave",
"Knight": "Knight",
"Knave": "Knave"
} | [
false,
true,
true,
false,
true,
false,
true,
false,
true,
true
] | Oliver is a knave, Elizabeth is a knight, Avery is a knight, Aiden is a knave, Lucas is a knight, Aurora is a knave, James is a knight, Luke is a knave, Aria is a knight, and Sofia is a knight. | (1) Oliver is a knave
(2) Elizabeth is a knight
(3) Avery is a knight
(4) Aiden is a knave
(5) Lucas is a knight
(6) Aurora is a knave
(7) James is a knight
(8) Luke is a knave
(9) Aria is a knight
(10) Sofia is a knight | Let's think step by step, by considering whether each person is lying and if that leads to contradiction. | [
"Assume Oliver is a knight. No contradiction is found in their claim that Aurora is a knight.",
"Aurora cannot be a knight, because this would contradict the claim of their own that Sofia is a knave and Sofia is a knight.",
"Aurora cannot be a knave, because this would contradict the claim of Oliver that Aurora... | This leads to a feasible solution. | (('telling-truth', 5), ('<=>', ('lying', 2), ('telling-truth', 3)), ('->', ('telling-truth', 7), ('lying', 9)), ('not', ('telling-truth', 6)), ('<=>', ('telling-truth', 5), ('lying', 9)), ('and', ('lying', 9), ('telling-truth', 9)), ('not', ('telling-truth', 5)), ('->', ('lying', 3), ('lying', 6)), ('telling-truth', 4)... | 115 |
A very special island is inhabited only by knights and knaves. Knights always tell the truth, and knaves always lie. You meet 10 inhabitants: Sebastian, Ethan, Lily, Owen, Charlotte, Aurora, Michael, Harper, Samuel, and Liam. Sebastian stated, "Lily is a knight and Harper is a knight". Ethan commented, "Ethan is a knig... | [
"Sebastian",
"Ethan",
"Lily",
"Owen",
"Charlotte",
"Aurora",
"Michael",
"Harper",
"Samuel",
"Liam"
] | {
"knight": "knight",
"knave": "knave",
"a_knight": "a knight",
"a_knave": "a knave",
"Knight": "Knight",
"Knave": "Knave"
} | [
false,
true,
false,
true,
true,
false,
false,
false,
true,
false
] | Sebastian is a knave, Ethan is a knight, Lily is a knave, Owen is a knight, Charlotte is a knight, Aurora is a knave, Michael is a knave, Harper is a knave, Samuel is a knight, and Liam is a knave. | (1) Sebastian is a knave
(2) Ethan is a knight
(3) Lily is a knave
(4) Owen is a knight
(5) Charlotte is a knight
(6) Aurora is a knave
(7) Michael is a knave
(8) Harper is a knave
(9) Samuel is a knight
(10) Liam is a knave | Let's think step by step, by considering whether each person is lying and if that leads to contradiction. | [
"Assume Sebastian is a knight. No contradiction is found in their claim that Lily is a knight and Harper is a knight.",
"Lily cannot be a knight, because this would contradict the claim of their own that Ethan is a knave if and only if Ethan is a knight.",
"Lily cannot be a knave, because this would contradict ... | This leads to a feasible solution. | (('and', ('telling-truth', 2), ('telling-truth', 7)), ('or', ('telling-truth', 1), ('telling-truth', 6)), ('<=>', ('lying', 1), ('telling-truth', 1)), ('and', ('telling-truth', 1), ('lying', 9)), ('->', ('lying', 3), ('lying', 7)), ('and', ('telling-truth', 7), ('lying', 7)), ('->', ('lying', 7), ('lying', 8)), ('lying... | 116 |
A very special island is inhabited only by knights and knaves. Knights always tell the truth, and knaves always lie. You meet 10 inhabitants: Noah, James, Luke, Logan, Abigail, Ella, Scarlett, Zoey, Henry, and Benjamin. "Logan is a knight if and only if Henry is a knave" - Noah. James expressed that Henry is a knight. ... | [
"Noah",
"James",
"Luke",
"Logan",
"Abigail",
"Ella",
"Scarlett",
"Zoey",
"Henry",
"Benjamin"
] | {
"knight": "knight",
"knave": "knave",
"a_knight": "a knight",
"a_knave": "a knave",
"Knight": "Knight",
"Knave": "Knave"
} | [
false,
false,
false,
false,
true,
false,
true,
false,
false,
true
] | Noah is a knave, James is a knave, Luke is a knave, Logan is a knave, Abigail is a knight, Ella is a knave, Scarlett is a knight, Zoey is a knave, Henry is a knave, and Benjamin is a knight. | (1) Noah is a knave
(2) James is a knave
(3) Luke is a knave
(4) Logan is a knave
(5) Abigail is a knight
(6) Ella is a knave
(7) Scarlett is a knight
(8) Zoey is a knave
(9) Henry is a knave
(10) Benjamin is a knight | Let's think step by step, by considering whether each person is lying and if that leads to contradiction. | [
"Assume Noah is a knight. No contradiction is found in their claim that Logan is a knight if and only if Henry is a knave.",
"Assume Logan is a knight. No contradiction is found in their claim that Benjamin is not a knight.",
"Benjamin cannot be a knight, because this would contradict the claim of Logan that Be... | This leads to a feasible solution. | (('<=>', ('telling-truth', 3), ('lying', 8)), ('telling-truth', 8), ('and', ('telling-truth', 0), ('lying', 3)), ('not', ('telling-truth', 9)), ('->', ('telling-truth', 1), ('lying', 5)), ('and', ('lying', 6), ('lying', 1)), ('not', ('telling-truth', 2)), ('not', ('lying', 3)), ('not', ('lying', 5)), ('not', ('telling-... | 117 |
A very special island is inhabited only by knights and knaves. Knights always tell the truth, and knaves always lie. You meet 10 inhabitants: James, Lily, Ethan, Michael, Zoey, Chloe, Riley, Oliver, Aurora, and Logan. James stated, "Riley is a knave". Lily was heard saying, "Oliver is a knight and Riley is a knight". I... | [
"James",
"Lily",
"Ethan",
"Michael",
"Zoey",
"Chloe",
"Riley",
"Oliver",
"Aurora",
"Logan"
] | {
"knight": "knight",
"knave": "knave",
"a_knight": "a knight",
"a_knave": "a knave",
"Knight": "Knight",
"Knave": "Knave"
} | [
false,
true,
true,
true,
true,
true,
true,
true,
false,
true
] | James is a knave, Lily is a knight, Ethan is a knight, Michael is a knight, Zoey is a knight, Chloe is a knight, Riley is a knight, Oliver is a knight, Aurora is a knave, and Logan is a knight. | (1) James is a knave
(2) Lily is a knight
(3) Ethan is a knight
(4) Michael is a knight
(5) Zoey is a knight
(6) Chloe is a knight
(7) Riley is a knight
(8) Oliver is a knight
(9) Aurora is a knave
(10) Logan is a knight | Let's think step by step, by considering whether each person is lying and if that leads to contradiction. | [
"Assume James is a knight. No contradiction is found in their claim that Riley is a knave.",
"Riley cannot be a knight, because this would contradict the claim of James that Riley is a knave.",
"Assume Riley is a knave. No contradiction is found in their false claim that If Aurora is a knight then Chloe is a kn... | This leads to a feasible solution. | (('lying', 6), ('and', ('telling-truth', 7), ('telling-truth', 6)), ('and', ('lying', 8), ('telling-truth', 4)), ('or', ('telling-truth', 7), ('telling-truth', 1)), ('not', ('telling-truth', 0)), ('->', ('lying', 7), ('telling-truth', 2)), ('->', ('telling-truth', 8), ('lying', 5)), ('<=>', ('lying', 1), ('lying', 3)),... | 118 |
A very special island is inhabited only by knights and knaves. Knights always tell the truth, and knaves always lie. You meet 10 inhabitants: Penelope, Ethan, Grace, Avery, Ava, Mia, Olivia, Noah, Alexander, and Luke. Penelope stated, "Grace is not a knave". Ethan said that Luke is a knave if and only if Mia is a knave... | [
"Penelope",
"Ethan",
"Grace",
"Avery",
"Ava",
"Mia",
"Olivia",
"Noah",
"Alexander",
"Luke"
] | {
"knight": "knight",
"knave": "knave",
"a_knight": "a knight",
"a_knave": "a knave",
"Knight": "Knight",
"Knave": "Knave"
} | [
true,
false,
true,
false,
true,
false,
false,
true,
false,
true
] | Penelope is a knight, Ethan is a knave, Grace is a knight, Avery is a knave, Ava is a knight, Mia is a knave, Olivia is a knave, Noah is a knight, Alexander is a knave, and Luke is a knight. | (1) Penelope is a knight
(2) Ethan is a knave
(3) Grace is a knight
(4) Avery is a knave
(5) Ava is a knight
(6) Mia is a knave
(7) Olivia is a knave
(8) Noah is a knight
(9) Alexander is a knave
(10) Luke is a knight | Let's think step by step, by considering whether each person is lying and if that leads to contradiction. | [
"Assume Penelope is a knight. No contradiction is found in their claim that Grace is not a knave.",
"Assume Grace is a knight. No contradiction is found in their claim that Mia is a knave.",
"Mia cannot be a knight, because this would contradict the claim of Grace that Mia is a knave.",
"Assume Mia is a knave... | This leads to a feasible solution. | (('not', ('lying', 2)), ('<=>', ('lying', 9), ('lying', 5)), ('lying', 5), ('lying', 4), ('or', ('telling-truth', 6), ('lying', 6)), ('<=>', ('lying', 2), ('telling-truth', 0)), ('not', ('telling-truth', 2)), ('<=>', ('telling-truth', 5), ('lying', 2)), ('or', ('lying', 4), ('telling-truth', 5)), ('not', ('telling-trut... | 119 |
A very special island is inhabited only by knights and knaves. Knights always tell the truth, and knaves always lie. You meet 10 inhabitants: Joseph, Penelope, Michael, Matthew, Abigail, Grace, Zoey, Lucas, Sophia, and Harper. Joseph expressed that Sophia is not a knave. "Joseph is a knave or Grace is a knight" - Penel... | [
"Joseph",
"Penelope",
"Michael",
"Matthew",
"Abigail",
"Grace",
"Zoey",
"Lucas",
"Sophia",
"Harper"
] | {
"knight": "knight",
"knave": "knave",
"a_knight": "a knight",
"a_knave": "a knave",
"Knight": "Knight",
"Knave": "Knave"
} | [
true,
false,
true,
true,
false,
false,
false,
false,
true,
true
] | Joseph is a knight, Penelope is a knave, Michael is a knight, Matthew is a knight, Abigail is a knave, Grace is a knave, Zoey is a knave, Lucas is a knave, Sophia is a knight, and Harper is a knight. | (1) Joseph is a knight
(2) Penelope is a knave
(3) Michael is a knight
(4) Matthew is a knight
(5) Abigail is a knave
(6) Grace is a knave
(7) Zoey is a knave
(8) Lucas is a knave
(9) Sophia is a knight
(10) Harper is a knight | Let's think step by step, by considering whether each person is lying and if that leads to contradiction. | [
"Assume Joseph is a knight. No contradiction is found in their claim that Sophia is not a knave.",
"Assume Sophia is a knight. No contradiction is found in their claim that Matthew is a knave or Michael is a knight.",
"Assume Matthew is a knight. No contradiction is found in their claim that Abigail is a knight... | This leads to a feasible solution. | (('not', ('lying', 8)), ('or', ('lying', 0), ('telling-truth', 5)), ('or', ('telling-truth', 1), ('telling-truth', 2)), ('or', ('telling-truth', 4), ('telling-truth', 8)), ('or', ('lying', 9), ('telling-truth', 1)), ('not', ('lying', 6)), ('and', ('lying', 3), ('lying', 5)), ('and', ('lying', 2), ('telling-truth', 6)),... | 120 |
A very special island is inhabited only by knights and knaves. Knights always tell the truth, and knaves always lie. You meet 10 inhabitants: Mason, William, Daniel, Matthew, Mia, Henry, Alexander, Amelia, Samuel, and Owen. Mason commented, "Daniel is a knave and William is a knight". According to William, "If Alexande... | [
"Mason",
"William",
"Daniel",
"Matthew",
"Mia",
"Henry",
"Alexander",
"Amelia",
"Samuel",
"Owen"
] | {
"knight": "knight",
"knave": "knave",
"a_knight": "a knight",
"a_knave": "a knave",
"Knight": "Knight",
"Knave": "Knave"
} | [
false,
true,
true,
false,
false,
true,
true,
true,
true,
false
] | Mason is a knave, William is a knight, Daniel is a knight, Matthew is a knave, Mia is a knave, Henry is a knight, Alexander is a knight, Amelia is a knight, Samuel is a knight, and Owen is a knave. | (1) Mason is a knave
(2) William is a knight
(3) Daniel is a knight
(4) Matthew is a knave
(5) Mia is a knave
(6) Henry is a knight
(7) Alexander is a knight
(8) Amelia is a knight
(9) Samuel is a knight
(10) Owen is a knave | Let's think step by step, by considering whether each person is lying and if that leads to contradiction. | [
"Assume Mason is a knight. No contradiction is found in their claim that Daniel is a knave and William is a knight.",
"Daniel cannot be a knight, because this would contradict the claim of Mason that Daniel is a knave and William is a knight.",
"Assume Daniel is a knave. No contradiction is found in their false... | This leads to a feasible solution. | (('and', ('lying', 2), ('telling-truth', 1)), ('->', ('lying', 6), ('lying', 0)), ('not', ('telling-truth', 0)), ('<=>', ('lying', 1), ('telling-truth', 6)), ('and', ('telling-truth', 4), ('lying', 5)), ('telling-truth', 7), ('lying', 0), ('or', ('lying', 1), ('lying', 0)), ('or', ('lying', 7), ('lying', 9)), ('telling... | 121 |
A very special island is inhabited only by knights and knaves. Knights always tell the truth, and knaves always lie. You meet 10 inhabitants: Joseph, Daniel, Benjamin, Olivia, Evelyn, Lucas, Mia, Oliver, Jack, and Ethan. "Lucas is a knight if and only if Mia is a knight," Joseph claimed. As Daniel put it, "Mia is a kni... | [
"Joseph",
"Daniel",
"Benjamin",
"Olivia",
"Evelyn",
"Lucas",
"Mia",
"Oliver",
"Jack",
"Ethan"
] | {
"knight": "knight",
"knave": "knave",
"a_knight": "a knight",
"a_knave": "a knave",
"Knight": "Knight",
"Knave": "Knave"
} | [
true,
true,
false,
false,
false,
true,
true,
true,
false,
false
] | Joseph is a knight, Daniel is a knight, Benjamin is a knave, Olivia is a knave, Evelyn is a knave, Lucas is a knight, Mia is a knight, Oliver is a knight, Jack is a knave, and Ethan is a knave. | (1) Joseph is a knight
(2) Daniel is a knight
(3) Benjamin is a knave
(4) Olivia is a knave
(5) Evelyn is a knave
(6) Lucas is a knight
(7) Mia is a knight
(8) Oliver is a knight
(9) Jack is a knave
(10) Ethan is a knave | Let's think step by step, by considering whether each person is lying and if that leads to contradiction. | [
"Assume Joseph is a knight. No contradiction is found in their claim that Lucas is a knight if and only if Mia is a knight.",
"Assume Lucas is a knight. No contradiction is found in their claim that If Mia is a knave then Olivia is a knave.",
"Assume Mia is a knight. No contradiction is found in their claim tha... | This leads to a feasible solution. | (('<=>', ('telling-truth', 5), ('telling-truth', 6)), ('or', ('telling-truth', 6), ('telling-truth', 3)), ('and', ('lying', 1), ('telling-truth', 9)), ('and', ('lying', 6), ('lying', 1)), ('and', ('lying', 7), ('telling-truth', 4)), ('->', ('lying', 6), ('lying', 3)), ('->', ('telling-truth', 3), ('lying', 5)), ('lying... | 122 |
A very special island is inhabited only by knights and knaves. Knights always tell the truth, and knaves always lie. You meet 10 inhabitants: James, Abigail, Aurora, Lily, Riley, Harper, Ethan, William, Zoey, and Mia. As James put it, "Riley is a knave if and only if Harper is a knave". As Abigail put it, "Aurora is a ... | [
"James",
"Abigail",
"Aurora",
"Lily",
"Riley",
"Harper",
"Ethan",
"William",
"Zoey",
"Mia"
] | {
"knight": "knight",
"knave": "knave",
"a_knight": "a knight",
"a_knave": "a knave",
"Knight": "Knight",
"Knave": "Knave"
} | [
false,
true,
false,
false,
true,
false,
true,
true,
false,
true
] | James is a knave, Abigail is a knight, Aurora is a knave, Lily is a knave, Riley is a knight, Harper is a knave, Ethan is a knight, William is a knight, Zoey is a knave, and Mia is a knight. | (1) James is a knave
(2) Abigail is a knight
(3) Aurora is a knave
(4) Lily is a knave
(5) Riley is a knight
(6) Harper is a knave
(7) Ethan is a knight
(8) William is a knight
(9) Zoey is a knave
(10) Mia is a knight | Let's think step by step, by considering whether each person is lying and if that leads to contradiction. | [
"Assume James is a knight. No contradiction is found in their claim that Riley is a knave if and only if Harper is a knave.",
"Assume Riley is a knight. No contradiction is found in their claim that Lily is a knave and Ethan is a knight.",
"Lily cannot be a knight, because this would contradict the claim of Ril... | This leads to a feasible solution. | (('<=>', ('lying', 4), ('lying', 5)), ('lying', 2), ('->', ('lying', 3), ('telling-truth', 0)), ('and', ('lying', 1), ('lying', 5)), ('and', ('lying', 3), ('telling-truth', 6)), ('telling-truth', 3), ('<=>', ('lying', 7), ('telling-truth', 3)), ('->', ('lying', 4), ('lying', 2)), ('telling-truth', 5), ('<=>', ('telling... | 123 |
A very special island is inhabited only by knights and knaves. Knights always tell the truth, and knaves always lie. You meet 10 inhabitants: Penelope, William, Mia, Lucas, Grace, Joseph, Noah, Aurora, Samuel, and Jackson. Penelope said that William is a knave. William asserted: "Penelope is a knave". "Penelope is not ... | [
"Penelope",
"William",
"Mia",
"Lucas",
"Grace",
"Joseph",
"Noah",
"Aurora",
"Samuel",
"Jackson"
] | {
"knight": "knight",
"knave": "knave",
"a_knight": "a knight",
"a_knave": "a knave",
"Knight": "Knight",
"Knave": "Knave"
} | [
false,
true,
true,
true,
false,
true,
false,
true,
false,
true
] | Penelope is a knave, William is a knight, Mia is a knight, Lucas is a knight, Grace is a knave, Joseph is a knight, Noah is a knave, Aurora is a knight, Samuel is a knave, and Jackson is a knight. | (1) Penelope is a knave
(2) William is a knight
(3) Mia is a knight
(4) Lucas is a knight
(5) Grace is a knave
(6) Joseph is a knight
(7) Noah is a knave
(8) Aurora is a knight
(9) Samuel is a knave
(10) Jackson is a knight | Let's think step by step, by considering whether each person is lying and if that leads to contradiction. | [
"Assume Penelope is a knight. No contradiction is found in their claim that William is a knave.",
"William cannot be a knight, because this would contradict the claim of Penelope that William is a knave.",
"Assume William is a knave. No contradiction is found in their false claim that Penelope is a knave.",
"... | This leads to a feasible solution. | (('lying', 1), ('lying', 0), ('not', ('telling-truth', 0)), ('->', ('telling-truth', 8), ('lying', 5)), ('telling-truth', 8), ('not', ('telling-truth', 6)), ('<=>', ('telling-truth', 2), ('lying', 2)), ('->', ('telling-truth', 7), ('lying', 4)), ('lying', 9), ('not', ('lying', 1))) | 124 |
A very special island is inhabited only by knights and knaves. Knights always tell the truth, and knaves always lie. You meet 10 inhabitants: Sophia, Logan, Jacob, Michael, William, Samuel, Mia, Jackson, Victoria, and Isabella. Sophia commented, "Logan is a knave and Jacob is a knave". Logan told you that If Jacob is a... | [
"Sophia",
"Logan",
"Jacob",
"Michael",
"William",
"Samuel",
"Mia",
"Jackson",
"Victoria",
"Isabella"
] | {
"knight": "knight",
"knave": "knave",
"a_knight": "a knight",
"a_knave": "a knave",
"Knight": "Knight",
"Knave": "Knave"
} | [
false,
true,
false,
false,
false,
false,
false,
true,
false,
false
] | Sophia is a knave, Logan is a knight, Jacob is a knave, Michael is a knave, William is a knave, Samuel is a knave, Mia is a knave, Jackson is a knight, Victoria is a knave, and Isabella is a knave. | (1) Sophia is a knave
(2) Logan is a knight
(3) Jacob is a knave
(4) Michael is a knave
(5) William is a knave
(6) Samuel is a knave
(7) Mia is a knave
(8) Jackson is a knight
(9) Victoria is a knave
(10) Isabella is a knave | Let's think step by step, by considering whether each person is lying and if that leads to contradiction. | [
"Assume Sophia is a knight. No contradiction is found in their claim that Logan is a knave and Jacob is a knave.",
"Logan cannot be a knight, because this would contradict the claim of Sophia that Logan is a knave and Jacob is a knave.",
"Assume Logan is a knave. No contradiction is found in their false claim t... | This leads to a feasible solution. | (('and', ('lying', 1), ('lying', 2)), ('->', ('lying', 2), ('lying', 3)), ('not', ('telling-truth', 7)), ('<=>', ('telling-truth', 5), ('lying', 5)), ('telling-truth', 8), ('->', ('lying', 6), ('telling-truth', 4)), ('telling-truth', 4), ('or', ('lying', 2), ('telling-truth', 6)), ('not', ('telling-truth', 7)), ('and',... | 125 |
A very special island is inhabited only by knights and knaves. Knights always tell the truth, and knaves always lie. You meet 10 inhabitants: Liam, Benjamin, Ella, Amelia, Sophia, Mia, Jack, Sebastian, Matthew, and Ava. According to Liam, "Matthew is a knave and Ella is a knight". Benjamin asserted: "Sebastian is a kna... | [
"Liam",
"Benjamin",
"Ella",
"Amelia",
"Sophia",
"Mia",
"Jack",
"Sebastian",
"Matthew",
"Ava"
] | {
"knight": "knight",
"knave": "knave",
"a_knight": "a knight",
"a_knave": "a knave",
"Knight": "Knight",
"Knave": "Knave"
} | [
false,
false,
false,
true,
true,
true,
true,
true,
false,
false
] | Liam is a knave, Benjamin is a knave, Ella is a knave, Amelia is a knight, Sophia is a knight, Mia is a knight, Jack is a knight, Sebastian is a knight, Matthew is a knave, and Ava is a knave. | (1) Liam is a knave
(2) Benjamin is a knave
(3) Ella is a knave
(4) Amelia is a knight
(5) Sophia is a knight
(6) Mia is a knight
(7) Jack is a knight
(8) Sebastian is a knight
(9) Matthew is a knave
(10) Ava is a knave | Let's think step by step, by considering whether each person is lying and if that leads to contradiction. | [
"Assume Liam is a knight. No contradiction is found in their claim that Matthew is a knave and Ella is a knight.",
"Matthew cannot be a knight, because this would contradict the claim of Liam that Matthew is a knave and Ella is a knight.",
"Assume Matthew is a knave. No contradiction is found in their false cla... | This leads to a feasible solution. | (('and', ('lying', 8), ('telling-truth', 2)), ('lying', 7), ('and', ('telling-truth', 6), ('telling-truth', 9)), ('or', ('lying', 0), ('lying', 5)), ('or', ('lying', 6), ('lying', 1)), ('or', ('telling-truth', 0), ('lying', 1)), ('and', ('telling-truth', 7), ('lying', 0)), ('and', ('telling-truth', 4), ('lying', 0)), (... | 126 |
A very special island is inhabited only by knights and knaves. Knights always tell the truth, and knaves always lie. You meet 10 inhabitants: Owen, Noah, Harper, Penelope, Logan, Oliver, Alexander, Michael, James, and Abigail. Owen said, "Logan is a knave and Noah is a knave." "If Penelope is a knave then Oliver is a k... | [
"Owen",
"Noah",
"Harper",
"Penelope",
"Logan",
"Oliver",
"Alexander",
"Michael",
"James",
"Abigail"
] | {
"knight": "knight",
"knave": "knave",
"a_knight": "a knight",
"a_knave": "a knave",
"Knight": "Knight",
"Knave": "Knave"
} | [
false,
true,
true,
false,
true,
true,
false,
false,
true,
true
] | Owen is a knave, Noah is a knight, Harper is a knight, Penelope is a knave, Logan is a knight, Oliver is a knight, Alexander is a knave, Michael is a knave, James is a knight, and Abigail is a knight. | (1) Owen is a knave
(2) Noah is a knight
(3) Harper is a knight
(4) Penelope is a knave
(5) Logan is a knight
(6) Oliver is a knight
(7) Alexander is a knave
(8) Michael is a knave
(9) James is a knight
(10) Abigail is a knight | Let's think step by step, by considering whether each person is lying and if that leads to contradiction. | [
"Assume Owen is a knight. No contradiction is found in their claim that Logan is a knave and Noah is a knave.",
"Logan cannot be a knight, because this would contradict the claim of Owen that Logan is a knave and Noah is a knave.",
"Assume Logan is a knave. No contradiction is found in their false claim that Ow... | This leads to a feasible solution. | (('and', ('lying', 4), ('lying', 1)), ('->', ('lying', 3), ('telling-truth', 5)), ('<=>', ('telling-truth', 0), ('lying', 5)), ('->', ('telling-truth', 5), ('telling-truth', 7)), ('lying', 0), ('not', ('telling-truth', 7)), ('telling-truth', 7), ('and', ('telling-truth', 4), ('telling-truth', 0)), ('or', ('telling-trut... | 127 |
A very special island is inhabited only by knights and knaves. Knights always tell the truth, and knaves always lie. You meet 10 inhabitants: James, Avery, Noah, Ava, Mia, Daniel, Olivia, Sofia, Lucas, and Amelia. As James put it, "Daniel is a knight or Noah is a knight". Avery noted, "If Amelia is a knave then Sofia i... | [
"James",
"Avery",
"Noah",
"Ava",
"Mia",
"Daniel",
"Olivia",
"Sofia",
"Lucas",
"Amelia"
] | {
"knight": "knight",
"knave": "knave",
"a_knight": "a knight",
"a_knave": "a knave",
"Knight": "Knight",
"Knave": "Knave"
} | [
true,
true,
true,
false,
false,
false,
true,
true,
false,
false
] | James is a knight, Avery is a knight, Noah is a knight, Ava is a knave, Mia is a knave, Daniel is a knave, Olivia is a knight, Sofia is a knight, Lucas is a knave, and Amelia is a knave. | (1) James is a knight
(2) Avery is a knight
(3) Noah is a knight
(4) Ava is a knave
(5) Mia is a knave
(6) Daniel is a knave
(7) Olivia is a knight
(8) Sofia is a knight
(9) Lucas is a knave
(10) Amelia is a knave | Let's think step by step, by considering whether each person is lying and if that leads to contradiction. | [
"Assume James is a knight. No contradiction is found in their claim that Daniel is a knight or Noah is a knight.",
"Assume Daniel is a knight. No contradiction is found in their claim that Ava is a knight if and only if Amelia is a knave.",
"Assume Ava is a knight. No contradiction is found in their claim that ... | This leads to a feasible solution. | (('or', ('telling-truth', 5), ('telling-truth', 2)), ('->', ('lying', 9), ('telling-truth', 7)), ('or', ('lying', 0), ('telling-truth', 6)), ('<=>', ('telling-truth', 1), ('lying', 0)), ('and', ('lying', 7), ('telling-truth', 3)), ('<=>', ('telling-truth', 3), ('lying', 9)), ('telling-truth', 7), ('not', ('lying', 2)),... | 128 |
A very special island is inhabited only by knights and knaves. Knights always tell the truth, and knaves always lie. You meet 10 inhabitants: Aria, Evelyn, Mason, Noah, Jackson, Jack, Liam, Henry, Sophia, and Abigail. Aria asserted: "Jack is not a knight". Evelyn told you that Liam is a knave if and only if Noah is a k... | [
"Aria",
"Evelyn",
"Mason",
"Noah",
"Jackson",
"Jack",
"Liam",
"Henry",
"Sophia",
"Abigail"
] | {
"knight": "knight",
"knave": "knave",
"a_knight": "a knight",
"a_knave": "a knave",
"Knight": "Knight",
"Knave": "Knave"
} | [
true,
true,
false,
true,
false,
false,
true,
false,
true,
true
] | Aria is a knight, Evelyn is a knight, Mason is a knave, Noah is a knight, Jackson is a knave, Jack is a knave, Liam is a knight, Henry is a knave, Sophia is a knight, and Abigail is a knight. | (1) Aria is a knight
(2) Evelyn is a knight
(3) Mason is a knave
(4) Noah is a knight
(5) Jackson is a knave
(6) Jack is a knave
(7) Liam is a knight
(8) Henry is a knave
(9) Sophia is a knight
(10) Abigail is a knight | Let's think step by step, by considering whether each person is lying and if that leads to contradiction. | [
"Assume Aria is a knight. No contradiction is found in their claim that Jack is not a knight.",
"Jack cannot be a knight, because this would contradict the claim of Aria that Jack is not a knight.",
"Assume Jack is a knave. No contradiction is found in their false claim that Evelyn is a knight if and only if So... | This leads to a feasible solution. | (('not', ('telling-truth', 5)), ('<=>', ('lying', 6), ('lying', 3)), ('<=>', ('telling-truth', 4), ('telling-truth', 0)), ('<=>', ('telling-truth', 6), ('lying', 5)), ('or', ('telling-truth', 5), ('lying', 3)), ('<=>', ('telling-truth', 1), ('lying', 8)), ('or', ('telling-truth', 0), ('lying', 2)), ('not', ('lying', 5)... | 129 |
A very special island is inhabited only by knights and knaves. Knights always tell the truth, and knaves always lie. You meet 10 inhabitants: Logan, Aiden, Benjamin, Lucas, Harper, Liam, Sebastian, Abigail, Ethan, and Samuel. "Logan is a knight if and only if Samuel is a knight" - Logan. In a statement by Aiden: "If Et... | [
"Logan",
"Aiden",
"Benjamin",
"Lucas",
"Harper",
"Liam",
"Sebastian",
"Abigail",
"Ethan",
"Samuel"
] | {
"knight": "knight",
"knave": "knave",
"a_knight": "a knight",
"a_knave": "a knave",
"Knight": "Knight",
"Knave": "Knave"
} | [
false,
false,
false,
false,
true,
true,
false,
true,
false,
true
] | Logan is a knave, Aiden is a knave, Benjamin is a knave, Lucas is a knave, Harper is a knight, Liam is a knight, Sebastian is a knave, Abigail is a knight, Ethan is a knave, and Samuel is a knight. | (1) Logan is a knave
(2) Aiden is a knave
(3) Benjamin is a knave
(4) Lucas is a knave
(5) Harper is a knight
(6) Liam is a knight
(7) Sebastian is a knave
(8) Abigail is a knight
(9) Ethan is a knave
(10) Samuel is a knight | Let's think step by step, by considering whether each person is lying and if that leads to contradiction. | [
"Assume Logan is a knight. No contradiction is found in their claim that Logan is a knight if and only if Samuel is a knight.",
"Assume Samuel is a knight. No contradiction is found in their claim that Sebastian is a knave or Ethan is a knave.",
"Assume Sebastian is a knight. No contradiction is found in their ... | This leads to a feasible solution. | (('<=>', ('telling-truth', 0), ('telling-truth', 9)), ('->', ('lying', 8), ('telling-truth', 8)), ('and', ('telling-truth', 5), ('lying', 7)), ('lying', 5), ('lying', 2), ('->', ('telling-truth', 8), ('telling-truth', 3)), ('lying', 5), ('<=>', ('telling-truth', 5), ('telling-truth', 9)), ('->', ('telling-truth', 5), (... | 130 |
A very special island is inhabited only by knights and knaves. Knights always tell the truth, and knaves always lie. You meet 10 inhabitants: Daniel, David, Mason, Emily, Olivia, Victoria, Isabella, Henry, Charlotte, and Samuel. In Daniel's words: "Mason is a knave if and only if David is a knave". According to David, ... | [
"Daniel",
"David",
"Mason",
"Emily",
"Olivia",
"Victoria",
"Isabella",
"Henry",
"Charlotte",
"Samuel"
] | {
"knight": "knight",
"knave": "knave",
"a_knight": "a knight",
"a_knave": "a knave",
"Knight": "Knight",
"Knave": "Knave"
} | [
false,
false,
true,
false,
true,
true,
true,
true,
true,
false
] | Daniel is a knave, David is a knave, Mason is a knight, Emily is a knave, Olivia is a knight, Victoria is a knight, Isabella is a knight, Henry is a knight, Charlotte is a knight, and Samuel is a knave. | (1) Daniel is a knave
(2) David is a knave
(3) Mason is a knight
(4) Emily is a knave
(5) Olivia is a knight
(6) Victoria is a knight
(7) Isabella is a knight
(8) Henry is a knight
(9) Charlotte is a knight
(10) Samuel is a knave | Let's think step by step, by considering whether each person is lying and if that leads to contradiction. | [
"Assume Daniel is a knight. No contradiction is found in their claim that Mason is a knave if and only if David is a knave.",
"Assume Mason is a knight. No contradiction is found in their claim that Victoria is a knight or Mason is a knight.",
"Assume Victoria is a knight. No contradiction is found in their cla... | This leads to a feasible solution. | (('<=>', ('lying', 2), ('lying', 1)), ('not', ('telling-truth', 4)), ('or', ('telling-truth', 5), ('telling-truth', 2)), ('<=>', ('telling-truth', 7), ('telling-truth', 9)), ('or', ('telling-truth', 2), ('telling-truth', 9)), ('<=>', ('lying', 7), ('telling-truth', 0)), ('lying', 1), ('->', ('lying', 0), ('telling-trut... | 131 |
A very special island is inhabited only by knights and knaves. Knights always tell the truth, and knaves always lie. You meet 10 inhabitants: Aiden, Zoey, Scarlett, Chloe, Lucas, Isabella, Alexander, Harper, Abigail, and Sophia. According to Aiden, "If Isabella is a knave then Harper is a knight". "Chloe is a knave and... | [
"Aiden",
"Zoey",
"Scarlett",
"Chloe",
"Lucas",
"Isabella",
"Alexander",
"Harper",
"Abigail",
"Sophia"
] | {
"knight": "knight",
"knave": "knave",
"a_knight": "a knight",
"a_knave": "a knave",
"Knight": "Knight",
"Knave": "Knave"
} | [
true,
false,
true,
false,
false,
true,
true,
false,
true,
false
] | Aiden is a knight, Zoey is a knave, Scarlett is a knight, Chloe is a knave, Lucas is a knave, Isabella is a knight, Alexander is a knight, Harper is a knave, Abigail is a knight, and Sophia is a knave. | (1) Aiden is a knight
(2) Zoey is a knave
(3) Scarlett is a knight
(4) Chloe is a knave
(5) Lucas is a knave
(6) Isabella is a knight
(7) Alexander is a knight
(8) Harper is a knave
(9) Abigail is a knight
(10) Sophia is a knave | Let's think step by step, by considering whether each person is lying and if that leads to contradiction. | [
"Assume Aiden is a knight. No contradiction is found in their claim that If Isabella is a knave then Harper is a knight.",
"Assume Isabella is a knight. No contradiction is found in their claim that If Harper is a knave then Abigail is a knight.",
"Assume Harper is a knight. No contradiction is found in their c... | This leads to a feasible solution. | (('->', ('lying', 5), ('telling-truth', 7)), ('and', ('lying', 3), ('lying', 5)), ('->', ('lying', 6), ('telling-truth', 3)), ('<=>', ('lying', 5), ('lying', 7)), ('and', ('telling-truth', 9), ('telling-truth', 6)), ('->', ('lying', 7), ('telling-truth', 8)), ('or', ('telling-truth', 0), ('lying', 4)), ('and', ('lying'... | 132 |
End of preview. Expand in Data Studio
No dataset card yet
- Downloads last month
- 15