{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"mmlu-pro","formal_name":"MMLU-Pro","introduction":"MMLU-Pro rebuilds MMLU with ten answer options instead of four and removes items that no longer separate models. Questions span fourteen academic and professional subjects.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://huggingface.co/datasets/TIGER-Lab/MMLU-Pro","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":"0fad470b-5d54-5bec-8a0a-83a94b325319","task_key":"default--test--10544","task_revision_id":"1","upstream_id":"10544","short_description":"Convert the following logical expressions to reverse Polish string notation: (a)…","config":"default","split":"test","body":"{\"category\":\"computer science\",\"options\":\"['ZXY \\\\\\\\odot XZ \\\\\\\\odot / Y \\\\\\\\equiv X > \\\\\\\\downarrow, YX / XX / YY / / /', 'ZXY \\\\\\\\odot XZ \\\\\\\\odot / YX \\\\\\\\equiv > \\\\\\\\downarrow, XY / XX / YY / / /', 'ZYX \\\\\\\\odot XZ \\\\\\\\odot / Y \\\\\\\\equiv X > \\\\\\\\downarrow, XY / XX / YY / / /', 'ZX \\\\\\\\odot YXZ \\\\\\\\odot / Y \\\\\\\\equiv > X \\\\\\\\downarrow, XX / YY / XY / / /', 'ZX\\\\nceilY \\\\\\\\odot XZ\\\\nceil \\\\\\\\odot / Y\\\\nceilX\\\\\\\\equiv> \\\\\\\\downarrow, XX / XY / YY / / /', 'ZX \\\\\\\\odot YZ \\\\\\\\odot X / Y \\\\\\\\equiv > X \\\\\\\\downarrow, XY / YY / XX / / /', 'Z\\\\nceilXY \\\\\\\\odot XZ\\\\nceil \\\\\\\\odot / Y\\\\nceilX\\\\\\\\equiv> \\\\\\\\downarrow, XY / XX / YY / / /', 'ZX \\\\\\\\odot YXZ \\\\\\\\odot / \\\\\\\\equiv Y > X \\\\\\\\downarrow, XY / XX / YY / / /', 'ZX\\\\nceilY \\\\\\\\odot XZ\\\\nceil \\\\\\\\odot / Y\\\\nceilX\\\\\\\\equiv> \\\\\\\\downarrow, XY / XX / YY / / /', 'ZX\\\\nceilX \\\\\\\\odot YZ\\\\nceil \\\\\\\\odot / Y\\\\nceilX\\\\\\\\equiv> \\\\\\\\downarrow, XY / XX / YY / / /']\",\"question\":\"Convert the following logical expressions to reverse Polish string notation: (a) (Z \\\\downarrow ((((X) \\\\odot Y) / (X \\\\odot (Z))) > ((Y) \\\\equiv X))) (b) (X / Y) / ((X / X) / (Y / Y))\",\"src\":\"stemez-ComputerScience\"}","display_format":"text","language":"","answer_status":"published","assets":[],"source_url":"https://huggingface.co/datasets/TIGER-Lab/MMLU-Pro","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}