{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"bbeh","formal_name":"BIG-Bench Extra Hard (BBEH)","introduction":"BIG-Bench Extra Hard evaluates language-model reasoning through challenging task categories. It offers full and mini distributions; this import contains the full distribution: 4,520 questions across all 23 task categories.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://github.com/google-deepmind/bbeh","indexing_mode":"index","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[],"history":"","construction":"","limitations":"","saturation":"","scores":[]}},"task_id":"59f2d8c0-3dc5-5542-995f-153fcfc3a0a3","task_key":"bbeh~5fword~5fsorting--full--59f2d8c0-3dc5-5542-995f-153fcfc3a0a3","task_revision_id":"1","upstream_id":"","short_description":"You are an expert in word sorting. You will be provided with a list of words and…","config":"bbeh_word_sorting","split":"full","body":"{\"input\":\"\\nYou are an expert in word sorting. You will be provided with a list of words and the steps taken, in the form of thoughts, to arrange them in alphabetical order.\\nYour job is to identify the first step that was a mistake in reasoning about the order of the words. This can be misunderstanding the order of\\nthe alphabet or getting the word or letter wrong or missing a word entirely.\\nQ: Sort the following words alphabetically: List: fireboat incompatible inviable bryant yesterday beaumont provocative opportune iceland westinghouse hernandez realty pronunciation investor forgetful warmth convergent\\nThought 1: I should start by looking at the first letter of the words in the list. The first letter: \\\"fireboat\\\": \\\"f\\\" (6). \\\"incompatible\\\": \\\"i\\\" (9). \\\"inviable\\\": \\\"i\\\" (9). \\\"bryant\\\": \\\"b\\\" (2). \\\"yesterday\\\": \\\"y\\\" (25). \\\"beaumont\\\": \\\"b\\\" (2). \\\"provocative\\\": \\\"p\\\" (16). \\\"opportune\\\": \\\"o\\\" (15). \\\"iceland\\\": \\\"i\\\" (9). \\\"westinghouse\\\": \\\"w\\\" (23). \\\"hernandez\\\": \\\"h\\\" (8). \\\"realty\\\": \\\"r\\\" (18). \\\"pronunciation\\\": \\\"p\\\" (16). \\\"investor\\\": \\\"i\\\" (9). \\\"forgetful\\\": \\\"f\\\" (6). \\\"warmth\\\": \\\"w\\\" (23). \\\"convergent\\\": \\\"c\\\" (3).\\nThought 2: We now have: (2) [\\\"beaumont\\\" ? \\\"bryant\\\"] < (3) \\\"convergent\\\" < (6) [\\\"fireboat\\\" ? \\\"forgetful\\\"] < (8) \\\"hernandez\\\" < (9) [\\\"incompatible\\\" ? \\\"inviable\\\" ? \\\"investor\\\"] < (15) \\\"opportune\\\" < (16) [\\\"pronunciation\\\" ? \\\"provocative\\\"] < (18) \\\"realty\\\" < (23) [\\\"warmth\\\" ? \\\"westinghouse\\\"] < (25) \\\"yesterday\\\".\\nThought 3: Now let's sort this subpart [\\\"beaumont\\\" ? \\\"bryant\\\"] by looking at their second letters. The second letter: \\\"beaumont\\\": \\\"e\\\" (5). \\\"bryant\\\": \\\"r\\\" (18).\\nThought 4: We now have: (5) \\\"beaumont\\\" < (18) \\\"bryant\\\" for the subpart. Hence, we have \\\"beaumont\\\" < \\\"bryant\\\" < \\\"convergent\\\" < [\\\"fireboat\\\" ? \\\"forgetful\\\"] < \\\"hernandez\\\" < [\\\"incompatible\\\" ? \\\"inviable\\\" ? \\\"investor\\\"] < \\\"opportune\\\" < [\\\"pronunciation\\\" ? \\\"provocative\\\"] < \\\"realty\\\" < [\\\"warmth\\\" ? \\\"westinghouse\\\"] < \\\"yesterday\\\".\\nThought 5: Now let's sort this subpart [\\\"fireboat\\\" ? \\\"forgetful\\\"] by looking at their second letters. The second letter: \\\"fireboat\\\": \\\"i\\\" (9). \\\"forgetful\\\": \\\"o\\\" (15).\\nThought 6: We now have: (9) \\\"fireboat\\\" < (15) \\\"forgetful\\\" for the subpart. Hence, we have \\\"beaumont\\\" < \\\"bryant\\\" < \\\"convergent\\\" < \\\"fireboat\\\" < \\\"forgetful\\\" < \\\"hernandez\\\" < [\\\"incompatible\\\" ? \\\"inviable\\\" ? \\\"investor\\\"] < \\\"opportune\\\" < [\\\"pronunciation\\\" ? \\\"provocative\\\"] < \\\"realty\\\" < [\\\"warmth\\\" ? \\\"westinghouse\\\"] < \\\"yesterday\\\".\\nThought 7: Now let's sort this subpart [\\\"incompatible\\\" ? \\\"inviable\\\" ? \\\"investor\\\"] by looking at their second letters. The second letter: \\\"incompatible\\\": \\\"n\\\" (14). \\\"inviable\\\": \\\"n\\\" (14). \\\"investor\\\": \\\"n\\\" (14).\\nThought 8: We now have: (14) [\\\"incompatible\\\" ? \\\"inviable\\\" ? \\\"investor\\\"] for the subpart. Hence, we have \\\"beaumont\\\" < \\\"bryant\\\" < \\\"convergent\\\" < \\\"fireboat\\\" < \\\"forgetful\\\" < \\\"hernandez\\\" < [\\\"incompatible\\\" ? \\\"inviable\\\" ? \\\"investor\\\"] < \\\"opportune\\\" < [\\\"pronunciation\\\" ? \\\"provocative\\\"] < \\\"realty\\\" < [\\\"warmth\\\" ? \\\"westinghouse\\\"] < \\\"yesterday\\\".\\nThought 9: Now let's sort this subpart [\\\"pronunciation\\\" ? \\\"provocative\\\"] by looking at their second letters. The second letter: \\\"pronunciation\\\": \\\"r\\\" (18). \\\"provocative\\\": \\\"r\\\" (18).\\nThought 10: We now have: (18) [\\\"pronunciation\\\" ? \\\"provocative\\\"] for the subpart. Hence, we have \\\"beaumont\\\" < \\\"bryant\\\" < \\\"convergent\\\" < \\\"fireboat\\\" < \\\"forgetful\\\" < \\\"hernandez\\\" < [\\\"incompatible\\\" ? \\\"inviable\\\" ? \\\"investor\\\"] < \\\"opportune\\\" < [\\\"pronunciation\\\" ? \\\"provocative\\\"] < \\\"realty\\\" < [\\\"warmth\\\" ? \\\"westinghouse\\\"] < \\\"yesterday\\\".\\nThought 11: Now let's sort this subpart [\\\"warmth\\\" ? \\\"westinghouse\\\"] by looking at their second letters. The second letter: \\\"warmth\\\": \\\"a\\\" (1). \\\"westinghouse\\\": \\\"e\\\" (5).\\nThought 12: We now have: (1) \\\"warmth\\\" < (5) \\\"westinghouse\\\" for the subpart. Hence, we have \\\"beaumont\\\" < \\\"bryant\\\" < \\\"convergent\\\" < \\\"fireboat\\\" < \\\"forgetful\\\" < \\\"hernandez\\\" < [\\\"incompatible\\\" ? \\\"inviable\\\" ? \\\"investor\\\"] < \\\"opportune\\\" < [\\\"pronunciation\\\" ? \\\"provocative\\\"] < \\\"realty\\\" < \\\"warmth\\\" < \\\"westinghouse\\\" < \\\"yesterday\\\".\\nThought 13: I have now sorted all the words. The answer is beaumont bryant convergent fireboat forgetful hernandez incompatible inviable investor opportune pronunciation provocative realty warmth westinghouse yesterday\\nQ: Is there a mistake in this sequence? Write \\\"No\\\" if there are no mistakes, or the number N if there is a mistake in Thought N.\\n\"}","display_format":"text","language":"","answer_status":"published","assets":[],"source_url":"https://github.com/google-deepmind/bbeh","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}