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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
30 | {
"answer": [
"f10",
"f154"
],
"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-seed30-t00000-task_parents-f236",
"task_type": "task_parents"
} | [
"f10",
"f154"
] | List the immediate input nodes to f236. (Order does not matter.) | [
"def f399(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-9:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = f3(values[2], values[2])\n values[4] = C4\n values[5] = f5(values[2], values[2])\n values[6] = C... | [
"def f399(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-9:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = f3(values[2], values[2])\n values[4] = C4\n values[5] = f5(values[2], values[2])\n values[6] = C... | 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. | 400 | 0.1 | 0.25 | 5 | 300 |
30 | {
"answer": [
"C30",
"f15"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f34"
},
"question": "List the immediate input nodes to f34. (Order does not matter.)",
"task_id": "local-seed30-t00001-task_parents-f34",
"task_type": "task_parents"
} | [
"C30",
"f15"
] | List the immediate input nodes to f34. (Order does not matter.) | [
"def f399(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-9:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = f3(values[2], values[2])\n values[4] = C4\n values[5] = f5(values[2], values[2])\n values[6] = C... | [
"def f399(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-9:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = f3(values[2], values[2])\n values[4] = C4\n values[5] = f5(values[2], values[2])\n values[6] = C... | 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. | 400 | 0.1 | 0.25 | 5 | 301 |
30 | {
"answer": [
"C6",
"f66"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f175"
},
"question": "List the immediate input nodes to f175. (Order does not matter.)",
"task_id": "local-seed30-t00002-task_parents-f175",
"task_type": "task_parents"
} | [
"C6",
"f66"
] | List the immediate input nodes to f175. (Order does not matter.) | [
"def f399(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-9:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = f3(values[2], values[2])\n values[4] = C4\n values[5] = f5(values[2], values[2])\n values[6] = C... | [
"def f399(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-9:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = f3(values[2], values[2])\n values[4] = C4\n values[5] = f5(values[2], values[2])\n values[6] = C... | 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. | 400 | 0.1 | 0.25 | 5 | 302 |
30 | {
"answer": [
"f122",
"f5"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f212"
},
"question": "List the immediate input nodes to f212. (Order does not matter.)",
"task_id": "local-seed30-t00003-task_parents-f212",
"task_type": "task_parents"
} | [
"f122",
"f5"
] | List the immediate input nodes to f212. (Order does not matter.) | [
"def f399(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-9:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = f3(values[2], values[2])\n values[4] = C4\n values[5] = f5(values[2], values[2])\n values[6] = C... | [
"def f399(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-9:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = f3(values[2], values[2])\n values[4] = C4\n values[5] = f5(values[2], values[2])\n values[6] = C... | 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. | 400 | 0.1 | 0.25 | 5 | 303 |
30 | {
"answer": [
"f44",
"f7"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f46"
},
"question": "List the immediate input nodes to f46. (Order does not matter.)",
"task_id": "local-seed30-t00004-task_parents-f46",
"task_type": "task_parents"
} | [
"f44",
"f7"
] | List the immediate input nodes to f46. (Order does not matter.) | [
"def f399(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-9:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = f3(values[2], values[2])\n values[4] = C4\n values[5] = f5(values[2], values[2])\n values[6] = C... | [
"def f399(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-9:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = f3(values[2], values[2])\n values[4] = C4\n values[5] = f5(values[2], values[2])\n values[6] = C... | 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. | 400 | 0.1 | 0.25 | 5 | 304 |
30 | {
"answer": [
"f216",
"f246"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f317"
},
"question": "List the immediate input nodes to f317. (Order does not matter.)",
"task_id": "local-seed30-t00005-task_parents-f317",
"task_type": "task_parents"
} | [
"f216",
"f246"
] | List the immediate input nodes to f317. (Order does not matter.) | [
"def f399(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-9:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = f3(values[2], values[2])\n values[4] = C4\n values[5] = f5(values[2], values[2])\n values[6] = C... | [
"def f399(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-9:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = f3(values[2], values[2])\n values[4] = C4\n values[5] = f5(values[2], values[2])\n values[6] = C... | 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. | 400 | 0.1 | 0.25 | 5 | 305 |
30 | {
"answer": [
"f146",
"f76"
],
"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-seed30-t00006-task_parents-f302",
"task_type": "task_parents"
} | [
"f146",
"f76"
] | List the immediate input nodes to f302. (Order does not matter.) | [
"def f399(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-9:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = f3(values[2], values[2])\n values[4] = C4\n values[5] = f5(values[2], values[2])\n values[6] = C... | [
"def f399(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-9:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = f3(values[2], values[2])\n values[4] = C4\n values[5] = f5(values[2], values[2])\n values[6] = C... | 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. | 400 | 0.1 | 0.25 | 5 | 306 |
30 | {
"answer": [
"f107",
"f22"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f118"
},
"question": "List the immediate input nodes to f118. (Order does not matter.)",
"task_id": "local-seed30-t00007-task_parents-f118",
"task_type": "task_parents"
} | [
"f107",
"f22"
] | List the immediate input nodes to f118. (Order does not matter.) | [
"def f399(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-9:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = f3(values[2], values[2])\n values[4] = C4\n values[5] = f5(values[2], values[2])\n values[6] = C... | [
"def f399(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-9:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = f3(values[2], values[2])\n values[4] = C4\n values[5] = f5(values[2], values[2])\n values[6] = C... | 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. | 400 | 0.1 | 0.25 | 5 | 307 |
30 | {
"answer": [
"C30",
"f14"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f77"
},
"question": "List the immediate input nodes to f77. (Order does not matter.)",
"task_id": "local-seed30-t00008-task_parents-f77",
"task_type": "task_parents"
} | [
"C30",
"f14"
] | List the immediate input nodes to f77. (Order does not matter.) | [
"def f399(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-9:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = f3(values[2], values[2])\n values[4] = C4\n values[5] = f5(values[2], values[2])\n values[6] = C... | [
"def f399(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-9:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = f3(values[2], values[2])\n values[4] = C4\n values[5] = f5(values[2], values[2])\n values[6] = C... | 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. | 400 | 0.1 | 0.25 | 5 | 308 |
30 | {
"answer": [
"f202",
"f360"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f369"
},
"question": "List the immediate input nodes to f369. (Order does not matter.)",
"task_id": "local-seed30-t00009-task_parents-f369",
"task_type": "task_parents"
} | [
"f202",
"f360"
] | List the immediate input nodes to f369. (Order does not matter.) | [
"def f399(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-9:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = f3(values[2], values[2])\n values[4] = C4\n values[5] = f5(values[2], values[2])\n values[6] = C... | [
"def f399(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-9:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = f3(values[2], values[2])\n values[4] = C4\n values[5] = f5(values[2], values[2])\n values[6] = C... | 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. | 400 | 0.1 | 0.25 | 5 | 309 |
31 | {
"answer": [
"K4",
"f6"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f21"
},
"question": "List the immediate input nodes to f21. (Order does not matter.)",
"task_id": "local-seed31-t00000-task_parents-f21",
"task_type": "task_parents"
} | [
"K4",
"f6"
] | List the immediate input nodes to f21. (Order does not matter.) | [
"def f395(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 5) + 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] = f1(values[0], values[0])\n values[2] = K2(values[0], values[0])\n... | [
"def f395(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 5) + 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] = f1(values[0], values[0])\n values[2] = K2(values[0], values[0])\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. | 400 | 0.1 | 0.25 | 5 | 310 |
31 | {
"answer": [
"f16",
"f187"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f357"
},
"question": "List the immediate input nodes to f357. (Order does not matter.)",
"task_id": "local-seed31-t00001-task_parents-f357",
"task_type": "task_parents"
} | [
"f16",
"f187"
] | List the immediate input nodes to f357. (Order does not matter.) | [
"def f395(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 5) + 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] = f1(values[0], values[0])\n values[2] = K2(values[0], values[0])\n... | [
"def f395(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 5) + 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] = f1(values[0], values[0])\n values[2] = K2(values[0], values[0])\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. | 400 | 0.1 | 0.25 | 5 | 311 |
31 | {
"answer": [
"C26",
"f11"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f90"
},
"question": "List the immediate input nodes to f90. (Order does not matter.)",
"task_id": "local-seed31-t00002-task_parents-f90",
"task_type": "task_parents"
} | [
"C26",
"f11"
] | List the immediate input nodes to f90. (Order does not matter.) | [
"def f395(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 5) + 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] = f1(values[0], values[0])\n values[2] = K2(values[0], values[0])\n... | [
"def f395(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 5) + 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] = f1(values[0], values[0])\n values[2] = K2(values[0], values[0])\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. | 400 | 0.1 | 0.25 | 5 | 312 |
31 | {
"answer": [
"f184",
"f90"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f300"
},
"question": "List the immediate input nodes to f300. (Order does not matter.)",
"task_id": "local-seed31-t00003-task_parents-f300",
"task_type": "task_parents"
} | [
"f184",
"f90"
] | List the immediate input nodes to f300. (Order does not matter.) | [
"def f395(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 5) + 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] = f1(values[0], values[0])\n values[2] = K2(values[0], values[0])\n... | [
"def f395(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 5) + 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] = f1(values[0], values[0])\n values[2] = K2(values[0], values[0])\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. | 400 | 0.1 | 0.25 | 5 | 313 |
31 | {
"answer": [
"f23",
"f72"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f113"
},
"question": "List the immediate input nodes to f113. (Order does not matter.)",
"task_id": "local-seed31-t00004-task_parents-f113",
"task_type": "task_parents"
} | [
"f23",
"f72"
] | List the immediate input nodes to f113. (Order does not matter.) | [
"def f395(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 5) + 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] = f1(values[0], values[0])\n values[2] = K2(values[0], values[0])\n... | [
"def f395(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 5) + 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] = f1(values[0], values[0])\n values[2] = K2(values[0], values[0])\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. | 400 | 0.1 | 0.25 | 5 | 314 |
31 | {
"answer": [
"f6",
"f9"
],
"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-seed31-t00005-task_parents-f44",
"task_type": "task_parents"
} | [
"f6",
"f9"
] | List the immediate input nodes to f44. (Order does not matter.) | [
"def f395(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 5) + 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] = f1(values[0], values[0])\n values[2] = K2(values[0], values[0])\n... | [
"def f395(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 5) + 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] = f1(values[0], values[0])\n values[2] = K2(values[0], values[0])\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. | 400 | 0.1 | 0.25 | 5 | 315 |
31 | {
"answer": [
"f16",
"f38"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f112"
},
"question": "List the immediate input nodes to f112. (Order does not matter.)",
"task_id": "local-seed31-t00006-task_parents-f112",
"task_type": "task_parents"
} | [
"f16",
"f38"
] | List the immediate input nodes to f112. (Order does not matter.) | [
"def f395(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 5) + 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] = f1(values[0], values[0])\n values[2] = K2(values[0], values[0])\n... | [
"def f395(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 5) + 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] = f1(values[0], values[0])\n values[2] = K2(values[0], values[0])\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. | 400 | 0.1 | 0.25 | 5 | 316 |
31 | {
"answer": [
"C26",
"f11"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f90"
},
"question": "List the immediate input nodes to f90. (Order does not matter.)",
"task_id": "local-seed31-t00007-task_parents-f90",
"task_type": "task_parents"
} | [
"C26",
"f11"
] | List the immediate input nodes to f90. (Order does not matter.) | [
"def f395(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 5) + 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] = f1(values[0], values[0])\n values[2] = K2(values[0], values[0])\n... | [
"def f395(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 5) + 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] = f1(values[0], values[0])\n values[2] = K2(values[0], values[0])\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. | 400 | 0.1 | 0.25 | 5 | 317 |
31 | {
"answer": [
"f155",
"f64"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f171"
},
"question": "List the immediate input nodes to f171. (Order does not matter.)",
"task_id": "local-seed31-t00008-task_parents-f171",
"task_type": "task_parents"
} | [
"f155",
"f64"
] | List the immediate input nodes to f171. (Order does not matter.) | [
"def f395(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 5) + 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] = f1(values[0], values[0])\n values[2] = K2(values[0], values[0])\n... | [
"def f395(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 5) + 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] = f1(values[0], values[0])\n values[2] = K2(values[0], values[0])\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. | 400 | 0.1 | 0.25 | 5 | 318 |
31 | {
"answer": [
"f16",
"f38"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f112"
},
"question": "List the immediate input nodes to f112. (Order does not matter.)",
"task_id": "local-seed31-t00009-task_parents-f112",
"task_type": "task_parents"
} | [
"f16",
"f38"
] | List the immediate input nodes to f112. (Order does not matter.) | [
"def f395(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 5) + 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] = f1(values[0], values[0])\n values[2] = K2(values[0], values[0])\n... | [
"def f395(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 5) + 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] = f1(values[0], values[0])\n values[2] = K2(values[0], values[0])\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. | 400 | 0.1 | 0.25 | 5 | 319 |
32 | {
"answer": [
"f15",
"f29"
],
"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-seed32-t00000-task_parents-f37",
"task_type": "task_parents"
} | [
"f15",
"f29"
] | List the immediate input nodes to f37. (Order does not matter.) | [
"def f398(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 1\n return total",
"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 ... | [
"def f398(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 1\n return total",
"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 ... | 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. | 400 | 0.1 | 0.25 | 5 | 320 |
32 | {
"answer": [
"f144",
"f329"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f383"
},
"question": "List the immediate input nodes to f383. (Order does not matter.)",
"task_id": "local-seed32-t00001-task_parents-f383",
"task_type": "task_parents"
} | [
"f144",
"f329"
] | List the immediate input nodes to f383. (Order does not matter.) | [
"def f398(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 1\n return total",
"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 ... | [
"def f398(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 1\n return total",
"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 ... | 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. | 400 | 0.1 | 0.25 | 5 | 321 |
32 | {
"answer": [
"f29",
"f39"
],
"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-seed32-t00002-task_parents-f88",
"task_type": "task_parents"
} | [
"f29",
"f39"
] | List the immediate input nodes to f88. (Order does not matter.) | [
"def f398(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 1\n return total",
"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 ... | [
"def f398(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 1\n return total",
"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 ... | 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. | 400 | 0.1 | 0.25 | 5 | 322 |
32 | {
"answer": [
"C2",
"f43"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f58"
},
"question": "List the immediate input nodes to f58. (Order does not matter.)",
"task_id": "local-seed32-t00003-task_parents-f58",
"task_type": "task_parents"
} | [
"C2",
"f43"
] | List the immediate input nodes to f58. (Order does not matter.) | [
"def f398(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 1\n return total",
"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 ... | [
"def f398(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 1\n return total",
"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 ... | 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. | 400 | 0.1 | 0.25 | 5 | 323 |
32 | {
"answer": [
"f15",
"f82"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f116"
},
"question": "List the immediate input nodes to f116. (Order does not matter.)",
"task_id": "local-seed32-t00004-task_parents-f116",
"task_type": "task_parents"
} | [
"f15",
"f82"
] | List the immediate input nodes to f116. (Order does not matter.) | [
"def f398(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 1\n return total",
"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 ... | [
"def f398(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 1\n return total",
"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 ... | 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. | 400 | 0.1 | 0.25 | 5 | 324 |
32 | {
"answer": [
"f133",
"f83"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f294"
},
"question": "List the immediate input nodes to f294. (Order does not matter.)",
"task_id": "local-seed32-t00005-task_parents-f294",
"task_type": "task_parents"
} | [
"f133",
"f83"
] | List the immediate input nodes to f294. (Order does not matter.) | [
"def f398(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 1\n return total",
"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 ... | [
"def f398(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 1\n return total",
"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 ... | 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. | 400 | 0.1 | 0.25 | 5 | 325 |
32 | {
"answer": [
"f11",
"f199"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f372"
},
"question": "List the immediate input nodes to f372. (Order does not matter.)",
"task_id": "local-seed32-t00006-task_parents-f372",
"task_type": "task_parents"
} | [
"f11",
"f199"
] | List the immediate input nodes to f372. (Order does not matter.) | [
"def f398(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 1\n return total",
"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 ... | [
"def f398(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 1\n return total",
"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 ... | 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. | 400 | 0.1 | 0.25 | 5 | 326 |
32 | {
"answer": [
"f58",
"f82"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f95"
},
"question": "List the immediate input nodes to f95. (Order does not matter.)",
"task_id": "local-seed32-t00007-task_parents-f95",
"task_type": "task_parents"
} | [
"f58",
"f82"
] | List the immediate input nodes to f95. (Order does not matter.) | [
"def f398(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 1\n return total",
"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 ... | [
"def f398(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 1\n return total",
"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 ... | 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. | 400 | 0.1 | 0.25 | 5 | 327 |
32 | {
"answer": [
"f200",
"f66"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f204"
},
"question": "List the immediate input nodes to f204. (Order does not matter.)",
"task_id": "local-seed32-t00008-task_parents-f204",
"task_type": "task_parents"
} | [
"f200",
"f66"
] | List the immediate input nodes to f204. (Order does not matter.) | [
"def f398(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 1\n return total",
"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 ... | [
"def f398(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 1\n return total",
"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 ... | 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. | 400 | 0.1 | 0.25 | 5 | 328 |
32 | {
"answer": [
"C9",
"f10"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f18"
},
"question": "List the immediate input nodes to f18. (Order does not matter.)",
"task_id": "local-seed32-t00009-task_parents-f18",
"task_type": "task_parents"
} | [
"C9",
"f10"
] | List the immediate input nodes to f18. (Order does not matter.) | [
"def f398(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 1\n return total",
"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 ... | [
"def f398(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 1\n return total",
"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 ... | 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. | 400 | 0.1 | 0.25 | 5 | 329 |
33 | {
"answer": [
"K10",
"f164"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f227"
},
"question": "List the immediate input nodes to f227. (Order does not matter.)",
"task_id": "local-seed33-t00000-task_parents-f227",
"task_type": "task_parents"
} | [
"K10",
"f164"
] | List the immediate input nodes to f227. (Order does not matter.) | [
"def f399(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] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n ... | [
"def f399(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] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\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. | 400 | 0.1 | 0.25 | 5 | 330 |
33 | {
"answer": [
"C56",
"f45"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f74"
},
"question": "List the immediate input nodes to f74. (Order does not matter.)",
"task_id": "local-seed33-t00001-task_parents-f74",
"task_type": "task_parents"
} | [
"C56",
"f45"
] | List the immediate input nodes to f74. (Order does not matter.) | [
"def f399(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] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n ... | [
"def f399(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] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\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. | 400 | 0.1 | 0.25 | 5 | 331 |
33 | {
"answer": [
"C7",
"f212"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f249"
},
"question": "List the immediate input nodes to f249. (Order does not matter.)",
"task_id": "local-seed33-t00002-task_parents-f249",
"task_type": "task_parents"
} | [
"C7",
"f212"
] | List the immediate input nodes to f249. (Order does not matter.) | [
"def f399(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] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n ... | [
"def f399(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] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\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. | 400 | 0.1 | 0.25 | 5 | 332 |
33 | {
"answer": [
"K68",
"f97"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f98"
},
"question": "List the immediate input nodes to f98. (Order does not matter.)",
"task_id": "local-seed33-t00003-task_parents-f98",
"task_type": "task_parents"
} | [
"K68",
"f97"
] | List the immediate input nodes to f98. (Order does not matter.) | [
"def f399(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] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n ... | [
"def f399(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] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\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. | 400 | 0.1 | 0.25 | 5 | 333 |
33 | {
"answer": [
"f190",
"f296"
],
"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-seed33-t00004-task_parents-f339",
"task_type": "task_parents"
} | [
"f190",
"f296"
] | List the immediate input nodes to f339. (Order does not matter.) | [
"def f399(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] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n ... | [
"def f399(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] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\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. | 400 | 0.1 | 0.25 | 5 | 334 |
33 | {
"answer": [
"f344",
"f344"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f350"
},
"question": "List the immediate input nodes to f350. (Order does not matter.)",
"task_id": "local-seed33-t00005-task_parents-f350",
"task_type": "task_parents"
} | [
"f344",
"f344"
] | List the immediate input nodes to f350. (Order does not matter.) | [
"def f399(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] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n ... | [
"def f399(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] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\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. | 400 | 0.1 | 0.25 | 5 | 335 |
33 | {
"answer": [
"C51",
"f95"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f113"
},
"question": "List the immediate input nodes to f113. (Order does not matter.)",
"task_id": "local-seed33-t00006-task_parents-f113",
"task_type": "task_parents"
} | [
"C51",
"f95"
] | List the immediate input nodes to f113. (Order does not matter.) | [
"def f399(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] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n ... | [
"def f399(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] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\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. | 400 | 0.1 | 0.25 | 5 | 336 |
33 | {
"answer": [
"f117",
"f138"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f187"
},
"question": "List the immediate input nodes to f187. (Order does not matter.)",
"task_id": "local-seed33-t00007-task_parents-f187",
"task_type": "task_parents"
} | [
"f117",
"f138"
] | List the immediate input nodes to f187. (Order does not matter.) | [
"def f399(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] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n ... | [
"def f399(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] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\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. | 400 | 0.1 | 0.25 | 5 | 337 |
33 | {
"answer": [
"f178",
"f97"
],
"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-seed33-t00008-task_parents-f256",
"task_type": "task_parents"
} | [
"f178",
"f97"
] | List the immediate input nodes to f256. (Order does not matter.) | [
"def f399(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] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n ... | [
"def f399(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] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\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. | 400 | 0.1 | 0.25 | 5 | 338 |
33 | {
"answer": [
"f218",
"f244"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f362"
},
"question": "List the immediate input nodes to f362. (Order does not matter.)",
"task_id": "local-seed33-t00009-task_parents-f362",
"task_type": "task_parents"
} | [
"f218",
"f244"
] | List the immediate input nodes to f362. (Order does not matter.) | [
"def f399(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] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n ... | [
"def f399(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] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\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. | 400 | 0.1 | 0.25 | 5 | 339 |
34 | {
"answer": [
"f23",
"f91"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f229"
},
"question": "List the immediate input nodes to f229. (Order does not matter.)",
"task_id": "local-seed34-t00000-task_parents-f229",
"task_type": "task_parents"
} | [
"f23",
"f91"
] | List the immediate input nodes to f229. (Order does not matter.) | [
"def f399(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-11:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = f3(values[0], values[2])\n values[4] = f4(values[1], values[2])\n values[5] ... | [
"def f399(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-11:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = f3(values[0], values[2])\n values[4] = f4(values[1], values[2])\n values[5] ... | 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. | 400 | 0.1 | 0.25 | 5 | 340 |
34 | {
"answer": [
"C119",
"f96"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f161"
},
"question": "List the immediate input nodes to f161. (Order does not matter.)",
"task_id": "local-seed34-t00001-task_parents-f161",
"task_type": "task_parents"
} | [
"C119",
"f96"
] | List the immediate input nodes to f161. (Order does not matter.) | [
"def f399(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-11:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = f3(values[0], values[2])\n values[4] = f4(values[1], values[2])\n values[5] ... | [
"def f399(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-11:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = f3(values[0], values[2])\n values[4] = f4(values[1], values[2])\n values[5] ... | 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. | 400 | 0.1 | 0.25 | 5 | 341 |
34 | {
"answer": [
"f106",
"f23"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f248"
},
"question": "List the immediate input nodes to f248. (Order does not matter.)",
"task_id": "local-seed34-t00002-task_parents-f248",
"task_type": "task_parents"
} | [
"f106",
"f23"
] | List the immediate input nodes to f248. (Order does not matter.) | [
"def f399(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-11:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = f3(values[0], values[2])\n values[4] = f4(values[1], values[2])\n values[5] ... | [
"def f399(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-11:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = f3(values[0], values[2])\n values[4] = f4(values[1], values[2])\n values[5] ... | 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. | 400 | 0.1 | 0.25 | 5 | 342 |
34 | {
"answer": [
"f10",
"f2"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f17"
},
"question": "List the immediate input nodes to f17. (Order does not matter.)",
"task_id": "local-seed34-t00003-task_parents-f17",
"task_type": "task_parents"
} | [
"f10",
"f2"
] | List the immediate input nodes to f17. (Order does not matter.) | [
"def f399(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-11:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = f3(values[0], values[2])\n values[4] = f4(values[1], values[2])\n values[5] ... | [
"def f399(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-11:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = f3(values[0], values[2])\n values[4] = f4(values[1], values[2])\n values[5] ... | 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. | 400 | 0.1 | 0.25 | 5 | 343 |
34 | {
"answer": [
"f168",
"f168"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f343"
},
"question": "List the immediate input nodes to f343. (Order does not matter.)",
"task_id": "local-seed34-t00004-task_parents-f343",
"task_type": "task_parents"
} | [
"f168",
"f168"
] | List the immediate input nodes to f343. (Order does not matter.) | [
"def f399(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-11:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = f3(values[0], values[2])\n values[4] = f4(values[1], values[2])\n values[5] ... | [
"def f399(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-11:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = f3(values[0], values[2])\n values[4] = f4(values[1], values[2])\n values[5] ... | 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. | 400 | 0.1 | 0.25 | 5 | 344 |
34 | {
"answer": [
"f88",
"f90"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f105"
},
"question": "List the immediate input nodes to f105. (Order does not matter.)",
"task_id": "local-seed34-t00005-task_parents-f105",
"task_type": "task_parents"
} | [
"f88",
"f90"
] | List the immediate input nodes to f105. (Order does not matter.) | [
"def f399(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-11:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = f3(values[0], values[2])\n values[4] = f4(values[1], values[2])\n values[5] ... | [
"def f399(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-11:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = f3(values[0], values[2])\n values[4] = f4(values[1], values[2])\n values[5] ... | 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. | 400 | 0.1 | 0.25 | 5 | 345 |
34 | {
"answer": [
"C1",
"C350"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f371"
},
"question": "List the immediate input nodes to f371. (Order does not matter.)",
"task_id": "local-seed34-t00006-task_parents-f371",
"task_type": "task_parents"
} | [
"C1",
"C350"
] | List the immediate input nodes to f371. (Order does not matter.) | [
"def f399(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-11:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = f3(values[0], values[2])\n values[4] = f4(values[1], values[2])\n values[5] ... | [
"def f399(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-11:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = f3(values[0], values[2])\n values[4] = f4(values[1], values[2])\n values[5] ... | 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. | 400 | 0.1 | 0.25 | 5 | 346 |
34 | {
"answer": [
"f10",
"f2"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f17"
},
"question": "List the immediate input nodes to f17. (Order does not matter.)",
"task_id": "local-seed34-t00007-task_parents-f17",
"task_type": "task_parents"
} | [
"f10",
"f2"
] | List the immediate input nodes to f17. (Order does not matter.) | [
"def f399(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-11:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = f3(values[0], values[2])\n values[4] = f4(values[1], values[2])\n values[5] ... | [
"def f399(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-11:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = f3(values[0], values[2])\n values[4] = f4(values[1], values[2])\n values[5] ... | 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. | 400 | 0.1 | 0.25 | 5 | 347 |
34 | {
"answer": [
"C119",
"C155"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f363"
},
"question": "List the immediate input nodes to f363. (Order does not matter.)",
"task_id": "local-seed34-t00008-task_parents-f363",
"task_type": "task_parents"
} | [
"C119",
"C155"
] | List the immediate input nodes to f363. (Order does not matter.) | [
"def f399(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-11:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = f3(values[0], values[2])\n values[4] = f4(values[1], values[2])\n values[5] ... | [
"def f399(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-11:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = f3(values[0], values[2])\n values[4] = f4(values[1], values[2])\n values[5] ... | 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. | 400 | 0.1 | 0.25 | 5 | 348 |
34 | {
"answer": [
"f124",
"f2"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f173"
},
"question": "List the immediate input nodes to f173. (Order does not matter.)",
"task_id": "local-seed34-t00009-task_parents-f173",
"task_type": "task_parents"
} | [
"f124",
"f2"
] | List the immediate input nodes to f173. (Order does not matter.) | [
"def f399(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-11:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = f3(values[0], values[2])\n values[4] = f4(values[1], values[2])\n values[5] ... | [
"def f399(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-11:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = f2(values[1], values[1])\n values[3] = f3(values[0], values[2])\n values[4] = f4(values[1], values[2])\n values[5] ... | 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. | 400 | 0.1 | 0.25 | 5 | 349 |
35 | {
"answer": [
"f20",
"f224"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f259"
},
"question": "List the immediate input nodes to f259. (Order does not matter.)",
"task_id": "local-seed35-t00000-task_parents-f259",
"task_type": "task_parents"
} | [
"f20",
"f224"
] | List the immediate input nodes to f259. (Order does not matter.) | [
"def f399(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] = C2\n values[3] = C3\n values[4] = K4(values[3], values[3])\n values[5] = C5\n values[6] = C6\n values[7] = C7\n ... | [
"def f399(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] = C2\n values[3] = C3\n values[4] = K4(values[3], values[3])\n values[5] = C5\n values[6] = C6\n values[7] = C7\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. | 400 | 0.1 | 0.25 | 5 | 350 |
35 | {
"answer": [
"K38",
"f79"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f167"
},
"question": "List the immediate input nodes to f167. (Order does not matter.)",
"task_id": "local-seed35-t00001-task_parents-f167",
"task_type": "task_parents"
} | [
"K38",
"f79"
] | List the immediate input nodes to f167. (Order does not matter.) | [
"def f399(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] = C2\n values[3] = C3\n values[4] = K4(values[3], values[3])\n values[5] = C5\n values[6] = C6\n values[7] = C7\n ... | [
"def f399(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] = C2\n values[3] = C3\n values[4] = K4(values[3], values[3])\n values[5] = C5\n values[6] = C6\n values[7] = C7\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. | 400 | 0.1 | 0.25 | 5 | 351 |
35 | {
"answer": [
"C116",
"f102"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f340"
},
"question": "List the immediate input nodes to f340. (Order does not matter.)",
"task_id": "local-seed35-t00002-task_parents-f340",
"task_type": "task_parents"
} | [
"C116",
"f102"
] | List the immediate input nodes to f340. (Order does not matter.) | [
"def f399(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] = C2\n values[3] = C3\n values[4] = K4(values[3], values[3])\n values[5] = C5\n values[6] = C6\n values[7] = C7\n ... | [
"def f399(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] = C2\n values[3] = C3\n values[4] = K4(values[3], values[3])\n values[5] = C5\n values[6] = C6\n values[7] = C7\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. | 400 | 0.1 | 0.25 | 5 | 352 |
35 | {
"answer": [
"f24",
"f24"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f74"
},
"question": "List the immediate input nodes to f74. (Order does not matter.)",
"task_id": "local-seed35-t00003-task_parents-f74",
"task_type": "task_parents"
} | [
"f24",
"f24"
] | List the immediate input nodes to f74. (Order does not matter.) | [
"def f399(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] = C2\n values[3] = C3\n values[4] = K4(values[3], values[3])\n values[5] = C5\n values[6] = C6\n values[7] = C7\n ... | [
"def f399(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] = C2\n values[3] = C3\n values[4] = K4(values[3], values[3])\n values[5] = C5\n values[6] = C6\n values[7] = C7\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. | 400 | 0.1 | 0.25 | 5 | 353 |
35 | {
"answer": [
"f205",
"f329"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f338"
},
"question": "List the immediate input nodes to f338. (Order does not matter.)",
"task_id": "local-seed35-t00004-task_parents-f338",
"task_type": "task_parents"
} | [
"f205",
"f329"
] | List the immediate input nodes to f338. (Order does not matter.) | [
"def f399(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] = C2\n values[3] = C3\n values[4] = K4(values[3], values[3])\n values[5] = C5\n values[6] = C6\n values[7] = C7\n ... | [
"def f399(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] = C2\n values[3] = C3\n values[4] = K4(values[3], values[3])\n values[5] = C5\n values[6] = C6\n values[7] = C7\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. | 400 | 0.1 | 0.25 | 5 | 354 |
35 | {
"answer": [
"C2",
"f84"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f171"
},
"question": "List the immediate input nodes to f171. (Order does not matter.)",
"task_id": "local-seed35-t00005-task_parents-f171",
"task_type": "task_parents"
} | [
"C2",
"f84"
] | List the immediate input nodes to f171. (Order does not matter.) | [
"def f399(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] = C2\n values[3] = C3\n values[4] = K4(values[3], values[3])\n values[5] = C5\n values[6] = C6\n values[7] = C7\n ... | [
"def f399(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] = C2\n values[3] = C3\n values[4] = K4(values[3], values[3])\n values[5] = C5\n values[6] = C6\n values[7] = C7\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. | 400 | 0.1 | 0.25 | 5 | 355 |
35 | {
"answer": [
"C8",
"f246"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f377"
},
"question": "List the immediate input nodes to f377. (Order does not matter.)",
"task_id": "local-seed35-t00006-task_parents-f377",
"task_type": "task_parents"
} | [
"C8",
"f246"
] | List the immediate input nodes to f377. (Order does not matter.) | [
"def f399(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] = C2\n values[3] = C3\n values[4] = K4(values[3], values[3])\n values[5] = C5\n values[6] = C6\n values[7] = C7\n ... | [
"def f399(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] = C2\n values[3] = C3\n values[4] = K4(values[3], values[3])\n values[5] = C5\n values[6] = C6\n values[7] = C7\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. | 400 | 0.1 | 0.25 | 5 | 356 |
35 | {
"answer": [
"C2",
"f82"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f84"
},
"question": "List the immediate input nodes to f84. (Order does not matter.)",
"task_id": "local-seed35-t00007-task_parents-f84",
"task_type": "task_parents"
} | [
"C2",
"f82"
] | List the immediate input nodes to f84. (Order does not matter.) | [
"def f399(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] = C2\n values[3] = C3\n values[4] = K4(values[3], values[3])\n values[5] = C5\n values[6] = C6\n values[7] = C7\n ... | [
"def f399(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] = C2\n values[3] = C3\n values[4] = K4(values[3], values[3])\n values[5] = C5\n values[6] = C6\n values[7] = C7\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. | 400 | 0.1 | 0.25 | 5 | 357 |
35 | {
"answer": [
"C116",
"f28"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f140"
},
"question": "List the immediate input nodes to f140. (Order does not matter.)",
"task_id": "local-seed35-t00008-task_parents-f140",
"task_type": "task_parents"
} | [
"C116",
"f28"
] | List the immediate input nodes to f140. (Order does not matter.) | [
"def f399(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] = C2\n values[3] = C3\n values[4] = K4(values[3], values[3])\n values[5] = C5\n values[6] = C6\n values[7] = C7\n ... | [
"def f399(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] = C2\n values[3] = C3\n values[4] = K4(values[3], values[3])\n values[5] = C5\n values[6] = C6\n values[7] = C7\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. | 400 | 0.1 | 0.25 | 5 | 358 |
35 | {
"answer": [
"C203",
"f193"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f213"
},
"question": "List the immediate input nodes to f213. (Order does not matter.)",
"task_id": "local-seed35-t00009-task_parents-f213",
"task_type": "task_parents"
} | [
"C203",
"f193"
] | List the immediate input nodes to f213. (Order does not matter.) | [
"def f399(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] = C2\n values[3] = C3\n values[4] = K4(values[3], values[3])\n values[5] = C5\n values[6] = C6\n values[7] = C7\n ... | [
"def f399(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] = C2\n values[3] = C3\n values[4] = K4(values[3], values[3])\n values[5] = C5\n values[6] = C6\n values[7] = C7\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. | 400 | 0.1 | 0.25 | 5 | 359 |
36 | {
"answer": [
"f110",
"f95"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f141"
},
"question": "List the immediate input nodes to f141. (Order does not matter.)",
"task_id": "local-seed36-t00000-task_parents-f141",
"task_type": "task_parents"
} | [
"f110",
"f95"
] | List the immediate input nodes to f141. (Order does not matter.) | [
"def f396(a0, a1):\n a = a0 + -4 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -4",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[0], values[0])\n values[3] = f3(values[0], values[0])\n values[4] = C4\n values[5] = K5(values[0], values[... | [
"def f396(a0, a1):\n a = a0 + -4 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -4",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[0], values[0])\n values[3] = f3(values[0], values[0])\n values[4] = C4\n values[5] = K5(values[0], values[... | 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. | 400 | 0.1 | 0.25 | 5 | 360 |
36 | {
"answer": [
"C0",
"f11"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f32"
},
"question": "List the immediate input nodes to f32. (Order does not matter.)",
"task_id": "local-seed36-t00001-task_parents-f32",
"task_type": "task_parents"
} | [
"C0",
"f11"
] | List the immediate input nodes to f32. (Order does not matter.) | [
"def f396(a0, a1):\n a = a0 + -4 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -4",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[0], values[0])\n values[3] = f3(values[0], values[0])\n values[4] = C4\n values[5] = K5(values[0], values[... | [
"def f396(a0, a1):\n a = a0 + -4 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -4",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[0], values[0])\n values[3] = f3(values[0], values[0])\n values[4] = C4\n values[5] = K5(values[0], values[... | 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. | 400 | 0.1 | 0.25 | 5 | 361 |
36 | {
"answer": [
"C21",
"f365"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f392"
},
"question": "List the immediate input nodes to f392. (Order does not matter.)",
"task_id": "local-seed36-t00002-task_parents-f392",
"task_type": "task_parents"
} | [
"C21",
"f365"
] | List the immediate input nodes to f392. (Order does not matter.) | [
"def f396(a0, a1):\n a = a0 + -4 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -4",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[0], values[0])\n values[3] = f3(values[0], values[0])\n values[4] = C4\n values[5] = K5(values[0], values[... | [
"def f396(a0, a1):\n a = a0 + -4 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -4",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[0], values[0])\n values[3] = f3(values[0], values[0])\n values[4] = C4\n values[5] = K5(values[0], values[... | 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. | 400 | 0.1 | 0.25 | 5 | 362 |
36 | {
"answer": [
"K5",
"f11"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f12"
},
"question": "List the immediate input nodes to f12. (Order does not matter.)",
"task_id": "local-seed36-t00003-task_parents-f12",
"task_type": "task_parents"
} | [
"K5",
"f11"
] | List the immediate input nodes to f12. (Order does not matter.) | [
"def f396(a0, a1):\n a = a0 + -4 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -4",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[0], values[0])\n values[3] = f3(values[0], values[0])\n values[4] = C4\n values[5] = K5(values[0], values[... | [
"def f396(a0, a1):\n a = a0 + -4 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -4",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[0], values[0])\n values[3] = f3(values[0], values[0])\n values[4] = C4\n values[5] = K5(values[0], values[... | 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. | 400 | 0.1 | 0.25 | 5 | 363 |
36 | {
"answer": [
"C303",
"f70"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f385"
},
"question": "List the immediate input nodes to f385. (Order does not matter.)",
"task_id": "local-seed36-t00004-task_parents-f385",
"task_type": "task_parents"
} | [
"C303",
"f70"
] | List the immediate input nodes to f385. (Order does not matter.) | [
"def f396(a0, a1):\n a = a0 + -4 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -4",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[0], values[0])\n values[3] = f3(values[0], values[0])\n values[4] = C4\n values[5] = K5(values[0], values[... | [
"def f396(a0, a1):\n a = a0 + -4 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -4",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[0], values[0])\n values[3] = f3(values[0], values[0])\n values[4] = C4\n values[5] = K5(values[0], values[... | 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. | 400 | 0.1 | 0.25 | 5 | 364 |
36 | {
"answer": [
"f159",
"f22"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f324"
},
"question": "List the immediate input nodes to f324. (Order does not matter.)",
"task_id": "local-seed36-t00005-task_parents-f324",
"task_type": "task_parents"
} | [
"f159",
"f22"
] | List the immediate input nodes to f324. (Order does not matter.) | [
"def f396(a0, a1):\n a = a0 + -4 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -4",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[0], values[0])\n values[3] = f3(values[0], values[0])\n values[4] = C4\n values[5] = K5(values[0], values[... | [
"def f396(a0, a1):\n a = a0 + -4 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -4",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[0], values[0])\n values[3] = f3(values[0], values[0])\n values[4] = C4\n values[5] = K5(values[0], values[... | 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. | 400 | 0.1 | 0.25 | 5 | 365 |
36 | {
"answer": [
"K197",
"f281"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f371"
},
"question": "List the immediate input nodes to f371. (Order does not matter.)",
"task_id": "local-seed36-t00006-task_parents-f371",
"task_type": "task_parents"
} | [
"K197",
"f281"
] | List the immediate input nodes to f371. (Order does not matter.) | [
"def f396(a0, a1):\n a = a0 + -4 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -4",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[0], values[0])\n values[3] = f3(values[0], values[0])\n values[4] = C4\n values[5] = K5(values[0], values[... | [
"def f396(a0, a1):\n a = a0 + -4 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -4",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[0], values[0])\n values[3] = f3(values[0], values[0])\n values[4] = C4\n values[5] = K5(values[0], values[... | 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. | 400 | 0.1 | 0.25 | 5 | 366 |
36 | {
"answer": [
"f194",
"f59"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f365"
},
"question": "List the immediate input nodes to f365. (Order does not matter.)",
"task_id": "local-seed36-t00007-task_parents-f365",
"task_type": "task_parents"
} | [
"f194",
"f59"
] | List the immediate input nodes to f365. (Order does not matter.) | [
"def f396(a0, a1):\n a = a0 + -4 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -4",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[0], values[0])\n values[3] = f3(values[0], values[0])\n values[4] = C4\n values[5] = K5(values[0], values[... | [
"def f396(a0, a1):\n a = a0 + -4 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -4",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[0], values[0])\n values[3] = f3(values[0], values[0])\n values[4] = C4\n values[5] = K5(values[0], values[... | 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. | 400 | 0.1 | 0.25 | 5 | 367 |
36 | {
"answer": [
"C25",
"f62"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f321"
},
"question": "List the immediate input nodes to f321. (Order does not matter.)",
"task_id": "local-seed36-t00008-task_parents-f321",
"task_type": "task_parents"
} | [
"C25",
"f62"
] | List the immediate input nodes to f321. (Order does not matter.) | [
"def f396(a0, a1):\n a = a0 + -4 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -4",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[0], values[0])\n values[3] = f3(values[0], values[0])\n values[4] = C4\n values[5] = K5(values[0], values[... | [
"def f396(a0, a1):\n a = a0 + -4 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -4",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[0], values[0])\n values[3] = f3(values[0], values[0])\n values[4] = C4\n values[5] = K5(values[0], values[... | 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. | 400 | 0.1 | 0.25 | 5 | 368 |
36 | {
"answer": [
"C106",
"C75"
],
"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-seed36-t00009-task_parents-f123",
"task_type": "task_parents"
} | [
"C106",
"C75"
] | List the immediate input nodes to f123. (Order does not matter.) | [
"def f396(a0, a1):\n a = a0 + -4 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -4",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[0], values[0])\n values[3] = f3(values[0], values[0])\n values[4] = C4\n values[5] = K5(values[0], values[... | [
"def f396(a0, a1):\n a = a0 + -4 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -4",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[0], values[0])\n values[3] = f3(values[0], values[0])\n values[4] = C4\n values[5] = K5(values[0], values[... | 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. | 400 | 0.1 | 0.25 | 5 | 369 |
37 | {
"answer": [
"f226",
"f99"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f290"
},
"question": "List the immediate input nodes to f290. (Order does not matter.)",
"task_id": "local-seed37-t00000-task_parents-f290",
"task_type": "task_parents"
} | [
"f226",
"f99"
] | List the immediate input nodes to f290. (Order does not matter.) | [
"def f399(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 3\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = f1(values[0], values[0])\n values[2] = K2(values[0], values[0])\n values[3] = C3\n values[4] = f4(v... | [
"def f399(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 3\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = f1(values[0], values[0])\n values[2] = K2(values[0], values[0])\n values[3] = C3\n values[4] = f4(v... | 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. | 400 | 0.1 | 0.25 | 5 | 370 |
37 | {
"answer": [
"C25",
"f201"
],
"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-seed37-t00001-task_parents-f253",
"task_type": "task_parents"
} | [
"C25",
"f201"
] | List the immediate input nodes to f253. (Order does not matter.) | [
"def f399(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 3\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = f1(values[0], values[0])\n values[2] = K2(values[0], values[0])\n values[3] = C3\n values[4] = f4(v... | [
"def f399(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 3\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = f1(values[0], values[0])\n values[2] = K2(values[0], values[0])\n values[3] = C3\n values[4] = f4(v... | 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. | 400 | 0.1 | 0.25 | 5 | 371 |
37 | {
"answer": [
"C10",
"f20"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f49"
},
"question": "List the immediate input nodes to f49. (Order does not matter.)",
"task_id": "local-seed37-t00002-task_parents-f49",
"task_type": "task_parents"
} | [
"C10",
"f20"
] | List the immediate input nodes to f49. (Order does not matter.) | [
"def f399(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 3\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = f1(values[0], values[0])\n values[2] = K2(values[0], values[0])\n values[3] = C3\n values[4] = f4(v... | [
"def f399(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 3\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = f1(values[0], values[0])\n values[2] = K2(values[0], values[0])\n values[3] = C3\n values[4] = f4(v... | 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. | 400 | 0.1 | 0.25 | 5 | 372 |
37 | {
"answer": [
"f346",
"f66"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f385"
},
"question": "List the immediate input nodes to f385. (Order does not matter.)",
"task_id": "local-seed37-t00003-task_parents-f385",
"task_type": "task_parents"
} | [
"f346",
"f66"
] | List the immediate input nodes to f385. (Order does not matter.) | [
"def f399(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 3\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = f1(values[0], values[0])\n values[2] = K2(values[0], values[0])\n values[3] = C3\n values[4] = f4(v... | [
"def f399(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 3\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = f1(values[0], values[0])\n values[2] = K2(values[0], values[0])\n values[3] = C3\n values[4] = f4(v... | 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. | 400 | 0.1 | 0.25 | 5 | 373 |
37 | {
"answer": [
"f20",
"f214"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f259"
},
"question": "List the immediate input nodes to f259. (Order does not matter.)",
"task_id": "local-seed37-t00004-task_parents-f259",
"task_type": "task_parents"
} | [
"f20",
"f214"
] | List the immediate input nodes to f259. (Order does not matter.) | [
"def f399(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 3\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = f1(values[0], values[0])\n values[2] = K2(values[0], values[0])\n values[3] = C3\n values[4] = f4(v... | [
"def f399(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 3\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = f1(values[0], values[0])\n values[2] = K2(values[0], values[0])\n values[3] = C3\n values[4] = f4(v... | 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. | 400 | 0.1 | 0.25 | 5 | 374 |
37 | {
"answer": [
"f100",
"f38"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f276"
},
"question": "List the immediate input nodes to f276. (Order does not matter.)",
"task_id": "local-seed37-t00005-task_parents-f276",
"task_type": "task_parents"
} | [
"f100",
"f38"
] | List the immediate input nodes to f276. (Order does not matter.) | [
"def f399(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 3\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = f1(values[0], values[0])\n values[2] = K2(values[0], values[0])\n values[3] = C3\n values[4] = f4(v... | [
"def f399(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 3\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = f1(values[0], values[0])\n values[2] = K2(values[0], values[0])\n values[3] = C3\n values[4] = f4(v... | 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. | 400 | 0.1 | 0.25 | 5 | 375 |
37 | {
"answer": [
"f152",
"f200"
],
"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-seed37-t00006-task_parents-f353",
"task_type": "task_parents"
} | [
"f152",
"f200"
] | List the immediate input nodes to f353. (Order does not matter.) | [
"def f399(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 3\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = f1(values[0], values[0])\n values[2] = K2(values[0], values[0])\n values[3] = C3\n values[4] = f4(v... | [
"def f399(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 3\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = f1(values[0], values[0])\n values[2] = K2(values[0], values[0])\n values[3] = C3\n values[4] = f4(v... | 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. | 400 | 0.1 | 0.25 | 5 | 376 |
37 | {
"answer": [
"C229",
"f236"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f313"
},
"question": "List the immediate input nodes to f313. (Order does not matter.)",
"task_id": "local-seed37-t00007-task_parents-f313",
"task_type": "task_parents"
} | [
"C229",
"f236"
] | List the immediate input nodes to f313. (Order does not matter.) | [
"def f399(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 3\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = f1(values[0], values[0])\n values[2] = K2(values[0], values[0])\n values[3] = C3\n values[4] = f4(v... | [
"def f399(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 3\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = f1(values[0], values[0])\n values[2] = K2(values[0], values[0])\n values[3] = C3\n values[4] = f4(v... | 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. | 400 | 0.1 | 0.25 | 5 | 377 |
37 | {
"answer": [
"f21",
"f99"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f347"
},
"question": "List the immediate input nodes to f347. (Order does not matter.)",
"task_id": "local-seed37-t00008-task_parents-f347",
"task_type": "task_parents"
} | [
"f21",
"f99"
] | List the immediate input nodes to f347. (Order does not matter.) | [
"def f399(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 3\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = f1(values[0], values[0])\n values[2] = K2(values[0], values[0])\n values[3] = C3\n values[4] = f4(v... | [
"def f399(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 3\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = f1(values[0], values[0])\n values[2] = K2(values[0], values[0])\n values[3] = C3\n values[4] = f4(v... | 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. | 400 | 0.1 | 0.25 | 5 | 378 |
37 | {
"answer": [
"f190",
"f226"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f263"
},
"question": "List the immediate input nodes to f263. (Order does not matter.)",
"task_id": "local-seed37-t00009-task_parents-f263",
"task_type": "task_parents"
} | [
"f190",
"f226"
] | List the immediate input nodes to f263. (Order does not matter.) | [
"def f399(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 3\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = f1(values[0], values[0])\n values[2] = K2(values[0], values[0])\n values[3] = C3\n values[4] = f4(v... | [
"def f399(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 3\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = f1(values[0], values[0])\n values[2] = K2(values[0], values[0])\n values[3] = C3\n values[4] = f4(v... | 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. | 400 | 0.1 | 0.25 | 5 | 379 |
38 | {
"answer": [
"f143",
"f86"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f321"
},
"question": "List the immediate input nodes to f321. (Order does not matter.)",
"task_id": "local-seed38-t00000-task_parents-f321",
"task_type": "task_parents"
} | [
"f143",
"f86"
] | List the immediate input nodes to f321. (Order does not matter.) | [
"def f399(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 2\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = f4(values[3], values[3])\n values[5] = K5(val... | [
"def f399(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 2\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = f4(values[3], values[3])\n values[5] = K5(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. | 400 | 0.1 | 0.25 | 5 | 380 |
38 | {
"answer": [
"f10",
"f222"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f330"
},
"question": "List the immediate input nodes to f330. (Order does not matter.)",
"task_id": "local-seed38-t00001-task_parents-f330",
"task_type": "task_parents"
} | [
"f10",
"f222"
] | List the immediate input nodes to f330. (Order does not matter.) | [
"def f399(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 2\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = f4(values[3], values[3])\n values[5] = K5(val... | [
"def f399(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 2\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = f4(values[3], values[3])\n values[5] = K5(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. | 400 | 0.1 | 0.25 | 5 | 381 |
38 | {
"answer": [
"f12",
"f41"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f81"
},
"question": "List the immediate input nodes to f81. (Order does not matter.)",
"task_id": "local-seed38-t00002-task_parents-f81",
"task_type": "task_parents"
} | [
"f12",
"f41"
] | List the immediate input nodes to f81. (Order does not matter.) | [
"def f399(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 2\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = f4(values[3], values[3])\n values[5] = K5(val... | [
"def f399(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 2\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = f4(values[3], values[3])\n values[5] = K5(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. | 400 | 0.1 | 0.25 | 5 | 382 |
38 | {
"answer": [
"f21",
"f4"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f49"
},
"question": "List the immediate input nodes to f49. (Order does not matter.)",
"task_id": "local-seed38-t00003-task_parents-f49",
"task_type": "task_parents"
} | [
"f21",
"f4"
] | List the immediate input nodes to f49. (Order does not matter.) | [
"def f399(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 2\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = f4(values[3], values[3])\n values[5] = K5(val... | [
"def f399(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 2\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = f4(values[3], values[3])\n values[5] = K5(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. | 400 | 0.1 | 0.25 | 5 | 383 |
38 | {
"answer": [
"f182",
"f222"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f282"
},
"question": "List the immediate input nodes to f282. (Order does not matter.)",
"task_id": "local-seed38-t00004-task_parents-f282",
"task_type": "task_parents"
} | [
"f182",
"f222"
] | List the immediate input nodes to f282. (Order does not matter.) | [
"def f399(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 2\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = f4(values[3], values[3])\n values[5] = K5(val... | [
"def f399(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 2\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = f4(values[3], values[3])\n values[5] = K5(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. | 400 | 0.1 | 0.25 | 5 | 384 |
38 | {
"answer": [
"f110",
"f261"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f357"
},
"question": "List the immediate input nodes to f357. (Order does not matter.)",
"task_id": "local-seed38-t00005-task_parents-f357",
"task_type": "task_parents"
} | [
"f110",
"f261"
] | List the immediate input nodes to f357. (Order does not matter.) | [
"def f399(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 2\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = f4(values[3], values[3])\n values[5] = K5(val... | [
"def f399(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 2\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = f4(values[3], values[3])\n values[5] = K5(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. | 400 | 0.1 | 0.25 | 5 | 385 |
38 | {
"answer": [
"f153",
"f215"
],
"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-seed38-t00006-task_parents-f287",
"task_type": "task_parents"
} | [
"f153",
"f215"
] | List the immediate input nodes to f287. (Order does not matter.) | [
"def f399(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 2\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = f4(values[3], values[3])\n values[5] = K5(val... | [
"def f399(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 2\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = f4(values[3], values[3])\n values[5] = K5(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. | 400 | 0.1 | 0.25 | 5 | 386 |
38 | {
"answer": [
"C1",
"f31"
],
"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-seed38-t00007-task_parents-f36",
"task_type": "task_parents"
} | [
"C1",
"f31"
] | List the immediate input nodes to f36. (Order does not matter.) | [
"def f399(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 2\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = f4(values[3], values[3])\n values[5] = K5(val... | [
"def f399(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 2\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = f4(values[3], values[3])\n values[5] = K5(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. | 400 | 0.1 | 0.25 | 5 | 387 |
38 | {
"answer": [
"f40",
"f94"
],
"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-seed38-t00008-task_parents-f129",
"task_type": "task_parents"
} | [
"f40",
"f94"
] | List the immediate input nodes to f129. (Order does not matter.) | [
"def f399(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 2\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = f4(values[3], values[3])\n values[5] = K5(val... | [
"def f399(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 2\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = f4(values[3], values[3])\n values[5] = K5(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. | 400 | 0.1 | 0.25 | 5 | 388 |
38 | {
"answer": [
"C3",
"f57"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f267"
},
"question": "List the immediate input nodes to f267. (Order does not matter.)",
"task_id": "local-seed38-t00009-task_parents-f267",
"task_type": "task_parents"
} | [
"C3",
"f57"
] | List the immediate input nodes to f267. (Order does not matter.) | [
"def f399(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 2\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = f4(values[3], values[3])\n values[5] = K5(val... | [
"def f399(a0, a1):\n total = 0\n for key in sorted(a0):\n total += a0[key] + len(key) % 3 * a1 * 2\n return total",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = f4(values[3], values[3])\n values[5] = K5(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. | 400 | 0.1 | 0.25 | 5 | 389 |
39 | {
"answer": [
"f46",
"f54"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f114"
},
"question": "List the immediate input nodes to f114. (Order does not matter.)",
"task_id": "local-seed39-t00000-task_parents-f114",
"task_type": "task_parents"
} | [
"f46",
"f54"
] | List the immediate input nodes to f114. (Order does not matter.) | [
"def f399(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] = C2\n values[3] = f3(values[2], values[2])\n ... | [
"def f399(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] = C2\n values[3] = f3(values[2], values[2])\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. | 400 | 0.1 | 0.25 | 5 | 390 |
39 | {
"answer": [
"f23",
"f83"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f133"
},
"question": "List the immediate input nodes to f133. (Order does not matter.)",
"task_id": "local-seed39-t00001-task_parents-f133",
"task_type": "task_parents"
} | [
"f23",
"f83"
] | List the immediate input nodes to f133. (Order does not matter.) | [
"def f399(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] = C2\n values[3] = f3(values[2], values[2])\n ... | [
"def f399(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] = C2\n values[3] = f3(values[2], values[2])\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. | 400 | 0.1 | 0.25 | 5 | 391 |
39 | {
"answer": [
"f146",
"f21"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f178"
},
"question": "List the immediate input nodes to f178. (Order does not matter.)",
"task_id": "local-seed39-t00002-task_parents-f178",
"task_type": "task_parents"
} | [
"f146",
"f21"
] | List the immediate input nodes to f178. (Order does not matter.) | [
"def f399(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] = C2\n values[3] = f3(values[2], values[2])\n ... | [
"def f399(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] = C2\n values[3] = f3(values[2], values[2])\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. | 400 | 0.1 | 0.25 | 5 | 392 |
39 | {
"answer": [
"C0",
"f5"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f12"
},
"question": "List the immediate input nodes to f12. (Order does not matter.)",
"task_id": "local-seed39-t00003-task_parents-f12",
"task_type": "task_parents"
} | [
"C0",
"f5"
] | List the immediate input nodes to f12. (Order does not matter.) | [
"def f399(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] = C2\n values[3] = f3(values[2], values[2])\n ... | [
"def f399(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] = C2\n values[3] = f3(values[2], values[2])\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. | 400 | 0.1 | 0.25 | 5 | 393 |
39 | {
"answer": [
"C42",
"f94"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f109"
},
"question": "List the immediate input nodes to f109. (Order does not matter.)",
"task_id": "local-seed39-t00004-task_parents-f109",
"task_type": "task_parents"
} | [
"C42",
"f94"
] | List the immediate input nodes to f109. (Order does not matter.) | [
"def f399(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] = C2\n values[3] = f3(values[2], values[2])\n ... | [
"def f399(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] = C2\n values[3] = f3(values[2], values[2])\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. | 400 | 0.1 | 0.25 | 5 | 394 |
39 | {
"answer": [
"C32",
"f105"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f118"
},
"question": "List the immediate input nodes to f118. (Order does not matter.)",
"task_id": "local-seed39-t00005-task_parents-f118",
"task_type": "task_parents"
} | [
"C32",
"f105"
] | List the immediate input nodes to f118. (Order does not matter.) | [
"def f399(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] = C2\n values[3] = f3(values[2], values[2])\n ... | [
"def f399(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] = C2\n values[3] = f3(values[2], values[2])\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. | 400 | 0.1 | 0.25 | 5 | 395 |
39 | {
"answer": [
"f15",
"f176"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f182"
},
"question": "List the immediate input nodes to f182. (Order does not matter.)",
"task_id": "local-seed39-t00006-task_parents-f182",
"task_type": "task_parents"
} | [
"f15",
"f176"
] | List the immediate input nodes to f182. (Order does not matter.) | [
"def f399(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] = C2\n values[3] = f3(values[2], values[2])\n ... | [
"def f399(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] = C2\n values[3] = f3(values[2], values[2])\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. | 400 | 0.1 | 0.25 | 5 | 396 |
39 | {
"answer": [
"f236",
"f83"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f307"
},
"question": "List the immediate input nodes to f307. (Order does not matter.)",
"task_id": "local-seed39-t00007-task_parents-f307",
"task_type": "task_parents"
} | [
"f236",
"f83"
] | List the immediate input nodes to f307. (Order does not matter.) | [
"def f399(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] = C2\n values[3] = f3(values[2], values[2])\n ... | [
"def f399(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] = C2\n values[3] = f3(values[2], values[2])\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. | 400 | 0.1 | 0.25 | 5 | 397 |
39 | {
"answer": [
"f105",
"f110"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f245"
},
"question": "List the immediate input nodes to f245. (Order does not matter.)",
"task_id": "local-seed39-t00008-task_parents-f245",
"task_type": "task_parents"
} | [
"f105",
"f110"
] | List the immediate input nodes to f245. (Order does not matter.) | [
"def f399(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] = C2\n values[3] = f3(values[2], values[2])\n ... | [
"def f399(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] = C2\n values[3] = f3(values[2], values[2])\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. | 400 | 0.1 | 0.25 | 5 | 398 |
39 | {
"answer": [
"C2",
"f3"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f4"
},
"question": "List the immediate input nodes to f4. (Order does not matter.)",
"task_id": "local-seed39-t00009-task_parents-f4",
"task_type": "task_parents"
} | [
"C2",
"f3"
] | List the immediate input nodes to f4. (Order does not matter.) | [
"def f399(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] = C2\n values[3] = f3(values[2], values[2])\n ... | [
"def f399(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] = C2\n values[3] = f3(values[2], values[2])\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. | 400 | 0.1 | 0.25 | 5 | 399 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.