[
  {
    "name": "inspect_evals/mbpp - Sample 11",
    "description": "Task from inspect_evals/mbpp dataset, sample 11",
    "prompt": "You are an expert Python programmer. You will be given a task, and the tests that your code must pass.\nWrite the Python function to solve the task. Do not give additional explanations, just output the\nPython function. Only use imports that are included in Python's standard library.\n\nFor example:\n\n## Prompt 1\n```python\nWrite a function to find the similar elements from the given two tuple lists.\n```\n\n## Test Case 1\n```python\nassert similar_elements((3, 4, 5, 6),(5, 7, 4, 10)) == (4, 5)\nassert similar_elements((1, 2, 3, 4),(5, 4, 3, 7)) == (3, 4)\nassert similar_elements((11, 12, 14, 13),(17, 15, 14, 13)) == (13, 14)\n```\n\n## Completion 1\n```python\ndef similar_elements(test_tup1, test_tup2):\r\n  res = tuple(set(test_tup1) & set(test_tup2))\r\n  return (res) \n```\n\n## Prompt 2\n```python\nWrite a python function to identify non-prime numbers.\n```\n\n## Test Case 2\n```python\nassert is_not_prime(2) == False\nassert is_not_prime(10) == True\nassert is_not_prime(35) == True\n```\n\n## Completion 2\n```python\nimport math\r\ndef is_not_prime(n):\r\n    result = False\r\n    for i in range(2,int(math.sqrt(n)) + 1):\r\n        if n % i == 0:\r\n            result = True\r\n    return result\n```\n\n## Prompt 3\n```python\nWrite a function to find the largest integers from a given list of numbers using heap queue algorithm.\n```\n\n## Test Case 3\n```python\nassert heap_queue_largest( [25, 35, 22, 85, 14, 65, 75, 22, 58],3)==[85, 75, 65] \nassert heap_queue_largest( [25, 35, 22, 85, 14, 65, 75, 22, 58],2)==[85, 75] \nassert heap_queue_largest( [25, 35, 22, 85, 14, 65, 75, 22, 58],5)==[85, 75, 65, 58, 35]\n```\n\n## Completion 3\n```python\nimport heapq as hq\r\ndef heap_queue_largest(nums,n):\r\n  largest_nums = hq.nlargest(n, nums)\r\n  return largest_nums\n```\n\n\n# Now, do it for the following task.\n\n## Prompt:\n```python\nWrite a python function to remove first and last occurrence of a given character from the string.\n```\n\n## Test Case:\n```python\nassert remove_Occ(\"hello\",\"l\") == \"heo\"\nassert remove_Occ(\"abcda\",\"a\") == \"bcd\"\nassert remove_Occ(\"PHP\",\"P\") == \"H\"\n```\n\n## Completion:\n",
    "mcp_config": {
      "inspect": {
        "command": "docker",
        "args": [
          "run",
          "--rm",
          "-i",
          "--init",
          "-v",
          "/var/run/docker.sock:/var/run/docker.sock",
          "-v",
          "/home/genteki/.cache/inspect_evals:/root/.cache/inspect_evals",
          "hud-inspect:latest"
        ]
      }
    },
    "setup_tool": {
      "name": "load_task",
      "arguments": {
        "task_name": "inspect_evals/mbpp",
        "sample_id": 11,
        "model": "claude-sonnet-4-20250514"
      }
    },
    "evaluate_tool": {
      "name": "score_task",
      "arguments": {}
    },
    "agent_config": {
      "agent_class": "server.agents.InspectAgent",
      "disallowed_tools": [
        "_store_agent_message",
        "load_task",
        "score_task"
      ],
      "allowed_tools": [],
      "initial_screenshot": false
    },
    "system_prompt": "You are a helpful AI assistant. Follow the instructions in the user messages carefully."
  },
  {
    "name": "inspect_evals/mbpp - Sample 12",
    "description": "Task from inspect_evals/mbpp dataset, sample 12",
    "prompt": "You are an expert Python programmer. You will be given a task, and the tests that your code must pass.\nWrite the Python function to solve the task. Do not give additional explanations, just output the\nPython function. Only use imports that are included in Python's standard library.\n\nFor example:\n\n## Prompt 1\n```python\nWrite a function to find the similar elements from the given two tuple lists.\n```\n\n## Test Case 1\n```python\nassert similar_elements((3, 4, 5, 6),(5, 7, 4, 10)) == (4, 5)\nassert similar_elements((1, 2, 3, 4),(5, 4, 3, 7)) == (3, 4)\nassert similar_elements((11, 12, 14, 13),(17, 15, 14, 13)) == (13, 14)\n```\n\n## Completion 1\n```python\ndef similar_elements(test_tup1, test_tup2):\r\n  res = tuple(set(test_tup1) & set(test_tup2))\r\n  return (res) \n```\n\n## Prompt 2\n```python\nWrite a python function to identify non-prime numbers.\n```\n\n## Test Case 2\n```python\nassert is_not_prime(2) == False\nassert is_not_prime(10) == True\nassert is_not_prime(35) == True\n```\n\n## Completion 2\n```python\nimport math\r\ndef is_not_prime(n):\r\n    result = False\r\n    for i in range(2,int(math.sqrt(n)) + 1):\r\n        if n % i == 0:\r\n            result = True\r\n    return result\n```\n\n## Prompt 3\n```python\nWrite a function to find the largest integers from a given list of numbers using heap queue algorithm.\n```\n\n## Test Case 3\n```python\nassert heap_queue_largest( [25, 35, 22, 85, 14, 65, 75, 22, 58],3)==[85, 75, 65] \nassert heap_queue_largest( [25, 35, 22, 85, 14, 65, 75, 22, 58],2)==[85, 75] \nassert heap_queue_largest( [25, 35, 22, 85, 14, 65, 75, 22, 58],5)==[85, 75, 65, 58, 35]\n```\n\n## Completion 3\n```python\nimport heapq as hq\r\ndef heap_queue_largest(nums,n):\r\n  largest_nums = hq.nlargest(n, nums)\r\n  return largest_nums\n```\n\n\n# Now, do it for the following task.\n\n## Prompt:\n```python\nWrite a function to sort a given matrix in ascending order according to the sum of its rows.\n```\n\n## Test Case:\n```python\nassert sort_matrix([[1, 2, 3], [2, 4, 5], [1, 1, 1]])==[[1, 1, 1], [1, 2, 3], [2, 4, 5]]\nassert sort_matrix([[1, 2, 3], [-2, 4, -5], [1, -1, 1]])==[[-2, 4, -5], [1, -1, 1], [1, 2, 3]]\nassert sort_matrix([[5,8,9],[6,4,3],[2,1,4]])==[[2, 1, 4], [6, 4, 3], [5, 8, 9]]\n```\n\n## Completion:\n",
    "mcp_config": {
      "inspect": {
        "command": "docker",
        "args": [
          "run",
          "--rm",
          "-i",
          "--init",
          "-v",
          "/var/run/docker.sock:/var/run/docker.sock",
          "-v",
          "/home/genteki/.cache/inspect_evals:/root/.cache/inspect_evals",
          "hud-inspect:latest"
        ]
      }
    },
    "setup_tool": {
      "name": "load_task",
      "arguments": {
        "task_name": "inspect_evals/mbpp",
        "sample_id": 12,
        "model": "claude-sonnet-4-20250514"
      }
    },
    "evaluate_tool": {
      "name": "score_task",
      "arguments": {}
    },
    "agent_config": {
      "agent_class": "server.agents.InspectAgent",
      "disallowed_tools": [
        "_store_agent_message",
        "load_task",
        "score_task"
      ],
      "allowed_tools": [],
      "initial_screenshot": false
    },
    "system_prompt": "You are a helpful AI assistant. Follow the instructions in the user messages carefully."
  },
  {
    "name": "inspect_evals/mbpp - Sample 14",
    "description": "Task from inspect_evals/mbpp dataset, sample 14",
    "prompt": "You are an expert Python programmer. You will be given a task, and the tests that your code must pass.\nWrite the Python function to solve the task. Do not give additional explanations, just output the\nPython function. Only use imports that are included in Python's standard library.\n\nFor example:\n\n## Prompt 1\n```python\nWrite a function to find the similar elements from the given two tuple lists.\n```\n\n## Test Case 1\n```python\nassert similar_elements((3, 4, 5, 6),(5, 7, 4, 10)) == (4, 5)\nassert similar_elements((1, 2, 3, 4),(5, 4, 3, 7)) == (3, 4)\nassert similar_elements((11, 12, 14, 13),(17, 15, 14, 13)) == (13, 14)\n```\n\n## Completion 1\n```python\ndef similar_elements(test_tup1, test_tup2):\r\n  res = tuple(set(test_tup1) & set(test_tup2))\r\n  return (res) \n```\n\n## Prompt 2\n```python\nWrite a python function to identify non-prime numbers.\n```\n\n## Test Case 2\n```python\nassert is_not_prime(2) == False\nassert is_not_prime(10) == True\nassert is_not_prime(35) == True\n```\n\n## Completion 2\n```python\nimport math\r\ndef is_not_prime(n):\r\n    result = False\r\n    for i in range(2,int(math.sqrt(n)) + 1):\r\n        if n % i == 0:\r\n            result = True\r\n    return result\n```\n\n## Prompt 3\n```python\nWrite a function to find the largest integers from a given list of numbers using heap queue algorithm.\n```\n\n## Test Case 3\n```python\nassert heap_queue_largest( [25, 35, 22, 85, 14, 65, 75, 22, 58],3)==[85, 75, 65] \nassert heap_queue_largest( [25, 35, 22, 85, 14, 65, 75, 22, 58],2)==[85, 75] \nassert heap_queue_largest( [25, 35, 22, 85, 14, 65, 75, 22, 58],5)==[85, 75, 65, 58, 35]\n```\n\n## Completion 3\n```python\nimport heapq as hq\r\ndef heap_queue_largest(nums,n):\r\n  largest_nums = hq.nlargest(n, nums)\r\n  return largest_nums\n```\n\n\n# Now, do it for the following task.\n\n## Prompt:\n```python\nWrite a python function to find the volume of a triangular prism.\n```\n\n## Test Case:\n```python\nassert find_Volume(10,8,6) == 240\nassert find_Volume(3,2,2) == 6\nassert find_Volume(1,2,1) == 1\n```\n\n## Completion:\n",
    "mcp_config": {
      "inspect": {
        "command": "docker",
        "args": [
          "run",
          "--rm",
          "-i",
          "--init",
          "-v",
          "/var/run/docker.sock:/var/run/docker.sock",
          "-v",
          "/home/genteki/.cache/inspect_evals:/root/.cache/inspect_evals",
          "hud-inspect:latest"
        ]
      }
    },
    "setup_tool": {
      "name": "load_task",
      "arguments": {
        "task_name": "inspect_evals/mbpp",
        "sample_id": 14,
        "model": "claude-sonnet-4-20250514"
      }
    },
    "evaluate_tool": {
      "name": "score_task",
      "arguments": {}
    },
    "agent_config": {
      "agent_class": "server.agents.InspectAgent",
      "disallowed_tools": [
        "_store_agent_message",
        "load_task",
        "score_task"
      ],
      "allowed_tools": [],
      "initial_screenshot": false
    },
    "system_prompt": "You are a helpful AI assistant. Follow the instructions in the user messages carefully."
  },
  {
    "name": "inspect_evals/mbpp - Sample 16",
    "description": "Task from inspect_evals/mbpp dataset, sample 16",
    "prompt": "You are an expert Python programmer. You will be given a task, and the tests that your code must pass.\nWrite the Python function to solve the task. Do not give additional explanations, just output the\nPython function. Only use imports that are included in Python's standard library.\n\nFor example:\n\n## Prompt 1\n```python\nWrite a function to find the similar elements from the given two tuple lists.\n```\n\n## Test Case 1\n```python\nassert similar_elements((3, 4, 5, 6),(5, 7, 4, 10)) == (4, 5)\nassert similar_elements((1, 2, 3, 4),(5, 4, 3, 7)) == (3, 4)\nassert similar_elements((11, 12, 14, 13),(17, 15, 14, 13)) == (13, 14)\n```\n\n## Completion 1\n```python\ndef similar_elements(test_tup1, test_tup2):\r\n  res = tuple(set(test_tup1) & set(test_tup2))\r\n  return (res) \n```\n\n## Prompt 2\n```python\nWrite a python function to identify non-prime numbers.\n```\n\n## Test Case 2\n```python\nassert is_not_prime(2) == False\nassert is_not_prime(10) == True\nassert is_not_prime(35) == True\n```\n\n## Completion 2\n```python\nimport math\r\ndef is_not_prime(n):\r\n    result = False\r\n    for i in range(2,int(math.sqrt(n)) + 1):\r\n        if n % i == 0:\r\n            result = True\r\n    return result\n```\n\n## Prompt 3\n```python\nWrite a function to find the largest integers from a given list of numbers using heap queue algorithm.\n```\n\n## Test Case 3\n```python\nassert heap_queue_largest( [25, 35, 22, 85, 14, 65, 75, 22, 58],3)==[85, 75, 65] \nassert heap_queue_largest( [25, 35, 22, 85, 14, 65, 75, 22, 58],2)==[85, 75] \nassert heap_queue_largest( [25, 35, 22, 85, 14, 65, 75, 22, 58],5)==[85, 75, 65, 58, 35]\n```\n\n## Completion 3\n```python\nimport heapq as hq\r\ndef heap_queue_largest(nums,n):\r\n  largest_nums = hq.nlargest(n, nums)\r\n  return largest_nums\n```\n\n\n# Now, do it for the following task.\n\n## Prompt:\n```python\nWrite a function to that returns true if the input string contains sequences of lowercase letters joined with an underscore and false otherwise.\n```\n\n## Test Case:\n```python\nassert text_lowercase_underscore(\"aab_cbbbc\")==(True)\nassert text_lowercase_underscore(\"aab_Abbbc\")==(False)\nassert text_lowercase_underscore(\"Aaab_abbbc\")==(False)\n```\n\n## Completion:\n",
    "mcp_config": {
      "inspect": {
        "command": "docker",
        "args": [
          "run",
          "--rm",
          "-i",
          "--init",
          "-v",
          "/var/run/docker.sock:/var/run/docker.sock",
          "-v",
          "/home/genteki/.cache/inspect_evals:/root/.cache/inspect_evals",
          "hud-inspect:latest"
        ]
      }
    },
    "setup_tool": {
      "name": "load_task",
      "arguments": {
        "task_name": "inspect_evals/mbpp",
        "sample_id": 16,
        "model": "claude-sonnet-4-20250514"
      }
    },
    "evaluate_tool": {
      "name": "score_task",
      "arguments": {}
    },
    "agent_config": {
      "agent_class": "server.agents.InspectAgent",
      "disallowed_tools": [
        "_store_agent_message",
        "load_task",
        "score_task"
      ],
      "allowed_tools": [],
      "initial_screenshot": false
    },
    "system_prompt": "You are a helpful AI assistant. Follow the instructions in the user messages carefully."
  },
  {
    "name": "inspect_evals/mbpp - Sample 17",
    "description": "Task from inspect_evals/mbpp dataset, sample 17",
    "prompt": "You are an expert Python programmer. You will be given a task, and the tests that your code must pass.\nWrite the Python function to solve the task. Do not give additional explanations, just output the\nPython function. Only use imports that are included in Python's standard library.\n\nFor example:\n\n## Prompt 1\n```python\nWrite a function to find the similar elements from the given two tuple lists.\n```\n\n## Test Case 1\n```python\nassert similar_elements((3, 4, 5, 6),(5, 7, 4, 10)) == (4, 5)\nassert similar_elements((1, 2, 3, 4),(5, 4, 3, 7)) == (3, 4)\nassert similar_elements((11, 12, 14, 13),(17, 15, 14, 13)) == (13, 14)\n```\n\n## Completion 1\n```python\ndef similar_elements(test_tup1, test_tup2):\r\n  res = tuple(set(test_tup1) & set(test_tup2))\r\n  return (res) \n```\n\n## Prompt 2\n```python\nWrite a python function to identify non-prime numbers.\n```\n\n## Test Case 2\n```python\nassert is_not_prime(2) == False\nassert is_not_prime(10) == True\nassert is_not_prime(35) == True\n```\n\n## Completion 2\n```python\nimport math\r\ndef is_not_prime(n):\r\n    result = False\r\n    for i in range(2,int(math.sqrt(n)) + 1):\r\n        if n % i == 0:\r\n            result = True\r\n    return result\n```\n\n## Prompt 3\n```python\nWrite a function to find the largest integers from a given list of numbers using heap queue algorithm.\n```\n\n## Test Case 3\n```python\nassert heap_queue_largest( [25, 35, 22, 85, 14, 65, 75, 22, 58],3)==[85, 75, 65] \nassert heap_queue_largest( [25, 35, 22, 85, 14, 65, 75, 22, 58],2)==[85, 75] \nassert heap_queue_largest( [25, 35, 22, 85, 14, 65, 75, 22, 58],5)==[85, 75, 65, 58, 35]\n```\n\n## Completion 3\n```python\nimport heapq as hq\r\ndef heap_queue_largest(nums,n):\r\n  largest_nums = hq.nlargest(n, nums)\r\n  return largest_nums\n```\n\n\n# Now, do it for the following task.\n\n## Prompt:\n```python\nWrite a function that returns the perimeter of a square given its side length as input.\n```\n\n## Test Case:\n```python\nassert square_perimeter(10)==40\nassert square_perimeter(5)==20\nassert square_perimeter(4)==16\n```\n\n## Completion:\n",
    "mcp_config": {
      "inspect": {
        "command": "docker",
        "args": [
          "run",
          "--rm",
          "-i",
          "--init",
          "-v",
          "/var/run/docker.sock:/var/run/docker.sock",
          "-v",
          "/home/genteki/.cache/inspect_evals:/root/.cache/inspect_evals",
          "hud-inspect:latest"
        ]
      }
    },
    "setup_tool": {
      "name": "load_task",
      "arguments": {
        "task_name": "inspect_evals/mbpp",
        "sample_id": 17,
        "model": "claude-sonnet-4-20250514"
      }
    },
    "evaluate_tool": {
      "name": "score_task",
      "arguments": {}
    },
    "agent_config": {
      "agent_class": "server.agents.InspectAgent",
      "disallowed_tools": [
        "_store_agent_message",
        "load_task",
        "score_task"
      ],
      "allowed_tools": [],
      "initial_screenshot": false
    },
    "system_prompt": "You are a helpful AI assistant. Follow the instructions in the user messages carefully."
  },
  {
    "name": "inspect_evals/mbpp - Sample 18",
    "description": "Task from inspect_evals/mbpp dataset, sample 18",
    "prompt": "You are an expert Python programmer. You will be given a task, and the tests that your code must pass.\nWrite the Python function to solve the task. Do not give additional explanations, just output the\nPython function. Only use imports that are included in Python's standard library.\n\nFor example:\n\n## Prompt 1\n```python\nWrite a function to find the similar elements from the given two tuple lists.\n```\n\n## Test Case 1\n```python\nassert similar_elements((3, 4, 5, 6),(5, 7, 4, 10)) == (4, 5)\nassert similar_elements((1, 2, 3, 4),(5, 4, 3, 7)) == (3, 4)\nassert similar_elements((11, 12, 14, 13),(17, 15, 14, 13)) == (13, 14)\n```\n\n## Completion 1\n```python\ndef similar_elements(test_tup1, test_tup2):\r\n  res = tuple(set(test_tup1) & set(test_tup2))\r\n  return (res) \n```\n\n## Prompt 2\n```python\nWrite a python function to identify non-prime numbers.\n```\n\n## Test Case 2\n```python\nassert is_not_prime(2) == False\nassert is_not_prime(10) == True\nassert is_not_prime(35) == True\n```\n\n## Completion 2\n```python\nimport math\r\ndef is_not_prime(n):\r\n    result = False\r\n    for i in range(2,int(math.sqrt(n)) + 1):\r\n        if n % i == 0:\r\n            result = True\r\n    return result\n```\n\n## Prompt 3\n```python\nWrite a function to find the largest integers from a given list of numbers using heap queue algorithm.\n```\n\n## Test Case 3\n```python\nassert heap_queue_largest( [25, 35, 22, 85, 14, 65, 75, 22, 58],3)==[85, 75, 65] \nassert heap_queue_largest( [25, 35, 22, 85, 14, 65, 75, 22, 58],2)==[85, 75] \nassert heap_queue_largest( [25, 35, 22, 85, 14, 65, 75, 22, 58],5)==[85, 75, 65, 58, 35]\n```\n\n## Completion 3\n```python\nimport heapq as hq\r\ndef heap_queue_largest(nums,n):\r\n  largest_nums = hq.nlargest(n, nums)\r\n  return largest_nums\n```\n\n\n# Now, do it for the following task.\n\n## Prompt:\n```python\nWrite a function to remove characters from the first string which are present in the second string.\n```\n\n## Test Case:\n```python\nassert remove_dirty_chars(\"probasscurve\", \"pros\") == 'bacuve'\nassert remove_dirty_chars(\"digitalindia\", \"talent\") == 'digiidi'\nassert remove_dirty_chars(\"exoticmiles\", \"toxic\") == 'emles'\n```\n\n## Completion:\n",
    "mcp_config": {
      "inspect": {
        "command": "docker",
        "args": [
          "run",
          "--rm",
          "-i",
          "--init",
          "-v",
          "/var/run/docker.sock:/var/run/docker.sock",
          "-v",
          "/home/genteki/.cache/inspect_evals:/root/.cache/inspect_evals",
          "hud-inspect:latest"
        ]
      }
    },
    "setup_tool": {
      "name": "load_task",
      "arguments": {
        "task_name": "inspect_evals/mbpp",
        "sample_id": 18,
        "model": "claude-sonnet-4-20250514"
      }
    },
    "evaluate_tool": {
      "name": "score_task",
      "arguments": {}
    },
    "agent_config": {
      "agent_class": "server.agents.InspectAgent",
      "disallowed_tools": [
        "_store_agent_message",
        "load_task",
        "score_task"
      ],
      "allowed_tools": [],
      "initial_screenshot": false
    },
    "system_prompt": "You are a helpful AI assistant. Follow the instructions in the user messages carefully."
  },
  {
    "name": "inspect_evals/mbpp - Sample 19",
    "description": "Task from inspect_evals/mbpp dataset, sample 19",
    "prompt": "You are an expert Python programmer. You will be given a task, and the tests that your code must pass.\nWrite the Python function to solve the task. Do not give additional explanations, just output the\nPython function. Only use imports that are included in Python's standard library.\n\nFor example:\n\n## Prompt 1\n```python\nWrite a function to find the similar elements from the given two tuple lists.\n```\n\n## Test Case 1\n```python\nassert similar_elements((3, 4, 5, 6),(5, 7, 4, 10)) == (4, 5)\nassert similar_elements((1, 2, 3, 4),(5, 4, 3, 7)) == (3, 4)\nassert similar_elements((11, 12, 14, 13),(17, 15, 14, 13)) == (13, 14)\n```\n\n## Completion 1\n```python\ndef similar_elements(test_tup1, test_tup2):\r\n  res = tuple(set(test_tup1) & set(test_tup2))\r\n  return (res) \n```\n\n## Prompt 2\n```python\nWrite a python function to identify non-prime numbers.\n```\n\n## Test Case 2\n```python\nassert is_not_prime(2) == False\nassert is_not_prime(10) == True\nassert is_not_prime(35) == True\n```\n\n## Completion 2\n```python\nimport math\r\ndef is_not_prime(n):\r\n    result = False\r\n    for i in range(2,int(math.sqrt(n)) + 1):\r\n        if n % i == 0:\r\n            result = True\r\n    return result\n```\n\n## Prompt 3\n```python\nWrite a function to find the largest integers from a given list of numbers using heap queue algorithm.\n```\n\n## Test Case 3\n```python\nassert heap_queue_largest( [25, 35, 22, 85, 14, 65, 75, 22, 58],3)==[85, 75, 65] \nassert heap_queue_largest( [25, 35, 22, 85, 14, 65, 75, 22, 58],2)==[85, 75] \nassert heap_queue_largest( [25, 35, 22, 85, 14, 65, 75, 22, 58],5)==[85, 75, 65, 58, 35]\n```\n\n## Completion 3\n```python\nimport heapq as hq\r\ndef heap_queue_largest(nums,n):\r\n  largest_nums = hq.nlargest(n, nums)\r\n  return largest_nums\n```\n\n\n# Now, do it for the following task.\n\n## Prompt:\n```python\nWrite a function to find whether a given array of integers contains any duplicate element.\n```\n\n## Test Case:\n```python\nassert test_duplicate(([1,2,3,4,5]))==False\nassert test_duplicate(([1,2,3,4, 4]))==True\nassert test_duplicate([1,1,2,2,3,3,4,4,5])==True\n```\n\n## Completion:\n",
    "mcp_config": {
      "inspect": {
        "command": "docker",
        "args": [
          "run",
          "--rm",
          "-i",
          "--init",
          "-v",
          "/var/run/docker.sock:/var/run/docker.sock",
          "-v",
          "/home/genteki/.cache/inspect_evals:/root/.cache/inspect_evals",
          "hud-inspect:latest"
        ]
      }
    },
    "setup_tool": {
      "name": "load_task",
      "arguments": {
        "task_name": "inspect_evals/mbpp",
        "sample_id": 19,
        "model": "claude-sonnet-4-20250514"
      }
    },
    "evaluate_tool": {
      "name": "score_task",
      "arguments": {}
    },
    "agent_config": {
      "agent_class": "server.agents.InspectAgent",
      "disallowed_tools": [
        "_store_agent_message",
        "load_task",
        "score_task"
      ],
      "allowed_tools": [],
      "initial_screenshot": false
    },
    "system_prompt": "You are a helpful AI assistant. Follow the instructions in the user messages carefully."
  },
  {
    "name": "inspect_evals/mbpp - Sample 20",
    "description": "Task from inspect_evals/mbpp dataset, sample 20",
    "prompt": "You are an expert Python programmer. You will be given a task, and the tests that your code must pass.\nWrite the Python function to solve the task. Do not give additional explanations, just output the\nPython function. Only use imports that are included in Python's standard library.\n\nFor example:\n\n## Prompt 1\n```python\nWrite a function to find the similar elements from the given two tuple lists.\n```\n\n## Test Case 1\n```python\nassert similar_elements((3, 4, 5, 6),(5, 7, 4, 10)) == (4, 5)\nassert similar_elements((1, 2, 3, 4),(5, 4, 3, 7)) == (3, 4)\nassert similar_elements((11, 12, 14, 13),(17, 15, 14, 13)) == (13, 14)\n```\n\n## Completion 1\n```python\ndef similar_elements(test_tup1, test_tup2):\r\n  res = tuple(set(test_tup1) & set(test_tup2))\r\n  return (res) \n```\n\n## Prompt 2\n```python\nWrite a python function to identify non-prime numbers.\n```\n\n## Test Case 2\n```python\nassert is_not_prime(2) == False\nassert is_not_prime(10) == True\nassert is_not_prime(35) == True\n```\n\n## Completion 2\n```python\nimport math\r\ndef is_not_prime(n):\r\n    result = False\r\n    for i in range(2,int(math.sqrt(n)) + 1):\r\n        if n % i == 0:\r\n            result = True\r\n    return result\n```\n\n## Prompt 3\n```python\nWrite a function to find the largest integers from a given list of numbers using heap queue algorithm.\n```\n\n## Test Case 3\n```python\nassert heap_queue_largest( [25, 35, 22, 85, 14, 65, 75, 22, 58],3)==[85, 75, 65] \nassert heap_queue_largest( [25, 35, 22, 85, 14, 65, 75, 22, 58],2)==[85, 75] \nassert heap_queue_largest( [25, 35, 22, 85, 14, 65, 75, 22, 58],5)==[85, 75, 65, 58, 35]\n```\n\n## Completion 3\n```python\nimport heapq as hq\r\ndef heap_queue_largest(nums,n):\r\n  largest_nums = hq.nlargest(n, nums)\r\n  return largest_nums\n```\n\n\n# Now, do it for the following task.\n\n## Prompt:\n```python\nWrite a function to check if the given number is woodball or not.\n```\n\n## Test Case:\n```python\nassert is_woodall(383) == True\nassert is_woodall(254) == False\nassert is_woodall(200) == False\n```\n\n## Completion:\n",
    "mcp_config": {
      "inspect": {
        "command": "docker",
        "args": [
          "run",
          "--rm",
          "-i",
          "--init",
          "-v",
          "/var/run/docker.sock:/var/run/docker.sock",
          "-v",
          "/home/genteki/.cache/inspect_evals:/root/.cache/inspect_evals",
          "hud-inspect:latest"
        ]
      }
    },
    "setup_tool": {
      "name": "load_task",
      "arguments": {
        "task_name": "inspect_evals/mbpp",
        "sample_id": 20,
        "model": "claude-sonnet-4-20250514"
      }
    },
    "evaluate_tool": {
      "name": "score_task",
      "arguments": {}
    },
    "agent_config": {
      "agent_class": "server.agents.InspectAgent",
      "disallowed_tools": [
        "_store_agent_message",
        "load_task",
        "score_task"
      ],
      "allowed_tools": [],
      "initial_screenshot": false
    },
    "system_prompt": "You are a helpful AI assistant. Follow the instructions in the user messages carefully."
  },
  {
    "name": "inspect_evals/mbpp - Sample 56",
    "description": "Task from inspect_evals/mbpp dataset, sample 56",
    "prompt": "You are an expert Python programmer. You will be given a task, and the tests that your code must pass.\nWrite the Python function to solve the task. Do not give additional explanations, just output the\nPython function. Only use imports that are included in Python's standard library.\n\nFor example:\n\n## Prompt 1\n```python\nWrite a function to find the similar elements from the given two tuple lists.\n```\n\n## Test Case 1\n```python\nassert similar_elements((3, 4, 5, 6),(5, 7, 4, 10)) == (4, 5)\nassert similar_elements((1, 2, 3, 4),(5, 4, 3, 7)) == (3, 4)\nassert similar_elements((11, 12, 14, 13),(17, 15, 14, 13)) == (13, 14)\n```\n\n## Completion 1\n```python\ndef similar_elements(test_tup1, test_tup2):\r\n  res = tuple(set(test_tup1) & set(test_tup2))\r\n  return (res) \n```\n\n## Prompt 2\n```python\nWrite a python function to identify non-prime numbers.\n```\n\n## Test Case 2\n```python\nassert is_not_prime(2) == False\nassert is_not_prime(10) == True\nassert is_not_prime(35) == True\n```\n\n## Completion 2\n```python\nimport math\r\ndef is_not_prime(n):\r\n    result = False\r\n    for i in range(2,int(math.sqrt(n)) + 1):\r\n        if n % i == 0:\r\n            result = True\r\n    return result\n```\n\n## Prompt 3\n```python\nWrite a function to find the largest integers from a given list of numbers using heap queue algorithm.\n```\n\n## Test Case 3\n```python\nassert heap_queue_largest( [25, 35, 22, 85, 14, 65, 75, 22, 58],3)==[85, 75, 65] \nassert heap_queue_largest( [25, 35, 22, 85, 14, 65, 75, 22, 58],2)==[85, 75] \nassert heap_queue_largest( [25, 35, 22, 85, 14, 65, 75, 22, 58],5)==[85, 75, 65, 58, 35]\n```\n\n## Completion 3\n```python\nimport heapq as hq\r\ndef heap_queue_largest(nums,n):\r\n  largest_nums = hq.nlargest(n, nums)\r\n  return largest_nums\n```\n\n\n# Now, do it for the following task.\n\n## Prompt:\n```python\nWrite a python function to check if a given number is one less than twice its reverse.\n```\n\n## Test Case:\n```python\nassert check(70) == False\nassert check(23) == False\nassert check(73) == True\n```\n\n## Completion:\n",
    "mcp_config": {
      "inspect": {
        "command": "docker",
        "args": [
          "run",
          "--rm",
          "-i",
          "--init",
          "-v",
          "/var/run/docker.sock:/var/run/docker.sock",
          "-v",
          "/home/genteki/.cache/inspect_evals:/root/.cache/inspect_evals",
          "hud-inspect:latest"
        ]
      }
    },
    "setup_tool": {
      "name": "load_task",
      "arguments": {
        "task_name": "inspect_evals/mbpp",
        "sample_id": 56,
        "model": "claude-sonnet-4-20250514"
      }
    },
    "evaluate_tool": {
      "name": "score_task",
      "arguments": {}
    },
    "agent_config": {
      "agent_class": "server.agents.InspectAgent",
      "disallowed_tools": [
        "_store_agent_message",
        "load_task",
        "score_task"
      ],
      "allowed_tools": [],
      "initial_screenshot": false
    },
    "system_prompt": "You are a helpful AI assistant. Follow the instructions in the user messages carefully."
  },
  {
    "name": "inspect_evals/mbpp - Sample 57",
    "description": "Task from inspect_evals/mbpp dataset, sample 57",
    "prompt": "You are an expert Python programmer. You will be given a task, and the tests that your code must pass.\nWrite the Python function to solve the task. Do not give additional explanations, just output the\nPython function. Only use imports that are included in Python's standard library.\n\nFor example:\n\n## Prompt 1\n```python\nWrite a function to find the similar elements from the given two tuple lists.\n```\n\n## Test Case 1\n```python\nassert similar_elements((3, 4, 5, 6),(5, 7, 4, 10)) == (4, 5)\nassert similar_elements((1, 2, 3, 4),(5, 4, 3, 7)) == (3, 4)\nassert similar_elements((11, 12, 14, 13),(17, 15, 14, 13)) == (13, 14)\n```\n\n## Completion 1\n```python\ndef similar_elements(test_tup1, test_tup2):\r\n  res = tuple(set(test_tup1) & set(test_tup2))\r\n  return (res) \n```\n\n## Prompt 2\n```python\nWrite a python function to identify non-prime numbers.\n```\n\n## Test Case 2\n```python\nassert is_not_prime(2) == False\nassert is_not_prime(10) == True\nassert is_not_prime(35) == True\n```\n\n## Completion 2\n```python\nimport math\r\ndef is_not_prime(n):\r\n    result = False\r\n    for i in range(2,int(math.sqrt(n)) + 1):\r\n        if n % i == 0:\r\n            result = True\r\n    return result\n```\n\n## Prompt 3\n```python\nWrite a function to find the largest integers from a given list of numbers using heap queue algorithm.\n```\n\n## Test Case 3\n```python\nassert heap_queue_largest( [25, 35, 22, 85, 14, 65, 75, 22, 58],3)==[85, 75, 65] \nassert heap_queue_largest( [25, 35, 22, 85, 14, 65, 75, 22, 58],2)==[85, 75] \nassert heap_queue_largest( [25, 35, 22, 85, 14, 65, 75, 22, 58],5)==[85, 75, 65, 58, 35]\n```\n\n## Completion 3\n```python\nimport heapq as hq\r\ndef heap_queue_largest(nums,n):\r\n  largest_nums = hq.nlargest(n, nums)\r\n  return largest_nums\n```\n\n\n# Now, do it for the following task.\n\n## Prompt:\n```python\nWrite a python function to find the largest number that can be formed with the given list of digits.\n```\n\n## Test Case:\n```python\nassert find_Max_Num([1,2,3]) == 321\nassert find_Max_Num([4,5,6,1]) == 6541\nassert find_Max_Num([1,2,3,9]) == 9321\n```\n\n## Completion:\n",
    "mcp_config": {
      "inspect": {
        "command": "docker",
        "args": [
          "run",
          "--rm",
          "-i",
          "--init",
          "-v",
          "/var/run/docker.sock:/var/run/docker.sock",
          "-v",
          "/home/genteki/.cache/inspect_evals:/root/.cache/inspect_evals",
          "hud-inspect:latest"
        ]
      }
    },
    "setup_tool": {
      "name": "load_task",
      "arguments": {
        "task_name": "inspect_evals/mbpp",
        "sample_id": 57,
        "model": "claude-sonnet-4-20250514"
      }
    },
    "evaluate_tool": {
      "name": "score_task",
      "arguments": {}
    },
    "agent_config": {
      "agent_class": "server.agents.InspectAgent",
      "disallowed_tools": [
        "_store_agent_message",
        "load_task",
        "score_task"
      ],
      "allowed_tools": [],
      "initial_screenshot": false
    },
    "system_prompt": "You are a helpful AI assistant. Follow the instructions in the user messages carefully."
  }
]