{ "kind": "ainglish.panel.items.v1", "items": [ { "id": "choice-r23-000", "english": "Assignment note GRP-0005: its members are WO-00051, WO-00052 and WO-00053. Allowed deadline slot for WO-00051: A, B, C. Allowed deadline slot for WO-00052: B, C. Allowed deadline slot for WO-00053: A, B, C. Maximum uses of each deadline slot in this note: A at most 1; B at most 1; C at most 3. The set GRP-0005 is exactly those three work orders. Give each member of GRP-0005 exactly one deadline slot, and make those three values the same.", "ainglish": "Assignment note GRP-0005: its members are WO-00051, WO-00052 and WO-00053. Allowed deadline slot for WO-00051: A, B, C. Allowed deadline slot for WO-00052: B, C. Allowed deadline slot for WO-00053: A, B, C. Maximum uses of each deadline slot in this note: A at most 1; B at most 1; C at most 3. The set GRP-0005 is exactly those three work orders. Give each member of GRP-0005 exactly one deadline slot, same-for-all(GRP-0005).", "question": "A draft plan gives A to WO-00051, A to WO-00052 and C to WO-00053. Does that draft satisfy every requirement in the note?", "options": [ "yes", "no", "no complete plan satisfies the note", "the note does not settle it" ], "answer": "no", "settlement_stratum": "same-for-all:admissibility", "strata": { "form": "same-for-all", "task": "admissibility", "domain": "deadline", "set": "GRP-0005", "members": [ "WO-00051", "WO-00052", "WO-00053" ], "candidate": [ "A", "A", "C" ], "gold_class": "no" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 1, "B": 1, "C": 3 }, "form": "same-for-all", "task": "admissibility", "domain": "deadline", "feasible_count": 1, "candidate": [ "A", "A", "C" ], "gold": "no" } }, { "id": "choice-r23-001", "english": "Assignment note GRP-0001: its members are SD-00011, SD-00012 and SD-00013. Allowed font family for SD-00011: only A. Allowed font family for SD-00012: A, B, C. Allowed font family for SD-00013: A, B, C. Maximum uses of each font family in this note: A at most 3; B at most 2; C at most 2. The set GRP-0001 is exactly those three slide decks. Give each member of GRP-0001 exactly one font family, and make those three values the same.", "ainglish": "Assignment note GRP-0001: its members are SD-00011, SD-00012 and SD-00013. Allowed font family for SD-00011: only A. Allowed font family for SD-00012: A, B, C. Allowed font family for SD-00013: A, B, C. Maximum uses of each font family in this note: A at most 3; B at most 2; C at most 2. The set GRP-0001 is exactly those three slide decks. Give each member of GRP-0001 exactly one font family, same-for-all(GRP-0001).", "question": "A draft plan gives A to SD-00011, A to SD-00012 and A to SD-00013. Does that draft satisfy every requirement in the note?", "options": [ "no complete plan satisfies the note", "the note does not settle it", "yes", "no" ], "answer": "yes", "settlement_stratum": "same-for-all:admissibility", "strata": { "form": "same-for-all", "task": "admissibility", "domain": "font-family", "set": "GRP-0001", "members": [ "SD-00011", "SD-00012", "SD-00013" ], "candidate": [ "A", "A", "A" ], "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 2, "C": 2 }, "form": "same-for-all", "task": "admissibility", "domain": "font-family", "feasible_count": 1, "candidate": [ "A", "A", "A" ], "gold": "yes" } }, { "id": "choice-r23-002", "english": "Assignment note GRP-0006: its members are WO-00061, WO-00062 and WO-00063. Allowed deadline slot for WO-00061: A, B. Allowed deadline slot for WO-00062: A, B, C. Allowed deadline slot for WO-00063: A, B, C. Maximum uses of each deadline slot in this note: A at most 2; B at most 3; C at most 1. The set GRP-0006 is exactly those three work orders. Give each member of GRP-0006 exactly one deadline slot, and make those three values the same.", "ainglish": "Assignment note GRP-0006: its members are WO-00061, WO-00062 and WO-00063. Allowed deadline slot for WO-00061: A, B. Allowed deadline slot for WO-00062: A, B, C. Allowed deadline slot for WO-00063: A, B, C. Maximum uses of each deadline slot in this note: A at most 2; B at most 3; C at most 1. The set GRP-0006 is exactly those three work orders. Give each member of GRP-0006 exactly one deadline slot, same-for-all(GRP-0006).", "question": "A draft plan gives A to WO-00061, A to WO-00062 and C to WO-00063. Does that draft satisfy every requirement in the note?", "options": [ "the note does not settle it", "yes", "no", "no complete plan satisfies the note" ], "answer": "no", "settlement_stratum": "same-for-all:admissibility", "strata": { "form": "same-for-all", "task": "admissibility", "domain": "deadline", "set": "GRP-0006", "members": [ "WO-00061", "WO-00062", "WO-00063" ], "candidate": [ "A", "A", "C" ], "gold_class": "no" }, "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 2, "B": 3, "C": 1 }, "form": "same-for-all", "task": "admissibility", "domain": "deadline", "feasible_count": 1, "candidate": [ "A", "A", "C" ], "gold": "no" } }, { "id": "choice-r23-003", "english": "Assignment note GRP-0008: its members are WO-00081, WO-00082 and WO-00083. Allowed deadline slot for WO-00081: B, C. Allowed deadline slot for WO-00082: only B. Allowed deadline slot for WO-00083: A, B, C. Maximum uses of each deadline slot in this note: A at most 2; B at most 3; C at most 1. The set GRP-0008 is exactly those three work orders. Give each member of GRP-0008 exactly one deadline slot, and make those three values the same.", "ainglish": "Assignment note GRP-0008: its members are WO-00081, WO-00082 and WO-00083. Allowed deadline slot for WO-00081: B, C. Allowed deadline slot for WO-00082: only B. Allowed deadline slot for WO-00083: A, B, C. Maximum uses of each deadline slot in this note: A at most 2; B at most 3; C at most 1. The set GRP-0008 is exactly those three work orders. Give each member of GRP-0008 exactly one deadline slot, same-for-all(GRP-0008).", "question": "A draft plan gives B to WO-00081, C to WO-00082 and B to WO-00083. Does that draft satisfy every requirement in the note?", "options": [ "no", "no complete plan satisfies the note", "the note does not settle it", "yes" ], "answer": "no", "settlement_stratum": "same-for-all:admissibility", "strata": { "form": "same-for-all", "task": "admissibility", "domain": "deadline", "set": "GRP-0008", "members": [ "WO-00081", "WO-00082", "WO-00083" ], "candidate": [ "B", "C", "B" ], "gold_class": "no" }, "ledger": { "eligibility": [ [ "B", "C" ], [ "B" ], [ "A", "B", "C" ] ], "capacities": { "A": 2, "B": 3, "C": 1 }, "form": "same-for-all", "task": "admissibility", "domain": "deadline", "feasible_count": 1, "candidate": [ "B", "C", "B" ], "gold": "no" } }, { "id": "choice-r23-004", "english": "Assignment note GRP-0007: its members are WO-00071, WO-00072 and WO-00073. Allowed deadline slot for WO-00071: A, B, C. Allowed deadline slot for WO-00072: A, C. Allowed deadline slot for WO-00073: A, B, C. Maximum uses of each deadline slot in this note: A at most 1; B at most 2; C at most 3. The set GRP-0007 is exactly those three work orders. Give each member of GRP-0007 exactly one deadline slot, and make those three values the same.", "ainglish": "Assignment note GRP-0007: its members are WO-00071, WO-00072 and WO-00073. Allowed deadline slot for WO-00071: A, B, C. Allowed deadline slot for WO-00072: A, C. Allowed deadline slot for WO-00073: A, B, C. Maximum uses of each deadline slot in this note: A at most 1; B at most 2; C at most 3. The set GRP-0007 is exactly those three work orders. Give each member of GRP-0007 exactly one deadline slot, same-for-all(GRP-0007).", "question": "A draft plan gives B to WO-00071, C to WO-00072 and B to WO-00073. Does that draft satisfy every requirement in the note?", "options": [ "no", "no complete plan satisfies the note", "the note does not settle it", "yes" ], "answer": "no", "settlement_stratum": "same-for-all:admissibility", "strata": { "form": "same-for-all", "task": "admissibility", "domain": "deadline", "set": "GRP-0007", "members": [ "WO-00071", "WO-00072", "WO-00073" ], "candidate": [ "B", "C", "B" ], "gold_class": "no" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 1, "B": 2, "C": 3 }, "form": "same-for-all", "task": "admissibility", "domain": "deadline", "feasible_count": 1, "candidate": [ "B", "C", "B" ], "gold": "no" } }, { "id": "choice-r23-005", "english": "Assignment note GRP-0003: its members are BR-00031, BR-00032 and BR-00033. Allowed source dataset for BR-00031: A, B. Allowed source dataset for BR-00032: A, B, C. Allowed source dataset for BR-00033: A, B. Maximum uses of each source dataset in this note: A at most 1; B at most 3; C at most 1. The set GRP-0003 is exactly those three backup runs. Give each member of GRP-0003 exactly one source dataset, and make those three values the same.", "ainglish": "Assignment note GRP-0003: its members are BR-00031, BR-00032 and BR-00033. Allowed source dataset for BR-00031: A, B. Allowed source dataset for BR-00032: A, B, C. Allowed source dataset for BR-00033: A, B. Maximum uses of each source dataset in this note: A at most 1; B at most 3; C at most 1. The set GRP-0003 is exactly those three backup runs. Give each member of GRP-0003 exactly one source dataset, same-for-all(GRP-0003).", "question": "A draft plan gives B to BR-00031, B to BR-00032 and B to BR-00033. Does that draft satisfy every requirement in the note?", "options": [ "the note does not settle it", "yes", "no", "no complete plan satisfies the note" ], "answer": "yes", "settlement_stratum": "same-for-all:admissibility", "strata": { "form": "same-for-all", "task": "admissibility", "domain": "source-dataset", "set": "GRP-0003", "members": [ "BR-00031", "BR-00032", "BR-00033" ], "candidate": [ "B", "B", "B" ], "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B", "C" ], [ "A", "B" ] ], "capacities": { "A": 1, "B": 3, "C": 1 }, "form": "same-for-all", "task": "admissibility", "domain": "source-dataset", "feasible_count": 1, "candidate": [ "B", "B", "B" ], "gold": "yes" } }, { "id": "choice-r23-006", "english": "Assignment note GRP-0005: its members are BR-00051, BR-00052 and BR-00053. Allowed source dataset for BR-00051: only B. Allowed source dataset for BR-00052: A, B, C. Allowed source dataset for BR-00053: B, C. Maximum uses of each source dataset in this note: A at most 3; B at most 3; C at most 3. The set GRP-0005 is exactly those three backup runs. Give each member of GRP-0005 exactly one source dataset, and make those three values the same.", "ainglish": "Assignment note GRP-0005: its members are BR-00051, BR-00052 and BR-00053. Allowed source dataset for BR-00051: only B. Allowed source dataset for BR-00052: A, B, C. Allowed source dataset for BR-00053: B, C. Maximum uses of each source dataset in this note: A at most 3; B at most 3; C at most 3. The set GRP-0005 is exactly those three backup runs. Give each member of GRP-0005 exactly one source dataset, same-for-all(GRP-0005).", "question": "A draft plan gives B to BR-00051, A to BR-00052 and C to BR-00053. Does that draft satisfy every requirement in the note?", "options": [ "no complete plan satisfies the note", "the note does not settle it", "yes", "no" ], "answer": "no", "settlement_stratum": "same-for-all:admissibility", "strata": { "form": "same-for-all", "task": "admissibility", "domain": "source-dataset", "set": "GRP-0005", "members": [ "BR-00051", "BR-00052", "BR-00053" ], "candidate": [ "B", "A", "C" ], "gold_class": "no" }, "ledger": { "eligibility": [ [ "B" ], [ "A", "B", "C" ], [ "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "form": "same-for-all", "task": "admissibility", "domain": "source-dataset", "feasible_count": 1, "candidate": [ "B", "A", "C" ], "gold": "no" } }, { "id": "choice-r23-007", "english": "Assignment note GRP-0006: its members are SD-00061, SD-00062 and SD-00063. Allowed font family for SD-00061: A, B, C. Allowed font family for SD-00062: A, C. Allowed font family for SD-00063: A, C. Maximum uses of each font family in this note: A at most 2; B at most 1; C at most 3. The set GRP-0006 is exactly those three slide decks. Give each member of GRP-0006 exactly one font family, and make those three values the same.", "ainglish": "Assignment note GRP-0006: its members are SD-00061, SD-00062 and SD-00063. Allowed font family for SD-00061: A, B, C. Allowed font family for SD-00062: A, C. Allowed font family for SD-00063: A, C. Maximum uses of each font family in this note: A at most 2; B at most 1; C at most 3. The set GRP-0006 is exactly those three slide decks. Give each member of GRP-0006 exactly one font family, same-for-all(GRP-0006).", "question": "A draft plan gives B to SD-00061, A to SD-00062 and B to SD-00063. Does that draft satisfy every requirement in the note?", "options": [ "yes", "no", "no complete plan satisfies the note", "the note does not settle it" ], "answer": "no", "settlement_stratum": "same-for-all:admissibility", "strata": { "form": "same-for-all", "task": "admissibility", "domain": "font-family", "set": "GRP-0006", "members": [ "SD-00061", "SD-00062", "SD-00063" ], "candidate": [ "B", "A", "B" ], "gold_class": "no" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "C" ], [ "A", "C" ] ], "capacities": { "A": 2, "B": 1, "C": 3 }, "form": "same-for-all", "task": "admissibility", "domain": "font-family", "feasible_count": 1, "candidate": [ "B", "A", "B" ], "gold": "no" } }, { "id": "choice-r23-008", "english": "Assignment note GRP-0003: its members are SD-00031, SD-00032 and SD-00033. Allowed font family for SD-00031: A, B, C. Allowed font family for SD-00032: only A. Allowed font family for SD-00033: A, B, C. Maximum uses of each font family in this note: A at most 3; B at most 3; C at most 3. The set GRP-0003 is exactly those three slide decks. Give each member of GRP-0003 exactly one font family, and make those three values the same.", "ainglish": "Assignment note GRP-0003: its members are SD-00031, SD-00032 and SD-00033. Allowed font family for SD-00031: A, B, C. Allowed font family for SD-00032: only A. Allowed font family for SD-00033: A, B, C. Maximum uses of each font family in this note: A at most 3; B at most 3; C at most 3. The set GRP-0003 is exactly those three slide decks. Give each member of GRP-0003 exactly one font family, same-for-all(GRP-0003).", "question": "A draft plan gives A to SD-00031, A to SD-00032 and A to SD-00033. Does that draft satisfy every requirement in the note?", "options": [ "no complete plan satisfies the note", "the note does not settle it", "yes", "no" ], "answer": "yes", "settlement_stratum": "same-for-all:admissibility", "strata": { "form": "same-for-all", "task": "admissibility", "domain": "font-family", "set": "GRP-0003", "members": [ "SD-00031", "SD-00032", "SD-00033" ], "candidate": [ "A", "A", "A" ], "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "form": "same-for-all", "task": "admissibility", "domain": "font-family", "feasible_count": 1, "candidate": [ "A", "A", "A" ], "gold": "yes" } }, { "id": "choice-r23-009", "english": "Assignment note GRP-0004: its members are WO-00041, WO-00042 and WO-00043. Allowed deadline slot for WO-00041: A, B, C. Allowed deadline slot for WO-00042: A, C. Allowed deadline slot for WO-00043: A, B, C. Maximum uses of each deadline slot in this note: A at most 3; B at most 3; C at most 2. The set GRP-0004 is exactly those three work orders. Give each member of GRP-0004 exactly one deadline slot, and make those three values the same.", "ainglish": "Assignment note GRP-0004: its members are WO-00041, WO-00042 and WO-00043. Allowed deadline slot for WO-00041: A, B, C. Allowed deadline slot for WO-00042: A, C. Allowed deadline slot for WO-00043: A, B, C. Maximum uses of each deadline slot in this note: A at most 3; B at most 3; C at most 2. The set GRP-0004 is exactly those three work orders. Give each member of GRP-0004 exactly one deadline slot, same-for-all(GRP-0004).", "question": "A draft plan gives A to WO-00041, A to WO-00042 and A to WO-00043. Does that draft satisfy every requirement in the note?", "options": [ "no", "no complete plan satisfies the note", "the note does not settle it", "yes" ], "answer": "yes", "settlement_stratum": "same-for-all:admissibility", "strata": { "form": "same-for-all", "task": "admissibility", "domain": "deadline", "set": "GRP-0004", "members": [ "WO-00041", "WO-00042", "WO-00043" ], "candidate": [ "A", "A", "A" ], "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 2 }, "form": "same-for-all", "task": "admissibility", "domain": "deadline", "feasible_count": 1, "candidate": [ "A", "A", "A" ], "gold": "yes" } }, { "id": "choice-r23-010", "english": "Assignment note GRP-0007: its members are BR-00071, BR-00072 and BR-00073. Allowed source dataset for BR-00071: A, B, C. Allowed source dataset for BR-00072: A, B, C. Allowed source dataset for BR-00073: A, C. Maximum uses of each source dataset in this note: A at most 3; B at most 2; C at most 2. The set GRP-0007 is exactly those three backup runs. Give each member of GRP-0007 exactly one source dataset, and make those three values the same.", "ainglish": "Assignment note GRP-0007: its members are BR-00071, BR-00072 and BR-00073. Allowed source dataset for BR-00071: A, B, C. Allowed source dataset for BR-00072: A, B, C. Allowed source dataset for BR-00073: A, C. Maximum uses of each source dataset in this note: A at most 3; B at most 2; C at most 2. The set GRP-0007 is exactly those three backup runs. Give each member of GRP-0007 exactly one source dataset, same-for-all(GRP-0007).", "question": "A draft plan gives C to BR-00071, B to BR-00072 and C to BR-00073. Does that draft satisfy every requirement in the note?", "options": [ "yes", "no", "no complete plan satisfies the note", "the note does not settle it" ], "answer": "no", "settlement_stratum": "same-for-all:admissibility", "strata": { "form": "same-for-all", "task": "admissibility", "domain": "source-dataset", "set": "GRP-0007", "members": [ "BR-00071", "BR-00072", "BR-00073" ], "candidate": [ "C", "B", "C" ], "gold_class": "no" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "C" ] ], "capacities": { "A": 3, "B": 2, "C": 2 }, "form": "same-for-all", "task": "admissibility", "domain": "source-dataset", "feasible_count": 1, "candidate": [ "C", "B", "C" ], "gold": "no" } }, { "id": "choice-r23-011", "english": "Assignment note GRP-0005: its members are FL-00051, FL-00052 and FL-00053. Allowed reviewer for FL-00051: only C. Allowed reviewer for FL-00052: A, C. Allowed reviewer for FL-00053: only C. Maximum uses of each reviewer in this note: A at most 3; B at most 3; C at most 3. The set GRP-0005 is exactly those three files. Give each member of GRP-0005 exactly one reviewer, and make those three values the same.", "ainglish": "Assignment note GRP-0005: its members are FL-00051, FL-00052 and FL-00053. Allowed reviewer for FL-00051: only C. Allowed reviewer for FL-00052: A, C. Allowed reviewer for FL-00053: only C. Maximum uses of each reviewer in this note: A at most 3; B at most 3; C at most 3. The set GRP-0005 is exactly those three files. Give each member of GRP-0005 exactly one reviewer, same-for-all(GRP-0005).", "question": "A draft plan gives C to FL-00051, A to FL-00052 and B to FL-00053. Does that draft satisfy every requirement in the note?", "options": [ "yes", "no", "no complete plan satisfies the note", "the note does not settle it" ], "answer": "no", "settlement_stratum": "same-for-all:admissibility", "strata": { "form": "same-for-all", "task": "admissibility", "domain": "reviewer", "set": "GRP-0005", "members": [ "FL-00051", "FL-00052", "FL-00053" ], "candidate": [ "C", "A", "B" ], "gold_class": "no" }, "ledger": { "eligibility": [ [ "C" ], [ "A", "C" ], [ "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "form": "same-for-all", "task": "admissibility", "domain": "reviewer", "feasible_count": 1, "candidate": [ "C", "A", "B" ], "gold": "no" } }, { "id": "choice-r23-012", "english": "Assignment note GRP-0002: its members are SD-00021, SD-00022 and SD-00023. Allowed font family for SD-00021: A, B. Allowed font family for SD-00022: only B. Allowed font family for SD-00023: B, C. Maximum uses of each font family in this note: A at most 2; B at most 3; C at most 3. The set GRP-0002 is exactly those three slide decks. Give each member of GRP-0002 exactly one font family, and make those three values the same.", "ainglish": "Assignment note GRP-0002: its members are SD-00021, SD-00022 and SD-00023. Allowed font family for SD-00021: A, B. Allowed font family for SD-00022: only B. Allowed font family for SD-00023: B, C. Maximum uses of each font family in this note: A at most 2; B at most 3; C at most 3. The set GRP-0002 is exactly those three slide decks. Give each member of GRP-0002 exactly one font family, same-for-all(GRP-0002).", "question": "A draft plan gives B to SD-00021, B to SD-00022 and B to SD-00023. Does that draft satisfy every requirement in the note?", "options": [ "yes", "no", "no complete plan satisfies the note", "the note does not settle it" ], "answer": "yes", "settlement_stratum": "same-for-all:admissibility", "strata": { "form": "same-for-all", "task": "admissibility", "domain": "font-family", "set": "GRP-0002", "members": [ "SD-00021", "SD-00022", "SD-00023" ], "candidate": [ "B", "B", "B" ], "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "B" ], [ "B" ], [ "B", "C" ] ], "capacities": { "A": 2, "B": 3, "C": 3 }, "form": "same-for-all", "task": "admissibility", "domain": "font-family", "feasible_count": 1, "candidate": [ "B", "B", "B" ], "gold": "yes" } }, { "id": "choice-r23-013", "english": "Assignment note GRP-0003: its members are WO-00031, WO-00032 and WO-00033. Allowed deadline slot for WO-00031: A, B, C. Allowed deadline slot for WO-00032: A, C. Allowed deadline slot for WO-00033: only C. Maximum uses of each deadline slot in this note: A at most 3; B at most 2; C at most 3. The set GRP-0003 is exactly those three work orders. Give each member of GRP-0003 exactly one deadline slot, and make those three values the same.", "ainglish": "Assignment note GRP-0003: its members are WO-00031, WO-00032 and WO-00033. Allowed deadline slot for WO-00031: A, B, C. Allowed deadline slot for WO-00032: A, C. Allowed deadline slot for WO-00033: only C. Maximum uses of each deadline slot in this note: A at most 3; B at most 2; C at most 3. The set GRP-0003 is exactly those three work orders. Give each member of GRP-0003 exactly one deadline slot, same-for-all(GRP-0003).", "question": "A draft plan gives C to WO-00031, C to WO-00032 and C to WO-00033. Does that draft satisfy every requirement in the note?", "options": [ "no", "no complete plan satisfies the note", "the note does not settle it", "yes" ], "answer": "yes", "settlement_stratum": "same-for-all:admissibility", "strata": { "form": "same-for-all", "task": "admissibility", "domain": "deadline", "set": "GRP-0003", "members": [ "WO-00031", "WO-00032", "WO-00033" ], "candidate": [ "C", "C", "C" ], "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "C" ], [ "C" ] ], "capacities": { "A": 3, "B": 2, "C": 3 }, "form": "same-for-all", "task": "admissibility", "domain": "deadline", "feasible_count": 1, "candidate": [ "C", "C", "C" ], "gold": "yes" } }, { "id": "choice-r23-014", "english": "Assignment note GRP-0001: its members are WO-00011, WO-00012 and WO-00013. Allowed deadline slot for WO-00011: A, C. Allowed deadline slot for WO-00012: A, B, C. Allowed deadline slot for WO-00013: only A. Maximum uses of each deadline slot in this note: A at most 3; B at most 2; C at most 1. The set GRP-0001 is exactly those three work orders. Give each member of GRP-0001 exactly one deadline slot, and make those three values the same.", "ainglish": "Assignment note GRP-0001: its members are WO-00011, WO-00012 and WO-00013. Allowed deadline slot for WO-00011: A, C. Allowed deadline slot for WO-00012: A, B, C. Allowed deadline slot for WO-00013: only A. Maximum uses of each deadline slot in this note: A at most 3; B at most 2; C at most 1. The set GRP-0001 is exactly those three work orders. Give each member of GRP-0001 exactly one deadline slot, same-for-all(GRP-0001).", "question": "A draft plan gives A to WO-00011, A to WO-00012 and A to WO-00013. Does that draft satisfy every requirement in the note?", "options": [ "no", "no complete plan satisfies the note", "the note does not settle it", "yes" ], "answer": "yes", "settlement_stratum": "same-for-all:admissibility", "strata": { "form": "same-for-all", "task": "admissibility", "domain": "deadline", "set": "GRP-0001", "members": [ "WO-00011", "WO-00012", "WO-00013" ], "candidate": [ "A", "A", "A" ], "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "C" ], [ "A", "B", "C" ], [ "A" ] ], "capacities": { "A": 3, "B": 2, "C": 1 }, "form": "same-for-all", "task": "admissibility", "domain": "deadline", "feasible_count": 1, "candidate": [ "A", "A", "A" ], "gold": "yes" } }, { "id": "choice-r23-015", "english": "Assignment note GRP-0001: its members are BR-00011, BR-00012 and BR-00013. Allowed source dataset for BR-00011: A, B. Allowed source dataset for BR-00012: only A. Allowed source dataset for BR-00013: A, B, C. Maximum uses of each source dataset in this note: A at most 3; B at most 1; C at most 1. The set GRP-0001 is exactly those three backup runs. Give each member of GRP-0001 exactly one source dataset, and make those three values the same.", "ainglish": "Assignment note GRP-0001: its members are BR-00011, BR-00012 and BR-00013. Allowed source dataset for BR-00011: A, B. Allowed source dataset for BR-00012: only A. Allowed source dataset for BR-00013: A, B, C. Maximum uses of each source dataset in this note: A at most 3; B at most 1; C at most 1. The set GRP-0001 is exactly those three backup runs. Give each member of GRP-0001 exactly one source dataset, same-for-all(GRP-0001).", "question": "A draft plan gives A to BR-00011, A to BR-00012 and A to BR-00013. Does that draft satisfy every requirement in the note?", "options": [ "yes", "no", "no complete plan satisfies the note", "the note does not settle it" ], "answer": "yes", "settlement_stratum": "same-for-all:admissibility", "strata": { "form": "same-for-all", "task": "admissibility", "domain": "source-dataset", "set": "GRP-0001", "members": [ "BR-00011", "BR-00012", "BR-00013" ], "candidate": [ "A", "A", "A" ], "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "B" ], [ "A" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 1, "C": 1 }, "form": "same-for-all", "task": "admissibility", "domain": "source-dataset", "feasible_count": 1, "candidate": [ "A", "A", "A" ], "gold": "yes" } }, { "id": "choice-r23-016", "english": "Assignment note GRP-0004: its members are SD-00041, SD-00042 and SD-00043. Allowed font family for SD-00041: A, B, C. Allowed font family for SD-00042: A, B, C. Allowed font family for SD-00043: A, C. Maximum uses of each font family in this note: A at most 1; B at most 3; C at most 3. The set GRP-0004 is exactly those three slide decks. Give each member of GRP-0004 exactly one font family, and make those three values the same.", "ainglish": "Assignment note GRP-0004: its members are SD-00041, SD-00042 and SD-00043. Allowed font family for SD-00041: A, B, C. Allowed font family for SD-00042: A, B, C. Allowed font family for SD-00043: A, C. Maximum uses of each font family in this note: A at most 1; B at most 3; C at most 3. The set GRP-0004 is exactly those three slide decks. Give each member of GRP-0004 exactly one font family, same-for-all(GRP-0004).", "question": "A draft plan gives C to SD-00041, C to SD-00042 and C to SD-00043. Does that draft satisfy every requirement in the note?", "options": [ "no complete plan satisfies the note", "the note does not settle it", "yes", "no" ], "answer": "yes", "settlement_stratum": "same-for-all:admissibility", "strata": { "form": "same-for-all", "task": "admissibility", "domain": "font-family", "set": "GRP-0004", "members": [ "SD-00041", "SD-00042", "SD-00043" ], "candidate": [ "C", "C", "C" ], "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "C" ] ], "capacities": { "A": 1, "B": 3, "C": 3 }, "form": "same-for-all", "task": "admissibility", "domain": "font-family", "feasible_count": 1, "candidate": [ "C", "C", "C" ], "gold": "yes" } }, { "id": "choice-r23-017", "english": "Assignment note GRP-0002: its members are FL-00021, FL-00022 and FL-00023. Allowed reviewer for FL-00021: A, B. Allowed reviewer for FL-00022: A, C. Allowed reviewer for FL-00023: A, B, C. Maximum uses of each reviewer in this note: A at most 3; B at most 3; C at most 2. The set GRP-0002 is exactly those three files. Give each member of GRP-0002 exactly one reviewer, and make those three values the same.", "ainglish": "Assignment note GRP-0002: its members are FL-00021, FL-00022 and FL-00023. Allowed reviewer for FL-00021: A, B. Allowed reviewer for FL-00022: A, C. Allowed reviewer for FL-00023: A, B, C. Maximum uses of each reviewer in this note: A at most 3; B at most 3; C at most 2. The set GRP-0002 is exactly those three files. Give each member of GRP-0002 exactly one reviewer, same-for-all(GRP-0002).", "question": "A draft plan gives A to FL-00021, A to FL-00022 and A to FL-00023. Does that draft satisfy every requirement in the note?", "options": [ "no", "no complete plan satisfies the note", "the note does not settle it", "yes" ], "answer": "yes", "settlement_stratum": "same-for-all:admissibility", "strata": { "form": "same-for-all", "task": "admissibility", "domain": "reviewer", "set": "GRP-0002", "members": [ "FL-00021", "FL-00022", "FL-00023" ], "candidate": [ "A", "A", "A" ], "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 2 }, "form": "same-for-all", "task": "admissibility", "domain": "reviewer", "feasible_count": 1, "candidate": [ "A", "A", "A" ], "gold": "yes" } }, { "id": "choice-r23-018", "english": "Assignment note GRP-0007: its members are SD-00071, SD-00072 and SD-00073. Allowed font family for SD-00071: A, B. Allowed font family for SD-00072: only B. Allowed font family for SD-00073: only B. Maximum uses of each font family in this note: A at most 3; B at most 3; C at most 2. The set GRP-0007 is exactly those three slide decks. Give each member of GRP-0007 exactly one font family, and make those three values the same.", "ainglish": "Assignment note GRP-0007: its members are SD-00071, SD-00072 and SD-00073. Allowed font family for SD-00071: A, B. Allowed font family for SD-00072: only B. Allowed font family for SD-00073: only B. Maximum uses of each font family in this note: A at most 3; B at most 3; C at most 2. The set GRP-0007 is exactly those three slide decks. Give each member of GRP-0007 exactly one font family, same-for-all(GRP-0007).", "question": "A draft plan gives A to SD-00071, B to SD-00072 and B to SD-00073. Does that draft satisfy every requirement in the note?", "options": [ "no", "no complete plan satisfies the note", "the note does not settle it", "yes" ], "answer": "no", "settlement_stratum": "same-for-all:admissibility", "strata": { "form": "same-for-all", "task": "admissibility", "domain": "font-family", "set": "GRP-0007", "members": [ "SD-00071", "SD-00072", "SD-00073" ], "candidate": [ "A", "B", "B" ], "gold_class": "no" }, "ledger": { "eligibility": [ [ "A", "B" ], [ "B" ], [ "B" ] ], "capacities": { "A": 3, "B": 3, "C": 2 }, "form": "same-for-all", "task": "admissibility", "domain": "font-family", "feasible_count": 1, "candidate": [ "A", "B", "B" ], "gold": "no" } }, { "id": "choice-r23-019", "english": "Assignment note GRP-0002: its members are WO-00021, WO-00022 and WO-00023. Allowed deadline slot for WO-00021: A, B, C. Allowed deadline slot for WO-00022: only C. Allowed deadline slot for WO-00023: only C. Maximum uses of each deadline slot in this note: A at most 3; B at most 3; C at most 3. The set GRP-0002 is exactly those three work orders. Give each member of GRP-0002 exactly one deadline slot, and make those three values the same.", "ainglish": "Assignment note GRP-0002: its members are WO-00021, WO-00022 and WO-00023. Allowed deadline slot for WO-00021: A, B, C. Allowed deadline slot for WO-00022: only C. Allowed deadline slot for WO-00023: only C. Maximum uses of each deadline slot in this note: A at most 3; B at most 3; C at most 3. The set GRP-0002 is exactly those three work orders. Give each member of GRP-0002 exactly one deadline slot, same-for-all(GRP-0002).", "question": "A draft plan gives C to WO-00021, C to WO-00022 and C to WO-00023. Does that draft satisfy every requirement in the note?", "options": [ "yes", "no", "no complete plan satisfies the note", "the note does not settle it" ], "answer": "yes", "settlement_stratum": "same-for-all:admissibility", "strata": { "form": "same-for-all", "task": "admissibility", "domain": "deadline", "set": "GRP-0002", "members": [ "WO-00021", "WO-00022", "WO-00023" ], "candidate": [ "C", "C", "C" ], "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "C" ], [ "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "form": "same-for-all", "task": "admissibility", "domain": "deadline", "feasible_count": 1, "candidate": [ "C", "C", "C" ], "gold": "yes" } }, { "id": "choice-r23-020", "english": "Assignment note GRP-0005: its members are SD-00051, SD-00052 and SD-00053. Allowed font family for SD-00051: A, B, C. Allowed font family for SD-00052: A, B, C. Allowed font family for SD-00053: only B. Maximum uses of each font family in this note: A at most 2; B at most 3; C at most 3. The set GRP-0005 is exactly those three slide decks. Give each member of GRP-0005 exactly one font family, and make those three values the same.", "ainglish": "Assignment note GRP-0005: its members are SD-00051, SD-00052 and SD-00053. Allowed font family for SD-00051: A, B, C. Allowed font family for SD-00052: A, B, C. Allowed font family for SD-00053: only B. Maximum uses of each font family in this note: A at most 2; B at most 3; C at most 3. The set GRP-0005 is exactly those three slide decks. Give each member of GRP-0005 exactly one font family, same-for-all(GRP-0005).", "question": "A draft plan gives C to SD-00051, B to SD-00052 and A to SD-00053. Does that draft satisfy every requirement in the note?", "options": [ "yes", "no", "no complete plan satisfies the note", "the note does not settle it" ], "answer": "no", "settlement_stratum": "same-for-all:admissibility", "strata": { "form": "same-for-all", "task": "admissibility", "domain": "font-family", "set": "GRP-0005", "members": [ "SD-00051", "SD-00052", "SD-00053" ], "candidate": [ "C", "B", "A" ], "gold_class": "no" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "B" ] ], "capacities": { "A": 2, "B": 3, "C": 3 }, "form": "same-for-all", "task": "admissibility", "domain": "font-family", "feasible_count": 1, "candidate": [ "C", "B", "A" ], "gold": "no" } }, { "id": "choice-r23-021", "english": "Assignment note GRP-0008: its members are SD-00081, SD-00082 and SD-00083. Allowed font family for SD-00081: B, C. Allowed font family for SD-00082: only C. Allowed font family for SD-00083: A, C. Maximum uses of each font family in this note: A at most 3; B at most 1; C at most 3. The set GRP-0008 is exactly those three slide decks. Give each member of GRP-0008 exactly one font family, and make those three values the same.", "ainglish": "Assignment note GRP-0008: its members are SD-00081, SD-00082 and SD-00083. Allowed font family for SD-00081: B, C. Allowed font family for SD-00082: only C. Allowed font family for SD-00083: A, C. Maximum uses of each font family in this note: A at most 3; B at most 1; C at most 3. The set GRP-0008 is exactly those three slide decks. Give each member of GRP-0008 exactly one font family, same-for-all(GRP-0008).", "question": "A draft plan gives A to SD-00081, B to SD-00082 and A to SD-00083. Does that draft satisfy every requirement in the note?", "options": [ "yes", "no", "no complete plan satisfies the note", "the note does not settle it" ], "answer": "no", "settlement_stratum": "same-for-all:admissibility", "strata": { "form": "same-for-all", "task": "admissibility", "domain": "font-family", "set": "GRP-0008", "members": [ "SD-00081", "SD-00082", "SD-00083" ], "candidate": [ "A", "B", "A" ], "gold_class": "no" }, "ledger": { "eligibility": [ [ "B", "C" ], [ "C" ], [ "A", "C" ] ], "capacities": { "A": 3, "B": 1, "C": 3 }, "form": "same-for-all", "task": "admissibility", "domain": "font-family", "feasible_count": 1, "candidate": [ "A", "B", "A" ], "gold": "no" } }, { "id": "choice-r23-022", "english": "Assignment note GRP-0001: its members are FL-00011, FL-00012 and FL-00013. Allowed reviewer for FL-00011: A, C. Allowed reviewer for FL-00012: A, C. Allowed reviewer for FL-00013: A, B, C. Maximum uses of each reviewer in this note: A at most 2; B at most 2; C at most 3. The set GRP-0001 is exactly those three files. Give each member of GRP-0001 exactly one reviewer, and make those three values the same.", "ainglish": "Assignment note GRP-0001: its members are FL-00011, FL-00012 and FL-00013. Allowed reviewer for FL-00011: A, C. Allowed reviewer for FL-00012: A, C. Allowed reviewer for FL-00013: A, B, C. Maximum uses of each reviewer in this note: A at most 2; B at most 2; C at most 3. The set GRP-0001 is exactly those three files. Give each member of GRP-0001 exactly one reviewer, same-for-all(GRP-0001).", "question": "A draft plan gives C to FL-00011, C to FL-00012 and C to FL-00013. Does that draft satisfy every requirement in the note?", "options": [ "yes", "no", "no complete plan satisfies the note", "the note does not settle it" ], "answer": "yes", "settlement_stratum": "same-for-all:admissibility", "strata": { "form": "same-for-all", "task": "admissibility", "domain": "reviewer", "set": "GRP-0001", "members": [ "FL-00011", "FL-00012", "FL-00013" ], "candidate": [ "C", "C", "C" ], "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "C" ], [ "A", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 2, "B": 2, "C": 3 }, "form": "same-for-all", "task": "admissibility", "domain": "reviewer", "feasible_count": 1, "candidate": [ "C", "C", "C" ], "gold": "yes" } }, { "id": "choice-r23-023", "english": "Assignment note GRP-0002: its members are BR-00021, BR-00022 and BR-00023. Allowed source dataset for BR-00021: A, B, C. Allowed source dataset for BR-00022: B, C. Allowed source dataset for BR-00023: A, B, C. Maximum uses of each source dataset in this note: A at most 2; B at most 3; C at most 2. The set GRP-0002 is exactly those three backup runs. Give each member of GRP-0002 exactly one source dataset, and make those three values the same.", "ainglish": "Assignment note GRP-0002: its members are BR-00021, BR-00022 and BR-00023. Allowed source dataset for BR-00021: A, B, C. Allowed source dataset for BR-00022: B, C. Allowed source dataset for BR-00023: A, B, C. Maximum uses of each source dataset in this note: A at most 2; B at most 3; C at most 2. The set GRP-0002 is exactly those three backup runs. Give each member of GRP-0002 exactly one source dataset, same-for-all(GRP-0002).", "question": "A draft plan gives B to BR-00021, B to BR-00022 and B to BR-00023. Does that draft satisfy every requirement in the note?", "options": [ "the note does not settle it", "yes", "no", "no complete plan satisfies the note" ], "answer": "yes", "settlement_stratum": "same-for-all:admissibility", "strata": { "form": "same-for-all", "task": "admissibility", "domain": "source-dataset", "set": "GRP-0002", "members": [ "BR-00021", "BR-00022", "BR-00023" ], "candidate": [ "B", "B", "B" ], "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 2, "B": 3, "C": 2 }, "form": "same-for-all", "task": "admissibility", "domain": "source-dataset", "feasible_count": 1, "candidate": [ "B", "B", "B" ], "gold": "yes" } }, { "id": "choice-r23-024", "english": "Assignment note GRP-0006: its members are BR-00061, BR-00062 and BR-00063. Allowed source dataset for BR-00061: only A. Allowed source dataset for BR-00062: A, B, C. Allowed source dataset for BR-00063: A, B, C. Maximum uses of each source dataset in this note: A at most 3; B at most 2; C at most 3. The set GRP-0006 is exactly those three backup runs. Give each member of GRP-0006 exactly one source dataset, and make those three values the same.", "ainglish": "Assignment note GRP-0006: its members are BR-00061, BR-00062 and BR-00063. Allowed source dataset for BR-00061: only A. Allowed source dataset for BR-00062: A, B, C. Allowed source dataset for BR-00063: A, B, C. Maximum uses of each source dataset in this note: A at most 3; B at most 2; C at most 3. The set GRP-0006 is exactly those three backup runs. Give each member of GRP-0006 exactly one source dataset, same-for-all(GRP-0006).", "question": "A draft plan gives A to BR-00061, C to BR-00062 and C to BR-00063. Does that draft satisfy every requirement in the note?", "options": [ "the note does not settle it", "yes", "no", "no complete plan satisfies the note" ], "answer": "no", "settlement_stratum": "same-for-all:admissibility", "strata": { "form": "same-for-all", "task": "admissibility", "domain": "source-dataset", "set": "GRP-0006", "members": [ "BR-00061", "BR-00062", "BR-00063" ], "candidate": [ "A", "C", "C" ], "gold_class": "no" }, "ledger": { "eligibility": [ [ "A" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 2, "C": 3 }, "form": "same-for-all", "task": "admissibility", "domain": "source-dataset", "feasible_count": 1, "candidate": [ "A", "C", "C" ], "gold": "no" } }, { "id": "choice-r23-025", "english": "Assignment note GRP-0004: its members are BR-00041, BR-00042 and BR-00043. Allowed source dataset for BR-00041: A, B, C. Allowed source dataset for BR-00042: A, B, C. Allowed source dataset for BR-00043: A, B. Maximum uses of each source dataset in this note: A at most 3; B at most 3; C at most 2. The set GRP-0004 is exactly those three backup runs. Give each member of GRP-0004 exactly one source dataset, and make those three values the same.", "ainglish": "Assignment note GRP-0004: its members are BR-00041, BR-00042 and BR-00043. Allowed source dataset for BR-00041: A, B, C. Allowed source dataset for BR-00042: A, B, C. Allowed source dataset for BR-00043: A, B. Maximum uses of each source dataset in this note: A at most 3; B at most 3; C at most 2. The set GRP-0004 is exactly those three backup runs. Give each member of GRP-0004 exactly one source dataset, same-for-all(GRP-0004).", "question": "A draft plan gives A to BR-00041, A to BR-00042 and A to BR-00043. Does that draft satisfy every requirement in the note?", "options": [ "no", "no complete plan satisfies the note", "the note does not settle it", "yes" ], "answer": "yes", "settlement_stratum": "same-for-all:admissibility", "strata": { "form": "same-for-all", "task": "admissibility", "domain": "source-dataset", "set": "GRP-0004", "members": [ "BR-00041", "BR-00042", "BR-00043" ], "candidate": [ "A", "A", "A" ], "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B" ] ], "capacities": { "A": 3, "B": 3, "C": 2 }, "form": "same-for-all", "task": "admissibility", "domain": "source-dataset", "feasible_count": 2, "candidate": [ "A", "A", "A" ], "gold": "yes" } }, { "id": "choice-r23-026", "english": "Assignment note GRP-0006: its members are FL-00061, FL-00062 and FL-00063. Allowed reviewer for FL-00061: A, C. Allowed reviewer for FL-00062: A, B, C. Allowed reviewer for FL-00063: A, B, C. Maximum uses of each reviewer in this note: A at most 2; B at most 3; C at most 3. The set GRP-0006 is exactly those three files. Give each member of GRP-0006 exactly one reviewer, and make those three values the same.", "ainglish": "Assignment note GRP-0006: its members are FL-00061, FL-00062 and FL-00063. Allowed reviewer for FL-00061: A, C. Allowed reviewer for FL-00062: A, B, C. Allowed reviewer for FL-00063: A, B, C. Maximum uses of each reviewer in this note: A at most 2; B at most 3; C at most 3. The set GRP-0006 is exactly those three files. Give each member of GRP-0006 exactly one reviewer, same-for-all(GRP-0006).", "question": "A draft plan gives B to FL-00061, C to FL-00062 and A to FL-00063. Does that draft satisfy every requirement in the note?", "options": [ "no complete plan satisfies the note", "the note does not settle it", "yes", "no" ], "answer": "no", "settlement_stratum": "same-for-all:admissibility", "strata": { "form": "same-for-all", "task": "admissibility", "domain": "reviewer", "set": "GRP-0006", "members": [ "FL-00061", "FL-00062", "FL-00063" ], "candidate": [ "B", "C", "A" ], "gold_class": "no" }, "ledger": { "eligibility": [ [ "A", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 2, "B": 3, "C": 3 }, "form": "same-for-all", "task": "admissibility", "domain": "reviewer", "feasible_count": 1, "candidate": [ "B", "C", "A" ], "gold": "no" } }, { "id": "choice-r23-027", "english": "Assignment note GRP-0007: its members are FL-00071, FL-00072 and FL-00073. Allowed reviewer for FL-00071: A, B, C. Allowed reviewer for FL-00072: only A. Allowed reviewer for FL-00073: only A. Maximum uses of each reviewer in this note: A at most 3; B at most 1; C at most 1. The set GRP-0007 is exactly those three files. Give each member of GRP-0007 exactly one reviewer, and make those three values the same.", "ainglish": "Assignment note GRP-0007: its members are FL-00071, FL-00072 and FL-00073. Allowed reviewer for FL-00071: A, B, C. Allowed reviewer for FL-00072: only A. Allowed reviewer for FL-00073: only A. Maximum uses of each reviewer in this note: A at most 3; B at most 1; C at most 1. The set GRP-0007 is exactly those three files. Give each member of GRP-0007 exactly one reviewer, same-for-all(GRP-0007).", "question": "A draft plan gives C to FL-00071, B to FL-00072 and A to FL-00073. Does that draft satisfy every requirement in the note?", "options": [ "yes", "no", "no complete plan satisfies the note", "the note does not settle it" ], "answer": "no", "settlement_stratum": "same-for-all:admissibility", "strata": { "form": "same-for-all", "task": "admissibility", "domain": "reviewer", "set": "GRP-0007", "members": [ "FL-00071", "FL-00072", "FL-00073" ], "candidate": [ "C", "B", "A" ], "gold_class": "no" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A" ], [ "A" ] ], "capacities": { "A": 3, "B": 1, "C": 1 }, "form": "same-for-all", "task": "admissibility", "domain": "reviewer", "feasible_count": 1, "candidate": [ "C", "B", "A" ], "gold": "no" } }, { "id": "choice-r23-028", "english": "Assignment note GRP-0008: its members are FL-00081, FL-00082 and FL-00083. Allowed reviewer for FL-00081: A, B, C. Allowed reviewer for FL-00082: A, B, C. Allowed reviewer for FL-00083: only B. Maximum uses of each reviewer in this note: A at most 2; B at most 3; C at most 2. The set GRP-0008 is exactly those three files. Give each member of GRP-0008 exactly one reviewer, and make those three values the same.", "ainglish": "Assignment note GRP-0008: its members are FL-00081, FL-00082 and FL-00083. Allowed reviewer for FL-00081: A, B, C. Allowed reviewer for FL-00082: A, B, C. Allowed reviewer for FL-00083: only B. Maximum uses of each reviewer in this note: A at most 2; B at most 3; C at most 2. The set GRP-0008 is exactly those three files. Give each member of GRP-0008 exactly one reviewer, same-for-all(GRP-0008).", "question": "A draft plan gives C to FL-00081, B to FL-00082 and A to FL-00083. Does that draft satisfy every requirement in the note?", "options": [ "the note does not settle it", "yes", "no", "no complete plan satisfies the note" ], "answer": "no", "settlement_stratum": "same-for-all:admissibility", "strata": { "form": "same-for-all", "task": "admissibility", "domain": "reviewer", "set": "GRP-0008", "members": [ "FL-00081", "FL-00082", "FL-00083" ], "candidate": [ "C", "B", "A" ], "gold_class": "no" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "B" ] ], "capacities": { "A": 2, "B": 3, "C": 2 }, "form": "same-for-all", "task": "admissibility", "domain": "reviewer", "feasible_count": 1, "candidate": [ "C", "B", "A" ], "gold": "no" } }, { "id": "choice-r23-029", "english": "Assignment note GRP-0004: its members are FL-00041, FL-00042 and FL-00043. Allowed reviewer for FL-00041: A, B. Allowed reviewer for FL-00042: only B. Allowed reviewer for FL-00043: A, B. Maximum uses of each reviewer in this note: A at most 2; B at most 3; C at most 1. The set GRP-0004 is exactly those three files. Give each member of GRP-0004 exactly one reviewer, and make those three values the same.", "ainglish": "Assignment note GRP-0004: its members are FL-00041, FL-00042 and FL-00043. Allowed reviewer for FL-00041: A, B. Allowed reviewer for FL-00042: only B. Allowed reviewer for FL-00043: A, B. Maximum uses of each reviewer in this note: A at most 2; B at most 3; C at most 1. The set GRP-0004 is exactly those three files. Give each member of GRP-0004 exactly one reviewer, same-for-all(GRP-0004).", "question": "A draft plan gives B to FL-00041, B to FL-00042 and B to FL-00043. Does that draft satisfy every requirement in the note?", "options": [ "no complete plan satisfies the note", "the note does not settle it", "yes", "no" ], "answer": "yes", "settlement_stratum": "same-for-all:admissibility", "strata": { "form": "same-for-all", "task": "admissibility", "domain": "reviewer", "set": "GRP-0004", "members": [ "FL-00041", "FL-00042", "FL-00043" ], "candidate": [ "B", "B", "B" ], "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "B" ], [ "B" ], [ "A", "B" ] ], "capacities": { "A": 2, "B": 3, "C": 1 }, "form": "same-for-all", "task": "admissibility", "domain": "reviewer", "feasible_count": 1, "candidate": [ "B", "B", "B" ], "gold": "yes" } }, { "id": "choice-r23-030", "english": "Assignment note GRP-0008: its members are BR-00081, BR-00082 and BR-00083. Allowed source dataset for BR-00081: A, C. Allowed source dataset for BR-00082: B, C. Allowed source dataset for BR-00083: A, B, C. Maximum uses of each source dataset in this note: A at most 3; B at most 3; C at most 3. The set GRP-0008 is exactly those three backup runs. Give each member of GRP-0008 exactly one source dataset, and make those three values the same.", "ainglish": "Assignment note GRP-0008: its members are BR-00081, BR-00082 and BR-00083. Allowed source dataset for BR-00081: A, C. Allowed source dataset for BR-00082: B, C. Allowed source dataset for BR-00083: A, B, C. Maximum uses of each source dataset in this note: A at most 3; B at most 3; C at most 3. The set GRP-0008 is exactly those three backup runs. Give each member of GRP-0008 exactly one source dataset, same-for-all(GRP-0008).", "question": "A draft plan gives B to BR-00081, C to BR-00082 and B to BR-00083. Does that draft satisfy every requirement in the note?", "options": [ "the note does not settle it", "yes", "no", "no complete plan satisfies the note" ], "answer": "no", "settlement_stratum": "same-for-all:admissibility", "strata": { "form": "same-for-all", "task": "admissibility", "domain": "source-dataset", "set": "GRP-0008", "members": [ "BR-00081", "BR-00082", "BR-00083" ], "candidate": [ "B", "C", "B" ], "gold_class": "no" }, "ledger": { "eligibility": [ [ "A", "C" ], [ "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "form": "same-for-all", "task": "admissibility", "domain": "source-dataset", "feasible_count": 1, "candidate": [ "B", "C", "B" ], "gold": "no" } }, { "id": "choice-r23-031", "english": "Assignment note GRP-0003: its members are FL-00031, FL-00032 and FL-00033. Allowed reviewer for FL-00031: A, B, C. Allowed reviewer for FL-00032: A, B. Allowed reviewer for FL-00033: B, C. Maximum uses of each reviewer in this note: A at most 2; B at most 3; C at most 1. The set GRP-0003 is exactly those three files. Give each member of GRP-0003 exactly one reviewer, and make those three values the same.", "ainglish": "Assignment note GRP-0003: its members are FL-00031, FL-00032 and FL-00033. Allowed reviewer for FL-00031: A, B, C. Allowed reviewer for FL-00032: A, B. Allowed reviewer for FL-00033: B, C. Maximum uses of each reviewer in this note: A at most 2; B at most 3; C at most 1. The set GRP-0003 is exactly those three files. Give each member of GRP-0003 exactly one reviewer, same-for-all(GRP-0003).", "question": "A draft plan gives B to FL-00031, B to FL-00032 and B to FL-00033. Does that draft satisfy every requirement in the note?", "options": [ "the note does not settle it", "yes", "no", "no complete plan satisfies the note" ], "answer": "yes", "settlement_stratum": "same-for-all:admissibility", "strata": { "form": "same-for-all", "task": "admissibility", "domain": "reviewer", "set": "GRP-0003", "members": [ "FL-00031", "FL-00032", "FL-00033" ], "candidate": [ "B", "B", "B" ], "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B" ], [ "B", "C" ] ], "capacities": { "A": 2, "B": 3, "C": 1 }, "form": "same-for-all", "task": "admissibility", "domain": "reviewer", "feasible_count": 1, "candidate": [ "B", "B", "B" ], "gold": "yes" } }, { "id": "choice-r23-032", "english": "Assignment note GRP-0006: its members are WO-00061, WO-00062 and WO-00063. Allowed deadline slot for WO-00061: B, C. Allowed deadline slot for WO-00062: A, C. Allowed deadline slot for WO-00063: only C. Maximum uses of each deadline slot in this note: A at most 3; B at most 3; C at most 1. The set GRP-0006 is exactly those three work orders. Give each member of GRP-0006 exactly one deadline slot, and make those three values the same.", "ainglish": "Assignment note GRP-0006: its members are WO-00061, WO-00062 and WO-00063. Allowed deadline slot for WO-00061: B, C. Allowed deadline slot for WO-00062: A, C. Allowed deadline slot for WO-00063: only C. Maximum uses of each deadline slot in this note: A at most 3; B at most 3; C at most 1. The set GRP-0006 is exactly those three work orders. Give each member of GRP-0006 exactly one deadline slot, same-for-all(GRP-0006).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "yes", "no", "the note does not settle it" ], "answer": "no", "settlement_stratum": "same-for-all:feasibility", "strata": { "form": "same-for-all", "task": "feasibility", "domain": "deadline", "set": "GRP-0006", "members": [ "WO-00061", "WO-00062", "WO-00063" ], "candidate": null, "gold_class": "no" }, "ledger": { "eligibility": [ [ "B", "C" ], [ "A", "C" ], [ "C" ] ], "capacities": { "A": 3, "B": 3, "C": 1 }, "form": "same-for-all", "task": "feasibility", "domain": "deadline", "feasible_count": 0, "gold": "no" } }, { "id": "choice-r23-033", "english": "Assignment note GRP-0003: its members are BR-00031, BR-00032 and BR-00033. Allowed source dataset for BR-00031: only C. Allowed source dataset for BR-00032: A, C. Allowed source dataset for BR-00033: A, B, C. Maximum uses of each source dataset in this note: A at most 1; B at most 2; C at most 3. The set GRP-0003 is exactly those three backup runs. Give each member of GRP-0003 exactly one source dataset, and make those three values the same.", "ainglish": "Assignment note GRP-0003: its members are BR-00031, BR-00032 and BR-00033. Allowed source dataset for BR-00031: only C. Allowed source dataset for BR-00032: A, C. Allowed source dataset for BR-00033: A, B, C. Maximum uses of each source dataset in this note: A at most 1; B at most 2; C at most 3. The set GRP-0003 is exactly those three backup runs. Give each member of GRP-0003 exactly one source dataset, same-for-all(GRP-0003).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "yes", "no", "the note does not settle it" ], "answer": "yes", "settlement_stratum": "same-for-all:feasibility", "strata": { "form": "same-for-all", "task": "feasibility", "domain": "source-dataset", "set": "GRP-0003", "members": [ "BR-00031", "BR-00032", "BR-00033" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "C" ], [ "A", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 1, "B": 2, "C": 3 }, "form": "same-for-all", "task": "feasibility", "domain": "source-dataset", "feasible_count": 1, "gold": "yes" } }, { "id": "choice-r23-034", "english": "Assignment note GRP-0001: its members are WO-00011, WO-00012 and WO-00013. Allowed deadline slot for WO-00011: A, B, C. Allowed deadline slot for WO-00012: B, C. Allowed deadline slot for WO-00013: A, C. Maximum uses of each deadline slot in this note: A at most 3; B at most 2; C at most 3. The set GRP-0001 is exactly those three work orders. Give each member of GRP-0001 exactly one deadline slot, and make those three values the same.", "ainglish": "Assignment note GRP-0001: its members are WO-00011, WO-00012 and WO-00013. Allowed deadline slot for WO-00011: A, B, C. Allowed deadline slot for WO-00012: B, C. Allowed deadline slot for WO-00013: A, C. Maximum uses of each deadline slot in this note: A at most 3; B at most 2; C at most 3. The set GRP-0001 is exactly those three work orders. Give each member of GRP-0001 exactly one deadline slot, same-for-all(GRP-0001).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "no", "the note does not settle it", "yes" ], "answer": "yes", "settlement_stratum": "same-for-all:feasibility", "strata": { "form": "same-for-all", "task": "feasibility", "domain": "deadline", "set": "GRP-0001", "members": [ "WO-00011", "WO-00012", "WO-00013" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "B", "C" ], [ "A", "C" ] ], "capacities": { "A": 3, "B": 2, "C": 3 }, "form": "same-for-all", "task": "feasibility", "domain": "deadline", "feasible_count": 1, "gold": "yes" } }, { "id": "choice-r23-035", "english": "Assignment note GRP-0006: its members are FL-00061, FL-00062 and FL-00063. Allowed reviewer for FL-00061: B, C. Allowed reviewer for FL-00062: A, B, C. Allowed reviewer for FL-00063: only A. Maximum uses of each reviewer in this note: A at most 3; B at most 3; C at most 2. The set GRP-0006 is exactly those three files. Give each member of GRP-0006 exactly one reviewer, and make those three values the same.", "ainglish": "Assignment note GRP-0006: its members are FL-00061, FL-00062 and FL-00063. Allowed reviewer for FL-00061: B, C. Allowed reviewer for FL-00062: A, B, C. Allowed reviewer for FL-00063: only A. Maximum uses of each reviewer in this note: A at most 3; B at most 3; C at most 2. The set GRP-0006 is exactly those three files. Give each member of GRP-0006 exactly one reviewer, same-for-all(GRP-0006).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "the note does not settle it", "yes", "no" ], "answer": "no", "settlement_stratum": "same-for-all:feasibility", "strata": { "form": "same-for-all", "task": "feasibility", "domain": "reviewer", "set": "GRP-0006", "members": [ "FL-00061", "FL-00062", "FL-00063" ], "candidate": null, "gold_class": "no" }, "ledger": { "eligibility": [ [ "B", "C" ], [ "A", "B", "C" ], [ "A" ] ], "capacities": { "A": 3, "B": 3, "C": 2 }, "form": "same-for-all", "task": "feasibility", "domain": "reviewer", "feasible_count": 0, "gold": "no" } }, { "id": "choice-r23-036", "english": "Assignment note GRP-0007: its members are BR-00071, BR-00072 and BR-00073. Allowed source dataset for BR-00071: A, B, C. Allowed source dataset for BR-00072: only A. Allowed source dataset for BR-00073: B, C. Maximum uses of each source dataset in this note: A at most 1; B at most 3; C at most 3. The set GRP-0007 is exactly those three backup runs. Give each member of GRP-0007 exactly one source dataset, and make those three values the same.", "ainglish": "Assignment note GRP-0007: its members are BR-00071, BR-00072 and BR-00073. Allowed source dataset for BR-00071: A, B, C. Allowed source dataset for BR-00072: only A. Allowed source dataset for BR-00073: B, C. Maximum uses of each source dataset in this note: A at most 1; B at most 3; C at most 3. The set GRP-0007 is exactly those three backup runs. Give each member of GRP-0007 exactly one source dataset, same-for-all(GRP-0007).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "yes", "no", "the note does not settle it" ], "answer": "no", "settlement_stratum": "same-for-all:feasibility", "strata": { "form": "same-for-all", "task": "feasibility", "domain": "source-dataset", "set": "GRP-0007", "members": [ "BR-00071", "BR-00072", "BR-00073" ], "candidate": null, "gold_class": "no" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A" ], [ "B", "C" ] ], "capacities": { "A": 1, "B": 3, "C": 3 }, "form": "same-for-all", "task": "feasibility", "domain": "source-dataset", "feasible_count": 0, "gold": "no" } }, { "id": "choice-r23-037", "english": "Assignment note GRP-0002: its members are WO-00021, WO-00022 and WO-00023. Allowed deadline slot for WO-00021: A, B, C. Allowed deadline slot for WO-00022: only B. Allowed deadline slot for WO-00023: only B. Maximum uses of each deadline slot in this note: A at most 1; B at most 3; C at most 1. The set GRP-0002 is exactly those three work orders. Give each member of GRP-0002 exactly one deadline slot, and make those three values the same.", "ainglish": "Assignment note GRP-0002: its members are WO-00021, WO-00022 and WO-00023. Allowed deadline slot for WO-00021: A, B, C. Allowed deadline slot for WO-00022: only B. Allowed deadline slot for WO-00023: only B. Maximum uses of each deadline slot in this note: A at most 1; B at most 3; C at most 1. The set GRP-0002 is exactly those three work orders. Give each member of GRP-0002 exactly one deadline slot, same-for-all(GRP-0002).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "yes", "no", "the note does not settle it" ], "answer": "yes", "settlement_stratum": "same-for-all:feasibility", "strata": { "form": "same-for-all", "task": "feasibility", "domain": "deadline", "set": "GRP-0002", "members": [ "WO-00021", "WO-00022", "WO-00023" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "B" ], [ "B" ] ], "capacities": { "A": 1, "B": 3, "C": 1 }, "form": "same-for-all", "task": "feasibility", "domain": "deadline", "feasible_count": 1, "gold": "yes" } }, { "id": "choice-r23-038", "english": "Assignment note GRP-0005: its members are BR-00051, BR-00052 and BR-00053. Allowed source dataset for BR-00051: A, B, C. Allowed source dataset for BR-00052: B, C. Allowed source dataset for BR-00053: A, C. Maximum uses of each source dataset in this note: A at most 3; B at most 2; C at most 1. The set GRP-0005 is exactly those three backup runs. Give each member of GRP-0005 exactly one source dataset, and make those three values the same.", "ainglish": "Assignment note GRP-0005: its members are BR-00051, BR-00052 and BR-00053. Allowed source dataset for BR-00051: A, B, C. Allowed source dataset for BR-00052: B, C. Allowed source dataset for BR-00053: A, C. Maximum uses of each source dataset in this note: A at most 3; B at most 2; C at most 1. The set GRP-0005 is exactly those three backup runs. Give each member of GRP-0005 exactly one source dataset, same-for-all(GRP-0005).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "no", "the note does not settle it", "yes" ], "answer": "no", "settlement_stratum": "same-for-all:feasibility", "strata": { "form": "same-for-all", "task": "feasibility", "domain": "source-dataset", "set": "GRP-0005", "members": [ "BR-00051", "BR-00052", "BR-00053" ], "candidate": null, "gold_class": "no" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "B", "C" ], [ "A", "C" ] ], "capacities": { "A": 3, "B": 2, "C": 1 }, "form": "same-for-all", "task": "feasibility", "domain": "source-dataset", "feasible_count": 0, "gold": "no" } }, { "id": "choice-r23-039", "english": "Assignment note GRP-0003: its members are SD-00031, SD-00032 and SD-00033. Allowed font family for SD-00031: only C. Allowed font family for SD-00032: A, B, C. Allowed font family for SD-00033: A, C. Maximum uses of each font family in this note: A at most 3; B at most 1; C at most 3. The set GRP-0003 is exactly those three slide decks. Give each member of GRP-0003 exactly one font family, and make those three values the same.", "ainglish": "Assignment note GRP-0003: its members are SD-00031, SD-00032 and SD-00033. Allowed font family for SD-00031: only C. Allowed font family for SD-00032: A, B, C. Allowed font family for SD-00033: A, C. Maximum uses of each font family in this note: A at most 3; B at most 1; C at most 3. The set GRP-0003 is exactly those three slide decks. Give each member of GRP-0003 exactly one font family, same-for-all(GRP-0003).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "no", "the note does not settle it", "yes" ], "answer": "yes", "settlement_stratum": "same-for-all:feasibility", "strata": { "form": "same-for-all", "task": "feasibility", "domain": "font-family", "set": "GRP-0003", "members": [ "SD-00031", "SD-00032", "SD-00033" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "C" ], [ "A", "B", "C" ], [ "A", "C" ] ], "capacities": { "A": 3, "B": 1, "C": 3 }, "form": "same-for-all", "task": "feasibility", "domain": "font-family", "feasible_count": 1, "gold": "yes" } }, { "id": "choice-r23-040", "english": "Assignment note GRP-0002: its members are BR-00021, BR-00022 and BR-00023. Allowed source dataset for BR-00021: A, B. Allowed source dataset for BR-00022: A, B. Allowed source dataset for BR-00023: A, B, C. Maximum uses of each source dataset in this note: A at most 1; B at most 3; C at most 3. The set GRP-0002 is exactly those three backup runs. Give each member of GRP-0002 exactly one source dataset, and make those three values the same.", "ainglish": "Assignment note GRP-0002: its members are BR-00021, BR-00022 and BR-00023. Allowed source dataset for BR-00021: A, B. Allowed source dataset for BR-00022: A, B. Allowed source dataset for BR-00023: A, B, C. Maximum uses of each source dataset in this note: A at most 1; B at most 3; C at most 3. The set GRP-0002 is exactly those three backup runs. Give each member of GRP-0002 exactly one source dataset, same-for-all(GRP-0002).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "yes", "no", "the note does not settle it" ], "answer": "yes", "settlement_stratum": "same-for-all:feasibility", "strata": { "form": "same-for-all", "task": "feasibility", "domain": "source-dataset", "set": "GRP-0002", "members": [ "BR-00021", "BR-00022", "BR-00023" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B", "C" ] ], "capacities": { "A": 1, "B": 3, "C": 3 }, "form": "same-for-all", "task": "feasibility", "domain": "source-dataset", "feasible_count": 1, "gold": "yes" } }, { "id": "choice-r23-041", "english": "Assignment note GRP-0006: its members are BR-00061, BR-00062 and BR-00063. Allowed source dataset for BR-00061: A, B. Allowed source dataset for BR-00062: A, B, C. Allowed source dataset for BR-00063: A, B. Maximum uses of each source dataset in this note: A at most 1; B at most 1; C at most 3. The set GRP-0006 is exactly those three backup runs. Give each member of GRP-0006 exactly one source dataset, and make those three values the same.", "ainglish": "Assignment note GRP-0006: its members are BR-00061, BR-00062 and BR-00063. Allowed source dataset for BR-00061: A, B. Allowed source dataset for BR-00062: A, B, C. Allowed source dataset for BR-00063: A, B. Maximum uses of each source dataset in this note: A at most 1; B at most 1; C at most 3. The set GRP-0006 is exactly those three backup runs. Give each member of GRP-0006 exactly one source dataset, same-for-all(GRP-0006).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "yes", "no", "the note does not settle it" ], "answer": "no", "settlement_stratum": "same-for-all:feasibility", "strata": { "form": "same-for-all", "task": "feasibility", "domain": "source-dataset", "set": "GRP-0006", "members": [ "BR-00061", "BR-00062", "BR-00063" ], "candidate": null, "gold_class": "no" }, "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B", "C" ], [ "A", "B" ] ], "capacities": { "A": 1, "B": 1, "C": 3 }, "form": "same-for-all", "task": "feasibility", "domain": "source-dataset", "feasible_count": 0, "gold": "no" } }, { "id": "choice-r23-042", "english": "Assignment note GRP-0007: its members are FL-00071, FL-00072 and FL-00073. Allowed reviewer for FL-00071: A, C. Allowed reviewer for FL-00072: only B. Allowed reviewer for FL-00073: A, B, C. Maximum uses of each reviewer in this note: A at most 3; B at most 3; C at most 2. The set GRP-0007 is exactly those three files. Give each member of GRP-0007 exactly one reviewer, and make those three values the same.", "ainglish": "Assignment note GRP-0007: its members are FL-00071, FL-00072 and FL-00073. Allowed reviewer for FL-00071: A, C. Allowed reviewer for FL-00072: only B. Allowed reviewer for FL-00073: A, B, C. Maximum uses of each reviewer in this note: A at most 3; B at most 3; C at most 2. The set GRP-0007 is exactly those three files. Give each member of GRP-0007 exactly one reviewer, same-for-all(GRP-0007).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "no", "the note does not settle it", "yes" ], "answer": "no", "settlement_stratum": "same-for-all:feasibility", "strata": { "form": "same-for-all", "task": "feasibility", "domain": "reviewer", "set": "GRP-0007", "members": [ "FL-00071", "FL-00072", "FL-00073" ], "candidate": null, "gold_class": "no" }, "ledger": { "eligibility": [ [ "A", "C" ], [ "B" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 2 }, "form": "same-for-all", "task": "feasibility", "domain": "reviewer", "feasible_count": 0, "gold": "no" } }, { "id": "choice-r23-043", "english": "Assignment note GRP-0002: its members are SD-00021, SD-00022 and SD-00023. Allowed font family for SD-00021: A, B, C. Allowed font family for SD-00022: A, B, C. Allowed font family for SD-00023: only C. Maximum uses of each font family in this note: A at most 2; B at most 1; C at most 3. The set GRP-0002 is exactly those three slide decks. Give each member of GRP-0002 exactly one font family, and make those three values the same.", "ainglish": "Assignment note GRP-0002: its members are SD-00021, SD-00022 and SD-00023. Allowed font family for SD-00021: A, B, C. Allowed font family for SD-00022: A, B, C. Allowed font family for SD-00023: only C. Maximum uses of each font family in this note: A at most 2; B at most 1; C at most 3. The set GRP-0002 is exactly those three slide decks. Give each member of GRP-0002 exactly one font family, same-for-all(GRP-0002).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "the note does not settle it", "yes", "no" ], "answer": "yes", "settlement_stratum": "same-for-all:feasibility", "strata": { "form": "same-for-all", "task": "feasibility", "domain": "font-family", "set": "GRP-0002", "members": [ "SD-00021", "SD-00022", "SD-00023" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "C" ] ], "capacities": { "A": 2, "B": 1, "C": 3 }, "form": "same-for-all", "task": "feasibility", "domain": "font-family", "feasible_count": 1, "gold": "yes" } }, { "id": "choice-r23-044", "english": "Assignment note GRP-0005: its members are FL-00051, FL-00052 and FL-00053. Allowed reviewer for FL-00051: A, B. Allowed reviewer for FL-00052: A, C. Allowed reviewer for FL-00053: B, C. Maximum uses of each reviewer in this note: A at most 1; B at most 2; C at most 2. The set GRP-0005 is exactly those three files. Give each member of GRP-0005 exactly one reviewer, and make those three values the same.", "ainglish": "Assignment note GRP-0005: its members are FL-00051, FL-00052 and FL-00053. Allowed reviewer for FL-00051: A, B. Allowed reviewer for FL-00052: A, C. Allowed reviewer for FL-00053: B, C. Maximum uses of each reviewer in this note: A at most 1; B at most 2; C at most 2. The set GRP-0005 is exactly those three files. Give each member of GRP-0005 exactly one reviewer, same-for-all(GRP-0005).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "no", "the note does not settle it", "yes" ], "answer": "no", "settlement_stratum": "same-for-all:feasibility", "strata": { "form": "same-for-all", "task": "feasibility", "domain": "reviewer", "set": "GRP-0005", "members": [ "FL-00051", "FL-00052", "FL-00053" ], "candidate": null, "gold_class": "no" }, "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "C" ], [ "B", "C" ] ], "capacities": { "A": 1, "B": 2, "C": 2 }, "form": "same-for-all", "task": "feasibility", "domain": "reviewer", "feasible_count": 0, "gold": "no" } }, { "id": "choice-r23-045", "english": "Assignment note GRP-0007: its members are SD-00071, SD-00072 and SD-00073. Allowed font family for SD-00071: A, B. Allowed font family for SD-00072: only C. Allowed font family for SD-00073: only B. Maximum uses of each font family in this note: A at most 1; B at most 1; C at most 3. The set GRP-0007 is exactly those three slide decks. Give each member of GRP-0007 exactly one font family, and make those three values the same.", "ainglish": "Assignment note GRP-0007: its members are SD-00071, SD-00072 and SD-00073. Allowed font family for SD-00071: A, B. Allowed font family for SD-00072: only C. Allowed font family for SD-00073: only B. Maximum uses of each font family in this note: A at most 1; B at most 1; C at most 3. The set GRP-0007 is exactly those three slide decks. Give each member of GRP-0007 exactly one font family, same-for-all(GRP-0007).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "yes", "no", "the note does not settle it" ], "answer": "no", "settlement_stratum": "same-for-all:feasibility", "strata": { "form": "same-for-all", "task": "feasibility", "domain": "font-family", "set": "GRP-0007", "members": [ "SD-00071", "SD-00072", "SD-00073" ], "candidate": null, "gold_class": "no" }, "ledger": { "eligibility": [ [ "A", "B" ], [ "C" ], [ "B" ] ], "capacities": { "A": 1, "B": 1, "C": 3 }, "form": "same-for-all", "task": "feasibility", "domain": "font-family", "feasible_count": 0, "gold": "no" } }, { "id": "choice-r23-046", "english": "Assignment note GRP-0004: its members are WO-00041, WO-00042 and WO-00043. Allowed deadline slot for WO-00041: A, B, C. Allowed deadline slot for WO-00042: A, B, C. Allowed deadline slot for WO-00043: A, B, C. Maximum uses of each deadline slot in this note: A at most 1; B at most 3; C at most 3. The set GRP-0004 is exactly those three work orders. Give each member of GRP-0004 exactly one deadline slot, and make those three values the same.", "ainglish": "Assignment note GRP-0004: its members are WO-00041, WO-00042 and WO-00043. Allowed deadline slot for WO-00041: A, B, C. Allowed deadline slot for WO-00042: A, B, C. Allowed deadline slot for WO-00043: A, B, C. Maximum uses of each deadline slot in this note: A at most 1; B at most 3; C at most 3. The set GRP-0004 is exactly those three work orders. Give each member of GRP-0004 exactly one deadline slot, same-for-all(GRP-0004).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "yes", "no", "the note does not settle it" ], "answer": "yes", "settlement_stratum": "same-for-all:feasibility", "strata": { "form": "same-for-all", "task": "feasibility", "domain": "deadline", "set": "GRP-0004", "members": [ "WO-00041", "WO-00042", "WO-00043" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 1, "B": 3, "C": 3 }, "form": "same-for-all", "task": "feasibility", "domain": "deadline", "feasible_count": 2, "gold": "yes" } }, { "id": "choice-r23-047", "english": "Assignment note GRP-0004: its members are BR-00041, BR-00042 and BR-00043. Allowed source dataset for BR-00041: B, C. Allowed source dataset for BR-00042: A, B, C. Allowed source dataset for BR-00043: A, B, C. Maximum uses of each source dataset in this note: A at most 2; B at most 1; C at most 3. The set GRP-0004 is exactly those three backup runs. Give each member of GRP-0004 exactly one source dataset, and make those three values the same.", "ainglish": "Assignment note GRP-0004: its members are BR-00041, BR-00042 and BR-00043. Allowed source dataset for BR-00041: B, C. Allowed source dataset for BR-00042: A, B, C. Allowed source dataset for BR-00043: A, B, C. Maximum uses of each source dataset in this note: A at most 2; B at most 1; C at most 3. The set GRP-0004 is exactly those three backup runs. Give each member of GRP-0004 exactly one source dataset, same-for-all(GRP-0004).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "yes", "no", "the note does not settle it" ], "answer": "yes", "settlement_stratum": "same-for-all:feasibility", "strata": { "form": "same-for-all", "task": "feasibility", "domain": "source-dataset", "set": "GRP-0004", "members": [ "BR-00041", "BR-00042", "BR-00043" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 2, "B": 1, "C": 3 }, "form": "same-for-all", "task": "feasibility", "domain": "source-dataset", "feasible_count": 1, "gold": "yes" } }, { "id": "choice-r23-048", "english": "Assignment note GRP-0008: its members are SD-00081, SD-00082 and SD-00083. Allowed font family for SD-00081: B, C. Allowed font family for SD-00082: B, C. Allowed font family for SD-00083: only A. Maximum uses of each font family in this note: A at most 1; B at most 1; C at most 2. The set GRP-0008 is exactly those three slide decks. Give each member of GRP-0008 exactly one font family, and make those three values the same.", "ainglish": "Assignment note GRP-0008: its members are SD-00081, SD-00082 and SD-00083. Allowed font family for SD-00081: B, C. Allowed font family for SD-00082: B, C. Allowed font family for SD-00083: only A. Maximum uses of each font family in this note: A at most 1; B at most 1; C at most 2. The set GRP-0008 is exactly those three slide decks. Give each member of GRP-0008 exactly one font family, same-for-all(GRP-0008).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "no", "the note does not settle it", "yes" ], "answer": "no", "settlement_stratum": "same-for-all:feasibility", "strata": { "form": "same-for-all", "task": "feasibility", "domain": "font-family", "set": "GRP-0008", "members": [ "SD-00081", "SD-00082", "SD-00083" ], "candidate": null, "gold_class": "no" }, "ledger": { "eligibility": [ [ "B", "C" ], [ "B", "C" ], [ "A" ] ], "capacities": { "A": 1, "B": 1, "C": 2 }, "form": "same-for-all", "task": "feasibility", "domain": "font-family", "feasible_count": 0, "gold": "no" } }, { "id": "choice-r23-049", "english": "Assignment note GRP-0005: its members are WO-00051, WO-00052 and WO-00053. Allowed deadline slot for WO-00051: A, B, C. Allowed deadline slot for WO-00052: A, B, C. Allowed deadline slot for WO-00053: A, B, C. Maximum uses of each deadline slot in this note: A at most 2; B at most 1; C at most 2. The set GRP-0005 is exactly those three work orders. Give each member of GRP-0005 exactly one deadline slot, and make those three values the same.", "ainglish": "Assignment note GRP-0005: its members are WO-00051, WO-00052 and WO-00053. Allowed deadline slot for WO-00051: A, B, C. Allowed deadline slot for WO-00052: A, B, C. Allowed deadline slot for WO-00053: A, B, C. Maximum uses of each deadline slot in this note: A at most 2; B at most 1; C at most 2. The set GRP-0005 is exactly those three work orders. Give each member of GRP-0005 exactly one deadline slot, same-for-all(GRP-0005).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "the note does not settle it", "yes", "no" ], "answer": "no", "settlement_stratum": "same-for-all:feasibility", "strata": { "form": "same-for-all", "task": "feasibility", "domain": "deadline", "set": "GRP-0005", "members": [ "WO-00051", "WO-00052", "WO-00053" ], "candidate": null, "gold_class": "no" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 2, "B": 1, "C": 2 }, "form": "same-for-all", "task": "feasibility", "domain": "deadline", "feasible_count": 0, "gold": "no" } }, { "id": "choice-r23-050", "english": "Assignment note GRP-0004: its members are SD-00041, SD-00042 and SD-00043. Allowed font family for SD-00041: A, C. Allowed font family for SD-00042: A, B, C. Allowed font family for SD-00043: only A. Maximum uses of each font family in this note: A at most 3; B at most 2; C at most 3. The set GRP-0004 is exactly those three slide decks. Give each member of GRP-0004 exactly one font family, and make those three values the same.", "ainglish": "Assignment note GRP-0004: its members are SD-00041, SD-00042 and SD-00043. Allowed font family for SD-00041: A, C. Allowed font family for SD-00042: A, B, C. Allowed font family for SD-00043: only A. Maximum uses of each font family in this note: A at most 3; B at most 2; C at most 3. The set GRP-0004 is exactly those three slide decks. Give each member of GRP-0004 exactly one font family, same-for-all(GRP-0004).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "the note does not settle it", "yes", "no" ], "answer": "yes", "settlement_stratum": "same-for-all:feasibility", "strata": { "form": "same-for-all", "task": "feasibility", "domain": "font-family", "set": "GRP-0004", "members": [ "SD-00041", "SD-00042", "SD-00043" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "C" ], [ "A", "B", "C" ], [ "A" ] ], "capacities": { "A": 3, "B": 2, "C": 3 }, "form": "same-for-all", "task": "feasibility", "domain": "font-family", "feasible_count": 1, "gold": "yes" } }, { "id": "choice-r23-051", "english": "Assignment note GRP-0002: its members are FL-00021, FL-00022 and FL-00023. Allowed reviewer for FL-00021: only A. Allowed reviewer for FL-00022: A, B, C. Allowed reviewer for FL-00023: A, B. Maximum uses of each reviewer in this note: A at most 3; B at most 1; C at most 2. The set GRP-0002 is exactly those three files. Give each member of GRP-0002 exactly one reviewer, and make those three values the same.", "ainglish": "Assignment note GRP-0002: its members are FL-00021, FL-00022 and FL-00023. Allowed reviewer for FL-00021: only A. Allowed reviewer for FL-00022: A, B, C. Allowed reviewer for FL-00023: A, B. Maximum uses of each reviewer in this note: A at most 3; B at most 1; C at most 2. The set GRP-0002 is exactly those three files. Give each member of GRP-0002 exactly one reviewer, same-for-all(GRP-0002).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "the note does not settle it", "yes", "no" ], "answer": "yes", "settlement_stratum": "same-for-all:feasibility", "strata": { "form": "same-for-all", "task": "feasibility", "domain": "reviewer", "set": "GRP-0002", "members": [ "FL-00021", "FL-00022", "FL-00023" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A" ], [ "A", "B", "C" ], [ "A", "B" ] ], "capacities": { "A": 3, "B": 1, "C": 2 }, "form": "same-for-all", "task": "feasibility", "domain": "reviewer", "feasible_count": 1, "gold": "yes" } }, { "id": "choice-r23-052", "english": "Assignment note GRP-0008: its members are FL-00081, FL-00082 and FL-00083. Allowed reviewer for FL-00081: A, B, C. Allowed reviewer for FL-00082: only B. Allowed reviewer for FL-00083: A, B, C. Maximum uses of each reviewer in this note: A at most 1; B at most 1; C at most 3. The set GRP-0008 is exactly those three files. Give each member of GRP-0008 exactly one reviewer, and make those three values the same.", "ainglish": "Assignment note GRP-0008: its members are FL-00081, FL-00082 and FL-00083. Allowed reviewer for FL-00081: A, B, C. Allowed reviewer for FL-00082: only B. Allowed reviewer for FL-00083: A, B, C. Maximum uses of each reviewer in this note: A at most 1; B at most 1; C at most 3. The set GRP-0008 is exactly those three files. Give each member of GRP-0008 exactly one reviewer, same-for-all(GRP-0008).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "yes", "no", "the note does not settle it" ], "answer": "no", "settlement_stratum": "same-for-all:feasibility", "strata": { "form": "same-for-all", "task": "feasibility", "domain": "reviewer", "set": "GRP-0008", "members": [ "FL-00081", "FL-00082", "FL-00083" ], "candidate": null, "gold_class": "no" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "B" ], [ "A", "B", "C" ] ], "capacities": { "A": 1, "B": 1, "C": 3 }, "form": "same-for-all", "task": "feasibility", "domain": "reviewer", "feasible_count": 0, "gold": "no" } }, { "id": "choice-r23-053", "english": "Assignment note GRP-0007: its members are WO-00071, WO-00072 and WO-00073. Allowed deadline slot for WO-00071: A, B. Allowed deadline slot for WO-00072: B, C. Allowed deadline slot for WO-00073: A, B. Maximum uses of each deadline slot in this note: A at most 1; B at most 2; C at most 2. The set GRP-0007 is exactly those three work orders. Give each member of GRP-0007 exactly one deadline slot, and make those three values the same.", "ainglish": "Assignment note GRP-0007: its members are WO-00071, WO-00072 and WO-00073. Allowed deadline slot for WO-00071: A, B. Allowed deadline slot for WO-00072: B, C. Allowed deadline slot for WO-00073: A, B. Maximum uses of each deadline slot in this note: A at most 1; B at most 2; C at most 2. The set GRP-0007 is exactly those three work orders. Give each member of GRP-0007 exactly one deadline slot, same-for-all(GRP-0007).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "yes", "no", "the note does not settle it" ], "answer": "no", "settlement_stratum": "same-for-all:feasibility", "strata": { "form": "same-for-all", "task": "feasibility", "domain": "deadline", "set": "GRP-0007", "members": [ "WO-00071", "WO-00072", "WO-00073" ], "candidate": null, "gold_class": "no" }, "ledger": { "eligibility": [ [ "A", "B" ], [ "B", "C" ], [ "A", "B" ] ], "capacities": { "A": 1, "B": 2, "C": 2 }, "form": "same-for-all", "task": "feasibility", "domain": "deadline", "feasible_count": 0, "gold": "no" } }, { "id": "choice-r23-054", "english": "Assignment note GRP-0004: its members are FL-00041, FL-00042 and FL-00043. Allowed reviewer for FL-00041: B, C. Allowed reviewer for FL-00042: only B. Allowed reviewer for FL-00043: A, B, C. Maximum uses of each reviewer in this note: A at most 3; B at most 3; C at most 2. The set GRP-0004 is exactly those three files. Give each member of GRP-0004 exactly one reviewer, and make those three values the same.", "ainglish": "Assignment note GRP-0004: its members are FL-00041, FL-00042 and FL-00043. Allowed reviewer for FL-00041: B, C. Allowed reviewer for FL-00042: only B. Allowed reviewer for FL-00043: A, B, C. Maximum uses of each reviewer in this note: A at most 3; B at most 3; C at most 2. The set GRP-0004 is exactly those three files. Give each member of GRP-0004 exactly one reviewer, same-for-all(GRP-0004).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "the note does not settle it", "yes", "no" ], "answer": "yes", "settlement_stratum": "same-for-all:feasibility", "strata": { "form": "same-for-all", "task": "feasibility", "domain": "reviewer", "set": "GRP-0004", "members": [ "FL-00041", "FL-00042", "FL-00043" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "B", "C" ], [ "B" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 2 }, "form": "same-for-all", "task": "feasibility", "domain": "reviewer", "feasible_count": 1, "gold": "yes" } }, { "id": "choice-r23-055", "english": "Assignment note GRP-0008: its members are BR-00081, BR-00082 and BR-00083. Allowed source dataset for BR-00081: only A. Allowed source dataset for BR-00082: only B. Allowed source dataset for BR-00083: only A. Maximum uses of each source dataset in this note: A at most 2; B at most 3; C at most 2. The set GRP-0008 is exactly those three backup runs. Give each member of GRP-0008 exactly one source dataset, and make those three values the same.", "ainglish": "Assignment note GRP-0008: its members are BR-00081, BR-00082 and BR-00083. Allowed source dataset for BR-00081: only A. Allowed source dataset for BR-00082: only B. Allowed source dataset for BR-00083: only A. Maximum uses of each source dataset in this note: A at most 2; B at most 3; C at most 2. The set GRP-0008 is exactly those three backup runs. Give each member of GRP-0008 exactly one source dataset, same-for-all(GRP-0008).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "no", "the note does not settle it", "yes" ], "answer": "no", "settlement_stratum": "same-for-all:feasibility", "strata": { "form": "same-for-all", "task": "feasibility", "domain": "source-dataset", "set": "GRP-0008", "members": [ "BR-00081", "BR-00082", "BR-00083" ], "candidate": null, "gold_class": "no" }, "ledger": { "eligibility": [ [ "A" ], [ "B" ], [ "A" ] ], "capacities": { "A": 2, "B": 3, "C": 2 }, "form": "same-for-all", "task": "feasibility", "domain": "source-dataset", "feasible_count": 0, "gold": "no" } }, { "id": "choice-r23-056", "english": "Assignment note GRP-0001: its members are FL-00011, FL-00012 and FL-00013. Allowed reviewer for FL-00011: A, B, C. Allowed reviewer for FL-00012: only C. Allowed reviewer for FL-00013: A, B, C. Maximum uses of each reviewer in this note: A at most 1; B at most 3; C at most 3. The set GRP-0001 is exactly those three files. Give each member of GRP-0001 exactly one reviewer, and make those three values the same.", "ainglish": "Assignment note GRP-0001: its members are FL-00011, FL-00012 and FL-00013. Allowed reviewer for FL-00011: A, B, C. Allowed reviewer for FL-00012: only C. Allowed reviewer for FL-00013: A, B, C. Maximum uses of each reviewer in this note: A at most 1; B at most 3; C at most 3. The set GRP-0001 is exactly those three files. Give each member of GRP-0001 exactly one reviewer, same-for-all(GRP-0001).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "yes", "no", "the note does not settle it" ], "answer": "yes", "settlement_stratum": "same-for-all:feasibility", "strata": { "form": "same-for-all", "task": "feasibility", "domain": "reviewer", "set": "GRP-0001", "members": [ "FL-00011", "FL-00012", "FL-00013" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 1, "B": 3, "C": 3 }, "form": "same-for-all", "task": "feasibility", "domain": "reviewer", "feasible_count": 1, "gold": "yes" } }, { "id": "choice-r23-057", "english": "Assignment note GRP-0003: its members are WO-00031, WO-00032 and WO-00033. Allowed deadline slot for WO-00031: only C. Allowed deadline slot for WO-00032: A, C. Allowed deadline slot for WO-00033: B, C. Maximum uses of each deadline slot in this note: A at most 1; B at most 2; C at most 3. The set GRP-0003 is exactly those three work orders. Give each member of GRP-0003 exactly one deadline slot, and make those three values the same.", "ainglish": "Assignment note GRP-0003: its members are WO-00031, WO-00032 and WO-00033. Allowed deadline slot for WO-00031: only C. Allowed deadline slot for WO-00032: A, C. Allowed deadline slot for WO-00033: B, C. Maximum uses of each deadline slot in this note: A at most 1; B at most 2; C at most 3. The set GRP-0003 is exactly those three work orders. Give each member of GRP-0003 exactly one deadline slot, same-for-all(GRP-0003).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "the note does not settle it", "yes", "no" ], "answer": "yes", "settlement_stratum": "same-for-all:feasibility", "strata": { "form": "same-for-all", "task": "feasibility", "domain": "deadline", "set": "GRP-0003", "members": [ "WO-00031", "WO-00032", "WO-00033" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "C" ], [ "A", "C" ], [ "B", "C" ] ], "capacities": { "A": 1, "B": 2, "C": 3 }, "form": "same-for-all", "task": "feasibility", "domain": "deadline", "feasible_count": 1, "gold": "yes" } }, { "id": "choice-r23-058", "english": "Assignment note GRP-0006: its members are SD-00061, SD-00062 and SD-00063. Allowed font family for SD-00061: A, B, C. Allowed font family for SD-00062: A, C. Allowed font family for SD-00063: A, B, C. Maximum uses of each font family in this note: A at most 2; B at most 1; C at most 2. The set GRP-0006 is exactly those three slide decks. Give each member of GRP-0006 exactly one font family, and make those three values the same.", "ainglish": "Assignment note GRP-0006: its members are SD-00061, SD-00062 and SD-00063. Allowed font family for SD-00061: A, B, C. Allowed font family for SD-00062: A, C. Allowed font family for SD-00063: A, B, C. Maximum uses of each font family in this note: A at most 2; B at most 1; C at most 2. The set GRP-0006 is exactly those three slide decks. Give each member of GRP-0006 exactly one font family, same-for-all(GRP-0006).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "the note does not settle it", "yes", "no" ], "answer": "no", "settlement_stratum": "same-for-all:feasibility", "strata": { "form": "same-for-all", "task": "feasibility", "domain": "font-family", "set": "GRP-0006", "members": [ "SD-00061", "SD-00062", "SD-00063" ], "candidate": null, "gold_class": "no" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 2, "B": 1, "C": 2 }, "form": "same-for-all", "task": "feasibility", "domain": "font-family", "feasible_count": 0, "gold": "no" } }, { "id": "choice-r23-059", "english": "Assignment note GRP-0008: its members are WO-00081, WO-00082 and WO-00083. Allowed deadline slot for WO-00081: A, B, C. Allowed deadline slot for WO-00082: A, C. Allowed deadline slot for WO-00083: only A. Maximum uses of each deadline slot in this note: A at most 2; B at most 3; C at most 3. The set GRP-0008 is exactly those three work orders. Give each member of GRP-0008 exactly one deadline slot, and make those three values the same.", "ainglish": "Assignment note GRP-0008: its members are WO-00081, WO-00082 and WO-00083. Allowed deadline slot for WO-00081: A, B, C. Allowed deadline slot for WO-00082: A, C. Allowed deadline slot for WO-00083: only A. Maximum uses of each deadline slot in this note: A at most 2; B at most 3; C at most 3. The set GRP-0008 is exactly those three work orders. Give each member of GRP-0008 exactly one deadline slot, same-for-all(GRP-0008).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "no", "the note does not settle it", "yes" ], "answer": "no", "settlement_stratum": "same-for-all:feasibility", "strata": { "form": "same-for-all", "task": "feasibility", "domain": "deadline", "set": "GRP-0008", "members": [ "WO-00081", "WO-00082", "WO-00083" ], "candidate": null, "gold_class": "no" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "C" ], [ "A" ] ], "capacities": { "A": 2, "B": 3, "C": 3 }, "form": "same-for-all", "task": "feasibility", "domain": "deadline", "feasible_count": 0, "gold": "no" } }, { "id": "choice-r23-060", "english": "Assignment note GRP-0001: its members are SD-00011, SD-00012 and SD-00013. Allowed font family for SD-00011: A, C. Allowed font family for SD-00012: A, B, C. Allowed font family for SD-00013: A, B. Maximum uses of each font family in this note: A at most 3; B at most 2; C at most 1. The set GRP-0001 is exactly those three slide decks. Give each member of GRP-0001 exactly one font family, and make those three values the same.", "ainglish": "Assignment note GRP-0001: its members are SD-00011, SD-00012 and SD-00013. Allowed font family for SD-00011: A, C. Allowed font family for SD-00012: A, B, C. Allowed font family for SD-00013: A, B. Maximum uses of each font family in this note: A at most 3; B at most 2; C at most 1. The set GRP-0001 is exactly those three slide decks. Give each member of GRP-0001 exactly one font family, same-for-all(GRP-0001).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "no", "the note does not settle it", "yes" ], "answer": "yes", "settlement_stratum": "same-for-all:feasibility", "strata": { "form": "same-for-all", "task": "feasibility", "domain": "font-family", "set": "GRP-0001", "members": [ "SD-00011", "SD-00012", "SD-00013" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "C" ], [ "A", "B", "C" ], [ "A", "B" ] ], "capacities": { "A": 3, "B": 2, "C": 1 }, "form": "same-for-all", "task": "feasibility", "domain": "font-family", "feasible_count": 1, "gold": "yes" } }, { "id": "choice-r23-061", "english": "Assignment note GRP-0001: its members are BR-00011, BR-00012 and BR-00013. Allowed source dataset for BR-00011: A, B, C. Allowed source dataset for BR-00012: B, C. Allowed source dataset for BR-00013: A, B, C. Maximum uses of each source dataset in this note: A at most 3; B at most 2; C at most 3. The set GRP-0001 is exactly those three backup runs. Give each member of GRP-0001 exactly one source dataset, and make those three values the same.", "ainglish": "Assignment note GRP-0001: its members are BR-00011, BR-00012 and BR-00013. Allowed source dataset for BR-00011: A, B, C. Allowed source dataset for BR-00012: B, C. Allowed source dataset for BR-00013: A, B, C. Maximum uses of each source dataset in this note: A at most 3; B at most 2; C at most 3. The set GRP-0001 is exactly those three backup runs. Give each member of GRP-0001 exactly one source dataset, same-for-all(GRP-0001).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "no", "the note does not settle it", "yes" ], "answer": "yes", "settlement_stratum": "same-for-all:feasibility", "strata": { "form": "same-for-all", "task": "feasibility", "domain": "source-dataset", "set": "GRP-0001", "members": [ "BR-00011", "BR-00012", "BR-00013" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 2, "C": 3 }, "form": "same-for-all", "task": "feasibility", "domain": "source-dataset", "feasible_count": 1, "gold": "yes" } }, { "id": "choice-r23-062", "english": "Assignment note GRP-0003: its members are FL-00031, FL-00032 and FL-00033. Allowed reviewer for FL-00031: A, B, C. Allowed reviewer for FL-00032: only B. Allowed reviewer for FL-00033: A, B, C. Maximum uses of each reviewer in this note: A at most 2; B at most 3; C at most 2. The set GRP-0003 is exactly those three files. Give each member of GRP-0003 exactly one reviewer, and make those three values the same.", "ainglish": "Assignment note GRP-0003: its members are FL-00031, FL-00032 and FL-00033. Allowed reviewer for FL-00031: A, B, C. Allowed reviewer for FL-00032: only B. Allowed reviewer for FL-00033: A, B, C. Maximum uses of each reviewer in this note: A at most 2; B at most 3; C at most 2. The set GRP-0003 is exactly those three files. Give each member of GRP-0003 exactly one reviewer, same-for-all(GRP-0003).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "the note does not settle it", "yes", "no" ], "answer": "yes", "settlement_stratum": "same-for-all:feasibility", "strata": { "form": "same-for-all", "task": "feasibility", "domain": "reviewer", "set": "GRP-0003", "members": [ "FL-00031", "FL-00032", "FL-00033" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "B" ], [ "A", "B", "C" ] ], "capacities": { "A": 2, "B": 3, "C": 2 }, "form": "same-for-all", "task": "feasibility", "domain": "reviewer", "feasible_count": 1, "gold": "yes" } }, { "id": "choice-r23-063", "english": "Assignment note GRP-0005: its members are SD-00051, SD-00052 and SD-00053. Allowed font family for SD-00051: B, C. Allowed font family for SD-00052: only A. Allowed font family for SD-00053: A, C. Maximum uses of each font family in this note: A at most 3; B at most 3; C at most 1. The set GRP-0005 is exactly those three slide decks. Give each member of GRP-0005 exactly one font family, and make those three values the same.", "ainglish": "Assignment note GRP-0005: its members are SD-00051, SD-00052 and SD-00053. Allowed font family for SD-00051: B, C. Allowed font family for SD-00052: only A. Allowed font family for SD-00053: A, C. Maximum uses of each font family in this note: A at most 3; B at most 3; C at most 1. The set GRP-0005 is exactly those three slide decks. Give each member of GRP-0005 exactly one font family, same-for-all(GRP-0005).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "the note does not settle it", "yes", "no" ], "answer": "no", "settlement_stratum": "same-for-all:feasibility", "strata": { "form": "same-for-all", "task": "feasibility", "domain": "font-family", "set": "GRP-0005", "members": [ "SD-00051", "SD-00052", "SD-00053" ], "candidate": null, "gold_class": "no" }, "ledger": { "eligibility": [ [ "B", "C" ], [ "A" ], [ "A", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 1 }, "form": "same-for-all", "task": "feasibility", "domain": "font-family", "feasible_count": 0, "gold": "no" } }, { "id": "choice-r23-064", "english": "Assignment note GRP-0003: its members are BR-00031, BR-00032 and BR-00033. Allowed source dataset for BR-00031: only B. Allowed source dataset for BR-00032: A, B, C. Allowed source dataset for BR-00033: A, B, C. Maximum uses of each source dataset in this note: A at most 3; B at most 3; C at most 3. The set GRP-0003 is exactly those three backup runs. Give each member of GRP-0003 exactly one source dataset, and make those three values the same.", "ainglish": "Assignment note GRP-0003: its members are BR-00031, BR-00032 and BR-00033. Allowed source dataset for BR-00031: only B. Allowed source dataset for BR-00032: A, B, C. Allowed source dataset for BR-00033: A, B, C. Maximum uses of each source dataset in this note: A at most 3; B at most 3; C at most 3. The set GRP-0003 is exactly those three backup runs. Give each member of GRP-0003 exactly one source dataset, same-for-all(GRP-0003).", "question": "Consider every complete plan that satisfies all requirements in the note. Must BR-00031 and BR-00033 be given the same source dataset?", "options": [ "the note does not settle it", "yes", "no", "no complete plan satisfies the note" ], "answer": "yes", "settlement_stratum": "same-for-all:consequence", "strata": { "form": "same-for-all", "task": "consequence", "domain": "source-dataset", "set": "GRP-0003", "members": [ "BR-00031", "BR-00032", "BR-00033" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "B" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "form": "same-for-all", "task": "consequence", "domain": "source-dataset", "feasible_count": 1, "gold": "yes" } }, { "id": "choice-r23-065", "english": "Assignment note GRP-0003: its members are WO-00031, WO-00032 and WO-00033. Allowed deadline slot for WO-00031: A, B, C. Allowed deadline slot for WO-00032: A, C. Allowed deadline slot for WO-00033: A, B. Maximum uses of each deadline slot in this note: A at most 3; B at most 3; C at most 2. The set GRP-0003 is exactly those three work orders. Give each member of GRP-0003 exactly one deadline slot, and make those three values the same.", "ainglish": "Assignment note GRP-0003: its members are WO-00031, WO-00032 and WO-00033. Allowed deadline slot for WO-00031: A, B, C. Allowed deadline slot for WO-00032: A, C. Allowed deadline slot for WO-00033: A, B. Maximum uses of each deadline slot in this note: A at most 3; B at most 3; C at most 2. The set GRP-0003 is exactly those three work orders. Give each member of GRP-0003 exactly one deadline slot, same-for-all(GRP-0003).", "question": "Consider every complete plan that satisfies all requirements in the note. Must WO-00031 and WO-00033 be given the same deadline slot?", "options": [ "no", "no complete plan satisfies the note", "the note does not settle it", "yes" ], "answer": "yes", "settlement_stratum": "same-for-all:consequence", "strata": { "form": "same-for-all", "task": "consequence", "domain": "deadline", "set": "GRP-0003", "members": [ "WO-00031", "WO-00032", "WO-00033" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "C" ], [ "A", "B" ] ], "capacities": { "A": 3, "B": 3, "C": 2 }, "form": "same-for-all", "task": "consequence", "domain": "deadline", "feasible_count": 1, "gold": "yes" } }, { "id": "choice-r23-066", "english": "Assignment note GRP-0007: its members are WO-00071, WO-00072 and WO-00073. Allowed deadline slot for WO-00071: A, B, C. Allowed deadline slot for WO-00072: only B. Allowed deadline slot for WO-00073: A, B, C. Maximum uses of each deadline slot in this note: A at most 1; B at most 1; C at most 2. The set GRP-0007 is exactly those three work orders. Give each member of GRP-0007 exactly one deadline slot, and make those three values the same.", "ainglish": "Assignment note GRP-0007: its members are WO-00071, WO-00072 and WO-00073. Allowed deadline slot for WO-00071: A, B, C. Allowed deadline slot for WO-00072: only B. Allowed deadline slot for WO-00073: A, B, C. Maximum uses of each deadline slot in this note: A at most 1; B at most 1; C at most 2. The set GRP-0007 is exactly those three work orders. Give each member of GRP-0007 exactly one deadline slot, same-for-all(GRP-0007).", "question": "Consider every complete plan that satisfies all requirements in the note. Must WO-00071 and WO-00073 be given the same deadline slot?", "options": [ "no", "no complete plan satisfies the note", "the note does not settle it", "yes" ], "answer": "no complete plan satisfies the note", "settlement_stratum": "same-for-all:consequence", "strata": { "form": "same-for-all", "task": "consequence", "domain": "deadline", "set": "GRP-0007", "members": [ "WO-00071", "WO-00072", "WO-00073" ], "candidate": null, "gold_class": "no complete plan satisfies the note" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "B" ], [ "A", "B", "C" ] ], "capacities": { "A": 1, "B": 1, "C": 2 }, "form": "same-for-all", "task": "consequence", "domain": "deadline", "feasible_count": 0, "gold": "no complete plan satisfies the note" } }, { "id": "choice-r23-067", "english": "Assignment note GRP-0005: its members are WO-00051, WO-00052 and WO-00053. Allowed deadline slot for WO-00051: A, B, C. Allowed deadline slot for WO-00052: B, C. Allowed deadline slot for WO-00053: only A. Maximum uses of each deadline slot in this note: A at most 2; B at most 2; C at most 1. The set GRP-0005 is exactly those three work orders. Give each member of GRP-0005 exactly one deadline slot, and make those three values the same.", "ainglish": "Assignment note GRP-0005: its members are WO-00051, WO-00052 and WO-00053. Allowed deadline slot for WO-00051: A, B, C. Allowed deadline slot for WO-00052: B, C. Allowed deadline slot for WO-00053: only A. Maximum uses of each deadline slot in this note: A at most 2; B at most 2; C at most 1. The set GRP-0005 is exactly those three work orders. Give each member of GRP-0005 exactly one deadline slot, same-for-all(GRP-0005).", "question": "Consider every complete plan that satisfies all requirements in the note. Must WO-00051 and WO-00053 be given the same deadline slot?", "options": [ "the note does not settle it", "yes", "no", "no complete plan satisfies the note" ], "answer": "no complete plan satisfies the note", "settlement_stratum": "same-for-all:consequence", "strata": { "form": "same-for-all", "task": "consequence", "domain": "deadline", "set": "GRP-0005", "members": [ "WO-00051", "WO-00052", "WO-00053" ], "candidate": null, "gold_class": "no complete plan satisfies the note" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "B", "C" ], [ "A" ] ], "capacities": { "A": 2, "B": 2, "C": 1 }, "form": "same-for-all", "task": "consequence", "domain": "deadline", "feasible_count": 0, "gold": "no complete plan satisfies the note" } }, { "id": "choice-r23-068", "english": "Assignment note GRP-0004: its members are BR-00041, BR-00042 and BR-00043. Allowed source dataset for BR-00041: A, B, C. Allowed source dataset for BR-00042: A, B, C. Allowed source dataset for BR-00043: A, B. Maximum uses of each source dataset in this note: A at most 3; B at most 3; C at most 1. The set GRP-0004 is exactly those three backup runs. Give each member of GRP-0004 exactly one source dataset, and make those three values the same.", "ainglish": "Assignment note GRP-0004: its members are BR-00041, BR-00042 and BR-00043. Allowed source dataset for BR-00041: A, B, C. Allowed source dataset for BR-00042: A, B, C. Allowed source dataset for BR-00043: A, B. Maximum uses of each source dataset in this note: A at most 3; B at most 3; C at most 1. The set GRP-0004 is exactly those three backup runs. Give each member of GRP-0004 exactly one source dataset, same-for-all(GRP-0004).", "question": "Consider every complete plan that satisfies all requirements in the note. Must BR-00041 and BR-00043 be given the same source dataset?", "options": [ "yes", "no", "no complete plan satisfies the note", "the note does not settle it" ], "answer": "yes", "settlement_stratum": "same-for-all:consequence", "strata": { "form": "same-for-all", "task": "consequence", "domain": "source-dataset", "set": "GRP-0004", "members": [ "BR-00041", "BR-00042", "BR-00043" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B" ] ], "capacities": { "A": 3, "B": 3, "C": 1 }, "form": "same-for-all", "task": "consequence", "domain": "source-dataset", "feasible_count": 2, "gold": "yes" } }, { "id": "choice-r23-069", "english": "Assignment note GRP-0003: its members are FL-00031, FL-00032 and FL-00033. Allowed reviewer for FL-00031: A, B, C. Allowed reviewer for FL-00032: only C. Allowed reviewer for FL-00033: A, B, C. Maximum uses of each reviewer in this note: A at most 3; B at most 2; C at most 3. The set GRP-0003 is exactly those three files. Give each member of GRP-0003 exactly one reviewer, and make those three values the same.", "ainglish": "Assignment note GRP-0003: its members are FL-00031, FL-00032 and FL-00033. Allowed reviewer for FL-00031: A, B, C. Allowed reviewer for FL-00032: only C. Allowed reviewer for FL-00033: A, B, C. Maximum uses of each reviewer in this note: A at most 3; B at most 2; C at most 3. The set GRP-0003 is exactly those three files. Give each member of GRP-0003 exactly one reviewer, same-for-all(GRP-0003).", "question": "Consider every complete plan that satisfies all requirements in the note. Must FL-00031 and FL-00033 be given the same reviewer?", "options": [ "the note does not settle it", "yes", "no", "no complete plan satisfies the note" ], "answer": "yes", "settlement_stratum": "same-for-all:consequence", "strata": { "form": "same-for-all", "task": "consequence", "domain": "reviewer", "set": "GRP-0003", "members": [ "FL-00031", "FL-00032", "FL-00033" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 2, "C": 3 }, "form": "same-for-all", "task": "consequence", "domain": "reviewer", "feasible_count": 1, "gold": "yes" } }, { "id": "choice-r23-070", "english": "Assignment note GRP-0007: its members are SD-00071, SD-00072 and SD-00073. Allowed font family for SD-00071: A, B, C. Allowed font family for SD-00072: A, B. Allowed font family for SD-00073: B, C. Maximum uses of each font family in this note: A at most 1; B at most 1; C at most 1. The set GRP-0007 is exactly those three slide decks. Give each member of GRP-0007 exactly one font family, and make those three values the same.", "ainglish": "Assignment note GRP-0007: its members are SD-00071, SD-00072 and SD-00073. Allowed font family for SD-00071: A, B, C. Allowed font family for SD-00072: A, B. Allowed font family for SD-00073: B, C. Maximum uses of each font family in this note: A at most 1; B at most 1; C at most 1. The set GRP-0007 is exactly those three slide decks. Give each member of GRP-0007 exactly one font family, same-for-all(GRP-0007).", "question": "Consider every complete plan that satisfies all requirements in the note. Must SD-00071 and SD-00073 be given the same font family?", "options": [ "no complete plan satisfies the note", "the note does not settle it", "yes", "no" ], "answer": "no complete plan satisfies the note", "settlement_stratum": "same-for-all:consequence", "strata": { "form": "same-for-all", "task": "consequence", "domain": "font-family", "set": "GRP-0007", "members": [ "SD-00071", "SD-00072", "SD-00073" ], "candidate": null, "gold_class": "no complete plan satisfies the note" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B" ], [ "B", "C" ] ], "capacities": { "A": 1, "B": 1, "C": 1 }, "form": "same-for-all", "task": "consequence", "domain": "font-family", "feasible_count": 0, "gold": "no complete plan satisfies the note" } }, { "id": "choice-r23-071", "english": "Assignment note GRP-0008: its members are FL-00081, FL-00082 and FL-00083. Allowed reviewer for FL-00081: A, B, C. Allowed reviewer for FL-00082: only A. Allowed reviewer for FL-00083: B, C. Maximum uses of each reviewer in this note: A at most 3; B at most 2; C at most 1. The set GRP-0008 is exactly those three files. Give each member of GRP-0008 exactly one reviewer, and make those three values the same.", "ainglish": "Assignment note GRP-0008: its members are FL-00081, FL-00082 and FL-00083. Allowed reviewer for FL-00081: A, B, C. Allowed reviewer for FL-00082: only A. Allowed reviewer for FL-00083: B, C. Maximum uses of each reviewer in this note: A at most 3; B at most 2; C at most 1. The set GRP-0008 is exactly those three files. Give each member of GRP-0008 exactly one reviewer, same-for-all(GRP-0008).", "question": "Consider every complete plan that satisfies all requirements in the note. Must FL-00081 and FL-00083 be given the same reviewer?", "options": [ "yes", "no", "no complete plan satisfies the note", "the note does not settle it" ], "answer": "no complete plan satisfies the note", "settlement_stratum": "same-for-all:consequence", "strata": { "form": "same-for-all", "task": "consequence", "domain": "reviewer", "set": "GRP-0008", "members": [ "FL-00081", "FL-00082", "FL-00083" ], "candidate": null, "gold_class": "no complete plan satisfies the note" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A" ], [ "B", "C" ] ], "capacities": { "A": 3, "B": 2, "C": 1 }, "form": "same-for-all", "task": "consequence", "domain": "reviewer", "feasible_count": 0, "gold": "no complete plan satisfies the note" } }, { "id": "choice-r23-072", "english": "Assignment note GRP-0006: its members are BR-00061, BR-00062 and BR-00063. Allowed source dataset for BR-00061: A, C. Allowed source dataset for BR-00062: A, B. Allowed source dataset for BR-00063: only A. Maximum uses of each source dataset in this note: A at most 1; B at most 2; C at most 3. The set GRP-0006 is exactly those three backup runs. Give each member of GRP-0006 exactly one source dataset, and make those three values the same.", "ainglish": "Assignment note GRP-0006: its members are BR-00061, BR-00062 and BR-00063. Allowed source dataset for BR-00061: A, C. Allowed source dataset for BR-00062: A, B. Allowed source dataset for BR-00063: only A. Maximum uses of each source dataset in this note: A at most 1; B at most 2; C at most 3. The set GRP-0006 is exactly those three backup runs. Give each member of GRP-0006 exactly one source dataset, same-for-all(GRP-0006).", "question": "Consider every complete plan that satisfies all requirements in the note. Must BR-00061 and BR-00063 be given the same source dataset?", "options": [ "the note does not settle it", "yes", "no", "no complete plan satisfies the note" ], "answer": "no complete plan satisfies the note", "settlement_stratum": "same-for-all:consequence", "strata": { "form": "same-for-all", "task": "consequence", "domain": "source-dataset", "set": "GRP-0006", "members": [ "BR-00061", "BR-00062", "BR-00063" ], "candidate": null, "gold_class": "no complete plan satisfies the note" }, "ledger": { "eligibility": [ [ "A", "C" ], [ "A", "B" ], [ "A" ] ], "capacities": { "A": 1, "B": 2, "C": 3 }, "form": "same-for-all", "task": "consequence", "domain": "source-dataset", "feasible_count": 0, "gold": "no complete plan satisfies the note" } }, { "id": "choice-r23-073", "english": "Assignment note GRP-0004: its members are FL-00041, FL-00042 and FL-00043. Allowed reviewer for FL-00041: A, B, C. Allowed reviewer for FL-00042: A, B, C. Allowed reviewer for FL-00043: A, C. Maximum uses of each reviewer in this note: A at most 1; B at most 3; C at most 3. The set GRP-0004 is exactly those three files. Give each member of GRP-0004 exactly one reviewer, and make those three values the same.", "ainglish": "Assignment note GRP-0004: its members are FL-00041, FL-00042 and FL-00043. Allowed reviewer for FL-00041: A, B, C. Allowed reviewer for FL-00042: A, B, C. Allowed reviewer for FL-00043: A, C. Maximum uses of each reviewer in this note: A at most 1; B at most 3; C at most 3. The set GRP-0004 is exactly those three files. Give each member of GRP-0004 exactly one reviewer, same-for-all(GRP-0004).", "question": "Consider every complete plan that satisfies all requirements in the note. Must FL-00041 and FL-00043 be given the same reviewer?", "options": [ "no", "no complete plan satisfies the note", "the note does not settle it", "yes" ], "answer": "yes", "settlement_stratum": "same-for-all:consequence", "strata": { "form": "same-for-all", "task": "consequence", "domain": "reviewer", "set": "GRP-0004", "members": [ "FL-00041", "FL-00042", "FL-00043" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "C" ] ], "capacities": { "A": 1, "B": 3, "C": 3 }, "form": "same-for-all", "task": "consequence", "domain": "reviewer", "feasible_count": 1, "gold": "yes" } }, { "id": "choice-r23-074", "english": "Assignment note GRP-0007: its members are FL-00071, FL-00072 and FL-00073. Allowed reviewer for FL-00071: B, C. Allowed reviewer for FL-00072: B, C. Allowed reviewer for FL-00073: A, B, C. Maximum uses of each reviewer in this note: A at most 2; B at most 2; C at most 1. The set GRP-0007 is exactly those three files. Give each member of GRP-0007 exactly one reviewer, and make those three values the same.", "ainglish": "Assignment note GRP-0007: its members are FL-00071, FL-00072 and FL-00073. Allowed reviewer for FL-00071: B, C. Allowed reviewer for FL-00072: B, C. Allowed reviewer for FL-00073: A, B, C. Maximum uses of each reviewer in this note: A at most 2; B at most 2; C at most 1. The set GRP-0007 is exactly those three files. Give each member of GRP-0007 exactly one reviewer, same-for-all(GRP-0007).", "question": "Consider every complete plan that satisfies all requirements in the note. Must FL-00071 and FL-00073 be given the same reviewer?", "options": [ "no", "no complete plan satisfies the note", "the note does not settle it", "yes" ], "answer": "no complete plan satisfies the note", "settlement_stratum": "same-for-all:consequence", "strata": { "form": "same-for-all", "task": "consequence", "domain": "reviewer", "set": "GRP-0007", "members": [ "FL-00071", "FL-00072", "FL-00073" ], "candidate": null, "gold_class": "no complete plan satisfies the note" }, "ledger": { "eligibility": [ [ "B", "C" ], [ "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 2, "B": 2, "C": 1 }, "form": "same-for-all", "task": "consequence", "domain": "reviewer", "feasible_count": 0, "gold": "no complete plan satisfies the note" } }, { "id": "choice-r23-075", "english": "Assignment note GRP-0001: its members are SD-00011, SD-00012 and SD-00013. Allowed font family for SD-00011: A, B, C. Allowed font family for SD-00012: A, C. Allowed font family for SD-00013: A, B, C. Maximum uses of each font family in this note: A at most 1; B at most 1; C at most 3. The set GRP-0001 is exactly those three slide decks. Give each member of GRP-0001 exactly one font family, and make those three values the same.", "ainglish": "Assignment note GRP-0001: its members are SD-00011, SD-00012 and SD-00013. Allowed font family for SD-00011: A, B, C. Allowed font family for SD-00012: A, C. Allowed font family for SD-00013: A, B, C. Maximum uses of each font family in this note: A at most 1; B at most 1; C at most 3. The set GRP-0001 is exactly those three slide decks. Give each member of GRP-0001 exactly one font family, same-for-all(GRP-0001).", "question": "Consider every complete plan that satisfies all requirements in the note. Must SD-00011 and SD-00013 be given the same font family?", "options": [ "no", "no complete plan satisfies the note", "the note does not settle it", "yes" ], "answer": "yes", "settlement_stratum": "same-for-all:consequence", "strata": { "form": "same-for-all", "task": "consequence", "domain": "font-family", "set": "GRP-0001", "members": [ "SD-00011", "SD-00012", "SD-00013" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 1, "B": 1, "C": 3 }, "form": "same-for-all", "task": "consequence", "domain": "font-family", "feasible_count": 1, "gold": "yes" } }, { "id": "choice-r23-076", "english": "Assignment note GRP-0006: its members are FL-00061, FL-00062 and FL-00063. Allowed reviewer for FL-00061: A, C. Allowed reviewer for FL-00062: B, C. Allowed reviewer for FL-00063: only A. Maximum uses of each reviewer in this note: A at most 1; B at most 2; C at most 1. The set GRP-0006 is exactly those three files. Give each member of GRP-0006 exactly one reviewer, and make those three values the same.", "ainglish": "Assignment note GRP-0006: its members are FL-00061, FL-00062 and FL-00063. Allowed reviewer for FL-00061: A, C. Allowed reviewer for FL-00062: B, C. Allowed reviewer for FL-00063: only A. Maximum uses of each reviewer in this note: A at most 1; B at most 2; C at most 1. The set GRP-0006 is exactly those three files. Give each member of GRP-0006 exactly one reviewer, same-for-all(GRP-0006).", "question": "Consider every complete plan that satisfies all requirements in the note. Must FL-00061 and FL-00063 be given the same reviewer?", "options": [ "no", "no complete plan satisfies the note", "the note does not settle it", "yes" ], "answer": "no complete plan satisfies the note", "settlement_stratum": "same-for-all:consequence", "strata": { "form": "same-for-all", "task": "consequence", "domain": "reviewer", "set": "GRP-0006", "members": [ "FL-00061", "FL-00062", "FL-00063" ], "candidate": null, "gold_class": "no complete plan satisfies the note" }, "ledger": { "eligibility": [ [ "A", "C" ], [ "B", "C" ], [ "A" ] ], "capacities": { "A": 1, "B": 2, "C": 1 }, "form": "same-for-all", "task": "consequence", "domain": "reviewer", "feasible_count": 0, "gold": "no complete plan satisfies the note" } }, { "id": "choice-r23-077", "english": "Assignment note GRP-0001: its members are BR-00011, BR-00012 and BR-00013. Allowed source dataset for BR-00011: A, B, C. Allowed source dataset for BR-00012: A, B, C. Allowed source dataset for BR-00013: A, B, C. Maximum uses of each source dataset in this note: A at most 1; B at most 1; C at most 3. The set GRP-0001 is exactly those three backup runs. Give each member of GRP-0001 exactly one source dataset, and make those three values the same.", "ainglish": "Assignment note GRP-0001: its members are BR-00011, BR-00012 and BR-00013. Allowed source dataset for BR-00011: A, B, C. Allowed source dataset for BR-00012: A, B, C. Allowed source dataset for BR-00013: A, B, C. Maximum uses of each source dataset in this note: A at most 1; B at most 1; C at most 3. The set GRP-0001 is exactly those three backup runs. Give each member of GRP-0001 exactly one source dataset, same-for-all(GRP-0001).", "question": "Consider every complete plan that satisfies all requirements in the note. Must BR-00011 and BR-00013 be given the same source dataset?", "options": [ "no complete plan satisfies the note", "the note does not settle it", "yes", "no" ], "answer": "yes", "settlement_stratum": "same-for-all:consequence", "strata": { "form": "same-for-all", "task": "consequence", "domain": "source-dataset", "set": "GRP-0001", "members": [ "BR-00011", "BR-00012", "BR-00013" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 1, "B": 1, "C": 3 }, "form": "same-for-all", "task": "consequence", "domain": "source-dataset", "feasible_count": 1, "gold": "yes" } }, { "id": "choice-r23-078", "english": "Assignment note GRP-0007: its members are BR-00071, BR-00072 and BR-00073. Allowed source dataset for BR-00071: A, B. Allowed source dataset for BR-00072: A, C. Allowed source dataset for BR-00073: A, B, C. Maximum uses of each source dataset in this note: A at most 1; B at most 1; C at most 3. The set GRP-0007 is exactly those three backup runs. Give each member of GRP-0007 exactly one source dataset, and make those three values the same.", "ainglish": "Assignment note GRP-0007: its members are BR-00071, BR-00072 and BR-00073. Allowed source dataset for BR-00071: A, B. Allowed source dataset for BR-00072: A, C. Allowed source dataset for BR-00073: A, B, C. Maximum uses of each source dataset in this note: A at most 1; B at most 1; C at most 3. The set GRP-0007 is exactly those three backup runs. Give each member of GRP-0007 exactly one source dataset, same-for-all(GRP-0007).", "question": "Consider every complete plan that satisfies all requirements in the note. Must BR-00071 and BR-00073 be given the same source dataset?", "options": [ "no complete plan satisfies the note", "the note does not settle it", "yes", "no" ], "answer": "no complete plan satisfies the note", "settlement_stratum": "same-for-all:consequence", "strata": { "form": "same-for-all", "task": "consequence", "domain": "source-dataset", "set": "GRP-0007", "members": [ "BR-00071", "BR-00072", "BR-00073" ], "candidate": null, "gold_class": "no complete plan satisfies the note" }, "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 1, "B": 1, "C": 3 }, "form": "same-for-all", "task": "consequence", "domain": "source-dataset", "feasible_count": 0, "gold": "no complete plan satisfies the note" } }, { "id": "choice-r23-079", "english": "Assignment note GRP-0001: its members are WO-00011, WO-00012 and WO-00013. Allowed deadline slot for WO-00011: B, C. Allowed deadline slot for WO-00012: B, C. Allowed deadline slot for WO-00013: A, B, C. Maximum uses of each deadline slot in this note: A at most 2; B at most 3; C at most 2. The set GRP-0001 is exactly those three work orders. Give each member of GRP-0001 exactly one deadline slot, and make those three values the same.", "ainglish": "Assignment note GRP-0001: its members are WO-00011, WO-00012 and WO-00013. Allowed deadline slot for WO-00011: B, C. Allowed deadline slot for WO-00012: B, C. Allowed deadline slot for WO-00013: A, B, C. Maximum uses of each deadline slot in this note: A at most 2; B at most 3; C at most 2. The set GRP-0001 is exactly those three work orders. Give each member of GRP-0001 exactly one deadline slot, same-for-all(GRP-0001).", "question": "Consider every complete plan that satisfies all requirements in the note. Must WO-00011 and WO-00013 be given the same deadline slot?", "options": [ "the note does not settle it", "yes", "no", "no complete plan satisfies the note" ], "answer": "yes", "settlement_stratum": "same-for-all:consequence", "strata": { "form": "same-for-all", "task": "consequence", "domain": "deadline", "set": "GRP-0001", "members": [ "WO-00011", "WO-00012", "WO-00013" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "B", "C" ], [ "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 2, "B": 3, "C": 2 }, "form": "same-for-all", "task": "consequence", "domain": "deadline", "feasible_count": 1, "gold": "yes" } }, { "id": "choice-r23-080", "english": "Assignment note GRP-0003: its members are SD-00031, SD-00032 and SD-00033. Allowed font family for SD-00031: A, B, C. Allowed font family for SD-00032: A, B, C. Allowed font family for SD-00033: only B. Maximum uses of each font family in this note: A at most 3; B at most 3; C at most 3. The set GRP-0003 is exactly those three slide decks. Give each member of GRP-0003 exactly one font family, and make those three values the same.", "ainglish": "Assignment note GRP-0003: its members are SD-00031, SD-00032 and SD-00033. Allowed font family for SD-00031: A, B, C. Allowed font family for SD-00032: A, B, C. Allowed font family for SD-00033: only B. Maximum uses of each font family in this note: A at most 3; B at most 3; C at most 3. The set GRP-0003 is exactly those three slide decks. Give each member of GRP-0003 exactly one font family, same-for-all(GRP-0003).", "question": "Consider every complete plan that satisfies all requirements in the note. Must SD-00031 and SD-00033 be given the same font family?", "options": [ "no complete plan satisfies the note", "the note does not settle it", "yes", "no" ], "answer": "yes", "settlement_stratum": "same-for-all:consequence", "strata": { "form": "same-for-all", "task": "consequence", "domain": "font-family", "set": "GRP-0003", "members": [ "SD-00031", "SD-00032", "SD-00033" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "B" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "form": "same-for-all", "task": "consequence", "domain": "font-family", "feasible_count": 1, "gold": "yes" } }, { "id": "choice-r23-081", "english": "Assignment note GRP-0008: its members are SD-00081, SD-00082 and SD-00083. Allowed font family for SD-00081: A, B. Allowed font family for SD-00082: only B. Allowed font family for SD-00083: only C. Maximum uses of each font family in this note: A at most 2; B at most 2; C at most 1. The set GRP-0008 is exactly those three slide decks. Give each member of GRP-0008 exactly one font family, and make those three values the same.", "ainglish": "Assignment note GRP-0008: its members are SD-00081, SD-00082 and SD-00083. Allowed font family for SD-00081: A, B. Allowed font family for SD-00082: only B. Allowed font family for SD-00083: only C. Maximum uses of each font family in this note: A at most 2; B at most 2; C at most 1. The set GRP-0008 is exactly those three slide decks. Give each member of GRP-0008 exactly one font family, same-for-all(GRP-0008).", "question": "Consider every complete plan that satisfies all requirements in the note. Must SD-00081 and SD-00083 be given the same font family?", "options": [ "no", "no complete plan satisfies the note", "the note does not settle it", "yes" ], "answer": "no complete plan satisfies the note", "settlement_stratum": "same-for-all:consequence", "strata": { "form": "same-for-all", "task": "consequence", "domain": "font-family", "set": "GRP-0008", "members": [ "SD-00081", "SD-00082", "SD-00083" ], "candidate": null, "gold_class": "no complete plan satisfies the note" }, "ledger": { "eligibility": [ [ "A", "B" ], [ "B" ], [ "C" ] ], "capacities": { "A": 2, "B": 2, "C": 1 }, "form": "same-for-all", "task": "consequence", "domain": "font-family", "feasible_count": 0, "gold": "no complete plan satisfies the note" } }, { "id": "choice-r23-082", "english": "Assignment note GRP-0006: its members are SD-00061, SD-00062 and SD-00063. Allowed font family for SD-00061: A, C. Allowed font family for SD-00062: only C. Allowed font family for SD-00063: only B. Maximum uses of each font family in this note: A at most 1; B at most 2; C at most 1. The set GRP-0006 is exactly those three slide decks. Give each member of GRP-0006 exactly one font family, and make those three values the same.", "ainglish": "Assignment note GRP-0006: its members are SD-00061, SD-00062 and SD-00063. Allowed font family for SD-00061: A, C. Allowed font family for SD-00062: only C. Allowed font family for SD-00063: only B. Maximum uses of each font family in this note: A at most 1; B at most 2; C at most 1. The set GRP-0006 is exactly those three slide decks. Give each member of GRP-0006 exactly one font family, same-for-all(GRP-0006).", "question": "Consider every complete plan that satisfies all requirements in the note. Must SD-00061 and SD-00063 be given the same font family?", "options": [ "no complete plan satisfies the note", "the note does not settle it", "yes", "no" ], "answer": "no complete plan satisfies the note", "settlement_stratum": "same-for-all:consequence", "strata": { "form": "same-for-all", "task": "consequence", "domain": "font-family", "set": "GRP-0006", "members": [ "SD-00061", "SD-00062", "SD-00063" ], "candidate": null, "gold_class": "no complete plan satisfies the note" }, "ledger": { "eligibility": [ [ "A", "C" ], [ "C" ], [ "B" ] ], "capacities": { "A": 1, "B": 2, "C": 1 }, "form": "same-for-all", "task": "consequence", "domain": "font-family", "feasible_count": 0, "gold": "no complete plan satisfies the note" } }, { "id": "choice-r23-083", "english": "Assignment note GRP-0002: its members are BR-00021, BR-00022 and BR-00023. Allowed source dataset for BR-00021: A, C. Allowed source dataset for BR-00022: B, C. Allowed source dataset for BR-00023: A, C. Maximum uses of each source dataset in this note: A at most 1; B at most 1; C at most 3. The set GRP-0002 is exactly those three backup runs. Give each member of GRP-0002 exactly one source dataset, and make those three values the same.", "ainglish": "Assignment note GRP-0002: its members are BR-00021, BR-00022 and BR-00023. Allowed source dataset for BR-00021: A, C. Allowed source dataset for BR-00022: B, C. Allowed source dataset for BR-00023: A, C. Maximum uses of each source dataset in this note: A at most 1; B at most 1; C at most 3. The set GRP-0002 is exactly those three backup runs. Give each member of GRP-0002 exactly one source dataset, same-for-all(GRP-0002).", "question": "Consider every complete plan that satisfies all requirements in the note. Must BR-00021 and BR-00023 be given the same source dataset?", "options": [ "the note does not settle it", "yes", "no", "no complete plan satisfies the note" ], "answer": "yes", "settlement_stratum": "same-for-all:consequence", "strata": { "form": "same-for-all", "task": "consequence", "domain": "source-dataset", "set": "GRP-0002", "members": [ "BR-00021", "BR-00022", "BR-00023" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "C" ], [ "B", "C" ], [ "A", "C" ] ], "capacities": { "A": 1, "B": 1, "C": 3 }, "form": "same-for-all", "task": "consequence", "domain": "source-dataset", "feasible_count": 1, "gold": "yes" } }, { "id": "choice-r23-084", "english": "Assignment note GRP-0001: its members are FL-00011, FL-00012 and FL-00013. Allowed reviewer for FL-00011: A, C. Allowed reviewer for FL-00012: A, B, C. Allowed reviewer for FL-00013: A, B. Maximum uses of each reviewer in this note: A at most 3; B at most 1; C at most 2. The set GRP-0001 is exactly those three files. Give each member of GRP-0001 exactly one reviewer, and make those three values the same.", "ainglish": "Assignment note GRP-0001: its members are FL-00011, FL-00012 and FL-00013. Allowed reviewer for FL-00011: A, C. Allowed reviewer for FL-00012: A, B, C. Allowed reviewer for FL-00013: A, B. Maximum uses of each reviewer in this note: A at most 3; B at most 1; C at most 2. The set GRP-0001 is exactly those three files. Give each member of GRP-0001 exactly one reviewer, same-for-all(GRP-0001).", "question": "Consider every complete plan that satisfies all requirements in the note. Must FL-00011 and FL-00013 be given the same reviewer?", "options": [ "no", "no complete plan satisfies the note", "the note does not settle it", "yes" ], "answer": "yes", "settlement_stratum": "same-for-all:consequence", "strata": { "form": "same-for-all", "task": "consequence", "domain": "reviewer", "set": "GRP-0001", "members": [ "FL-00011", "FL-00012", "FL-00013" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "C" ], [ "A", "B", "C" ], [ "A", "B" ] ], "capacities": { "A": 3, "B": 1, "C": 2 }, "form": "same-for-all", "task": "consequence", "domain": "reviewer", "feasible_count": 1, "gold": "yes" } }, { "id": "choice-r23-085", "english": "Assignment note GRP-0002: its members are WO-00021, WO-00022 and WO-00023. Allowed deadline slot for WO-00021: A, B, C. Allowed deadline slot for WO-00022: A, B, C. Allowed deadline slot for WO-00023: A, B, C. Maximum uses of each deadline slot in this note: A at most 3; B at most 3; C at most 1. The set GRP-0002 is exactly those three work orders. Give each member of GRP-0002 exactly one deadline slot, and make those three values the same.", "ainglish": "Assignment note GRP-0002: its members are WO-00021, WO-00022 and WO-00023. Allowed deadline slot for WO-00021: A, B, C. Allowed deadline slot for WO-00022: A, B, C. Allowed deadline slot for WO-00023: A, B, C. Maximum uses of each deadline slot in this note: A at most 3; B at most 3; C at most 1. The set GRP-0002 is exactly those three work orders. Give each member of GRP-0002 exactly one deadline slot, same-for-all(GRP-0002).", "question": "Consider every complete plan that satisfies all requirements in the note. Must WO-00021 and WO-00023 be given the same deadline slot?", "options": [ "no", "no complete plan satisfies the note", "the note does not settle it", "yes" ], "answer": "yes", "settlement_stratum": "same-for-all:consequence", "strata": { "form": "same-for-all", "task": "consequence", "domain": "deadline", "set": "GRP-0002", "members": [ "WO-00021", "WO-00022", "WO-00023" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 1 }, "form": "same-for-all", "task": "consequence", "domain": "deadline", "feasible_count": 2, "gold": "yes" } }, { "id": "choice-r23-086", "english": "Assignment note GRP-0002: its members are FL-00021, FL-00022 and FL-00023. Allowed reviewer for FL-00021: only B. Allowed reviewer for FL-00022: B, C. Allowed reviewer for FL-00023: A, B, C. Maximum uses of each reviewer in this note: A at most 1; B at most 3; C at most 2. The set GRP-0002 is exactly those three files. Give each member of GRP-0002 exactly one reviewer, and make those three values the same.", "ainglish": "Assignment note GRP-0002: its members are FL-00021, FL-00022 and FL-00023. Allowed reviewer for FL-00021: only B. Allowed reviewer for FL-00022: B, C. Allowed reviewer for FL-00023: A, B, C. Maximum uses of each reviewer in this note: A at most 1; B at most 3; C at most 2. The set GRP-0002 is exactly those three files. Give each member of GRP-0002 exactly one reviewer, same-for-all(GRP-0002).", "question": "Consider every complete plan that satisfies all requirements in the note. Must FL-00021 and FL-00023 be given the same reviewer?", "options": [ "no complete plan satisfies the note", "the note does not settle it", "yes", "no" ], "answer": "yes", "settlement_stratum": "same-for-all:consequence", "strata": { "form": "same-for-all", "task": "consequence", "domain": "reviewer", "set": "GRP-0002", "members": [ "FL-00021", "FL-00022", "FL-00023" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "B" ], [ "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 1, "B": 3, "C": 2 }, "form": "same-for-all", "task": "consequence", "domain": "reviewer", "feasible_count": 1, "gold": "yes" } }, { "id": "choice-r23-087", "english": "Assignment note GRP-0008: its members are BR-00081, BR-00082 and BR-00083. Allowed source dataset for BR-00081: B, C. Allowed source dataset for BR-00082: A, C. Allowed source dataset for BR-00083: only B. Maximum uses of each source dataset in this note: A at most 1; B at most 2; C at most 2. The set GRP-0008 is exactly those three backup runs. Give each member of GRP-0008 exactly one source dataset, and make those three values the same.", "ainglish": "Assignment note GRP-0008: its members are BR-00081, BR-00082 and BR-00083. Allowed source dataset for BR-00081: B, C. Allowed source dataset for BR-00082: A, C. Allowed source dataset for BR-00083: only B. Maximum uses of each source dataset in this note: A at most 1; B at most 2; C at most 2. The set GRP-0008 is exactly those three backup runs. Give each member of GRP-0008 exactly one source dataset, same-for-all(GRP-0008).", "question": "Consider every complete plan that satisfies all requirements in the note. Must BR-00081 and BR-00083 be given the same source dataset?", "options": [ "the note does not settle it", "yes", "no", "no complete plan satisfies the note" ], "answer": "no complete plan satisfies the note", "settlement_stratum": "same-for-all:consequence", "strata": { "form": "same-for-all", "task": "consequence", "domain": "source-dataset", "set": "GRP-0008", "members": [ "BR-00081", "BR-00082", "BR-00083" ], "candidate": null, "gold_class": "no complete plan satisfies the note" }, "ledger": { "eligibility": [ [ "B", "C" ], [ "A", "C" ], [ "B" ] ], "capacities": { "A": 1, "B": 2, "C": 2 }, "form": "same-for-all", "task": "consequence", "domain": "source-dataset", "feasible_count": 0, "gold": "no complete plan satisfies the note" } }, { "id": "choice-r23-088", "english": "Assignment note GRP-0002: its members are SD-00021, SD-00022 and SD-00023. Allowed font family for SD-00021: A, B, C. Allowed font family for SD-00022: A, B, C. Allowed font family for SD-00023: A, B, C. Maximum uses of each font family in this note: A at most 3; B at most 1; C at most 3. The set GRP-0002 is exactly those three slide decks. Give each member of GRP-0002 exactly one font family, and make those three values the same.", "ainglish": "Assignment note GRP-0002: its members are SD-00021, SD-00022 and SD-00023. Allowed font family for SD-00021: A, B, C. Allowed font family for SD-00022: A, B, C. Allowed font family for SD-00023: A, B, C. Maximum uses of each font family in this note: A at most 3; B at most 1; C at most 3. The set GRP-0002 is exactly those three slide decks. Give each member of GRP-0002 exactly one font family, same-for-all(GRP-0002).", "question": "Consider every complete plan that satisfies all requirements in the note. Must SD-00021 and SD-00023 be given the same font family?", "options": [ "no complete plan satisfies the note", "the note does not settle it", "yes", "no" ], "answer": "yes", "settlement_stratum": "same-for-all:consequence", "strata": { "form": "same-for-all", "task": "consequence", "domain": "font-family", "set": "GRP-0002", "members": [ "SD-00021", "SD-00022", "SD-00023" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 1, "C": 3 }, "form": "same-for-all", "task": "consequence", "domain": "font-family", "feasible_count": 2, "gold": "yes" } }, { "id": "choice-r23-089", "english": "Assignment note GRP-0008: its members are WO-00081, WO-00082 and WO-00083. Allowed deadline slot for WO-00081: only C. Allowed deadline slot for WO-00082: A, B, C. Allowed deadline slot for WO-00083: A, B. Maximum uses of each deadline slot in this note: A at most 3; B at most 1; C at most 1. The set GRP-0008 is exactly those three work orders. Give each member of GRP-0008 exactly one deadline slot, and make those three values the same.", "ainglish": "Assignment note GRP-0008: its members are WO-00081, WO-00082 and WO-00083. Allowed deadline slot for WO-00081: only C. Allowed deadline slot for WO-00082: A, B, C. Allowed deadline slot for WO-00083: A, B. Maximum uses of each deadline slot in this note: A at most 3; B at most 1; C at most 1. The set GRP-0008 is exactly those three work orders. Give each member of GRP-0008 exactly one deadline slot, same-for-all(GRP-0008).", "question": "Consider every complete plan that satisfies all requirements in the note. Must WO-00081 and WO-00083 be given the same deadline slot?", "options": [ "no", "no complete plan satisfies the note", "the note does not settle it", "yes" ], "answer": "no complete plan satisfies the note", "settlement_stratum": "same-for-all:consequence", "strata": { "form": "same-for-all", "task": "consequence", "domain": "deadline", "set": "GRP-0008", "members": [ "WO-00081", "WO-00082", "WO-00083" ], "candidate": null, "gold_class": "no complete plan satisfies the note" }, "ledger": { "eligibility": [ [ "C" ], [ "A", "B", "C" ], [ "A", "B" ] ], "capacities": { "A": 3, "B": 1, "C": 1 }, "form": "same-for-all", "task": "consequence", "domain": "deadline", "feasible_count": 0, "gold": "no complete plan satisfies the note" } }, { "id": "choice-r23-090", "english": "Assignment note GRP-0006: its members are WO-00061, WO-00062 and WO-00063. Allowed deadline slot for WO-00061: only C. Allowed deadline slot for WO-00062: only B. Allowed deadline slot for WO-00063: only A. Maximum uses of each deadline slot in this note: A at most 3; B at most 1; C at most 3. The set GRP-0006 is exactly those three work orders. Give each member of GRP-0006 exactly one deadline slot, and make those three values the same.", "ainglish": "Assignment note GRP-0006: its members are WO-00061, WO-00062 and WO-00063. Allowed deadline slot for WO-00061: only C. Allowed deadline slot for WO-00062: only B. Allowed deadline slot for WO-00063: only A. Maximum uses of each deadline slot in this note: A at most 3; B at most 1; C at most 3. The set GRP-0006 is exactly those three work orders. Give each member of GRP-0006 exactly one deadline slot, same-for-all(GRP-0006).", "question": "Consider every complete plan that satisfies all requirements in the note. Must WO-00061 and WO-00063 be given the same deadline slot?", "options": [ "no", "no complete plan satisfies the note", "the note does not settle it", "yes" ], "answer": "no complete plan satisfies the note", "settlement_stratum": "same-for-all:consequence", "strata": { "form": "same-for-all", "task": "consequence", "domain": "deadline", "set": "GRP-0006", "members": [ "WO-00061", "WO-00062", "WO-00063" ], "candidate": null, "gold_class": "no complete plan satisfies the note" }, "ledger": { "eligibility": [ [ "C" ], [ "B" ], [ "A" ] ], "capacities": { "A": 3, "B": 1, "C": 3 }, "form": "same-for-all", "task": "consequence", "domain": "deadline", "feasible_count": 0, "gold": "no complete plan satisfies the note" } }, { "id": "choice-r23-091", "english": "Assignment note GRP-0005: its members are SD-00051, SD-00052 and SD-00053. Allowed font family for SD-00051: only A. Allowed font family for SD-00052: A, C. Allowed font family for SD-00053: A, B, C. Maximum uses of each font family in this note: A at most 2; B at most 2; C at most 3. The set GRP-0005 is exactly those three slide decks. Give each member of GRP-0005 exactly one font family, and make those three values the same.", "ainglish": "Assignment note GRP-0005: its members are SD-00051, SD-00052 and SD-00053. Allowed font family for SD-00051: only A. Allowed font family for SD-00052: A, C. Allowed font family for SD-00053: A, B, C. Maximum uses of each font family in this note: A at most 2; B at most 2; C at most 3. The set GRP-0005 is exactly those three slide decks. Give each member of GRP-0005 exactly one font family, same-for-all(GRP-0005).", "question": "Consider every complete plan that satisfies all requirements in the note. Must SD-00051 and SD-00053 be given the same font family?", "options": [ "no complete plan satisfies the note", "the note does not settle it", "yes", "no" ], "answer": "no complete plan satisfies the note", "settlement_stratum": "same-for-all:consequence", "strata": { "form": "same-for-all", "task": "consequence", "domain": "font-family", "set": "GRP-0005", "members": [ "SD-00051", "SD-00052", "SD-00053" ], "candidate": null, "gold_class": "no complete plan satisfies the note" }, "ledger": { "eligibility": [ [ "A" ], [ "A", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 2, "B": 2, "C": 3 }, "form": "same-for-all", "task": "consequence", "domain": "font-family", "feasible_count": 0, "gold": "no complete plan satisfies the note" } }, { "id": "choice-r23-092", "english": "Assignment note GRP-0004: its members are WO-00041, WO-00042 and WO-00043. Allowed deadline slot for WO-00041: only B. Allowed deadline slot for WO-00042: B, C. Allowed deadline slot for WO-00043: A, B, C. Maximum uses of each deadline slot in this note: A at most 3; B at most 3; C at most 3. The set GRP-0004 is exactly those three work orders. Give each member of GRP-0004 exactly one deadline slot, and make those three values the same.", "ainglish": "Assignment note GRP-0004: its members are WO-00041, WO-00042 and WO-00043. Allowed deadline slot for WO-00041: only B. Allowed deadline slot for WO-00042: B, C. Allowed deadline slot for WO-00043: A, B, C. Maximum uses of each deadline slot in this note: A at most 3; B at most 3; C at most 3. The set GRP-0004 is exactly those three work orders. Give each member of GRP-0004 exactly one deadline slot, same-for-all(GRP-0004).", "question": "Consider every complete plan that satisfies all requirements in the note. Must WO-00041 and WO-00043 be given the same deadline slot?", "options": [ "no", "no complete plan satisfies the note", "the note does not settle it", "yes" ], "answer": "yes", "settlement_stratum": "same-for-all:consequence", "strata": { "form": "same-for-all", "task": "consequence", "domain": "deadline", "set": "GRP-0004", "members": [ "WO-00041", "WO-00042", "WO-00043" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "B" ], [ "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "form": "same-for-all", "task": "consequence", "domain": "deadline", "feasible_count": 1, "gold": "yes" } }, { "id": "choice-r23-093", "english": "Assignment note GRP-0005: its members are FL-00051, FL-00052 and FL-00053. Allowed reviewer for FL-00051: only B. Allowed reviewer for FL-00052: A, B. Allowed reviewer for FL-00053: only B. Maximum uses of each reviewer in this note: A at most 1; B at most 2; C at most 1. The set GRP-0005 is exactly those three files. Give each member of GRP-0005 exactly one reviewer, and make those three values the same.", "ainglish": "Assignment note GRP-0005: its members are FL-00051, FL-00052 and FL-00053. Allowed reviewer for FL-00051: only B. Allowed reviewer for FL-00052: A, B. Allowed reviewer for FL-00053: only B. Maximum uses of each reviewer in this note: A at most 1; B at most 2; C at most 1. The set GRP-0005 is exactly those three files. Give each member of GRP-0005 exactly one reviewer, same-for-all(GRP-0005).", "question": "Consider every complete plan that satisfies all requirements in the note. Must FL-00051 and FL-00053 be given the same reviewer?", "options": [ "no complete plan satisfies the note", "the note does not settle it", "yes", "no" ], "answer": "no complete plan satisfies the note", "settlement_stratum": "same-for-all:consequence", "strata": { "form": "same-for-all", "task": "consequence", "domain": "reviewer", "set": "GRP-0005", "members": [ "FL-00051", "FL-00052", "FL-00053" ], "candidate": null, "gold_class": "no complete plan satisfies the note" }, "ledger": { "eligibility": [ [ "B" ], [ "A", "B" ], [ "B" ] ], "capacities": { "A": 1, "B": 2, "C": 1 }, "form": "same-for-all", "task": "consequence", "domain": "reviewer", "feasible_count": 0, "gold": "no complete plan satisfies the note" } }, { "id": "choice-r23-094", "english": "Assignment note GRP-0004: its members are SD-00041, SD-00042 and SD-00043. Allowed font family for SD-00041: A, B, C. Allowed font family for SD-00042: A, B. Allowed font family for SD-00043: A, B, C. Maximum uses of each font family in this note: A at most 1; B at most 3; C at most 2. The set GRP-0004 is exactly those three slide decks. Give each member of GRP-0004 exactly one font family, and make those three values the same.", "ainglish": "Assignment note GRP-0004: its members are SD-00041, SD-00042 and SD-00043. Allowed font family for SD-00041: A, B, C. Allowed font family for SD-00042: A, B. Allowed font family for SD-00043: A, B, C. Maximum uses of each font family in this note: A at most 1; B at most 3; C at most 2. The set GRP-0004 is exactly those three slide decks. Give each member of GRP-0004 exactly one font family, same-for-all(GRP-0004).", "question": "Consider every complete plan that satisfies all requirements in the note. Must SD-00041 and SD-00043 be given the same font family?", "options": [ "the note does not settle it", "yes", "no", "no complete plan satisfies the note" ], "answer": "yes", "settlement_stratum": "same-for-all:consequence", "strata": { "form": "same-for-all", "task": "consequence", "domain": "font-family", "set": "GRP-0004", "members": [ "SD-00041", "SD-00042", "SD-00043" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B" ], [ "A", "B", "C" ] ], "capacities": { "A": 1, "B": 3, "C": 2 }, "form": "same-for-all", "task": "consequence", "domain": "font-family", "feasible_count": 1, "gold": "yes" } }, { "id": "choice-r23-095", "english": "Assignment note GRP-0005: its members are BR-00051, BR-00052 and BR-00053. Allowed source dataset for BR-00051: B, C. Allowed source dataset for BR-00052: A, B, C. Allowed source dataset for BR-00053: A, B, C. Maximum uses of each source dataset in this note: A at most 3; B at most 2; C at most 2. The set GRP-0005 is exactly those three backup runs. Give each member of GRP-0005 exactly one source dataset, and make those three values the same.", "ainglish": "Assignment note GRP-0005: its members are BR-00051, BR-00052 and BR-00053. Allowed source dataset for BR-00051: B, C. Allowed source dataset for BR-00052: A, B, C. Allowed source dataset for BR-00053: A, B, C. Maximum uses of each source dataset in this note: A at most 3; B at most 2; C at most 2. The set GRP-0005 is exactly those three backup runs. Give each member of GRP-0005 exactly one source dataset, same-for-all(GRP-0005).", "question": "Consider every complete plan that satisfies all requirements in the note. Must BR-00051 and BR-00053 be given the same source dataset?", "options": [ "yes", "no", "no complete plan satisfies the note", "the note does not settle it" ], "answer": "no complete plan satisfies the note", "settlement_stratum": "same-for-all:consequence", "strata": { "form": "same-for-all", "task": "consequence", "domain": "source-dataset", "set": "GRP-0005", "members": [ "BR-00051", "BR-00052", "BR-00053" ], "candidate": null, "gold_class": "no complete plan satisfies the note" }, "ledger": { "eligibility": [ [ "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 2, "C": 2 }, "form": "same-for-all", "task": "consequence", "domain": "source-dataset", "feasible_count": 0, "gold": "no complete plan satisfies the note" } }, { "id": "choice-r23-096", "english": "Assignment note GRP-0008: its members are WO-00081, WO-00082 and WO-00083. Allowed deadline slot for WO-00081: only C. Allowed deadline slot for WO-00082: A, B. Allowed deadline slot for WO-00083: only A. Maximum uses of each deadline slot in this note: A at most 3; B at most 2; C at most 2. The set GRP-0008 is exactly those three work orders. Give each member of GRP-0008 exactly one deadline slot; the values may be the same or different.", "ainglish": "Assignment note GRP-0008: its members are WO-00081, WO-00082 and WO-00083. Allowed deadline slot for WO-00081: only C. Allowed deadline slot for WO-00082: A, B. Allowed deadline slot for WO-00083: only A. Maximum uses of each deadline slot in this note: A at most 3; B at most 2; C at most 2. The set GRP-0008 is exactly those three work orders. Give each member of GRP-0008 exactly one deadline slot, may-vary-across(GRP-0008).", "question": "A draft plan gives C to WO-00081, A to WO-00082 and C to WO-00083. Does that draft satisfy every requirement in the note?", "options": [ "yes", "no", "no complete plan satisfies the note", "the note does not settle it" ], "answer": "no", "settlement_stratum": "may-vary-across:admissibility", "strata": { "form": "may-vary-across", "task": "admissibility", "domain": "deadline", "set": "GRP-0008", "members": [ "WO-00081", "WO-00082", "WO-00083" ], "candidate": [ "C", "A", "C" ], "gold_class": "no" }, "ledger": { "eligibility": [ [ "C" ], [ "A", "B" ], [ "A" ] ], "capacities": { "A": 3, "B": 2, "C": 2 }, "form": "may-vary-across", "task": "admissibility", "domain": "deadline", "feasible_count": 2, "candidate": [ "C", "A", "C" ], "gold": "no" } }, { "id": "choice-r23-097", "english": "Assignment note GRP-0005: its members are FL-00051, FL-00052 and FL-00053. Allowed reviewer for FL-00051: A, B, C. Allowed reviewer for FL-00052: only B. Allowed reviewer for FL-00053: only A. Maximum uses of each reviewer in this note: A at most 2; B at most 1; C at most 2. The set GRP-0005 is exactly those three files. Give each member of GRP-0005 exactly one reviewer; the values may be the same or different.", "ainglish": "Assignment note GRP-0005: its members are FL-00051, FL-00052 and FL-00053. Allowed reviewer for FL-00051: A, B, C. Allowed reviewer for FL-00052: only B. Allowed reviewer for FL-00053: only A. Maximum uses of each reviewer in this note: A at most 2; B at most 1; C at most 2. The set GRP-0005 is exactly those three files. Give each member of GRP-0005 exactly one reviewer, may-vary-across(GRP-0005).", "question": "A draft plan gives A to FL-00051, C to FL-00052 and A to FL-00053. Does that draft satisfy every requirement in the note?", "options": [ "no", "no complete plan satisfies the note", "the note does not settle it", "yes" ], "answer": "no", "settlement_stratum": "may-vary-across:admissibility", "strata": { "form": "may-vary-across", "task": "admissibility", "domain": "reviewer", "set": "GRP-0005", "members": [ "FL-00051", "FL-00052", "FL-00053" ], "candidate": [ "A", "C", "A" ], "gold_class": "no" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "B" ], [ "A" ] ], "capacities": { "A": 2, "B": 1, "C": 2 }, "form": "may-vary-across", "task": "admissibility", "domain": "reviewer", "feasible_count": 2, "candidate": [ "A", "C", "A" ], "gold": "no" } }, { "id": "choice-r23-098", "english": "Assignment note GRP-0003: its members are WO-00031, WO-00032 and WO-00033. Allowed deadline slot for WO-00031: B, C. Allowed deadline slot for WO-00032: B, C. Allowed deadline slot for WO-00033: A, B, C. Maximum uses of each deadline slot in this note: A at most 2; B at most 3; C at most 3. The set GRP-0003 is exactly those three work orders. Give each member of GRP-0003 exactly one deadline slot; the values may be the same or different.", "ainglish": "Assignment note GRP-0003: its members are WO-00031, WO-00032 and WO-00033. Allowed deadline slot for WO-00031: B, C. Allowed deadline slot for WO-00032: B, C. Allowed deadline slot for WO-00033: A, B, C. Maximum uses of each deadline slot in this note: A at most 2; B at most 3; C at most 3. The set GRP-0003 is exactly those three work orders. Give each member of GRP-0003 exactly one deadline slot, may-vary-across(GRP-0003).", "question": "A draft plan gives B to WO-00031, C to WO-00032 and A to WO-00033. Does that draft satisfy every requirement in the note?", "options": [ "no complete plan satisfies the note", "the note does not settle it", "yes", "no" ], "answer": "yes", "settlement_stratum": "may-vary-across:admissibility", "strata": { "form": "may-vary-across", "task": "admissibility", "domain": "deadline", "set": "GRP-0003", "members": [ "WO-00031", "WO-00032", "WO-00033" ], "candidate": [ "B", "C", "A" ], "gold_class": "yes" }, "ledger": { "eligibility": [ [ "B", "C" ], [ "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 2, "B": 3, "C": 3 }, "form": "may-vary-across", "task": "admissibility", "domain": "deadline", "feasible_count": 12, "candidate": [ "B", "C", "A" ], "gold": "yes" } }, { "id": "choice-r23-099", "english": "Assignment note GRP-0004: its members are BR-00041, BR-00042 and BR-00043. Allowed source dataset for BR-00041: A, B, C. Allowed source dataset for BR-00042: A, B, C. Allowed source dataset for BR-00043: A, B, C. Maximum uses of each source dataset in this note: A at most 3; B at most 3; C at most 1. The set GRP-0004 is exactly those three backup runs. Give each member of GRP-0004 exactly one source dataset; the values may be the same or different.", "ainglish": "Assignment note GRP-0004: its members are BR-00041, BR-00042 and BR-00043. Allowed source dataset for BR-00041: A, B, C. Allowed source dataset for BR-00042: A, B, C. Allowed source dataset for BR-00043: A, B, C. Maximum uses of each source dataset in this note: A at most 3; B at most 3; C at most 1. The set GRP-0004 is exactly those three backup runs. Give each member of GRP-0004 exactly one source dataset, may-vary-across(GRP-0004).", "question": "A draft plan gives C to BR-00041, A to BR-00042 and B to BR-00043. Does that draft satisfy every requirement in the note?", "options": [ "the note does not settle it", "yes", "no", "no complete plan satisfies the note" ], "answer": "yes", "settlement_stratum": "may-vary-across:admissibility", "strata": { "form": "may-vary-across", "task": "admissibility", "domain": "source-dataset", "set": "GRP-0004", "members": [ "BR-00041", "BR-00042", "BR-00043" ], "candidate": [ "C", "A", "B" ], "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 1 }, "form": "may-vary-across", "task": "admissibility", "domain": "source-dataset", "feasible_count": 20, "candidate": [ "C", "A", "B" ], "gold": "yes" } }, { "id": "choice-r23-100", "english": "Assignment note GRP-0003: its members are FL-00031, FL-00032 and FL-00033. Allowed reviewer for FL-00031: A, B. Allowed reviewer for FL-00032: A, B. Allowed reviewer for FL-00033: A, B, C. Maximum uses of each reviewer in this note: A at most 2; B at most 1; C at most 2. The set GRP-0003 is exactly those three files. Give each member of GRP-0003 exactly one reviewer; the values may be the same or different.", "ainglish": "Assignment note GRP-0003: its members are FL-00031, FL-00032 and FL-00033. Allowed reviewer for FL-00031: A, B. Allowed reviewer for FL-00032: A, B. Allowed reviewer for FL-00033: A, B, C. Maximum uses of each reviewer in this note: A at most 2; B at most 1; C at most 2. The set GRP-0003 is exactly those three files. Give each member of GRP-0003 exactly one reviewer, may-vary-across(GRP-0003).", "question": "A draft plan gives A to FL-00031, A to FL-00032 and B to FL-00033. Does that draft satisfy every requirement in the note?", "options": [ "yes", "no", "no complete plan satisfies the note", "the note does not settle it" ], "answer": "yes", "settlement_stratum": "may-vary-across:admissibility", "strata": { "form": "may-vary-across", "task": "admissibility", "domain": "reviewer", "set": "GRP-0003", "members": [ "FL-00031", "FL-00032", "FL-00033" ], "candidate": [ "A", "A", "B" ], "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B", "C" ] ], "capacities": { "A": 2, "B": 1, "C": 2 }, "form": "may-vary-across", "task": "admissibility", "domain": "reviewer", "feasible_count": 6, "candidate": [ "A", "A", "B" ], "gold": "yes" } }, { "id": "choice-r23-101", "english": "Assignment note GRP-0001: its members are FL-00011, FL-00012 and FL-00013. Allowed reviewer for FL-00011: A, B, C. Allowed reviewer for FL-00012: B, C. Allowed reviewer for FL-00013: A, B, C. Maximum uses of each reviewer in this note: A at most 2; B at most 1; C at most 2. The set GRP-0001 is exactly those three files. Give each member of GRP-0001 exactly one reviewer; the values may be the same or different.", "ainglish": "Assignment note GRP-0001: its members are FL-00011, FL-00012 and FL-00013. Allowed reviewer for FL-00011: A, B, C. Allowed reviewer for FL-00012: B, C. Allowed reviewer for FL-00013: A, B, C. Maximum uses of each reviewer in this note: A at most 2; B at most 1; C at most 2. The set GRP-0001 is exactly those three files. Give each member of GRP-0001 exactly one reviewer, may-vary-across(GRP-0001).", "question": "A draft plan gives C to FL-00011, C to FL-00012 and A to FL-00013. Does that draft satisfy every requirement in the note?", "options": [ "no", "no complete plan satisfies the note", "the note does not settle it", "yes" ], "answer": "yes", "settlement_stratum": "may-vary-across:admissibility", "strata": { "form": "may-vary-across", "task": "admissibility", "domain": "reviewer", "set": "GRP-0001", "members": [ "FL-00011", "FL-00012", "FL-00013" ], "candidate": [ "C", "C", "A" ], "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 2, "B": 1, "C": 2 }, "form": "may-vary-across", "task": "admissibility", "domain": "reviewer", "feasible_count": 11, "candidate": [ "C", "C", "A" ], "gold": "yes" } }, { "id": "choice-r23-102", "english": "Assignment note GRP-0001: its members are SD-00011, SD-00012 and SD-00013. Allowed font family for SD-00011: only A. Allowed font family for SD-00012: A, C. Allowed font family for SD-00013: A, B, C. Maximum uses of each font family in this note: A at most 2; B at most 3; C at most 3. The set GRP-0001 is exactly those three slide decks. Give each member of GRP-0001 exactly one font family; the values may be the same or different.", "ainglish": "Assignment note GRP-0001: its members are SD-00011, SD-00012 and SD-00013. Allowed font family for SD-00011: only A. Allowed font family for SD-00012: A, C. Allowed font family for SD-00013: A, B, C. Maximum uses of each font family in this note: A at most 2; B at most 3; C at most 3. The set GRP-0001 is exactly those three slide decks. Give each member of GRP-0001 exactly one font family, may-vary-across(GRP-0001).", "question": "A draft plan gives A to SD-00011, C to SD-00012 and C to SD-00013. Does that draft satisfy every requirement in the note?", "options": [ "no", "no complete plan satisfies the note", "the note does not settle it", "yes" ], "answer": "yes", "settlement_stratum": "may-vary-across:admissibility", "strata": { "form": "may-vary-across", "task": "admissibility", "domain": "font-family", "set": "GRP-0001", "members": [ "SD-00011", "SD-00012", "SD-00013" ], "candidate": [ "A", "C", "C" ], "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A" ], [ "A", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 2, "B": 3, "C": 3 }, "form": "may-vary-across", "task": "admissibility", "domain": "font-family", "feasible_count": 5, "candidate": [ "A", "C", "C" ], "gold": "yes" } }, { "id": "choice-r23-103", "english": "Assignment note GRP-0002: its members are WO-00021, WO-00022 and WO-00023. Allowed deadline slot for WO-00021: A, B. Allowed deadline slot for WO-00022: only B. Allowed deadline slot for WO-00023: A, B. Maximum uses of each deadline slot in this note: A at most 2; B at most 3; C at most 3. The set GRP-0002 is exactly those three work orders. Give each member of GRP-0002 exactly one deadline slot; the values may be the same or different.", "ainglish": "Assignment note GRP-0002: its members are WO-00021, WO-00022 and WO-00023. Allowed deadline slot for WO-00021: A, B. Allowed deadline slot for WO-00022: only B. Allowed deadline slot for WO-00023: A, B. Maximum uses of each deadline slot in this note: A at most 2; B at most 3; C at most 3. The set GRP-0002 is exactly those three work orders. Give each member of GRP-0002 exactly one deadline slot, may-vary-across(GRP-0002).", "question": "A draft plan gives A to WO-00021, B to WO-00022 and B to WO-00023. Does that draft satisfy every requirement in the note?", "options": [ "no", "no complete plan satisfies the note", "the note does not settle it", "yes" ], "answer": "yes", "settlement_stratum": "may-vary-across:admissibility", "strata": { "form": "may-vary-across", "task": "admissibility", "domain": "deadline", "set": "GRP-0002", "members": [ "WO-00021", "WO-00022", "WO-00023" ], "candidate": [ "A", "B", "B" ], "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "B" ], [ "B" ], [ "A", "B" ] ], "capacities": { "A": 2, "B": 3, "C": 3 }, "form": "may-vary-across", "task": "admissibility", "domain": "deadline", "feasible_count": 4, "candidate": [ "A", "B", "B" ], "gold": "yes" } }, { "id": "choice-r23-104", "english": "Assignment note GRP-0002: its members are SD-00021, SD-00022 and SD-00023. Allowed font family for SD-00021: only A. Allowed font family for SD-00022: only A. Allowed font family for SD-00023: B, C. Maximum uses of each font family in this note: A at most 2; B at most 1; C at most 2. The set GRP-0002 is exactly those three slide decks. Give each member of GRP-0002 exactly one font family; the values may be the same or different.", "ainglish": "Assignment note GRP-0002: its members are SD-00021, SD-00022 and SD-00023. Allowed font family for SD-00021: only A. Allowed font family for SD-00022: only A. Allowed font family for SD-00023: B, C. Maximum uses of each font family in this note: A at most 2; B at most 1; C at most 2. The set GRP-0002 is exactly those three slide decks. Give each member of GRP-0002 exactly one font family, may-vary-across(GRP-0002).", "question": "A draft plan gives A to SD-00021, A to SD-00022 and B to SD-00023. Does that draft satisfy every requirement in the note?", "options": [ "no complete plan satisfies the note", "the note does not settle it", "yes", "no" ], "answer": "yes", "settlement_stratum": "may-vary-across:admissibility", "strata": { "form": "may-vary-across", "task": "admissibility", "domain": "font-family", "set": "GRP-0002", "members": [ "SD-00021", "SD-00022", "SD-00023" ], "candidate": [ "A", "A", "B" ], "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A" ], [ "A" ], [ "B", "C" ] ], "capacities": { "A": 2, "B": 1, "C": 2 }, "form": "may-vary-across", "task": "admissibility", "domain": "font-family", "feasible_count": 2, "candidate": [ "A", "A", "B" ], "gold": "yes" } }, { "id": "choice-r23-105", "english": "Assignment note GRP-0001: its members are WO-00011, WO-00012 and WO-00013. Allowed deadline slot for WO-00011: A, C. Allowed deadline slot for WO-00012: A, B, C. Allowed deadline slot for WO-00013: A, C. Maximum uses of each deadline slot in this note: A at most 2; B at most 2; C at most 2. The set GRP-0001 is exactly those three work orders. Give each member of GRP-0001 exactly one deadline slot; the values may be the same or different.", "ainglish": "Assignment note GRP-0001: its members are WO-00011, WO-00012 and WO-00013. Allowed deadline slot for WO-00011: A, C. Allowed deadline slot for WO-00012: A, B, C. Allowed deadline slot for WO-00013: A, C. Maximum uses of each deadline slot in this note: A at most 2; B at most 2; C at most 2. The set GRP-0001 is exactly those three work orders. Give each member of GRP-0001 exactly one deadline slot, may-vary-across(GRP-0001).", "question": "A draft plan gives C to WO-00011, B to WO-00012 and C to WO-00013. Does that draft satisfy every requirement in the note?", "options": [ "the note does not settle it", "yes", "no", "no complete plan satisfies the note" ], "answer": "yes", "settlement_stratum": "may-vary-across:admissibility", "strata": { "form": "may-vary-across", "task": "admissibility", "domain": "deadline", "set": "GRP-0001", "members": [ "WO-00011", "WO-00012", "WO-00013" ], "candidate": [ "C", "B", "C" ], "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "C" ], [ "A", "B", "C" ], [ "A", "C" ] ], "capacities": { "A": 2, "B": 2, "C": 2 }, "form": "may-vary-across", "task": "admissibility", "domain": "deadline", "feasible_count": 10, "candidate": [ "C", "B", "C" ], "gold": "yes" } }, { "id": "choice-r23-106", "english": "Assignment note GRP-0005: its members are WO-00051, WO-00052 and WO-00053. Allowed deadline slot for WO-00051: A, B, C. Allowed deadline slot for WO-00052: A, B, C. Allowed deadline slot for WO-00053: only B. Maximum uses of each deadline slot in this note: A at most 2; B at most 3; C at most 1. The set GRP-0005 is exactly those three work orders. Give each member of GRP-0005 exactly one deadline slot; the values may be the same or different.", "ainglish": "Assignment note GRP-0005: its members are WO-00051, WO-00052 and WO-00053. Allowed deadline slot for WO-00051: A, B, C. Allowed deadline slot for WO-00052: A, B, C. Allowed deadline slot for WO-00053: only B. Maximum uses of each deadline slot in this note: A at most 2; B at most 3; C at most 1. The set GRP-0005 is exactly those three work orders. Give each member of GRP-0005 exactly one deadline slot, may-vary-across(GRP-0005).", "question": "A draft plan gives B to WO-00051, B to WO-00052 and A to WO-00053. Does that draft satisfy every requirement in the note?", "options": [ "yes", "no", "no complete plan satisfies the note", "the note does not settle it" ], "answer": "no", "settlement_stratum": "may-vary-across:admissibility", "strata": { "form": "may-vary-across", "task": "admissibility", "domain": "deadline", "set": "GRP-0005", "members": [ "WO-00051", "WO-00052", "WO-00053" ], "candidate": [ "B", "B", "A" ], "gold_class": "no" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "B" ] ], "capacities": { "A": 2, "B": 3, "C": 1 }, "form": "may-vary-across", "task": "admissibility", "domain": "deadline", "feasible_count": 8, "candidate": [ "B", "B", "A" ], "gold": "no" } }, { "id": "choice-r23-107", "english": "Assignment note GRP-0007: its members are BR-00071, BR-00072 and BR-00073. Allowed source dataset for BR-00071: A, C. Allowed source dataset for BR-00072: A, B. Allowed source dataset for BR-00073: B, C. Maximum uses of each source dataset in this note: A at most 3; B at most 3; C at most 2. The set GRP-0007 is exactly those three backup runs. Give each member of GRP-0007 exactly one source dataset; the values may be the same or different.", "ainglish": "Assignment note GRP-0007: its members are BR-00071, BR-00072 and BR-00073. Allowed source dataset for BR-00071: A, C. Allowed source dataset for BR-00072: A, B. Allowed source dataset for BR-00073: B, C. Maximum uses of each source dataset in this note: A at most 3; B at most 3; C at most 2. The set GRP-0007 is exactly those three backup runs. Give each member of GRP-0007 exactly one source dataset, may-vary-across(GRP-0007).", "question": "A draft plan gives B to BR-00071, A to BR-00072 and C to BR-00073. Does that draft satisfy every requirement in the note?", "options": [ "yes", "no", "no complete plan satisfies the note", "the note does not settle it" ], "answer": "no", "settlement_stratum": "may-vary-across:admissibility", "strata": { "form": "may-vary-across", "task": "admissibility", "domain": "source-dataset", "set": "GRP-0007", "members": [ "BR-00071", "BR-00072", "BR-00073" ], "candidate": [ "B", "A", "C" ], "gold_class": "no" }, "ledger": { "eligibility": [ [ "A", "C" ], [ "A", "B" ], [ "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 2 }, "form": "may-vary-across", "task": "admissibility", "domain": "source-dataset", "feasible_count": 8, "candidate": [ "B", "A", "C" ], "gold": "no" } }, { "id": "choice-r23-108", "english": "Assignment note GRP-0005: its members are BR-00051, BR-00052 and BR-00053. Allowed source dataset for BR-00051: only C. Allowed source dataset for BR-00052: only A. Allowed source dataset for BR-00053: A, B, C. Maximum uses of each source dataset in this note: A at most 3; B at most 3; C at most 1. The set GRP-0005 is exactly those three backup runs. Give each member of GRP-0005 exactly one source dataset; the values may be the same or different.", "ainglish": "Assignment note GRP-0005: its members are BR-00051, BR-00052 and BR-00053. Allowed source dataset for BR-00051: only C. Allowed source dataset for BR-00052: only A. Allowed source dataset for BR-00053: A, B, C. Maximum uses of each source dataset in this note: A at most 3; B at most 3; C at most 1. The set GRP-0005 is exactly those three backup runs. Give each member of GRP-0005 exactly one source dataset, may-vary-across(GRP-0005).", "question": "A draft plan gives A to BR-00051, A to BR-00052 and B to BR-00053. Does that draft satisfy every requirement in the note?", "options": [ "no", "no complete plan satisfies the note", "the note does not settle it", "yes" ], "answer": "no", "settlement_stratum": "may-vary-across:admissibility", "strata": { "form": "may-vary-across", "task": "admissibility", "domain": "source-dataset", "set": "GRP-0005", "members": [ "BR-00051", "BR-00052", "BR-00053" ], "candidate": [ "A", "A", "B" ], "gold_class": "no" }, "ledger": { "eligibility": [ [ "C" ], [ "A" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 1 }, "form": "may-vary-across", "task": "admissibility", "domain": "source-dataset", "feasible_count": 2, "candidate": [ "A", "A", "B" ], "gold": "no" } }, { "id": "choice-r23-109", "english": "Assignment note GRP-0005: its members are SD-00051, SD-00052 and SD-00053. Allowed font family for SD-00051: only C. Allowed font family for SD-00052: A, B, C. Allowed font family for SD-00053: B, C. Maximum uses of each font family in this note: A at most 3; B at most 1; C at most 1. The set GRP-0005 is exactly those three slide decks. Give each member of GRP-0005 exactly one font family; the values may be the same or different.", "ainglish": "Assignment note GRP-0005: its members are SD-00051, SD-00052 and SD-00053. Allowed font family for SD-00051: only C. Allowed font family for SD-00052: A, B, C. Allowed font family for SD-00053: B, C. Maximum uses of each font family in this note: A at most 3; B at most 1; C at most 1. The set GRP-0005 is exactly those three slide decks. Give each member of GRP-0005 exactly one font family, may-vary-across(GRP-0005).", "question": "A draft plan gives C to SD-00051, B to SD-00052 and A to SD-00053. Does that draft satisfy every requirement in the note?", "options": [ "no complete plan satisfies the note", "the note does not settle it", "yes", "no" ], "answer": "no", "settlement_stratum": "may-vary-across:admissibility", "strata": { "form": "may-vary-across", "task": "admissibility", "domain": "font-family", "set": "GRP-0005", "members": [ "SD-00051", "SD-00052", "SD-00053" ], "candidate": [ "C", "B", "A" ], "gold_class": "no" }, "ledger": { "eligibility": [ [ "C" ], [ "A", "B", "C" ], [ "B", "C" ] ], "capacities": { "A": 3, "B": 1, "C": 1 }, "form": "may-vary-across", "task": "admissibility", "domain": "font-family", "feasible_count": 1, "candidate": [ "C", "B", "A" ], "gold": "no" } }, { "id": "choice-r23-110", "english": "Assignment note GRP-0008: its members are BR-00081, BR-00082 and BR-00083. Allowed source dataset for BR-00081: B, C. Allowed source dataset for BR-00082: only C. Allowed source dataset for BR-00083: A, C. Maximum uses of each source dataset in this note: A at most 2; B at most 1; C at most 1. The set GRP-0008 is exactly those three backup runs. Give each member of GRP-0008 exactly one source dataset; the values may be the same or different.", "ainglish": "Assignment note GRP-0008: its members are BR-00081, BR-00082 and BR-00083. Allowed source dataset for BR-00081: B, C. Allowed source dataset for BR-00082: only C. Allowed source dataset for BR-00083: A, C. Maximum uses of each source dataset in this note: A at most 2; B at most 1; C at most 1. The set GRP-0008 is exactly those three backup runs. Give each member of GRP-0008 exactly one source dataset, may-vary-across(GRP-0008).", "question": "A draft plan gives A to BR-00081, B to BR-00082 and C to BR-00083. Does that draft satisfy every requirement in the note?", "options": [ "no", "no complete plan satisfies the note", "the note does not settle it", "yes" ], "answer": "no", "settlement_stratum": "may-vary-across:admissibility", "strata": { "form": "may-vary-across", "task": "admissibility", "domain": "source-dataset", "set": "GRP-0008", "members": [ "BR-00081", "BR-00082", "BR-00083" ], "candidate": [ "A", "B", "C" ], "gold_class": "no" }, "ledger": { "eligibility": [ [ "B", "C" ], [ "C" ], [ "A", "C" ] ], "capacities": { "A": 2, "B": 1, "C": 1 }, "form": "may-vary-across", "task": "admissibility", "domain": "source-dataset", "feasible_count": 1, "candidate": [ "A", "B", "C" ], "gold": "no" } }, { "id": "choice-r23-111", "english": "Assignment note GRP-0006: its members are FL-00061, FL-00062 and FL-00063. Allowed reviewer for FL-00061: A, B, C. Allowed reviewer for FL-00062: only A. Allowed reviewer for FL-00063: A, B. Maximum uses of each reviewer in this note: A at most 1; B at most 2; C at most 3. The set GRP-0006 is exactly those three files. Give each member of GRP-0006 exactly one reviewer; the values may be the same or different.", "ainglish": "Assignment note GRP-0006: its members are FL-00061, FL-00062 and FL-00063. Allowed reviewer for FL-00061: A, B, C. Allowed reviewer for FL-00062: only A. Allowed reviewer for FL-00063: A, B. Maximum uses of each reviewer in this note: A at most 1; B at most 2; C at most 3. The set GRP-0006 is exactly those three files. Give each member of GRP-0006 exactly one reviewer, may-vary-across(GRP-0006).", "question": "A draft plan gives A to FL-00061, C to FL-00062 and A to FL-00063. Does that draft satisfy every requirement in the note?", "options": [ "no complete plan satisfies the note", "the note does not settle it", "yes", "no" ], "answer": "no", "settlement_stratum": "may-vary-across:admissibility", "strata": { "form": "may-vary-across", "task": "admissibility", "domain": "reviewer", "set": "GRP-0006", "members": [ "FL-00061", "FL-00062", "FL-00063" ], "candidate": [ "A", "C", "A" ], "gold_class": "no" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A" ], [ "A", "B" ] ], "capacities": { "A": 1, "B": 2, "C": 3 }, "form": "may-vary-across", "task": "admissibility", "domain": "reviewer", "feasible_count": 2, "candidate": [ "A", "C", "A" ], "gold": "no" } }, { "id": "choice-r23-112", "english": "Assignment note GRP-0002: its members are BR-00021, BR-00022 and BR-00023. Allowed source dataset for BR-00021: A, B, C. Allowed source dataset for BR-00022: only A. Allowed source dataset for BR-00023: only C. Maximum uses of each source dataset in this note: A at most 2; B at most 3; C at most 3. The set GRP-0002 is exactly those three backup runs. Give each member of GRP-0002 exactly one source dataset; the values may be the same or different.", "ainglish": "Assignment note GRP-0002: its members are BR-00021, BR-00022 and BR-00023. Allowed source dataset for BR-00021: A, B, C. Allowed source dataset for BR-00022: only A. Allowed source dataset for BR-00023: only C. Maximum uses of each source dataset in this note: A at most 2; B at most 3; C at most 3. The set GRP-0002 is exactly those three backup runs. Give each member of GRP-0002 exactly one source dataset, may-vary-across(GRP-0002).", "question": "A draft plan gives A to BR-00021, A to BR-00022 and C to BR-00023. Does that draft satisfy every requirement in the note?", "options": [ "yes", "no", "no complete plan satisfies the note", "the note does not settle it" ], "answer": "yes", "settlement_stratum": "may-vary-across:admissibility", "strata": { "form": "may-vary-across", "task": "admissibility", "domain": "source-dataset", "set": "GRP-0002", "members": [ "BR-00021", "BR-00022", "BR-00023" ], "candidate": [ "A", "A", "C" ], "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A" ], [ "C" ] ], "capacities": { "A": 2, "B": 3, "C": 3 }, "form": "may-vary-across", "task": "admissibility", "domain": "source-dataset", "feasible_count": 3, "candidate": [ "A", "A", "C" ], "gold": "yes" } }, { "id": "choice-r23-113", "english": "Assignment note GRP-0003: its members are SD-00031, SD-00032 and SD-00033. Allowed font family for SD-00031: B, C. Allowed font family for SD-00032: A, C. Allowed font family for SD-00033: A, B, C. Maximum uses of each font family in this note: A at most 2; B at most 2; C at most 2. The set GRP-0003 is exactly those three slide decks. Give each member of GRP-0003 exactly one font family; the values may be the same or different.", "ainglish": "Assignment note GRP-0003: its members are SD-00031, SD-00032 and SD-00033. Allowed font family for SD-00031: B, C. Allowed font family for SD-00032: A, C. Allowed font family for SD-00033: A, B, C. Maximum uses of each font family in this note: A at most 2; B at most 2; C at most 2. The set GRP-0003 is exactly those three slide decks. Give each member of GRP-0003 exactly one font family, may-vary-across(GRP-0003).", "question": "A draft plan gives B to SD-00031, A to SD-00032 and A to SD-00033. Does that draft satisfy every requirement in the note?", "options": [ "no", "no complete plan satisfies the note", "the note does not settle it", "yes" ], "answer": "yes", "settlement_stratum": "may-vary-across:admissibility", "strata": { "form": "may-vary-across", "task": "admissibility", "domain": "font-family", "set": "GRP-0003", "members": [ "SD-00031", "SD-00032", "SD-00033" ], "candidate": [ "B", "A", "A" ], "gold_class": "yes" }, "ledger": { "eligibility": [ [ "B", "C" ], [ "A", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 2, "B": 2, "C": 2 }, "form": "may-vary-across", "task": "admissibility", "domain": "font-family", "feasible_count": 11, "candidate": [ "B", "A", "A" ], "gold": "yes" } }, { "id": "choice-r23-114", "english": "Assignment note GRP-0007: its members are FL-00071, FL-00072 and FL-00073. Allowed reviewer for FL-00071: A, C. Allowed reviewer for FL-00072: B, C. Allowed reviewer for FL-00073: only B. Maximum uses of each reviewer in this note: A at most 1; B at most 1; C at most 3. The set GRP-0007 is exactly those three files. Give each member of GRP-0007 exactly one reviewer; the values may be the same or different.", "ainglish": "Assignment note GRP-0007: its members are FL-00071, FL-00072 and FL-00073. Allowed reviewer for FL-00071: A, C. Allowed reviewer for FL-00072: B, C. Allowed reviewer for FL-00073: only B. Maximum uses of each reviewer in this note: A at most 1; B at most 1; C at most 3. The set GRP-0007 is exactly those three files. Give each member of GRP-0007 exactly one reviewer, may-vary-across(GRP-0007).", "question": "A draft plan gives B to FL-00071, C to FL-00072 and C to FL-00073. Does that draft satisfy every requirement in the note?", "options": [ "no", "no complete plan satisfies the note", "the note does not settle it", "yes" ], "answer": "no", "settlement_stratum": "may-vary-across:admissibility", "strata": { "form": "may-vary-across", "task": "admissibility", "domain": "reviewer", "set": "GRP-0007", "members": [ "FL-00071", "FL-00072", "FL-00073" ], "candidate": [ "B", "C", "C" ], "gold_class": "no" }, "ledger": { "eligibility": [ [ "A", "C" ], [ "B", "C" ], [ "B" ] ], "capacities": { "A": 1, "B": 1, "C": 3 }, "form": "may-vary-across", "task": "admissibility", "domain": "reviewer", "feasible_count": 2, "candidate": [ "B", "C", "C" ], "gold": "no" } }, { "id": "choice-r23-115", "english": "Assignment note GRP-0001: its members are BR-00011, BR-00012 and BR-00013. Allowed source dataset for BR-00011: A, B, C. Allowed source dataset for BR-00012: A, B, C. Allowed source dataset for BR-00013: B, C. Maximum uses of each source dataset in this note: A at most 3; B at most 3; C at most 2. The set GRP-0001 is exactly those three backup runs. Give each member of GRP-0001 exactly one source dataset; the values may be the same or different.", "ainglish": "Assignment note GRP-0001: its members are BR-00011, BR-00012 and BR-00013. Allowed source dataset for BR-00011: A, B, C. Allowed source dataset for BR-00012: A, B, C. Allowed source dataset for BR-00013: B, C. Maximum uses of each source dataset in this note: A at most 3; B at most 3; C at most 2. The set GRP-0001 is exactly those three backup runs. Give each member of GRP-0001 exactly one source dataset, may-vary-across(GRP-0001).", "question": "A draft plan gives B to BR-00011, C to BR-00012 and C to BR-00013. Does that draft satisfy every requirement in the note?", "options": [ "no complete plan satisfies the note", "the note does not settle it", "yes", "no" ], "answer": "yes", "settlement_stratum": "may-vary-across:admissibility", "strata": { "form": "may-vary-across", "task": "admissibility", "domain": "source-dataset", "set": "GRP-0001", "members": [ "BR-00011", "BR-00012", "BR-00013" ], "candidate": [ "B", "C", "C" ], "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 2 }, "form": "may-vary-across", "task": "admissibility", "domain": "source-dataset", "feasible_count": 17, "candidate": [ "B", "C", "C" ], "gold": "yes" } }, { "id": "choice-r23-116", "english": "Assignment note GRP-0003: its members are BR-00031, BR-00032 and BR-00033. Allowed source dataset for BR-00031: A, B, C. Allowed source dataset for BR-00032: A, B, C. Allowed source dataset for BR-00033: A, B, C. Maximum uses of each source dataset in this note: A at most 2; B at most 1; C at most 3. The set GRP-0003 is exactly those three backup runs. Give each member of GRP-0003 exactly one source dataset; the values may be the same or different.", "ainglish": "Assignment note GRP-0003: its members are BR-00031, BR-00032 and BR-00033. Allowed source dataset for BR-00031: A, B, C. Allowed source dataset for BR-00032: A, B, C. Allowed source dataset for BR-00033: A, B, C. Maximum uses of each source dataset in this note: A at most 2; B at most 1; C at most 3. The set GRP-0003 is exactly those three backup runs. Give each member of GRP-0003 exactly one source dataset, may-vary-across(GRP-0003).", "question": "A draft plan gives B to BR-00031, C to BR-00032 and A to BR-00033. Does that draft satisfy every requirement in the note?", "options": [ "no complete plan satisfies the note", "the note does not settle it", "yes", "no" ], "answer": "yes", "settlement_stratum": "may-vary-across:admissibility", "strata": { "form": "may-vary-across", "task": "admissibility", "domain": "source-dataset", "set": "GRP-0003", "members": [ "BR-00031", "BR-00032", "BR-00033" ], "candidate": [ "B", "C", "A" ], "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 2, "B": 1, "C": 3 }, "form": "may-vary-across", "task": "admissibility", "domain": "source-dataset", "feasible_count": 19, "candidate": [ "B", "C", "A" ], "gold": "yes" } }, { "id": "choice-r23-117", "english": "Assignment note GRP-0008: its members are SD-00081, SD-00082 and SD-00083. Allowed font family for SD-00081: A, B, C. Allowed font family for SD-00082: A, B, C. Allowed font family for SD-00083: only C. Maximum uses of each font family in this note: A at most 3; B at most 2; C at most 2. The set GRP-0008 is exactly those three slide decks. Give each member of GRP-0008 exactly one font family; the values may be the same or different.", "ainglish": "Assignment note GRP-0008: its members are SD-00081, SD-00082 and SD-00083. Allowed font family for SD-00081: A, B, C. Allowed font family for SD-00082: A, B, C. Allowed font family for SD-00083: only C. Maximum uses of each font family in this note: A at most 3; B at most 2; C at most 2. The set GRP-0008 is exactly those three slide decks. Give each member of GRP-0008 exactly one font family, may-vary-across(GRP-0008).", "question": "A draft plan gives A to SD-00081, B to SD-00082 and B to SD-00083. Does that draft satisfy every requirement in the note?", "options": [ "no complete plan satisfies the note", "the note does not settle it", "yes", "no" ], "answer": "no", "settlement_stratum": "may-vary-across:admissibility", "strata": { "form": "may-vary-across", "task": "admissibility", "domain": "font-family", "set": "GRP-0008", "members": [ "SD-00081", "SD-00082", "SD-00083" ], "candidate": [ "A", "B", "B" ], "gold_class": "no" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "C" ] ], "capacities": { "A": 3, "B": 2, "C": 2 }, "form": "may-vary-across", "task": "admissibility", "domain": "font-family", "feasible_count": 8, "candidate": [ "A", "B", "B" ], "gold": "no" } }, { "id": "choice-r23-118", "english": "Assignment note GRP-0006: its members are SD-00061, SD-00062 and SD-00063. Allowed font family for SD-00061: B, C. Allowed font family for SD-00062: A, B, C. Allowed font family for SD-00063: A, C. Maximum uses of each font family in this note: A at most 1; B at most 2; C at most 1. The set GRP-0006 is exactly those three slide decks. Give each member of GRP-0006 exactly one font family; the values may be the same or different.", "ainglish": "Assignment note GRP-0006: its members are SD-00061, SD-00062 and SD-00063. Allowed font family for SD-00061: B, C. Allowed font family for SD-00062: A, B, C. Allowed font family for SD-00063: A, C. Maximum uses of each font family in this note: A at most 1; B at most 2; C at most 1. The set GRP-0006 is exactly those three slide decks. Give each member of GRP-0006 exactly one font family, may-vary-across(GRP-0006).", "question": "A draft plan gives B to SD-00061, C to SD-00062 and C to SD-00063. Does that draft satisfy every requirement in the note?", "options": [ "the note does not settle it", "yes", "no", "no complete plan satisfies the note" ], "answer": "no", "settlement_stratum": "may-vary-across:admissibility", "strata": { "form": "may-vary-across", "task": "admissibility", "domain": "font-family", "set": "GRP-0006", "members": [ "SD-00061", "SD-00062", "SD-00063" ], "candidate": [ "B", "C", "C" ], "gold_class": "no" }, "ledger": { "eligibility": [ [ "B", "C" ], [ "A", "B", "C" ], [ "A", "C" ] ], "capacities": { "A": 1, "B": 2, "C": 1 }, "form": "may-vary-across", "task": "admissibility", "domain": "font-family", "feasible_count": 5, "candidate": [ "B", "C", "C" ], "gold": "no" } }, { "id": "choice-r23-119", "english": "Assignment note GRP-0006: its members are WO-00061, WO-00062 and WO-00063. Allowed deadline slot for WO-00061: A, B. Allowed deadline slot for WO-00062: A, C. Allowed deadline slot for WO-00063: only C. Maximum uses of each deadline slot in this note: A at most 3; B at most 3; C at most 3. The set GRP-0006 is exactly those three work orders. Give each member of GRP-0006 exactly one deadline slot; the values may be the same or different.", "ainglish": "Assignment note GRP-0006: its members are WO-00061, WO-00062 and WO-00063. Allowed deadline slot for WO-00061: A, B. Allowed deadline slot for WO-00062: A, C. Allowed deadline slot for WO-00063: only C. Maximum uses of each deadline slot in this note: A at most 3; B at most 3; C at most 3. The set GRP-0006 is exactly those three work orders. Give each member of GRP-0006 exactly one deadline slot, may-vary-across(GRP-0006).", "question": "A draft plan gives A to WO-00061, B to WO-00062 and C to WO-00063. Does that draft satisfy every requirement in the note?", "options": [ "no complete plan satisfies the note", "the note does not settle it", "yes", "no" ], "answer": "no", "settlement_stratum": "may-vary-across:admissibility", "strata": { "form": "may-vary-across", "task": "admissibility", "domain": "deadline", "set": "GRP-0006", "members": [ "WO-00061", "WO-00062", "WO-00063" ], "candidate": [ "A", "B", "C" ], "gold_class": "no" }, "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "C" ], [ "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "form": "may-vary-across", "task": "admissibility", "domain": "deadline", "feasible_count": 4, "candidate": [ "A", "B", "C" ], "gold": "no" } }, { "id": "choice-r23-120", "english": "Assignment note GRP-0004: its members are SD-00041, SD-00042 and SD-00043. Allowed font family for SD-00041: A, B, C. Allowed font family for SD-00042: A, B, C. Allowed font family for SD-00043: A, B, C. Maximum uses of each font family in this note: A at most 3; B at most 1; C at most 1. The set GRP-0004 is exactly those three slide decks. Give each member of GRP-0004 exactly one font family; the values may be the same or different.", "ainglish": "Assignment note GRP-0004: its members are SD-00041, SD-00042 and SD-00043. Allowed font family for SD-00041: A, B, C. Allowed font family for SD-00042: A, B, C. Allowed font family for SD-00043: A, B, C. Maximum uses of each font family in this note: A at most 3; B at most 1; C at most 1. The set GRP-0004 is exactly those three slide decks. Give each member of GRP-0004 exactly one font family, may-vary-across(GRP-0004).", "question": "A draft plan gives A to SD-00041, C to SD-00042 and A to SD-00043. Does that draft satisfy every requirement in the note?", "options": [ "no complete plan satisfies the note", "the note does not settle it", "yes", "no" ], "answer": "yes", "settlement_stratum": "may-vary-across:admissibility", "strata": { "form": "may-vary-across", "task": "admissibility", "domain": "font-family", "set": "GRP-0004", "members": [ "SD-00041", "SD-00042", "SD-00043" ], "candidate": [ "A", "C", "A" ], "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 1, "C": 1 }, "form": "may-vary-across", "task": "admissibility", "domain": "font-family", "feasible_count": 13, "candidate": [ "A", "C", "A" ], "gold": "yes" } }, { "id": "choice-r23-121", "english": "Assignment note GRP-0006: its members are BR-00061, BR-00062 and BR-00063. Allowed source dataset for BR-00061: A, B, C. Allowed source dataset for BR-00062: only C. Allowed source dataset for BR-00063: A, B. Maximum uses of each source dataset in this note: A at most 2; B at most 3; C at most 2. The set GRP-0006 is exactly those three backup runs. Give each member of GRP-0006 exactly one source dataset; the values may be the same or different.", "ainglish": "Assignment note GRP-0006: its members are BR-00061, BR-00062 and BR-00063. Allowed source dataset for BR-00061: A, B, C. Allowed source dataset for BR-00062: only C. Allowed source dataset for BR-00063: A, B. Maximum uses of each source dataset in this note: A at most 2; B at most 3; C at most 2. The set GRP-0006 is exactly those three backup runs. Give each member of GRP-0006 exactly one source dataset, may-vary-across(GRP-0006).", "question": "A draft plan gives A to BR-00061, A to BR-00062 and B to BR-00063. Does that draft satisfy every requirement in the note?", "options": [ "yes", "no", "no complete plan satisfies the note", "the note does not settle it" ], "answer": "no", "settlement_stratum": "may-vary-across:admissibility", "strata": { "form": "may-vary-across", "task": "admissibility", "domain": "source-dataset", "set": "GRP-0006", "members": [ "BR-00061", "BR-00062", "BR-00063" ], "candidate": [ "A", "A", "B" ], "gold_class": "no" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "C" ], [ "A", "B" ] ], "capacities": { "A": 2, "B": 3, "C": 2 }, "form": "may-vary-across", "task": "admissibility", "domain": "source-dataset", "feasible_count": 6, "candidate": [ "A", "A", "B" ], "gold": "no" } }, { "id": "choice-r23-122", "english": "Assignment note GRP-0004: its members are FL-00041, FL-00042 and FL-00043. Allowed reviewer for FL-00041: only C. Allowed reviewer for FL-00042: A, B, C. Allowed reviewer for FL-00043: A, C. Maximum uses of each reviewer in this note: A at most 1; B at most 2; C at most 2. The set GRP-0004 is exactly those three files. Give each member of GRP-0004 exactly one reviewer; the values may be the same or different.", "ainglish": "Assignment note GRP-0004: its members are FL-00041, FL-00042 and FL-00043. Allowed reviewer for FL-00041: only C. Allowed reviewer for FL-00042: A, B, C. Allowed reviewer for FL-00043: A, C. Maximum uses of each reviewer in this note: A at most 1; B at most 2; C at most 2. The set GRP-0004 is exactly those three files. Give each member of GRP-0004 exactly one reviewer, may-vary-across(GRP-0004).", "question": "A draft plan gives C to FL-00041, C to FL-00042 and A to FL-00043. Does that draft satisfy every requirement in the note?", "options": [ "no complete plan satisfies the note", "the note does not settle it", "yes", "no" ], "answer": "yes", "settlement_stratum": "may-vary-across:admissibility", "strata": { "form": "may-vary-across", "task": "admissibility", "domain": "reviewer", "set": "GRP-0004", "members": [ "FL-00041", "FL-00042", "FL-00043" ], "candidate": [ "C", "C", "A" ], "gold_class": "yes" }, "ledger": { "eligibility": [ [ "C" ], [ "A", "B", "C" ], [ "A", "C" ] ], "capacities": { "A": 1, "B": 2, "C": 2 }, "form": "may-vary-across", "task": "admissibility", "domain": "reviewer", "feasible_count": 4, "candidate": [ "C", "C", "A" ], "gold": "yes" } }, { "id": "choice-r23-123", "english": "Assignment note GRP-0004: its members are WO-00041, WO-00042 and WO-00043. Allowed deadline slot for WO-00041: A, B. Allowed deadline slot for WO-00042: A, B, C. Allowed deadline slot for WO-00043: A, B, C. Maximum uses of each deadline slot in this note: A at most 2; B at most 2; C at most 1. The set GRP-0004 is exactly those three work orders. Give each member of GRP-0004 exactly one deadline slot; the values may be the same or different.", "ainglish": "Assignment note GRP-0004: its members are WO-00041, WO-00042 and WO-00043. Allowed deadline slot for WO-00041: A, B. Allowed deadline slot for WO-00042: A, B, C. Allowed deadline slot for WO-00043: A, B, C. Maximum uses of each deadline slot in this note: A at most 2; B at most 2; C at most 1. The set GRP-0004 is exactly those three work orders. Give each member of GRP-0004 exactly one deadline slot, may-vary-across(GRP-0004).", "question": "A draft plan gives A to WO-00041, A to WO-00042 and B to WO-00043. Does that draft satisfy every requirement in the note?", "options": [ "no", "no complete plan satisfies the note", "the note does not settle it", "yes" ], "answer": "yes", "settlement_stratum": "may-vary-across:admissibility", "strata": { "form": "may-vary-across", "task": "admissibility", "domain": "deadline", "set": "GRP-0004", "members": [ "WO-00041", "WO-00042", "WO-00043" ], "candidate": [ "A", "A", "B" ], "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 2, "B": 2, "C": 1 }, "form": "may-vary-across", "task": "admissibility", "domain": "deadline", "feasible_count": 14, "candidate": [ "A", "A", "B" ], "gold": "yes" } }, { "id": "choice-r23-124", "english": "Assignment note GRP-0007: its members are SD-00071, SD-00072 and SD-00073. Allowed font family for SD-00071: only B. Allowed font family for SD-00072: A, B, C. Allowed font family for SD-00073: A, B, C. Maximum uses of each font family in this note: A at most 1; B at most 3; C at most 1. The set GRP-0007 is exactly those three slide decks. Give each member of GRP-0007 exactly one font family; the values may be the same or different.", "ainglish": "Assignment note GRP-0007: its members are SD-00071, SD-00072 and SD-00073. Allowed font family for SD-00071: only B. Allowed font family for SD-00072: A, B, C. Allowed font family for SD-00073: A, B, C. Maximum uses of each font family in this note: A at most 1; B at most 3; C at most 1. The set GRP-0007 is exactly those three slide decks. Give each member of GRP-0007 exactly one font family, may-vary-across(GRP-0007).", "question": "A draft plan gives A to SD-00071, B to SD-00072 and C to SD-00073. Does that draft satisfy every requirement in the note?", "options": [ "no complete plan satisfies the note", "the note does not settle it", "yes", "no" ], "answer": "no", "settlement_stratum": "may-vary-across:admissibility", "strata": { "form": "may-vary-across", "task": "admissibility", "domain": "font-family", "set": "GRP-0007", "members": [ "SD-00071", "SD-00072", "SD-00073" ], "candidate": [ "A", "B", "C" ], "gold_class": "no" }, "ledger": { "eligibility": [ [ "B" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 1, "B": 3, "C": 1 }, "form": "may-vary-across", "task": "admissibility", "domain": "font-family", "feasible_count": 7, "candidate": [ "A", "B", "C" ], "gold": "no" } }, { "id": "choice-r23-125", "english": "Assignment note GRP-0008: its members are FL-00081, FL-00082 and FL-00083. Allowed reviewer for FL-00081: A, C. Allowed reviewer for FL-00082: only A. Allowed reviewer for FL-00083: A, B, C. Maximum uses of each reviewer in this note: A at most 3; B at most 3; C at most 1. The set GRP-0008 is exactly those three files. Give each member of GRP-0008 exactly one reviewer; the values may be the same or different.", "ainglish": "Assignment note GRP-0008: its members are FL-00081, FL-00082 and FL-00083. Allowed reviewer for FL-00081: A, C. Allowed reviewer for FL-00082: only A. Allowed reviewer for FL-00083: A, B, C. Maximum uses of each reviewer in this note: A at most 3; B at most 3; C at most 1. The set GRP-0008 is exactly those three files. Give each member of GRP-0008 exactly one reviewer, may-vary-across(GRP-0008).", "question": "A draft plan gives A to FL-00081, C to FL-00082 and C to FL-00083. Does that draft satisfy every requirement in the note?", "options": [ "no complete plan satisfies the note", "the note does not settle it", "yes", "no" ], "answer": "no", "settlement_stratum": "may-vary-across:admissibility", "strata": { "form": "may-vary-across", "task": "admissibility", "domain": "reviewer", "set": "GRP-0008", "members": [ "FL-00081", "FL-00082", "FL-00083" ], "candidate": [ "A", "C", "C" ], "gold_class": "no" }, "ledger": { "eligibility": [ [ "A", "C" ], [ "A" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 1 }, "form": "may-vary-across", "task": "admissibility", "domain": "reviewer", "feasible_count": 5, "candidate": [ "A", "C", "C" ], "gold": "no" } }, { "id": "choice-r23-126", "english": "Assignment note GRP-0007: its members are WO-00071, WO-00072 and WO-00073. Allowed deadline slot for WO-00071: B, C. Allowed deadline slot for WO-00072: A, B, C. Allowed deadline slot for WO-00073: B, C. Maximum uses of each deadline slot in this note: A at most 3; B at most 1; C at most 3. The set GRP-0007 is exactly those three work orders. Give each member of GRP-0007 exactly one deadline slot; the values may be the same or different.", "ainglish": "Assignment note GRP-0007: its members are WO-00071, WO-00072 and WO-00073. Allowed deadline slot for WO-00071: B, C. Allowed deadline slot for WO-00072: A, B, C. Allowed deadline slot for WO-00073: B, C. Maximum uses of each deadline slot in this note: A at most 3; B at most 1; C at most 3. The set GRP-0007 is exactly those three work orders. Give each member of GRP-0007 exactly one deadline slot, may-vary-across(GRP-0007).", "question": "A draft plan gives A to WO-00071, A to WO-00072 and B to WO-00073. Does that draft satisfy every requirement in the note?", "options": [ "the note does not settle it", "yes", "no", "no complete plan satisfies the note" ], "answer": "no", "settlement_stratum": "may-vary-across:admissibility", "strata": { "form": "may-vary-across", "task": "admissibility", "domain": "deadline", "set": "GRP-0007", "members": [ "WO-00071", "WO-00072", "WO-00073" ], "candidate": [ "A", "A", "B" ], "gold_class": "no" }, "ledger": { "eligibility": [ [ "B", "C" ], [ "A", "B", "C" ], [ "B", "C" ] ], "capacities": { "A": 3, "B": 1, "C": 3 }, "form": "may-vary-across", "task": "admissibility", "domain": "deadline", "feasible_count": 7, "candidate": [ "A", "A", "B" ], "gold": "no" } }, { "id": "choice-r23-127", "english": "Assignment note GRP-0002: its members are FL-00021, FL-00022 and FL-00023. Allowed reviewer for FL-00021: A, B, C. Allowed reviewer for FL-00022: A, B, C. Allowed reviewer for FL-00023: A, B. Maximum uses of each reviewer in this note: A at most 3; B at most 1; C at most 2. The set GRP-0002 is exactly those three files. Give each member of GRP-0002 exactly one reviewer; the values may be the same or different.", "ainglish": "Assignment note GRP-0002: its members are FL-00021, FL-00022 and FL-00023. Allowed reviewer for FL-00021: A, B, C. Allowed reviewer for FL-00022: A, B, C. Allowed reviewer for FL-00023: A, B. Maximum uses of each reviewer in this note: A at most 3; B at most 1; C at most 2. The set GRP-0002 is exactly those three files. Give each member of GRP-0002 exactly one reviewer, may-vary-across(GRP-0002).", "question": "A draft plan gives B to FL-00021, A to FL-00022 and A to FL-00023. Does that draft satisfy every requirement in the note?", "options": [ "no", "no complete plan satisfies the note", "the note does not settle it", "yes" ], "answer": "yes", "settlement_stratum": "may-vary-across:admissibility", "strata": { "form": "may-vary-across", "task": "admissibility", "domain": "reviewer", "set": "GRP-0002", "members": [ "FL-00021", "FL-00022", "FL-00023" ], "candidate": [ "B", "A", "A" ], "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B" ] ], "capacities": { "A": 3, "B": 1, "C": 2 }, "form": "may-vary-across", "task": "admissibility", "domain": "reviewer", "feasible_count": 12, "candidate": [ "B", "A", "A" ], "gold": "yes" } }, { "id": "choice-r23-128", "english": "Assignment note GRP-0007: its members are BR-00071, BR-00072 and BR-00073. Allowed source dataset for BR-00071: only B. Allowed source dataset for BR-00072: A, B, C. Allowed source dataset for BR-00073: only B. Maximum uses of each source dataset in this note: A at most 2; B at most 1; C at most 2. The set GRP-0007 is exactly those three backup runs. Give each member of GRP-0007 exactly one source dataset; the values may be the same or different.", "ainglish": "Assignment note GRP-0007: its members are BR-00071, BR-00072 and BR-00073. Allowed source dataset for BR-00071: only B. Allowed source dataset for BR-00072: A, B, C. Allowed source dataset for BR-00073: only B. Maximum uses of each source dataset in this note: A at most 2; B at most 1; C at most 2. The set GRP-0007 is exactly those three backup runs. Give each member of GRP-0007 exactly one source dataset, may-vary-across(GRP-0007).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "yes", "no", "the note does not settle it" ], "answer": "no", "settlement_stratum": "may-vary-across:feasibility", "strata": { "form": "may-vary-across", "task": "feasibility", "domain": "source-dataset", "set": "GRP-0007", "members": [ "BR-00071", "BR-00072", "BR-00073" ], "candidate": null, "gold_class": "no" }, "ledger": { "eligibility": [ [ "B" ], [ "A", "B", "C" ], [ "B" ] ], "capacities": { "A": 2, "B": 1, "C": 2 }, "form": "may-vary-across", "task": "feasibility", "domain": "source-dataset", "feasible_count": 0, "gold": "no" } }, { "id": "choice-r23-129", "english": "Assignment note GRP-0008: its members are FL-00081, FL-00082 and FL-00083. Allowed reviewer for FL-00081: only C. Allowed reviewer for FL-00082: only C. Allowed reviewer for FL-00083: A, B. Maximum uses of each reviewer in this note: A at most 2; B at most 2; C at most 1. The set GRP-0008 is exactly those three files. Give each member of GRP-0008 exactly one reviewer; the values may be the same or different.", "ainglish": "Assignment note GRP-0008: its members are FL-00081, FL-00082 and FL-00083. Allowed reviewer for FL-00081: only C. Allowed reviewer for FL-00082: only C. Allowed reviewer for FL-00083: A, B. Maximum uses of each reviewer in this note: A at most 2; B at most 2; C at most 1. The set GRP-0008 is exactly those three files. Give each member of GRP-0008 exactly one reviewer, may-vary-across(GRP-0008).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "the note does not settle it", "yes", "no" ], "answer": "no", "settlement_stratum": "may-vary-across:feasibility", "strata": { "form": "may-vary-across", "task": "feasibility", "domain": "reviewer", "set": "GRP-0008", "members": [ "FL-00081", "FL-00082", "FL-00083" ], "candidate": null, "gold_class": "no" }, "ledger": { "eligibility": [ [ "C" ], [ "C" ], [ "A", "B" ] ], "capacities": { "A": 2, "B": 2, "C": 1 }, "form": "may-vary-across", "task": "feasibility", "domain": "reviewer", "feasible_count": 0, "gold": "no" } }, { "id": "choice-r23-130", "english": "Assignment note GRP-0001: its members are BR-00011, BR-00012 and BR-00013. Allowed source dataset for BR-00011: only A. Allowed source dataset for BR-00012: A, B, C. Allowed source dataset for BR-00013: A, B, C. Maximum uses of each source dataset in this note: A at most 3; B at most 1; C at most 3. The set GRP-0001 is exactly those three backup runs. Give each member of GRP-0001 exactly one source dataset; the values may be the same or different.", "ainglish": "Assignment note GRP-0001: its members are BR-00011, BR-00012 and BR-00013. Allowed source dataset for BR-00011: only A. Allowed source dataset for BR-00012: A, B, C. Allowed source dataset for BR-00013: A, B, C. Maximum uses of each source dataset in this note: A at most 3; B at most 1; C at most 3. The set GRP-0001 is exactly those three backup runs. Give each member of GRP-0001 exactly one source dataset, may-vary-across(GRP-0001).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "no", "the note does not settle it", "yes" ], "answer": "yes", "settlement_stratum": "may-vary-across:feasibility", "strata": { "form": "may-vary-across", "task": "feasibility", "domain": "source-dataset", "set": "GRP-0001", "members": [ "BR-00011", "BR-00012", "BR-00013" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 1, "C": 3 }, "form": "may-vary-across", "task": "feasibility", "domain": "source-dataset", "feasible_count": 8, "gold": "yes" } }, { "id": "choice-r23-131", "english": "Assignment note GRP-0003: its members are WO-00031, WO-00032 and WO-00033. Allowed deadline slot for WO-00031: A, B. Allowed deadline slot for WO-00032: A, B. Allowed deadline slot for WO-00033: only B. Maximum uses of each deadline slot in this note: A at most 3; B at most 3; C at most 3. The set GRP-0003 is exactly those three work orders. Give each member of GRP-0003 exactly one deadline slot; the values may be the same or different.", "ainglish": "Assignment note GRP-0003: its members are WO-00031, WO-00032 and WO-00033. Allowed deadline slot for WO-00031: A, B. Allowed deadline slot for WO-00032: A, B. Allowed deadline slot for WO-00033: only B. Maximum uses of each deadline slot in this note: A at most 3; B at most 3; C at most 3. The set GRP-0003 is exactly those three work orders. Give each member of GRP-0003 exactly one deadline slot, may-vary-across(GRP-0003).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "the note does not settle it", "yes", "no" ], "answer": "yes", "settlement_stratum": "may-vary-across:feasibility", "strata": { "form": "may-vary-across", "task": "feasibility", "domain": "deadline", "set": "GRP-0003", "members": [ "WO-00031", "WO-00032", "WO-00033" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "B" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "form": "may-vary-across", "task": "feasibility", "domain": "deadline", "feasible_count": 4, "gold": "yes" } }, { "id": "choice-r23-132", "english": "Assignment note GRP-0006: its members are SD-00061, SD-00062 and SD-00063. Allowed font family for SD-00061: only A. Allowed font family for SD-00062: A, B, C. Allowed font family for SD-00063: only A. Maximum uses of each font family in this note: A at most 1; B at most 2; C at most 1. The set GRP-0006 is exactly those three slide decks. Give each member of GRP-0006 exactly one font family; the values may be the same or different.", "ainglish": "Assignment note GRP-0006: its members are SD-00061, SD-00062 and SD-00063. Allowed font family for SD-00061: only A. Allowed font family for SD-00062: A, B, C. Allowed font family for SD-00063: only A. Maximum uses of each font family in this note: A at most 1; B at most 2; C at most 1. The set GRP-0006 is exactly those three slide decks. Give each member of GRP-0006 exactly one font family, may-vary-across(GRP-0006).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "yes", "no", "the note does not settle it" ], "answer": "no", "settlement_stratum": "may-vary-across:feasibility", "strata": { "form": "may-vary-across", "task": "feasibility", "domain": "font-family", "set": "GRP-0006", "members": [ "SD-00061", "SD-00062", "SD-00063" ], "candidate": null, "gold_class": "no" }, "ledger": { "eligibility": [ [ "A" ], [ "A", "B", "C" ], [ "A" ] ], "capacities": { "A": 1, "B": 2, "C": 1 }, "form": "may-vary-across", "task": "feasibility", "domain": "font-family", "feasible_count": 0, "gold": "no" } }, { "id": "choice-r23-133", "english": "Assignment note GRP-0005: its members are FL-00051, FL-00052 and FL-00053. Allowed reviewer for FL-00051: only C. Allowed reviewer for FL-00052: A, C. Allowed reviewer for FL-00053: A, C. Maximum uses of each reviewer in this note: A at most 1; B at most 2; C at most 1. The set GRP-0005 is exactly those three files. Give each member of GRP-0005 exactly one reviewer; the values may be the same or different.", "ainglish": "Assignment note GRP-0005: its members are FL-00051, FL-00052 and FL-00053. Allowed reviewer for FL-00051: only C. Allowed reviewer for FL-00052: A, C. Allowed reviewer for FL-00053: A, C. Maximum uses of each reviewer in this note: A at most 1; B at most 2; C at most 1. The set GRP-0005 is exactly those three files. Give each member of GRP-0005 exactly one reviewer, may-vary-across(GRP-0005).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "no", "the note does not settle it", "yes" ], "answer": "no", "settlement_stratum": "may-vary-across:feasibility", "strata": { "form": "may-vary-across", "task": "feasibility", "domain": "reviewer", "set": "GRP-0005", "members": [ "FL-00051", "FL-00052", "FL-00053" ], "candidate": null, "gold_class": "no" }, "ledger": { "eligibility": [ [ "C" ], [ "A", "C" ], [ "A", "C" ] ], "capacities": { "A": 1, "B": 2, "C": 1 }, "form": "may-vary-across", "task": "feasibility", "domain": "reviewer", "feasible_count": 0, "gold": "no" } }, { "id": "choice-r23-134", "english": "Assignment note GRP-0005: its members are BR-00051, BR-00052 and BR-00053. Allowed source dataset for BR-00051: A, B, C. Allowed source dataset for BR-00052: only A. Allowed source dataset for BR-00053: only A. Maximum uses of each source dataset in this note: A at most 1; B at most 2; C at most 2. The set GRP-0005 is exactly those three backup runs. Give each member of GRP-0005 exactly one source dataset; the values may be the same or different.", "ainglish": "Assignment note GRP-0005: its members are BR-00051, BR-00052 and BR-00053. Allowed source dataset for BR-00051: A, B, C. Allowed source dataset for BR-00052: only A. Allowed source dataset for BR-00053: only A. Maximum uses of each source dataset in this note: A at most 1; B at most 2; C at most 2. The set GRP-0005 is exactly those three backup runs. Give each member of GRP-0005 exactly one source dataset, may-vary-across(GRP-0005).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "no", "the note does not settle it", "yes" ], "answer": "no", "settlement_stratum": "may-vary-across:feasibility", "strata": { "form": "may-vary-across", "task": "feasibility", "domain": "source-dataset", "set": "GRP-0005", "members": [ "BR-00051", "BR-00052", "BR-00053" ], "candidate": null, "gold_class": "no" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A" ], [ "A" ] ], "capacities": { "A": 1, "B": 2, "C": 2 }, "form": "may-vary-across", "task": "feasibility", "domain": "source-dataset", "feasible_count": 0, "gold": "no" } }, { "id": "choice-r23-135", "english": "Assignment note GRP-0008: its members are BR-00081, BR-00082 and BR-00083. Allowed source dataset for BR-00081: only C. Allowed source dataset for BR-00082: B, C. Allowed source dataset for BR-00083: only B. Maximum uses of each source dataset in this note: A at most 1; B at most 1; C at most 1. The set GRP-0008 is exactly those three backup runs. Give each member of GRP-0008 exactly one source dataset; the values may be the same or different.", "ainglish": "Assignment note GRP-0008: its members are BR-00081, BR-00082 and BR-00083. Allowed source dataset for BR-00081: only C. Allowed source dataset for BR-00082: B, C. Allowed source dataset for BR-00083: only B. Maximum uses of each source dataset in this note: A at most 1; B at most 1; C at most 1. The set GRP-0008 is exactly those three backup runs. Give each member of GRP-0008 exactly one source dataset, may-vary-across(GRP-0008).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "no", "the note does not settle it", "yes" ], "answer": "no", "settlement_stratum": "may-vary-across:feasibility", "strata": { "form": "may-vary-across", "task": "feasibility", "domain": "source-dataset", "set": "GRP-0008", "members": [ "BR-00081", "BR-00082", "BR-00083" ], "candidate": null, "gold_class": "no" }, "ledger": { "eligibility": [ [ "C" ], [ "B", "C" ], [ "B" ] ], "capacities": { "A": 1, "B": 1, "C": 1 }, "form": "may-vary-across", "task": "feasibility", "domain": "source-dataset", "feasible_count": 0, "gold": "no" } }, { "id": "choice-r23-136", "english": "Assignment note GRP-0005: its members are SD-00051, SD-00052 and SD-00053. Allowed font family for SD-00051: A, B, C. Allowed font family for SD-00052: only A. Allowed font family for SD-00053: only A. Maximum uses of each font family in this note: A at most 1; B at most 3; C at most 3. The set GRP-0005 is exactly those three slide decks. Give each member of GRP-0005 exactly one font family; the values may be the same or different.", "ainglish": "Assignment note GRP-0005: its members are SD-00051, SD-00052 and SD-00053. Allowed font family for SD-00051: A, B, C. Allowed font family for SD-00052: only A. Allowed font family for SD-00053: only A. Maximum uses of each font family in this note: A at most 1; B at most 3; C at most 3. The set GRP-0005 is exactly those three slide decks. Give each member of GRP-0005 exactly one font family, may-vary-across(GRP-0005).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "yes", "no", "the note does not settle it" ], "answer": "no", "settlement_stratum": "may-vary-across:feasibility", "strata": { "form": "may-vary-across", "task": "feasibility", "domain": "font-family", "set": "GRP-0005", "members": [ "SD-00051", "SD-00052", "SD-00053" ], "candidate": null, "gold_class": "no" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A" ], [ "A" ] ], "capacities": { "A": 1, "B": 3, "C": 3 }, "form": "may-vary-across", "task": "feasibility", "domain": "font-family", "feasible_count": 0, "gold": "no" } }, { "id": "choice-r23-137", "english": "Assignment note GRP-0004: its members are BR-00041, BR-00042 and BR-00043. Allowed source dataset for BR-00041: A, B. Allowed source dataset for BR-00042: A, C. Allowed source dataset for BR-00043: only A. Maximum uses of each source dataset in this note: A at most 3; B at most 2; C at most 1. The set GRP-0004 is exactly those three backup runs. Give each member of GRP-0004 exactly one source dataset; the values may be the same or different.", "ainglish": "Assignment note GRP-0004: its members are BR-00041, BR-00042 and BR-00043. Allowed source dataset for BR-00041: A, B. Allowed source dataset for BR-00042: A, C. Allowed source dataset for BR-00043: only A. Maximum uses of each source dataset in this note: A at most 3; B at most 2; C at most 1. The set GRP-0004 is exactly those three backup runs. Give each member of GRP-0004 exactly one source dataset, may-vary-across(GRP-0004).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "the note does not settle it", "yes", "no" ], "answer": "yes", "settlement_stratum": "may-vary-across:feasibility", "strata": { "form": "may-vary-across", "task": "feasibility", "domain": "source-dataset", "set": "GRP-0004", "members": [ "BR-00041", "BR-00042", "BR-00043" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "C" ], [ "A" ] ], "capacities": { "A": 3, "B": 2, "C": 1 }, "form": "may-vary-across", "task": "feasibility", "domain": "source-dataset", "feasible_count": 4, "gold": "yes" } }, { "id": "choice-r23-138", "english": "Assignment note GRP-0008: its members are SD-00081, SD-00082 and SD-00083. Allowed font family for SD-00081: only A. Allowed font family for SD-00082: A, C. Allowed font family for SD-00083: only C. Maximum uses of each font family in this note: A at most 1; B at most 3; C at most 1. The set GRP-0008 is exactly those three slide decks. Give each member of GRP-0008 exactly one font family; the values may be the same or different.", "ainglish": "Assignment note GRP-0008: its members are SD-00081, SD-00082 and SD-00083. Allowed font family for SD-00081: only A. Allowed font family for SD-00082: A, C. Allowed font family for SD-00083: only C. Maximum uses of each font family in this note: A at most 1; B at most 3; C at most 1. The set GRP-0008 is exactly those three slide decks. Give each member of GRP-0008 exactly one font family, may-vary-across(GRP-0008).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "yes", "no", "the note does not settle it" ], "answer": "no", "settlement_stratum": "may-vary-across:feasibility", "strata": { "form": "may-vary-across", "task": "feasibility", "domain": "font-family", "set": "GRP-0008", "members": [ "SD-00081", "SD-00082", "SD-00083" ], "candidate": null, "gold_class": "no" }, "ledger": { "eligibility": [ [ "A" ], [ "A", "C" ], [ "C" ] ], "capacities": { "A": 1, "B": 3, "C": 1 }, "form": "may-vary-across", "task": "feasibility", "domain": "font-family", "feasible_count": 0, "gold": "no" } }, { "id": "choice-r23-139", "english": "Assignment note GRP-0001: its members are FL-00011, FL-00012 and FL-00013. Allowed reviewer for FL-00011: A, C. Allowed reviewer for FL-00012: A, C. Allowed reviewer for FL-00013: A, C. Maximum uses of each reviewer in this note: A at most 3; B at most 3; C at most 2. The set GRP-0001 is exactly those three files. Give each member of GRP-0001 exactly one reviewer; the values may be the same or different.", "ainglish": "Assignment note GRP-0001: its members are FL-00011, FL-00012 and FL-00013. Allowed reviewer for FL-00011: A, C. Allowed reviewer for FL-00012: A, C. Allowed reviewer for FL-00013: A, C. Maximum uses of each reviewer in this note: A at most 3; B at most 3; C at most 2. The set GRP-0001 is exactly those three files. Give each member of GRP-0001 exactly one reviewer, may-vary-across(GRP-0001).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "the note does not settle it", "yes", "no" ], "answer": "yes", "settlement_stratum": "may-vary-across:feasibility", "strata": { "form": "may-vary-across", "task": "feasibility", "domain": "reviewer", "set": "GRP-0001", "members": [ "FL-00011", "FL-00012", "FL-00013" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "C" ], [ "A", "C" ], [ "A", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 2 }, "form": "may-vary-across", "task": "feasibility", "domain": "reviewer", "feasible_count": 7, "gold": "yes" } }, { "id": "choice-r23-140", "english": "Assignment note GRP-0007: its members are SD-00071, SD-00072 and SD-00073. Allowed font family for SD-00071: only C. Allowed font family for SD-00072: only C. Allowed font family for SD-00073: A, B. Maximum uses of each font family in this note: A at most 1; B at most 2; C at most 1. The set GRP-0007 is exactly those three slide decks. Give each member of GRP-0007 exactly one font family; the values may be the same or different.", "ainglish": "Assignment note GRP-0007: its members are SD-00071, SD-00072 and SD-00073. Allowed font family for SD-00071: only C. Allowed font family for SD-00072: only C. Allowed font family for SD-00073: A, B. Maximum uses of each font family in this note: A at most 1; B at most 2; C at most 1. The set GRP-0007 is exactly those three slide decks. Give each member of GRP-0007 exactly one font family, may-vary-across(GRP-0007).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "yes", "no", "the note does not settle it" ], "answer": "no", "settlement_stratum": "may-vary-across:feasibility", "strata": { "form": "may-vary-across", "task": "feasibility", "domain": "font-family", "set": "GRP-0007", "members": [ "SD-00071", "SD-00072", "SD-00073" ], "candidate": null, "gold_class": "no" }, "ledger": { "eligibility": [ [ "C" ], [ "C" ], [ "A", "B" ] ], "capacities": { "A": 1, "B": 2, "C": 1 }, "form": "may-vary-across", "task": "feasibility", "domain": "font-family", "feasible_count": 0, "gold": "no" } }, { "id": "choice-r23-141", "english": "Assignment note GRP-0004: its members are FL-00041, FL-00042 and FL-00043. Allowed reviewer for FL-00041: only B. Allowed reviewer for FL-00042: B, C. Allowed reviewer for FL-00043: only A. Maximum uses of each reviewer in this note: A at most 2; B at most 2; C at most 3. The set GRP-0004 is exactly those three files. Give each member of GRP-0004 exactly one reviewer; the values may be the same or different.", "ainglish": "Assignment note GRP-0004: its members are FL-00041, FL-00042 and FL-00043. Allowed reviewer for FL-00041: only B. Allowed reviewer for FL-00042: B, C. Allowed reviewer for FL-00043: only A. Maximum uses of each reviewer in this note: A at most 2; B at most 2; C at most 3. The set GRP-0004 is exactly those three files. Give each member of GRP-0004 exactly one reviewer, may-vary-across(GRP-0004).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "the note does not settle it", "yes", "no" ], "answer": "yes", "settlement_stratum": "may-vary-across:feasibility", "strata": { "form": "may-vary-across", "task": "feasibility", "domain": "reviewer", "set": "GRP-0004", "members": [ "FL-00041", "FL-00042", "FL-00043" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "B" ], [ "B", "C" ], [ "A" ] ], "capacities": { "A": 2, "B": 2, "C": 3 }, "form": "may-vary-across", "task": "feasibility", "domain": "reviewer", "feasible_count": 2, "gold": "yes" } }, { "id": "choice-r23-142", "english": "Assignment note GRP-0003: its members are SD-00031, SD-00032 and SD-00033. Allowed font family for SD-00031: A, B, C. Allowed font family for SD-00032: only A. Allowed font family for SD-00033: A, B, C. Maximum uses of each font family in this note: A at most 3; B at most 1; C at most 3. The set GRP-0003 is exactly those three slide decks. Give each member of GRP-0003 exactly one font family; the values may be the same or different.", "ainglish": "Assignment note GRP-0003: its members are SD-00031, SD-00032 and SD-00033. Allowed font family for SD-00031: A, B, C. Allowed font family for SD-00032: only A. Allowed font family for SD-00033: A, B, C. Maximum uses of each font family in this note: A at most 3; B at most 1; C at most 3. The set GRP-0003 is exactly those three slide decks. Give each member of GRP-0003 exactly one font family, may-vary-across(GRP-0003).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "the note does not settle it", "yes", "no" ], "answer": "yes", "settlement_stratum": "may-vary-across:feasibility", "strata": { "form": "may-vary-across", "task": "feasibility", "domain": "font-family", "set": "GRP-0003", "members": [ "SD-00031", "SD-00032", "SD-00033" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 1, "C": 3 }, "form": "may-vary-across", "task": "feasibility", "domain": "font-family", "feasible_count": 8, "gold": "yes" } }, { "id": "choice-r23-143", "english": "Assignment note GRP-0008: its members are WO-00081, WO-00082 and WO-00083. Allowed deadline slot for WO-00081: only C. Allowed deadline slot for WO-00082: only C. Allowed deadline slot for WO-00083: only B. Maximum uses of each deadline slot in this note: A at most 3; B at most 3; C at most 1. The set GRP-0008 is exactly those three work orders. Give each member of GRP-0008 exactly one deadline slot; the values may be the same or different.", "ainglish": "Assignment note GRP-0008: its members are WO-00081, WO-00082 and WO-00083. Allowed deadline slot for WO-00081: only C. Allowed deadline slot for WO-00082: only C. Allowed deadline slot for WO-00083: only B. Maximum uses of each deadline slot in this note: A at most 3; B at most 3; C at most 1. The set GRP-0008 is exactly those three work orders. Give each member of GRP-0008 exactly one deadline slot, may-vary-across(GRP-0008).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "no", "the note does not settle it", "yes" ], "answer": "no", "settlement_stratum": "may-vary-across:feasibility", "strata": { "form": "may-vary-across", "task": "feasibility", "domain": "deadline", "set": "GRP-0008", "members": [ "WO-00081", "WO-00082", "WO-00083" ], "candidate": null, "gold_class": "no" }, "ledger": { "eligibility": [ [ "C" ], [ "C" ], [ "B" ] ], "capacities": { "A": 3, "B": 3, "C": 1 }, "form": "may-vary-across", "task": "feasibility", "domain": "deadline", "feasible_count": 0, "gold": "no" } }, { "id": "choice-r23-144", "english": "Assignment note GRP-0002: its members are FL-00021, FL-00022 and FL-00023. Allowed reviewer for FL-00021: B, C. Allowed reviewer for FL-00022: only B. Allowed reviewer for FL-00023: A, B, C. Maximum uses of each reviewer in this note: A at most 3; B at most 1; C at most 2. The set GRP-0002 is exactly those three files. Give each member of GRP-0002 exactly one reviewer; the values may be the same or different.", "ainglish": "Assignment note GRP-0002: its members are FL-00021, FL-00022 and FL-00023. Allowed reviewer for FL-00021: B, C. Allowed reviewer for FL-00022: only B. Allowed reviewer for FL-00023: A, B, C. Maximum uses of each reviewer in this note: A at most 3; B at most 1; C at most 2. The set GRP-0002 is exactly those three files. Give each member of GRP-0002 exactly one reviewer, may-vary-across(GRP-0002).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "the note does not settle it", "yes", "no" ], "answer": "yes", "settlement_stratum": "may-vary-across:feasibility", "strata": { "form": "may-vary-across", "task": "feasibility", "domain": "reviewer", "set": "GRP-0002", "members": [ "FL-00021", "FL-00022", "FL-00023" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "B", "C" ], [ "B" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 1, "C": 2 }, "form": "may-vary-across", "task": "feasibility", "domain": "reviewer", "feasible_count": 2, "gold": "yes" } }, { "id": "choice-r23-145", "english": "Assignment note GRP-0002: its members are WO-00021, WO-00022 and WO-00023. Allowed deadline slot for WO-00021: only B. Allowed deadline slot for WO-00022: only C. Allowed deadline slot for WO-00023: only B. Maximum uses of each deadline slot in this note: A at most 2; B at most 2; C at most 3. The set GRP-0002 is exactly those three work orders. Give each member of GRP-0002 exactly one deadline slot; the values may be the same or different.", "ainglish": "Assignment note GRP-0002: its members are WO-00021, WO-00022 and WO-00023. Allowed deadline slot for WO-00021: only B. Allowed deadline slot for WO-00022: only C. Allowed deadline slot for WO-00023: only B. Maximum uses of each deadline slot in this note: A at most 2; B at most 2; C at most 3. The set GRP-0002 is exactly those three work orders. Give each member of GRP-0002 exactly one deadline slot, may-vary-across(GRP-0002).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "yes", "no", "the note does not settle it" ], "answer": "yes", "settlement_stratum": "may-vary-across:feasibility", "strata": { "form": "may-vary-across", "task": "feasibility", "domain": "deadline", "set": "GRP-0002", "members": [ "WO-00021", "WO-00022", "WO-00023" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "B" ], [ "C" ], [ "B" ] ], "capacities": { "A": 2, "B": 2, "C": 3 }, "form": "may-vary-across", "task": "feasibility", "domain": "deadline", "feasible_count": 1, "gold": "yes" } }, { "id": "choice-r23-146", "english": "Assignment note GRP-0003: its members are BR-00031, BR-00032 and BR-00033. Allowed source dataset for BR-00031: A, B, C. Allowed source dataset for BR-00032: A, B, C. Allowed source dataset for BR-00033: B, C. Maximum uses of each source dataset in this note: A at most 3; B at most 1; C at most 1. The set GRP-0003 is exactly those three backup runs. Give each member of GRP-0003 exactly one source dataset; the values may be the same or different.", "ainglish": "Assignment note GRP-0003: its members are BR-00031, BR-00032 and BR-00033. Allowed source dataset for BR-00031: A, B, C. Allowed source dataset for BR-00032: A, B, C. Allowed source dataset for BR-00033: B, C. Maximum uses of each source dataset in this note: A at most 3; B at most 1; C at most 1. The set GRP-0003 is exactly those three backup runs. Give each member of GRP-0003 exactly one source dataset, may-vary-across(GRP-0003).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "yes", "no", "the note does not settle it" ], "answer": "yes", "settlement_stratum": "may-vary-across:feasibility", "strata": { "form": "may-vary-across", "task": "feasibility", "domain": "source-dataset", "set": "GRP-0003", "members": [ "BR-00031", "BR-00032", "BR-00033" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "B", "C" ] ], "capacities": { "A": 3, "B": 1, "C": 1 }, "form": "may-vary-across", "task": "feasibility", "domain": "source-dataset", "feasible_count": 6, "gold": "yes" } }, { "id": "choice-r23-147", "english": "Assignment note GRP-0007: its members are FL-00071, FL-00072 and FL-00073. Allowed reviewer for FL-00071: only C. Allowed reviewer for FL-00072: only C. Allowed reviewer for FL-00073: only A. Maximum uses of each reviewer in this note: A at most 2; B at most 3; C at most 1. The set GRP-0007 is exactly those three files. Give each member of GRP-0007 exactly one reviewer; the values may be the same or different.", "ainglish": "Assignment note GRP-0007: its members are FL-00071, FL-00072 and FL-00073. Allowed reviewer for FL-00071: only C. Allowed reviewer for FL-00072: only C. Allowed reviewer for FL-00073: only A. Maximum uses of each reviewer in this note: A at most 2; B at most 3; C at most 1. The set GRP-0007 is exactly those three files. Give each member of GRP-0007 exactly one reviewer, may-vary-across(GRP-0007).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "yes", "no", "the note does not settle it" ], "answer": "no", "settlement_stratum": "may-vary-across:feasibility", "strata": { "form": "may-vary-across", "task": "feasibility", "domain": "reviewer", "set": "GRP-0007", "members": [ "FL-00071", "FL-00072", "FL-00073" ], "candidate": null, "gold_class": "no" }, "ledger": { "eligibility": [ [ "C" ], [ "C" ], [ "A" ] ], "capacities": { "A": 2, "B": 3, "C": 1 }, "form": "may-vary-across", "task": "feasibility", "domain": "reviewer", "feasible_count": 0, "gold": "no" } }, { "id": "choice-r23-148", "english": "Assignment note GRP-0007: its members are WO-00071, WO-00072 and WO-00073. Allowed deadline slot for WO-00071: A, B, C. Allowed deadline slot for WO-00072: only A. Allowed deadline slot for WO-00073: only A. Maximum uses of each deadline slot in this note: A at most 1; B at most 3; C at most 1. The set GRP-0007 is exactly those three work orders. Give each member of GRP-0007 exactly one deadline slot; the values may be the same or different.", "ainglish": "Assignment note GRP-0007: its members are WO-00071, WO-00072 and WO-00073. Allowed deadline slot for WO-00071: A, B, C. Allowed deadline slot for WO-00072: only A. Allowed deadline slot for WO-00073: only A. Maximum uses of each deadline slot in this note: A at most 1; B at most 3; C at most 1. The set GRP-0007 is exactly those three work orders. Give each member of GRP-0007 exactly one deadline slot, may-vary-across(GRP-0007).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "yes", "no", "the note does not settle it" ], "answer": "no", "settlement_stratum": "may-vary-across:feasibility", "strata": { "form": "may-vary-across", "task": "feasibility", "domain": "deadline", "set": "GRP-0007", "members": [ "WO-00071", "WO-00072", "WO-00073" ], "candidate": null, "gold_class": "no" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A" ], [ "A" ] ], "capacities": { "A": 1, "B": 3, "C": 1 }, "form": "may-vary-across", "task": "feasibility", "domain": "deadline", "feasible_count": 0, "gold": "no" } }, { "id": "choice-r23-149", "english": "Assignment note GRP-0004: its members are SD-00041, SD-00042 and SD-00043. Allowed font family for SD-00041: A, B, C. Allowed font family for SD-00042: A, B. Allowed font family for SD-00043: A, B. Maximum uses of each font family in this note: A at most 3; B at most 1; C at most 1. The set GRP-0004 is exactly those three slide decks. Give each member of GRP-0004 exactly one font family; the values may be the same or different.", "ainglish": "Assignment note GRP-0004: its members are SD-00041, SD-00042 and SD-00043. Allowed font family for SD-00041: A, B, C. Allowed font family for SD-00042: A, B. Allowed font family for SD-00043: A, B. Maximum uses of each font family in this note: A at most 3; B at most 1; C at most 1. The set GRP-0004 is exactly those three slide decks. Give each member of GRP-0004 exactly one font family, may-vary-across(GRP-0004).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "no", "the note does not settle it", "yes" ], "answer": "yes", "settlement_stratum": "may-vary-across:feasibility", "strata": { "form": "may-vary-across", "task": "feasibility", "domain": "font-family", "set": "GRP-0004", "members": [ "SD-00041", "SD-00042", "SD-00043" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 3, "B": 1, "C": 1 }, "form": "may-vary-across", "task": "feasibility", "domain": "font-family", "feasible_count": 7, "gold": "yes" } }, { "id": "choice-r23-150", "english": "Assignment note GRP-0003: its members are FL-00031, FL-00032 and FL-00033. Allowed reviewer for FL-00031: only B. Allowed reviewer for FL-00032: A, B. Allowed reviewer for FL-00033: only C. Maximum uses of each reviewer in this note: A at most 1; B at most 2; C at most 1. The set GRP-0003 is exactly those three files. Give each member of GRP-0003 exactly one reviewer; the values may be the same or different.", "ainglish": "Assignment note GRP-0003: its members are FL-00031, FL-00032 and FL-00033. Allowed reviewer for FL-00031: only B. Allowed reviewer for FL-00032: A, B. Allowed reviewer for FL-00033: only C. Maximum uses of each reviewer in this note: A at most 1; B at most 2; C at most 1. The set GRP-0003 is exactly those three files. Give each member of GRP-0003 exactly one reviewer, may-vary-across(GRP-0003).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "the note does not settle it", "yes", "no" ], "answer": "yes", "settlement_stratum": "may-vary-across:feasibility", "strata": { "form": "may-vary-across", "task": "feasibility", "domain": "reviewer", "set": "GRP-0003", "members": [ "FL-00031", "FL-00032", "FL-00033" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "B" ], [ "A", "B" ], [ "C" ] ], "capacities": { "A": 1, "B": 2, "C": 1 }, "form": "may-vary-across", "task": "feasibility", "domain": "reviewer", "feasible_count": 2, "gold": "yes" } }, { "id": "choice-r23-151", "english": "Assignment note GRP-0006: its members are BR-00061, BR-00062 and BR-00063. Allowed source dataset for BR-00061: only A. Allowed source dataset for BR-00062: A, B. Allowed source dataset for BR-00063: A, B. Maximum uses of each source dataset in this note: A at most 1; B at most 1; C at most 1. The set GRP-0006 is exactly those three backup runs. Give each member of GRP-0006 exactly one source dataset; the values may be the same or different.", "ainglish": "Assignment note GRP-0006: its members are BR-00061, BR-00062 and BR-00063. Allowed source dataset for BR-00061: only A. Allowed source dataset for BR-00062: A, B. Allowed source dataset for BR-00063: A, B. Maximum uses of each source dataset in this note: A at most 1; B at most 1; C at most 1. The set GRP-0006 is exactly those three backup runs. Give each member of GRP-0006 exactly one source dataset, may-vary-across(GRP-0006).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "no", "the note does not settle it", "yes" ], "answer": "no", "settlement_stratum": "may-vary-across:feasibility", "strata": { "form": "may-vary-across", "task": "feasibility", "domain": "source-dataset", "set": "GRP-0006", "members": [ "BR-00061", "BR-00062", "BR-00063" ], "candidate": null, "gold_class": "no" }, "ledger": { "eligibility": [ [ "A" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 1, "B": 1, "C": 1 }, "form": "may-vary-across", "task": "feasibility", "domain": "source-dataset", "feasible_count": 0, "gold": "no" } }, { "id": "choice-r23-152", "english": "Assignment note GRP-0002: its members are SD-00021, SD-00022 and SD-00023. Allowed font family for SD-00021: only B. Allowed font family for SD-00022: A, B, C. Allowed font family for SD-00023: A, B. Maximum uses of each font family in this note: A at most 1; B at most 1; C at most 3. The set GRP-0002 is exactly those three slide decks. Give each member of GRP-0002 exactly one font family; the values may be the same or different.", "ainglish": "Assignment note GRP-0002: its members are SD-00021, SD-00022 and SD-00023. Allowed font family for SD-00021: only B. Allowed font family for SD-00022: A, B, C. Allowed font family for SD-00023: A, B. Maximum uses of each font family in this note: A at most 1; B at most 1; C at most 3. The set GRP-0002 is exactly those three slide decks. Give each member of GRP-0002 exactly one font family, may-vary-across(GRP-0002).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "no", "the note does not settle it", "yes" ], "answer": "yes", "settlement_stratum": "may-vary-across:feasibility", "strata": { "form": "may-vary-across", "task": "feasibility", "domain": "font-family", "set": "GRP-0002", "members": [ "SD-00021", "SD-00022", "SD-00023" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "B" ], [ "A", "B", "C" ], [ "A", "B" ] ], "capacities": { "A": 1, "B": 1, "C": 3 }, "form": "may-vary-across", "task": "feasibility", "domain": "font-family", "feasible_count": 1, "gold": "yes" } }, { "id": "choice-r23-153", "english": "Assignment note GRP-0001: its members are SD-00011, SD-00012 and SD-00013. Allowed font family for SD-00011: only C. Allowed font family for SD-00012: A, B, C. Allowed font family for SD-00013: A, B. Maximum uses of each font family in this note: A at most 1; B at most 2; C at most 2. The set GRP-0001 is exactly those three slide decks. Give each member of GRP-0001 exactly one font family; the values may be the same or different.", "ainglish": "Assignment note GRP-0001: its members are SD-00011, SD-00012 and SD-00013. Allowed font family for SD-00011: only C. Allowed font family for SD-00012: A, B, C. Allowed font family for SD-00013: A, B. Maximum uses of each font family in this note: A at most 1; B at most 2; C at most 2. The set GRP-0001 is exactly those three slide decks. Give each member of GRP-0001 exactly one font family, may-vary-across(GRP-0001).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "the note does not settle it", "yes", "no" ], "answer": "yes", "settlement_stratum": "may-vary-across:feasibility", "strata": { "form": "may-vary-across", "task": "feasibility", "domain": "font-family", "set": "GRP-0001", "members": [ "SD-00011", "SD-00012", "SD-00013" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "C" ], [ "A", "B", "C" ], [ "A", "B" ] ], "capacities": { "A": 1, "B": 2, "C": 2 }, "form": "may-vary-across", "task": "feasibility", "domain": "font-family", "feasible_count": 5, "gold": "yes" } }, { "id": "choice-r23-154", "english": "Assignment note GRP-0005: its members are WO-00051, WO-00052 and WO-00053. Allowed deadline slot for WO-00051: only A. Allowed deadline slot for WO-00052: only A. Allowed deadline slot for WO-00053: A, B, C. Maximum uses of each deadline slot in this note: A at most 1; B at most 3; C at most 1. The set GRP-0005 is exactly those three work orders. Give each member of GRP-0005 exactly one deadline slot; the values may be the same or different.", "ainglish": "Assignment note GRP-0005: its members are WO-00051, WO-00052 and WO-00053. Allowed deadline slot for WO-00051: only A. Allowed deadline slot for WO-00052: only A. Allowed deadline slot for WO-00053: A, B, C. Maximum uses of each deadline slot in this note: A at most 1; B at most 3; C at most 1. The set GRP-0005 is exactly those three work orders. Give each member of GRP-0005 exactly one deadline slot, may-vary-across(GRP-0005).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "the note does not settle it", "yes", "no" ], "answer": "no", "settlement_stratum": "may-vary-across:feasibility", "strata": { "form": "may-vary-across", "task": "feasibility", "domain": "deadline", "set": "GRP-0005", "members": [ "WO-00051", "WO-00052", "WO-00053" ], "candidate": null, "gold_class": "no" }, "ledger": { "eligibility": [ [ "A" ], [ "A" ], [ "A", "B", "C" ] ], "capacities": { "A": 1, "B": 3, "C": 1 }, "form": "may-vary-across", "task": "feasibility", "domain": "deadline", "feasible_count": 0, "gold": "no" } }, { "id": "choice-r23-155", "english": "Assignment note GRP-0006: its members are WO-00061, WO-00062 and WO-00063. Allowed deadline slot for WO-00061: only C. Allowed deadline slot for WO-00062: only C. Allowed deadline slot for WO-00063: A, C. Maximum uses of each deadline slot in this note: A at most 1; B at most 2; C at most 1. The set GRP-0006 is exactly those three work orders. Give each member of GRP-0006 exactly one deadline slot; the values may be the same or different.", "ainglish": "Assignment note GRP-0006: its members are WO-00061, WO-00062 and WO-00063. Allowed deadline slot for WO-00061: only C. Allowed deadline slot for WO-00062: only C. Allowed deadline slot for WO-00063: A, C. Maximum uses of each deadline slot in this note: A at most 1; B at most 2; C at most 1. The set GRP-0006 is exactly those three work orders. Give each member of GRP-0006 exactly one deadline slot, may-vary-across(GRP-0006).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "yes", "no", "the note does not settle it" ], "answer": "no", "settlement_stratum": "may-vary-across:feasibility", "strata": { "form": "may-vary-across", "task": "feasibility", "domain": "deadline", "set": "GRP-0006", "members": [ "WO-00061", "WO-00062", "WO-00063" ], "candidate": null, "gold_class": "no" }, "ledger": { "eligibility": [ [ "C" ], [ "C" ], [ "A", "C" ] ], "capacities": { "A": 1, "B": 2, "C": 1 }, "form": "may-vary-across", "task": "feasibility", "domain": "deadline", "feasible_count": 0, "gold": "no" } }, { "id": "choice-r23-156", "english": "Assignment note GRP-0001: its members are WO-00011, WO-00012 and WO-00013. Allowed deadline slot for WO-00011: A, B, C. Allowed deadline slot for WO-00012: A, B, C. Allowed deadline slot for WO-00013: only C. Maximum uses of each deadline slot in this note: A at most 2; B at most 2; C at most 2. The set GRP-0001 is exactly those three work orders. Give each member of GRP-0001 exactly one deadline slot; the values may be the same or different.", "ainglish": "Assignment note GRP-0001: its members are WO-00011, WO-00012 and WO-00013. Allowed deadline slot for WO-00011: A, B, C. Allowed deadline slot for WO-00012: A, B, C. Allowed deadline slot for WO-00013: only C. Maximum uses of each deadline slot in this note: A at most 2; B at most 2; C at most 2. The set GRP-0001 is exactly those three work orders. Give each member of GRP-0001 exactly one deadline slot, may-vary-across(GRP-0001).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "yes", "no", "the note does not settle it" ], "answer": "yes", "settlement_stratum": "may-vary-across:feasibility", "strata": { "form": "may-vary-across", "task": "feasibility", "domain": "deadline", "set": "GRP-0001", "members": [ "WO-00011", "WO-00012", "WO-00013" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "C" ] ], "capacities": { "A": 2, "B": 2, "C": 2 }, "form": "may-vary-across", "task": "feasibility", "domain": "deadline", "feasible_count": 8, "gold": "yes" } }, { "id": "choice-r23-157", "english": "Assignment note GRP-0004: its members are WO-00041, WO-00042 and WO-00043. Allowed deadline slot for WO-00041: A, B, C. Allowed deadline slot for WO-00042: only B. Allowed deadline slot for WO-00043: A, B, C. Maximum uses of each deadline slot in this note: A at most 1; B at most 2; C at most 1. The set GRP-0004 is exactly those three work orders. Give each member of GRP-0004 exactly one deadline slot; the values may be the same or different.", "ainglish": "Assignment note GRP-0004: its members are WO-00041, WO-00042 and WO-00043. Allowed deadline slot for WO-00041: A, B, C. Allowed deadline slot for WO-00042: only B. Allowed deadline slot for WO-00043: A, B, C. Maximum uses of each deadline slot in this note: A at most 1; B at most 2; C at most 1. The set GRP-0004 is exactly those three work orders. Give each member of GRP-0004 exactly one deadline slot, may-vary-across(GRP-0004).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "the note does not settle it", "yes", "no" ], "answer": "yes", "settlement_stratum": "may-vary-across:feasibility", "strata": { "form": "may-vary-across", "task": "feasibility", "domain": "deadline", "set": "GRP-0004", "members": [ "WO-00041", "WO-00042", "WO-00043" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "B" ], [ "A", "B", "C" ] ], "capacities": { "A": 1, "B": 2, "C": 1 }, "form": "may-vary-across", "task": "feasibility", "domain": "deadline", "feasible_count": 6, "gold": "yes" } }, { "id": "choice-r23-158", "english": "Assignment note GRP-0006: its members are FL-00061, FL-00062 and FL-00063. Allowed reviewer for FL-00061: B, C. Allowed reviewer for FL-00062: B, C. Allowed reviewer for FL-00063: only C. Maximum uses of each reviewer in this note: A at most 1; B at most 1; C at most 1. The set GRP-0006 is exactly those three files. Give each member of GRP-0006 exactly one reviewer; the values may be the same or different.", "ainglish": "Assignment note GRP-0006: its members are FL-00061, FL-00062 and FL-00063. Allowed reviewer for FL-00061: B, C. Allowed reviewer for FL-00062: B, C. Allowed reviewer for FL-00063: only C. Maximum uses of each reviewer in this note: A at most 1; B at most 1; C at most 1. The set GRP-0006 is exactly those three files. Give each member of GRP-0006 exactly one reviewer, may-vary-across(GRP-0006).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "yes", "no", "the note does not settle it" ], "answer": "no", "settlement_stratum": "may-vary-across:feasibility", "strata": { "form": "may-vary-across", "task": "feasibility", "domain": "reviewer", "set": "GRP-0006", "members": [ "FL-00061", "FL-00062", "FL-00063" ], "candidate": null, "gold_class": "no" }, "ledger": { "eligibility": [ [ "B", "C" ], [ "B", "C" ], [ "C" ] ], "capacities": { "A": 1, "B": 1, "C": 1 }, "form": "may-vary-across", "task": "feasibility", "domain": "reviewer", "feasible_count": 0, "gold": "no" } }, { "id": "choice-r23-159", "english": "Assignment note GRP-0002: its members are BR-00021, BR-00022 and BR-00023. Allowed source dataset for BR-00021: only C. Allowed source dataset for BR-00022: B, C. Allowed source dataset for BR-00023: A, B, C. Maximum uses of each source dataset in this note: A at most 1; B at most 2; C at most 1. The set GRP-0002 is exactly those three backup runs. Give each member of GRP-0002 exactly one source dataset; the values may be the same or different.", "ainglish": "Assignment note GRP-0002: its members are BR-00021, BR-00022 and BR-00023. Allowed source dataset for BR-00021: only C. Allowed source dataset for BR-00022: B, C. Allowed source dataset for BR-00023: A, B, C. Maximum uses of each source dataset in this note: A at most 1; B at most 2; C at most 1. The set GRP-0002 is exactly those three backup runs. Give each member of GRP-0002 exactly one source dataset, may-vary-across(GRP-0002).", "question": "Is there any complete plan that satisfies every requirement in the note?", "options": [ "no", "the note does not settle it", "yes" ], "answer": "yes", "settlement_stratum": "may-vary-across:feasibility", "strata": { "form": "may-vary-across", "task": "feasibility", "domain": "source-dataset", "set": "GRP-0002", "members": [ "BR-00021", "BR-00022", "BR-00023" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "C" ], [ "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 1, "B": 2, "C": 1 }, "form": "may-vary-across", "task": "feasibility", "domain": "source-dataset", "feasible_count": 2, "gold": "yes" } }, { "id": "choice-r23-160", "english": "Assignment note GRP-0007: its members are BR-00071, BR-00072 and BR-00073. Allowed source dataset for BR-00071: only C. Allowed source dataset for BR-00072: only B. Allowed source dataset for BR-00073: A, B, C. Maximum uses of each source dataset in this note: A at most 2; B at most 2; C at most 1. The set GRP-0007 is exactly those three backup runs. Give each member of GRP-0007 exactly one source dataset; the values may be the same or different.", "ainglish": "Assignment note GRP-0007: its members are BR-00071, BR-00072 and BR-00073. Allowed source dataset for BR-00071: only C. Allowed source dataset for BR-00072: only B. Allowed source dataset for BR-00073: A, B, C. Maximum uses of each source dataset in this note: A at most 2; B at most 2; C at most 1. The set GRP-0007 is exactly those three backup runs. Give each member of GRP-0007 exactly one source dataset, may-vary-across(GRP-0007).", "question": "Consider every complete plan that satisfies all requirements in the note. Must BR-00071 and BR-00073 be given the same source dataset?", "options": [ "no complete plan satisfies the note", "the note does not settle it", "yes", "no" ], "answer": "no", "settlement_stratum": "may-vary-across:consequence", "strata": { "form": "may-vary-across", "task": "consequence", "domain": "source-dataset", "set": "GRP-0007", "members": [ "BR-00071", "BR-00072", "BR-00073" ], "candidate": null, "gold_class": "no" }, "ledger": { "eligibility": [ [ "C" ], [ "B" ], [ "A", "B", "C" ] ], "capacities": { "A": 2, "B": 2, "C": 1 }, "form": "may-vary-across", "task": "consequence", "domain": "source-dataset", "feasible_count": 2, "gold": "no" } }, { "id": "choice-r23-161", "english": "Assignment note GRP-0004: its members are FL-00041, FL-00042 and FL-00043. Allowed reviewer for FL-00041: only A. Allowed reviewer for FL-00042: A, B, C. Allowed reviewer for FL-00043: only A. Maximum uses of each reviewer in this note: A at most 2; B at most 3; C at most 1. The set GRP-0004 is exactly those three files. Give each member of GRP-0004 exactly one reviewer; the values may be the same or different.", "ainglish": "Assignment note GRP-0004: its members are FL-00041, FL-00042 and FL-00043. Allowed reviewer for FL-00041: only A. Allowed reviewer for FL-00042: A, B, C. Allowed reviewer for FL-00043: only A. Maximum uses of each reviewer in this note: A at most 2; B at most 3; C at most 1. The set GRP-0004 is exactly those three files. Give each member of GRP-0004 exactly one reviewer, may-vary-across(GRP-0004).", "question": "Consider every complete plan that satisfies all requirements in the note. Must FL-00041 and FL-00043 be given the same reviewer?", "options": [ "yes", "no", "no complete plan satisfies the note", "the note does not settle it" ], "answer": "yes", "settlement_stratum": "may-vary-across:consequence", "strata": { "form": "may-vary-across", "task": "consequence", "domain": "reviewer", "set": "GRP-0004", "members": [ "FL-00041", "FL-00042", "FL-00043" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A" ], [ "A", "B", "C" ], [ "A" ] ], "capacities": { "A": 2, "B": 3, "C": 1 }, "form": "may-vary-across", "task": "consequence", "domain": "reviewer", "feasible_count": 2, "gold": "yes" } }, { "id": "choice-r23-162", "english": "Assignment note GRP-0008: its members are BR-00081, BR-00082 and BR-00083. Allowed source dataset for BR-00081: A, B, C. Allowed source dataset for BR-00082: A, C. Allowed source dataset for BR-00083: only A. Maximum uses of each source dataset in this note: A at most 2; B at most 2; C at most 2. The set GRP-0008 is exactly those three backup runs. Give each member of GRP-0008 exactly one source dataset; the values may be the same or different.", "ainglish": "Assignment note GRP-0008: its members are BR-00081, BR-00082 and BR-00083. Allowed source dataset for BR-00081: A, B, C. Allowed source dataset for BR-00082: A, C. Allowed source dataset for BR-00083: only A. Maximum uses of each source dataset in this note: A at most 2; B at most 2; C at most 2. The set GRP-0008 is exactly those three backup runs. Give each member of GRP-0008 exactly one source dataset, may-vary-across(GRP-0008).", "question": "Consider every complete plan that satisfies all requirements in the note. Must BR-00081 and BR-00083 be given the same source dataset?", "options": [ "the note does not settle it", "yes", "no", "no complete plan satisfies the note" ], "answer": "no", "settlement_stratum": "may-vary-across:consequence", "strata": { "form": "may-vary-across", "task": "consequence", "domain": "source-dataset", "set": "GRP-0008", "members": [ "BR-00081", "BR-00082", "BR-00083" ], "candidate": null, "gold_class": "no" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "C" ], [ "A" ] ], "capacities": { "A": 2, "B": 2, "C": 2 }, "form": "may-vary-across", "task": "consequence", "domain": "source-dataset", "feasible_count": 5, "gold": "no" } }, { "id": "choice-r23-163", "english": "Assignment note GRP-0008: its members are WO-00081, WO-00082 and WO-00083. Allowed deadline slot for WO-00081: A, B, C. Allowed deadline slot for WO-00082: A, B, C. Allowed deadline slot for WO-00083: A, B. Maximum uses of each deadline slot in this note: A at most 1; B at most 2; C at most 3. The set GRP-0008 is exactly those three work orders. Give each member of GRP-0008 exactly one deadline slot; the values may be the same or different.", "ainglish": "Assignment note GRP-0008: its members are WO-00081, WO-00082 and WO-00083. Allowed deadline slot for WO-00081: A, B, C. Allowed deadline slot for WO-00082: A, B, C. Allowed deadline slot for WO-00083: A, B. Maximum uses of each deadline slot in this note: A at most 1; B at most 2; C at most 3. The set GRP-0008 is exactly those three work orders. Give each member of GRP-0008 exactly one deadline slot, may-vary-across(GRP-0008).", "question": "Consider every complete plan that satisfies all requirements in the note. Must WO-00081 and WO-00083 be given the same deadline slot?", "options": [ "no", "no complete plan satisfies the note", "the note does not settle it", "yes" ], "answer": "no", "settlement_stratum": "may-vary-across:consequence", "strata": { "form": "may-vary-across", "task": "consequence", "domain": "deadline", "set": "GRP-0008", "members": [ "WO-00081", "WO-00082", "WO-00083" ], "candidate": null, "gold_class": "no" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B" ] ], "capacities": { "A": 1, "B": 2, "C": 3 }, "form": "may-vary-across", "task": "consequence", "domain": "deadline", "feasible_count": 11, "gold": "no" } }, { "id": "choice-r23-164", "english": "Assignment note GRP-0003: its members are WO-00031, WO-00032 and WO-00033. Allowed deadline slot for WO-00031: only C. Allowed deadline slot for WO-00032: A, B, C. Allowed deadline slot for WO-00033: only C. Maximum uses of each deadline slot in this note: A at most 3; B at most 2; C at most 3. The set GRP-0003 is exactly those three work orders. Give each member of GRP-0003 exactly one deadline slot; the values may be the same or different.", "ainglish": "Assignment note GRP-0003: its members are WO-00031, WO-00032 and WO-00033. Allowed deadline slot for WO-00031: only C. Allowed deadline slot for WO-00032: A, B, C. Allowed deadline slot for WO-00033: only C. Maximum uses of each deadline slot in this note: A at most 3; B at most 2; C at most 3. The set GRP-0003 is exactly those three work orders. Give each member of GRP-0003 exactly one deadline slot, may-vary-across(GRP-0003).", "question": "Consider every complete plan that satisfies all requirements in the note. Must WO-00031 and WO-00033 be given the same deadline slot?", "options": [ "the note does not settle it", "yes", "no", "no complete plan satisfies the note" ], "answer": "yes", "settlement_stratum": "may-vary-across:consequence", "strata": { "form": "may-vary-across", "task": "consequence", "domain": "deadline", "set": "GRP-0003", "members": [ "WO-00031", "WO-00032", "WO-00033" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "C" ], [ "A", "B", "C" ], [ "C" ] ], "capacities": { "A": 3, "B": 2, "C": 3 }, "form": "may-vary-across", "task": "consequence", "domain": "deadline", "feasible_count": 3, "gold": "yes" } }, { "id": "choice-r23-165", "english": "Assignment note GRP-0003: its members are FL-00031, FL-00032 and FL-00033. Allowed reviewer for FL-00031: only B. Allowed reviewer for FL-00032: B, C. Allowed reviewer for FL-00033: only B. Maximum uses of each reviewer in this note: A at most 2; B at most 3; C at most 1. The set GRP-0003 is exactly those three files. Give each member of GRP-0003 exactly one reviewer; the values may be the same or different.", "ainglish": "Assignment note GRP-0003: its members are FL-00031, FL-00032 and FL-00033. Allowed reviewer for FL-00031: only B. Allowed reviewer for FL-00032: B, C. Allowed reviewer for FL-00033: only B. Maximum uses of each reviewer in this note: A at most 2; B at most 3; C at most 1. The set GRP-0003 is exactly those three files. Give each member of GRP-0003 exactly one reviewer, may-vary-across(GRP-0003).", "question": "Consider every complete plan that satisfies all requirements in the note. Must FL-00031 and FL-00033 be given the same reviewer?", "options": [ "yes", "no", "no complete plan satisfies the note", "the note does not settle it" ], "answer": "yes", "settlement_stratum": "may-vary-across:consequence", "strata": { "form": "may-vary-across", "task": "consequence", "domain": "reviewer", "set": "GRP-0003", "members": [ "FL-00031", "FL-00032", "FL-00033" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "B" ], [ "B", "C" ], [ "B" ] ], "capacities": { "A": 2, "B": 3, "C": 1 }, "form": "may-vary-across", "task": "consequence", "domain": "reviewer", "feasible_count": 2, "gold": "yes" } }, { "id": "choice-r23-166", "english": "Assignment note GRP-0008: its members are FL-00081, FL-00082 and FL-00083. Allowed reviewer for FL-00081: A, B, C. Allowed reviewer for FL-00082: only B. Allowed reviewer for FL-00083: only C. Maximum uses of each reviewer in this note: A at most 2; B at most 3; C at most 2. The set GRP-0008 is exactly those three files. Give each member of GRP-0008 exactly one reviewer; the values may be the same or different.", "ainglish": "Assignment note GRP-0008: its members are FL-00081, FL-00082 and FL-00083. Allowed reviewer for FL-00081: A, B, C. Allowed reviewer for FL-00082: only B. Allowed reviewer for FL-00083: only C. Maximum uses of each reviewer in this note: A at most 2; B at most 3; C at most 2. The set GRP-0008 is exactly those three files. Give each member of GRP-0008 exactly one reviewer, may-vary-across(GRP-0008).", "question": "Consider every complete plan that satisfies all requirements in the note. Must FL-00081 and FL-00083 be given the same reviewer?", "options": [ "no complete plan satisfies the note", "the note does not settle it", "yes", "no" ], "answer": "no", "settlement_stratum": "may-vary-across:consequence", "strata": { "form": "may-vary-across", "task": "consequence", "domain": "reviewer", "set": "GRP-0008", "members": [ "FL-00081", "FL-00082", "FL-00083" ], "candidate": null, "gold_class": "no" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "B" ], [ "C" ] ], "capacities": { "A": 2, "B": 3, "C": 2 }, "form": "may-vary-across", "task": "consequence", "domain": "reviewer", "feasible_count": 3, "gold": "no" } }, { "id": "choice-r23-167", "english": "Assignment note GRP-0007: its members are SD-00071, SD-00072 and SD-00073. Allowed font family for SD-00071: only B. Allowed font family for SD-00072: A, B, C. Allowed font family for SD-00073: A, B, C. Maximum uses of each font family in this note: A at most 2; B at most 1; C at most 3. The set GRP-0007 is exactly those three slide decks. Give each member of GRP-0007 exactly one font family; the values may be the same or different.", "ainglish": "Assignment note GRP-0007: its members are SD-00071, SD-00072 and SD-00073. Allowed font family for SD-00071: only B. Allowed font family for SD-00072: A, B, C. Allowed font family for SD-00073: A, B, C. Maximum uses of each font family in this note: A at most 2; B at most 1; C at most 3. The set GRP-0007 is exactly those three slide decks. Give each member of GRP-0007 exactly one font family, may-vary-across(GRP-0007).", "question": "Consider every complete plan that satisfies all requirements in the note. Must SD-00071 and SD-00073 be given the same font family?", "options": [ "the note does not settle it", "yes", "no", "no complete plan satisfies the note" ], "answer": "no", "settlement_stratum": "may-vary-across:consequence", "strata": { "form": "may-vary-across", "task": "consequence", "domain": "font-family", "set": "GRP-0007", "members": [ "SD-00071", "SD-00072", "SD-00073" ], "candidate": null, "gold_class": "no" }, "ledger": { "eligibility": [ [ "B" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 2, "B": 1, "C": 3 }, "form": "may-vary-across", "task": "consequence", "domain": "font-family", "feasible_count": 4, "gold": "no" } }, { "id": "choice-r23-168", "english": "Assignment note GRP-0003: its members are SD-00031, SD-00032 and SD-00033. Allowed font family for SD-00031: only A. Allowed font family for SD-00032: A, C. Allowed font family for SD-00033: only A. Maximum uses of each font family in this note: A at most 3; B at most 3; C at most 1. The set GRP-0003 is exactly those three slide decks. Give each member of GRP-0003 exactly one font family; the values may be the same or different.", "ainglish": "Assignment note GRP-0003: its members are SD-00031, SD-00032 and SD-00033. Allowed font family for SD-00031: only A. Allowed font family for SD-00032: A, C. Allowed font family for SD-00033: only A. Maximum uses of each font family in this note: A at most 3; B at most 3; C at most 1. The set GRP-0003 is exactly those three slide decks. Give each member of GRP-0003 exactly one font family, may-vary-across(GRP-0003).", "question": "Consider every complete plan that satisfies all requirements in the note. Must SD-00031 and SD-00033 be given the same font family?", "options": [ "yes", "no", "no complete plan satisfies the note", "the note does not settle it" ], "answer": "yes", "settlement_stratum": "may-vary-across:consequence", "strata": { "form": "may-vary-across", "task": "consequence", "domain": "font-family", "set": "GRP-0003", "members": [ "SD-00031", "SD-00032", "SD-00033" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A" ], [ "A", "C" ], [ "A" ] ], "capacities": { "A": 3, "B": 3, "C": 1 }, "form": "may-vary-across", "task": "consequence", "domain": "font-family", "feasible_count": 2, "gold": "yes" } }, { "id": "choice-r23-169", "english": "Assignment note GRP-0002: its members are BR-00021, BR-00022 and BR-00023. Allowed source dataset for BR-00021: only C. Allowed source dataset for BR-00022: A, B, C. Allowed source dataset for BR-00023: only C. Maximum uses of each source dataset in this note: A at most 1; B at most 3; C at most 3. The set GRP-0002 is exactly those three backup runs. Give each member of GRP-0002 exactly one source dataset; the values may be the same or different.", "ainglish": "Assignment note GRP-0002: its members are BR-00021, BR-00022 and BR-00023. Allowed source dataset for BR-00021: only C. Allowed source dataset for BR-00022: A, B, C. Allowed source dataset for BR-00023: only C. Maximum uses of each source dataset in this note: A at most 1; B at most 3; C at most 3. The set GRP-0002 is exactly those three backup runs. Give each member of GRP-0002 exactly one source dataset, may-vary-across(GRP-0002).", "question": "Consider every complete plan that satisfies all requirements in the note. Must BR-00021 and BR-00023 be given the same source dataset?", "options": [ "no", "no complete plan satisfies the note", "the note does not settle it", "yes" ], "answer": "yes", "settlement_stratum": "may-vary-across:consequence", "strata": { "form": "may-vary-across", "task": "consequence", "domain": "source-dataset", "set": "GRP-0002", "members": [ "BR-00021", "BR-00022", "BR-00023" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "C" ], [ "A", "B", "C" ], [ "C" ] ], "capacities": { "A": 1, "B": 3, "C": 3 }, "form": "may-vary-across", "task": "consequence", "domain": "source-dataset", "feasible_count": 3, "gold": "yes" } }, { "id": "choice-r23-170", "english": "Assignment note GRP-0007: its members are WO-00071, WO-00072 and WO-00073. Allowed deadline slot for WO-00071: only B. Allowed deadline slot for WO-00072: A, B, C. Allowed deadline slot for WO-00073: A, B. Maximum uses of each deadline slot in this note: A at most 2; B at most 2; C at most 1. The set GRP-0007 is exactly those three work orders. Give each member of GRP-0007 exactly one deadline slot; the values may be the same or different.", "ainglish": "Assignment note GRP-0007: its members are WO-00071, WO-00072 and WO-00073. Allowed deadline slot for WO-00071: only B. Allowed deadline slot for WO-00072: A, B, C. Allowed deadline slot for WO-00073: A, B. Maximum uses of each deadline slot in this note: A at most 2; B at most 2; C at most 1. The set GRP-0007 is exactly those three work orders. Give each member of GRP-0007 exactly one deadline slot, may-vary-across(GRP-0007).", "question": "Consider every complete plan that satisfies all requirements in the note. Must WO-00071 and WO-00073 be given the same deadline slot?", "options": [ "the note does not settle it", "yes", "no", "no complete plan satisfies the note" ], "answer": "no", "settlement_stratum": "may-vary-across:consequence", "strata": { "form": "may-vary-across", "task": "consequence", "domain": "deadline", "set": "GRP-0007", "members": [ "WO-00071", "WO-00072", "WO-00073" ], "candidate": null, "gold_class": "no" }, "ledger": { "eligibility": [ [ "B" ], [ "A", "B", "C" ], [ "A", "B" ] ], "capacities": { "A": 2, "B": 2, "C": 1 }, "form": "may-vary-across", "task": "consequence", "domain": "deadline", "feasible_count": 5, "gold": "no" } }, { "id": "choice-r23-171", "english": "Assignment note GRP-0004: its members are BR-00041, BR-00042 and BR-00043. Allowed source dataset for BR-00041: only B. Allowed source dataset for BR-00042: only C. Allowed source dataset for BR-00043: only B. Maximum uses of each source dataset in this note: A at most 2; B at most 2; C at most 3. The set GRP-0004 is exactly those three backup runs. Give each member of GRP-0004 exactly one source dataset; the values may be the same or different.", "ainglish": "Assignment note GRP-0004: its members are BR-00041, BR-00042 and BR-00043. Allowed source dataset for BR-00041: only B. Allowed source dataset for BR-00042: only C. Allowed source dataset for BR-00043: only B. Maximum uses of each source dataset in this note: A at most 2; B at most 2; C at most 3. The set GRP-0004 is exactly those three backup runs. Give each member of GRP-0004 exactly one source dataset, may-vary-across(GRP-0004).", "question": "Consider every complete plan that satisfies all requirements in the note. Must BR-00041 and BR-00043 be given the same source dataset?", "options": [ "no", "no complete plan satisfies the note", "the note does not settle it", "yes" ], "answer": "yes", "settlement_stratum": "may-vary-across:consequence", "strata": { "form": "may-vary-across", "task": "consequence", "domain": "source-dataset", "set": "GRP-0004", "members": [ "BR-00041", "BR-00042", "BR-00043" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "B" ], [ "C" ], [ "B" ] ], "capacities": { "A": 2, "B": 2, "C": 3 }, "form": "may-vary-across", "task": "consequence", "domain": "source-dataset", "feasible_count": 1, "gold": "yes" } }, { "id": "choice-r23-172", "english": "Assignment note GRP-0003: its members are BR-00031, BR-00032 and BR-00033. Allowed source dataset for BR-00031: A, B. Allowed source dataset for BR-00032: only A. Allowed source dataset for BR-00033: A, B. Maximum uses of each source dataset in this note: A at most 1; B at most 2; C at most 2. The set GRP-0003 is exactly those three backup runs. Give each member of GRP-0003 exactly one source dataset; the values may be the same or different.", "ainglish": "Assignment note GRP-0003: its members are BR-00031, BR-00032 and BR-00033. Allowed source dataset for BR-00031: A, B. Allowed source dataset for BR-00032: only A. Allowed source dataset for BR-00033: A, B. Maximum uses of each source dataset in this note: A at most 1; B at most 2; C at most 2. The set GRP-0003 is exactly those three backup runs. Give each member of GRP-0003 exactly one source dataset, may-vary-across(GRP-0003).", "question": "Consider every complete plan that satisfies all requirements in the note. Must BR-00031 and BR-00033 be given the same source dataset?", "options": [ "the note does not settle it", "yes", "no", "no complete plan satisfies the note" ], "answer": "yes", "settlement_stratum": "may-vary-across:consequence", "strata": { "form": "may-vary-across", "task": "consequence", "domain": "source-dataset", "set": "GRP-0003", "members": [ "BR-00031", "BR-00032", "BR-00033" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A", "B" ], [ "A" ], [ "A", "B" ] ], "capacities": { "A": 1, "B": 2, "C": 2 }, "form": "may-vary-across", "task": "consequence", "domain": "source-dataset", "feasible_count": 1, "gold": "yes" } }, { "id": "choice-r23-173", "english": "Assignment note GRP-0004: its members are SD-00041, SD-00042 and SD-00043. Allowed font family for SD-00041: only B. Allowed font family for SD-00042: only B. Allowed font family for SD-00043: only B. Maximum uses of each font family in this note: A at most 1; B at most 3; C at most 1. The set GRP-0004 is exactly those three slide decks. Give each member of GRP-0004 exactly one font family; the values may be the same or different.", "ainglish": "Assignment note GRP-0004: its members are SD-00041, SD-00042 and SD-00043. Allowed font family for SD-00041: only B. Allowed font family for SD-00042: only B. Allowed font family for SD-00043: only B. Maximum uses of each font family in this note: A at most 1; B at most 3; C at most 1. The set GRP-0004 is exactly those three slide decks. Give each member of GRP-0004 exactly one font family, may-vary-across(GRP-0004).", "question": "Consider every complete plan that satisfies all requirements in the note. Must SD-00041 and SD-00043 be given the same font family?", "options": [ "no complete plan satisfies the note", "the note does not settle it", "yes", "no" ], "answer": "yes", "settlement_stratum": "may-vary-across:consequence", "strata": { "form": "may-vary-across", "task": "consequence", "domain": "font-family", "set": "GRP-0004", "members": [ "SD-00041", "SD-00042", "SD-00043" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "B" ], [ "B" ], [ "B" ] ], "capacities": { "A": 1, "B": 3, "C": 1 }, "form": "may-vary-across", "task": "consequence", "domain": "font-family", "feasible_count": 1, "gold": "yes" } }, { "id": "choice-r23-174", "english": "Assignment note GRP-0006: its members are SD-00061, SD-00062 and SD-00063. Allowed font family for SD-00061: only C. Allowed font family for SD-00062: A, B, C. Allowed font family for SD-00063: B, C. Maximum uses of each font family in this note: A at most 2; B at most 2; C at most 2. The set GRP-0006 is exactly those three slide decks. Give each member of GRP-0006 exactly one font family; the values may be the same or different.", "ainglish": "Assignment note GRP-0006: its members are SD-00061, SD-00062 and SD-00063. Allowed font family for SD-00061: only C. Allowed font family for SD-00062: A, B, C. Allowed font family for SD-00063: B, C. Maximum uses of each font family in this note: A at most 2; B at most 2; C at most 2. The set GRP-0006 is exactly those three slide decks. Give each member of GRP-0006 exactly one font family, may-vary-across(GRP-0006).", "question": "Consider every complete plan that satisfies all requirements in the note. Must SD-00061 and SD-00063 be given the same font family?", "options": [ "the note does not settle it", "yes", "no", "no complete plan satisfies the note" ], "answer": "no", "settlement_stratum": "may-vary-across:consequence", "strata": { "form": "may-vary-across", "task": "consequence", "domain": "font-family", "set": "GRP-0006", "members": [ "SD-00061", "SD-00062", "SD-00063" ], "candidate": null, "gold_class": "no" }, "ledger": { "eligibility": [ [ "C" ], [ "A", "B", "C" ], [ "B", "C" ] ], "capacities": { "A": 2, "B": 2, "C": 2 }, "form": "may-vary-across", "task": "consequence", "domain": "font-family", "feasible_count": 5, "gold": "no" } }, { "id": "choice-r23-175", "english": "Assignment note GRP-0001: its members are FL-00011, FL-00012 and FL-00013. Allowed reviewer for FL-00011: only A. Allowed reviewer for FL-00012: A, B. Allowed reviewer for FL-00013: only A. Maximum uses of each reviewer in this note: A at most 3; B at most 3; C at most 1. The set GRP-0001 is exactly those three files. Give each member of GRP-0001 exactly one reviewer; the values may be the same or different.", "ainglish": "Assignment note GRP-0001: its members are FL-00011, FL-00012 and FL-00013. Allowed reviewer for FL-00011: only A. Allowed reviewer for FL-00012: A, B. Allowed reviewer for FL-00013: only A. Maximum uses of each reviewer in this note: A at most 3; B at most 3; C at most 1. The set GRP-0001 is exactly those three files. Give each member of GRP-0001 exactly one reviewer, may-vary-across(GRP-0001).", "question": "Consider every complete plan that satisfies all requirements in the note. Must FL-00011 and FL-00013 be given the same reviewer?", "options": [ "no", "no complete plan satisfies the note", "the note does not settle it", "yes" ], "answer": "yes", "settlement_stratum": "may-vary-across:consequence", "strata": { "form": "may-vary-across", "task": "consequence", "domain": "reviewer", "set": "GRP-0001", "members": [ "FL-00011", "FL-00012", "FL-00013" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A" ], [ "A", "B" ], [ "A" ] ], "capacities": { "A": 3, "B": 3, "C": 1 }, "form": "may-vary-across", "task": "consequence", "domain": "reviewer", "feasible_count": 2, "gold": "yes" } }, { "id": "choice-r23-176", "english": "Assignment note GRP-0006: its members are FL-00061, FL-00062 and FL-00063. Allowed reviewer for FL-00061: A, B, C. Allowed reviewer for FL-00062: A, B, C. Allowed reviewer for FL-00063: A, B, C. Maximum uses of each reviewer in this note: A at most 1; B at most 3; C at most 3. The set GRP-0006 is exactly those three files. Give each member of GRP-0006 exactly one reviewer; the values may be the same or different.", "ainglish": "Assignment note GRP-0006: its members are FL-00061, FL-00062 and FL-00063. Allowed reviewer for FL-00061: A, B, C. Allowed reviewer for FL-00062: A, B, C. Allowed reviewer for FL-00063: A, B, C. Maximum uses of each reviewer in this note: A at most 1; B at most 3; C at most 3. The set GRP-0006 is exactly those three files. Give each member of GRP-0006 exactly one reviewer, may-vary-across(GRP-0006).", "question": "Consider every complete plan that satisfies all requirements in the note. Must FL-00061 and FL-00063 be given the same reviewer?", "options": [ "no complete plan satisfies the note", "the note does not settle it", "yes", "no" ], "answer": "no", "settlement_stratum": "may-vary-across:consequence", "strata": { "form": "may-vary-across", "task": "consequence", "domain": "reviewer", "set": "GRP-0006", "members": [ "FL-00061", "FL-00062", "FL-00063" ], "candidate": null, "gold_class": "no" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 1, "B": 3, "C": 3 }, "form": "may-vary-across", "task": "consequence", "domain": "reviewer", "feasible_count": 20, "gold": "no" } }, { "id": "choice-r23-177", "english": "Assignment note GRP-0001: its members are SD-00011, SD-00012 and SD-00013. Allowed font family for SD-00011: only C. Allowed font family for SD-00012: A, C. Allowed font family for SD-00013: only C. Maximum uses of each font family in this note: A at most 1; B at most 3; C at most 2. The set GRP-0001 is exactly those three slide decks. Give each member of GRP-0001 exactly one font family; the values may be the same or different.", "ainglish": "Assignment note GRP-0001: its members are SD-00011, SD-00012 and SD-00013. Allowed font family for SD-00011: only C. Allowed font family for SD-00012: A, C. Allowed font family for SD-00013: only C. Maximum uses of each font family in this note: A at most 1; B at most 3; C at most 2. The set GRP-0001 is exactly those three slide decks. Give each member of GRP-0001 exactly one font family, may-vary-across(GRP-0001).", "question": "Consider every complete plan that satisfies all requirements in the note. Must SD-00011 and SD-00013 be given the same font family?", "options": [ "yes", "no", "no complete plan satisfies the note", "the note does not settle it" ], "answer": "yes", "settlement_stratum": "may-vary-across:consequence", "strata": { "form": "may-vary-across", "task": "consequence", "domain": "font-family", "set": "GRP-0001", "members": [ "SD-00011", "SD-00012", "SD-00013" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "C" ], [ "A", "C" ], [ "C" ] ], "capacities": { "A": 1, "B": 3, "C": 2 }, "form": "may-vary-across", "task": "consequence", "domain": "font-family", "feasible_count": 1, "gold": "yes" } }, { "id": "choice-r23-178", "english": "Assignment note GRP-0008: its members are SD-00081, SD-00082 and SD-00083. Allowed font family for SD-00081: A, B, C. Allowed font family for SD-00082: A, C. Allowed font family for SD-00083: A, B, C. Maximum uses of each font family in this note: A at most 3; B at most 3; C at most 2. The set GRP-0008 is exactly those three slide decks. Give each member of GRP-0008 exactly one font family; the values may be the same or different.", "ainglish": "Assignment note GRP-0008: its members are SD-00081, SD-00082 and SD-00083. Allowed font family for SD-00081: A, B, C. Allowed font family for SD-00082: A, C. Allowed font family for SD-00083: A, B, C. Maximum uses of each font family in this note: A at most 3; B at most 3; C at most 2. The set GRP-0008 is exactly those three slide decks. Give each member of GRP-0008 exactly one font family, may-vary-across(GRP-0008).", "question": "Consider every complete plan that satisfies all requirements in the note. Must SD-00081 and SD-00083 be given the same font family?", "options": [ "yes", "no", "no complete plan satisfies the note", "the note does not settle it" ], "answer": "no", "settlement_stratum": "may-vary-across:consequence", "strata": { "form": "may-vary-across", "task": "consequence", "domain": "font-family", "set": "GRP-0008", "members": [ "SD-00081", "SD-00082", "SD-00083" ], "candidate": null, "gold_class": "no" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 2 }, "form": "may-vary-across", "task": "consequence", "domain": "font-family", "feasible_count": 17, "gold": "no" } }, { "id": "choice-r23-179", "english": "Assignment note GRP-0005: its members are WO-00051, WO-00052 and WO-00053. Allowed deadline slot for WO-00051: only B. Allowed deadline slot for WO-00052: B, C. Allowed deadline slot for WO-00053: only C. Maximum uses of each deadline slot in this note: A at most 2; B at most 1; C at most 3. The set GRP-0005 is exactly those three work orders. Give each member of GRP-0005 exactly one deadline slot; the values may be the same or different.", "ainglish": "Assignment note GRP-0005: its members are WO-00051, WO-00052 and WO-00053. Allowed deadline slot for WO-00051: only B. Allowed deadline slot for WO-00052: B, C. Allowed deadline slot for WO-00053: only C. Maximum uses of each deadline slot in this note: A at most 2; B at most 1; C at most 3. The set GRP-0005 is exactly those three work orders. Give each member of GRP-0005 exactly one deadline slot, may-vary-across(GRP-0005).", "question": "Consider every complete plan that satisfies all requirements in the note. Must WO-00051 and WO-00053 be given the same deadline slot?", "options": [ "yes", "no", "no complete plan satisfies the note", "the note does not settle it" ], "answer": "no", "settlement_stratum": "may-vary-across:consequence", "strata": { "form": "may-vary-across", "task": "consequence", "domain": "deadline", "set": "GRP-0005", "members": [ "WO-00051", "WO-00052", "WO-00053" ], "candidate": null, "gold_class": "no" }, "ledger": { "eligibility": [ [ "B" ], [ "B", "C" ], [ "C" ] ], "capacities": { "A": 2, "B": 1, "C": 3 }, "form": "may-vary-across", "task": "consequence", "domain": "deadline", "feasible_count": 1, "gold": "no" } }, { "id": "choice-r23-180", "english": "Assignment note GRP-0005: its members are BR-00051, BR-00052 and BR-00053. Allowed source dataset for BR-00051: only B. Allowed source dataset for BR-00052: A, C. Allowed source dataset for BR-00053: only C. Maximum uses of each source dataset in this note: A at most 1; B at most 1; C at most 2. The set GRP-0005 is exactly those three backup runs. Give each member of GRP-0005 exactly one source dataset; the values may be the same or different.", "ainglish": "Assignment note GRP-0005: its members are BR-00051, BR-00052 and BR-00053. Allowed source dataset for BR-00051: only B. Allowed source dataset for BR-00052: A, C. Allowed source dataset for BR-00053: only C. Maximum uses of each source dataset in this note: A at most 1; B at most 1; C at most 2. The set GRP-0005 is exactly those three backup runs. Give each member of GRP-0005 exactly one source dataset, may-vary-across(GRP-0005).", "question": "Consider every complete plan that satisfies all requirements in the note. Must BR-00051 and BR-00053 be given the same source dataset?", "options": [ "no complete plan satisfies the note", "the note does not settle it", "yes", "no" ], "answer": "no", "settlement_stratum": "may-vary-across:consequence", "strata": { "form": "may-vary-across", "task": "consequence", "domain": "source-dataset", "set": "GRP-0005", "members": [ "BR-00051", "BR-00052", "BR-00053" ], "candidate": null, "gold_class": "no" }, "ledger": { "eligibility": [ [ "B" ], [ "A", "C" ], [ "C" ] ], "capacities": { "A": 1, "B": 1, "C": 2 }, "form": "may-vary-across", "task": "consequence", "domain": "source-dataset", "feasible_count": 2, "gold": "no" } }, { "id": "choice-r23-181", "english": "Assignment note GRP-0001: its members are BR-00011, BR-00012 and BR-00013. Allowed source dataset for BR-00011: only B. Allowed source dataset for BR-00012: B, C. Allowed source dataset for BR-00013: only B. Maximum uses of each source dataset in this note: A at most 3; B at most 3; C at most 2. The set GRP-0001 is exactly those three backup runs. Give each member of GRP-0001 exactly one source dataset; the values may be the same or different.", "ainglish": "Assignment note GRP-0001: its members are BR-00011, BR-00012 and BR-00013. Allowed source dataset for BR-00011: only B. Allowed source dataset for BR-00012: B, C. Allowed source dataset for BR-00013: only B. Maximum uses of each source dataset in this note: A at most 3; B at most 3; C at most 2. The set GRP-0001 is exactly those three backup runs. Give each member of GRP-0001 exactly one source dataset, may-vary-across(GRP-0001).", "question": "Consider every complete plan that satisfies all requirements in the note. Must BR-00011 and BR-00013 be given the same source dataset?", "options": [ "the note does not settle it", "yes", "no", "no complete plan satisfies the note" ], "answer": "yes", "settlement_stratum": "may-vary-across:consequence", "strata": { "form": "may-vary-across", "task": "consequence", "domain": "source-dataset", "set": "GRP-0001", "members": [ "BR-00011", "BR-00012", "BR-00013" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "B" ], [ "B", "C" ], [ "B" ] ], "capacities": { "A": 3, "B": 3, "C": 2 }, "form": "may-vary-across", "task": "consequence", "domain": "source-dataset", "feasible_count": 2, "gold": "yes" } }, { "id": "choice-r23-182", "english": "Assignment note GRP-0002: its members are FL-00021, FL-00022 and FL-00023. Allowed reviewer for FL-00021: only B. Allowed reviewer for FL-00022: A, B, C. Allowed reviewer for FL-00023: only B. Maximum uses of each reviewer in this note: A at most 2; B at most 2; C at most 2. The set GRP-0002 is exactly those three files. Give each member of GRP-0002 exactly one reviewer; the values may be the same or different.", "ainglish": "Assignment note GRP-0002: its members are FL-00021, FL-00022 and FL-00023. Allowed reviewer for FL-00021: only B. Allowed reviewer for FL-00022: A, B, C. Allowed reviewer for FL-00023: only B. Maximum uses of each reviewer in this note: A at most 2; B at most 2; C at most 2. The set GRP-0002 is exactly those three files. Give each member of GRP-0002 exactly one reviewer, may-vary-across(GRP-0002).", "question": "Consider every complete plan that satisfies all requirements in the note. Must FL-00021 and FL-00023 be given the same reviewer?", "options": [ "the note does not settle it", "yes", "no", "no complete plan satisfies the note" ], "answer": "yes", "settlement_stratum": "may-vary-across:consequence", "strata": { "form": "may-vary-across", "task": "consequence", "domain": "reviewer", "set": "GRP-0002", "members": [ "FL-00021", "FL-00022", "FL-00023" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "B" ], [ "A", "B", "C" ], [ "B" ] ], "capacities": { "A": 2, "B": 2, "C": 2 }, "form": "may-vary-across", "task": "consequence", "domain": "reviewer", "feasible_count": 2, "gold": "yes" } }, { "id": "choice-r23-183", "english": "Assignment note GRP-0006: its members are WO-00061, WO-00062 and WO-00063. Allowed deadline slot for WO-00061: A, B. Allowed deadline slot for WO-00062: A, B. Allowed deadline slot for WO-00063: A, C. Maximum uses of each deadline slot in this note: A at most 2; B at most 2; C at most 1. The set GRP-0006 is exactly those three work orders. Give each member of GRP-0006 exactly one deadline slot; the values may be the same or different.", "ainglish": "Assignment note GRP-0006: its members are WO-00061, WO-00062 and WO-00063. Allowed deadline slot for WO-00061: A, B. Allowed deadline slot for WO-00062: A, B. Allowed deadline slot for WO-00063: A, C. Maximum uses of each deadline slot in this note: A at most 2; B at most 2; C at most 1. The set GRP-0006 is exactly those three work orders. Give each member of GRP-0006 exactly one deadline slot, may-vary-across(GRP-0006).", "question": "Consider every complete plan that satisfies all requirements in the note. Must WO-00061 and WO-00063 be given the same deadline slot?", "options": [ "yes", "no", "no complete plan satisfies the note", "the note does not settle it" ], "answer": "no", "settlement_stratum": "may-vary-across:consequence", "strata": { "form": "may-vary-across", "task": "consequence", "domain": "deadline", "set": "GRP-0006", "members": [ "WO-00061", "WO-00062", "WO-00063" ], "candidate": null, "gold_class": "no" }, "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "C" ] ], "capacities": { "A": 2, "B": 2, "C": 1 }, "form": "may-vary-across", "task": "consequence", "domain": "deadline", "feasible_count": 7, "gold": "no" } }, { "id": "choice-r23-184", "english": "Assignment note GRP-0007: its members are FL-00071, FL-00072 and FL-00073. Allowed reviewer for FL-00071: A, B, C. Allowed reviewer for FL-00072: only A. Allowed reviewer for FL-00073: A, C. Maximum uses of each reviewer in this note: A at most 1; B at most 1; C at most 1. The set GRP-0007 is exactly those three files. Give each member of GRP-0007 exactly one reviewer; the values may be the same or different.", "ainglish": "Assignment note GRP-0007: its members are FL-00071, FL-00072 and FL-00073. Allowed reviewer for FL-00071: A, B, C. Allowed reviewer for FL-00072: only A. Allowed reviewer for FL-00073: A, C. Maximum uses of each reviewer in this note: A at most 1; B at most 1; C at most 1. The set GRP-0007 is exactly those three files. Give each member of GRP-0007 exactly one reviewer, may-vary-across(GRP-0007).", "question": "Consider every complete plan that satisfies all requirements in the note. Must FL-00071 and FL-00073 be given the same reviewer?", "options": [ "no", "no complete plan satisfies the note", "the note does not settle it", "yes" ], "answer": "no", "settlement_stratum": "may-vary-across:consequence", "strata": { "form": "may-vary-across", "task": "consequence", "domain": "reviewer", "set": "GRP-0007", "members": [ "FL-00071", "FL-00072", "FL-00073" ], "candidate": null, "gold_class": "no" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A" ], [ "A", "C" ] ], "capacities": { "A": 1, "B": 1, "C": 1 }, "form": "may-vary-across", "task": "consequence", "domain": "reviewer", "feasible_count": 1, "gold": "no" } }, { "id": "choice-r23-185", "english": "Assignment note GRP-0001: its members are WO-00011, WO-00012 and WO-00013. Allowed deadline slot for WO-00011: only B. Allowed deadline slot for WO-00012: only C. Allowed deadline slot for WO-00013: only B. Maximum uses of each deadline slot in this note: A at most 2; B at most 2; C at most 2. The set GRP-0001 is exactly those three work orders. Give each member of GRP-0001 exactly one deadline slot; the values may be the same or different.", "ainglish": "Assignment note GRP-0001: its members are WO-00011, WO-00012 and WO-00013. Allowed deadline slot for WO-00011: only B. Allowed deadline slot for WO-00012: only C. Allowed deadline slot for WO-00013: only B. Maximum uses of each deadline slot in this note: A at most 2; B at most 2; C at most 2. The set GRP-0001 is exactly those three work orders. Give each member of GRP-0001 exactly one deadline slot, may-vary-across(GRP-0001).", "question": "Consider every complete plan that satisfies all requirements in the note. Must WO-00011 and WO-00013 be given the same deadline slot?", "options": [ "no", "no complete plan satisfies the note", "the note does not settle it", "yes" ], "answer": "yes", "settlement_stratum": "may-vary-across:consequence", "strata": { "form": "may-vary-across", "task": "consequence", "domain": "deadline", "set": "GRP-0001", "members": [ "WO-00011", "WO-00012", "WO-00013" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "B" ], [ "C" ], [ "B" ] ], "capacities": { "A": 2, "B": 2, "C": 2 }, "form": "may-vary-across", "task": "consequence", "domain": "deadline", "feasible_count": 1, "gold": "yes" } }, { "id": "choice-r23-186", "english": "Assignment note GRP-0006: its members are BR-00061, BR-00062 and BR-00063. Allowed source dataset for BR-00061: A, B, C. Allowed source dataset for BR-00062: A, B, C. Allowed source dataset for BR-00063: only A. Maximum uses of each source dataset in this note: A at most 1; B at most 3; C at most 2. The set GRP-0006 is exactly those three backup runs. Give each member of GRP-0006 exactly one source dataset; the values may be the same or different.", "ainglish": "Assignment note GRP-0006: its members are BR-00061, BR-00062 and BR-00063. Allowed source dataset for BR-00061: A, B, C. Allowed source dataset for BR-00062: A, B, C. Allowed source dataset for BR-00063: only A. Maximum uses of each source dataset in this note: A at most 1; B at most 3; C at most 2. The set GRP-0006 is exactly those three backup runs. Give each member of GRP-0006 exactly one source dataset, may-vary-across(GRP-0006).", "question": "Consider every complete plan that satisfies all requirements in the note. Must BR-00061 and BR-00063 be given the same source dataset?", "options": [ "yes", "no", "no complete plan satisfies the note", "the note does not settle it" ], "answer": "no", "settlement_stratum": "may-vary-across:consequence", "strata": { "form": "may-vary-across", "task": "consequence", "domain": "source-dataset", "set": "GRP-0006", "members": [ "BR-00061", "BR-00062", "BR-00063" ], "candidate": null, "gold_class": "no" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A" ] ], "capacities": { "A": 1, "B": 3, "C": 2 }, "form": "may-vary-across", "task": "consequence", "domain": "source-dataset", "feasible_count": 4, "gold": "no" } }, { "id": "choice-r23-187", "english": "Assignment note GRP-0004: its members are WO-00041, WO-00042 and WO-00043. Allowed deadline slot for WO-00041: only B. Allowed deadline slot for WO-00042: A, B. Allowed deadline slot for WO-00043: only B. Maximum uses of each deadline slot in this note: A at most 2; B at most 3; C at most 3. The set GRP-0004 is exactly those three work orders. Give each member of GRP-0004 exactly one deadline slot; the values may be the same or different.", "ainglish": "Assignment note GRP-0004: its members are WO-00041, WO-00042 and WO-00043. Allowed deadline slot for WO-00041: only B. Allowed deadline slot for WO-00042: A, B. Allowed deadline slot for WO-00043: only B. Maximum uses of each deadline slot in this note: A at most 2; B at most 3; C at most 3. The set GRP-0004 is exactly those three work orders. Give each member of GRP-0004 exactly one deadline slot, may-vary-across(GRP-0004).", "question": "Consider every complete plan that satisfies all requirements in the note. Must WO-00041 and WO-00043 be given the same deadline slot?", "options": [ "the note does not settle it", "yes", "no", "no complete plan satisfies the note" ], "answer": "yes", "settlement_stratum": "may-vary-across:consequence", "strata": { "form": "may-vary-across", "task": "consequence", "domain": "deadline", "set": "GRP-0004", "members": [ "WO-00041", "WO-00042", "WO-00043" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "B" ], [ "A", "B" ], [ "B" ] ], "capacities": { "A": 2, "B": 3, "C": 3 }, "form": "may-vary-across", "task": "consequence", "domain": "deadline", "feasible_count": 2, "gold": "yes" } }, { "id": "choice-r23-188", "english": "Assignment note GRP-0002: its members are WO-00021, WO-00022 and WO-00023. Allowed deadline slot for WO-00021: only B. Allowed deadline slot for WO-00022: A, B, C. Allowed deadline slot for WO-00023: only B. Maximum uses of each deadline slot in this note: A at most 1; B at most 3; C at most 1. The set GRP-0002 is exactly those three work orders. Give each member of GRP-0002 exactly one deadline slot; the values may be the same or different.", "ainglish": "Assignment note GRP-0002: its members are WO-00021, WO-00022 and WO-00023. Allowed deadline slot for WO-00021: only B. Allowed deadline slot for WO-00022: A, B, C. Allowed deadline slot for WO-00023: only B. Maximum uses of each deadline slot in this note: A at most 1; B at most 3; C at most 1. The set GRP-0002 is exactly those three work orders. Give each member of GRP-0002 exactly one deadline slot, may-vary-across(GRP-0002).", "question": "Consider every complete plan that satisfies all requirements in the note. Must WO-00021 and WO-00023 be given the same deadline slot?", "options": [ "no", "no complete plan satisfies the note", "the note does not settle it", "yes" ], "answer": "yes", "settlement_stratum": "may-vary-across:consequence", "strata": { "form": "may-vary-across", "task": "consequence", "domain": "deadline", "set": "GRP-0002", "members": [ "WO-00021", "WO-00022", "WO-00023" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "B" ], [ "A", "B", "C" ], [ "B" ] ], "capacities": { "A": 1, "B": 3, "C": 1 }, "form": "may-vary-across", "task": "consequence", "domain": "deadline", "feasible_count": 3, "gold": "yes" } }, { "id": "choice-r23-189", "english": "Assignment note GRP-0005: its members are SD-00051, SD-00052 and SD-00053. Allowed font family for SD-00051: A, C. Allowed font family for SD-00052: only C. Allowed font family for SD-00053: only C. Maximum uses of each font family in this note: A at most 1; B at most 2; C at most 3. The set GRP-0005 is exactly those three slide decks. Give each member of GRP-0005 exactly one font family; the values may be the same or different.", "ainglish": "Assignment note GRP-0005: its members are SD-00051, SD-00052 and SD-00053. Allowed font family for SD-00051: A, C. Allowed font family for SD-00052: only C. Allowed font family for SD-00053: only C. Maximum uses of each font family in this note: A at most 1; B at most 2; C at most 3. The set GRP-0005 is exactly those three slide decks. Give each member of GRP-0005 exactly one font family, may-vary-across(GRP-0005).", "question": "Consider every complete plan that satisfies all requirements in the note. Must SD-00051 and SD-00053 be given the same font family?", "options": [ "the note does not settle it", "yes", "no", "no complete plan satisfies the note" ], "answer": "no", "settlement_stratum": "may-vary-across:consequence", "strata": { "form": "may-vary-across", "task": "consequence", "domain": "font-family", "set": "GRP-0005", "members": [ "SD-00051", "SD-00052", "SD-00053" ], "candidate": null, "gold_class": "no" }, "ledger": { "eligibility": [ [ "A", "C" ], [ "C" ], [ "C" ] ], "capacities": { "A": 1, "B": 2, "C": 3 }, "form": "may-vary-across", "task": "consequence", "domain": "font-family", "feasible_count": 2, "gold": "no" } }, { "id": "choice-r23-190", "english": "Assignment note GRP-0005: its members are FL-00051, FL-00052 and FL-00053. Allowed reviewer for FL-00051: A, B, C. Allowed reviewer for FL-00052: A, B, C. Allowed reviewer for FL-00053: only C. Maximum uses of each reviewer in this note: A at most 3; B at most 3; C at most 1. The set GRP-0005 is exactly those three files. Give each member of GRP-0005 exactly one reviewer; the values may be the same or different.", "ainglish": "Assignment note GRP-0005: its members are FL-00051, FL-00052 and FL-00053. Allowed reviewer for FL-00051: A, B, C. Allowed reviewer for FL-00052: A, B, C. Allowed reviewer for FL-00053: only C. Maximum uses of each reviewer in this note: A at most 3; B at most 3; C at most 1. The set GRP-0005 is exactly those three files. Give each member of GRP-0005 exactly one reviewer, may-vary-across(GRP-0005).", "question": "Consider every complete plan that satisfies all requirements in the note. Must FL-00051 and FL-00053 be given the same reviewer?", "options": [ "the note does not settle it", "yes", "no", "no complete plan satisfies the note" ], "answer": "no", "settlement_stratum": "may-vary-across:consequence", "strata": { "form": "may-vary-across", "task": "consequence", "domain": "reviewer", "set": "GRP-0005", "members": [ "FL-00051", "FL-00052", "FL-00053" ], "candidate": null, "gold_class": "no" }, "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "C" ] ], "capacities": { "A": 3, "B": 3, "C": 1 }, "form": "may-vary-across", "task": "consequence", "domain": "reviewer", "feasible_count": 4, "gold": "no" } }, { "id": "choice-r23-191", "english": "Assignment note GRP-0002: its members are SD-00021, SD-00022 and SD-00023. Allowed font family for SD-00021: only A. Allowed font family for SD-00022: A, B, C. Allowed font family for SD-00023: only A. Maximum uses of each font family in this note: A at most 3; B at most 3; C at most 3. The set GRP-0002 is exactly those three slide decks. Give each member of GRP-0002 exactly one font family; the values may be the same or different.", "ainglish": "Assignment note GRP-0002: its members are SD-00021, SD-00022 and SD-00023. Allowed font family for SD-00021: only A. Allowed font family for SD-00022: A, B, C. Allowed font family for SD-00023: only A. Maximum uses of each font family in this note: A at most 3; B at most 3; C at most 3. The set GRP-0002 is exactly those three slide decks. Give each member of GRP-0002 exactly one font family, may-vary-across(GRP-0002).", "question": "Consider every complete plan that satisfies all requirements in the note. Must SD-00021 and SD-00023 be given the same font family?", "options": [ "yes", "no", "no complete plan satisfies the note", "the note does not settle it" ], "answer": "yes", "settlement_stratum": "may-vary-across:consequence", "strata": { "form": "may-vary-across", "task": "consequence", "domain": "font-family", "set": "GRP-0002", "members": [ "SD-00021", "SD-00022", "SD-00023" ], "candidate": null, "gold_class": "yes" }, "ledger": { "eligibility": [ [ "A" ], [ "A", "B", "C" ], [ "A" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "form": "may-vary-across", "task": "consequence", "domain": "font-family", "feasible_count": 3, "gold": "yes" } }, { "id": "choice-r23-cal-00", "calibration": true, "english": "The sealed pouch PO-3411 is with either Nadia or Ossian.", "ainglish": "The sealed pouch PO-3411 is with Nadia, not Ossian.", "question": "Which party holds the sealed pouch PO-3411?", "options": [ "Nadia", "Ossian", "the note does not settle which", "neither party" ], "answer": "Nadia" }, { "id": "choice-r23-cal-01", "calibration": true, "english": "The spare fuse FU-2210 is with either Petra or Quinn.", "ainglish": "The spare fuse FU-2210 is with Quinn, not Petra.", "question": "Which party holds the spare fuse FU-2210?", "options": [ "Quinn", "Petra", "the note does not settle which", "neither party" ], "answer": "Quinn" }, { "id": "choice-r23-cal-02", "calibration": true, "english": "The coded badge BD-1180 is with either Rafe or Sonia.", "ainglish": "The coded badge BD-1180 is with Rafe, not Sonia.", "question": "Which party holds the coded badge BD-1180?", "options": [ "Rafe", "Sonia", "the note does not settle which", "neither party" ], "answer": "Rafe" }, { "id": "choice-r23-cal-03", "calibration": true, "english": "The sample tube ST-4402 is with either Tam or Ugo.", "ainglish": "The sample tube ST-4402 is with Ugo, not Tam.", "question": "Which party holds the sample tube ST-4402?", "options": [ "Ugo", "Tam", "the note does not settle which", "neither party" ], "answer": "Ugo" }, { "id": "choice-r23-cal-04", "calibration": true, "english": "The loaner tablet TB-9051 is with either Vera or Wade.", "ainglish": "The loaner tablet TB-9051 is with Vera, not Wade.", "question": "Which party holds the loaner tablet TB-9051?", "options": [ "Vera", "Wade", "the note does not settle which", "neither party" ], "answer": "Vera" }, { "id": "choice-r23-cal-05", "calibration": true, "english": "The storage key KY-6634 is with either Xenia or Yusuf.", "ainglish": "The storage key KY-6634 is with Yusuf, not Xenia.", "question": "Which party holds the storage key KY-6634?", "options": [ "Yusuf", "Xenia", "the note does not settle which", "neither party" ], "answer": "Yusuf" }, { "id": "choice-r23-cal-06", "calibration": true, "english": "The archive box AR-7781 is with either Zara or Amos.", "ainglish": "The archive box AR-7781 is with Zara, not Amos.", "question": "Which party holds the archive box AR-7781?", "options": [ "Zara", "Amos", "the note does not settle which", "neither party" ], "answer": "Zara" }, { "id": "choice-r23-cal-07", "calibration": true, "english": "The tool crate TC-3092 is with either Bela or Cyrus.", "ainglish": "The tool crate TC-3092 is with Cyrus, not Bela.", "question": "Which party holds the tool crate TC-3092?", "options": [ "Cyrus", "Bela", "the note does not settle which", "neither party" ], "answer": "Cyrus" }, { "id": "choice-r23-cal-08", "calibration": true, "english": "The spare headset HS-5527 is with either Dana or Emil.", "ainglish": "The spare headset HS-5527 is with Dana, not Emil.", "question": "Which party holds the spare headset HS-5527?", "options": [ "Dana", "Emil", "the note does not settle which", "neither party" ], "answer": "Dana" }, { "id": "choice-r23-cal-09", "calibration": true, "english": "The label roll LR-8830 is with either Fenna or Goran.", "ainglish": "The label roll LR-8830 is with Goran, not Fenna.", "question": "Which party holds the label roll LR-8830?", "options": [ "Goran", "Fenna", "the note does not settle which", "neither party" ], "answer": "Goran" }, { "id": "choice-r23-cal-10", "calibration": true, "english": "The charging dock CD-1946 is with either Hana or Ivo.", "ainglish": "The charging dock CD-1946 is with Hana, not Ivo.", "question": "Which party holds the charging dock CD-1946?", "options": [ "Hana", "Ivo", "the note does not settle which", "neither party" ], "answer": "Hana" }, { "id": "choice-r23-cal-11", "calibration": true, "english": "The master ledger ML-2075 is with either Juno or Kai.", "ainglish": "The master ledger ML-2075 is with Kai, not Juno.", "question": "Which party holds the master ledger ML-2075?", "options": [ "Kai", "Juno", "the note does not settle which", "neither party" ], "answer": "Kai" } ], "note": "Lemony round-23 fresh-input settlement replication kit for the same-for-all / may-vary-across construct (proposal one-choice-per-member-requirement-same-for-all-set-one; source row 6d4aeaa7…). 192 wholly fresh items in the source's six equal-weight strata (2 qualifiers x {admissibility, feasibility, consequence}) x 4 domains x 8, 3-member sets, plus 12 planted-containment controls. Marked arm appends same-for-all() / may-vary-across() to an exactly-one-value-per-member requirement; the English arm is the shortest faithful complete English (same value for all / values may be the same or different). Gold is computed from each item's ledger by an independent rule. Differences from the source instrument, disclosed: this kit's feasibility questions offer three options (the source offered `no` and `no feasible assignment exists`, which are the same answer), and no option set here contains two paraphrases of one answer.", "sha256": "2cff1e0410c0292d8f6881f72c807f94a946a3ca2b5a872ba7b1ce07936d5c90" }