[ { "id": "choice-0-0-00", "english": "For evaluation record C10100-admissibility, For reports C10100-1, C10100-2, C10100-3, the reviewer choices have distinct IDs A, B, C. C10100-1 permits only A,B,C. C10100-2 permits only A,B,C. C10100-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10100 contains precisely those three reports. Assign the same single reviewer to all three reports.", "ainglish": "For evaluation record C10100-admissibility, For reports C10100-1, C10100-2, C10100-3, the reviewer choices have distinct IDs A, B, C. C10100-1 permits only A,B,C. C10100-2 permits only A,B,C. C10100-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10100 contains precisely those three reports. Assign exactly one reviewer to each of these reports, same-for-all(C10100).", "question": "A proposed plan uses IDs A,A,A in the listed member order. Does that plan obey every stated requirement?", "answer": "yes", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "same-for-all:admissibility", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "A", "A" ], "feasible": [ [ "A", "A", "A" ], [ "B", "B", "B" ], [ "C", "C", "C" ] ], "form": "same-for-all", "task": "admissibility", "domain": "reviewer" } }, { "id": "choice-0-1-00", "english": "For evaluation record C10100-feasibility, For reports C10100-1, C10100-2, C10100-3, the reviewer choices have distinct IDs A, B, C. C10100-1 permits only A,B,C. C10100-2 permits only A,B,C. C10100-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10100 contains precisely those three reports. Assign the same single reviewer to all three reports.", "ainglish": "For evaluation record C10100-feasibility, For reports C10100-1, C10100-2, C10100-3, the reviewer choices have distinct IDs A, B, C. C10100-1 permits only A,B,C. C10100-2 permits only A,B,C. C10100-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10100 contains precisely those three reports. Assign exactly one reviewer to each of these reports, same-for-all(C10100).", "question": "Can any complete plan obey all the stated requirements?", "answer": "yes", "options": [ "the information is insufficient", "yes", "no", "no feasible assignment exists" ], "settlement_stratum": "same-for-all:feasibility", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "A", "A" ], "feasible": [ [ "A", "A", "A" ], [ "B", "B", "B" ], [ "C", "C", "C" ] ], "form": "same-for-all", "task": "feasibility", "domain": "reviewer" } }, { "id": "choice-0-2-00", "english": "For evaluation record C10100-consequence, For reports C10100-1, C10100-2, C10100-3, the reviewer choices have distinct IDs A, B, C. C10100-1 permits only A,B,C. C10100-2 permits only A,B,C. C10100-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10100 contains precisely those three reports. Assign the same single reviewer to all three reports.", "ainglish": "For evaluation record C10100-consequence, For reports C10100-1, C10100-2, C10100-3, the reviewer choices have distinct IDs A, B, C. C10100-1 permits only A,B,C. C10100-2 permits only A,B,C. C10100-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10100 contains precisely those three reports. Assign exactly one reviewer to each of these reports, same-for-all(C10100).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "yes", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "same-for-all:consequence", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "A", "A" ], "feasible": [ [ "A", "A", "A" ], [ "B", "B", "B" ], [ "C", "C", "C" ] ], "form": "same-for-all", "task": "consequence", "domain": "reviewer" } }, { "id": "choice-1-0-00", "english": "For evaluation record C10100-admissibility, For reports C10100-1, C10100-2, C10100-3, the reviewer choices have distinct IDs A, B, C. C10100-1 permits only A,B,C. C10100-2 permits only A,B,C. C10100-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10100 contains precisely those three reports. Assign exactly one reviewer to each of these reports; choices may be the same or different.", "ainglish": "For evaluation record C10100-admissibility, For reports C10100-1, C10100-2, C10100-3, the reviewer choices have distinct IDs A, B, C. C10100-1 permits only A,B,C. C10100-2 permits only A,B,C. C10100-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10100 contains precisely those three reports. Assign exactly one reviewer to each of these reports, may-vary-across(C10100).", "question": "A proposed plan uses IDs A,A,A in the listed member order. Does that plan obey every stated requirement?", "answer": "yes", "options": [ "no", "no feasible assignment exists", "the information is insufficient", "yes" ], "settlement_stratum": "may-vary-across:admissibility", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "A", "A" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "B" ], [ "A", "A", "C" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "A", "B", "C" ], [ "A", "C", "A" ], [ "A", "C", "B" ], [ "A", "C", "C" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "A", "C" ], [ "B", "B", "A" ], [ "B", "B", "B" ], [ "B", "B", "C" ], [ "B", "C", "A" ], [ "B", "C", "B" ], [ "B", "C", "C" ], [ "C", "A", "A" ], [ "C", "A", "B" ], [ "C", "A", "C" ], [ "C", "B", "A" ], [ "C", "B", "B" ], [ "C", "B", "C" ], [ "C", "C", "A" ], [ "C", "C", "B" ], [ "C", "C", "C" ] ], "form": "may-vary-across", "task": "admissibility", "domain": "reviewer" } }, { "id": "choice-1-1-00", "english": "For evaluation record C10100-feasibility, For reports C10100-1, C10100-2, C10100-3, the reviewer choices have distinct IDs A, B, C. C10100-1 permits only A,B,C. C10100-2 permits only A,B,C. C10100-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10100 contains precisely those three reports. Assign exactly one reviewer to each of these reports; choices may be the same or different.", "ainglish": "For evaluation record C10100-feasibility, For reports C10100-1, C10100-2, C10100-3, the reviewer choices have distinct IDs A, B, C. C10100-1 permits only A,B,C. C10100-2 permits only A,B,C. C10100-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10100 contains precisely those three reports. Assign exactly one reviewer to each of these reports, may-vary-across(C10100).", "question": "Can any complete plan obey all the stated requirements?", "answer": "yes", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "may-vary-across:feasibility", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "A", "A" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "B" ], [ "A", "A", "C" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "A", "B", "C" ], [ "A", "C", "A" ], [ "A", "C", "B" ], [ "A", "C", "C" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "A", "C" ], [ "B", "B", "A" ], [ "B", "B", "B" ], [ "B", "B", "C" ], [ "B", "C", "A" ], [ "B", "C", "B" ], [ "B", "C", "C" ], [ "C", "A", "A" ], [ "C", "A", "B" ], [ "C", "A", "C" ], [ "C", "B", "A" ], [ "C", "B", "B" ], [ "C", "B", "C" ], [ "C", "C", "A" ], [ "C", "C", "B" ], [ "C", "C", "C" ] ], "form": "may-vary-across", "task": "feasibility", "domain": "reviewer" } }, { "id": "choice-1-2-00", "english": "For evaluation record C10100-consequence, For reports C10100-1, C10100-2, C10100-3, the reviewer choices have distinct IDs A, B, C. C10100-1 permits only A,B,C. C10100-2 permits only A,B,C. C10100-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10100 contains precisely those three reports. Assign exactly one reviewer to each of these reports; choices may be the same or different.", "ainglish": "For evaluation record C10100-consequence, For reports C10100-1, C10100-2, C10100-3, the reviewer choices have distinct IDs A, B, C. C10100-1 permits only A,B,C. C10100-2 permits only A,B,C. C10100-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10100 contains precisely those three reports. Assign exactly one reviewer to each of these reports, may-vary-across(C10100).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "no", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "may-vary-across:consequence", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "A", "A" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "B" ], [ "A", "A", "C" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "A", "B", "C" ], [ "A", "C", "A" ], [ "A", "C", "B" ], [ "A", "C", "C" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "A", "C" ], [ "B", "B", "A" ], [ "B", "B", "B" ], [ "B", "B", "C" ], [ "B", "C", "A" ], [ "B", "C", "B" ], [ "B", "C", "C" ], [ "C", "A", "A" ], [ "C", "A", "B" ], [ "C", "A", "C" ], [ "C", "B", "A" ], [ "C", "B", "B" ], [ "C", "B", "C" ], [ "C", "C", "A" ], [ "C", "C", "B" ], [ "C", "C", "C" ] ], "form": "may-vary-across", "task": "consequence", "domain": "reviewer" } }, { "id": "choice-0-0-01", "english": "For evaluation record C10101-admissibility, For documents C10101-1, C10101-2, C10101-3, the font-family choices have distinct IDs A, B, C. C10101-1 permits only A,B,C. C10101-2 permits only A,B,C. C10101-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10101 contains precisely those three documents. Assign the same single font-family to all three documents.", "ainglish": "For evaluation record C10101-admissibility, For documents C10101-1, C10101-2, C10101-3, the font-family choices have distinct IDs A, B, C. C10101-1 permits only A,B,C. C10101-2 permits only A,B,C. C10101-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10101 contains precisely those three documents. Assign exactly one font-family to each of these documents, same-for-all(C10101).", "question": "A proposed plan uses IDs A,A,A in the listed member order. Does that plan obey every stated requirement?", "answer": "yes", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "same-for-all:admissibility", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "A", "A" ], "feasible": [ [ "A", "A", "A" ], [ "B", "B", "B" ], [ "C", "C", "C" ] ], "form": "same-for-all", "task": "admissibility", "domain": "font-family" } }, { "id": "choice-0-1-01", "english": "For evaluation record C10101-feasibility, For documents C10101-1, C10101-2, C10101-3, the font-family choices have distinct IDs A, B, C. C10101-1 permits only A,B,C. C10101-2 permits only A,B,C. C10101-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10101 contains precisely those three documents. Assign the same single font-family to all three documents.", "ainglish": "For evaluation record C10101-feasibility, For documents C10101-1, C10101-2, C10101-3, the font-family choices have distinct IDs A, B, C. C10101-1 permits only A,B,C. C10101-2 permits only A,B,C. C10101-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10101 contains precisely those three documents. Assign exactly one font-family to each of these documents, same-for-all(C10101).", "question": "Can any complete plan obey all the stated requirements?", "answer": "yes", "options": [ "no", "no feasible assignment exists", "the information is insufficient", "yes" ], "settlement_stratum": "same-for-all:feasibility", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "A", "A" ], "feasible": [ [ "A", "A", "A" ], [ "B", "B", "B" ], [ "C", "C", "C" ] ], "form": "same-for-all", "task": "feasibility", "domain": "font-family" } }, { "id": "choice-0-2-01", "english": "For evaluation record C10101-consequence, For documents C10101-1, C10101-2, C10101-3, the font-family choices have distinct IDs A, B, C. C10101-1 permits only A,B,C. C10101-2 permits only A,B,C. C10101-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10101 contains precisely those three documents. Assign the same single font-family to all three documents.", "ainglish": "For evaluation record C10101-consequence, For documents C10101-1, C10101-2, C10101-3, the font-family choices have distinct IDs A, B, C. C10101-1 permits only A,B,C. C10101-2 permits only A,B,C. C10101-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10101 contains precisely those three documents. Assign exactly one font-family to each of these documents, same-for-all(C10101).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "yes", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "same-for-all:consequence", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "A", "A" ], "feasible": [ [ "A", "A", "A" ], [ "B", "B", "B" ], [ "C", "C", "C" ] ], "form": "same-for-all", "task": "consequence", "domain": "font-family" } }, { "id": "choice-1-0-01", "english": "For evaluation record C10101-admissibility, For documents C10101-1, C10101-2, C10101-3, the font-family choices have distinct IDs A, B, C. C10101-1 permits only A,B,C. C10101-2 permits only A,B,C. C10101-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10101 contains precisely those three documents. Assign exactly one font-family to each of these documents; choices may be the same or different.", "ainglish": "For evaluation record C10101-admissibility, For documents C10101-1, C10101-2, C10101-3, the font-family choices have distinct IDs A, B, C. C10101-1 permits only A,B,C. C10101-2 permits only A,B,C. C10101-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10101 contains precisely those three documents. Assign exactly one font-family to each of these documents, may-vary-across(C10101).", "question": "A proposed plan uses IDs A,A,A in the listed member order. Does that plan obey every stated requirement?", "answer": "yes", "options": [ "the information is insufficient", "yes", "no", "no feasible assignment exists" ], "settlement_stratum": "may-vary-across:admissibility", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "A", "A" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "B" ], [ "A", "A", "C" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "A", "B", "C" ], [ "A", "C", "A" ], [ "A", "C", "B" ], [ "A", "C", "C" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "A", "C" ], [ "B", "B", "A" ], [ "B", "B", "B" ], [ "B", "B", "C" ], [ "B", "C", "A" ], [ "B", "C", "B" ], [ "B", "C", "C" ], [ "C", "A", "A" ], [ "C", "A", "B" ], [ "C", "A", "C" ], [ "C", "B", "A" ], [ "C", "B", "B" ], [ "C", "B", "C" ], [ "C", "C", "A" ], [ "C", "C", "B" ], [ "C", "C", "C" ] ], "form": "may-vary-across", "task": "admissibility", "domain": "font-family" } }, { "id": "choice-1-1-01", "english": "For evaluation record C10101-feasibility, For documents C10101-1, C10101-2, C10101-3, the font-family choices have distinct IDs A, B, C. C10101-1 permits only A,B,C. C10101-2 permits only A,B,C. C10101-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10101 contains precisely those three documents. Assign exactly one font-family to each of these documents; choices may be the same or different.", "ainglish": "For evaluation record C10101-feasibility, For documents C10101-1, C10101-2, C10101-3, the font-family choices have distinct IDs A, B, C. C10101-1 permits only A,B,C. C10101-2 permits only A,B,C. C10101-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10101 contains precisely those three documents. Assign exactly one font-family to each of these documents, may-vary-across(C10101).", "question": "Can any complete plan obey all the stated requirements?", "answer": "yes", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "may-vary-across:feasibility", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "A", "A" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "B" ], [ "A", "A", "C" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "A", "B", "C" ], [ "A", "C", "A" ], [ "A", "C", "B" ], [ "A", "C", "C" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "A", "C" ], [ "B", "B", "A" ], [ "B", "B", "B" ], [ "B", "B", "C" ], [ "B", "C", "A" ], [ "B", "C", "B" ], [ "B", "C", "C" ], [ "C", "A", "A" ], [ "C", "A", "B" ], [ "C", "A", "C" ], [ "C", "B", "A" ], [ "C", "B", "B" ], [ "C", "B", "C" ], [ "C", "C", "A" ], [ "C", "C", "B" ], [ "C", "C", "C" ] ], "form": "may-vary-across", "task": "feasibility", "domain": "font-family" } }, { "id": "choice-1-2-01", "english": "For evaluation record C10101-consequence, For documents C10101-1, C10101-2, C10101-3, the font-family choices have distinct IDs A, B, C. C10101-1 permits only A,B,C. C10101-2 permits only A,B,C. C10101-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10101 contains precisely those three documents. Assign exactly one font-family to each of these documents; choices may be the same or different.", "ainglish": "For evaluation record C10101-consequence, For documents C10101-1, C10101-2, C10101-3, the font-family choices have distinct IDs A, B, C. C10101-1 permits only A,B,C. C10101-2 permits only A,B,C. C10101-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10101 contains precisely those three documents. Assign exactly one font-family to each of these documents, may-vary-across(C10101).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "no", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "may-vary-across:consequence", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "A", "A" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "B" ], [ "A", "A", "C" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "A", "B", "C" ], [ "A", "C", "A" ], [ "A", "C", "B" ], [ "A", "C", "C" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "A", "C" ], [ "B", "B", "A" ], [ "B", "B", "B" ], [ "B", "B", "C" ], [ "B", "C", "A" ], [ "B", "C", "B" ], [ "B", "C", "C" ], [ "C", "A", "A" ], [ "C", "A", "B" ], [ "C", "A", "C" ], [ "C", "B", "A" ], [ "C", "B", "B" ], [ "C", "B", "C" ], [ "C", "C", "A" ], [ "C", "C", "B" ], [ "C", "C", "C" ] ], "form": "may-vary-across", "task": "consequence", "domain": "font-family" } }, { "id": "choice-0-0-02", "english": "For evaluation record C10102-admissibility, For analyses C10102-1, C10102-2, C10102-3, the source-dataset choices have distinct IDs A, B, C. C10102-1 permits only A,B,C. C10102-2 permits only A,B,C. C10102-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10102 contains precisely those three analyses. Assign the same single source-dataset to all three analyses.", "ainglish": "For evaluation record C10102-admissibility, For analyses C10102-1, C10102-2, C10102-3, the source-dataset choices have distinct IDs A, B, C. C10102-1 permits only A,B,C. C10102-2 permits only A,B,C. C10102-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10102 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses, same-for-all(C10102).", "question": "A proposed plan uses IDs A,A,A in the listed member order. Does that plan obey every stated requirement?", "answer": "yes", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "same-for-all:admissibility", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "A", "A" ], "feasible": [ [ "A", "A", "A" ], [ "B", "B", "B" ], [ "C", "C", "C" ] ], "form": "same-for-all", "task": "admissibility", "domain": "source-dataset" } }, { "id": "choice-0-1-02", "english": "For evaluation record C10102-feasibility, For analyses C10102-1, C10102-2, C10102-3, the source-dataset choices have distinct IDs A, B, C. C10102-1 permits only A,B,C. C10102-2 permits only A,B,C. C10102-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10102 contains precisely those three analyses. Assign the same single source-dataset to all three analyses.", "ainglish": "For evaluation record C10102-feasibility, For analyses C10102-1, C10102-2, C10102-3, the source-dataset choices have distinct IDs A, B, C. C10102-1 permits only A,B,C. C10102-2 permits only A,B,C. C10102-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10102 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses, same-for-all(C10102).", "question": "Can any complete plan obey all the stated requirements?", "answer": "yes", "options": [ "the information is insufficient", "yes", "no", "no feasible assignment exists" ], "settlement_stratum": "same-for-all:feasibility", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "A", "A" ], "feasible": [ [ "A", "A", "A" ], [ "B", "B", "B" ], [ "C", "C", "C" ] ], "form": "same-for-all", "task": "feasibility", "domain": "source-dataset" } }, { "id": "choice-0-2-02", "english": "For evaluation record C10102-consequence, For analyses C10102-1, C10102-2, C10102-3, the source-dataset choices have distinct IDs A, B, C. C10102-1 permits only A,B,C. C10102-2 permits only A,B,C. C10102-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10102 contains precisely those three analyses. Assign the same single source-dataset to all three analyses.", "ainglish": "For evaluation record C10102-consequence, For analyses C10102-1, C10102-2, C10102-3, the source-dataset choices have distinct IDs A, B, C. C10102-1 permits only A,B,C. C10102-2 permits only A,B,C. C10102-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10102 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses, same-for-all(C10102).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "yes", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "same-for-all:consequence", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "A", "A" ], "feasible": [ [ "A", "A", "A" ], [ "B", "B", "B" ], [ "C", "C", "C" ] ], "form": "same-for-all", "task": "consequence", "domain": "source-dataset" } }, { "id": "choice-1-0-02", "english": "For evaluation record C10102-admissibility, For analyses C10102-1, C10102-2, C10102-3, the source-dataset choices have distinct IDs A, B, C. C10102-1 permits only A,B,C. C10102-2 permits only A,B,C. C10102-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10102 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses; choices may be the same or different.", "ainglish": "For evaluation record C10102-admissibility, For analyses C10102-1, C10102-2, C10102-3, the source-dataset choices have distinct IDs A, B, C. C10102-1 permits only A,B,C. C10102-2 permits only A,B,C. C10102-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10102 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses, may-vary-across(C10102).", "question": "A proposed plan uses IDs A,A,A in the listed member order. Does that plan obey every stated requirement?", "answer": "yes", "options": [ "no", "no feasible assignment exists", "the information is insufficient", "yes" ], "settlement_stratum": "may-vary-across:admissibility", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "A", "A" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "B" ], [ "A", "A", "C" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "A", "B", "C" ], [ "A", "C", "A" ], [ "A", "C", "B" ], [ "A", "C", "C" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "A", "C" ], [ "B", "B", "A" ], [ "B", "B", "B" ], [ "B", "B", "C" ], [ "B", "C", "A" ], [ "B", "C", "B" ], [ "B", "C", "C" ], [ "C", "A", "A" ], [ "C", "A", "B" ], [ "C", "A", "C" ], [ "C", "B", "A" ], [ "C", "B", "B" ], [ "C", "B", "C" ], [ "C", "C", "A" ], [ "C", "C", "B" ], [ "C", "C", "C" ] ], "form": "may-vary-across", "task": "admissibility", "domain": "source-dataset" } }, { "id": "choice-1-1-02", "english": "For evaluation record C10102-feasibility, For analyses C10102-1, C10102-2, C10102-3, the source-dataset choices have distinct IDs A, B, C. C10102-1 permits only A,B,C. C10102-2 permits only A,B,C. C10102-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10102 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses; choices may be the same or different.", "ainglish": "For evaluation record C10102-feasibility, For analyses C10102-1, C10102-2, C10102-3, the source-dataset choices have distinct IDs A, B, C. C10102-1 permits only A,B,C. C10102-2 permits only A,B,C. C10102-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10102 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses, may-vary-across(C10102).", "question": "Can any complete plan obey all the stated requirements?", "answer": "yes", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "may-vary-across:feasibility", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "A", "A" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "B" ], [ "A", "A", "C" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "A", "B", "C" ], [ "A", "C", "A" ], [ "A", "C", "B" ], [ "A", "C", "C" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "A", "C" ], [ "B", "B", "A" ], [ "B", "B", "B" ], [ "B", "B", "C" ], [ "B", "C", "A" ], [ "B", "C", "B" ], [ "B", "C", "C" ], [ "C", "A", "A" ], [ "C", "A", "B" ], [ "C", "A", "C" ], [ "C", "B", "A" ], [ "C", "B", "B" ], [ "C", "B", "C" ], [ "C", "C", "A" ], [ "C", "C", "B" ], [ "C", "C", "C" ] ], "form": "may-vary-across", "task": "feasibility", "domain": "source-dataset" } }, { "id": "choice-1-2-02", "english": "For evaluation record C10102-consequence, For analyses C10102-1, C10102-2, C10102-3, the source-dataset choices have distinct IDs A, B, C. C10102-1 permits only A,B,C. C10102-2 permits only A,B,C. C10102-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10102 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses; choices may be the same or different.", "ainglish": "For evaluation record C10102-consequence, For analyses C10102-1, C10102-2, C10102-3, the source-dataset choices have distinct IDs A, B, C. C10102-1 permits only A,B,C. C10102-2 permits only A,B,C. C10102-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10102 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses, may-vary-across(C10102).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "no", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "may-vary-across:consequence", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "A", "A" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "B" ], [ "A", "A", "C" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "A", "B", "C" ], [ "A", "C", "A" ], [ "A", "C", "B" ], [ "A", "C", "C" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "A", "C" ], [ "B", "B", "A" ], [ "B", "B", "B" ], [ "B", "B", "C" ], [ "B", "C", "A" ], [ "B", "C", "B" ], [ "B", "C", "C" ], [ "C", "A", "A" ], [ "C", "A", "B" ], [ "C", "A", "C" ], [ "C", "B", "A" ], [ "C", "B", "B" ], [ "C", "B", "C" ], [ "C", "C", "A" ], [ "C", "C", "B" ], [ "C", "C", "C" ] ], "form": "may-vary-across", "task": "consequence", "domain": "source-dataset" } }, { "id": "choice-0-0-03", "english": "For evaluation record C10103-admissibility, For tasks C10103-1, C10103-2, C10103-3, the deadline choices have distinct IDs A, B, C. C10103-1 permits only A,B,C. C10103-2 permits only A,B,C. C10103-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10103 contains precisely those three tasks. Assign the same single deadline to all three tasks.", "ainglish": "For evaluation record C10103-admissibility, For tasks C10103-1, C10103-2, C10103-3, the deadline choices have distinct IDs A, B, C. C10103-1 permits only A,B,C. C10103-2 permits only A,B,C. C10103-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10103 contains precisely those three tasks. Assign exactly one deadline to each of these tasks, same-for-all(C10103).", "question": "A proposed plan uses IDs A,A,A in the listed member order. Does that plan obey every stated requirement?", "answer": "yes", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "same-for-all:admissibility", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "A", "A" ], "feasible": [ [ "A", "A", "A" ], [ "B", "B", "B" ], [ "C", "C", "C" ] ], "form": "same-for-all", "task": "admissibility", "domain": "deadline" } }, { "id": "choice-0-1-03", "english": "For evaluation record C10103-feasibility, For tasks C10103-1, C10103-2, C10103-3, the deadline choices have distinct IDs A, B, C. C10103-1 permits only A,B,C. C10103-2 permits only A,B,C. C10103-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10103 contains precisely those three tasks. Assign the same single deadline to all three tasks.", "ainglish": "For evaluation record C10103-feasibility, For tasks C10103-1, C10103-2, C10103-3, the deadline choices have distinct IDs A, B, C. C10103-1 permits only A,B,C. C10103-2 permits only A,B,C. C10103-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10103 contains precisely those three tasks. Assign exactly one deadline to each of these tasks, same-for-all(C10103).", "question": "Can any complete plan obey all the stated requirements?", "answer": "yes", "options": [ "no", "no feasible assignment exists", "the information is insufficient", "yes" ], "settlement_stratum": "same-for-all:feasibility", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "A", "A" ], "feasible": [ [ "A", "A", "A" ], [ "B", "B", "B" ], [ "C", "C", "C" ] ], "form": "same-for-all", "task": "feasibility", "domain": "deadline" } }, { "id": "choice-0-2-03", "english": "For evaluation record C10103-consequence, For tasks C10103-1, C10103-2, C10103-3, the deadline choices have distinct IDs A, B, C. C10103-1 permits only A,B,C. C10103-2 permits only A,B,C. C10103-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10103 contains precisely those three tasks. Assign the same single deadline to all three tasks.", "ainglish": "For evaluation record C10103-consequence, For tasks C10103-1, C10103-2, C10103-3, the deadline choices have distinct IDs A, B, C. C10103-1 permits only A,B,C. C10103-2 permits only A,B,C. C10103-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10103 contains precisely those three tasks. Assign exactly one deadline to each of these tasks, same-for-all(C10103).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "yes", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "same-for-all:consequence", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "A", "A" ], "feasible": [ [ "A", "A", "A" ], [ "B", "B", "B" ], [ "C", "C", "C" ] ], "form": "same-for-all", "task": "consequence", "domain": "deadline" } }, { "id": "choice-1-0-03", "english": "For evaluation record C10103-admissibility, For tasks C10103-1, C10103-2, C10103-3, the deadline choices have distinct IDs A, B, C. C10103-1 permits only A,B,C. C10103-2 permits only A,B,C. C10103-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10103 contains precisely those three tasks. Assign exactly one deadline to each of these tasks; choices may be the same or different.", "ainglish": "For evaluation record C10103-admissibility, For tasks C10103-1, C10103-2, C10103-3, the deadline choices have distinct IDs A, B, C. C10103-1 permits only A,B,C. C10103-2 permits only A,B,C. C10103-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10103 contains precisely those three tasks. Assign exactly one deadline to each of these tasks, may-vary-across(C10103).", "question": "A proposed plan uses IDs A,A,A in the listed member order. Does that plan obey every stated requirement?", "answer": "yes", "options": [ "the information is insufficient", "yes", "no", "no feasible assignment exists" ], "settlement_stratum": "may-vary-across:admissibility", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "A", "A" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "B" ], [ "A", "A", "C" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "A", "B", "C" ], [ "A", "C", "A" ], [ "A", "C", "B" ], [ "A", "C", "C" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "A", "C" ], [ "B", "B", "A" ], [ "B", "B", "B" ], [ "B", "B", "C" ], [ "B", "C", "A" ], [ "B", "C", "B" ], [ "B", "C", "C" ], [ "C", "A", "A" ], [ "C", "A", "B" ], [ "C", "A", "C" ], [ "C", "B", "A" ], [ "C", "B", "B" ], [ "C", "B", "C" ], [ "C", "C", "A" ], [ "C", "C", "B" ], [ "C", "C", "C" ] ], "form": "may-vary-across", "task": "admissibility", "domain": "deadline" } }, { "id": "choice-1-1-03", "english": "For evaluation record C10103-feasibility, For tasks C10103-1, C10103-2, C10103-3, the deadline choices have distinct IDs A, B, C. C10103-1 permits only A,B,C. C10103-2 permits only A,B,C. C10103-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10103 contains precisely those three tasks. Assign exactly one deadline to each of these tasks; choices may be the same or different.", "ainglish": "For evaluation record C10103-feasibility, For tasks C10103-1, C10103-2, C10103-3, the deadline choices have distinct IDs A, B, C. C10103-1 permits only A,B,C. C10103-2 permits only A,B,C. C10103-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10103 contains precisely those three tasks. Assign exactly one deadline to each of these tasks, may-vary-across(C10103).", "question": "Can any complete plan obey all the stated requirements?", "answer": "yes", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "may-vary-across:feasibility", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "A", "A" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "B" ], [ "A", "A", "C" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "A", "B", "C" ], [ "A", "C", "A" ], [ "A", "C", "B" ], [ "A", "C", "C" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "A", "C" ], [ "B", "B", "A" ], [ "B", "B", "B" ], [ "B", "B", "C" ], [ "B", "C", "A" ], [ "B", "C", "B" ], [ "B", "C", "C" ], [ "C", "A", "A" ], [ "C", "A", "B" ], [ "C", "A", "C" ], [ "C", "B", "A" ], [ "C", "B", "B" ], [ "C", "B", "C" ], [ "C", "C", "A" ], [ "C", "C", "B" ], [ "C", "C", "C" ] ], "form": "may-vary-across", "task": "feasibility", "domain": "deadline" } }, { "id": "choice-1-2-03", "english": "For evaluation record C10103-consequence, For tasks C10103-1, C10103-2, C10103-3, the deadline choices have distinct IDs A, B, C. C10103-1 permits only A,B,C. C10103-2 permits only A,B,C. C10103-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10103 contains precisely those three tasks. Assign exactly one deadline to each of these tasks; choices may be the same or different.", "ainglish": "For evaluation record C10103-consequence, For tasks C10103-1, C10103-2, C10103-3, the deadline choices have distinct IDs A, B, C. C10103-1 permits only A,B,C. C10103-2 permits only A,B,C. C10103-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10103 contains precisely those three tasks. Assign exactly one deadline to each of these tasks, may-vary-across(C10103).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "no", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "may-vary-across:consequence", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "A", "A" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "B" ], [ "A", "A", "C" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "A", "B", "C" ], [ "A", "C", "A" ], [ "A", "C", "B" ], [ "A", "C", "C" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "A", "C" ], [ "B", "B", "A" ], [ "B", "B", "B" ], [ "B", "B", "C" ], [ "B", "C", "A" ], [ "B", "C", "B" ], [ "B", "C", "C" ], [ "C", "A", "A" ], [ "C", "A", "B" ], [ "C", "A", "C" ], [ "C", "B", "A" ], [ "C", "B", "B" ], [ "C", "B", "C" ], [ "C", "C", "A" ], [ "C", "C", "B" ], [ "C", "C", "C" ] ], "form": "may-vary-across", "task": "consequence", "domain": "deadline" } }, { "id": "choice-0-0-04", "english": "For evaluation record C10104-admissibility, For reports C10104-1, C10104-2, C10104-3, the reviewer choices have distinct IDs A, B, C. C10104-1 permits only A,B,C. C10104-2 permits only A,B,C. C10104-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10104 contains precisely those three reports. Assign the same single reviewer to all three reports.", "ainglish": "For evaluation record C10104-admissibility, For reports C10104-1, C10104-2, C10104-3, the reviewer choices have distinct IDs A, B, C. C10104-1 permits only A,B,C. C10104-2 permits only A,B,C. C10104-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10104 contains precisely those three reports. Assign exactly one reviewer to each of these reports, same-for-all(C10104).", "question": "A proposed plan uses IDs A,B,A in the listed member order. Does that plan obey every stated requirement?", "answer": "no", "options": [ "no", "no feasible assignment exists", "the information is insufficient", "yes" ], "settlement_stratum": "same-for-all:admissibility", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "B", "B", "B" ], [ "C", "C", "C" ] ], "form": "same-for-all", "task": "admissibility", "domain": "reviewer" } }, { "id": "choice-0-1-04", "english": "For evaluation record C10104-feasibility, For reports C10104-1, C10104-2, C10104-3, the reviewer choices have distinct IDs A, B, C. C10104-1 permits only A,B,C. C10104-2 permits only A,B,C. C10104-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10104 contains precisely those three reports. Assign the same single reviewer to all three reports.", "ainglish": "For evaluation record C10104-feasibility, For reports C10104-1, C10104-2, C10104-3, the reviewer choices have distinct IDs A, B, C. C10104-1 permits only A,B,C. C10104-2 permits only A,B,C. C10104-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10104 contains precisely those three reports. Assign exactly one reviewer to each of these reports, same-for-all(C10104).", "question": "Can any complete plan obey all the stated requirements?", "answer": "yes", "options": [ "the information is insufficient", "yes", "no", "no feasible assignment exists" ], "settlement_stratum": "same-for-all:feasibility", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "B", "B", "B" ], [ "C", "C", "C" ] ], "form": "same-for-all", "task": "feasibility", "domain": "reviewer" } }, { "id": "choice-0-2-04", "english": "For evaluation record C10104-consequence, For reports C10104-1, C10104-2, C10104-3, the reviewer choices have distinct IDs A, B, C. C10104-1 permits only A,B,C. C10104-2 permits only A,B,C. C10104-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10104 contains precisely those three reports. Assign the same single reviewer to all three reports.", "ainglish": "For evaluation record C10104-consequence, For reports C10104-1, C10104-2, C10104-3, the reviewer choices have distinct IDs A, B, C. C10104-1 permits only A,B,C. C10104-2 permits only A,B,C. C10104-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10104 contains precisely those three reports. Assign exactly one reviewer to each of these reports, same-for-all(C10104).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "yes", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "same-for-all:consequence", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "B", "B", "B" ], [ "C", "C", "C" ] ], "form": "same-for-all", "task": "consequence", "domain": "reviewer" } }, { "id": "choice-1-0-04", "english": "For evaluation record C10104-admissibility, For reports C10104-1, C10104-2, C10104-3, the reviewer choices have distinct IDs A, B, C. C10104-1 permits only A,B,C. C10104-2 permits only A,B,C. C10104-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10104 contains precisely those three reports. Assign exactly one reviewer to each of these reports; choices may be the same or different.", "ainglish": "For evaluation record C10104-admissibility, For reports C10104-1, C10104-2, C10104-3, the reviewer choices have distinct IDs A, B, C. C10104-1 permits only A,B,C. C10104-2 permits only A,B,C. C10104-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10104 contains precisely those three reports. Assign exactly one reviewer to each of these reports, may-vary-across(C10104).", "question": "A proposed plan uses IDs A,B,A in the listed member order. Does that plan obey every stated requirement?", "answer": "yes", "options": [ "no", "no feasible assignment exists", "the information is insufficient", "yes" ], "settlement_stratum": "may-vary-across:admissibility", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "B" ], [ "A", "A", "C" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "A", "B", "C" ], [ "A", "C", "A" ], [ "A", "C", "B" ], [ "A", "C", "C" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "A", "C" ], [ "B", "B", "A" ], [ "B", "B", "B" ], [ "B", "B", "C" ], [ "B", "C", "A" ], [ "B", "C", "B" ], [ "B", "C", "C" ], [ "C", "A", "A" ], [ "C", "A", "B" ], [ "C", "A", "C" ], [ "C", "B", "A" ], [ "C", "B", "B" ], [ "C", "B", "C" ], [ "C", "C", "A" ], [ "C", "C", "B" ], [ "C", "C", "C" ] ], "form": "may-vary-across", "task": "admissibility", "domain": "reviewer" } }, { "id": "choice-1-1-04", "english": "For evaluation record C10104-feasibility, For reports C10104-1, C10104-2, C10104-3, the reviewer choices have distinct IDs A, B, C. C10104-1 permits only A,B,C. C10104-2 permits only A,B,C. C10104-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10104 contains precisely those three reports. Assign exactly one reviewer to each of these reports; choices may be the same or different.", "ainglish": "For evaluation record C10104-feasibility, For reports C10104-1, C10104-2, C10104-3, the reviewer choices have distinct IDs A, B, C. C10104-1 permits only A,B,C. C10104-2 permits only A,B,C. C10104-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10104 contains precisely those three reports. Assign exactly one reviewer to each of these reports, may-vary-across(C10104).", "question": "Can any complete plan obey all the stated requirements?", "answer": "yes", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "may-vary-across:feasibility", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "B" ], [ "A", "A", "C" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "A", "B", "C" ], [ "A", "C", "A" ], [ "A", "C", "B" ], [ "A", "C", "C" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "A", "C" ], [ "B", "B", "A" ], [ "B", "B", "B" ], [ "B", "B", "C" ], [ "B", "C", "A" ], [ "B", "C", "B" ], [ "B", "C", "C" ], [ "C", "A", "A" ], [ "C", "A", "B" ], [ "C", "A", "C" ], [ "C", "B", "A" ], [ "C", "B", "B" ], [ "C", "B", "C" ], [ "C", "C", "A" ], [ "C", "C", "B" ], [ "C", "C", "C" ] ], "form": "may-vary-across", "task": "feasibility", "domain": "reviewer" } }, { "id": "choice-1-2-04", "english": "For evaluation record C10104-consequence, For reports C10104-1, C10104-2, C10104-3, the reviewer choices have distinct IDs A, B, C. C10104-1 permits only A,B,C. C10104-2 permits only A,B,C. C10104-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10104 contains precisely those three reports. Assign exactly one reviewer to each of these reports; choices may be the same or different.", "ainglish": "For evaluation record C10104-consequence, For reports C10104-1, C10104-2, C10104-3, the reviewer choices have distinct IDs A, B, C. C10104-1 permits only A,B,C. C10104-2 permits only A,B,C. C10104-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10104 contains precisely those three reports. Assign exactly one reviewer to each of these reports, may-vary-across(C10104).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "no", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "may-vary-across:consequence", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "B" ], [ "A", "A", "C" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "A", "B", "C" ], [ "A", "C", "A" ], [ "A", "C", "B" ], [ "A", "C", "C" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "A", "C" ], [ "B", "B", "A" ], [ "B", "B", "B" ], [ "B", "B", "C" ], [ "B", "C", "A" ], [ "B", "C", "B" ], [ "B", "C", "C" ], [ "C", "A", "A" ], [ "C", "A", "B" ], [ "C", "A", "C" ], [ "C", "B", "A" ], [ "C", "B", "B" ], [ "C", "B", "C" ], [ "C", "C", "A" ], [ "C", "C", "B" ], [ "C", "C", "C" ] ], "form": "may-vary-across", "task": "consequence", "domain": "reviewer" } }, { "id": "choice-0-0-05", "english": "For evaluation record C10105-admissibility, For documents C10105-1, C10105-2, C10105-3, the font-family choices have distinct IDs A, B, C. C10105-1 permits only A,B,C. C10105-2 permits only A,B,C. C10105-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10105 contains precisely those three documents. Assign the same single font-family to all three documents.", "ainglish": "For evaluation record C10105-admissibility, For documents C10105-1, C10105-2, C10105-3, the font-family choices have distinct IDs A, B, C. C10105-1 permits only A,B,C. C10105-2 permits only A,B,C. C10105-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10105 contains precisely those three documents. Assign exactly one font-family to each of these documents, same-for-all(C10105).", "question": "A proposed plan uses IDs A,B,A in the listed member order. Does that plan obey every stated requirement?", "answer": "no", "options": [ "the information is insufficient", "yes", "no", "no feasible assignment exists" ], "settlement_stratum": "same-for-all:admissibility", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "B", "B", "B" ], [ "C", "C", "C" ] ], "form": "same-for-all", "task": "admissibility", "domain": "font-family" } }, { "id": "choice-0-1-05", "english": "For evaluation record C10105-feasibility, For documents C10105-1, C10105-2, C10105-3, the font-family choices have distinct IDs A, B, C. C10105-1 permits only A,B,C. C10105-2 permits only A,B,C. C10105-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10105 contains precisely those three documents. Assign the same single font-family to all three documents.", "ainglish": "For evaluation record C10105-feasibility, For documents C10105-1, C10105-2, C10105-3, the font-family choices have distinct IDs A, B, C. C10105-1 permits only A,B,C. C10105-2 permits only A,B,C. C10105-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10105 contains precisely those three documents. Assign exactly one font-family to each of these documents, same-for-all(C10105).", "question": "Can any complete plan obey all the stated requirements?", "answer": "yes", "options": [ "no", "no feasible assignment exists", "the information is insufficient", "yes" ], "settlement_stratum": "same-for-all:feasibility", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "B", "B", "B" ], [ "C", "C", "C" ] ], "form": "same-for-all", "task": "feasibility", "domain": "font-family" } }, { "id": "choice-0-2-05", "english": "For evaluation record C10105-consequence, For documents C10105-1, C10105-2, C10105-3, the font-family choices have distinct IDs A, B, C. C10105-1 permits only A,B,C. C10105-2 permits only A,B,C. C10105-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10105 contains precisely those three documents. Assign the same single font-family to all three documents.", "ainglish": "For evaluation record C10105-consequence, For documents C10105-1, C10105-2, C10105-3, the font-family choices have distinct IDs A, B, C. C10105-1 permits only A,B,C. C10105-2 permits only A,B,C. C10105-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10105 contains precisely those three documents. Assign exactly one font-family to each of these documents, same-for-all(C10105).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "yes", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "same-for-all:consequence", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "B", "B", "B" ], [ "C", "C", "C" ] ], "form": "same-for-all", "task": "consequence", "domain": "font-family" } }, { "id": "choice-1-0-05", "english": "For evaluation record C10105-admissibility, For documents C10105-1, C10105-2, C10105-3, the font-family choices have distinct IDs A, B, C. C10105-1 permits only A,B,C. C10105-2 permits only A,B,C. C10105-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10105 contains precisely those three documents. Assign exactly one font-family to each of these documents; choices may be the same or different.", "ainglish": "For evaluation record C10105-admissibility, For documents C10105-1, C10105-2, C10105-3, the font-family choices have distinct IDs A, B, C. C10105-1 permits only A,B,C. C10105-2 permits only A,B,C. C10105-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10105 contains precisely those three documents. Assign exactly one font-family to each of these documents, may-vary-across(C10105).", "question": "A proposed plan uses IDs A,B,A in the listed member order. Does that plan obey every stated requirement?", "answer": "yes", "options": [ "the information is insufficient", "yes", "no", "no feasible assignment exists" ], "settlement_stratum": "may-vary-across:admissibility", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "B" ], [ "A", "A", "C" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "A", "B", "C" ], [ "A", "C", "A" ], [ "A", "C", "B" ], [ "A", "C", "C" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "A", "C" ], [ "B", "B", "A" ], [ "B", "B", "B" ], [ "B", "B", "C" ], [ "B", "C", "A" ], [ "B", "C", "B" ], [ "B", "C", "C" ], [ "C", "A", "A" ], [ "C", "A", "B" ], [ "C", "A", "C" ], [ "C", "B", "A" ], [ "C", "B", "B" ], [ "C", "B", "C" ], [ "C", "C", "A" ], [ "C", "C", "B" ], [ "C", "C", "C" ] ], "form": "may-vary-across", "task": "admissibility", "domain": "font-family" } }, { "id": "choice-1-1-05", "english": "For evaluation record C10105-feasibility, For documents C10105-1, C10105-2, C10105-3, the font-family choices have distinct IDs A, B, C. C10105-1 permits only A,B,C. C10105-2 permits only A,B,C. C10105-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10105 contains precisely those three documents. Assign exactly one font-family to each of these documents; choices may be the same or different.", "ainglish": "For evaluation record C10105-feasibility, For documents C10105-1, C10105-2, C10105-3, the font-family choices have distinct IDs A, B, C. C10105-1 permits only A,B,C. C10105-2 permits only A,B,C. C10105-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10105 contains precisely those three documents. Assign exactly one font-family to each of these documents, may-vary-across(C10105).", "question": "Can any complete plan obey all the stated requirements?", "answer": "yes", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "may-vary-across:feasibility", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "B" ], [ "A", "A", "C" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "A", "B", "C" ], [ "A", "C", "A" ], [ "A", "C", "B" ], [ "A", "C", "C" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "A", "C" ], [ "B", "B", "A" ], [ "B", "B", "B" ], [ "B", "B", "C" ], [ "B", "C", "A" ], [ "B", "C", "B" ], [ "B", "C", "C" ], [ "C", "A", "A" ], [ "C", "A", "B" ], [ "C", "A", "C" ], [ "C", "B", "A" ], [ "C", "B", "B" ], [ "C", "B", "C" ], [ "C", "C", "A" ], [ "C", "C", "B" ], [ "C", "C", "C" ] ], "form": "may-vary-across", "task": "feasibility", "domain": "font-family" } }, { "id": "choice-1-2-05", "english": "For evaluation record C10105-consequence, For documents C10105-1, C10105-2, C10105-3, the font-family choices have distinct IDs A, B, C. C10105-1 permits only A,B,C. C10105-2 permits only A,B,C. C10105-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10105 contains precisely those three documents. Assign exactly one font-family to each of these documents; choices may be the same or different.", "ainglish": "For evaluation record C10105-consequence, For documents C10105-1, C10105-2, C10105-3, the font-family choices have distinct IDs A, B, C. C10105-1 permits only A,B,C. C10105-2 permits only A,B,C. C10105-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10105 contains precisely those three documents. Assign exactly one font-family to each of these documents, may-vary-across(C10105).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "no", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "may-vary-across:consequence", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "B" ], [ "A", "A", "C" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "A", "B", "C" ], [ "A", "C", "A" ], [ "A", "C", "B" ], [ "A", "C", "C" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "A", "C" ], [ "B", "B", "A" ], [ "B", "B", "B" ], [ "B", "B", "C" ], [ "B", "C", "A" ], [ "B", "C", "B" ], [ "B", "C", "C" ], [ "C", "A", "A" ], [ "C", "A", "B" ], [ "C", "A", "C" ], [ "C", "B", "A" ], [ "C", "B", "B" ], [ "C", "B", "C" ], [ "C", "C", "A" ], [ "C", "C", "B" ], [ "C", "C", "C" ] ], "form": "may-vary-across", "task": "consequence", "domain": "font-family" } }, { "id": "choice-0-0-06", "english": "For evaluation record C10106-admissibility, For analyses C10106-1, C10106-2, C10106-3, the source-dataset choices have distinct IDs A, B, C. C10106-1 permits only A,B,C. C10106-2 permits only A,B,C. C10106-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10106 contains precisely those three analyses. Assign the same single source-dataset to all three analyses.", "ainglish": "For evaluation record C10106-admissibility, For analyses C10106-1, C10106-2, C10106-3, the source-dataset choices have distinct IDs A, B, C. C10106-1 permits only A,B,C. C10106-2 permits only A,B,C. C10106-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10106 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses, same-for-all(C10106).", "question": "A proposed plan uses IDs A,B,A in the listed member order. Does that plan obey every stated requirement?", "answer": "no", "options": [ "no", "no feasible assignment exists", "the information is insufficient", "yes" ], "settlement_stratum": "same-for-all:admissibility", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "B", "B", "B" ], [ "C", "C", "C" ] ], "form": "same-for-all", "task": "admissibility", "domain": "source-dataset" } }, { "id": "choice-0-1-06", "english": "For evaluation record C10106-feasibility, For analyses C10106-1, C10106-2, C10106-3, the source-dataset choices have distinct IDs A, B, C. C10106-1 permits only A,B,C. C10106-2 permits only A,B,C. C10106-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10106 contains precisely those three analyses. Assign the same single source-dataset to all three analyses.", "ainglish": "For evaluation record C10106-feasibility, For analyses C10106-1, C10106-2, C10106-3, the source-dataset choices have distinct IDs A, B, C. C10106-1 permits only A,B,C. C10106-2 permits only A,B,C. C10106-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10106 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses, same-for-all(C10106).", "question": "Can any complete plan obey all the stated requirements?", "answer": "yes", "options": [ "the information is insufficient", "yes", "no", "no feasible assignment exists" ], "settlement_stratum": "same-for-all:feasibility", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "B", "B", "B" ], [ "C", "C", "C" ] ], "form": "same-for-all", "task": "feasibility", "domain": "source-dataset" } }, { "id": "choice-0-2-06", "english": "For evaluation record C10106-consequence, For analyses C10106-1, C10106-2, C10106-3, the source-dataset choices have distinct IDs A, B, C. C10106-1 permits only A,B,C. C10106-2 permits only A,B,C. C10106-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10106 contains precisely those three analyses. Assign the same single source-dataset to all three analyses.", "ainglish": "For evaluation record C10106-consequence, For analyses C10106-1, C10106-2, C10106-3, the source-dataset choices have distinct IDs A, B, C. C10106-1 permits only A,B,C. C10106-2 permits only A,B,C. C10106-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10106 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses, same-for-all(C10106).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "yes", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "same-for-all:consequence", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "B", "B", "B" ], [ "C", "C", "C" ] ], "form": "same-for-all", "task": "consequence", "domain": "source-dataset" } }, { "id": "choice-1-0-06", "english": "For evaluation record C10106-admissibility, For analyses C10106-1, C10106-2, C10106-3, the source-dataset choices have distinct IDs A, B, C. C10106-1 permits only A,B,C. C10106-2 permits only A,B,C. C10106-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10106 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses; choices may be the same or different.", "ainglish": "For evaluation record C10106-admissibility, For analyses C10106-1, C10106-2, C10106-3, the source-dataset choices have distinct IDs A, B, C. C10106-1 permits only A,B,C. C10106-2 permits only A,B,C. C10106-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10106 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses, may-vary-across(C10106).", "question": "A proposed plan uses IDs A,B,A in the listed member order. Does that plan obey every stated requirement?", "answer": "yes", "options": [ "no", "no feasible assignment exists", "the information is insufficient", "yes" ], "settlement_stratum": "may-vary-across:admissibility", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "B" ], [ "A", "A", "C" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "A", "B", "C" ], [ "A", "C", "A" ], [ "A", "C", "B" ], [ "A", "C", "C" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "A", "C" ], [ "B", "B", "A" ], [ "B", "B", "B" ], [ "B", "B", "C" ], [ "B", "C", "A" ], [ "B", "C", "B" ], [ "B", "C", "C" ], [ "C", "A", "A" ], [ "C", "A", "B" ], [ "C", "A", "C" ], [ "C", "B", "A" ], [ "C", "B", "B" ], [ "C", "B", "C" ], [ "C", "C", "A" ], [ "C", "C", "B" ], [ "C", "C", "C" ] ], "form": "may-vary-across", "task": "admissibility", "domain": "source-dataset" } }, { "id": "choice-1-1-06", "english": "For evaluation record C10106-feasibility, For analyses C10106-1, C10106-2, C10106-3, the source-dataset choices have distinct IDs A, B, C. C10106-1 permits only A,B,C. C10106-2 permits only A,B,C. C10106-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10106 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses; choices may be the same or different.", "ainglish": "For evaluation record C10106-feasibility, For analyses C10106-1, C10106-2, C10106-3, the source-dataset choices have distinct IDs A, B, C. C10106-1 permits only A,B,C. C10106-2 permits only A,B,C. C10106-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10106 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses, may-vary-across(C10106).", "question": "Can any complete plan obey all the stated requirements?", "answer": "yes", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "may-vary-across:feasibility", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "B" ], [ "A", "A", "C" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "A", "B", "C" ], [ "A", "C", "A" ], [ "A", "C", "B" ], [ "A", "C", "C" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "A", "C" ], [ "B", "B", "A" ], [ "B", "B", "B" ], [ "B", "B", "C" ], [ "B", "C", "A" ], [ "B", "C", "B" ], [ "B", "C", "C" ], [ "C", "A", "A" ], [ "C", "A", "B" ], [ "C", "A", "C" ], [ "C", "B", "A" ], [ "C", "B", "B" ], [ "C", "B", "C" ], [ "C", "C", "A" ], [ "C", "C", "B" ], [ "C", "C", "C" ] ], "form": "may-vary-across", "task": "feasibility", "domain": "source-dataset" } }, { "id": "choice-1-2-06", "english": "For evaluation record C10106-consequence, For analyses C10106-1, C10106-2, C10106-3, the source-dataset choices have distinct IDs A, B, C. C10106-1 permits only A,B,C. C10106-2 permits only A,B,C. C10106-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10106 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses; choices may be the same or different.", "ainglish": "For evaluation record C10106-consequence, For analyses C10106-1, C10106-2, C10106-3, the source-dataset choices have distinct IDs A, B, C. C10106-1 permits only A,B,C. C10106-2 permits only A,B,C. C10106-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10106 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses, may-vary-across(C10106).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "no", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "may-vary-across:consequence", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "B" ], [ "A", "A", "C" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "A", "B", "C" ], [ "A", "C", "A" ], [ "A", "C", "B" ], [ "A", "C", "C" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "A", "C" ], [ "B", "B", "A" ], [ "B", "B", "B" ], [ "B", "B", "C" ], [ "B", "C", "A" ], [ "B", "C", "B" ], [ "B", "C", "C" ], [ "C", "A", "A" ], [ "C", "A", "B" ], [ "C", "A", "C" ], [ "C", "B", "A" ], [ "C", "B", "B" ], [ "C", "B", "C" ], [ "C", "C", "A" ], [ "C", "C", "B" ], [ "C", "C", "C" ] ], "form": "may-vary-across", "task": "consequence", "domain": "source-dataset" } }, { "id": "choice-0-0-07", "english": "For evaluation record C10107-admissibility, For tasks C10107-1, C10107-2, C10107-3, the deadline choices have distinct IDs A, B, C. C10107-1 permits only A,B,C. C10107-2 permits only A,B,C. C10107-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10107 contains precisely those three tasks. Assign the same single deadline to all three tasks.", "ainglish": "For evaluation record C10107-admissibility, For tasks C10107-1, C10107-2, C10107-3, the deadline choices have distinct IDs A, B, C. C10107-1 permits only A,B,C. C10107-2 permits only A,B,C. C10107-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10107 contains precisely those three tasks. Assign exactly one deadline to each of these tasks, same-for-all(C10107).", "question": "A proposed plan uses IDs A,B,A in the listed member order. Does that plan obey every stated requirement?", "answer": "no", "options": [ "the information is insufficient", "yes", "no", "no feasible assignment exists" ], "settlement_stratum": "same-for-all:admissibility", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "B", "B", "B" ], [ "C", "C", "C" ] ], "form": "same-for-all", "task": "admissibility", "domain": "deadline" } }, { "id": "choice-0-1-07", "english": "For evaluation record C10107-feasibility, For tasks C10107-1, C10107-2, C10107-3, the deadline choices have distinct IDs A, B, C. C10107-1 permits only A,B,C. C10107-2 permits only A,B,C. C10107-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10107 contains precisely those three tasks. Assign the same single deadline to all three tasks.", "ainglish": "For evaluation record C10107-feasibility, For tasks C10107-1, C10107-2, C10107-3, the deadline choices have distinct IDs A, B, C. C10107-1 permits only A,B,C. C10107-2 permits only A,B,C. C10107-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10107 contains precisely those three tasks. Assign exactly one deadline to each of these tasks, same-for-all(C10107).", "question": "Can any complete plan obey all the stated requirements?", "answer": "yes", "options": [ "no", "no feasible assignment exists", "the information is insufficient", "yes" ], "settlement_stratum": "same-for-all:feasibility", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "B", "B", "B" ], [ "C", "C", "C" ] ], "form": "same-for-all", "task": "feasibility", "domain": "deadline" } }, { "id": "choice-0-2-07", "english": "For evaluation record C10107-consequence, For tasks C10107-1, C10107-2, C10107-3, the deadline choices have distinct IDs A, B, C. C10107-1 permits only A,B,C. C10107-2 permits only A,B,C. C10107-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10107 contains precisely those three tasks. Assign the same single deadline to all three tasks.", "ainglish": "For evaluation record C10107-consequence, For tasks C10107-1, C10107-2, C10107-3, the deadline choices have distinct IDs A, B, C. C10107-1 permits only A,B,C. C10107-2 permits only A,B,C. C10107-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10107 contains precisely those three tasks. Assign exactly one deadline to each of these tasks, same-for-all(C10107).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "yes", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "same-for-all:consequence", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "B", "B", "B" ], [ "C", "C", "C" ] ], "form": "same-for-all", "task": "consequence", "domain": "deadline" } }, { "id": "choice-1-0-07", "english": "For evaluation record C10107-admissibility, For tasks C10107-1, C10107-2, C10107-3, the deadline choices have distinct IDs A, B, C. C10107-1 permits only A,B,C. C10107-2 permits only A,B,C. C10107-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10107 contains precisely those three tasks. Assign exactly one deadline to each of these tasks; choices may be the same or different.", "ainglish": "For evaluation record C10107-admissibility, For tasks C10107-1, C10107-2, C10107-3, the deadline choices have distinct IDs A, B, C. C10107-1 permits only A,B,C. C10107-2 permits only A,B,C. C10107-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10107 contains precisely those three tasks. Assign exactly one deadline to each of these tasks, may-vary-across(C10107).", "question": "A proposed plan uses IDs A,B,A in the listed member order. Does that plan obey every stated requirement?", "answer": "yes", "options": [ "the information is insufficient", "yes", "no", "no feasible assignment exists" ], "settlement_stratum": "may-vary-across:admissibility", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "B" ], [ "A", "A", "C" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "A", "B", "C" ], [ "A", "C", "A" ], [ "A", "C", "B" ], [ "A", "C", "C" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "A", "C" ], [ "B", "B", "A" ], [ "B", "B", "B" ], [ "B", "B", "C" ], [ "B", "C", "A" ], [ "B", "C", "B" ], [ "B", "C", "C" ], [ "C", "A", "A" ], [ "C", "A", "B" ], [ "C", "A", "C" ], [ "C", "B", "A" ], [ "C", "B", "B" ], [ "C", "B", "C" ], [ "C", "C", "A" ], [ "C", "C", "B" ], [ "C", "C", "C" ] ], "form": "may-vary-across", "task": "admissibility", "domain": "deadline" } }, { "id": "choice-1-1-07", "english": "For evaluation record C10107-feasibility, For tasks C10107-1, C10107-2, C10107-3, the deadline choices have distinct IDs A, B, C. C10107-1 permits only A,B,C. C10107-2 permits only A,B,C. C10107-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10107 contains precisely those three tasks. Assign exactly one deadline to each of these tasks; choices may be the same or different.", "ainglish": "For evaluation record C10107-feasibility, For tasks C10107-1, C10107-2, C10107-3, the deadline choices have distinct IDs A, B, C. C10107-1 permits only A,B,C. C10107-2 permits only A,B,C. C10107-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10107 contains precisely those three tasks. Assign exactly one deadline to each of these tasks, may-vary-across(C10107).", "question": "Can any complete plan obey all the stated requirements?", "answer": "yes", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "may-vary-across:feasibility", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "B" ], [ "A", "A", "C" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "A", "B", "C" ], [ "A", "C", "A" ], [ "A", "C", "B" ], [ "A", "C", "C" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "A", "C" ], [ "B", "B", "A" ], [ "B", "B", "B" ], [ "B", "B", "C" ], [ "B", "C", "A" ], [ "B", "C", "B" ], [ "B", "C", "C" ], [ "C", "A", "A" ], [ "C", "A", "B" ], [ "C", "A", "C" ], [ "C", "B", "A" ], [ "C", "B", "B" ], [ "C", "B", "C" ], [ "C", "C", "A" ], [ "C", "C", "B" ], [ "C", "C", "C" ] ], "form": "may-vary-across", "task": "feasibility", "domain": "deadline" } }, { "id": "choice-1-2-07", "english": "For evaluation record C10107-consequence, For tasks C10107-1, C10107-2, C10107-3, the deadline choices have distinct IDs A, B, C. C10107-1 permits only A,B,C. C10107-2 permits only A,B,C. C10107-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10107 contains precisely those three tasks. Assign exactly one deadline to each of these tasks; choices may be the same or different.", "ainglish": "For evaluation record C10107-consequence, For tasks C10107-1, C10107-2, C10107-3, the deadline choices have distinct IDs A, B, C. C10107-1 permits only A,B,C. C10107-2 permits only A,B,C. C10107-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10107 contains precisely those three tasks. Assign exactly one deadline to each of these tasks, may-vary-across(C10107).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "no", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "may-vary-across:consequence", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "B" ], [ "A", "A", "C" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "A", "B", "C" ], [ "A", "C", "A" ], [ "A", "C", "B" ], [ "A", "C", "C" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "A", "C" ], [ "B", "B", "A" ], [ "B", "B", "B" ], [ "B", "B", "C" ], [ "B", "C", "A" ], [ "B", "C", "B" ], [ "B", "C", "C" ], [ "C", "A", "A" ], [ "C", "A", "B" ], [ "C", "A", "C" ], [ "C", "B", "A" ], [ "C", "B", "B" ], [ "C", "B", "C" ], [ "C", "C", "A" ], [ "C", "C", "B" ], [ "C", "C", "C" ] ], "form": "may-vary-across", "task": "consequence", "domain": "deadline" } }, { "id": "choice-0-0-08", "english": "For evaluation record C10108-admissibility, For reports C10108-1, C10108-2, C10108-3, the reviewer choices have distinct IDs A, B, C. C10108-1 permits only A,B,C. C10108-2 permits only A,B,C. C10108-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10108 contains precisely those three reports. Assign the same single reviewer to all three reports.", "ainglish": "For evaluation record C10108-admissibility, For reports C10108-1, C10108-2, C10108-3, the reviewer choices have distinct IDs A, B, C. C10108-1 permits only A,B,C. C10108-2 permits only A,B,C. C10108-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10108 contains precisely those three reports. Assign exactly one reviewer to each of these reports, same-for-all(C10108).", "question": "A proposed plan uses IDs A,B,C in the listed member order. Does that plan obey every stated requirement?", "answer": "no", "options": [ "no", "no feasible assignment exists", "the information is insufficient", "yes" ], "settlement_stratum": "same-for-all:admissibility", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "C" ], "feasible": [ [ "A", "A", "A" ], [ "B", "B", "B" ], [ "C", "C", "C" ] ], "form": "same-for-all", "task": "admissibility", "domain": "reviewer" } }, { "id": "choice-0-1-08", "english": "For evaluation record C10108-feasibility, For reports C10108-1, C10108-2, C10108-3, the reviewer choices have distinct IDs A, B, C. C10108-1 permits only A,B,C. C10108-2 permits only A,B,C. C10108-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10108 contains precisely those three reports. Assign the same single reviewer to all three reports.", "ainglish": "For evaluation record C10108-feasibility, For reports C10108-1, C10108-2, C10108-3, the reviewer choices have distinct IDs A, B, C. C10108-1 permits only A,B,C. C10108-2 permits only A,B,C. C10108-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10108 contains precisely those three reports. Assign exactly one reviewer to each of these reports, same-for-all(C10108).", "question": "Can any complete plan obey all the stated requirements?", "answer": "yes", "options": [ "the information is insufficient", "yes", "no", "no feasible assignment exists" ], "settlement_stratum": "same-for-all:feasibility", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "C" ], "feasible": [ [ "A", "A", "A" ], [ "B", "B", "B" ], [ "C", "C", "C" ] ], "form": "same-for-all", "task": "feasibility", "domain": "reviewer" } }, { "id": "choice-0-2-08", "english": "For evaluation record C10108-consequence, For reports C10108-1, C10108-2, C10108-3, the reviewer choices have distinct IDs A, B, C. C10108-1 permits only A,B,C. C10108-2 permits only A,B,C. C10108-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10108 contains precisely those three reports. Assign the same single reviewer to all three reports.", "ainglish": "For evaluation record C10108-consequence, For reports C10108-1, C10108-2, C10108-3, the reviewer choices have distinct IDs A, B, C. C10108-1 permits only A,B,C. C10108-2 permits only A,B,C. C10108-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10108 contains precisely those three reports. Assign exactly one reviewer to each of these reports, same-for-all(C10108).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "yes", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "same-for-all:consequence", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "C" ], "feasible": [ [ "A", "A", "A" ], [ "B", "B", "B" ], [ "C", "C", "C" ] ], "form": "same-for-all", "task": "consequence", "domain": "reviewer" } }, { "id": "choice-1-0-08", "english": "For evaluation record C10108-admissibility, For reports C10108-1, C10108-2, C10108-3, the reviewer choices have distinct IDs A, B, C. C10108-1 permits only A,B,C. C10108-2 permits only A,B,C. C10108-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10108 contains precisely those three reports. Assign exactly one reviewer to each of these reports; choices may be the same or different.", "ainglish": "For evaluation record C10108-admissibility, For reports C10108-1, C10108-2, C10108-3, the reviewer choices have distinct IDs A, B, C. C10108-1 permits only A,B,C. C10108-2 permits only A,B,C. C10108-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10108 contains precisely those three reports. Assign exactly one reviewer to each of these reports, may-vary-across(C10108).", "question": "A proposed plan uses IDs A,B,C in the listed member order. Does that plan obey every stated requirement?", "answer": "yes", "options": [ "no", "no feasible assignment exists", "the information is insufficient", "yes" ], "settlement_stratum": "may-vary-across:admissibility", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "C" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "B" ], [ "A", "A", "C" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "A", "B", "C" ], [ "A", "C", "A" ], [ "A", "C", "B" ], [ "A", "C", "C" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "A", "C" ], [ "B", "B", "A" ], [ "B", "B", "B" ], [ "B", "B", "C" ], [ "B", "C", "A" ], [ "B", "C", "B" ], [ "B", "C", "C" ], [ "C", "A", "A" ], [ "C", "A", "B" ], [ "C", "A", "C" ], [ "C", "B", "A" ], [ "C", "B", "B" ], [ "C", "B", "C" ], [ "C", "C", "A" ], [ "C", "C", "B" ], [ "C", "C", "C" ] ], "form": "may-vary-across", "task": "admissibility", "domain": "reviewer" } }, { "id": "choice-1-1-08", "english": "For evaluation record C10108-feasibility, For reports C10108-1, C10108-2, C10108-3, the reviewer choices have distinct IDs A, B, C. C10108-1 permits only A,B,C. C10108-2 permits only A,B,C. C10108-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10108 contains precisely those three reports. Assign exactly one reviewer to each of these reports; choices may be the same or different.", "ainglish": "For evaluation record C10108-feasibility, For reports C10108-1, C10108-2, C10108-3, the reviewer choices have distinct IDs A, B, C. C10108-1 permits only A,B,C. C10108-2 permits only A,B,C. C10108-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10108 contains precisely those three reports. Assign exactly one reviewer to each of these reports, may-vary-across(C10108).", "question": "Can any complete plan obey all the stated requirements?", "answer": "yes", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "may-vary-across:feasibility", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "C" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "B" ], [ "A", "A", "C" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "A", "B", "C" ], [ "A", "C", "A" ], [ "A", "C", "B" ], [ "A", "C", "C" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "A", "C" ], [ "B", "B", "A" ], [ "B", "B", "B" ], [ "B", "B", "C" ], [ "B", "C", "A" ], [ "B", "C", "B" ], [ "B", "C", "C" ], [ "C", "A", "A" ], [ "C", "A", "B" ], [ "C", "A", "C" ], [ "C", "B", "A" ], [ "C", "B", "B" ], [ "C", "B", "C" ], [ "C", "C", "A" ], [ "C", "C", "B" ], [ "C", "C", "C" ] ], "form": "may-vary-across", "task": "feasibility", "domain": "reviewer" } }, { "id": "choice-1-2-08", "english": "For evaluation record C10108-consequence, For reports C10108-1, C10108-2, C10108-3, the reviewer choices have distinct IDs A, B, C. C10108-1 permits only A,B,C. C10108-2 permits only A,B,C. C10108-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10108 contains precisely those three reports. Assign exactly one reviewer to each of these reports; choices may be the same or different.", "ainglish": "For evaluation record C10108-consequence, For reports C10108-1, C10108-2, C10108-3, the reviewer choices have distinct IDs A, B, C. C10108-1 permits only A,B,C. C10108-2 permits only A,B,C. C10108-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10108 contains precisely those three reports. Assign exactly one reviewer to each of these reports, may-vary-across(C10108).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "no", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "may-vary-across:consequence", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "C" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "B" ], [ "A", "A", "C" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "A", "B", "C" ], [ "A", "C", "A" ], [ "A", "C", "B" ], [ "A", "C", "C" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "A", "C" ], [ "B", "B", "A" ], [ "B", "B", "B" ], [ "B", "B", "C" ], [ "B", "C", "A" ], [ "B", "C", "B" ], [ "B", "C", "C" ], [ "C", "A", "A" ], [ "C", "A", "B" ], [ "C", "A", "C" ], [ "C", "B", "A" ], [ "C", "B", "B" ], [ "C", "B", "C" ], [ "C", "C", "A" ], [ "C", "C", "B" ], [ "C", "C", "C" ] ], "form": "may-vary-across", "task": "consequence", "domain": "reviewer" } }, { "id": "choice-0-0-09", "english": "For evaluation record C10109-admissibility, For documents C10109-1, C10109-2, C10109-3, the font-family choices have distinct IDs A, B, C. C10109-1 permits only A,B,C. C10109-2 permits only A,B,C. C10109-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10109 contains precisely those three documents. Assign the same single font-family to all three documents.", "ainglish": "For evaluation record C10109-admissibility, For documents C10109-1, C10109-2, C10109-3, the font-family choices have distinct IDs A, B, C. C10109-1 permits only A,B,C. C10109-2 permits only A,B,C. C10109-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10109 contains precisely those three documents. Assign exactly one font-family to each of these documents, same-for-all(C10109).", "question": "A proposed plan uses IDs A,B,C in the listed member order. Does that plan obey every stated requirement?", "answer": "no", "options": [ "the information is insufficient", "yes", "no", "no feasible assignment exists" ], "settlement_stratum": "same-for-all:admissibility", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "C" ], "feasible": [ [ "A", "A", "A" ], [ "B", "B", "B" ], [ "C", "C", "C" ] ], "form": "same-for-all", "task": "admissibility", "domain": "font-family" } }, { "id": "choice-0-1-09", "english": "For evaluation record C10109-feasibility, For documents C10109-1, C10109-2, C10109-3, the font-family choices have distinct IDs A, B, C. C10109-1 permits only A,B,C. C10109-2 permits only A,B,C. C10109-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10109 contains precisely those three documents. Assign the same single font-family to all three documents.", "ainglish": "For evaluation record C10109-feasibility, For documents C10109-1, C10109-2, C10109-3, the font-family choices have distinct IDs A, B, C. C10109-1 permits only A,B,C. C10109-2 permits only A,B,C. C10109-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10109 contains precisely those three documents. Assign exactly one font-family to each of these documents, same-for-all(C10109).", "question": "Can any complete plan obey all the stated requirements?", "answer": "yes", "options": [ "no", "no feasible assignment exists", "the information is insufficient", "yes" ], "settlement_stratum": "same-for-all:feasibility", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "C" ], "feasible": [ [ "A", "A", "A" ], [ "B", "B", "B" ], [ "C", "C", "C" ] ], "form": "same-for-all", "task": "feasibility", "domain": "font-family" } }, { "id": "choice-0-2-09", "english": "For evaluation record C10109-consequence, For documents C10109-1, C10109-2, C10109-3, the font-family choices have distinct IDs A, B, C. C10109-1 permits only A,B,C. C10109-2 permits only A,B,C. C10109-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10109 contains precisely those three documents. Assign the same single font-family to all three documents.", "ainglish": "For evaluation record C10109-consequence, For documents C10109-1, C10109-2, C10109-3, the font-family choices have distinct IDs A, B, C. C10109-1 permits only A,B,C. C10109-2 permits only A,B,C. C10109-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10109 contains precisely those three documents. Assign exactly one font-family to each of these documents, same-for-all(C10109).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "yes", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "same-for-all:consequence", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "C" ], "feasible": [ [ "A", "A", "A" ], [ "B", "B", "B" ], [ "C", "C", "C" ] ], "form": "same-for-all", "task": "consequence", "domain": "font-family" } }, { "id": "choice-1-0-09", "english": "For evaluation record C10109-admissibility, For documents C10109-1, C10109-2, C10109-3, the font-family choices have distinct IDs A, B, C. C10109-1 permits only A,B,C. C10109-2 permits only A,B,C. C10109-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10109 contains precisely those three documents. Assign exactly one font-family to each of these documents; choices may be the same or different.", "ainglish": "For evaluation record C10109-admissibility, For documents C10109-1, C10109-2, C10109-3, the font-family choices have distinct IDs A, B, C. C10109-1 permits only A,B,C. C10109-2 permits only A,B,C. C10109-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10109 contains precisely those three documents. Assign exactly one font-family to each of these documents, may-vary-across(C10109).", "question": "A proposed plan uses IDs A,B,C in the listed member order. Does that plan obey every stated requirement?", "answer": "yes", "options": [ "the information is insufficient", "yes", "no", "no feasible assignment exists" ], "settlement_stratum": "may-vary-across:admissibility", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "C" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "B" ], [ "A", "A", "C" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "A", "B", "C" ], [ "A", "C", "A" ], [ "A", "C", "B" ], [ "A", "C", "C" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "A", "C" ], [ "B", "B", "A" ], [ "B", "B", "B" ], [ "B", "B", "C" ], [ "B", "C", "A" ], [ "B", "C", "B" ], [ "B", "C", "C" ], [ "C", "A", "A" ], [ "C", "A", "B" ], [ "C", "A", "C" ], [ "C", "B", "A" ], [ "C", "B", "B" ], [ "C", "B", "C" ], [ "C", "C", "A" ], [ "C", "C", "B" ], [ "C", "C", "C" ] ], "form": "may-vary-across", "task": "admissibility", "domain": "font-family" } }, { "id": "choice-1-1-09", "english": "For evaluation record C10109-feasibility, For documents C10109-1, C10109-2, C10109-3, the font-family choices have distinct IDs A, B, C. C10109-1 permits only A,B,C. C10109-2 permits only A,B,C. C10109-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10109 contains precisely those three documents. Assign exactly one font-family to each of these documents; choices may be the same or different.", "ainglish": "For evaluation record C10109-feasibility, For documents C10109-1, C10109-2, C10109-3, the font-family choices have distinct IDs A, B, C. C10109-1 permits only A,B,C. C10109-2 permits only A,B,C. C10109-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10109 contains precisely those three documents. Assign exactly one font-family to each of these documents, may-vary-across(C10109).", "question": "Can any complete plan obey all the stated requirements?", "answer": "yes", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "may-vary-across:feasibility", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "C" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "B" ], [ "A", "A", "C" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "A", "B", "C" ], [ "A", "C", "A" ], [ "A", "C", "B" ], [ "A", "C", "C" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "A", "C" ], [ "B", "B", "A" ], [ "B", "B", "B" ], [ "B", "B", "C" ], [ "B", "C", "A" ], [ "B", "C", "B" ], [ "B", "C", "C" ], [ "C", "A", "A" ], [ "C", "A", "B" ], [ "C", "A", "C" ], [ "C", "B", "A" ], [ "C", "B", "B" ], [ "C", "B", "C" ], [ "C", "C", "A" ], [ "C", "C", "B" ], [ "C", "C", "C" ] ], "form": "may-vary-across", "task": "feasibility", "domain": "font-family" } }, { "id": "choice-1-2-09", "english": "For evaluation record C10109-consequence, For documents C10109-1, C10109-2, C10109-3, the font-family choices have distinct IDs A, B, C. C10109-1 permits only A,B,C. C10109-2 permits only A,B,C. C10109-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10109 contains precisely those three documents. Assign exactly one font-family to each of these documents; choices may be the same or different.", "ainglish": "For evaluation record C10109-consequence, For documents C10109-1, C10109-2, C10109-3, the font-family choices have distinct IDs A, B, C. C10109-1 permits only A,B,C. C10109-2 permits only A,B,C. C10109-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10109 contains precisely those three documents. Assign exactly one font-family to each of these documents, may-vary-across(C10109).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "no", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "may-vary-across:consequence", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "C" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "B" ], [ "A", "A", "C" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "A", "B", "C" ], [ "A", "C", "A" ], [ "A", "C", "B" ], [ "A", "C", "C" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "A", "C" ], [ "B", "B", "A" ], [ "B", "B", "B" ], [ "B", "B", "C" ], [ "B", "C", "A" ], [ "B", "C", "B" ], [ "B", "C", "C" ], [ "C", "A", "A" ], [ "C", "A", "B" ], [ "C", "A", "C" ], [ "C", "B", "A" ], [ "C", "B", "B" ], [ "C", "B", "C" ], [ "C", "C", "A" ], [ "C", "C", "B" ], [ "C", "C", "C" ] ], "form": "may-vary-across", "task": "consequence", "domain": "font-family" } }, { "id": "choice-0-0-10", "english": "For evaluation record C10110-admissibility, For analyses C10110-1, C10110-2, C10110-3, the source-dataset choices have distinct IDs A, B, C. C10110-1 permits only A,B,C. C10110-2 permits only A,B,C. C10110-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10110 contains precisely those three analyses. Assign the same single source-dataset to all three analyses.", "ainglish": "For evaluation record C10110-admissibility, For analyses C10110-1, C10110-2, C10110-3, the source-dataset choices have distinct IDs A, B, C. C10110-1 permits only A,B,C. C10110-2 permits only A,B,C. C10110-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10110 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses, same-for-all(C10110).", "question": "A proposed plan uses IDs A,B,C in the listed member order. Does that plan obey every stated requirement?", "answer": "no", "options": [ "no", "no feasible assignment exists", "the information is insufficient", "yes" ], "settlement_stratum": "same-for-all:admissibility", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "C" ], "feasible": [ [ "A", "A", "A" ], [ "B", "B", "B" ], [ "C", "C", "C" ] ], "form": "same-for-all", "task": "admissibility", "domain": "source-dataset" } }, { "id": "choice-0-1-10", "english": "For evaluation record C10110-feasibility, For analyses C10110-1, C10110-2, C10110-3, the source-dataset choices have distinct IDs A, B, C. C10110-1 permits only A,B,C. C10110-2 permits only A,B,C. C10110-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10110 contains precisely those three analyses. Assign the same single source-dataset to all three analyses.", "ainglish": "For evaluation record C10110-feasibility, For analyses C10110-1, C10110-2, C10110-3, the source-dataset choices have distinct IDs A, B, C. C10110-1 permits only A,B,C. C10110-2 permits only A,B,C. C10110-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10110 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses, same-for-all(C10110).", "question": "Can any complete plan obey all the stated requirements?", "answer": "yes", "options": [ "the information is insufficient", "yes", "no", "no feasible assignment exists" ], "settlement_stratum": "same-for-all:feasibility", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "C" ], "feasible": [ [ "A", "A", "A" ], [ "B", "B", "B" ], [ "C", "C", "C" ] ], "form": "same-for-all", "task": "feasibility", "domain": "source-dataset" } }, { "id": "choice-0-2-10", "english": "For evaluation record C10110-consequence, For analyses C10110-1, C10110-2, C10110-3, the source-dataset choices have distinct IDs A, B, C. C10110-1 permits only A,B,C. C10110-2 permits only A,B,C. C10110-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10110 contains precisely those three analyses. Assign the same single source-dataset to all three analyses.", "ainglish": "For evaluation record C10110-consequence, For analyses C10110-1, C10110-2, C10110-3, the source-dataset choices have distinct IDs A, B, C. C10110-1 permits only A,B,C. C10110-2 permits only A,B,C. C10110-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10110 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses, same-for-all(C10110).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "yes", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "same-for-all:consequence", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "C" ], "feasible": [ [ "A", "A", "A" ], [ "B", "B", "B" ], [ "C", "C", "C" ] ], "form": "same-for-all", "task": "consequence", "domain": "source-dataset" } }, { "id": "choice-1-0-10", "english": "For evaluation record C10110-admissibility, For analyses C10110-1, C10110-2, C10110-3, the source-dataset choices have distinct IDs A, B, C. C10110-1 permits only A,B,C. C10110-2 permits only A,B,C. C10110-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10110 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses; choices may be the same or different.", "ainglish": "For evaluation record C10110-admissibility, For analyses C10110-1, C10110-2, C10110-3, the source-dataset choices have distinct IDs A, B, C. C10110-1 permits only A,B,C. C10110-2 permits only A,B,C. C10110-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10110 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses, may-vary-across(C10110).", "question": "A proposed plan uses IDs A,B,C in the listed member order. Does that plan obey every stated requirement?", "answer": "yes", "options": [ "no", "no feasible assignment exists", "the information is insufficient", "yes" ], "settlement_stratum": "may-vary-across:admissibility", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "C" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "B" ], [ "A", "A", "C" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "A", "B", "C" ], [ "A", "C", "A" ], [ "A", "C", "B" ], [ "A", "C", "C" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "A", "C" ], [ "B", "B", "A" ], [ "B", "B", "B" ], [ "B", "B", "C" ], [ "B", "C", "A" ], [ "B", "C", "B" ], [ "B", "C", "C" ], [ "C", "A", "A" ], [ "C", "A", "B" ], [ "C", "A", "C" ], [ "C", "B", "A" ], [ "C", "B", "B" ], [ "C", "B", "C" ], [ "C", "C", "A" ], [ "C", "C", "B" ], [ "C", "C", "C" ] ], "form": "may-vary-across", "task": "admissibility", "domain": "source-dataset" } }, { "id": "choice-1-1-10", "english": "For evaluation record C10110-feasibility, For analyses C10110-1, C10110-2, C10110-3, the source-dataset choices have distinct IDs A, B, C. C10110-1 permits only A,B,C. C10110-2 permits only A,B,C. C10110-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10110 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses; choices may be the same or different.", "ainglish": "For evaluation record C10110-feasibility, For analyses C10110-1, C10110-2, C10110-3, the source-dataset choices have distinct IDs A, B, C. C10110-1 permits only A,B,C. C10110-2 permits only A,B,C. C10110-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10110 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses, may-vary-across(C10110).", "question": "Can any complete plan obey all the stated requirements?", "answer": "yes", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "may-vary-across:feasibility", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "C" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "B" ], [ "A", "A", "C" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "A", "B", "C" ], [ "A", "C", "A" ], [ "A", "C", "B" ], [ "A", "C", "C" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "A", "C" ], [ "B", "B", "A" ], [ "B", "B", "B" ], [ "B", "B", "C" ], [ "B", "C", "A" ], [ "B", "C", "B" ], [ "B", "C", "C" ], [ "C", "A", "A" ], [ "C", "A", "B" ], [ "C", "A", "C" ], [ "C", "B", "A" ], [ "C", "B", "B" ], [ "C", "B", "C" ], [ "C", "C", "A" ], [ "C", "C", "B" ], [ "C", "C", "C" ] ], "form": "may-vary-across", "task": "feasibility", "domain": "source-dataset" } }, { "id": "choice-1-2-10", "english": "For evaluation record C10110-consequence, For analyses C10110-1, C10110-2, C10110-3, the source-dataset choices have distinct IDs A, B, C. C10110-1 permits only A,B,C. C10110-2 permits only A,B,C. C10110-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10110 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses; choices may be the same or different.", "ainglish": "For evaluation record C10110-consequence, For analyses C10110-1, C10110-2, C10110-3, the source-dataset choices have distinct IDs A, B, C. C10110-1 permits only A,B,C. C10110-2 permits only A,B,C. C10110-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10110 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses, may-vary-across(C10110).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "no", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "may-vary-across:consequence", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "C" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "B" ], [ "A", "A", "C" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "A", "B", "C" ], [ "A", "C", "A" ], [ "A", "C", "B" ], [ "A", "C", "C" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "A", "C" ], [ "B", "B", "A" ], [ "B", "B", "B" ], [ "B", "B", "C" ], [ "B", "C", "A" ], [ "B", "C", "B" ], [ "B", "C", "C" ], [ "C", "A", "A" ], [ "C", "A", "B" ], [ "C", "A", "C" ], [ "C", "B", "A" ], [ "C", "B", "B" ], [ "C", "B", "C" ], [ "C", "C", "A" ], [ "C", "C", "B" ], [ "C", "C", "C" ] ], "form": "may-vary-across", "task": "consequence", "domain": "source-dataset" } }, { "id": "choice-0-0-11", "english": "For evaluation record C10111-admissibility, For tasks C10111-1, C10111-2, C10111-3, the deadline choices have distinct IDs A, B, C. C10111-1 permits only A,B,C. C10111-2 permits only A,B,C. C10111-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10111 contains precisely those three tasks. Assign the same single deadline to all three tasks.", "ainglish": "For evaluation record C10111-admissibility, For tasks C10111-1, C10111-2, C10111-3, the deadline choices have distinct IDs A, B, C. C10111-1 permits only A,B,C. C10111-2 permits only A,B,C. C10111-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10111 contains precisely those three tasks. Assign exactly one deadline to each of these tasks, same-for-all(C10111).", "question": "A proposed plan uses IDs A,B,C in the listed member order. Does that plan obey every stated requirement?", "answer": "no", "options": [ "the information is insufficient", "yes", "no", "no feasible assignment exists" ], "settlement_stratum": "same-for-all:admissibility", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "C" ], "feasible": [ [ "A", "A", "A" ], [ "B", "B", "B" ], [ "C", "C", "C" ] ], "form": "same-for-all", "task": "admissibility", "domain": "deadline" } }, { "id": "choice-0-1-11", "english": "For evaluation record C10111-feasibility, For tasks C10111-1, C10111-2, C10111-3, the deadline choices have distinct IDs A, B, C. C10111-1 permits only A,B,C. C10111-2 permits only A,B,C. C10111-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10111 contains precisely those three tasks. Assign the same single deadline to all three tasks.", "ainglish": "For evaluation record C10111-feasibility, For tasks C10111-1, C10111-2, C10111-3, the deadline choices have distinct IDs A, B, C. C10111-1 permits only A,B,C. C10111-2 permits only A,B,C. C10111-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10111 contains precisely those three tasks. Assign exactly one deadline to each of these tasks, same-for-all(C10111).", "question": "Can any complete plan obey all the stated requirements?", "answer": "yes", "options": [ "no", "no feasible assignment exists", "the information is insufficient", "yes" ], "settlement_stratum": "same-for-all:feasibility", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "C" ], "feasible": [ [ "A", "A", "A" ], [ "B", "B", "B" ], [ "C", "C", "C" ] ], "form": "same-for-all", "task": "feasibility", "domain": "deadline" } }, { "id": "choice-0-2-11", "english": "For evaluation record C10111-consequence, For tasks C10111-1, C10111-2, C10111-3, the deadline choices have distinct IDs A, B, C. C10111-1 permits only A,B,C. C10111-2 permits only A,B,C. C10111-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10111 contains precisely those three tasks. Assign the same single deadline to all three tasks.", "ainglish": "For evaluation record C10111-consequence, For tasks C10111-1, C10111-2, C10111-3, the deadline choices have distinct IDs A, B, C. C10111-1 permits only A,B,C. C10111-2 permits only A,B,C. C10111-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10111 contains precisely those three tasks. Assign exactly one deadline to each of these tasks, same-for-all(C10111).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "yes", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "same-for-all:consequence", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "C" ], "feasible": [ [ "A", "A", "A" ], [ "B", "B", "B" ], [ "C", "C", "C" ] ], "form": "same-for-all", "task": "consequence", "domain": "deadline" } }, { "id": "choice-1-0-11", "english": "For evaluation record C10111-admissibility, For tasks C10111-1, C10111-2, C10111-3, the deadline choices have distinct IDs A, B, C. C10111-1 permits only A,B,C. C10111-2 permits only A,B,C. C10111-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10111 contains precisely those three tasks. Assign exactly one deadline to each of these tasks; choices may be the same or different.", "ainglish": "For evaluation record C10111-admissibility, For tasks C10111-1, C10111-2, C10111-3, the deadline choices have distinct IDs A, B, C. C10111-1 permits only A,B,C. C10111-2 permits only A,B,C. C10111-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10111 contains precisely those three tasks. Assign exactly one deadline to each of these tasks, may-vary-across(C10111).", "question": "A proposed plan uses IDs A,B,C in the listed member order. Does that plan obey every stated requirement?", "answer": "yes", "options": [ "the information is insufficient", "yes", "no", "no feasible assignment exists" ], "settlement_stratum": "may-vary-across:admissibility", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "C" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "B" ], [ "A", "A", "C" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "A", "B", "C" ], [ "A", "C", "A" ], [ "A", "C", "B" ], [ "A", "C", "C" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "A", "C" ], [ "B", "B", "A" ], [ "B", "B", "B" ], [ "B", "B", "C" ], [ "B", "C", "A" ], [ "B", "C", "B" ], [ "B", "C", "C" ], [ "C", "A", "A" ], [ "C", "A", "B" ], [ "C", "A", "C" ], [ "C", "B", "A" ], [ "C", "B", "B" ], [ "C", "B", "C" ], [ "C", "C", "A" ], [ "C", "C", "B" ], [ "C", "C", "C" ] ], "form": "may-vary-across", "task": "admissibility", "domain": "deadline" } }, { "id": "choice-1-1-11", "english": "For evaluation record C10111-feasibility, For tasks C10111-1, C10111-2, C10111-3, the deadline choices have distinct IDs A, B, C. C10111-1 permits only A,B,C. C10111-2 permits only A,B,C. C10111-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10111 contains precisely those three tasks. Assign exactly one deadline to each of these tasks; choices may be the same or different.", "ainglish": "For evaluation record C10111-feasibility, For tasks C10111-1, C10111-2, C10111-3, the deadline choices have distinct IDs A, B, C. C10111-1 permits only A,B,C. C10111-2 permits only A,B,C. C10111-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10111 contains precisely those three tasks. Assign exactly one deadline to each of these tasks, may-vary-across(C10111).", "question": "Can any complete plan obey all the stated requirements?", "answer": "yes", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "may-vary-across:feasibility", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "C" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "B" ], [ "A", "A", "C" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "A", "B", "C" ], [ "A", "C", "A" ], [ "A", "C", "B" ], [ "A", "C", "C" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "A", "C" ], [ "B", "B", "A" ], [ "B", "B", "B" ], [ "B", "B", "C" ], [ "B", "C", "A" ], [ "B", "C", "B" ], [ "B", "C", "C" ], [ "C", "A", "A" ], [ "C", "A", "B" ], [ "C", "A", "C" ], [ "C", "B", "A" ], [ "C", "B", "B" ], [ "C", "B", "C" ], [ "C", "C", "A" ], [ "C", "C", "B" ], [ "C", "C", "C" ] ], "form": "may-vary-across", "task": "feasibility", "domain": "deadline" } }, { "id": "choice-1-2-11", "english": "For evaluation record C10111-consequence, For tasks C10111-1, C10111-2, C10111-3, the deadline choices have distinct IDs A, B, C. C10111-1 permits only A,B,C. C10111-2 permits only A,B,C. C10111-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10111 contains precisely those three tasks. Assign exactly one deadline to each of these tasks; choices may be the same or different.", "ainglish": "For evaluation record C10111-consequence, For tasks C10111-1, C10111-2, C10111-3, the deadline choices have distinct IDs A, B, C. C10111-1 permits only A,B,C. C10111-2 permits only A,B,C. C10111-3 permits only A,B,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10111 contains precisely those three tasks. Assign exactly one deadline to each of these tasks, may-vary-across(C10111).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "no", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "may-vary-across:consequence", "ledger": { "eligibility": [ [ "A", "B", "C" ], [ "A", "B", "C" ], [ "A", "B", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "C" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "B" ], [ "A", "A", "C" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "A", "B", "C" ], [ "A", "C", "A" ], [ "A", "C", "B" ], [ "A", "C", "C" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "A", "C" ], [ "B", "B", "A" ], [ "B", "B", "B" ], [ "B", "B", "C" ], [ "B", "C", "A" ], [ "B", "C", "B" ], [ "B", "C", "C" ], [ "C", "A", "A" ], [ "C", "A", "B" ], [ "C", "A", "C" ], [ "C", "B", "A" ], [ "C", "B", "B" ], [ "C", "B", "C" ], [ "C", "C", "A" ], [ "C", "C", "B" ], [ "C", "C", "C" ] ], "form": "may-vary-across", "task": "consequence", "domain": "deadline" } }, { "id": "choice-0-0-12", "english": "For evaluation record C10112-admissibility, For reports C10112-1, C10112-2, C10112-3, the reviewer choices have distinct IDs A, B, C. C10112-1 permits only A. C10112-2 permits only B. C10112-3 permits only C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10112 contains precisely those three reports. Assign the same single reviewer to all three reports.", "ainglish": "For evaluation record C10112-admissibility, For reports C10112-1, C10112-2, C10112-3, the reviewer choices have distinct IDs A, B, C. C10112-1 permits only A. C10112-2 permits only B. C10112-3 permits only C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10112 contains precisely those three reports. Assign exactly one reviewer to each of these reports, same-for-all(C10112).", "question": "A proposed plan uses IDs A,B,C in the listed member order. Does that plan obey every stated requirement?", "answer": "no", "options": [ "no", "no feasible assignment exists", "the information is insufficient", "yes" ], "settlement_stratum": "same-for-all:admissibility", "ledger": { "eligibility": [ [ "A" ], [ "B" ], [ "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "C" ], "feasible": [], "form": "same-for-all", "task": "admissibility", "domain": "reviewer" } }, { "id": "choice-0-1-12", "english": "For evaluation record C10112-feasibility, For reports C10112-1, C10112-2, C10112-3, the reviewer choices have distinct IDs A, B, C. C10112-1 permits only A. C10112-2 permits only B. C10112-3 permits only C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10112 contains precisely those three reports. Assign the same single reviewer to all three reports.", "ainglish": "For evaluation record C10112-feasibility, For reports C10112-1, C10112-2, C10112-3, the reviewer choices have distinct IDs A, B, C. C10112-1 permits only A. C10112-2 permits only B. C10112-3 permits only C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10112 contains precisely those three reports. Assign exactly one reviewer to each of these reports, same-for-all(C10112).", "question": "Can any complete plan obey all the stated requirements?", "answer": "no", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "same-for-all:feasibility", "ledger": { "eligibility": [ [ "A" ], [ "B" ], [ "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "C" ], "feasible": [], "form": "same-for-all", "task": "feasibility", "domain": "reviewer" } }, { "id": "choice-0-2-12", "english": "For evaluation record C10112-consequence, For reports C10112-1, C10112-2, C10112-3, the reviewer choices have distinct IDs A, B, C. C10112-1 permits only A. C10112-2 permits only B. C10112-3 permits only C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10112 contains precisely those three reports. Assign the same single reviewer to all three reports.", "ainglish": "For evaluation record C10112-consequence, For reports C10112-1, C10112-2, C10112-3, the reviewer choices have distinct IDs A, B, C. C10112-1 permits only A. C10112-2 permits only B. C10112-3 permits only C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10112 contains precisely those three reports. Assign exactly one reviewer to each of these reports, same-for-all(C10112).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "no feasible assignment exists", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "same-for-all:consequence", "ledger": { "eligibility": [ [ "A" ], [ "B" ], [ "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "C" ], "feasible": [], "form": "same-for-all", "task": "consequence", "domain": "reviewer" } }, { "id": "choice-1-0-12", "english": "For evaluation record C10112-admissibility, For reports C10112-1, C10112-2, C10112-3, the reviewer choices have distinct IDs A, B, C. C10112-1 permits only A. C10112-2 permits only B. C10112-3 permits only C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10112 contains precisely those three reports. Assign exactly one reviewer to each of these reports; choices may be the same or different.", "ainglish": "For evaluation record C10112-admissibility, For reports C10112-1, C10112-2, C10112-3, the reviewer choices have distinct IDs A, B, C. C10112-1 permits only A. C10112-2 permits only B. C10112-3 permits only C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10112 contains precisely those three reports. Assign exactly one reviewer to each of these reports, may-vary-across(C10112).", "question": "A proposed plan uses IDs A,B,C in the listed member order. Does that plan obey every stated requirement?", "answer": "yes", "options": [ "no", "no feasible assignment exists", "the information is insufficient", "yes" ], "settlement_stratum": "may-vary-across:admissibility", "ledger": { "eligibility": [ [ "A" ], [ "B" ], [ "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "C" ], "feasible": [ [ "A", "B", "C" ] ], "form": "may-vary-across", "task": "admissibility", "domain": "reviewer" } }, { "id": "choice-1-1-12", "english": "For evaluation record C10112-feasibility, For reports C10112-1, C10112-2, C10112-3, the reviewer choices have distinct IDs A, B, C. C10112-1 permits only A. C10112-2 permits only B. C10112-3 permits only C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10112 contains precisely those three reports. Assign exactly one reviewer to each of these reports; choices may be the same or different.", "ainglish": "For evaluation record C10112-feasibility, For reports C10112-1, C10112-2, C10112-3, the reviewer choices have distinct IDs A, B, C. C10112-1 permits only A. C10112-2 permits only B. C10112-3 permits only C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10112 contains precisely those three reports. Assign exactly one reviewer to each of these reports, may-vary-across(C10112).", "question": "Can any complete plan obey all the stated requirements?", "answer": "yes", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "may-vary-across:feasibility", "ledger": { "eligibility": [ [ "A" ], [ "B" ], [ "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "C" ], "feasible": [ [ "A", "B", "C" ] ], "form": "may-vary-across", "task": "feasibility", "domain": "reviewer" } }, { "id": "choice-1-2-12", "english": "For evaluation record C10112-consequence, For reports C10112-1, C10112-2, C10112-3, the reviewer choices have distinct IDs A, B, C. C10112-1 permits only A. C10112-2 permits only B. C10112-3 permits only C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10112 contains precisely those three reports. Assign exactly one reviewer to each of these reports; choices may be the same or different.", "ainglish": "For evaluation record C10112-consequence, For reports C10112-1, C10112-2, C10112-3, the reviewer choices have distinct IDs A, B, C. C10112-1 permits only A. C10112-2 permits only B. C10112-3 permits only C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10112 contains precisely those three reports. Assign exactly one reviewer to each of these reports, may-vary-across(C10112).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "no", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "may-vary-across:consequence", "ledger": { "eligibility": [ [ "A" ], [ "B" ], [ "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "C" ], "feasible": [ [ "A", "B", "C" ] ], "form": "may-vary-across", "task": "consequence", "domain": "reviewer" } }, { "id": "choice-0-0-13", "english": "For evaluation record C10113-admissibility, For documents C10113-1, C10113-2, C10113-3, the font-family choices have distinct IDs A, B, C. C10113-1 permits only A. C10113-2 permits only B. C10113-3 permits only C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10113 contains precisely those three documents. Assign the same single font-family to all three documents.", "ainglish": "For evaluation record C10113-admissibility, For documents C10113-1, C10113-2, C10113-3, the font-family choices have distinct IDs A, B, C. C10113-1 permits only A. C10113-2 permits only B. C10113-3 permits only C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10113 contains precisely those three documents. Assign exactly one font-family to each of these documents, same-for-all(C10113).", "question": "A proposed plan uses IDs A,B,C in the listed member order. Does that plan obey every stated requirement?", "answer": "no", "options": [ "the information is insufficient", "yes", "no", "no feasible assignment exists" ], "settlement_stratum": "same-for-all:admissibility", "ledger": { "eligibility": [ [ "A" ], [ "B" ], [ "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "C" ], "feasible": [], "form": "same-for-all", "task": "admissibility", "domain": "font-family" } }, { "id": "choice-0-1-13", "english": "For evaluation record C10113-feasibility, For documents C10113-1, C10113-2, C10113-3, the font-family choices have distinct IDs A, B, C. C10113-1 permits only A. C10113-2 permits only B. C10113-3 permits only C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10113 contains precisely those three documents. Assign the same single font-family to all three documents.", "ainglish": "For evaluation record C10113-feasibility, For documents C10113-1, C10113-2, C10113-3, the font-family choices have distinct IDs A, B, C. C10113-1 permits only A. C10113-2 permits only B. C10113-3 permits only C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10113 contains precisely those three documents. Assign exactly one font-family to each of these documents, same-for-all(C10113).", "question": "Can any complete plan obey all the stated requirements?", "answer": "no", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "same-for-all:feasibility", "ledger": { "eligibility": [ [ "A" ], [ "B" ], [ "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "C" ], "feasible": [], "form": "same-for-all", "task": "feasibility", "domain": "font-family" } }, { "id": "choice-0-2-13", "english": "For evaluation record C10113-consequence, For documents C10113-1, C10113-2, C10113-3, the font-family choices have distinct IDs A, B, C. C10113-1 permits only A. C10113-2 permits only B. C10113-3 permits only C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10113 contains precisely those three documents. Assign the same single font-family to all three documents.", "ainglish": "For evaluation record C10113-consequence, For documents C10113-1, C10113-2, C10113-3, the font-family choices have distinct IDs A, B, C. C10113-1 permits only A. C10113-2 permits only B. C10113-3 permits only C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10113 contains precisely those three documents. Assign exactly one font-family to each of these documents, same-for-all(C10113).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "no feasible assignment exists", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "same-for-all:consequence", "ledger": { "eligibility": [ [ "A" ], [ "B" ], [ "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "C" ], "feasible": [], "form": "same-for-all", "task": "consequence", "domain": "font-family" } }, { "id": "choice-1-0-13", "english": "For evaluation record C10113-admissibility, For documents C10113-1, C10113-2, C10113-3, the font-family choices have distinct IDs A, B, C. C10113-1 permits only A. C10113-2 permits only B. C10113-3 permits only C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10113 contains precisely those three documents. Assign exactly one font-family to each of these documents; choices may be the same or different.", "ainglish": "For evaluation record C10113-admissibility, For documents C10113-1, C10113-2, C10113-3, the font-family choices have distinct IDs A, B, C. C10113-1 permits only A. C10113-2 permits only B. C10113-3 permits only C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10113 contains precisely those three documents. Assign exactly one font-family to each of these documents, may-vary-across(C10113).", "question": "A proposed plan uses IDs A,B,C in the listed member order. Does that plan obey every stated requirement?", "answer": "yes", "options": [ "the information is insufficient", "yes", "no", "no feasible assignment exists" ], "settlement_stratum": "may-vary-across:admissibility", "ledger": { "eligibility": [ [ "A" ], [ "B" ], [ "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "C" ], "feasible": [ [ "A", "B", "C" ] ], "form": "may-vary-across", "task": "admissibility", "domain": "font-family" } }, { "id": "choice-1-1-13", "english": "For evaluation record C10113-feasibility, For documents C10113-1, C10113-2, C10113-3, the font-family choices have distinct IDs A, B, C. C10113-1 permits only A. C10113-2 permits only B. C10113-3 permits only C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10113 contains precisely those three documents. Assign exactly one font-family to each of these documents; choices may be the same or different.", "ainglish": "For evaluation record C10113-feasibility, For documents C10113-1, C10113-2, C10113-3, the font-family choices have distinct IDs A, B, C. C10113-1 permits only A. C10113-2 permits only B. C10113-3 permits only C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10113 contains precisely those three documents. Assign exactly one font-family to each of these documents, may-vary-across(C10113).", "question": "Can any complete plan obey all the stated requirements?", "answer": "yes", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "may-vary-across:feasibility", "ledger": { "eligibility": [ [ "A" ], [ "B" ], [ "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "C" ], "feasible": [ [ "A", "B", "C" ] ], "form": "may-vary-across", "task": "feasibility", "domain": "font-family" } }, { "id": "choice-1-2-13", "english": "For evaluation record C10113-consequence, For documents C10113-1, C10113-2, C10113-3, the font-family choices have distinct IDs A, B, C. C10113-1 permits only A. C10113-2 permits only B. C10113-3 permits only C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10113 contains precisely those three documents. Assign exactly one font-family to each of these documents; choices may be the same or different.", "ainglish": "For evaluation record C10113-consequence, For documents C10113-1, C10113-2, C10113-3, the font-family choices have distinct IDs A, B, C. C10113-1 permits only A. C10113-2 permits only B. C10113-3 permits only C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10113 contains precisely those three documents. Assign exactly one font-family to each of these documents, may-vary-across(C10113).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "no", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "may-vary-across:consequence", "ledger": { "eligibility": [ [ "A" ], [ "B" ], [ "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "C" ], "feasible": [ [ "A", "B", "C" ] ], "form": "may-vary-across", "task": "consequence", "domain": "font-family" } }, { "id": "choice-0-0-14", "english": "For evaluation record C10114-admissibility, For analyses C10114-1, C10114-2, C10114-3, the source-dataset choices have distinct IDs A, B, C. C10114-1 permits only A. C10114-2 permits only B. C10114-3 permits only C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10114 contains precisely those three analyses. Assign the same single source-dataset to all three analyses.", "ainglish": "For evaluation record C10114-admissibility, For analyses C10114-1, C10114-2, C10114-3, the source-dataset choices have distinct IDs A, B, C. C10114-1 permits only A. C10114-2 permits only B. C10114-3 permits only C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10114 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses, same-for-all(C10114).", "question": "A proposed plan uses IDs A,B,C in the listed member order. Does that plan obey every stated requirement?", "answer": "no", "options": [ "no", "no feasible assignment exists", "the information is insufficient", "yes" ], "settlement_stratum": "same-for-all:admissibility", "ledger": { "eligibility": [ [ "A" ], [ "B" ], [ "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "C" ], "feasible": [], "form": "same-for-all", "task": "admissibility", "domain": "source-dataset" } }, { "id": "choice-0-1-14", "english": "For evaluation record C10114-feasibility, For analyses C10114-1, C10114-2, C10114-3, the source-dataset choices have distinct IDs A, B, C. C10114-1 permits only A. C10114-2 permits only B. C10114-3 permits only C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10114 contains precisely those three analyses. Assign the same single source-dataset to all three analyses.", "ainglish": "For evaluation record C10114-feasibility, For analyses C10114-1, C10114-2, C10114-3, the source-dataset choices have distinct IDs A, B, C. C10114-1 permits only A. C10114-2 permits only B. C10114-3 permits only C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10114 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses, same-for-all(C10114).", "question": "Can any complete plan obey all the stated requirements?", "answer": "no", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "same-for-all:feasibility", "ledger": { "eligibility": [ [ "A" ], [ "B" ], [ "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "C" ], "feasible": [], "form": "same-for-all", "task": "feasibility", "domain": "source-dataset" } }, { "id": "choice-0-2-14", "english": "For evaluation record C10114-consequence, For analyses C10114-1, C10114-2, C10114-3, the source-dataset choices have distinct IDs A, B, C. C10114-1 permits only A. C10114-2 permits only B. C10114-3 permits only C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10114 contains precisely those three analyses. Assign the same single source-dataset to all three analyses.", "ainglish": "For evaluation record C10114-consequence, For analyses C10114-1, C10114-2, C10114-3, the source-dataset choices have distinct IDs A, B, C. C10114-1 permits only A. C10114-2 permits only B. C10114-3 permits only C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10114 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses, same-for-all(C10114).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "no feasible assignment exists", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "same-for-all:consequence", "ledger": { "eligibility": [ [ "A" ], [ "B" ], [ "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "C" ], "feasible": [], "form": "same-for-all", "task": "consequence", "domain": "source-dataset" } }, { "id": "choice-1-0-14", "english": "For evaluation record C10114-admissibility, For analyses C10114-1, C10114-2, C10114-3, the source-dataset choices have distinct IDs A, B, C. C10114-1 permits only A. C10114-2 permits only B. C10114-3 permits only C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10114 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses; choices may be the same or different.", "ainglish": "For evaluation record C10114-admissibility, For analyses C10114-1, C10114-2, C10114-3, the source-dataset choices have distinct IDs A, B, C. C10114-1 permits only A. C10114-2 permits only B. C10114-3 permits only C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10114 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses, may-vary-across(C10114).", "question": "A proposed plan uses IDs A,B,C in the listed member order. Does that plan obey every stated requirement?", "answer": "yes", "options": [ "no", "no feasible assignment exists", "the information is insufficient", "yes" ], "settlement_stratum": "may-vary-across:admissibility", "ledger": { "eligibility": [ [ "A" ], [ "B" ], [ "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "C" ], "feasible": [ [ "A", "B", "C" ] ], "form": "may-vary-across", "task": "admissibility", "domain": "source-dataset" } }, { "id": "choice-1-1-14", "english": "For evaluation record C10114-feasibility, For analyses C10114-1, C10114-2, C10114-3, the source-dataset choices have distinct IDs A, B, C. C10114-1 permits only A. C10114-2 permits only B. C10114-3 permits only C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10114 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses; choices may be the same or different.", "ainglish": "For evaluation record C10114-feasibility, For analyses C10114-1, C10114-2, C10114-3, the source-dataset choices have distinct IDs A, B, C. C10114-1 permits only A. C10114-2 permits only B. C10114-3 permits only C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10114 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses, may-vary-across(C10114).", "question": "Can any complete plan obey all the stated requirements?", "answer": "yes", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "may-vary-across:feasibility", "ledger": { "eligibility": [ [ "A" ], [ "B" ], [ "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "C" ], "feasible": [ [ "A", "B", "C" ] ], "form": "may-vary-across", "task": "feasibility", "domain": "source-dataset" } }, { "id": "choice-1-2-14", "english": "For evaluation record C10114-consequence, For analyses C10114-1, C10114-2, C10114-3, the source-dataset choices have distinct IDs A, B, C. C10114-1 permits only A. C10114-2 permits only B. C10114-3 permits only C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10114 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses; choices may be the same or different.", "ainglish": "For evaluation record C10114-consequence, For analyses C10114-1, C10114-2, C10114-3, the source-dataset choices have distinct IDs A, B, C. C10114-1 permits only A. C10114-2 permits only B. C10114-3 permits only C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10114 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses, may-vary-across(C10114).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "no", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "may-vary-across:consequence", "ledger": { "eligibility": [ [ "A" ], [ "B" ], [ "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "C" ], "feasible": [ [ "A", "B", "C" ] ], "form": "may-vary-across", "task": "consequence", "domain": "source-dataset" } }, { "id": "choice-0-0-15", "english": "For evaluation record C10115-admissibility, For tasks C10115-1, C10115-2, C10115-3, the deadline choices have distinct IDs A, B, C. C10115-1 permits only A. C10115-2 permits only B. C10115-3 permits only C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10115 contains precisely those three tasks. Assign the same single deadline to all three tasks.", "ainglish": "For evaluation record C10115-admissibility, For tasks C10115-1, C10115-2, C10115-3, the deadline choices have distinct IDs A, B, C. C10115-1 permits only A. C10115-2 permits only B. C10115-3 permits only C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10115 contains precisely those three tasks. Assign exactly one deadline to each of these tasks, same-for-all(C10115).", "question": "A proposed plan uses IDs A,B,C in the listed member order. Does that plan obey every stated requirement?", "answer": "no", "options": [ "the information is insufficient", "yes", "no", "no feasible assignment exists" ], "settlement_stratum": "same-for-all:admissibility", "ledger": { "eligibility": [ [ "A" ], [ "B" ], [ "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "C" ], "feasible": [], "form": "same-for-all", "task": "admissibility", "domain": "deadline" } }, { "id": "choice-0-1-15", "english": "For evaluation record C10115-feasibility, For tasks C10115-1, C10115-2, C10115-3, the deadline choices have distinct IDs A, B, C. C10115-1 permits only A. C10115-2 permits only B. C10115-3 permits only C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10115 contains precisely those three tasks. Assign the same single deadline to all three tasks.", "ainglish": "For evaluation record C10115-feasibility, For tasks C10115-1, C10115-2, C10115-3, the deadline choices have distinct IDs A, B, C. C10115-1 permits only A. C10115-2 permits only B. C10115-3 permits only C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10115 contains precisely those three tasks. Assign exactly one deadline to each of these tasks, same-for-all(C10115).", "question": "Can any complete plan obey all the stated requirements?", "answer": "no", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "same-for-all:feasibility", "ledger": { "eligibility": [ [ "A" ], [ "B" ], [ "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "C" ], "feasible": [], "form": "same-for-all", "task": "feasibility", "domain": "deadline" } }, { "id": "choice-0-2-15", "english": "For evaluation record C10115-consequence, For tasks C10115-1, C10115-2, C10115-3, the deadline choices have distinct IDs A, B, C. C10115-1 permits only A. C10115-2 permits only B. C10115-3 permits only C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10115 contains precisely those three tasks. Assign the same single deadline to all three tasks.", "ainglish": "For evaluation record C10115-consequence, For tasks C10115-1, C10115-2, C10115-3, the deadline choices have distinct IDs A, B, C. C10115-1 permits only A. C10115-2 permits only B. C10115-3 permits only C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10115 contains precisely those three tasks. Assign exactly one deadline to each of these tasks, same-for-all(C10115).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "no feasible assignment exists", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "same-for-all:consequence", "ledger": { "eligibility": [ [ "A" ], [ "B" ], [ "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "C" ], "feasible": [], "form": "same-for-all", "task": "consequence", "domain": "deadline" } }, { "id": "choice-1-0-15", "english": "For evaluation record C10115-admissibility, For tasks C10115-1, C10115-2, C10115-3, the deadline choices have distinct IDs A, B, C. C10115-1 permits only A. C10115-2 permits only B. C10115-3 permits only C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10115 contains precisely those three tasks. Assign exactly one deadline to each of these tasks; choices may be the same or different.", "ainglish": "For evaluation record C10115-admissibility, For tasks C10115-1, C10115-2, C10115-3, the deadline choices have distinct IDs A, B, C. C10115-1 permits only A. C10115-2 permits only B. C10115-3 permits only C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10115 contains precisely those three tasks. Assign exactly one deadline to each of these tasks, may-vary-across(C10115).", "question": "A proposed plan uses IDs A,B,C in the listed member order. Does that plan obey every stated requirement?", "answer": "yes", "options": [ "the information is insufficient", "yes", "no", "no feasible assignment exists" ], "settlement_stratum": "may-vary-across:admissibility", "ledger": { "eligibility": [ [ "A" ], [ "B" ], [ "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "C" ], "feasible": [ [ "A", "B", "C" ] ], "form": "may-vary-across", "task": "admissibility", "domain": "deadline" } }, { "id": "choice-1-1-15", "english": "For evaluation record C10115-feasibility, For tasks C10115-1, C10115-2, C10115-3, the deadline choices have distinct IDs A, B, C. C10115-1 permits only A. C10115-2 permits only B. C10115-3 permits only C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10115 contains precisely those three tasks. Assign exactly one deadline to each of these tasks; choices may be the same or different.", "ainglish": "For evaluation record C10115-feasibility, For tasks C10115-1, C10115-2, C10115-3, the deadline choices have distinct IDs A, B, C. C10115-1 permits only A. C10115-2 permits only B. C10115-3 permits only C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10115 contains precisely those three tasks. Assign exactly one deadline to each of these tasks, may-vary-across(C10115).", "question": "Can any complete plan obey all the stated requirements?", "answer": "yes", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "may-vary-across:feasibility", "ledger": { "eligibility": [ [ "A" ], [ "B" ], [ "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "C" ], "feasible": [ [ "A", "B", "C" ] ], "form": "may-vary-across", "task": "feasibility", "domain": "deadline" } }, { "id": "choice-1-2-15", "english": "For evaluation record C10115-consequence, For tasks C10115-1, C10115-2, C10115-3, the deadline choices have distinct IDs A, B, C. C10115-1 permits only A. C10115-2 permits only B. C10115-3 permits only C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10115 contains precisely those three tasks. Assign exactly one deadline to each of these tasks; choices may be the same or different.", "ainglish": "For evaluation record C10115-consequence, For tasks C10115-1, C10115-2, C10115-3, the deadline choices have distinct IDs A, B, C. C10115-1 permits only A. C10115-2 permits only B. C10115-3 permits only C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10115 contains precisely those three tasks. Assign exactly one deadline to each of these tasks, may-vary-across(C10115).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "no", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "may-vary-across:consequence", "ledger": { "eligibility": [ [ "A" ], [ "B" ], [ "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "C" ], "feasible": [ [ "A", "B", "C" ] ], "form": "may-vary-across", "task": "consequence", "domain": "deadline" } }, { "id": "choice-0-0-16", "english": "For evaluation record C10116-admissibility, For reports C10116-1, C10116-2, C10116-3, the reviewer choices have distinct IDs A, B, C. C10116-1 permits only A,B. C10116-2 permits only A. C10116-3 permits only A,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10116 contains precisely those three reports. Assign the same single reviewer to all three reports.", "ainglish": "For evaluation record C10116-admissibility, For reports C10116-1, C10116-2, C10116-3, the reviewer choices have distinct IDs A, B, C. C10116-1 permits only A,B. C10116-2 permits only A. C10116-3 permits only A,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10116 contains precisely those three reports. Assign exactly one reviewer to each of these reports, same-for-all(C10116).", "question": "A proposed plan uses IDs A,B,A in the listed member order. Does that plan obey every stated requirement?", "answer": "no", "options": [ "no", "no feasible assignment exists", "the information is insufficient", "yes" ], "settlement_stratum": "same-for-all:admissibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A" ], [ "A", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ] ], "form": "same-for-all", "task": "admissibility", "domain": "reviewer" } }, { "id": "choice-0-1-16", "english": "For evaluation record C10116-feasibility, For reports C10116-1, C10116-2, C10116-3, the reviewer choices have distinct IDs A, B, C. C10116-1 permits only A,B. C10116-2 permits only A. C10116-3 permits only A,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10116 contains precisely those three reports. Assign the same single reviewer to all three reports.", "ainglish": "For evaluation record C10116-feasibility, For reports C10116-1, C10116-2, C10116-3, the reviewer choices have distinct IDs A, B, C. C10116-1 permits only A,B. C10116-2 permits only A. C10116-3 permits only A,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10116 contains precisely those three reports. Assign exactly one reviewer to each of these reports, same-for-all(C10116).", "question": "Can any complete plan obey all the stated requirements?", "answer": "yes", "options": [ "the information is insufficient", "yes", "no", "no feasible assignment exists" ], "settlement_stratum": "same-for-all:feasibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A" ], [ "A", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ] ], "form": "same-for-all", "task": "feasibility", "domain": "reviewer" } }, { "id": "choice-0-2-16", "english": "For evaluation record C10116-consequence, For reports C10116-1, C10116-2, C10116-3, the reviewer choices have distinct IDs A, B, C. C10116-1 permits only A,B. C10116-2 permits only A. C10116-3 permits only A,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10116 contains precisely those three reports. Assign the same single reviewer to all three reports.", "ainglish": "For evaluation record C10116-consequence, For reports C10116-1, C10116-2, C10116-3, the reviewer choices have distinct IDs A, B, C. C10116-1 permits only A,B. C10116-2 permits only A. C10116-3 permits only A,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10116 contains precisely those three reports. Assign exactly one reviewer to each of these reports, same-for-all(C10116).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "yes", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "same-for-all:consequence", "ledger": { "eligibility": [ [ "A", "B" ], [ "A" ], [ "A", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ] ], "form": "same-for-all", "task": "consequence", "domain": "reviewer" } }, { "id": "choice-1-0-16", "english": "For evaluation record C10116-admissibility, For reports C10116-1, C10116-2, C10116-3, the reviewer choices have distinct IDs A, B, C. C10116-1 permits only A,B. C10116-2 permits only A. C10116-3 permits only A,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10116 contains precisely those three reports. Assign exactly one reviewer to each of these reports; choices may be the same or different.", "ainglish": "For evaluation record C10116-admissibility, For reports C10116-1, C10116-2, C10116-3, the reviewer choices have distinct IDs A, B, C. C10116-1 permits only A,B. C10116-2 permits only A. C10116-3 permits only A,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10116 contains precisely those three reports. Assign exactly one reviewer to each of these reports, may-vary-across(C10116).", "question": "A proposed plan uses IDs A,B,A in the listed member order. Does that plan obey every stated requirement?", "answer": "no", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "may-vary-across:admissibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A" ], [ "A", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "C" ], [ "B", "A", "A" ], [ "B", "A", "C" ] ], "form": "may-vary-across", "task": "admissibility", "domain": "reviewer" } }, { "id": "choice-1-1-16", "english": "For evaluation record C10116-feasibility, For reports C10116-1, C10116-2, C10116-3, the reviewer choices have distinct IDs A, B, C. C10116-1 permits only A,B. C10116-2 permits only A. C10116-3 permits only A,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10116 contains precisely those three reports. Assign exactly one reviewer to each of these reports; choices may be the same or different.", "ainglish": "For evaluation record C10116-feasibility, For reports C10116-1, C10116-2, C10116-3, the reviewer choices have distinct IDs A, B, C. C10116-1 permits only A,B. C10116-2 permits only A. C10116-3 permits only A,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10116 contains precisely those three reports. Assign exactly one reviewer to each of these reports, may-vary-across(C10116).", "question": "Can any complete plan obey all the stated requirements?", "answer": "yes", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "may-vary-across:feasibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A" ], [ "A", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "C" ], [ "B", "A", "A" ], [ "B", "A", "C" ] ], "form": "may-vary-across", "task": "feasibility", "domain": "reviewer" } }, { "id": "choice-1-2-16", "english": "For evaluation record C10116-consequence, For reports C10116-1, C10116-2, C10116-3, the reviewer choices have distinct IDs A, B, C. C10116-1 permits only A,B. C10116-2 permits only A. C10116-3 permits only A,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10116 contains precisely those three reports. Assign exactly one reviewer to each of these reports; choices may be the same or different.", "ainglish": "For evaluation record C10116-consequence, For reports C10116-1, C10116-2, C10116-3, the reviewer choices have distinct IDs A, B, C. C10116-1 permits only A,B. C10116-2 permits only A. C10116-3 permits only A,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10116 contains precisely those three reports. Assign exactly one reviewer to each of these reports, may-vary-across(C10116).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "no", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "may-vary-across:consequence", "ledger": { "eligibility": [ [ "A", "B" ], [ "A" ], [ "A", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "C" ], [ "B", "A", "A" ], [ "B", "A", "C" ] ], "form": "may-vary-across", "task": "consequence", "domain": "reviewer" } }, { "id": "choice-0-0-17", "english": "For evaluation record C10117-admissibility, For documents C10117-1, C10117-2, C10117-3, the font-family choices have distinct IDs A, B, C. C10117-1 permits only A,B. C10117-2 permits only A. C10117-3 permits only A,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10117 contains precisely those three documents. Assign the same single font-family to all three documents.", "ainglish": "For evaluation record C10117-admissibility, For documents C10117-1, C10117-2, C10117-3, the font-family choices have distinct IDs A, B, C. C10117-1 permits only A,B. C10117-2 permits only A. C10117-3 permits only A,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10117 contains precisely those three documents. Assign exactly one font-family to each of these documents, same-for-all(C10117).", "question": "A proposed plan uses IDs A,B,A in the listed member order. Does that plan obey every stated requirement?", "answer": "no", "options": [ "the information is insufficient", "yes", "no", "no feasible assignment exists" ], "settlement_stratum": "same-for-all:admissibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A" ], [ "A", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ] ], "form": "same-for-all", "task": "admissibility", "domain": "font-family" } }, { "id": "choice-0-1-17", "english": "For evaluation record C10117-feasibility, For documents C10117-1, C10117-2, C10117-3, the font-family choices have distinct IDs A, B, C. C10117-1 permits only A,B. C10117-2 permits only A. C10117-3 permits only A,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10117 contains precisely those three documents. Assign the same single font-family to all three documents.", "ainglish": "For evaluation record C10117-feasibility, For documents C10117-1, C10117-2, C10117-3, the font-family choices have distinct IDs A, B, C. C10117-1 permits only A,B. C10117-2 permits only A. C10117-3 permits only A,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10117 contains precisely those three documents. Assign exactly one font-family to each of these documents, same-for-all(C10117).", "question": "Can any complete plan obey all the stated requirements?", "answer": "yes", "options": [ "no", "no feasible assignment exists", "the information is insufficient", "yes" ], "settlement_stratum": "same-for-all:feasibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A" ], [ "A", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ] ], "form": "same-for-all", "task": "feasibility", "domain": "font-family" } }, { "id": "choice-0-2-17", "english": "For evaluation record C10117-consequence, For documents C10117-1, C10117-2, C10117-3, the font-family choices have distinct IDs A, B, C. C10117-1 permits only A,B. C10117-2 permits only A. C10117-3 permits only A,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10117 contains precisely those three documents. Assign the same single font-family to all three documents.", "ainglish": "For evaluation record C10117-consequence, For documents C10117-1, C10117-2, C10117-3, the font-family choices have distinct IDs A, B, C. C10117-1 permits only A,B. C10117-2 permits only A. C10117-3 permits only A,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10117 contains precisely those three documents. Assign exactly one font-family to each of these documents, same-for-all(C10117).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "yes", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "same-for-all:consequence", "ledger": { "eligibility": [ [ "A", "B" ], [ "A" ], [ "A", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ] ], "form": "same-for-all", "task": "consequence", "domain": "font-family" } }, { "id": "choice-1-0-17", "english": "For evaluation record C10117-admissibility, For documents C10117-1, C10117-2, C10117-3, the font-family choices have distinct IDs A, B, C. C10117-1 permits only A,B. C10117-2 permits only A. C10117-3 permits only A,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10117 contains precisely those three documents. Assign exactly one font-family to each of these documents; choices may be the same or different.", "ainglish": "For evaluation record C10117-admissibility, For documents C10117-1, C10117-2, C10117-3, the font-family choices have distinct IDs A, B, C. C10117-1 permits only A,B. C10117-2 permits only A. C10117-3 permits only A,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10117 contains precisely those three documents. Assign exactly one font-family to each of these documents, may-vary-across(C10117).", "question": "A proposed plan uses IDs A,B,A in the listed member order. Does that plan obey every stated requirement?", "answer": "no", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "may-vary-across:admissibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A" ], [ "A", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "C" ], [ "B", "A", "A" ], [ "B", "A", "C" ] ], "form": "may-vary-across", "task": "admissibility", "domain": "font-family" } }, { "id": "choice-1-1-17", "english": "For evaluation record C10117-feasibility, For documents C10117-1, C10117-2, C10117-3, the font-family choices have distinct IDs A, B, C. C10117-1 permits only A,B. C10117-2 permits only A. C10117-3 permits only A,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10117 contains precisely those three documents. Assign exactly one font-family to each of these documents; choices may be the same or different.", "ainglish": "For evaluation record C10117-feasibility, For documents C10117-1, C10117-2, C10117-3, the font-family choices have distinct IDs A, B, C. C10117-1 permits only A,B. C10117-2 permits only A. C10117-3 permits only A,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10117 contains precisely those three documents. Assign exactly one font-family to each of these documents, may-vary-across(C10117).", "question": "Can any complete plan obey all the stated requirements?", "answer": "yes", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "may-vary-across:feasibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A" ], [ "A", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "C" ], [ "B", "A", "A" ], [ "B", "A", "C" ] ], "form": "may-vary-across", "task": "feasibility", "domain": "font-family" } }, { "id": "choice-1-2-17", "english": "For evaluation record C10117-consequence, For documents C10117-1, C10117-2, C10117-3, the font-family choices have distinct IDs A, B, C. C10117-1 permits only A,B. C10117-2 permits only A. C10117-3 permits only A,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10117 contains precisely those three documents. Assign exactly one font-family to each of these documents; choices may be the same or different.", "ainglish": "For evaluation record C10117-consequence, For documents C10117-1, C10117-2, C10117-3, the font-family choices have distinct IDs A, B, C. C10117-1 permits only A,B. C10117-2 permits only A. C10117-3 permits only A,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10117 contains precisely those three documents. Assign exactly one font-family to each of these documents, may-vary-across(C10117).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "no", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "may-vary-across:consequence", "ledger": { "eligibility": [ [ "A", "B" ], [ "A" ], [ "A", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "C" ], [ "B", "A", "A" ], [ "B", "A", "C" ] ], "form": "may-vary-across", "task": "consequence", "domain": "font-family" } }, { "id": "choice-0-0-18", "english": "For evaluation record C10118-admissibility, For analyses C10118-1, C10118-2, C10118-3, the source-dataset choices have distinct IDs A, B, C. C10118-1 permits only A,B. C10118-2 permits only A. C10118-3 permits only A,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10118 contains precisely those three analyses. Assign the same single source-dataset to all three analyses.", "ainglish": "For evaluation record C10118-admissibility, For analyses C10118-1, C10118-2, C10118-3, the source-dataset choices have distinct IDs A, B, C. C10118-1 permits only A,B. C10118-2 permits only A. C10118-3 permits only A,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10118 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses, same-for-all(C10118).", "question": "A proposed plan uses IDs A,B,A in the listed member order. Does that plan obey every stated requirement?", "answer": "no", "options": [ "no", "no feasible assignment exists", "the information is insufficient", "yes" ], "settlement_stratum": "same-for-all:admissibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A" ], [ "A", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ] ], "form": "same-for-all", "task": "admissibility", "domain": "source-dataset" } }, { "id": "choice-0-1-18", "english": "For evaluation record C10118-feasibility, For analyses C10118-1, C10118-2, C10118-3, the source-dataset choices have distinct IDs A, B, C. C10118-1 permits only A,B. C10118-2 permits only A. C10118-3 permits only A,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10118 contains precisely those three analyses. Assign the same single source-dataset to all three analyses.", "ainglish": "For evaluation record C10118-feasibility, For analyses C10118-1, C10118-2, C10118-3, the source-dataset choices have distinct IDs A, B, C. C10118-1 permits only A,B. C10118-2 permits only A. C10118-3 permits only A,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10118 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses, same-for-all(C10118).", "question": "Can any complete plan obey all the stated requirements?", "answer": "yes", "options": [ "the information is insufficient", "yes", "no", "no feasible assignment exists" ], "settlement_stratum": "same-for-all:feasibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A" ], [ "A", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ] ], "form": "same-for-all", "task": "feasibility", "domain": "source-dataset" } }, { "id": "choice-0-2-18", "english": "For evaluation record C10118-consequence, For analyses C10118-1, C10118-2, C10118-3, the source-dataset choices have distinct IDs A, B, C. C10118-1 permits only A,B. C10118-2 permits only A. C10118-3 permits only A,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10118 contains precisely those three analyses. Assign the same single source-dataset to all three analyses.", "ainglish": "For evaluation record C10118-consequence, For analyses C10118-1, C10118-2, C10118-3, the source-dataset choices have distinct IDs A, B, C. C10118-1 permits only A,B. C10118-2 permits only A. C10118-3 permits only A,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10118 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses, same-for-all(C10118).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "yes", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "same-for-all:consequence", "ledger": { "eligibility": [ [ "A", "B" ], [ "A" ], [ "A", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ] ], "form": "same-for-all", "task": "consequence", "domain": "source-dataset" } }, { "id": "choice-1-0-18", "english": "For evaluation record C10118-admissibility, For analyses C10118-1, C10118-2, C10118-3, the source-dataset choices have distinct IDs A, B, C. C10118-1 permits only A,B. C10118-2 permits only A. C10118-3 permits only A,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10118 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses; choices may be the same or different.", "ainglish": "For evaluation record C10118-admissibility, For analyses C10118-1, C10118-2, C10118-3, the source-dataset choices have distinct IDs A, B, C. C10118-1 permits only A,B. C10118-2 permits only A. C10118-3 permits only A,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10118 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses, may-vary-across(C10118).", "question": "A proposed plan uses IDs A,B,A in the listed member order. Does that plan obey every stated requirement?", "answer": "no", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "may-vary-across:admissibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A" ], [ "A", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "C" ], [ "B", "A", "A" ], [ "B", "A", "C" ] ], "form": "may-vary-across", "task": "admissibility", "domain": "source-dataset" } }, { "id": "choice-1-1-18", "english": "For evaluation record C10118-feasibility, For analyses C10118-1, C10118-2, C10118-3, the source-dataset choices have distinct IDs A, B, C. C10118-1 permits only A,B. C10118-2 permits only A. C10118-3 permits only A,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10118 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses; choices may be the same or different.", "ainglish": "For evaluation record C10118-feasibility, For analyses C10118-1, C10118-2, C10118-3, the source-dataset choices have distinct IDs A, B, C. C10118-1 permits only A,B. C10118-2 permits only A. C10118-3 permits only A,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10118 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses, may-vary-across(C10118).", "question": "Can any complete plan obey all the stated requirements?", "answer": "yes", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "may-vary-across:feasibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A" ], [ "A", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "C" ], [ "B", "A", "A" ], [ "B", "A", "C" ] ], "form": "may-vary-across", "task": "feasibility", "domain": "source-dataset" } }, { "id": "choice-1-2-18", "english": "For evaluation record C10118-consequence, For analyses C10118-1, C10118-2, C10118-3, the source-dataset choices have distinct IDs A, B, C. C10118-1 permits only A,B. C10118-2 permits only A. C10118-3 permits only A,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10118 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses; choices may be the same or different.", "ainglish": "For evaluation record C10118-consequence, For analyses C10118-1, C10118-2, C10118-3, the source-dataset choices have distinct IDs A, B, C. C10118-1 permits only A,B. C10118-2 permits only A. C10118-3 permits only A,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10118 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses, may-vary-across(C10118).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "no", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "may-vary-across:consequence", "ledger": { "eligibility": [ [ "A", "B" ], [ "A" ], [ "A", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "C" ], [ "B", "A", "A" ], [ "B", "A", "C" ] ], "form": "may-vary-across", "task": "consequence", "domain": "source-dataset" } }, { "id": "choice-0-0-19", "english": "For evaluation record C10119-admissibility, For tasks C10119-1, C10119-2, C10119-3, the deadline choices have distinct IDs A, B, C. C10119-1 permits only A,B. C10119-2 permits only A. C10119-3 permits only A,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10119 contains precisely those three tasks. Assign the same single deadline to all three tasks.", "ainglish": "For evaluation record C10119-admissibility, For tasks C10119-1, C10119-2, C10119-3, the deadline choices have distinct IDs A, B, C. C10119-1 permits only A,B. C10119-2 permits only A. C10119-3 permits only A,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10119 contains precisely those three tasks. Assign exactly one deadline to each of these tasks, same-for-all(C10119).", "question": "A proposed plan uses IDs A,B,A in the listed member order. Does that plan obey every stated requirement?", "answer": "no", "options": [ "the information is insufficient", "yes", "no", "no feasible assignment exists" ], "settlement_stratum": "same-for-all:admissibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A" ], [ "A", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ] ], "form": "same-for-all", "task": "admissibility", "domain": "deadline" } }, { "id": "choice-0-1-19", "english": "For evaluation record C10119-feasibility, For tasks C10119-1, C10119-2, C10119-3, the deadline choices have distinct IDs A, B, C. C10119-1 permits only A,B. C10119-2 permits only A. C10119-3 permits only A,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10119 contains precisely those three tasks. Assign the same single deadline to all three tasks.", "ainglish": "For evaluation record C10119-feasibility, For tasks C10119-1, C10119-2, C10119-3, the deadline choices have distinct IDs A, B, C. C10119-1 permits only A,B. C10119-2 permits only A. C10119-3 permits only A,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10119 contains precisely those three tasks. Assign exactly one deadline to each of these tasks, same-for-all(C10119).", "question": "Can any complete plan obey all the stated requirements?", "answer": "yes", "options": [ "no", "no feasible assignment exists", "the information is insufficient", "yes" ], "settlement_stratum": "same-for-all:feasibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A" ], [ "A", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ] ], "form": "same-for-all", "task": "feasibility", "domain": "deadline" } }, { "id": "choice-0-2-19", "english": "For evaluation record C10119-consequence, For tasks C10119-1, C10119-2, C10119-3, the deadline choices have distinct IDs A, B, C. C10119-1 permits only A,B. C10119-2 permits only A. C10119-3 permits only A,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10119 contains precisely those three tasks. Assign the same single deadline to all three tasks.", "ainglish": "For evaluation record C10119-consequence, For tasks C10119-1, C10119-2, C10119-3, the deadline choices have distinct IDs A, B, C. C10119-1 permits only A,B. C10119-2 permits only A. C10119-3 permits only A,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10119 contains precisely those three tasks. Assign exactly one deadline to each of these tasks, same-for-all(C10119).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "yes", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "same-for-all:consequence", "ledger": { "eligibility": [ [ "A", "B" ], [ "A" ], [ "A", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ] ], "form": "same-for-all", "task": "consequence", "domain": "deadline" } }, { "id": "choice-1-0-19", "english": "For evaluation record C10119-admissibility, For tasks C10119-1, C10119-2, C10119-3, the deadline choices have distinct IDs A, B, C. C10119-1 permits only A,B. C10119-2 permits only A. C10119-3 permits only A,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10119 contains precisely those three tasks. Assign exactly one deadline to each of these tasks; choices may be the same or different.", "ainglish": "For evaluation record C10119-admissibility, For tasks C10119-1, C10119-2, C10119-3, the deadline choices have distinct IDs A, B, C. C10119-1 permits only A,B. C10119-2 permits only A. C10119-3 permits only A,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10119 contains precisely those three tasks. Assign exactly one deadline to each of these tasks, may-vary-across(C10119).", "question": "A proposed plan uses IDs A,B,A in the listed member order. Does that plan obey every stated requirement?", "answer": "no", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "may-vary-across:admissibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A" ], [ "A", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "C" ], [ "B", "A", "A" ], [ "B", "A", "C" ] ], "form": "may-vary-across", "task": "admissibility", "domain": "deadline" } }, { "id": "choice-1-1-19", "english": "For evaluation record C10119-feasibility, For tasks C10119-1, C10119-2, C10119-3, the deadline choices have distinct IDs A, B, C. C10119-1 permits only A,B. C10119-2 permits only A. C10119-3 permits only A,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10119 contains precisely those three tasks. Assign exactly one deadline to each of these tasks; choices may be the same or different.", "ainglish": "For evaluation record C10119-feasibility, For tasks C10119-1, C10119-2, C10119-3, the deadline choices have distinct IDs A, B, C. C10119-1 permits only A,B. C10119-2 permits only A. C10119-3 permits only A,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10119 contains precisely those three tasks. Assign exactly one deadline to each of these tasks, may-vary-across(C10119).", "question": "Can any complete plan obey all the stated requirements?", "answer": "yes", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "may-vary-across:feasibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A" ], [ "A", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "C" ], [ "B", "A", "A" ], [ "B", "A", "C" ] ], "form": "may-vary-across", "task": "feasibility", "domain": "deadline" } }, { "id": "choice-1-2-19", "english": "For evaluation record C10119-consequence, For tasks C10119-1, C10119-2, C10119-3, the deadline choices have distinct IDs A, B, C. C10119-1 permits only A,B. C10119-2 permits only A. C10119-3 permits only A,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10119 contains precisely those three tasks. Assign exactly one deadline to each of these tasks; choices may be the same or different.", "ainglish": "For evaluation record C10119-consequence, For tasks C10119-1, C10119-2, C10119-3, the deadline choices have distinct IDs A, B, C. C10119-1 permits only A,B. C10119-2 permits only A. C10119-3 permits only A,C. Maximum uses within this assignment: A=3, B=3, C=3. The set C10119 contains precisely those three tasks. Assign exactly one deadline to each of these tasks, may-vary-across(C10119).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "no", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "may-vary-across:consequence", "ledger": { "eligibility": [ [ "A", "B" ], [ "A" ], [ "A", "C" ] ], "capacities": { "A": 3, "B": 3, "C": 3 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "C" ], [ "B", "A", "A" ], [ "B", "A", "C" ] ], "form": "may-vary-across", "task": "consequence", "domain": "deadline" } }, { "id": "choice-0-0-20", "english": "For evaluation record C10120-admissibility, For reports C10120-1, C10120-2, C10120-3, the reviewer choices have distinct IDs A, B, C. C10120-1 permits only A,B. C10120-2 permits only A,B. C10120-3 permits only A,B. Maximum uses within this assignment: A=2, B=2, C=0. The set C10120 contains precisely those three reports. Assign the same single reviewer to all three reports.", "ainglish": "For evaluation record C10120-admissibility, For reports C10120-1, C10120-2, C10120-3, the reviewer choices have distinct IDs A, B, C. C10120-1 permits only A,B. C10120-2 permits only A,B. C10120-3 permits only A,B. Maximum uses within this assignment: A=2, B=2, C=0. The set C10120 contains precisely those three reports. Assign exactly one reviewer to each of these reports, same-for-all(C10120).", "question": "A proposed plan uses IDs A,B,A in the listed member order. Does that plan obey every stated requirement?", "answer": "no", "options": [ "no", "no feasible assignment exists", "the information is insufficient", "yes" ], "settlement_stratum": "same-for-all:admissibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 2, "B": 2, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [], "form": "same-for-all", "task": "admissibility", "domain": "reviewer" } }, { "id": "choice-0-1-20", "english": "For evaluation record C10120-feasibility, For reports C10120-1, C10120-2, C10120-3, the reviewer choices have distinct IDs A, B, C. C10120-1 permits only A,B. C10120-2 permits only A,B. C10120-3 permits only A,B. Maximum uses within this assignment: A=2, B=2, C=0. The set C10120 contains precisely those three reports. Assign the same single reviewer to all three reports.", "ainglish": "For evaluation record C10120-feasibility, For reports C10120-1, C10120-2, C10120-3, the reviewer choices have distinct IDs A, B, C. C10120-1 permits only A,B. C10120-2 permits only A,B. C10120-3 permits only A,B. Maximum uses within this assignment: A=2, B=2, C=0. The set C10120 contains precisely those three reports. Assign exactly one reviewer to each of these reports, same-for-all(C10120).", "question": "Can any complete plan obey all the stated requirements?", "answer": "no", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "same-for-all:feasibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 2, "B": 2, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [], "form": "same-for-all", "task": "feasibility", "domain": "reviewer" } }, { "id": "choice-0-2-20", "english": "For evaluation record C10120-consequence, For reports C10120-1, C10120-2, C10120-3, the reviewer choices have distinct IDs A, B, C. C10120-1 permits only A,B. C10120-2 permits only A,B. C10120-3 permits only A,B. Maximum uses within this assignment: A=2, B=2, C=0. The set C10120 contains precisely those three reports. Assign the same single reviewer to all three reports.", "ainglish": "For evaluation record C10120-consequence, For reports C10120-1, C10120-2, C10120-3, the reviewer choices have distinct IDs A, B, C. C10120-1 permits only A,B. C10120-2 permits only A,B. C10120-3 permits only A,B. Maximum uses within this assignment: A=2, B=2, C=0. The set C10120 contains precisely those three reports. Assign exactly one reviewer to each of these reports, same-for-all(C10120).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "no feasible assignment exists", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "same-for-all:consequence", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 2, "B": 2, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [], "form": "same-for-all", "task": "consequence", "domain": "reviewer" } }, { "id": "choice-1-0-20", "english": "For evaluation record C10120-admissibility, For reports C10120-1, C10120-2, C10120-3, the reviewer choices have distinct IDs A, B, C. C10120-1 permits only A,B. C10120-2 permits only A,B. C10120-3 permits only A,B. Maximum uses within this assignment: A=2, B=2, C=0. The set C10120 contains precisely those three reports. Assign exactly one reviewer to each of these reports; choices may be the same or different.", "ainglish": "For evaluation record C10120-admissibility, For reports C10120-1, C10120-2, C10120-3, the reviewer choices have distinct IDs A, B, C. C10120-1 permits only A,B. C10120-2 permits only A,B. C10120-3 permits only A,B. Maximum uses within this assignment: A=2, B=2, C=0. The set C10120 contains precisely those three reports. Assign exactly one reviewer to each of these reports, may-vary-across(C10120).", "question": "A proposed plan uses IDs A,B,A in the listed member order. Does that plan obey every stated requirement?", "answer": "yes", "options": [ "no", "no feasible assignment exists", "the information is insufficient", "yes" ], "settlement_stratum": "may-vary-across:admissibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 2, "B": 2, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "B" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "B", "A" ] ], "form": "may-vary-across", "task": "admissibility", "domain": "reviewer" } }, { "id": "choice-1-1-20", "english": "For evaluation record C10120-feasibility, For reports C10120-1, C10120-2, C10120-3, the reviewer choices have distinct IDs A, B, C. C10120-1 permits only A,B. C10120-2 permits only A,B. C10120-3 permits only A,B. Maximum uses within this assignment: A=2, B=2, C=0. The set C10120 contains precisely those three reports. Assign exactly one reviewer to each of these reports; choices may be the same or different.", "ainglish": "For evaluation record C10120-feasibility, For reports C10120-1, C10120-2, C10120-3, the reviewer choices have distinct IDs A, B, C. C10120-1 permits only A,B. C10120-2 permits only A,B. C10120-3 permits only A,B. Maximum uses within this assignment: A=2, B=2, C=0. The set C10120 contains precisely those three reports. Assign exactly one reviewer to each of these reports, may-vary-across(C10120).", "question": "Can any complete plan obey all the stated requirements?", "answer": "yes", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "may-vary-across:feasibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 2, "B": 2, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "B" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "B", "A" ] ], "form": "may-vary-across", "task": "feasibility", "domain": "reviewer" } }, { "id": "choice-1-2-20", "english": "For evaluation record C10120-consequence, For reports C10120-1, C10120-2, C10120-3, the reviewer choices have distinct IDs A, B, C. C10120-1 permits only A,B. C10120-2 permits only A,B. C10120-3 permits only A,B. Maximum uses within this assignment: A=2, B=2, C=0. The set C10120 contains precisely those three reports. Assign exactly one reviewer to each of these reports; choices may be the same or different.", "ainglish": "For evaluation record C10120-consequence, For reports C10120-1, C10120-2, C10120-3, the reviewer choices have distinct IDs A, B, C. C10120-1 permits only A,B. C10120-2 permits only A,B. C10120-3 permits only A,B. Maximum uses within this assignment: A=2, B=2, C=0. The set C10120 contains precisely those three reports. Assign exactly one reviewer to each of these reports, may-vary-across(C10120).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "no", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "may-vary-across:consequence", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 2, "B": 2, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "B" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "B", "A" ] ], "form": "may-vary-across", "task": "consequence", "domain": "reviewer" } }, { "id": "choice-0-0-21", "english": "For evaluation record C10121-admissibility, For documents C10121-1, C10121-2, C10121-3, the font-family choices have distinct IDs A, B, C. C10121-1 permits only A,B. C10121-2 permits only A,B. C10121-3 permits only A,B. Maximum uses within this assignment: A=2, B=2, C=0. The set C10121 contains precisely those three documents. Assign the same single font-family to all three documents.", "ainglish": "For evaluation record C10121-admissibility, For documents C10121-1, C10121-2, C10121-3, the font-family choices have distinct IDs A, B, C. C10121-1 permits only A,B. C10121-2 permits only A,B. C10121-3 permits only A,B. Maximum uses within this assignment: A=2, B=2, C=0. The set C10121 contains precisely those three documents. Assign exactly one font-family to each of these documents, same-for-all(C10121).", "question": "A proposed plan uses IDs A,B,A in the listed member order. Does that plan obey every stated requirement?", "answer": "no", "options": [ "the information is insufficient", "yes", "no", "no feasible assignment exists" ], "settlement_stratum": "same-for-all:admissibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 2, "B": 2, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [], "form": "same-for-all", "task": "admissibility", "domain": "font-family" } }, { "id": "choice-0-1-21", "english": "For evaluation record C10121-feasibility, For documents C10121-1, C10121-2, C10121-3, the font-family choices have distinct IDs A, B, C. C10121-1 permits only A,B. C10121-2 permits only A,B. C10121-3 permits only A,B. Maximum uses within this assignment: A=2, B=2, C=0. The set C10121 contains precisely those three documents. Assign the same single font-family to all three documents.", "ainglish": "For evaluation record C10121-feasibility, For documents C10121-1, C10121-2, C10121-3, the font-family choices have distinct IDs A, B, C. C10121-1 permits only A,B. C10121-2 permits only A,B. C10121-3 permits only A,B. Maximum uses within this assignment: A=2, B=2, C=0. The set C10121 contains precisely those three documents. Assign exactly one font-family to each of these documents, same-for-all(C10121).", "question": "Can any complete plan obey all the stated requirements?", "answer": "no", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "same-for-all:feasibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 2, "B": 2, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [], "form": "same-for-all", "task": "feasibility", "domain": "font-family" } }, { "id": "choice-0-2-21", "english": "For evaluation record C10121-consequence, For documents C10121-1, C10121-2, C10121-3, the font-family choices have distinct IDs A, B, C. C10121-1 permits only A,B. C10121-2 permits only A,B. C10121-3 permits only A,B. Maximum uses within this assignment: A=2, B=2, C=0. The set C10121 contains precisely those three documents. Assign the same single font-family to all three documents.", "ainglish": "For evaluation record C10121-consequence, For documents C10121-1, C10121-2, C10121-3, the font-family choices have distinct IDs A, B, C. C10121-1 permits only A,B. C10121-2 permits only A,B. C10121-3 permits only A,B. Maximum uses within this assignment: A=2, B=2, C=0. The set C10121 contains precisely those three documents. Assign exactly one font-family to each of these documents, same-for-all(C10121).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "no feasible assignment exists", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "same-for-all:consequence", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 2, "B": 2, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [], "form": "same-for-all", "task": "consequence", "domain": "font-family" } }, { "id": "choice-1-0-21", "english": "For evaluation record C10121-admissibility, For documents C10121-1, C10121-2, C10121-3, the font-family choices have distinct IDs A, B, C. C10121-1 permits only A,B. C10121-2 permits only A,B. C10121-3 permits only A,B. Maximum uses within this assignment: A=2, B=2, C=0. The set C10121 contains precisely those three documents. Assign exactly one font-family to each of these documents; choices may be the same or different.", "ainglish": "For evaluation record C10121-admissibility, For documents C10121-1, C10121-2, C10121-3, the font-family choices have distinct IDs A, B, C. C10121-1 permits only A,B. C10121-2 permits only A,B. C10121-3 permits only A,B. Maximum uses within this assignment: A=2, B=2, C=0. The set C10121 contains precisely those three documents. Assign exactly one font-family to each of these documents, may-vary-across(C10121).", "question": "A proposed plan uses IDs A,B,A in the listed member order. Does that plan obey every stated requirement?", "answer": "yes", "options": [ "the information is insufficient", "yes", "no", "no feasible assignment exists" ], "settlement_stratum": "may-vary-across:admissibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 2, "B": 2, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "B" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "B", "A" ] ], "form": "may-vary-across", "task": "admissibility", "domain": "font-family" } }, { "id": "choice-1-1-21", "english": "For evaluation record C10121-feasibility, For documents C10121-1, C10121-2, C10121-3, the font-family choices have distinct IDs A, B, C. C10121-1 permits only A,B. C10121-2 permits only A,B. C10121-3 permits only A,B. Maximum uses within this assignment: A=2, B=2, C=0. The set C10121 contains precisely those three documents. Assign exactly one font-family to each of these documents; choices may be the same or different.", "ainglish": "For evaluation record C10121-feasibility, For documents C10121-1, C10121-2, C10121-3, the font-family choices have distinct IDs A, B, C. C10121-1 permits only A,B. C10121-2 permits only A,B. C10121-3 permits only A,B. Maximum uses within this assignment: A=2, B=2, C=0. The set C10121 contains precisely those three documents. Assign exactly one font-family to each of these documents, may-vary-across(C10121).", "question": "Can any complete plan obey all the stated requirements?", "answer": "yes", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "may-vary-across:feasibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 2, "B": 2, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "B" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "B", "A" ] ], "form": "may-vary-across", "task": "feasibility", "domain": "font-family" } }, { "id": "choice-1-2-21", "english": "For evaluation record C10121-consequence, For documents C10121-1, C10121-2, C10121-3, the font-family choices have distinct IDs A, B, C. C10121-1 permits only A,B. C10121-2 permits only A,B. C10121-3 permits only A,B. Maximum uses within this assignment: A=2, B=2, C=0. The set C10121 contains precisely those three documents. Assign exactly one font-family to each of these documents; choices may be the same or different.", "ainglish": "For evaluation record C10121-consequence, For documents C10121-1, C10121-2, C10121-3, the font-family choices have distinct IDs A, B, C. C10121-1 permits only A,B. C10121-2 permits only A,B. C10121-3 permits only A,B. Maximum uses within this assignment: A=2, B=2, C=0. The set C10121 contains precisely those three documents. Assign exactly one font-family to each of these documents, may-vary-across(C10121).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "no", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "may-vary-across:consequence", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 2, "B": 2, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "B" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "B", "A" ] ], "form": "may-vary-across", "task": "consequence", "domain": "font-family" } }, { "id": "choice-0-0-22", "english": "For evaluation record C10122-admissibility, For analyses C10122-1, C10122-2, C10122-3, the source-dataset choices have distinct IDs A, B, C. C10122-1 permits only A,B. C10122-2 permits only A,B. C10122-3 permits only A,B. Maximum uses within this assignment: A=2, B=2, C=0. The set C10122 contains precisely those three analyses. Assign the same single source-dataset to all three analyses.", "ainglish": "For evaluation record C10122-admissibility, For analyses C10122-1, C10122-2, C10122-3, the source-dataset choices have distinct IDs A, B, C. C10122-1 permits only A,B. C10122-2 permits only A,B. C10122-3 permits only A,B. Maximum uses within this assignment: A=2, B=2, C=0. The set C10122 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses, same-for-all(C10122).", "question": "A proposed plan uses IDs A,B,A in the listed member order. Does that plan obey every stated requirement?", "answer": "no", "options": [ "no", "no feasible assignment exists", "the information is insufficient", "yes" ], "settlement_stratum": "same-for-all:admissibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 2, "B": 2, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [], "form": "same-for-all", "task": "admissibility", "domain": "source-dataset" } }, { "id": "choice-0-1-22", "english": "For evaluation record C10122-feasibility, For analyses C10122-1, C10122-2, C10122-3, the source-dataset choices have distinct IDs A, B, C. C10122-1 permits only A,B. C10122-2 permits only A,B. C10122-3 permits only A,B. Maximum uses within this assignment: A=2, B=2, C=0. The set C10122 contains precisely those three analyses. Assign the same single source-dataset to all three analyses.", "ainglish": "For evaluation record C10122-feasibility, For analyses C10122-1, C10122-2, C10122-3, the source-dataset choices have distinct IDs A, B, C. C10122-1 permits only A,B. C10122-2 permits only A,B. C10122-3 permits only A,B. Maximum uses within this assignment: A=2, B=2, C=0. The set C10122 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses, same-for-all(C10122).", "question": "Can any complete plan obey all the stated requirements?", "answer": "no", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "same-for-all:feasibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 2, "B": 2, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [], "form": "same-for-all", "task": "feasibility", "domain": "source-dataset" } }, { "id": "choice-0-2-22", "english": "For evaluation record C10122-consequence, For analyses C10122-1, C10122-2, C10122-3, the source-dataset choices have distinct IDs A, B, C. C10122-1 permits only A,B. C10122-2 permits only A,B. C10122-3 permits only A,B. Maximum uses within this assignment: A=2, B=2, C=0. The set C10122 contains precisely those three analyses. Assign the same single source-dataset to all three analyses.", "ainglish": "For evaluation record C10122-consequence, For analyses C10122-1, C10122-2, C10122-3, the source-dataset choices have distinct IDs A, B, C. C10122-1 permits only A,B. C10122-2 permits only A,B. C10122-3 permits only A,B. Maximum uses within this assignment: A=2, B=2, C=0. The set C10122 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses, same-for-all(C10122).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "no feasible assignment exists", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "same-for-all:consequence", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 2, "B": 2, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [], "form": "same-for-all", "task": "consequence", "domain": "source-dataset" } }, { "id": "choice-1-0-22", "english": "For evaluation record C10122-admissibility, For analyses C10122-1, C10122-2, C10122-3, the source-dataset choices have distinct IDs A, B, C. C10122-1 permits only A,B. C10122-2 permits only A,B. C10122-3 permits only A,B. Maximum uses within this assignment: A=2, B=2, C=0. The set C10122 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses; choices may be the same or different.", "ainglish": "For evaluation record C10122-admissibility, For analyses C10122-1, C10122-2, C10122-3, the source-dataset choices have distinct IDs A, B, C. C10122-1 permits only A,B. C10122-2 permits only A,B. C10122-3 permits only A,B. Maximum uses within this assignment: A=2, B=2, C=0. The set C10122 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses, may-vary-across(C10122).", "question": "A proposed plan uses IDs A,B,A in the listed member order. Does that plan obey every stated requirement?", "answer": "yes", "options": [ "no", "no feasible assignment exists", "the information is insufficient", "yes" ], "settlement_stratum": "may-vary-across:admissibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 2, "B": 2, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "B" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "B", "A" ] ], "form": "may-vary-across", "task": "admissibility", "domain": "source-dataset" } }, { "id": "choice-1-1-22", "english": "For evaluation record C10122-feasibility, For analyses C10122-1, C10122-2, C10122-3, the source-dataset choices have distinct IDs A, B, C. C10122-1 permits only A,B. C10122-2 permits only A,B. C10122-3 permits only A,B. Maximum uses within this assignment: A=2, B=2, C=0. The set C10122 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses; choices may be the same or different.", "ainglish": "For evaluation record C10122-feasibility, For analyses C10122-1, C10122-2, C10122-3, the source-dataset choices have distinct IDs A, B, C. C10122-1 permits only A,B. C10122-2 permits only A,B. C10122-3 permits only A,B. Maximum uses within this assignment: A=2, B=2, C=0. The set C10122 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses, may-vary-across(C10122).", "question": "Can any complete plan obey all the stated requirements?", "answer": "yes", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "may-vary-across:feasibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 2, "B": 2, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "B" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "B", "A" ] ], "form": "may-vary-across", "task": "feasibility", "domain": "source-dataset" } }, { "id": "choice-1-2-22", "english": "For evaluation record C10122-consequence, For analyses C10122-1, C10122-2, C10122-3, the source-dataset choices have distinct IDs A, B, C. C10122-1 permits only A,B. C10122-2 permits only A,B. C10122-3 permits only A,B. Maximum uses within this assignment: A=2, B=2, C=0. The set C10122 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses; choices may be the same or different.", "ainglish": "For evaluation record C10122-consequence, For analyses C10122-1, C10122-2, C10122-3, the source-dataset choices have distinct IDs A, B, C. C10122-1 permits only A,B. C10122-2 permits only A,B. C10122-3 permits only A,B. Maximum uses within this assignment: A=2, B=2, C=0. The set C10122 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses, may-vary-across(C10122).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "no", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "may-vary-across:consequence", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 2, "B": 2, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "B" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "B", "A" ] ], "form": "may-vary-across", "task": "consequence", "domain": "source-dataset" } }, { "id": "choice-0-0-23", "english": "For evaluation record C10123-admissibility, For tasks C10123-1, C10123-2, C10123-3, the deadline choices have distinct IDs A, B, C. C10123-1 permits only A,B. C10123-2 permits only A,B. C10123-3 permits only A,B. Maximum uses within this assignment: A=2, B=2, C=0. The set C10123 contains precisely those three tasks. Assign the same single deadline to all three tasks.", "ainglish": "For evaluation record C10123-admissibility, For tasks C10123-1, C10123-2, C10123-3, the deadline choices have distinct IDs A, B, C. C10123-1 permits only A,B. C10123-2 permits only A,B. C10123-3 permits only A,B. Maximum uses within this assignment: A=2, B=2, C=0. The set C10123 contains precisely those three tasks. Assign exactly one deadline to each of these tasks, same-for-all(C10123).", "question": "A proposed plan uses IDs A,B,A in the listed member order. Does that plan obey every stated requirement?", "answer": "no", "options": [ "the information is insufficient", "yes", "no", "no feasible assignment exists" ], "settlement_stratum": "same-for-all:admissibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 2, "B": 2, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [], "form": "same-for-all", "task": "admissibility", "domain": "deadline" } }, { "id": "choice-0-1-23", "english": "For evaluation record C10123-feasibility, For tasks C10123-1, C10123-2, C10123-3, the deadline choices have distinct IDs A, B, C. C10123-1 permits only A,B. C10123-2 permits only A,B. C10123-3 permits only A,B. Maximum uses within this assignment: A=2, B=2, C=0. The set C10123 contains precisely those three tasks. Assign the same single deadline to all three tasks.", "ainglish": "For evaluation record C10123-feasibility, For tasks C10123-1, C10123-2, C10123-3, the deadline choices have distinct IDs A, B, C. C10123-1 permits only A,B. C10123-2 permits only A,B. C10123-3 permits only A,B. Maximum uses within this assignment: A=2, B=2, C=0. The set C10123 contains precisely those three tasks. Assign exactly one deadline to each of these tasks, same-for-all(C10123).", "question": "Can any complete plan obey all the stated requirements?", "answer": "no", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "same-for-all:feasibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 2, "B": 2, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [], "form": "same-for-all", "task": "feasibility", "domain": "deadline" } }, { "id": "choice-0-2-23", "english": "For evaluation record C10123-consequence, For tasks C10123-1, C10123-2, C10123-3, the deadline choices have distinct IDs A, B, C. C10123-1 permits only A,B. C10123-2 permits only A,B. C10123-3 permits only A,B. Maximum uses within this assignment: A=2, B=2, C=0. The set C10123 contains precisely those three tasks. Assign the same single deadline to all three tasks.", "ainglish": "For evaluation record C10123-consequence, For tasks C10123-1, C10123-2, C10123-3, the deadline choices have distinct IDs A, B, C. C10123-1 permits only A,B. C10123-2 permits only A,B. C10123-3 permits only A,B. Maximum uses within this assignment: A=2, B=2, C=0. The set C10123 contains precisely those three tasks. Assign exactly one deadline to each of these tasks, same-for-all(C10123).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "no feasible assignment exists", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "same-for-all:consequence", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 2, "B": 2, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [], "form": "same-for-all", "task": "consequence", "domain": "deadline" } }, { "id": "choice-1-0-23", "english": "For evaluation record C10123-admissibility, For tasks C10123-1, C10123-2, C10123-3, the deadline choices have distinct IDs A, B, C. C10123-1 permits only A,B. C10123-2 permits only A,B. C10123-3 permits only A,B. Maximum uses within this assignment: A=2, B=2, C=0. The set C10123 contains precisely those three tasks. Assign exactly one deadline to each of these tasks; choices may be the same or different.", "ainglish": "For evaluation record C10123-admissibility, For tasks C10123-1, C10123-2, C10123-3, the deadline choices have distinct IDs A, B, C. C10123-1 permits only A,B. C10123-2 permits only A,B. C10123-3 permits only A,B. Maximum uses within this assignment: A=2, B=2, C=0. The set C10123 contains precisely those three tasks. Assign exactly one deadline to each of these tasks, may-vary-across(C10123).", "question": "A proposed plan uses IDs A,B,A in the listed member order. Does that plan obey every stated requirement?", "answer": "yes", "options": [ "the information is insufficient", "yes", "no", "no feasible assignment exists" ], "settlement_stratum": "may-vary-across:admissibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 2, "B": 2, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "B" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "B", "A" ] ], "form": "may-vary-across", "task": "admissibility", "domain": "deadline" } }, { "id": "choice-1-1-23", "english": "For evaluation record C10123-feasibility, For tasks C10123-1, C10123-2, C10123-3, the deadline choices have distinct IDs A, B, C. C10123-1 permits only A,B. C10123-2 permits only A,B. C10123-3 permits only A,B. Maximum uses within this assignment: A=2, B=2, C=0. The set C10123 contains precisely those three tasks. Assign exactly one deadline to each of these tasks; choices may be the same or different.", "ainglish": "For evaluation record C10123-feasibility, For tasks C10123-1, C10123-2, C10123-3, the deadline choices have distinct IDs A, B, C. C10123-1 permits only A,B. C10123-2 permits only A,B. C10123-3 permits only A,B. Maximum uses within this assignment: A=2, B=2, C=0. The set C10123 contains precisely those three tasks. Assign exactly one deadline to each of these tasks, may-vary-across(C10123).", "question": "Can any complete plan obey all the stated requirements?", "answer": "yes", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "may-vary-across:feasibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 2, "B": 2, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "B" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "B", "A" ] ], "form": "may-vary-across", "task": "feasibility", "domain": "deadline" } }, { "id": "choice-1-2-23", "english": "For evaluation record C10123-consequence, For tasks C10123-1, C10123-2, C10123-3, the deadline choices have distinct IDs A, B, C. C10123-1 permits only A,B. C10123-2 permits only A,B. C10123-3 permits only A,B. Maximum uses within this assignment: A=2, B=2, C=0. The set C10123 contains precisely those three tasks. Assign exactly one deadline to each of these tasks; choices may be the same or different.", "ainglish": "For evaluation record C10123-consequence, For tasks C10123-1, C10123-2, C10123-3, the deadline choices have distinct IDs A, B, C. C10123-1 permits only A,B. C10123-2 permits only A,B. C10123-3 permits only A,B. Maximum uses within this assignment: A=2, B=2, C=0. The set C10123 contains precisely those three tasks. Assign exactly one deadline to each of these tasks, may-vary-across(C10123).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "no", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "may-vary-across:consequence", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 2, "B": 2, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "B" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "B", "A" ] ], "form": "may-vary-across", "task": "consequence", "domain": "deadline" } }, { "id": "choice-0-0-24", "english": "For evaluation record C10124-admissibility, For reports C10124-1, C10124-2, C10124-3, the reviewer choices have distinct IDs A, B, C. C10124-1 permits only A,B. C10124-2 permits only A,B. C10124-3 permits only A,B. Maximum uses within this assignment: A=1, B=1, C=0. The set C10124 contains precisely those three reports. Assign the same single reviewer to all three reports.", "ainglish": "For evaluation record C10124-admissibility, For reports C10124-1, C10124-2, C10124-3, the reviewer choices have distinct IDs A, B, C. C10124-1 permits only A,B. C10124-2 permits only A,B. C10124-3 permits only A,B. Maximum uses within this assignment: A=1, B=1, C=0. The set C10124 contains precisely those three reports. Assign exactly one reviewer to each of these reports, same-for-all(C10124).", "question": "A proposed plan uses IDs A,B,A in the listed member order. Does that plan obey every stated requirement?", "answer": "no", "options": [ "no", "no feasible assignment exists", "the information is insufficient", "yes" ], "settlement_stratum": "same-for-all:admissibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 1, "B": 1, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [], "form": "same-for-all", "task": "admissibility", "domain": "reviewer" } }, { "id": "choice-0-1-24", "english": "For evaluation record C10124-feasibility, For reports C10124-1, C10124-2, C10124-3, the reviewer choices have distinct IDs A, B, C. C10124-1 permits only A,B. C10124-2 permits only A,B. C10124-3 permits only A,B. Maximum uses within this assignment: A=1, B=1, C=0. The set C10124 contains precisely those three reports. Assign the same single reviewer to all three reports.", "ainglish": "For evaluation record C10124-feasibility, For reports C10124-1, C10124-2, C10124-3, the reviewer choices have distinct IDs A, B, C. C10124-1 permits only A,B. C10124-2 permits only A,B. C10124-3 permits only A,B. Maximum uses within this assignment: A=1, B=1, C=0. The set C10124 contains precisely those three reports. Assign exactly one reviewer to each of these reports, same-for-all(C10124).", "question": "Can any complete plan obey all the stated requirements?", "answer": "no", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "same-for-all:feasibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 1, "B": 1, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [], "form": "same-for-all", "task": "feasibility", "domain": "reviewer" } }, { "id": "choice-0-2-24", "english": "For evaluation record C10124-consequence, For reports C10124-1, C10124-2, C10124-3, the reviewer choices have distinct IDs A, B, C. C10124-1 permits only A,B. C10124-2 permits only A,B. C10124-3 permits only A,B. Maximum uses within this assignment: A=1, B=1, C=0. The set C10124 contains precisely those three reports. Assign the same single reviewer to all three reports.", "ainglish": "For evaluation record C10124-consequence, For reports C10124-1, C10124-2, C10124-3, the reviewer choices have distinct IDs A, B, C. C10124-1 permits only A,B. C10124-2 permits only A,B. C10124-3 permits only A,B. Maximum uses within this assignment: A=1, B=1, C=0. The set C10124 contains precisely those three reports. Assign exactly one reviewer to each of these reports, same-for-all(C10124).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "no feasible assignment exists", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "same-for-all:consequence", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 1, "B": 1, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [], "form": "same-for-all", "task": "consequence", "domain": "reviewer" } }, { "id": "choice-1-0-24", "english": "For evaluation record C10124-admissibility, For reports C10124-1, C10124-2, C10124-3, the reviewer choices have distinct IDs A, B, C. C10124-1 permits only A,B. C10124-2 permits only A,B. C10124-3 permits only A,B. Maximum uses within this assignment: A=1, B=1, C=0. The set C10124 contains precisely those three reports. Assign exactly one reviewer to each of these reports; choices may be the same or different.", "ainglish": "For evaluation record C10124-admissibility, For reports C10124-1, C10124-2, C10124-3, the reviewer choices have distinct IDs A, B, C. C10124-1 permits only A,B. C10124-2 permits only A,B. C10124-3 permits only A,B. Maximum uses within this assignment: A=1, B=1, C=0. The set C10124 contains precisely those three reports. Assign exactly one reviewer to each of these reports, may-vary-across(C10124).", "question": "A proposed plan uses IDs A,B,A in the listed member order. Does that plan obey every stated requirement?", "answer": "no", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "may-vary-across:admissibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 1, "B": 1, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [], "form": "may-vary-across", "task": "admissibility", "domain": "reviewer" } }, { "id": "choice-1-1-24", "english": "For evaluation record C10124-feasibility, For reports C10124-1, C10124-2, C10124-3, the reviewer choices have distinct IDs A, B, C. C10124-1 permits only A,B. C10124-2 permits only A,B. C10124-3 permits only A,B. Maximum uses within this assignment: A=1, B=1, C=0. The set C10124 contains precisely those three reports. Assign exactly one reviewer to each of these reports; choices may be the same or different.", "ainglish": "For evaluation record C10124-feasibility, For reports C10124-1, C10124-2, C10124-3, the reviewer choices have distinct IDs A, B, C. C10124-1 permits only A,B. C10124-2 permits only A,B. C10124-3 permits only A,B. Maximum uses within this assignment: A=1, B=1, C=0. The set C10124 contains precisely those three reports. Assign exactly one reviewer to each of these reports, may-vary-across(C10124).", "question": "Can any complete plan obey all the stated requirements?", "answer": "no", "options": [ "no", "no feasible assignment exists", "the information is insufficient", "yes" ], "settlement_stratum": "may-vary-across:feasibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 1, "B": 1, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [], "form": "may-vary-across", "task": "feasibility", "domain": "reviewer" } }, { "id": "choice-1-2-24", "english": "For evaluation record C10124-consequence, For reports C10124-1, C10124-2, C10124-3, the reviewer choices have distinct IDs A, B, C. C10124-1 permits only A,B. C10124-2 permits only A,B. C10124-3 permits only A,B. Maximum uses within this assignment: A=1, B=1, C=0. The set C10124 contains precisely those three reports. Assign exactly one reviewer to each of these reports; choices may be the same or different.", "ainglish": "For evaluation record C10124-consequence, For reports C10124-1, C10124-2, C10124-3, the reviewer choices have distinct IDs A, B, C. C10124-1 permits only A,B. C10124-2 permits only A,B. C10124-3 permits only A,B. Maximum uses within this assignment: A=1, B=1, C=0. The set C10124 contains precisely those three reports. Assign exactly one reviewer to each of these reports, may-vary-across(C10124).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "no feasible assignment exists", "options": [ "no", "no feasible assignment exists", "the information is insufficient", "yes" ], "settlement_stratum": "may-vary-across:consequence", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 1, "B": 1, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [], "form": "may-vary-across", "task": "consequence", "domain": "reviewer" } }, { "id": "choice-0-0-25", "english": "For evaluation record C10125-admissibility, For documents C10125-1, C10125-2, C10125-3, the font-family choices have distinct IDs A, B, C. C10125-1 permits only A,B. C10125-2 permits only A,B. C10125-3 permits only A,B. Maximum uses within this assignment: A=1, B=1, C=0. The set C10125 contains precisely those three documents. Assign the same single font-family to all three documents.", "ainglish": "For evaluation record C10125-admissibility, For documents C10125-1, C10125-2, C10125-3, the font-family choices have distinct IDs A, B, C. C10125-1 permits only A,B. C10125-2 permits only A,B. C10125-3 permits only A,B. Maximum uses within this assignment: A=1, B=1, C=0. The set C10125 contains precisely those three documents. Assign exactly one font-family to each of these documents, same-for-all(C10125).", "question": "A proposed plan uses IDs A,B,A in the listed member order. Does that plan obey every stated requirement?", "answer": "no", "options": [ "the information is insufficient", "yes", "no", "no feasible assignment exists" ], "settlement_stratum": "same-for-all:admissibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 1, "B": 1, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [], "form": "same-for-all", "task": "admissibility", "domain": "font-family" } }, { "id": "choice-0-1-25", "english": "For evaluation record C10125-feasibility, For documents C10125-1, C10125-2, C10125-3, the font-family choices have distinct IDs A, B, C. C10125-1 permits only A,B. C10125-2 permits only A,B. C10125-3 permits only A,B. Maximum uses within this assignment: A=1, B=1, C=0. The set C10125 contains precisely those three documents. Assign the same single font-family to all three documents.", "ainglish": "For evaluation record C10125-feasibility, For documents C10125-1, C10125-2, C10125-3, the font-family choices have distinct IDs A, B, C. C10125-1 permits only A,B. C10125-2 permits only A,B. C10125-3 permits only A,B. Maximum uses within this assignment: A=1, B=1, C=0. The set C10125 contains precisely those three documents. Assign exactly one font-family to each of these documents, same-for-all(C10125).", "question": "Can any complete plan obey all the stated requirements?", "answer": "no", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "same-for-all:feasibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 1, "B": 1, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [], "form": "same-for-all", "task": "feasibility", "domain": "font-family" } }, { "id": "choice-0-2-25", "english": "For evaluation record C10125-consequence, For documents C10125-1, C10125-2, C10125-3, the font-family choices have distinct IDs A, B, C. C10125-1 permits only A,B. C10125-2 permits only A,B. C10125-3 permits only A,B. Maximum uses within this assignment: A=1, B=1, C=0. The set C10125 contains precisely those three documents. Assign the same single font-family to all three documents.", "ainglish": "For evaluation record C10125-consequence, For documents C10125-1, C10125-2, C10125-3, the font-family choices have distinct IDs A, B, C. C10125-1 permits only A,B. C10125-2 permits only A,B. C10125-3 permits only A,B. Maximum uses within this assignment: A=1, B=1, C=0. The set C10125 contains precisely those three documents. Assign exactly one font-family to each of these documents, same-for-all(C10125).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "no feasible assignment exists", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "same-for-all:consequence", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 1, "B": 1, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [], "form": "same-for-all", "task": "consequence", "domain": "font-family" } }, { "id": "choice-1-0-25", "english": "For evaluation record C10125-admissibility, For documents C10125-1, C10125-2, C10125-3, the font-family choices have distinct IDs A, B, C. C10125-1 permits only A,B. C10125-2 permits only A,B. C10125-3 permits only A,B. Maximum uses within this assignment: A=1, B=1, C=0. The set C10125 contains precisely those three documents. Assign exactly one font-family to each of these documents; choices may be the same or different.", "ainglish": "For evaluation record C10125-admissibility, For documents C10125-1, C10125-2, C10125-3, the font-family choices have distinct IDs A, B, C. C10125-1 permits only A,B. C10125-2 permits only A,B. C10125-3 permits only A,B. Maximum uses within this assignment: A=1, B=1, C=0. The set C10125 contains precisely those three documents. Assign exactly one font-family to each of these documents, may-vary-across(C10125).", "question": "A proposed plan uses IDs A,B,A in the listed member order. Does that plan obey every stated requirement?", "answer": "no", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "may-vary-across:admissibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 1, "B": 1, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [], "form": "may-vary-across", "task": "admissibility", "domain": "font-family" } }, { "id": "choice-1-1-25", "english": "For evaluation record C10125-feasibility, For documents C10125-1, C10125-2, C10125-3, the font-family choices have distinct IDs A, B, C. C10125-1 permits only A,B. C10125-2 permits only A,B. C10125-3 permits only A,B. Maximum uses within this assignment: A=1, B=1, C=0. The set C10125 contains precisely those three documents. Assign exactly one font-family to each of these documents; choices may be the same or different.", "ainglish": "For evaluation record C10125-feasibility, For documents C10125-1, C10125-2, C10125-3, the font-family choices have distinct IDs A, B, C. C10125-1 permits only A,B. C10125-2 permits only A,B. C10125-3 permits only A,B. Maximum uses within this assignment: A=1, B=1, C=0. The set C10125 contains precisely those three documents. Assign exactly one font-family to each of these documents, may-vary-across(C10125).", "question": "Can any complete plan obey all the stated requirements?", "answer": "no", "options": [ "the information is insufficient", "yes", "no", "no feasible assignment exists" ], "settlement_stratum": "may-vary-across:feasibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 1, "B": 1, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [], "form": "may-vary-across", "task": "feasibility", "domain": "font-family" } }, { "id": "choice-1-2-25", "english": "For evaluation record C10125-consequence, For documents C10125-1, C10125-2, C10125-3, the font-family choices have distinct IDs A, B, C. C10125-1 permits only A,B. C10125-2 permits only A,B. C10125-3 permits only A,B. Maximum uses within this assignment: A=1, B=1, C=0. The set C10125 contains precisely those three documents. Assign exactly one font-family to each of these documents; choices may be the same or different.", "ainglish": "For evaluation record C10125-consequence, For documents C10125-1, C10125-2, C10125-3, the font-family choices have distinct IDs A, B, C. C10125-1 permits only A,B. C10125-2 permits only A,B. C10125-3 permits only A,B. Maximum uses within this assignment: A=1, B=1, C=0. The set C10125 contains precisely those three documents. Assign exactly one font-family to each of these documents, may-vary-across(C10125).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "no feasible assignment exists", "options": [ "the information is insufficient", "yes", "no", "no feasible assignment exists" ], "settlement_stratum": "may-vary-across:consequence", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 1, "B": 1, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [], "form": "may-vary-across", "task": "consequence", "domain": "font-family" } }, { "id": "choice-0-0-26", "english": "For evaluation record C10126-admissibility, For analyses C10126-1, C10126-2, C10126-3, the source-dataset choices have distinct IDs A, B, C. C10126-1 permits only A,B. C10126-2 permits only A,B. C10126-3 permits only A,B. Maximum uses within this assignment: A=1, B=1, C=0. The set C10126 contains precisely those three analyses. Assign the same single source-dataset to all three analyses.", "ainglish": "For evaluation record C10126-admissibility, For analyses C10126-1, C10126-2, C10126-3, the source-dataset choices have distinct IDs A, B, C. C10126-1 permits only A,B. C10126-2 permits only A,B. C10126-3 permits only A,B. Maximum uses within this assignment: A=1, B=1, C=0. The set C10126 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses, same-for-all(C10126).", "question": "A proposed plan uses IDs A,B,A in the listed member order. Does that plan obey every stated requirement?", "answer": "no", "options": [ "no", "no feasible assignment exists", "the information is insufficient", "yes" ], "settlement_stratum": "same-for-all:admissibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 1, "B": 1, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [], "form": "same-for-all", "task": "admissibility", "domain": "source-dataset" } }, { "id": "choice-0-1-26", "english": "For evaluation record C10126-feasibility, For analyses C10126-1, C10126-2, C10126-3, the source-dataset choices have distinct IDs A, B, C. C10126-1 permits only A,B. C10126-2 permits only A,B. C10126-3 permits only A,B. Maximum uses within this assignment: A=1, B=1, C=0. The set C10126 contains precisely those three analyses. Assign the same single source-dataset to all three analyses.", "ainglish": "For evaluation record C10126-feasibility, For analyses C10126-1, C10126-2, C10126-3, the source-dataset choices have distinct IDs A, B, C. C10126-1 permits only A,B. C10126-2 permits only A,B. C10126-3 permits only A,B. Maximum uses within this assignment: A=1, B=1, C=0. The set C10126 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses, same-for-all(C10126).", "question": "Can any complete plan obey all the stated requirements?", "answer": "no", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "same-for-all:feasibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 1, "B": 1, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [], "form": "same-for-all", "task": "feasibility", "domain": "source-dataset" } }, { "id": "choice-0-2-26", "english": "For evaluation record C10126-consequence, For analyses C10126-1, C10126-2, C10126-3, the source-dataset choices have distinct IDs A, B, C. C10126-1 permits only A,B. C10126-2 permits only A,B. C10126-3 permits only A,B. Maximum uses within this assignment: A=1, B=1, C=0. The set C10126 contains precisely those three analyses. Assign the same single source-dataset to all three analyses.", "ainglish": "For evaluation record C10126-consequence, For analyses C10126-1, C10126-2, C10126-3, the source-dataset choices have distinct IDs A, B, C. C10126-1 permits only A,B. C10126-2 permits only A,B. C10126-3 permits only A,B. Maximum uses within this assignment: A=1, B=1, C=0. The set C10126 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses, same-for-all(C10126).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "no feasible assignment exists", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "same-for-all:consequence", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 1, "B": 1, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [], "form": "same-for-all", "task": "consequence", "domain": "source-dataset" } }, { "id": "choice-1-0-26", "english": "For evaluation record C10126-admissibility, For analyses C10126-1, C10126-2, C10126-3, the source-dataset choices have distinct IDs A, B, C. C10126-1 permits only A,B. C10126-2 permits only A,B. C10126-3 permits only A,B. Maximum uses within this assignment: A=1, B=1, C=0. The set C10126 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses; choices may be the same or different.", "ainglish": "For evaluation record C10126-admissibility, For analyses C10126-1, C10126-2, C10126-3, the source-dataset choices have distinct IDs A, B, C. C10126-1 permits only A,B. C10126-2 permits only A,B. C10126-3 permits only A,B. Maximum uses within this assignment: A=1, B=1, C=0. The set C10126 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses, may-vary-across(C10126).", "question": "A proposed plan uses IDs A,B,A in the listed member order. Does that plan obey every stated requirement?", "answer": "no", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "may-vary-across:admissibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 1, "B": 1, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [], "form": "may-vary-across", "task": "admissibility", "domain": "source-dataset" } }, { "id": "choice-1-1-26", "english": "For evaluation record C10126-feasibility, For analyses C10126-1, C10126-2, C10126-3, the source-dataset choices have distinct IDs A, B, C. C10126-1 permits only A,B. C10126-2 permits only A,B. C10126-3 permits only A,B. Maximum uses within this assignment: A=1, B=1, C=0. The set C10126 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses; choices may be the same or different.", "ainglish": "For evaluation record C10126-feasibility, For analyses C10126-1, C10126-2, C10126-3, the source-dataset choices have distinct IDs A, B, C. C10126-1 permits only A,B. C10126-2 permits only A,B. C10126-3 permits only A,B. Maximum uses within this assignment: A=1, B=1, C=0. The set C10126 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses, may-vary-across(C10126).", "question": "Can any complete plan obey all the stated requirements?", "answer": "no", "options": [ "no", "no feasible assignment exists", "the information is insufficient", "yes" ], "settlement_stratum": "may-vary-across:feasibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 1, "B": 1, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [], "form": "may-vary-across", "task": "feasibility", "domain": "source-dataset" } }, { "id": "choice-1-2-26", "english": "For evaluation record C10126-consequence, For analyses C10126-1, C10126-2, C10126-3, the source-dataset choices have distinct IDs A, B, C. C10126-1 permits only A,B. C10126-2 permits only A,B. C10126-3 permits only A,B. Maximum uses within this assignment: A=1, B=1, C=0. The set C10126 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses; choices may be the same or different.", "ainglish": "For evaluation record C10126-consequence, For analyses C10126-1, C10126-2, C10126-3, the source-dataset choices have distinct IDs A, B, C. C10126-1 permits only A,B. C10126-2 permits only A,B. C10126-3 permits only A,B. Maximum uses within this assignment: A=1, B=1, C=0. The set C10126 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses, may-vary-across(C10126).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "no feasible assignment exists", "options": [ "no", "no feasible assignment exists", "the information is insufficient", "yes" ], "settlement_stratum": "may-vary-across:consequence", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 1, "B": 1, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [], "form": "may-vary-across", "task": "consequence", "domain": "source-dataset" } }, { "id": "choice-0-0-27", "english": "For evaluation record C10127-admissibility, For tasks C10127-1, C10127-2, C10127-3, the deadline choices have distinct IDs A, B, C. C10127-1 permits only A,B. C10127-2 permits only A,B. C10127-3 permits only A,B. Maximum uses within this assignment: A=1, B=1, C=0. The set C10127 contains precisely those three tasks. Assign the same single deadline to all three tasks.", "ainglish": "For evaluation record C10127-admissibility, For tasks C10127-1, C10127-2, C10127-3, the deadline choices have distinct IDs A, B, C. C10127-1 permits only A,B. C10127-2 permits only A,B. C10127-3 permits only A,B. Maximum uses within this assignment: A=1, B=1, C=0. The set C10127 contains precisely those three tasks. Assign exactly one deadline to each of these tasks, same-for-all(C10127).", "question": "A proposed plan uses IDs A,B,A in the listed member order. Does that plan obey every stated requirement?", "answer": "no", "options": [ "the information is insufficient", "yes", "no", "no feasible assignment exists" ], "settlement_stratum": "same-for-all:admissibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 1, "B": 1, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [], "form": "same-for-all", "task": "admissibility", "domain": "deadline" } }, { "id": "choice-0-1-27", "english": "For evaluation record C10127-feasibility, For tasks C10127-1, C10127-2, C10127-3, the deadline choices have distinct IDs A, B, C. C10127-1 permits only A,B. C10127-2 permits only A,B. C10127-3 permits only A,B. Maximum uses within this assignment: A=1, B=1, C=0. The set C10127 contains precisely those three tasks. Assign the same single deadline to all three tasks.", "ainglish": "For evaluation record C10127-feasibility, For tasks C10127-1, C10127-2, C10127-3, the deadline choices have distinct IDs A, B, C. C10127-1 permits only A,B. C10127-2 permits only A,B. C10127-3 permits only A,B. Maximum uses within this assignment: A=1, B=1, C=0. The set C10127 contains precisely those three tasks. Assign exactly one deadline to each of these tasks, same-for-all(C10127).", "question": "Can any complete plan obey all the stated requirements?", "answer": "no", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "same-for-all:feasibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 1, "B": 1, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [], "form": "same-for-all", "task": "feasibility", "domain": "deadline" } }, { "id": "choice-0-2-27", "english": "For evaluation record C10127-consequence, For tasks C10127-1, C10127-2, C10127-3, the deadline choices have distinct IDs A, B, C. C10127-1 permits only A,B. C10127-2 permits only A,B. C10127-3 permits only A,B. Maximum uses within this assignment: A=1, B=1, C=0. The set C10127 contains precisely those three tasks. Assign the same single deadline to all three tasks.", "ainglish": "For evaluation record C10127-consequence, For tasks C10127-1, C10127-2, C10127-3, the deadline choices have distinct IDs A, B, C. C10127-1 permits only A,B. C10127-2 permits only A,B. C10127-3 permits only A,B. Maximum uses within this assignment: A=1, B=1, C=0. The set C10127 contains precisely those three tasks. Assign exactly one deadline to each of these tasks, same-for-all(C10127).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "no feasible assignment exists", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "same-for-all:consequence", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 1, "B": 1, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [], "form": "same-for-all", "task": "consequence", "domain": "deadline" } }, { "id": "choice-1-0-27", "english": "For evaluation record C10127-admissibility, For tasks C10127-1, C10127-2, C10127-3, the deadline choices have distinct IDs A, B, C. C10127-1 permits only A,B. C10127-2 permits only A,B. C10127-3 permits only A,B. Maximum uses within this assignment: A=1, B=1, C=0. The set C10127 contains precisely those three tasks. Assign exactly one deadline to each of these tasks; choices may be the same or different.", "ainglish": "For evaluation record C10127-admissibility, For tasks C10127-1, C10127-2, C10127-3, the deadline choices have distinct IDs A, B, C. C10127-1 permits only A,B. C10127-2 permits only A,B. C10127-3 permits only A,B. Maximum uses within this assignment: A=1, B=1, C=0. The set C10127 contains precisely those three tasks. Assign exactly one deadline to each of these tasks, may-vary-across(C10127).", "question": "A proposed plan uses IDs A,B,A in the listed member order. Does that plan obey every stated requirement?", "answer": "no", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "may-vary-across:admissibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 1, "B": 1, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [], "form": "may-vary-across", "task": "admissibility", "domain": "deadline" } }, { "id": "choice-1-1-27", "english": "For evaluation record C10127-feasibility, For tasks C10127-1, C10127-2, C10127-3, the deadline choices have distinct IDs A, B, C. C10127-1 permits only A,B. C10127-2 permits only A,B. C10127-3 permits only A,B. Maximum uses within this assignment: A=1, B=1, C=0. The set C10127 contains precisely those three tasks. Assign exactly one deadline to each of these tasks; choices may be the same or different.", "ainglish": "For evaluation record C10127-feasibility, For tasks C10127-1, C10127-2, C10127-3, the deadline choices have distinct IDs A, B, C. C10127-1 permits only A,B. C10127-2 permits only A,B. C10127-3 permits only A,B. Maximum uses within this assignment: A=1, B=1, C=0. The set C10127 contains precisely those three tasks. Assign exactly one deadline to each of these tasks, may-vary-across(C10127).", "question": "Can any complete plan obey all the stated requirements?", "answer": "no", "options": [ "the information is insufficient", "yes", "no", "no feasible assignment exists" ], "settlement_stratum": "may-vary-across:feasibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 1, "B": 1, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [], "form": "may-vary-across", "task": "feasibility", "domain": "deadline" } }, { "id": "choice-1-2-27", "english": "For evaluation record C10127-consequence, For tasks C10127-1, C10127-2, C10127-3, the deadline choices have distinct IDs A, B, C. C10127-1 permits only A,B. C10127-2 permits only A,B. C10127-3 permits only A,B. Maximum uses within this assignment: A=1, B=1, C=0. The set C10127 contains precisely those three tasks. Assign exactly one deadline to each of these tasks; choices may be the same or different.", "ainglish": "For evaluation record C10127-consequence, For tasks C10127-1, C10127-2, C10127-3, the deadline choices have distinct IDs A, B, C. C10127-1 permits only A,B. C10127-2 permits only A,B. C10127-3 permits only A,B. Maximum uses within this assignment: A=1, B=1, C=0. The set C10127 contains precisely those three tasks. Assign exactly one deadline to each of these tasks, may-vary-across(C10127).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "no feasible assignment exists", "options": [ "the information is insufficient", "yes", "no", "no feasible assignment exists" ], "settlement_stratum": "may-vary-across:consequence", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 1, "B": 1, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [], "form": "may-vary-across", "task": "consequence", "domain": "deadline" } }, { "id": "choice-0-0-28", "english": "For evaluation record C10128-admissibility, For reports C10128-1, C10128-2, C10128-3, the reviewer choices have distinct IDs A, B, C. C10128-1 permits only A,B. C10128-2 permits only A,B. C10128-3 permits only A,B. Maximum uses within this assignment: A=3, B=3, C=0. Choices A and B have the same display name but are different identities. The set C10128 contains precisely those three reports. Assign the same single reviewer to all three reports.", "ainglish": "For evaluation record C10128-admissibility, For reports C10128-1, C10128-2, C10128-3, the reviewer choices have distinct IDs A, B, C. C10128-1 permits only A,B. C10128-2 permits only A,B. C10128-3 permits only A,B. Maximum uses within this assignment: A=3, B=3, C=0. Choices A and B have the same display name but are different identities. The set C10128 contains precisely those three reports. Assign exactly one reviewer to each of these reports, same-for-all(C10128).", "question": "A proposed plan uses IDs A,B,A in the listed member order. Does that plan obey every stated requirement?", "answer": "no", "options": [ "no", "no feasible assignment exists", "the information is insufficient", "yes" ], "settlement_stratum": "same-for-all:admissibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 3, "B": 3, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "B", "B", "B" ] ], "form": "same-for-all", "task": "admissibility", "domain": "reviewer" } }, { "id": "choice-0-1-28", "english": "For evaluation record C10128-feasibility, For reports C10128-1, C10128-2, C10128-3, the reviewer choices have distinct IDs A, B, C. C10128-1 permits only A,B. C10128-2 permits only A,B. C10128-3 permits only A,B. Maximum uses within this assignment: A=3, B=3, C=0. Choices A and B have the same display name but are different identities. The set C10128 contains precisely those three reports. Assign the same single reviewer to all three reports.", "ainglish": "For evaluation record C10128-feasibility, For reports C10128-1, C10128-2, C10128-3, the reviewer choices have distinct IDs A, B, C. C10128-1 permits only A,B. C10128-2 permits only A,B. C10128-3 permits only A,B. Maximum uses within this assignment: A=3, B=3, C=0. Choices A and B have the same display name but are different identities. The set C10128 contains precisely those three reports. Assign exactly one reviewer to each of these reports, same-for-all(C10128).", "question": "Can any complete plan obey all the stated requirements?", "answer": "yes", "options": [ "the information is insufficient", "yes", "no", "no feasible assignment exists" ], "settlement_stratum": "same-for-all:feasibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 3, "B": 3, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "B", "B", "B" ] ], "form": "same-for-all", "task": "feasibility", "domain": "reviewer" } }, { "id": "choice-0-2-28", "english": "For evaluation record C10128-consequence, For reports C10128-1, C10128-2, C10128-3, the reviewer choices have distinct IDs A, B, C. C10128-1 permits only A,B. C10128-2 permits only A,B. C10128-3 permits only A,B. Maximum uses within this assignment: A=3, B=3, C=0. Choices A and B have the same display name but are different identities. The set C10128 contains precisely those three reports. Assign the same single reviewer to all three reports.", "ainglish": "For evaluation record C10128-consequence, For reports C10128-1, C10128-2, C10128-3, the reviewer choices have distinct IDs A, B, C. C10128-1 permits only A,B. C10128-2 permits only A,B. C10128-3 permits only A,B. Maximum uses within this assignment: A=3, B=3, C=0. Choices A and B have the same display name but are different identities. The set C10128 contains precisely those three reports. Assign exactly one reviewer to each of these reports, same-for-all(C10128).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "yes", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "same-for-all:consequence", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 3, "B": 3, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "B", "B", "B" ] ], "form": "same-for-all", "task": "consequence", "domain": "reviewer" } }, { "id": "choice-1-0-28", "english": "For evaluation record C10128-admissibility, For reports C10128-1, C10128-2, C10128-3, the reviewer choices have distinct IDs A, B, C. C10128-1 permits only A,B. C10128-2 permits only A,B. C10128-3 permits only A,B. Maximum uses within this assignment: A=3, B=3, C=0. Choices A and B have the same display name but are different identities. The set C10128 contains precisely those three reports. Assign exactly one reviewer to each of these reports; choices may be the same or different.", "ainglish": "For evaluation record C10128-admissibility, For reports C10128-1, C10128-2, C10128-3, the reviewer choices have distinct IDs A, B, C. C10128-1 permits only A,B. C10128-2 permits only A,B. C10128-3 permits only A,B. Maximum uses within this assignment: A=3, B=3, C=0. Choices A and B have the same display name but are different identities. The set C10128 contains precisely those three reports. Assign exactly one reviewer to each of these reports, may-vary-across(C10128).", "question": "A proposed plan uses IDs A,B,A in the listed member order. Does that plan obey every stated requirement?", "answer": "yes", "options": [ "no", "no feasible assignment exists", "the information is insufficient", "yes" ], "settlement_stratum": "may-vary-across:admissibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 3, "B": 3, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "B" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "B", "A" ], [ "B", "B", "B" ] ], "form": "may-vary-across", "task": "admissibility", "domain": "reviewer" } }, { "id": "choice-1-1-28", "english": "For evaluation record C10128-feasibility, For reports C10128-1, C10128-2, C10128-3, the reviewer choices have distinct IDs A, B, C. C10128-1 permits only A,B. C10128-2 permits only A,B. C10128-3 permits only A,B. Maximum uses within this assignment: A=3, B=3, C=0. Choices A and B have the same display name but are different identities. The set C10128 contains precisely those three reports. Assign exactly one reviewer to each of these reports; choices may be the same or different.", "ainglish": "For evaluation record C10128-feasibility, For reports C10128-1, C10128-2, C10128-3, the reviewer choices have distinct IDs A, B, C. C10128-1 permits only A,B. C10128-2 permits only A,B. C10128-3 permits only A,B. Maximum uses within this assignment: A=3, B=3, C=0. Choices A and B have the same display name but are different identities. The set C10128 contains precisely those three reports. Assign exactly one reviewer to each of these reports, may-vary-across(C10128).", "question": "Can any complete plan obey all the stated requirements?", "answer": "yes", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "may-vary-across:feasibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 3, "B": 3, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "B" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "B", "A" ], [ "B", "B", "B" ] ], "form": "may-vary-across", "task": "feasibility", "domain": "reviewer" } }, { "id": "choice-1-2-28", "english": "For evaluation record C10128-consequence, For reports C10128-1, C10128-2, C10128-3, the reviewer choices have distinct IDs A, B, C. C10128-1 permits only A,B. C10128-2 permits only A,B. C10128-3 permits only A,B. Maximum uses within this assignment: A=3, B=3, C=0. Choices A and B have the same display name but are different identities. The set C10128 contains precisely those three reports. Assign exactly one reviewer to each of these reports; choices may be the same or different.", "ainglish": "For evaluation record C10128-consequence, For reports C10128-1, C10128-2, C10128-3, the reviewer choices have distinct IDs A, B, C. C10128-1 permits only A,B. C10128-2 permits only A,B. C10128-3 permits only A,B. Maximum uses within this assignment: A=3, B=3, C=0. Choices A and B have the same display name but are different identities. The set C10128 contains precisely those three reports. Assign exactly one reviewer to each of these reports, may-vary-across(C10128).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "no", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "may-vary-across:consequence", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 3, "B": 3, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "B" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "B", "A" ], [ "B", "B", "B" ] ], "form": "may-vary-across", "task": "consequence", "domain": "reviewer" } }, { "id": "choice-0-0-29", "english": "For evaluation record C10129-admissibility, For documents C10129-1, C10129-2, C10129-3, the font-family choices have distinct IDs A, B, C. C10129-1 permits only A,B. C10129-2 permits only A,B. C10129-3 permits only A,B. Maximum uses within this assignment: A=3, B=3, C=0. Choices A and B have the same display name but are different identities. The set C10129 contains precisely those three documents. Assign the same single font-family to all three documents.", "ainglish": "For evaluation record C10129-admissibility, For documents C10129-1, C10129-2, C10129-3, the font-family choices have distinct IDs A, B, C. C10129-1 permits only A,B. C10129-2 permits only A,B. C10129-3 permits only A,B. Maximum uses within this assignment: A=3, B=3, C=0. Choices A and B have the same display name but are different identities. The set C10129 contains precisely those three documents. Assign exactly one font-family to each of these documents, same-for-all(C10129).", "question": "A proposed plan uses IDs A,B,A in the listed member order. Does that plan obey every stated requirement?", "answer": "no", "options": [ "the information is insufficient", "yes", "no", "no feasible assignment exists" ], "settlement_stratum": "same-for-all:admissibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 3, "B": 3, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "B", "B", "B" ] ], "form": "same-for-all", "task": "admissibility", "domain": "font-family" } }, { "id": "choice-0-1-29", "english": "For evaluation record C10129-feasibility, For documents C10129-1, C10129-2, C10129-3, the font-family choices have distinct IDs A, B, C. C10129-1 permits only A,B. C10129-2 permits only A,B. C10129-3 permits only A,B. Maximum uses within this assignment: A=3, B=3, C=0. Choices A and B have the same display name but are different identities. The set C10129 contains precisely those three documents. Assign the same single font-family to all three documents.", "ainglish": "For evaluation record C10129-feasibility, For documents C10129-1, C10129-2, C10129-3, the font-family choices have distinct IDs A, B, C. C10129-1 permits only A,B. C10129-2 permits only A,B. C10129-3 permits only A,B. Maximum uses within this assignment: A=3, B=3, C=0. Choices A and B have the same display name but are different identities. The set C10129 contains precisely those three documents. Assign exactly one font-family to each of these documents, same-for-all(C10129).", "question": "Can any complete plan obey all the stated requirements?", "answer": "yes", "options": [ "no", "no feasible assignment exists", "the information is insufficient", "yes" ], "settlement_stratum": "same-for-all:feasibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 3, "B": 3, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "B", "B", "B" ] ], "form": "same-for-all", "task": "feasibility", "domain": "font-family" } }, { "id": "choice-0-2-29", "english": "For evaluation record C10129-consequence, For documents C10129-1, C10129-2, C10129-3, the font-family choices have distinct IDs A, B, C. C10129-1 permits only A,B. C10129-2 permits only A,B. C10129-3 permits only A,B. Maximum uses within this assignment: A=3, B=3, C=0. Choices A and B have the same display name but are different identities. The set C10129 contains precisely those three documents. Assign the same single font-family to all three documents.", "ainglish": "For evaluation record C10129-consequence, For documents C10129-1, C10129-2, C10129-3, the font-family choices have distinct IDs A, B, C. C10129-1 permits only A,B. C10129-2 permits only A,B. C10129-3 permits only A,B. Maximum uses within this assignment: A=3, B=3, C=0. Choices A and B have the same display name but are different identities. The set C10129 contains precisely those three documents. Assign exactly one font-family to each of these documents, same-for-all(C10129).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "yes", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "same-for-all:consequence", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 3, "B": 3, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "B", "B", "B" ] ], "form": "same-for-all", "task": "consequence", "domain": "font-family" } }, { "id": "choice-1-0-29", "english": "For evaluation record C10129-admissibility, For documents C10129-1, C10129-2, C10129-3, the font-family choices have distinct IDs A, B, C. C10129-1 permits only A,B. C10129-2 permits only A,B. C10129-3 permits only A,B. Maximum uses within this assignment: A=3, B=3, C=0. Choices A and B have the same display name but are different identities. The set C10129 contains precisely those three documents. Assign exactly one font-family to each of these documents; choices may be the same or different.", "ainglish": "For evaluation record C10129-admissibility, For documents C10129-1, C10129-2, C10129-3, the font-family choices have distinct IDs A, B, C. C10129-1 permits only A,B. C10129-2 permits only A,B. C10129-3 permits only A,B. Maximum uses within this assignment: A=3, B=3, C=0. Choices A and B have the same display name but are different identities. The set C10129 contains precisely those three documents. Assign exactly one font-family to each of these documents, may-vary-across(C10129).", "question": "A proposed plan uses IDs A,B,A in the listed member order. Does that plan obey every stated requirement?", "answer": "yes", "options": [ "the information is insufficient", "yes", "no", "no feasible assignment exists" ], "settlement_stratum": "may-vary-across:admissibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 3, "B": 3, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "B" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "B", "A" ], [ "B", "B", "B" ] ], "form": "may-vary-across", "task": "admissibility", "domain": "font-family" } }, { "id": "choice-1-1-29", "english": "For evaluation record C10129-feasibility, For documents C10129-1, C10129-2, C10129-3, the font-family choices have distinct IDs A, B, C. C10129-1 permits only A,B. C10129-2 permits only A,B. C10129-3 permits only A,B. Maximum uses within this assignment: A=3, B=3, C=0. Choices A and B have the same display name but are different identities. The set C10129 contains precisely those three documents. Assign exactly one font-family to each of these documents; choices may be the same or different.", "ainglish": "For evaluation record C10129-feasibility, For documents C10129-1, C10129-2, C10129-3, the font-family choices have distinct IDs A, B, C. C10129-1 permits only A,B. C10129-2 permits only A,B. C10129-3 permits only A,B. Maximum uses within this assignment: A=3, B=3, C=0. Choices A and B have the same display name but are different identities. The set C10129 contains precisely those three documents. Assign exactly one font-family to each of these documents, may-vary-across(C10129).", "question": "Can any complete plan obey all the stated requirements?", "answer": "yes", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "may-vary-across:feasibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 3, "B": 3, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "B" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "B", "A" ], [ "B", "B", "B" ] ], "form": "may-vary-across", "task": "feasibility", "domain": "font-family" } }, { "id": "choice-1-2-29", "english": "For evaluation record C10129-consequence, For documents C10129-1, C10129-2, C10129-3, the font-family choices have distinct IDs A, B, C. C10129-1 permits only A,B. C10129-2 permits only A,B. C10129-3 permits only A,B. Maximum uses within this assignment: A=3, B=3, C=0. Choices A and B have the same display name but are different identities. The set C10129 contains precisely those three documents. Assign exactly one font-family to each of these documents; choices may be the same or different.", "ainglish": "For evaluation record C10129-consequence, For documents C10129-1, C10129-2, C10129-3, the font-family choices have distinct IDs A, B, C. C10129-1 permits only A,B. C10129-2 permits only A,B. C10129-3 permits only A,B. Maximum uses within this assignment: A=3, B=3, C=0. Choices A and B have the same display name but are different identities. The set C10129 contains precisely those three documents. Assign exactly one font-family to each of these documents, may-vary-across(C10129).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "no", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "may-vary-across:consequence", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 3, "B": 3, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "B" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "B", "A" ], [ "B", "B", "B" ] ], "form": "may-vary-across", "task": "consequence", "domain": "font-family" } }, { "id": "choice-0-0-30", "english": "For evaluation record C10130-admissibility, For analyses C10130-1, C10130-2, C10130-3, the source-dataset choices have distinct IDs A, B, C. C10130-1 permits only A,B. C10130-2 permits only A,B. C10130-3 permits only A,B. Maximum uses within this assignment: A=3, B=3, C=0. Choices A and B have the same display name but are different identities. The set C10130 contains precisely those three analyses. Assign the same single source-dataset to all three analyses.", "ainglish": "For evaluation record C10130-admissibility, For analyses C10130-1, C10130-2, C10130-3, the source-dataset choices have distinct IDs A, B, C. C10130-1 permits only A,B. C10130-2 permits only A,B. C10130-3 permits only A,B. Maximum uses within this assignment: A=3, B=3, C=0. Choices A and B have the same display name but are different identities. The set C10130 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses, same-for-all(C10130).", "question": "A proposed plan uses IDs A,B,A in the listed member order. Does that plan obey every stated requirement?", "answer": "no", "options": [ "no", "no feasible assignment exists", "the information is insufficient", "yes" ], "settlement_stratum": "same-for-all:admissibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 3, "B": 3, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "B", "B", "B" ] ], "form": "same-for-all", "task": "admissibility", "domain": "source-dataset" } }, { "id": "choice-0-1-30", "english": "For evaluation record C10130-feasibility, For analyses C10130-1, C10130-2, C10130-3, the source-dataset choices have distinct IDs A, B, C. C10130-1 permits only A,B. C10130-2 permits only A,B. C10130-3 permits only A,B. Maximum uses within this assignment: A=3, B=3, C=0. Choices A and B have the same display name but are different identities. The set C10130 contains precisely those three analyses. Assign the same single source-dataset to all three analyses.", "ainglish": "For evaluation record C10130-feasibility, For analyses C10130-1, C10130-2, C10130-3, the source-dataset choices have distinct IDs A, B, C. C10130-1 permits only A,B. C10130-2 permits only A,B. C10130-3 permits only A,B. Maximum uses within this assignment: A=3, B=3, C=0. Choices A and B have the same display name but are different identities. The set C10130 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses, same-for-all(C10130).", "question": "Can any complete plan obey all the stated requirements?", "answer": "yes", "options": [ "the information is insufficient", "yes", "no", "no feasible assignment exists" ], "settlement_stratum": "same-for-all:feasibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 3, "B": 3, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "B", "B", "B" ] ], "form": "same-for-all", "task": "feasibility", "domain": "source-dataset" } }, { "id": "choice-0-2-30", "english": "For evaluation record C10130-consequence, For analyses C10130-1, C10130-2, C10130-3, the source-dataset choices have distinct IDs A, B, C. C10130-1 permits only A,B. C10130-2 permits only A,B. C10130-3 permits only A,B. Maximum uses within this assignment: A=3, B=3, C=0. Choices A and B have the same display name but are different identities. The set C10130 contains precisely those three analyses. Assign the same single source-dataset to all three analyses.", "ainglish": "For evaluation record C10130-consequence, For analyses C10130-1, C10130-2, C10130-3, the source-dataset choices have distinct IDs A, B, C. C10130-1 permits only A,B. C10130-2 permits only A,B. C10130-3 permits only A,B. Maximum uses within this assignment: A=3, B=3, C=0. Choices A and B have the same display name but are different identities. The set C10130 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses, same-for-all(C10130).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "yes", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "same-for-all:consequence", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 3, "B": 3, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "B", "B", "B" ] ], "form": "same-for-all", "task": "consequence", "domain": "source-dataset" } }, { "id": "choice-1-0-30", "english": "For evaluation record C10130-admissibility, For analyses C10130-1, C10130-2, C10130-3, the source-dataset choices have distinct IDs A, B, C. C10130-1 permits only A,B. C10130-2 permits only A,B. C10130-3 permits only A,B. Maximum uses within this assignment: A=3, B=3, C=0. Choices A and B have the same display name but are different identities. The set C10130 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses; choices may be the same or different.", "ainglish": "For evaluation record C10130-admissibility, For analyses C10130-1, C10130-2, C10130-3, the source-dataset choices have distinct IDs A, B, C. C10130-1 permits only A,B. C10130-2 permits only A,B. C10130-3 permits only A,B. Maximum uses within this assignment: A=3, B=3, C=0. Choices A and B have the same display name but are different identities. The set C10130 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses, may-vary-across(C10130).", "question": "A proposed plan uses IDs A,B,A in the listed member order. Does that plan obey every stated requirement?", "answer": "yes", "options": [ "no", "no feasible assignment exists", "the information is insufficient", "yes" ], "settlement_stratum": "may-vary-across:admissibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 3, "B": 3, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "B" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "B", "A" ], [ "B", "B", "B" ] ], "form": "may-vary-across", "task": "admissibility", "domain": "source-dataset" } }, { "id": "choice-1-1-30", "english": "For evaluation record C10130-feasibility, For analyses C10130-1, C10130-2, C10130-3, the source-dataset choices have distinct IDs A, B, C. C10130-1 permits only A,B. C10130-2 permits only A,B. C10130-3 permits only A,B. Maximum uses within this assignment: A=3, B=3, C=0. Choices A and B have the same display name but are different identities. The set C10130 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses; choices may be the same or different.", "ainglish": "For evaluation record C10130-feasibility, For analyses C10130-1, C10130-2, C10130-3, the source-dataset choices have distinct IDs A, B, C. C10130-1 permits only A,B. C10130-2 permits only A,B. C10130-3 permits only A,B. Maximum uses within this assignment: A=3, B=3, C=0. Choices A and B have the same display name but are different identities. The set C10130 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses, may-vary-across(C10130).", "question": "Can any complete plan obey all the stated requirements?", "answer": "yes", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "may-vary-across:feasibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 3, "B": 3, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "B" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "B", "A" ], [ "B", "B", "B" ] ], "form": "may-vary-across", "task": "feasibility", "domain": "source-dataset" } }, { "id": "choice-1-2-30", "english": "For evaluation record C10130-consequence, For analyses C10130-1, C10130-2, C10130-3, the source-dataset choices have distinct IDs A, B, C. C10130-1 permits only A,B. C10130-2 permits only A,B. C10130-3 permits only A,B. Maximum uses within this assignment: A=3, B=3, C=0. Choices A and B have the same display name but are different identities. The set C10130 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses; choices may be the same or different.", "ainglish": "For evaluation record C10130-consequence, For analyses C10130-1, C10130-2, C10130-3, the source-dataset choices have distinct IDs A, B, C. C10130-1 permits only A,B. C10130-2 permits only A,B. C10130-3 permits only A,B. Maximum uses within this assignment: A=3, B=3, C=0. Choices A and B have the same display name but are different identities. The set C10130 contains precisely those three analyses. Assign exactly one source-dataset to each of these analyses, may-vary-across(C10130).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "no", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "may-vary-across:consequence", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 3, "B": 3, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "B" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "B", "A" ], [ "B", "B", "B" ] ], "form": "may-vary-across", "task": "consequence", "domain": "source-dataset" } }, { "id": "choice-0-0-31", "english": "For evaluation record C10131-admissibility, For tasks C10131-1, C10131-2, C10131-3, the deadline choices have distinct IDs A, B, C. C10131-1 permits only A,B. C10131-2 permits only A,B. C10131-3 permits only A,B. Maximum uses within this assignment: A=3, B=3, C=0. Choices A and B have the same display name but are different identities. The set C10131 contains precisely those three tasks. Assign the same single deadline to all three tasks.", "ainglish": "For evaluation record C10131-admissibility, For tasks C10131-1, C10131-2, C10131-3, the deadline choices have distinct IDs A, B, C. C10131-1 permits only A,B. C10131-2 permits only A,B. C10131-3 permits only A,B. Maximum uses within this assignment: A=3, B=3, C=0. Choices A and B have the same display name but are different identities. The set C10131 contains precisely those three tasks. Assign exactly one deadline to each of these tasks, same-for-all(C10131).", "question": "A proposed plan uses IDs A,B,A in the listed member order. Does that plan obey every stated requirement?", "answer": "no", "options": [ "the information is insufficient", "yes", "no", "no feasible assignment exists" ], "settlement_stratum": "same-for-all:admissibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 3, "B": 3, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "B", "B", "B" ] ], "form": "same-for-all", "task": "admissibility", "domain": "deadline" } }, { "id": "choice-0-1-31", "english": "For evaluation record C10131-feasibility, For tasks C10131-1, C10131-2, C10131-3, the deadline choices have distinct IDs A, B, C. C10131-1 permits only A,B. C10131-2 permits only A,B. C10131-3 permits only A,B. Maximum uses within this assignment: A=3, B=3, C=0. Choices A and B have the same display name but are different identities. The set C10131 contains precisely those three tasks. Assign the same single deadline to all three tasks.", "ainglish": "For evaluation record C10131-feasibility, For tasks C10131-1, C10131-2, C10131-3, the deadline choices have distinct IDs A, B, C. C10131-1 permits only A,B. C10131-2 permits only A,B. C10131-3 permits only A,B. Maximum uses within this assignment: A=3, B=3, C=0. Choices A and B have the same display name but are different identities. The set C10131 contains precisely those three tasks. Assign exactly one deadline to each of these tasks, same-for-all(C10131).", "question": "Can any complete plan obey all the stated requirements?", "answer": "yes", "options": [ "no", "no feasible assignment exists", "the information is insufficient", "yes" ], "settlement_stratum": "same-for-all:feasibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 3, "B": 3, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "B", "B", "B" ] ], "form": "same-for-all", "task": "feasibility", "domain": "deadline" } }, { "id": "choice-0-2-31", "english": "For evaluation record C10131-consequence, For tasks C10131-1, C10131-2, C10131-3, the deadline choices have distinct IDs A, B, C. C10131-1 permits only A,B. C10131-2 permits only A,B. C10131-3 permits only A,B. Maximum uses within this assignment: A=3, B=3, C=0. Choices A and B have the same display name but are different identities. The set C10131 contains precisely those three tasks. Assign the same single deadline to all three tasks.", "ainglish": "For evaluation record C10131-consequence, For tasks C10131-1, C10131-2, C10131-3, the deadline choices have distinct IDs A, B, C. C10131-1 permits only A,B. C10131-2 permits only A,B. C10131-3 permits only A,B. Maximum uses within this assignment: A=3, B=3, C=0. Choices A and B have the same display name but are different identities. The set C10131 contains precisely those three tasks. Assign exactly one deadline to each of these tasks, same-for-all(C10131).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "yes", "options": [ "yes", "no", "no feasible assignment exists", "the information is insufficient" ], "settlement_stratum": "same-for-all:consequence", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 3, "B": 3, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "B", "B", "B" ] ], "form": "same-for-all", "task": "consequence", "domain": "deadline" } }, { "id": "choice-1-0-31", "english": "For evaluation record C10131-admissibility, For tasks C10131-1, C10131-2, C10131-3, the deadline choices have distinct IDs A, B, C. C10131-1 permits only A,B. C10131-2 permits only A,B. C10131-3 permits only A,B. Maximum uses within this assignment: A=3, B=3, C=0. Choices A and B have the same display name but are different identities. The set C10131 contains precisely those three tasks. Assign exactly one deadline to each of these tasks; choices may be the same or different.", "ainglish": "For evaluation record C10131-admissibility, For tasks C10131-1, C10131-2, C10131-3, the deadline choices have distinct IDs A, B, C. C10131-1 permits only A,B. C10131-2 permits only A,B. C10131-3 permits only A,B. Maximum uses within this assignment: A=3, B=3, C=0. Choices A and B have the same display name but are different identities. The set C10131 contains precisely those three tasks. Assign exactly one deadline to each of these tasks, may-vary-across(C10131).", "question": "A proposed plan uses IDs A,B,A in the listed member order. Does that plan obey every stated requirement?", "answer": "yes", "options": [ "the information is insufficient", "yes", "no", "no feasible assignment exists" ], "settlement_stratum": "may-vary-across:admissibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 3, "B": 3, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "B" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "B", "A" ], [ "B", "B", "B" ] ], "form": "may-vary-across", "task": "admissibility", "domain": "deadline" } }, { "id": "choice-1-1-31", "english": "For evaluation record C10131-feasibility, For tasks C10131-1, C10131-2, C10131-3, the deadline choices have distinct IDs A, B, C. C10131-1 permits only A,B. C10131-2 permits only A,B. C10131-3 permits only A,B. Maximum uses within this assignment: A=3, B=3, C=0. Choices A and B have the same display name but are different identities. The set C10131 contains precisely those three tasks. Assign exactly one deadline to each of these tasks; choices may be the same or different.", "ainglish": "For evaluation record C10131-feasibility, For tasks C10131-1, C10131-2, C10131-3, the deadline choices have distinct IDs A, B, C. C10131-1 permits only A,B. C10131-2 permits only A,B. C10131-3 permits only A,B. Maximum uses within this assignment: A=3, B=3, C=0. Choices A and B have the same display name but are different identities. The set C10131 contains precisely those three tasks. Assign exactly one deadline to each of these tasks, may-vary-across(C10131).", "question": "Can any complete plan obey all the stated requirements?", "answer": "yes", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "may-vary-across:feasibility", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 3, "B": 3, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "B" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "B", "A" ], [ "B", "B", "B" ] ], "form": "may-vary-across", "task": "feasibility", "domain": "deadline" } }, { "id": "choice-1-2-31", "english": "For evaluation record C10131-consequence, For tasks C10131-1, C10131-2, C10131-3, the deadline choices have distinct IDs A, B, C. C10131-1 permits only A,B. C10131-2 permits only A,B. C10131-3 permits only A,B. Maximum uses within this assignment: A=3, B=3, C=0. Choices A and B have the same display name but are different identities. The set C10131 contains precisely those three tasks. Assign exactly one deadline to each of these tasks; choices may be the same or different.", "ainglish": "For evaluation record C10131-consequence, For tasks C10131-1, C10131-2, C10131-3, the deadline choices have distinct IDs A, B, C. C10131-1 permits only A,B. C10131-2 permits only A,B. C10131-3 permits only A,B. Maximum uses within this assignment: A=3, B=3, C=0. Choices A and B have the same display name but are different identities. The set C10131 contains precisely those three tasks. Assign exactly one deadline to each of these tasks, may-vary-across(C10131).", "question": "Among plans obeying every requirement, must the first and last listed members use the same choice ID?", "answer": "no", "options": [ "no feasible assignment exists", "the information is insufficient", "yes", "no" ], "settlement_stratum": "may-vary-across:consequence", "ledger": { "eligibility": [ [ "A", "B" ], [ "A", "B" ], [ "A", "B" ] ], "capacities": { "A": 3, "B": 3, "C": 0 }, "candidate": [ "A", "B", "A" ], "feasible": [ [ "A", "A", "A" ], [ "A", "A", "B" ], [ "A", "B", "A" ], [ "A", "B", "B" ], [ "B", "A", "A" ], [ "B", "A", "B" ], [ "B", "B", "A" ], [ "B", "B", "B" ] ], "form": "may-vary-across", "task": "consequence", "domain": "deadline" } }, { "id": "choice-cal-0", "calibration": true, "english": "The sealed bag CHOICE-400 is with either Davin or Sela.", "ainglish": "The sealed bag CHOICE-400 is with Davin, not Sela.", "question": "Who has the sealed bag CHOICE-400?", "options": [ "Davin", "Sela", "the information does not determine who", "neither person" ], "answer": "Davin" }, { "id": "choice-cal-1", "calibration": true, "english": "The sealed bag CHOICE-401 is with either Orin or Tova.", "ainglish": "The sealed bag CHOICE-401 is with Orin, not Tova.", "question": "Who has the sealed bag CHOICE-401?", "options": [ "Tova", "the information does not determine who", "neither person", "Orin" ], "answer": "Orin" }, { "id": "choice-cal-2", "calibration": true, "english": "The sealed bag CHOICE-402 is with either Mika or Ruel.", "ainglish": "The sealed bag CHOICE-402 is with Mika, not Ruel.", "question": "Who has the sealed bag CHOICE-402?", "options": [ "the information does not determine who", "neither person", "Mika", "Ruel" ], "answer": "Mika" }, { "id": "choice-cal-3", "calibration": true, "english": "The sealed bag CHOICE-403 is with either Anya or Leif.", "ainglish": "The sealed bag CHOICE-403 is with Anya, not Leif.", "question": "Who has the sealed bag CHOICE-403?", "options": [ "neither person", "Anya", "Leif", "the information does not determine who" ], "answer": "Anya" }, { "id": "choice-cal-4", "calibration": true, "english": "The sealed bag CHOICE-404 is with either Imra or Bryn.", "ainglish": "The sealed bag CHOICE-404 is with Imra, not Bryn.", "question": "Who has the sealed bag CHOICE-404?", "options": [ "Imra", "Bryn", "the information does not determine who", "neither person" ], "answer": "Imra" }, { "id": "choice-cal-5", "calibration": true, "english": "The sealed bag CHOICE-405 is with either Zora or Huw.", "ainglish": "The sealed bag CHOICE-405 is with Zora, not Huw.", "question": "Who has the sealed bag CHOICE-405?", "options": [ "Huw", "the information does not determine who", "neither person", "Zora" ], "answer": "Zora" }, { "id": "choice-cal-6", "calibration": true, "english": "The sealed bag CHOICE-406 is with either Fenn or Nala.", "ainglish": "The sealed bag CHOICE-406 is with Fenn, not Nala.", "question": "Who has the sealed bag CHOICE-406?", "options": [ "the information does not determine who", "neither person", "Fenn", "Nala" ], "answer": "Fenn" }, { "id": "choice-cal-7", "calibration": true, "english": "The sealed bag CHOICE-407 is with either Avra or Tari.", "ainglish": "The sealed bag CHOICE-407 is with Avra, not Tari.", "question": "Who has the sealed bag CHOICE-407?", "options": [ "neither person", "Avra", "Tari", "the information does not determine who" ], "answer": "Avra" } ]