{"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":"646aaac0-46e6-5a83-8ae1-b834df67ab42","task_key":"bbeh~5fmultistep~5farithmetic--full--646aaac0-46e6-5a83-8ae1-b834df67ab42","task_revision_id":"1","upstream_id":"","short_description":"Consider the following new operations:","config":"bbeh_multistep_arithmetic","split":"full","body":"{\"input\":\"Consider the following new operations:\\n\\n$a # b$ equals $(b * a) + b$ if $|a-b| < 2$ and $(a * b) + a$ otherwise.\\n$a ! b$ equals $(2 + b) * a$ if $a > b$ and $b$ otherwise.\\n$a : b$ equals $(a - b)$ if $a - b > 0$; otherwise,  it equals $a + b$.\\n$a ][ b$ equals $a # b$ if $gcd(a, b) == 1$ and $gcd(a, b)$ otherwise, where gcd stands for greatest common divisor.\\n$a ; b$ equals $(a + b)$ if $a : b > 0$; otherwise,  it equals $-a + -b$.\\n\\nLet A = (((((((((((((1 ; three) * -7) : -4) * 10) ][ -10) # -1) ; -1) : four) : nine) : -9) + -2) # 9) * -6)\\nLet B = ((((-4 ; -9) ][ (ten - 8)) * ((-5 + 5) + (-4 : -8))) - (((-4 + 8) + (three ][ two)) - ((-7 ! four) + (-3 : 6))))\\nLet C = ((((ten + eight) * (-3 * -10)) ; ((-3 ][ -6) + (-10 ][ five))) ; (((3 - -3) ; (one # -2)) ][ ((-2 + -10) + (-1 ! -3)))).\\nCompute A + B - C. Your final answer must be in number form.\"}","display_format":"text","language":"","answer_status":"published","assets":[],"source_url":"https://github.com/google-deepmind/bbeh","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}