dag_id int64 0 49 | task dict | answer listlengths 2 2 | question stringlengths 62 64 | context listlengths 2 2 | documents listlengths 2 2 | system_prompt stringclasses 1 value | dag_num_nodes int64 100 500 | dag_p_const float64 0.1 0.1 | dag_p_class float64 0.25 0.25 | dag_max_arity int64 5 5 | id int64 0 499 |
|---|---|---|---|---|---|---|---|---|---|---|---|
40 | {
"answer": [
"C206",
"C79"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f381"
},
"question": "List the immediate input nodes to f381. (Order does not matter.)",
"task_id": "local-seed40-t00000-task_parents-f381",
"task_type": "task_parents"
} | [
"C206",
"C79"
] | List the immediate input nodes to f381. (Order does not matter.) | [
"def f499(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 1) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | [
"def f499(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 1) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 400 |
40 | {
"answer": [
"f40",
"f66"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f486"
},
"question": "List the immediate input nodes to f486. (Order does not matter.)",
"task_id": "local-seed40-t00001-task_parents-f486",
"task_type": "task_parents"
} | [
"f40",
"f66"
] | List the immediate input nodes to f486. (Order does not matter.) | [
"def f499(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 1) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | [
"def f499(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 1) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 401 |
40 | {
"answer": [
"f131",
"f250"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f439"
},
"question": "List the immediate input nodes to f439. (Order does not matter.)",
"task_id": "local-seed40-t00002-task_parents-f439",
"task_type": "task_parents"
} | [
"f131",
"f250"
] | List the immediate input nodes to f439. (Order does not matter.) | [
"def f499(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 1) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | [
"def f499(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 1) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 402 |
40 | {
"answer": [
"f14",
"f33"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f36"
},
"question": "List the immediate input nodes to f36. (Order does not matter.)",
"task_id": "local-seed40-t00003-task_parents-f36",
"task_type": "task_parents"
} | [
"f14",
"f33"
] | List the immediate input nodes to f36. (Order does not matter.) | [
"def f499(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 1) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | [
"def f499(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 1) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 403 |
40 | {
"answer": [
"C42",
"f55"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f208"
},
"question": "List the immediate input nodes to f208. (Order does not matter.)",
"task_id": "local-seed40-t00004-task_parents-f208",
"task_type": "task_parents"
} | [
"C42",
"f55"
] | List the immediate input nodes to f208. (Order does not matter.) | [
"def f499(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 1) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | [
"def f499(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 1) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 404 |
40 | {
"answer": [
"C218",
"f226"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f241"
},
"question": "List the immediate input nodes to f241. (Order does not matter.)",
"task_id": "local-seed40-t00005-task_parents-f241",
"task_type": "task_parents"
} | [
"C218",
"f226"
] | List the immediate input nodes to f241. (Order does not matter.) | [
"def f499(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 1) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | [
"def f499(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 1) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 405 |
40 | {
"answer": [
"f57",
"f61"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f179"
},
"question": "List the immediate input nodes to f179. (Order does not matter.)",
"task_id": "local-seed40-t00006-task_parents-f179",
"task_type": "task_parents"
} | [
"f57",
"f61"
] | List the immediate input nodes to f179. (Order does not matter.) | [
"def f499(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 1) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | [
"def f499(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 1) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 406 |
40 | {
"answer": [
"f14",
"f56"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f123"
},
"question": "List the immediate input nodes to f123. (Order does not matter.)",
"task_id": "local-seed40-t00007-task_parents-f123",
"task_type": "task_parents"
} | [
"f14",
"f56"
] | List the immediate input nodes to f123. (Order does not matter.) | [
"def f499(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 1) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | [
"def f499(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 1) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 407 |
40 | {
"answer": [
"C206",
"f145"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f292"
},
"question": "List the immediate input nodes to f292. (Order does not matter.)",
"task_id": "local-seed40-t00008-task_parents-f292",
"task_type": "task_parents"
} | [
"C206",
"f145"
] | List the immediate input nodes to f292. (Order does not matter.) | [
"def f499(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 1) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | [
"def f499(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 1) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 408 |
40 | {
"answer": [
"f195",
"f204"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f238"
},
"question": "List the immediate input nodes to f238. (Order does not matter.)",
"task_id": "local-seed40-t00009-task_parents-f238",
"task_type": "task_parents"
} | [
"f195",
"f204"
] | List the immediate input nodes to f238. (Order does not matter.) | [
"def f499(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 1) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | [
"def f499(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 1) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 409 |
41 | {
"answer": [
"f265",
"f8"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f298"
},
"question": "List the immediate input nodes to f298. (Order does not matter.)",
"task_id": "local-seed41-t00000-task_parents-f298",
"task_type": "task_parents"
} | [
"f265",
"f8"
] | List the immediate input nodes to f298. (Order does not matter.) | [
"def f497(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-10:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = f6(values[5], values[5])\n values[7] = f7... | [
"def f497(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-10:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = f6(values[5], values[5])\n values[7] = f7... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 410 |
41 | {
"answer": [
"f112",
"f26"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f266"
},
"question": "List the immediate input nodes to f266. (Order does not matter.)",
"task_id": "local-seed41-t00001-task_parents-f266",
"task_type": "task_parents"
} | [
"f112",
"f26"
] | List the immediate input nodes to f266. (Order does not matter.) | [
"def f497(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-10:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = f6(values[5], values[5])\n values[7] = f7... | [
"def f497(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-10:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = f6(values[5], values[5])\n values[7] = f7... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 411 |
41 | {
"answer": [
"C35",
"f16"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f191"
},
"question": "List the immediate input nodes to f191. (Order does not matter.)",
"task_id": "local-seed41-t00002-task_parents-f191",
"task_type": "task_parents"
} | [
"C35",
"f16"
] | List the immediate input nodes to f191. (Order does not matter.) | [
"def f497(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-10:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = f6(values[5], values[5])\n values[7] = f7... | [
"def f497(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-10:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = f6(values[5], values[5])\n values[7] = f7... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 412 |
41 | {
"answer": [
"C59",
"f80"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f149"
},
"question": "List the immediate input nodes to f149. (Order does not matter.)",
"task_id": "local-seed41-t00003-task_parents-f149",
"task_type": "task_parents"
} | [
"C59",
"f80"
] | List the immediate input nodes to f149. (Order does not matter.) | [
"def f497(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-10:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = f6(values[5], values[5])\n values[7] = f7... | [
"def f497(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-10:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = f6(values[5], values[5])\n values[7] = f7... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 413 |
41 | {
"answer": [
"f150",
"f201"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f302"
},
"question": "List the immediate input nodes to f302. (Order does not matter.)",
"task_id": "local-seed41-t00004-task_parents-f302",
"task_type": "task_parents"
} | [
"f150",
"f201"
] | List the immediate input nodes to f302. (Order does not matter.) | [
"def f497(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-10:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = f6(values[5], values[5])\n values[7] = f7... | [
"def f497(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-10:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = f6(values[5], values[5])\n values[7] = f7... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 414 |
41 | {
"answer": [
"f263",
"f287"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f445"
},
"question": "List the immediate input nodes to f445. (Order does not matter.)",
"task_id": "local-seed41-t00005-task_parents-f445",
"task_type": "task_parents"
} | [
"f263",
"f287"
] | List the immediate input nodes to f445. (Order does not matter.) | [
"def f497(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-10:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = f6(values[5], values[5])\n values[7] = f7... | [
"def f497(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-10:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = f6(values[5], values[5])\n values[7] = f7... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 415 |
41 | {
"answer": [
"C2",
"f192"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f230"
},
"question": "List the immediate input nodes to f230. (Order does not matter.)",
"task_id": "local-seed41-t00006-task_parents-f230",
"task_type": "task_parents"
} | [
"C2",
"f192"
] | List the immediate input nodes to f230. (Order does not matter.) | [
"def f497(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-10:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = f6(values[5], values[5])\n values[7] = f7... | [
"def f497(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-10:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = f6(values[5], values[5])\n values[7] = f7... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 416 |
41 | {
"answer": [
"f279",
"f344"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f427"
},
"question": "List the immediate input nodes to f427. (Order does not matter.)",
"task_id": "local-seed41-t00007-task_parents-f427",
"task_type": "task_parents"
} | [
"f279",
"f344"
] | List the immediate input nodes to f427. (Order does not matter.) | [
"def f497(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-10:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = f6(values[5], values[5])\n values[7] = f7... | [
"def f497(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-10:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = f6(values[5], values[5])\n values[7] = f7... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 417 |
41 | {
"answer": [
"f128",
"f161"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f225"
},
"question": "List the immediate input nodes to f225. (Order does not matter.)",
"task_id": "local-seed41-t00008-task_parents-f225",
"task_type": "task_parents"
} | [
"f128",
"f161"
] | List the immediate input nodes to f225. (Order does not matter.) | [
"def f497(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-10:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = f6(values[5], values[5])\n values[7] = f7... | [
"def f497(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-10:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = f6(values[5], values[5])\n values[7] = f7... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 418 |
41 | {
"answer": [
"f120",
"f208"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f301"
},
"question": "List the immediate input nodes to f301. (Order does not matter.)",
"task_id": "local-seed41-t00009-task_parents-f301",
"task_type": "task_parents"
} | [
"f120",
"f208"
] | List the immediate input nodes to f301. (Order does not matter.) | [
"def f497(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-10:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = f6(values[5], values[5])\n values[7] = f7... | [
"def f497(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-10:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = f6(values[5], values[5])\n values[7] = f7... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 419 |
42 | {
"answer": [
"f40",
"f56"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f108"
},
"question": "List the immediate input nodes to f108. (Order does not matter.)",
"task_id": "local-seed42-t00000-task_parents-f108",
"task_type": "task_parents"
} | [
"f40",
"f56"
] | List the immediate input nodes to f108. (Order does not matter.) | [
"def f499(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-10:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = K1(values[0], values[0])\n values[2] = C2\n values[3] = C3\n values[4] = f4(values[3], values[0])\n values[5] = C5\n values[6] = ... | [
"def f499(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-10:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = K1(values[0], values[0])\n values[2] = C2\n values[3] = C3\n values[4] = f4(values[3], values[0])\n values[5] = C5\n values[6] = ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 420 |
42 | {
"answer": [
"C0",
"C0"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f38"
},
"question": "List the immediate input nodes to f38. (Order does not matter.)",
"task_id": "local-seed42-t00001-task_parents-f38",
"task_type": "task_parents"
} | [
"C0",
"C0"
] | List the immediate input nodes to f38. (Order does not matter.) | [
"def f499(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-10:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = K1(values[0], values[0])\n values[2] = C2\n values[3] = C3\n values[4] = f4(values[3], values[0])\n values[5] = C5\n values[6] = ... | [
"def f499(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-10:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = K1(values[0], values[0])\n values[2] = C2\n values[3] = C3\n values[4] = f4(values[3], values[0])\n values[5] = C5\n values[6] = ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 421 |
42 | {
"answer": [
"f114",
"f120"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f236"
},
"question": "List the immediate input nodes to f236. (Order does not matter.)",
"task_id": "local-seed42-t00002-task_parents-f236",
"task_type": "task_parents"
} | [
"f114",
"f120"
] | List the immediate input nodes to f236. (Order does not matter.) | [
"def f499(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-10:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = K1(values[0], values[0])\n values[2] = C2\n values[3] = C3\n values[4] = f4(values[3], values[0])\n values[5] = C5\n values[6] = ... | [
"def f499(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-10:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = K1(values[0], values[0])\n values[2] = C2\n values[3] = C3\n values[4] = f4(values[3], values[0])\n values[5] = C5\n values[6] = ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 422 |
42 | {
"answer": [
"f73",
"f74"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f216"
},
"question": "List the immediate input nodes to f216. (Order does not matter.)",
"task_id": "local-seed42-t00003-task_parents-f216",
"task_type": "task_parents"
} | [
"f73",
"f74"
] | List the immediate input nodes to f216. (Order does not matter.) | [
"def f499(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-10:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = K1(values[0], values[0])\n values[2] = C2\n values[3] = C3\n values[4] = f4(values[3], values[0])\n values[5] = C5\n values[6] = ... | [
"def f499(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-10:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = K1(values[0], values[0])\n values[2] = C2\n values[3] = C3\n values[4] = f4(values[3], values[0])\n values[5] = C5\n values[6] = ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 423 |
42 | {
"answer": [
"f63",
"f71"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f199"
},
"question": "List the immediate input nodes to f199. (Order does not matter.)",
"task_id": "local-seed42-t00004-task_parents-f199",
"task_type": "task_parents"
} | [
"f63",
"f71"
] | List the immediate input nodes to f199. (Order does not matter.) | [
"def f499(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-10:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = K1(values[0], values[0])\n values[2] = C2\n values[3] = C3\n values[4] = f4(values[3], values[0])\n values[5] = C5\n values[6] = ... | [
"def f499(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-10:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = K1(values[0], values[0])\n values[2] = C2\n values[3] = C3\n values[4] = f4(values[3], values[0])\n values[5] = C5\n values[6] = ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 424 |
42 | {
"answer": [
"C16",
"f66"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f129"
},
"question": "List the immediate input nodes to f129. (Order does not matter.)",
"task_id": "local-seed42-t00005-task_parents-f129",
"task_type": "task_parents"
} | [
"C16",
"f66"
] | List the immediate input nodes to f129. (Order does not matter.) | [
"def f499(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-10:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = K1(values[0], values[0])\n values[2] = C2\n values[3] = C3\n values[4] = f4(values[3], values[0])\n values[5] = C5\n values[6] = ... | [
"def f499(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-10:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = K1(values[0], values[0])\n values[2] = C2\n values[3] = C3\n values[4] = f4(values[3], values[0])\n values[5] = C5\n values[6] = ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 425 |
42 | {
"answer": [
"f67",
"f85"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f102"
},
"question": "List the immediate input nodes to f102. (Order does not matter.)",
"task_id": "local-seed42-t00006-task_parents-f102",
"task_type": "task_parents"
} | [
"f67",
"f85"
] | List the immediate input nodes to f102. (Order does not matter.) | [
"def f499(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-10:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = K1(values[0], values[0])\n values[2] = C2\n values[3] = C3\n values[4] = f4(values[3], values[0])\n values[5] = C5\n values[6] = ... | [
"def f499(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-10:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = K1(values[0], values[0])\n values[2] = C2\n values[3] = C3\n values[4] = f4(values[3], values[0])\n values[5] = C5\n values[6] = ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 426 |
42 | {
"answer": [
"f225",
"f83"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f448"
},
"question": "List the immediate input nodes to f448. (Order does not matter.)",
"task_id": "local-seed42-t00007-task_parents-f448",
"task_type": "task_parents"
} | [
"f225",
"f83"
] | List the immediate input nodes to f448. (Order does not matter.) | [
"def f499(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-10:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = K1(values[0], values[0])\n values[2] = C2\n values[3] = C3\n values[4] = f4(values[3], values[0])\n values[5] = C5\n values[6] = ... | [
"def f499(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-10:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = K1(values[0], values[0])\n values[2] = C2\n values[3] = C3\n values[4] = f4(values[3], values[0])\n values[5] = C5\n values[6] = ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 427 |
42 | {
"answer": [
"f40",
"f71"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f88"
},
"question": "List the immediate input nodes to f88. (Order does not matter.)",
"task_id": "local-seed42-t00008-task_parents-f88",
"task_type": "task_parents"
} | [
"f40",
"f71"
] | List the immediate input nodes to f88. (Order does not matter.) | [
"def f499(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-10:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = K1(values[0], values[0])\n values[2] = C2\n values[3] = C3\n values[4] = f4(values[3], values[0])\n values[5] = C5\n values[6] = ... | [
"def f499(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-10:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = K1(values[0], values[0])\n values[2] = C2\n values[3] = C3\n values[4] = f4(values[3], values[0])\n values[5] = C5\n values[6] = ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 428 |
42 | {
"answer": [
"f257",
"f272"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f482"
},
"question": "List the immediate input nodes to f482. (Order does not matter.)",
"task_id": "local-seed42-t00009-task_parents-f482",
"task_type": "task_parents"
} | [
"f257",
"f272"
] | List the immediate input nodes to f482. (Order does not matter.) | [
"def f499(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-10:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = K1(values[0], values[0])\n values[2] = C2\n values[3] = C3\n values[4] = f4(values[3], values[0])\n values[5] = C5\n values[6] = ... | [
"def f499(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-10:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = K1(values[0], values[0])\n values[2] = C2\n values[3] = C3\n values[4] = f4(values[3], values[0])\n values[5] = C5\n values[6] = ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 429 |
43 | {
"answer": [
"C3",
"C38"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f39"
},
"question": "List the immediate input nodes to f39. (Order does not matter.)",
"task_id": "local-seed43-t00000-task_parents-f39",
"task_type": "task_parents"
} | [
"C3",
"C38"
] | List the immediate input nodes to f39. (Order does not matter.) | [
"def f498(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-6:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = f5(values[1], values[4])\n values[6] = C6\n values[7] = f7(... | [
"def f498(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-6:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = f5(values[1], values[4])\n values[6] = C6\n values[7] = f7(... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 430 |
43 | {
"answer": [
"C4",
"f127"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f239"
},
"question": "List the immediate input nodes to f239. (Order does not matter.)",
"task_id": "local-seed43-t00001-task_parents-f239",
"task_type": "task_parents"
} | [
"C4",
"f127"
] | List the immediate input nodes to f239. (Order does not matter.) | [
"def f498(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-6:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = f5(values[1], values[4])\n values[6] = C6\n values[7] = f7(... | [
"def f498(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-6:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = f5(values[1], values[4])\n values[6] = C6\n values[7] = f7(... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 431 |
43 | {
"answer": [
"K23",
"f41"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f121"
},
"question": "List the immediate input nodes to f121. (Order does not matter.)",
"task_id": "local-seed43-t00002-task_parents-f121",
"task_type": "task_parents"
} | [
"K23",
"f41"
] | List the immediate input nodes to f121. (Order does not matter.) | [
"def f498(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-6:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = f5(values[1], values[4])\n values[6] = C6\n values[7] = f7(... | [
"def f498(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-6:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = f5(values[1], values[4])\n values[6] = C6\n values[7] = f7(... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 432 |
43 | {
"answer": [
"f250",
"f313"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f374"
},
"question": "List the immediate input nodes to f374. (Order does not matter.)",
"task_id": "local-seed43-t00003-task_parents-f374",
"task_type": "task_parents"
} | [
"f250",
"f313"
] | List the immediate input nodes to f374. (Order does not matter.) | [
"def f498(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-6:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = f5(values[1], values[4])\n values[6] = C6\n values[7] = f7(... | [
"def f498(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-6:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = f5(values[1], values[4])\n values[6] = C6\n values[7] = f7(... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 433 |
43 | {
"answer": [
"f16",
"f300"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f302"
},
"question": "List the immediate input nodes to f302. (Order does not matter.)",
"task_id": "local-seed43-t00004-task_parents-f302",
"task_type": "task_parents"
} | [
"f16",
"f300"
] | List the immediate input nodes to f302. (Order does not matter.) | [
"def f498(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-6:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = f5(values[1], values[4])\n values[6] = C6\n values[7] = f7(... | [
"def f498(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-6:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = f5(values[1], values[4])\n values[6] = C6\n values[7] = f7(... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 434 |
43 | {
"answer": [
"C4",
"f18"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f75"
},
"question": "List the immediate input nodes to f75. (Order does not matter.)",
"task_id": "local-seed43-t00005-task_parents-f75",
"task_type": "task_parents"
} | [
"C4",
"f18"
] | List the immediate input nodes to f75. (Order does not matter.) | [
"def f498(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-6:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = f5(values[1], values[4])\n values[6] = C6\n values[7] = f7(... | [
"def f498(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-6:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = f5(values[1], values[4])\n values[6] = C6\n values[7] = f7(... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 435 |
43 | {
"answer": [
"C0",
"C6"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f370"
},
"question": "List the immediate input nodes to f370. (Order does not matter.)",
"task_id": "local-seed43-t00006-task_parents-f370",
"task_type": "task_parents"
} | [
"C0",
"C6"
] | List the immediate input nodes to f370. (Order does not matter.) | [
"def f498(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-6:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = f5(values[1], values[4])\n values[6] = C6\n values[7] = f7(... | [
"def f498(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-6:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = f5(values[1], values[4])\n values[6] = C6\n values[7] = f7(... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 436 |
43 | {
"answer": [
"f299",
"f341"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f464"
},
"question": "List the immediate input nodes to f464. (Order does not matter.)",
"task_id": "local-seed43-t00007-task_parents-f464",
"task_type": "task_parents"
} | [
"f299",
"f341"
] | List the immediate input nodes to f464. (Order does not matter.) | [
"def f498(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-6:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = f5(values[1], values[4])\n values[6] = C6\n values[7] = f7(... | [
"def f498(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-6:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = f5(values[1], values[4])\n values[6] = C6\n values[7] = f7(... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 437 |
43 | {
"answer": [
"C20",
"f193"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f398"
},
"question": "List the immediate input nodes to f398. (Order does not matter.)",
"task_id": "local-seed43-t00008-task_parents-f398",
"task_type": "task_parents"
} | [
"C20",
"f193"
] | List the immediate input nodes to f398. (Order does not matter.) | [
"def f498(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-6:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = f5(values[1], values[4])\n values[6] = C6\n values[7] = f7(... | [
"def f498(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-6:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = f5(values[1], values[4])\n values[6] = C6\n values[7] = f7(... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 438 |
43 | {
"answer": [
"f234",
"f281"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f469"
},
"question": "List the immediate input nodes to f469. (Order does not matter.)",
"task_id": "local-seed43-t00009-task_parents-f469",
"task_type": "task_parents"
} | [
"f234",
"f281"
] | List the immediate input nodes to f469. (Order does not matter.) | [
"def f498(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-6:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = f5(values[1], values[4])\n values[6] = C6\n values[7] = f7(... | [
"def f498(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-6:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = f5(values[1], values[4])\n values[6] = C6\n values[7] = f7(... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 439 |
44 | {
"answer": [
"f248",
"f301"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f327"
},
"question": "List the immediate input nodes to f327. (Order does not matter.)",
"task_id": "local-seed44-t00000-task_parents-f327",
"task_type": "task_parents"
} | [
"f248",
"f301"
] | List the immediate input nodes to f327. (Order does not matter.) | [
"def f499(a0, a1):\n a = a0 + 2 > a1\n b = a0 % 2 == 1\n return a and b or a1 < 2",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n ... | [
"def f499(a0, a1):\n a = a0 + 2 > a1\n b = a0 % 2 == 1\n return a and b or a1 < 2",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 440 |
44 | {
"answer": [
"f204",
"f347"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f410"
},
"question": "List the immediate input nodes to f410. (Order does not matter.)",
"task_id": "local-seed44-t00001-task_parents-f410",
"task_type": "task_parents"
} | [
"f204",
"f347"
] | List the immediate input nodes to f410. (Order does not matter.) | [
"def f499(a0, a1):\n a = a0 + 2 > a1\n b = a0 % 2 == 1\n return a and b or a1 < 2",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n ... | [
"def f499(a0, a1):\n a = a0 + 2 > a1\n b = a0 % 2 == 1\n return a and b or a1 < 2",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 441 |
44 | {
"answer": [
"C264",
"f279"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f427"
},
"question": "List the immediate input nodes to f427. (Order does not matter.)",
"task_id": "local-seed44-t00002-task_parents-f427",
"task_type": "task_parents"
} | [
"C264",
"f279"
] | List the immediate input nodes to f427. (Order does not matter.) | [
"def f499(a0, a1):\n a = a0 + 2 > a1\n b = a0 % 2 == 1\n return a and b or a1 < 2",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n ... | [
"def f499(a0, a1):\n a = a0 + 2 > a1\n b = a0 % 2 == 1\n return a and b or a1 < 2",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 442 |
44 | {
"answer": [
"C7",
"f28"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f99"
},
"question": "List the immediate input nodes to f99. (Order does not matter.)",
"task_id": "local-seed44-t00003-task_parents-f99",
"task_type": "task_parents"
} | [
"C7",
"f28"
] | List the immediate input nodes to f99. (Order does not matter.) | [
"def f499(a0, a1):\n a = a0 + 2 > a1\n b = a0 % 2 == 1\n return a and b or a1 < 2",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n ... | [
"def f499(a0, a1):\n a = a0 + 2 > a1\n b = a0 % 2 == 1\n return a and b or a1 < 2",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 443 |
44 | {
"answer": [
"f110",
"f116"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f148"
},
"question": "List the immediate input nodes to f148. (Order does not matter.)",
"task_id": "local-seed44-t00004-task_parents-f148",
"task_type": "task_parents"
} | [
"f110",
"f116"
] | List the immediate input nodes to f148. (Order does not matter.) | [
"def f499(a0, a1):\n a = a0 + 2 > a1\n b = a0 % 2 == 1\n return a and b or a1 < 2",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n ... | [
"def f499(a0, a1):\n a = a0 + 2 > a1\n b = a0 % 2 == 1\n return a and b or a1 < 2",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 444 |
44 | {
"answer": [
"K34",
"f263"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f302"
},
"question": "List the immediate input nodes to f302. (Order does not matter.)",
"task_id": "local-seed44-t00005-task_parents-f302",
"task_type": "task_parents"
} | [
"K34",
"f263"
] | List the immediate input nodes to f302. (Order does not matter.) | [
"def f499(a0, a1):\n a = a0 + 2 > a1\n b = a0 % 2 == 1\n return a and b or a1 < 2",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n ... | [
"def f499(a0, a1):\n a = a0 + 2 > a1\n b = a0 % 2 == 1\n return a and b or a1 < 2",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 445 |
44 | {
"answer": [
"f117",
"f69"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f188"
},
"question": "List the immediate input nodes to f188. (Order does not matter.)",
"task_id": "local-seed44-t00006-task_parents-f188",
"task_type": "task_parents"
} | [
"f117",
"f69"
] | List the immediate input nodes to f188. (Order does not matter.) | [
"def f499(a0, a1):\n a = a0 + 2 > a1\n b = a0 % 2 == 1\n return a and b or a1 < 2",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n ... | [
"def f499(a0, a1):\n a = a0 + 2 > a1\n b = a0 % 2 == 1\n return a and b or a1 < 2",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 446 |
44 | {
"answer": [
"f19",
"f227"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f234"
},
"question": "List the immediate input nodes to f234. (Order does not matter.)",
"task_id": "local-seed44-t00007-task_parents-f234",
"task_type": "task_parents"
} | [
"f19",
"f227"
] | List the immediate input nodes to f234. (Order does not matter.) | [
"def f499(a0, a1):\n a = a0 + 2 > a1\n b = a0 % 2 == 1\n return a and b or a1 < 2",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n ... | [
"def f499(a0, a1):\n a = a0 + 2 > a1\n b = a0 % 2 == 1\n return a and b or a1 < 2",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 447 |
44 | {
"answer": [
"C10",
"f29"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f39"
},
"question": "List the immediate input nodes to f39. (Order does not matter.)",
"task_id": "local-seed44-t00008-task_parents-f39",
"task_type": "task_parents"
} | [
"C10",
"f29"
] | List the immediate input nodes to f39. (Order does not matter.) | [
"def f499(a0, a1):\n a = a0 + 2 > a1\n b = a0 % 2 == 1\n return a and b or a1 < 2",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n ... | [
"def f499(a0, a1):\n a = a0 + 2 > a1\n b = a0 % 2 == 1\n return a and b or a1 < 2",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 448 |
44 | {
"answer": [
"f117",
"f69"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f188"
},
"question": "List the immediate input nodes to f188. (Order does not matter.)",
"task_id": "local-seed44-t00009-task_parents-f188",
"task_type": "task_parents"
} | [
"f117",
"f69"
] | List the immediate input nodes to f188. (Order does not matter.) | [
"def f499(a0, a1):\n a = a0 + 2 > a1\n b = a0 % 2 == 1\n return a and b or a1 < 2",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n ... | [
"def f499(a0, a1):\n a = a0 + 2 > a1\n b = a0 % 2 == 1\n return a and b or a1 < 2",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 449 |
45 | {
"answer": [
"f134",
"f209"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f232"
},
"question": "List the immediate input nodes to f232. (Order does not matter.)",
"task_id": "local-seed45-t00000-task_parents-f232",
"task_type": "task_parents"
} | [
"f134",
"f209"
] | List the immediate input nodes to f232. (Order does not matter.) | [
"def f498(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 9) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[1], values[1])\n values[3] = f3(val... | [
"def f498(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 9) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[1], values[1])\n values[3] = f3(val... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 450 |
45 | {
"answer": [
"f322",
"f93"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f342"
},
"question": "List the immediate input nodes to f342. (Order does not matter.)",
"task_id": "local-seed45-t00001-task_parents-f342",
"task_type": "task_parents"
} | [
"f322",
"f93"
] | List the immediate input nodes to f342. (Order does not matter.) | [
"def f498(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 9) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[1], values[1])\n values[3] = f3(val... | [
"def f498(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 9) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[1], values[1])\n values[3] = f3(val... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 451 |
45 | {
"answer": [
"K192",
"f185"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f397"
},
"question": "List the immediate input nodes to f397. (Order does not matter.)",
"task_id": "local-seed45-t00002-task_parents-f397",
"task_type": "task_parents"
} | [
"K192",
"f185"
] | List the immediate input nodes to f397. (Order does not matter.) | [
"def f498(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 9) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[1], values[1])\n values[3] = f3(val... | [
"def f498(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 9) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[1], values[1])\n values[3] = f3(val... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 452 |
45 | {
"answer": [
"f154",
"f201"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f218"
},
"question": "List the immediate input nodes to f218. (Order does not matter.)",
"task_id": "local-seed45-t00003-task_parents-f218",
"task_type": "task_parents"
} | [
"f154",
"f201"
] | List the immediate input nodes to f218. (Order does not matter.) | [
"def f498(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 9) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[1], values[1])\n values[3] = f3(val... | [
"def f498(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 9) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[1], values[1])\n values[3] = f3(val... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 453 |
45 | {
"answer": [
"K67",
"f18"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f73"
},
"question": "List the immediate input nodes to f73. (Order does not matter.)",
"task_id": "local-seed45-t00004-task_parents-f73",
"task_type": "task_parents"
} | [
"K67",
"f18"
] | List the immediate input nodes to f73. (Order does not matter.) | [
"def f498(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 9) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[1], values[1])\n values[3] = f3(val... | [
"def f498(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 9) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[1], values[1])\n values[3] = f3(val... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 454 |
45 | {
"answer": [
"f149",
"f186"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f256"
},
"question": "List the immediate input nodes to f256. (Order does not matter.)",
"task_id": "local-seed45-t00005-task_parents-f256",
"task_type": "task_parents"
} | [
"f149",
"f186"
] | List the immediate input nodes to f256. (Order does not matter.) | [
"def f498(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 9) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[1], values[1])\n values[3] = f3(val... | [
"def f498(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 9) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[1], values[1])\n values[3] = f3(val... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 455 |
45 | {
"answer": [
"K47",
"f3"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f284"
},
"question": "List the immediate input nodes to f284. (Order does not matter.)",
"task_id": "local-seed45-t00006-task_parents-f284",
"task_type": "task_parents"
} | [
"K47",
"f3"
] | List the immediate input nodes to f284. (Order does not matter.) | [
"def f498(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 9) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[1], values[1])\n values[3] = f3(val... | [
"def f498(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 9) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[1], values[1])\n values[3] = f3(val... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 456 |
45 | {
"answer": [
"f3",
"f4"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f19"
},
"question": "List the immediate input nodes to f19. (Order does not matter.)",
"task_id": "local-seed45-t00007-task_parents-f19",
"task_type": "task_parents"
} | [
"f3",
"f4"
] | List the immediate input nodes to f19. (Order does not matter.) | [
"def f498(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 9) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[1], values[1])\n values[3] = f3(val... | [
"def f498(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 9) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[1], values[1])\n values[3] = f3(val... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 457 |
45 | {
"answer": [
"f46",
"f54"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f66"
},
"question": "List the immediate input nodes to f66. (Order does not matter.)",
"task_id": "local-seed45-t00008-task_parents-f66",
"task_type": "task_parents"
} | [
"f46",
"f54"
] | List the immediate input nodes to f66. (Order does not matter.) | [
"def f498(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 9) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[1], values[1])\n values[3] = f3(val... | [
"def f498(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 9) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[1], values[1])\n values[3] = f3(val... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 458 |
45 | {
"answer": [
"C180",
"C257"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f395"
},
"question": "List the immediate input nodes to f395. (Order does not matter.)",
"task_id": "local-seed45-t00009-task_parents-f395",
"task_type": "task_parents"
} | [
"C180",
"C257"
] | List the immediate input nodes to f395. (Order does not matter.) | [
"def f498(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 9) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[1], values[1])\n values[3] = f3(val... | [
"def f498(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 9) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[1], values[1])\n values[3] = f3(val... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 459 |
46 | {
"answer": [
"C41",
"f7"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f65"
},
"question": "List the immediate input nodes to f65. (Order does not matter.)",
"task_id": "local-seed46-t00000-task_parents-f65",
"task_type": "task_parents"
} | [
"C41",
"f7"
] | List the immediate input nodes to f65. (Order does not matter.) | [
"def f499(a0, a1):\n a = a0 + 3 > a1\n b = a0 % 2 == 1\n return a and b or a1 < 3",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = C3\n values[4] = f4(values[3], values[2])\n values[5] = f5(values[1], values[2]... | [
"def f499(a0, a1):\n a = a0 + 3 > a1\n b = a0 % 2 == 1\n return a and b or a1 < 3",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = C3\n values[4] = f4(values[3], values[2])\n values[5] = f5(values[1], values[2]... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 460 |
46 | {
"answer": [
"f106",
"f99"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f312"
},
"question": "List the immediate input nodes to f312. (Order does not matter.)",
"task_id": "local-seed46-t00001-task_parents-f312",
"task_type": "task_parents"
} | [
"f106",
"f99"
] | List the immediate input nodes to f312. (Order does not matter.) | [
"def f499(a0, a1):\n a = a0 + 3 > a1\n b = a0 % 2 == 1\n return a and b or a1 < 3",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = C3\n values[4] = f4(values[3], values[2])\n values[5] = f5(values[1], values[2]... | [
"def f499(a0, a1):\n a = a0 + 3 > a1\n b = a0 % 2 == 1\n return a and b or a1 < 3",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = C3\n values[4] = f4(values[3], values[2])\n values[5] = f5(values[1], values[2]... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 461 |
46 | {
"answer": [
"C29",
"f2"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f37"
},
"question": "List the immediate input nodes to f37. (Order does not matter.)",
"task_id": "local-seed46-t00002-task_parents-f37",
"task_type": "task_parents"
} | [
"C29",
"f2"
] | List the immediate input nodes to f37. (Order does not matter.) | [
"def f499(a0, a1):\n a = a0 + 3 > a1\n b = a0 % 2 == 1\n return a and b or a1 < 3",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = C3\n values[4] = f4(values[3], values[2])\n values[5] = f5(values[1], values[2]... | [
"def f499(a0, a1):\n a = a0 + 3 > a1\n b = a0 % 2 == 1\n return a and b or a1 < 3",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = C3\n values[4] = f4(values[3], values[2])\n values[5] = f5(values[1], values[2]... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 462 |
46 | {
"answer": [
"f225",
"f270"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f468"
},
"question": "List the immediate input nodes to f468. (Order does not matter.)",
"task_id": "local-seed46-t00003-task_parents-f468",
"task_type": "task_parents"
} | [
"f225",
"f270"
] | List the immediate input nodes to f468. (Order does not matter.) | [
"def f499(a0, a1):\n a = a0 + 3 > a1\n b = a0 % 2 == 1\n return a and b or a1 < 3",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = C3\n values[4] = f4(values[3], values[2])\n values[5] = f5(values[1], values[2]... | [
"def f499(a0, a1):\n a = a0 + 3 > a1\n b = a0 % 2 == 1\n return a and b or a1 < 3",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = C3\n values[4] = f4(values[3], values[2])\n values[5] = f5(values[1], values[2]... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 463 |
46 | {
"answer": [
"C171",
"f126"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f467"
},
"question": "List the immediate input nodes to f467. (Order does not matter.)",
"task_id": "local-seed46-t00004-task_parents-f467",
"task_type": "task_parents"
} | [
"C171",
"f126"
] | List the immediate input nodes to f467. (Order does not matter.) | [
"def f499(a0, a1):\n a = a0 + 3 > a1\n b = a0 % 2 == 1\n return a and b or a1 < 3",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = C3\n values[4] = f4(values[3], values[2])\n values[5] = f5(values[1], values[2]... | [
"def f499(a0, a1):\n a = a0 + 3 > a1\n b = a0 % 2 == 1\n return a and b or a1 < 3",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = C3\n values[4] = f4(values[3], values[2])\n values[5] = f5(values[1], values[2]... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 464 |
46 | {
"answer": [
"C102",
"C176"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f183"
},
"question": "List the immediate input nodes to f183. (Order does not matter.)",
"task_id": "local-seed46-t00005-task_parents-f183",
"task_type": "task_parents"
} | [
"C102",
"C176"
] | List the immediate input nodes to f183. (Order does not matter.) | [
"def f499(a0, a1):\n a = a0 + 3 > a1\n b = a0 % 2 == 1\n return a and b or a1 < 3",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = C3\n values[4] = f4(values[3], values[2])\n values[5] = f5(values[1], values[2]... | [
"def f499(a0, a1):\n a = a0 + 3 > a1\n b = a0 % 2 == 1\n return a and b or a1 < 3",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = C3\n values[4] = f4(values[3], values[2])\n values[5] = f5(values[1], values[2]... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 465 |
46 | {
"answer": [
"K238",
"f69"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f410"
},
"question": "List the immediate input nodes to f410. (Order does not matter.)",
"task_id": "local-seed46-t00006-task_parents-f410",
"task_type": "task_parents"
} | [
"K238",
"f69"
] | List the immediate input nodes to f410. (Order does not matter.) | [
"def f499(a0, a1):\n a = a0 + 3 > a1\n b = a0 % 2 == 1\n return a and b or a1 < 3",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = C3\n values[4] = f4(values[3], values[2])\n values[5] = f5(values[1], values[2]... | [
"def f499(a0, a1):\n a = a0 + 3 > a1\n b = a0 % 2 == 1\n return a and b or a1 < 3",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = C3\n values[4] = f4(values[3], values[2])\n values[5] = f5(values[1], values[2]... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 466 |
46 | {
"answer": [
"f12",
"f12"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f124"
},
"question": "List the immediate input nodes to f124. (Order does not matter.)",
"task_id": "local-seed46-t00007-task_parents-f124",
"task_type": "task_parents"
} | [
"f12",
"f12"
] | List the immediate input nodes to f124. (Order does not matter.) | [
"def f499(a0, a1):\n a = a0 + 3 > a1\n b = a0 % 2 == 1\n return a and b or a1 < 3",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = C3\n values[4] = f4(values[3], values[2])\n values[5] = f5(values[1], values[2]... | [
"def f499(a0, a1):\n a = a0 + 3 > a1\n b = a0 % 2 == 1\n return a and b or a1 < 3",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = C3\n values[4] = f4(values[3], values[2])\n values[5] = f5(values[1], values[2]... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 467 |
46 | {
"answer": [
"f140",
"f325"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f463"
},
"question": "List the immediate input nodes to f463. (Order does not matter.)",
"task_id": "local-seed46-t00008-task_parents-f463",
"task_type": "task_parents"
} | [
"f140",
"f325"
] | List the immediate input nodes to f463. (Order does not matter.) | [
"def f499(a0, a1):\n a = a0 + 3 > a1\n b = a0 % 2 == 1\n return a and b or a1 < 3",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = C3\n values[4] = f4(values[3], values[2])\n values[5] = f5(values[1], values[2]... | [
"def f499(a0, a1):\n a = a0 + 3 > a1\n b = a0 % 2 == 1\n return a and b or a1 < 3",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = C3\n values[4] = f4(values[3], values[2])\n values[5] = f5(values[1], values[2]... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 468 |
46 | {
"answer": [
"f164",
"f419"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f426"
},
"question": "List the immediate input nodes to f426. (Order does not matter.)",
"task_id": "local-seed46-t00009-task_parents-f426",
"task_type": "task_parents"
} | [
"f164",
"f419"
] | List the immediate input nodes to f426. (Order does not matter.) | [
"def f499(a0, a1):\n a = a0 + 3 > a1\n b = a0 % 2 == 1\n return a and b or a1 < 3",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = C3\n values[4] = f4(values[3], values[2])\n values[5] = f5(values[1], values[2]... | [
"def f499(a0, a1):\n a = a0 + 3 > a1\n b = a0 % 2 == 1\n return a and b or a1 < 3",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = C3\n values[4] = f4(values[3], values[2])\n values[5] = f5(values[1], values[2]... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 469 |
47 | {
"answer": [
"f106",
"f113"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f266"
},
"question": "List the immediate input nodes to f266. (Order does not matter.)",
"task_id": "local-seed47-t00000-task_parents-f266",
"task_type": "task_parents"
} | [
"f106",
"f113"
] | List the immediate input nodes to f266. (Order does not matter.) | [
"def f499(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-14:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n... | [
"def f499(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-14:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 470 |
47 | {
"answer": [
"C13",
"f41"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f59"
},
"question": "List the immediate input nodes to f59. (Order does not matter.)",
"task_id": "local-seed47-t00001-task_parents-f59",
"task_type": "task_parents"
} | [
"C13",
"f41"
] | List the immediate input nodes to f59. (Order does not matter.) | [
"def f499(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-14:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n... | [
"def f499(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-14:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 471 |
47 | {
"answer": [
"f154",
"f253"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f322"
},
"question": "List the immediate input nodes to f322. (Order does not matter.)",
"task_id": "local-seed47-t00002-task_parents-f322",
"task_type": "task_parents"
} | [
"f154",
"f253"
] | List the immediate input nodes to f322. (Order does not matter.) | [
"def f499(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-14:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n... | [
"def f499(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-14:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 472 |
47 | {
"answer": [
"C104",
"f252"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f414"
},
"question": "List the immediate input nodes to f414. (Order does not matter.)",
"task_id": "local-seed47-t00003-task_parents-f414",
"task_type": "task_parents"
} | [
"C104",
"f252"
] | List the immediate input nodes to f414. (Order does not matter.) | [
"def f499(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-14:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n... | [
"def f499(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-14:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 473 |
47 | {
"answer": [
"f180",
"f198"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f339"
},
"question": "List the immediate input nodes to f339. (Order does not matter.)",
"task_id": "local-seed47-t00004-task_parents-f339",
"task_type": "task_parents"
} | [
"f180",
"f198"
] | List the immediate input nodes to f339. (Order does not matter.) | [
"def f499(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-14:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n... | [
"def f499(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-14:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 474 |
47 | {
"answer": [
"C404",
"f242"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f424"
},
"question": "List the immediate input nodes to f424. (Order does not matter.)",
"task_id": "local-seed47-t00005-task_parents-f424",
"task_type": "task_parents"
} | [
"C404",
"f242"
] | List the immediate input nodes to f424. (Order does not matter.) | [
"def f499(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-14:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n... | [
"def f499(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-14:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 475 |
47 | {
"answer": [
"f181",
"f39"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f260"
},
"question": "List the immediate input nodes to f260. (Order does not matter.)",
"task_id": "local-seed47-t00006-task_parents-f260",
"task_type": "task_parents"
} | [
"f181",
"f39"
] | List the immediate input nodes to f260. (Order does not matter.) | [
"def f499(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-14:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n... | [
"def f499(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-14:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 476 |
47 | {
"answer": [
"f159",
"f85"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f191"
},
"question": "List the immediate input nodes to f191. (Order does not matter.)",
"task_id": "local-seed47-t00007-task_parents-f191",
"task_type": "task_parents"
} | [
"f159",
"f85"
] | List the immediate input nodes to f191. (Order does not matter.) | [
"def f499(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-14:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n... | [
"def f499(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-14:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 477 |
47 | {
"answer": [
"f220",
"f363"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f381"
},
"question": "List the immediate input nodes to f381. (Order does not matter.)",
"task_id": "local-seed47-t00008-task_parents-f381",
"task_type": "task_parents"
} | [
"f220",
"f363"
] | List the immediate input nodes to f381. (Order does not matter.) | [
"def f499(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-14:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n... | [
"def f499(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-14:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 478 |
47 | {
"answer": [
"f122",
"f154"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f293"
},
"question": "List the immediate input nodes to f293. (Order does not matter.)",
"task_id": "local-seed47-t00009-task_parents-f293",
"task_type": "task_parents"
} | [
"f122",
"f154"
] | List the immediate input nodes to f293. (Order does not matter.) | [
"def f499(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-14:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n... | [
"def f499(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-14:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 479 |
48 | {
"answer": [
"f241",
"f27"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f439"
},
"question": "List the immediate input nodes to f439. (Order does not matter.)",
"task_id": "local-seed48-t00000-task_parents-f439",
"task_type": "task_parents"
} | [
"f241",
"f27"
] | List the immediate input nodes to f439. (Order does not matter.) | [
"def f498(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 5\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = C3\n values[4] = f4(values[2], values[1])\n... | [
"def f498(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 5\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = C3\n values[4] = f4(values[2], values[1])\n... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 480 |
48 | {
"answer": [
"f134",
"f149"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f262"
},
"question": "List the immediate input nodes to f262. (Order does not matter.)",
"task_id": "local-seed48-t00001-task_parents-f262",
"task_type": "task_parents"
} | [
"f134",
"f149"
] | List the immediate input nodes to f262. (Order does not matter.) | [
"def f498(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 5\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = C3\n values[4] = f4(values[2], values[1])\n... | [
"def f498(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 5\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = C3\n values[4] = f4(values[2], values[1])\n... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 481 |
48 | {
"answer": [
"f96",
"f97"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f128"
},
"question": "List the immediate input nodes to f128. (Order does not matter.)",
"task_id": "local-seed48-t00002-task_parents-f128",
"task_type": "task_parents"
} | [
"f96",
"f97"
] | List the immediate input nodes to f128. (Order does not matter.) | [
"def f498(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 5\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = C3\n values[4] = f4(values[2], values[1])\n... | [
"def f498(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 5\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = C3\n values[4] = f4(values[2], values[1])\n... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 482 |
48 | {
"answer": [
"f200",
"f282"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f448"
},
"question": "List the immediate input nodes to f448. (Order does not matter.)",
"task_id": "local-seed48-t00003-task_parents-f448",
"task_type": "task_parents"
} | [
"f200",
"f282"
] | List the immediate input nodes to f448. (Order does not matter.) | [
"def f498(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 5\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = C3\n values[4] = f4(values[2], values[1])\n... | [
"def f498(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 5\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = C3\n values[4] = f4(values[2], values[1])\n... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 483 |
48 | {
"answer": [
"C337",
"f163"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f427"
},
"question": "List the immediate input nodes to f427. (Order does not matter.)",
"task_id": "local-seed48-t00004-task_parents-f427",
"task_type": "task_parents"
} | [
"C337",
"f163"
] | List the immediate input nodes to f427. (Order does not matter.) | [
"def f498(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 5\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = C3\n values[4] = f4(values[2], values[1])\n... | [
"def f498(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 5\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = C3\n values[4] = f4(values[2], values[1])\n... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 484 |
48 | {
"answer": [
"f156",
"f192"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f253"
},
"question": "List the immediate input nodes to f253. (Order does not matter.)",
"task_id": "local-seed48-t00005-task_parents-f253",
"task_type": "task_parents"
} | [
"f156",
"f192"
] | List the immediate input nodes to f253. (Order does not matter.) | [
"def f498(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 5\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = C3\n values[4] = f4(values[2], values[1])\n... | [
"def f498(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 5\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = C3\n values[4] = f4(values[2], values[1])\n... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 485 |
48 | {
"answer": [
"f192",
"f386"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f408"
},
"question": "List the immediate input nodes to f408. (Order does not matter.)",
"task_id": "local-seed48-t00006-task_parents-f408",
"task_type": "task_parents"
} | [
"f192",
"f386"
] | List the immediate input nodes to f408. (Order does not matter.) | [
"def f498(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 5\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = C3\n values[4] = f4(values[2], values[1])\n... | [
"def f498(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 5\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = C3\n values[4] = f4(values[2], values[1])\n... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 486 |
48 | {
"answer": [
"f147",
"f91"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f169"
},
"question": "List the immediate input nodes to f169. (Order does not matter.)",
"task_id": "local-seed48-t00007-task_parents-f169",
"task_type": "task_parents"
} | [
"f147",
"f91"
] | List the immediate input nodes to f169. (Order does not matter.) | [
"def f498(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 5\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = C3\n values[4] = f4(values[2], values[1])\n... | [
"def f498(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 5\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = C3\n values[4] = f4(values[2], values[1])\n... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 487 |
48 | {
"answer": [
"K274",
"f290"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f353"
},
"question": "List the immediate input nodes to f353. (Order does not matter.)",
"task_id": "local-seed48-t00008-task_parents-f353",
"task_type": "task_parents"
} | [
"K274",
"f290"
] | List the immediate input nodes to f353. (Order does not matter.) | [
"def f498(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 5\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = C3\n values[4] = f4(values[2], values[1])\n... | [
"def f498(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 5\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = C3\n values[4] = f4(values[2], values[1])\n... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 488 |
48 | {
"answer": [
"C78",
"f100"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f152"
},
"question": "List the immediate input nodes to f152. (Order does not matter.)",
"task_id": "local-seed48-t00009-task_parents-f152",
"task_type": "task_parents"
} | [
"C78",
"f100"
] | List the immediate input nodes to f152. (Order does not matter.) | [
"def f498(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 5\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = C3\n values[4] = f4(values[2], values[1])\n... | [
"def f498(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 5\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = C3\n values[4] = f4(values[2], values[1])\n... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 489 |
49 | {
"answer": [
"f16",
"f25"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f66"
},
"question": "List the immediate input nodes to f66. (Order does not matter.)",
"task_id": "local-seed49-t00000-task_parents-f66",
"task_type": "task_parents"
} | [
"f16",
"f25"
] | List the immediate input nodes to f66. (Order does not matter.) | [
"def f499(a0, a1):\n t = (a0 * 31 + a1 * 17 + -2) % 186 + 0\n if t % 2 == 0:\n return t // 2\n else:\n return t + 11",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] ... | [
"def f499(a0, a1):\n t = (a0 * 31 + a1 * 17 + -2) % 186 + 0\n if t % 2 == 0:\n return t // 2\n else:\n return t + 11",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 490 |
49 | {
"answer": [
"f149",
"f69"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f287"
},
"question": "List the immediate input nodes to f287. (Order does not matter.)",
"task_id": "local-seed49-t00001-task_parents-f287",
"task_type": "task_parents"
} | [
"f149",
"f69"
] | List the immediate input nodes to f287. (Order does not matter.) | [
"def f499(a0, a1):\n t = (a0 * 31 + a1 * 17 + -2) % 186 + 0\n if t % 2 == 0:\n return t // 2\n else:\n return t + 11",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] ... | [
"def f499(a0, a1):\n t = (a0 * 31 + a1 * 17 + -2) % 186 + 0\n if t % 2 == 0:\n return t // 2\n else:\n return t + 11",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 491 |
49 | {
"answer": [
"f304",
"f313"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f342"
},
"question": "List the immediate input nodes to f342. (Order does not matter.)",
"task_id": "local-seed49-t00002-task_parents-f342",
"task_type": "task_parents"
} | [
"f304",
"f313"
] | List the immediate input nodes to f342. (Order does not matter.) | [
"def f499(a0, a1):\n t = (a0 * 31 + a1 * 17 + -2) % 186 + 0\n if t % 2 == 0:\n return t // 2\n else:\n return t + 11",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] ... | [
"def f499(a0, a1):\n t = (a0 * 31 + a1 * 17 + -2) % 186 + 0\n if t % 2 == 0:\n return t // 2\n else:\n return t + 11",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 492 |
49 | {
"answer": [
"f35",
"f95"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f96"
},
"question": "List the immediate input nodes to f96. (Order does not matter.)",
"task_id": "local-seed49-t00003-task_parents-f96",
"task_type": "task_parents"
} | [
"f35",
"f95"
] | List the immediate input nodes to f96. (Order does not matter.) | [
"def f499(a0, a1):\n t = (a0 * 31 + a1 * 17 + -2) % 186 + 0\n if t % 2 == 0:\n return t // 2\n else:\n return t + 11",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] ... | [
"def f499(a0, a1):\n t = (a0 * 31 + a1 * 17 + -2) % 186 + 0\n if t % 2 == 0:\n return t // 2\n else:\n return t + 11",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 493 |
49 | {
"answer": [
"C119",
"f199"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f270"
},
"question": "List the immediate input nodes to f270. (Order does not matter.)",
"task_id": "local-seed49-t00004-task_parents-f270",
"task_type": "task_parents"
} | [
"C119",
"f199"
] | List the immediate input nodes to f270. (Order does not matter.) | [
"def f499(a0, a1):\n t = (a0 * 31 + a1 * 17 + -2) % 186 + 0\n if t % 2 == 0:\n return t // 2\n else:\n return t + 11",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] ... | [
"def f499(a0, a1):\n t = (a0 * 31 + a1 * 17 + -2) % 186 + 0\n if t % 2 == 0:\n return t // 2\n else:\n return t + 11",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 494 |
49 | {
"answer": [
"f331",
"f58"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f452"
},
"question": "List the immediate input nodes to f452. (Order does not matter.)",
"task_id": "local-seed49-t00005-task_parents-f452",
"task_type": "task_parents"
} | [
"f331",
"f58"
] | List the immediate input nodes to f452. (Order does not matter.) | [
"def f499(a0, a1):\n t = (a0 * 31 + a1 * 17 + -2) % 186 + 0\n if t % 2 == 0:\n return t // 2\n else:\n return t + 11",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] ... | [
"def f499(a0, a1):\n t = (a0 * 31 + a1 * 17 + -2) % 186 + 0\n if t % 2 == 0:\n return t // 2\n else:\n return t + 11",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 495 |
49 | {
"answer": [
"C132",
"C334"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f424"
},
"question": "List the immediate input nodes to f424. (Order does not matter.)",
"task_id": "local-seed49-t00006-task_parents-f424",
"task_type": "task_parents"
} | [
"C132",
"C334"
] | List the immediate input nodes to f424. (Order does not matter.) | [
"def f499(a0, a1):\n t = (a0 * 31 + a1 * 17 + -2) % 186 + 0\n if t % 2 == 0:\n return t // 2\n else:\n return t + 11",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] ... | [
"def f499(a0, a1):\n t = (a0 * 31 + a1 * 17 + -2) % 186 + 0\n if t % 2 == 0:\n return t // 2\n else:\n return t + 11",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 496 |
49 | {
"answer": [
"C2",
"f29"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f51"
},
"question": "List the immediate input nodes to f51. (Order does not matter.)",
"task_id": "local-seed49-t00007-task_parents-f51",
"task_type": "task_parents"
} | [
"C2",
"f29"
] | List the immediate input nodes to f51. (Order does not matter.) | [
"def f499(a0, a1):\n t = (a0 * 31 + a1 * 17 + -2) % 186 + 0\n if t % 2 == 0:\n return t // 2\n else:\n return t + 11",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] ... | [
"def f499(a0, a1):\n t = (a0 * 31 + a1 * 17 + -2) % 186 + 0\n if t % 2 == 0:\n return t // 2\n else:\n return t + 11",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 497 |
49 | {
"answer": [
"C1",
"f17"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f44"
},
"question": "List the immediate input nodes to f44. (Order does not matter.)",
"task_id": "local-seed49-t00008-task_parents-f44",
"task_type": "task_parents"
} | [
"C1",
"f17"
] | List the immediate input nodes to f44. (Order does not matter.) | [
"def f499(a0, a1):\n t = (a0 * 31 + a1 * 17 + -2) % 186 + 0\n if t % 2 == 0:\n return t // 2\n else:\n return t + 11",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] ... | [
"def f499(a0, a1):\n t = (a0 * 31 + a1 * 17 + -2) % 186 + 0\n if t % 2 == 0:\n return t // 2\n else:\n return t + 11",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 498 |
49 | {
"answer": [
"f213",
"f221"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f242"
},
"question": "List the immediate input nodes to f242. (Order does not matter.)",
"task_id": "local-seed49-t00009-task_parents-f242",
"task_type": "task_parents"
} | [
"f213",
"f221"
] | List the immediate input nodes to f242. (Order does not matter.) | [
"def f499(a0, a1):\n t = (a0 * 31 + a1 * 17 + -2) % 186 + 0\n if t % 2 == 0:\n return t // 2\n else:\n return t + 11",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] ... | [
"def f499(a0, a1):\n t = (a0 * 31 + a1 * 17 + -2) % 186 + 0\n if t % 2 == 0:\n return t // 2\n else:\n return t + 11",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 500 | 0.1 | 0.25 | 5 | 499 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.