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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
10 | {
"answer": [
"f28",
"f68"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f120"
},
"question": "List the immediate input nodes to f120. (Order does not matter.)",
"task_id": "local-seed10-t00000-task_parents-f120",
"task_type": "task_parents"
} | [
"f28",
"f68"
] | List the immediate input nodes to f120. (Order does not matter.) | [
"def f199(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] = C3\n values[4] = C4\n values[5] = K5(values[4], values[4])\n values[6] = f6(values[1], values[4]... | [
"def f199(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] = C3\n values[4] = C4\n values[5] = K5(values[4], values[4])\n values[6] = f6(values[1], values[4]... | 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. | 200 | 0.1 | 0.25 | 5 | 100 |
10 | {
"answer": [
"C8",
"f9"
],
"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-seed10-t00001-task_parents-f12",
"task_type": "task_parents"
} | [
"C8",
"f9"
] | List the immediate input nodes to f12. (Order does not matter.) | [
"def f199(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] = C3\n values[4] = C4\n values[5] = K5(values[4], values[4])\n values[6] = f6(values[1], values[4]... | [
"def f199(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] = C3\n values[4] = C4\n values[5] = K5(values[4], values[4])\n values[6] = f6(values[1], values[4]... | 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. | 200 | 0.1 | 0.25 | 5 | 101 |
10 | {
"answer": [
"f31",
"f9"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f93"
},
"question": "List the immediate input nodes to f93. (Order does not matter.)",
"task_id": "local-seed10-t00002-task_parents-f93",
"task_type": "task_parents"
} | [
"f31",
"f9"
] | List the immediate input nodes to f93. (Order does not matter.) | [
"def f199(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] = C3\n values[4] = C4\n values[5] = K5(values[4], values[4])\n values[6] = f6(values[1], values[4]... | [
"def f199(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] = C3\n values[4] = C4\n values[5] = K5(values[4], values[4])\n values[6] = f6(values[1], values[4]... | 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. | 200 | 0.1 | 0.25 | 5 | 102 |
10 | {
"answer": [
"f66",
"f66"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f100"
},
"question": "List the immediate input nodes to f100. (Order does not matter.)",
"task_id": "local-seed10-t00003-task_parents-f100",
"task_type": "task_parents"
} | [
"f66",
"f66"
] | List the immediate input nodes to f100. (Order does not matter.) | [
"def f199(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] = C3\n values[4] = C4\n values[5] = K5(values[4], values[4])\n values[6] = f6(values[1], values[4]... | [
"def f199(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] = C3\n values[4] = C4\n values[5] = K5(values[4], values[4])\n values[6] = f6(values[1], values[4]... | 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. | 200 | 0.1 | 0.25 | 5 | 103 |
10 | {
"answer": [
"f28",
"f68"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f120"
},
"question": "List the immediate input nodes to f120. (Order does not matter.)",
"task_id": "local-seed10-t00004-task_parents-f120",
"task_type": "task_parents"
} | [
"f28",
"f68"
] | List the immediate input nodes to f120. (Order does not matter.) | [
"def f199(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] = C3\n values[4] = C4\n values[5] = K5(values[4], values[4])\n values[6] = f6(values[1], values[4]... | [
"def f199(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] = C3\n values[4] = C4\n values[5] = K5(values[4], values[4])\n values[6] = f6(values[1], values[4]... | 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. | 200 | 0.1 | 0.25 | 5 | 104 |
10 | {
"answer": [
"C4",
"f6"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f7"
},
"question": "List the immediate input nodes to f7. (Order does not matter.)",
"task_id": "local-seed10-t00005-task_parents-f7",
"task_type": "task_parents"
} | [
"C4",
"f6"
] | List the immediate input nodes to f7. (Order does not matter.) | [
"def f199(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] = C3\n values[4] = C4\n values[5] = K5(values[4], values[4])\n values[6] = f6(values[1], values[4]... | [
"def f199(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] = C3\n values[4] = C4\n values[5] = K5(values[4], values[4])\n values[6] = f6(values[1], values[4]... | 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. | 200 | 0.1 | 0.25 | 5 | 105 |
10 | {
"answer": [
"f27",
"f41"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f48"
},
"question": "List the immediate input nodes to f48. (Order does not matter.)",
"task_id": "local-seed10-t00006-task_parents-f48",
"task_type": "task_parents"
} | [
"f27",
"f41"
] | List the immediate input nodes to f48. (Order does not matter.) | [
"def f199(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] = C3\n values[4] = C4\n values[5] = K5(values[4], values[4])\n values[6] = f6(values[1], values[4]... | [
"def f199(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] = C3\n values[4] = C4\n values[5] = K5(values[4], values[4])\n values[6] = f6(values[1], values[4]... | 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. | 200 | 0.1 | 0.25 | 5 | 106 |
10 | {
"answer": [
"C4",
"f79"
],
"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-seed10-t00007-task_parents-f98",
"task_type": "task_parents"
} | [
"C4",
"f79"
] | List the immediate input nodes to f98. (Order does not matter.) | [
"def f199(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] = C3\n values[4] = C4\n values[5] = K5(values[4], values[4])\n values[6] = f6(values[1], values[4]... | [
"def f199(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] = C3\n values[4] = C4\n values[5] = K5(values[4], values[4])\n values[6] = f6(values[1], values[4]... | 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. | 200 | 0.1 | 0.25 | 5 | 107 |
10 | {
"answer": [
"C122",
"f161"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f170"
},
"question": "List the immediate input nodes to f170. (Order does not matter.)",
"task_id": "local-seed10-t00008-task_parents-f170",
"task_type": "task_parents"
} | [
"C122",
"f161"
] | List the immediate input nodes to f170. (Order does not matter.) | [
"def f199(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] = C3\n values[4] = C4\n values[5] = K5(values[4], values[4])\n values[6] = f6(values[1], values[4]... | [
"def f199(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] = C3\n values[4] = C4\n values[5] = K5(values[4], values[4])\n values[6] = f6(values[1], values[4]... | 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. | 200 | 0.1 | 0.25 | 5 | 108 |
10 | {
"answer": [
"f10",
"f53"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f101"
},
"question": "List the immediate input nodes to f101. (Order does not matter.)",
"task_id": "local-seed10-t00009-task_parents-f101",
"task_type": "task_parents"
} | [
"f10",
"f53"
] | List the immediate input nodes to f101. (Order does not matter.) | [
"def f199(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] = C3\n values[4] = C4\n values[5] = K5(values[4], values[4])\n values[6] = f6(values[1], values[4]... | [
"def f199(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] = C3\n values[4] = C4\n values[5] = K5(values[4], values[4])\n values[6] = f6(values[1], values[4]... | 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. | 200 | 0.1 | 0.25 | 5 | 109 |
11 | {
"answer": [
"f134",
"f14"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f179"
},
"question": "List the immediate input nodes to f179. (Order does not matter.)",
"task_id": "local-seed11-t00000-task_parents-f179",
"task_type": "task_parents"
} | [
"f134",
"f14"
] | List the immediate input nodes to f179. (Order does not matter.) | [
"def f198(a0, a1):\n a = a0 + -8 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -8",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = f6(values[3], values[5])\n values[7] = C7\... | [
"def f198(a0, a1):\n a = a0 + -8 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -8",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = f6(values[3], values[5])\n values[7] = C7\... | 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. | 200 | 0.1 | 0.25 | 5 | 110 |
11 | {
"answer": [
"C7",
"f45"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f183"
},
"question": "List the immediate input nodes to f183. (Order does not matter.)",
"task_id": "local-seed11-t00001-task_parents-f183",
"task_type": "task_parents"
} | [
"C7",
"f45"
] | List the immediate input nodes to f183. (Order does not matter.) | [
"def f198(a0, a1):\n a = a0 + -8 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -8",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = f6(values[3], values[5])\n values[7] = C7\... | [
"def f198(a0, a1):\n a = a0 + -8 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -8",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = f6(values[3], values[5])\n values[7] = C7\... | 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. | 200 | 0.1 | 0.25 | 5 | 111 |
11 | {
"answer": [
"f134",
"f14"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f179"
},
"question": "List the immediate input nodes to f179. (Order does not matter.)",
"task_id": "local-seed11-t00002-task_parents-f179",
"task_type": "task_parents"
} | [
"f134",
"f14"
] | List the immediate input nodes to f179. (Order does not matter.) | [
"def f198(a0, a1):\n a = a0 + -8 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -8",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = f6(values[3], values[5])\n values[7] = C7\... | [
"def f198(a0, a1):\n a = a0 + -8 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -8",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = f6(values[3], values[5])\n values[7] = C7\... | 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. | 200 | 0.1 | 0.25 | 5 | 112 |
11 | {
"answer": [
"f59",
"f71"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f78"
},
"question": "List the immediate input nodes to f78. (Order does not matter.)",
"task_id": "local-seed11-t00003-task_parents-f78",
"task_type": "task_parents"
} | [
"f59",
"f71"
] | List the immediate input nodes to f78. (Order does not matter.) | [
"def f198(a0, a1):\n a = a0 + -8 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -8",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = f6(values[3], values[5])\n values[7] = C7\... | [
"def f198(a0, a1):\n a = a0 + -8 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -8",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = f6(values[3], values[5])\n values[7] = C7\... | 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. | 200 | 0.1 | 0.25 | 5 | 113 |
11 | {
"answer": [
"C0",
"f62"
],
"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-seed11-t00004-task_parents-f77",
"task_type": "task_parents"
} | [
"C0",
"f62"
] | List the immediate input nodes to f77. (Order does not matter.) | [
"def f198(a0, a1):\n a = a0 + -8 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -8",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = f6(values[3], values[5])\n values[7] = C7\... | [
"def f198(a0, a1):\n a = a0 + -8 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -8",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = f6(values[3], values[5])\n values[7] = C7\... | 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. | 200 | 0.1 | 0.25 | 5 | 114 |
11 | {
"answer": [
"f130",
"f134"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f189"
},
"question": "List the immediate input nodes to f189. (Order does not matter.)",
"task_id": "local-seed11-t00005-task_parents-f189",
"task_type": "task_parents"
} | [
"f130",
"f134"
] | List the immediate input nodes to f189. (Order does not matter.) | [
"def f198(a0, a1):\n a = a0 + -8 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -8",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = f6(values[3], values[5])\n values[7] = C7\... | [
"def f198(a0, a1):\n a = a0 + -8 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -8",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = f6(values[3], values[5])\n values[7] = C7\... | 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. | 200 | 0.1 | 0.25 | 5 | 115 |
11 | {
"answer": [
"C0",
"f62"
],
"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-seed11-t00006-task_parents-f77",
"task_type": "task_parents"
} | [
"C0",
"f62"
] | List the immediate input nodes to f77. (Order does not matter.) | [
"def f198(a0, a1):\n a = a0 + -8 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -8",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = f6(values[3], values[5])\n values[7] = C7\... | [
"def f198(a0, a1):\n a = a0 + -8 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -8",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = f6(values[3], values[5])\n values[7] = C7\... | 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. | 200 | 0.1 | 0.25 | 5 | 116 |
11 | {
"answer": [
"C5",
"f28"
],
"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-seed11-t00007-task_parents-f44",
"task_type": "task_parents"
} | [
"C5",
"f28"
] | List the immediate input nodes to f44. (Order does not matter.) | [
"def f198(a0, a1):\n a = a0 + -8 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -8",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = f6(values[3], values[5])\n values[7] = C7\... | [
"def f198(a0, a1):\n a = a0 + -8 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -8",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = f6(values[3], values[5])\n values[7] = C7\... | 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. | 200 | 0.1 | 0.25 | 5 | 117 |
11 | {
"answer": [
"f55",
"f99"
],
"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-seed11-t00008-task_parents-f178",
"task_type": "task_parents"
} | [
"f55",
"f99"
] | List the immediate input nodes to f178. (Order does not matter.) | [
"def f198(a0, a1):\n a = a0 + -8 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -8",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = f6(values[3], values[5])\n values[7] = C7\... | [
"def f198(a0, a1):\n a = a0 + -8 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -8",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = f6(values[3], values[5])\n values[7] = C7\... | 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. | 200 | 0.1 | 0.25 | 5 | 118 |
11 | {
"answer": [
"K93",
"f31"
],
"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-seed11-t00009-task_parents-f123",
"task_type": "task_parents"
} | [
"K93",
"f31"
] | List the immediate input nodes to f123. (Order does not matter.) | [
"def f198(a0, a1):\n a = a0 + -8 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -8",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = f6(values[3], values[5])\n values[7] = C7\... | [
"def f198(a0, a1):\n a = a0 + -8 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -8",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = f6(values[3], values[5])\n values[7] = C7\... | 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. | 200 | 0.1 | 0.25 | 5 | 119 |
12 | {
"answer": [
"f103",
"f35"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f104"
},
"question": "List the immediate input nodes to f104. (Order does not matter.)",
"task_id": "local-seed12-t00000-task_parents-f104",
"task_type": "task_parents"
} | [
"f103",
"f35"
] | List the immediate input nodes to f104. (Order does not matter.) | [
"def f199(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] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n ... | [
"def f199(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] = 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. | 200 | 0.1 | 0.25 | 5 | 120 |
12 | {
"answer": [
"C25",
"f20"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f69"
},
"question": "List the immediate input nodes to f69. (Order does not matter.)",
"task_id": "local-seed12-t00001-task_parents-f69",
"task_type": "task_parents"
} | [
"C25",
"f20"
] | List the immediate input nodes to f69. (Order does not matter.) | [
"def f199(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] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n ... | [
"def f199(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] = 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. | 200 | 0.1 | 0.25 | 5 | 121 |
12 | {
"answer": [
"K115",
"f29"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f143"
},
"question": "List the immediate input nodes to f143. (Order does not matter.)",
"task_id": "local-seed12-t00002-task_parents-f143",
"task_type": "task_parents"
} | [
"K115",
"f29"
] | List the immediate input nodes to f143. (Order does not matter.) | [
"def f199(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] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n ... | [
"def f199(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] = 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. | 200 | 0.1 | 0.25 | 5 | 122 |
12 | {
"answer": [
"K27",
"f108"
],
"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-seed12-t00003-task_parents-f112",
"task_type": "task_parents"
} | [
"K27",
"f108"
] | List the immediate input nodes to f112. (Order does not matter.) | [
"def f199(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] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n ... | [
"def f199(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] = 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. | 200 | 0.1 | 0.25 | 5 | 123 |
12 | {
"answer": [
"f112",
"f143"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f144"
},
"question": "List the immediate input nodes to f144. (Order does not matter.)",
"task_id": "local-seed12-t00004-task_parents-f144",
"task_type": "task_parents"
} | [
"f112",
"f143"
] | List the immediate input nodes to f144. (Order does not matter.) | [
"def f199(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] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n ... | [
"def f199(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] = 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. | 200 | 0.1 | 0.25 | 5 | 124 |
12 | {
"answer": [
"C18",
"K54"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f85"
},
"question": "List the immediate input nodes to f85. (Order does not matter.)",
"task_id": "local-seed12-t00005-task_parents-f85",
"task_type": "task_parents"
} | [
"C18",
"K54"
] | List the immediate input nodes to f85. (Order does not matter.) | [
"def f199(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] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n ... | [
"def f199(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] = 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. | 200 | 0.1 | 0.25 | 5 | 125 |
12 | {
"answer": [
"f29",
"f39"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f50"
},
"question": "List the immediate input nodes to f50. (Order does not matter.)",
"task_id": "local-seed12-t00006-task_parents-f50",
"task_type": "task_parents"
} | [
"f29",
"f39"
] | List the immediate input nodes to f50. (Order does not matter.) | [
"def f199(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] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n ... | [
"def f199(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] = 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. | 200 | 0.1 | 0.25 | 5 | 126 |
12 | {
"answer": [
"C18",
"C48"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f89"
},
"question": "List the immediate input nodes to f89. (Order does not matter.)",
"task_id": "local-seed12-t00007-task_parents-f89",
"task_type": "task_parents"
} | [
"C18",
"C48"
] | List the immediate input nodes to f89. (Order does not matter.) | [
"def f199(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] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n ... | [
"def f199(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] = 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. | 200 | 0.1 | 0.25 | 5 | 127 |
12 | {
"answer": [
"C18",
"C18"
],
"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-seed12-t00008-task_parents-f21",
"task_type": "task_parents"
} | [
"C18",
"C18"
] | List the immediate input nodes to f21. (Order does not matter.) | [
"def f199(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] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n ... | [
"def f199(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] = 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. | 200 | 0.1 | 0.25 | 5 | 128 |
12 | {
"answer": [
"C18",
"f68"
],
"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-seed12-t00009-task_parents-f88",
"task_type": "task_parents"
} | [
"C18",
"f68"
] | List the immediate input nodes to f88. (Order does not matter.) | [
"def f199(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] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n ... | [
"def f199(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] = 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. | 200 | 0.1 | 0.25 | 5 | 129 |
13 | {
"answer": [
"C3",
"f43"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f66"
},
"question": "List the immediate input nodes to f66. (Order does not matter.)",
"task_id": "local-seed13-t00000-task_parents-f66",
"task_type": "task_parents"
} | [
"C3",
"f43"
] | List the immediate input nodes to f66. (Order does not matter.) | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 1) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 1) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 130 |
13 | {
"answer": [
"C37",
"f16"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f70"
},
"question": "List the immediate input nodes to f70. (Order does not matter.)",
"task_id": "local-seed13-t00001-task_parents-f70",
"task_type": "task_parents"
} | [
"C37",
"f16"
] | List the immediate input nodes to f70. (Order does not matter.) | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 1) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 1) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 131 |
13 | {
"answer": [
"f114",
"f81"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f146"
},
"question": "List the immediate input nodes to f146. (Order does not matter.)",
"task_id": "local-seed13-t00002-task_parents-f146",
"task_type": "task_parents"
} | [
"f114",
"f81"
] | List the immediate input nodes to f146. (Order does not matter.) | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 1) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 1) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 132 |
13 | {
"answer": [
"f50",
"f6"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f188"
},
"question": "List the immediate input nodes to f188. (Order does not matter.)",
"task_id": "local-seed13-t00003-task_parents-f188",
"task_type": "task_parents"
} | [
"f50",
"f6"
] | List the immediate input nodes to f188. (Order does not matter.) | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 1) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 1) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 133 |
13 | {
"answer": [
"f114",
"f81"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f146"
},
"question": "List the immediate input nodes to f146. (Order does not matter.)",
"task_id": "local-seed13-t00004-task_parents-f146",
"task_type": "task_parents"
} | [
"f114",
"f81"
] | List the immediate input nodes to f146. (Order does not matter.) | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 1) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 1) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 134 |
13 | {
"answer": [
"C17",
"f87"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f169"
},
"question": "List the immediate input nodes to f169. (Order does not matter.)",
"task_id": "local-seed13-t00005-task_parents-f169",
"task_type": "task_parents"
} | [
"C17",
"f87"
] | List the immediate input nodes to f169. (Order does not matter.) | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 1) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 1) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 135 |
13 | {
"answer": [
"f148",
"f16"
],
"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-seed13-t00006-task_parents-f178",
"task_type": "task_parents"
} | [
"f148",
"f16"
] | List the immediate input nodes to f178. (Order does not matter.) | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 1) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 1) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 136 |
13 | {
"answer": [
"f117",
"f87"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f184"
},
"question": "List the immediate input nodes to f184. (Order does not matter.)",
"task_id": "local-seed13-t00007-task_parents-f184",
"task_type": "task_parents"
} | [
"f117",
"f87"
] | List the immediate input nodes to f184. (Order does not matter.) | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 1) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 1) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 137 |
13 | {
"answer": [
"K19",
"f8"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f53"
},
"question": "List the immediate input nodes to f53. (Order does not matter.)",
"task_id": "local-seed13-t00008-task_parents-f53",
"task_type": "task_parents"
} | [
"K19",
"f8"
] | List the immediate input nodes to f53. (Order does not matter.) | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 1) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 1) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 138 |
13 | {
"answer": [
"f77",
"f88"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f137"
},
"question": "List the immediate input nodes to f137. (Order does not matter.)",
"task_id": "local-seed13-t00009-task_parents-f137",
"task_type": "task_parents"
} | [
"f77",
"f88"
] | List the immediate input nodes to f137. (Order does not matter.) | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 1) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 1) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 139 |
14 | {
"answer": [
"C13",
"K19"
],
"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-seed14-t00000-task_parents-f34",
"task_type": "task_parents"
} | [
"C13",
"K19"
] | List the immediate input nodes to f34. (Order does not matter.) | [
"def f199(a0, a1):\n t = (a0 * 31 + a1 * 17 + 14) % 38 + 0\n if t % 2 == 0:\n return t // 2\n else:\n return t + 11",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] =... | [
"def f199(a0, a1):\n t = (a0 * 31 + a1 * 17 + 14) % 38 + 0\n if t % 2 == 0:\n return t // 2\n else:\n return t + 11",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] =... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 140 |
14 | {
"answer": [
"K19",
"f80"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f130"
},
"question": "List the immediate input nodes to f130. (Order does not matter.)",
"task_id": "local-seed14-t00001-task_parents-f130",
"task_type": "task_parents"
} | [
"K19",
"f80"
] | List the immediate input nodes to f130. (Order does not matter.) | [
"def f199(a0, a1):\n t = (a0 * 31 + a1 * 17 + 14) % 38 + 0\n if t % 2 == 0:\n return t // 2\n else:\n return t + 11",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] =... | [
"def f199(a0, a1):\n t = (a0 * 31 + a1 * 17 + 14) % 38 + 0\n if t % 2 == 0:\n return t // 2\n else:\n return t + 11",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] =... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 141 |
14 | {
"answer": [
"K143",
"f61"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f148"
},
"question": "List the immediate input nodes to f148. (Order does not matter.)",
"task_id": "local-seed14-t00002-task_parents-f148",
"task_type": "task_parents"
} | [
"K143",
"f61"
] | List the immediate input nodes to f148. (Order does not matter.) | [
"def f199(a0, a1):\n t = (a0 * 31 + a1 * 17 + 14) % 38 + 0\n if t % 2 == 0:\n return t // 2\n else:\n return t + 11",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] =... | [
"def f199(a0, a1):\n t = (a0 * 31 + a1 * 17 + 14) % 38 + 0\n if t % 2 == 0:\n return t // 2\n else:\n return t + 11",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] =... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 142 |
14 | {
"answer": [
"f125",
"f159"
],
"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-seed14-t00003-task_parents-f161",
"task_type": "task_parents"
} | [
"f125",
"f159"
] | List the immediate input nodes to f161. (Order does not matter.) | [
"def f199(a0, a1):\n t = (a0 * 31 + a1 * 17 + 14) % 38 + 0\n if t % 2 == 0:\n return t // 2\n else:\n return t + 11",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] =... | [
"def f199(a0, a1):\n t = (a0 * 31 + a1 * 17 + 14) % 38 + 0\n if t % 2 == 0:\n return t // 2\n else:\n return t + 11",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] =... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 143 |
14 | {
"answer": [
"f106",
"f56"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f139"
},
"question": "List the immediate input nodes to f139. (Order does not matter.)",
"task_id": "local-seed14-t00004-task_parents-f139",
"task_type": "task_parents"
} | [
"f106",
"f56"
] | List the immediate input nodes to f139. (Order does not matter.) | [
"def f199(a0, a1):\n t = (a0 * 31 + a1 * 17 + 14) % 38 + 0\n if t % 2 == 0:\n return t // 2\n else:\n return t + 11",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] =... | [
"def f199(a0, a1):\n t = (a0 * 31 + a1 * 17 + 14) % 38 + 0\n if t % 2 == 0:\n return t // 2\n else:\n return t + 11",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] =... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 144 |
14 | {
"answer": [
"f106",
"f108"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f110"
},
"question": "List the immediate input nodes to f110. (Order does not matter.)",
"task_id": "local-seed14-t00005-task_parents-f110",
"task_type": "task_parents"
} | [
"f106",
"f108"
] | List the immediate input nodes to f110. (Order does not matter.) | [
"def f199(a0, a1):\n t = (a0 * 31 + a1 * 17 + 14) % 38 + 0\n if t % 2 == 0:\n return t // 2\n else:\n return t + 11",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] =... | [
"def f199(a0, a1):\n t = (a0 * 31 + a1 * 17 + 14) % 38 + 0\n if t % 2 == 0:\n return t // 2\n else:\n return t + 11",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] =... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 145 |
14 | {
"answer": [
"f148",
"f172"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f191"
},
"question": "List the immediate input nodes to f191. (Order does not matter.)",
"task_id": "local-seed14-t00006-task_parents-f191",
"task_type": "task_parents"
} | [
"f148",
"f172"
] | List the immediate input nodes to f191. (Order does not matter.) | [
"def f199(a0, a1):\n t = (a0 * 31 + a1 * 17 + 14) % 38 + 0\n if t % 2 == 0:\n return t // 2\n else:\n return t + 11",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] =... | [
"def f199(a0, a1):\n t = (a0 * 31 + a1 * 17 + 14) % 38 + 0\n if t % 2 == 0:\n return t // 2\n else:\n return t + 11",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] =... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 146 |
14 | {
"answer": [
"K41",
"f16"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f57"
},
"question": "List the immediate input nodes to f57. (Order does not matter.)",
"task_id": "local-seed14-t00007-task_parents-f57",
"task_type": "task_parents"
} | [
"K41",
"f16"
] | List the immediate input nodes to f57. (Order does not matter.) | [
"def f199(a0, a1):\n t = (a0 * 31 + a1 * 17 + 14) % 38 + 0\n if t % 2 == 0:\n return t // 2\n else:\n return t + 11",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] =... | [
"def f199(a0, a1):\n t = (a0 * 31 + a1 * 17 + 14) % 38 + 0\n if t % 2 == 0:\n return t // 2\n else:\n return t + 11",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] =... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 147 |
14 | {
"answer": [
"C10",
"f51"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f60"
},
"question": "List the immediate input nodes to f60. (Order does not matter.)",
"task_id": "local-seed14-t00008-task_parents-f60",
"task_type": "task_parents"
} | [
"C10",
"f51"
] | List the immediate input nodes to f60. (Order does not matter.) | [
"def f199(a0, a1):\n t = (a0 * 31 + a1 * 17 + 14) % 38 + 0\n if t % 2 == 0:\n return t // 2\n else:\n return t + 11",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] =... | [
"def f199(a0, a1):\n t = (a0 * 31 + a1 * 17 + 14) % 38 + 0\n if t % 2 == 0:\n return t // 2\n else:\n return t + 11",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] =... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 148 |
14 | {
"answer": [
"K74",
"f57"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f157"
},
"question": "List the immediate input nodes to f157. (Order does not matter.)",
"task_id": "local-seed14-t00009-task_parents-f157",
"task_type": "task_parents"
} | [
"K74",
"f57"
] | List the immediate input nodes to f157. (Order does not matter.) | [
"def f199(a0, a1):\n t = (a0 * 31 + a1 * 17 + 14) % 38 + 0\n if t % 2 == 0:\n return t // 2\n else:\n return t + 11",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] =... | [
"def f199(a0, a1):\n t = (a0 * 31 + a1 * 17 + 14) % 38 + 0\n if t % 2 == 0:\n return t // 2\n else:\n return t + 11",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] =... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 149 |
15 | {
"answer": [
"f25",
"f51"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f59"
},
"question": "List the immediate input nodes to f59. (Order does not matter.)",
"task_id": "local-seed15-t00000-task_parents-f59",
"task_type": "task_parents"
} | [
"f25",
"f51"
] | List the immediate input nodes to f59. (Order does not matter.) | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 7) + 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] = K1(values[0], values[0])\n values[2] = C2\n values[3] = f3(val... | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 7) + 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] = K1(values[0], values[0])\n values[2] = C2\n values[3] = f3(val... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 150 |
15 | {
"answer": [
"C6",
"f3"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f7"
},
"question": "List the immediate input nodes to f7. (Order does not matter.)",
"task_id": "local-seed15-t00001-task_parents-f7",
"task_type": "task_parents"
} | [
"C6",
"f3"
] | List the immediate input nodes to f7. (Order does not matter.) | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 7) + 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] = K1(values[0], values[0])\n values[2] = C2\n values[3] = f3(val... | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 7) + 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] = K1(values[0], values[0])\n values[2] = C2\n values[3] = f3(val... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 151 |
15 | {
"answer": [
"f86",
"f91"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f124"
},
"question": "List the immediate input nodes to f124. (Order does not matter.)",
"task_id": "local-seed15-t00002-task_parents-f124",
"task_type": "task_parents"
} | [
"f86",
"f91"
] | List the immediate input nodes to f124. (Order does not matter.) | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 7) + 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] = K1(values[0], values[0])\n values[2] = C2\n values[3] = f3(val... | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 7) + 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] = K1(values[0], values[0])\n values[2] = C2\n values[3] = f3(val... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 152 |
15 | {
"answer": [
"f112",
"f124"
],
"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-seed15-t00003-task_parents-f171",
"task_type": "task_parents"
} | [
"f112",
"f124"
] | List the immediate input nodes to f171. (Order does not matter.) | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 7) + 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] = K1(values[0], values[0])\n values[2] = C2\n values[3] = f3(val... | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 7) + 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] = K1(values[0], values[0])\n values[2] = C2\n values[3] = f3(val... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 153 |
15 | {
"answer": [
"C0",
"K11"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f13"
},
"question": "List the immediate input nodes to f13. (Order does not matter.)",
"task_id": "local-seed15-t00004-task_parents-f13",
"task_type": "task_parents"
} | [
"C0",
"K11"
] | List the immediate input nodes to f13. (Order does not matter.) | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 7) + 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] = K1(values[0], values[0])\n values[2] = C2\n values[3] = f3(val... | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 7) + 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] = K1(values[0], values[0])\n values[2] = C2\n values[3] = f3(val... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 154 |
15 | {
"answer": [
"f25",
"f28"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f50"
},
"question": "List the immediate input nodes to f50. (Order does not matter.)",
"task_id": "local-seed15-t00005-task_parents-f50",
"task_type": "task_parents"
} | [
"f25",
"f28"
] | List the immediate input nodes to f50. (Order does not matter.) | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 7) + 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] = K1(values[0], values[0])\n values[2] = C2\n values[3] = f3(val... | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 7) + 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] = K1(values[0], values[0])\n values[2] = C2\n values[3] = f3(val... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 155 |
15 | {
"answer": [
"f24",
"f27"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f66"
},
"question": "List the immediate input nodes to f66. (Order does not matter.)",
"task_id": "local-seed15-t00006-task_parents-f66",
"task_type": "task_parents"
} | [
"f24",
"f27"
] | List the immediate input nodes to f66. (Order does not matter.) | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 7) + 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] = K1(values[0], values[0])\n values[2] = C2\n values[3] = f3(val... | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 7) + 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] = K1(values[0], values[0])\n values[2] = C2\n values[3] = f3(val... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 156 |
15 | {
"answer": [
"f3",
"f3"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f8"
},
"question": "List the immediate input nodes to f8. (Order does not matter.)",
"task_id": "local-seed15-t00007-task_parents-f8",
"task_type": "task_parents"
} | [
"f3",
"f3"
] | List the immediate input nodes to f8. (Order does not matter.) | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 7) + 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] = K1(values[0], values[0])\n values[2] = C2\n values[3] = f3(val... | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 7) + 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] = K1(values[0], values[0])\n values[2] = C2\n values[3] = f3(val... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 157 |
15 | {
"answer": [
"f13",
"f13"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f24"
},
"question": "List the immediate input nodes to f24. (Order does not matter.)",
"task_id": "local-seed15-t00008-task_parents-f24",
"task_type": "task_parents"
} | [
"f13",
"f13"
] | List the immediate input nodes to f24. (Order does not matter.) | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 7) + 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] = K1(values[0], values[0])\n values[2] = C2\n values[3] = f3(val... | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 7) + 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] = K1(values[0], values[0])\n values[2] = C2\n values[3] = f3(val... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 158 |
15 | {
"answer": [
"C179",
"f3"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f185"
},
"question": "List the immediate input nodes to f185. (Order does not matter.)",
"task_id": "local-seed15-t00009-task_parents-f185",
"task_type": "task_parents"
} | [
"C179",
"f3"
] | List the immediate input nodes to f185. (Order does not matter.) | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 7) + 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] = K1(values[0], values[0])\n values[2] = C2\n values[3] = f3(val... | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 7) + 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] = K1(values[0], values[0])\n values[2] = C2\n values[3] = f3(val... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 159 |
16 | {
"answer": [
"f24",
"f68"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f82"
},
"question": "List the immediate input nodes to f82. (Order does not matter.)",
"task_id": "local-seed16-t00000-task_parents-f82",
"task_type": "task_parents"
} | [
"f24",
"f68"
] | List the immediate input nodes to f82. (Order does not matter.) | [
"def f197(a0, a1):\n a = a0 + -5 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -5",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[1], values[1])\n values[3] = C3\n values[4] = K4(values[1], values[1])\n values[5] = f5(values[0], values[... | [
"def f197(a0, a1):\n a = a0 + -5 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -5",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[1], values[1])\n values[3] = C3\n values[4] = K4(values[1], values[1])\n values[5] = f5(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. | 200 | 0.1 | 0.25 | 5 | 160 |
16 | {
"answer": [
"C57",
"C97"
],
"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-seed16-t00001-task_parents-f105",
"task_type": "task_parents"
} | [
"C57",
"C97"
] | List the immediate input nodes to f105. (Order does not matter.) | [
"def f197(a0, a1):\n a = a0 + -5 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -5",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[1], values[1])\n values[3] = C3\n values[4] = K4(values[1], values[1])\n values[5] = f5(values[0], values[... | [
"def f197(a0, a1):\n a = a0 + -5 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -5",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[1], values[1])\n values[3] = C3\n values[4] = K4(values[1], values[1])\n values[5] = f5(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. | 200 | 0.1 | 0.25 | 5 | 161 |
16 | {
"answer": [
"C1",
"C14"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f107"
},
"question": "List the immediate input nodes to f107. (Order does not matter.)",
"task_id": "local-seed16-t00002-task_parents-f107",
"task_type": "task_parents"
} | [
"C1",
"C14"
] | List the immediate input nodes to f107. (Order does not matter.) | [
"def f197(a0, a1):\n a = a0 + -5 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -5",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[1], values[1])\n values[3] = C3\n values[4] = K4(values[1], values[1])\n values[5] = f5(values[0], values[... | [
"def f197(a0, a1):\n a = a0 + -5 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -5",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[1], values[1])\n values[3] = C3\n values[4] = K4(values[1], values[1])\n values[5] = f5(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. | 200 | 0.1 | 0.25 | 5 | 162 |
16 | {
"answer": [
"C57",
"f22"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f69"
},
"question": "List the immediate input nodes to f69. (Order does not matter.)",
"task_id": "local-seed16-t00003-task_parents-f69",
"task_type": "task_parents"
} | [
"C57",
"f22"
] | List the immediate input nodes to f69. (Order does not matter.) | [
"def f197(a0, a1):\n a = a0 + -5 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -5",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[1], values[1])\n values[3] = C3\n values[4] = K4(values[1], values[1])\n values[5] = f5(values[0], values[... | [
"def f197(a0, a1):\n a = a0 + -5 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -5",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[1], values[1])\n values[3] = C3\n values[4] = K4(values[1], values[1])\n values[5] = f5(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. | 200 | 0.1 | 0.25 | 5 | 163 |
16 | {
"answer": [
"C23",
"f28"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f93"
},
"question": "List the immediate input nodes to f93. (Order does not matter.)",
"task_id": "local-seed16-t00004-task_parents-f93",
"task_type": "task_parents"
} | [
"C23",
"f28"
] | List the immediate input nodes to f93. (Order does not matter.) | [
"def f197(a0, a1):\n a = a0 + -5 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -5",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[1], values[1])\n values[3] = C3\n values[4] = K4(values[1], values[1])\n values[5] = f5(values[0], values[... | [
"def f197(a0, a1):\n a = a0 + -5 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -5",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[1], values[1])\n values[3] = C3\n values[4] = K4(values[1], values[1])\n values[5] = f5(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. | 200 | 0.1 | 0.25 | 5 | 164 |
16 | {
"answer": [
"f32",
"f60"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f61"
},
"question": "List the immediate input nodes to f61. (Order does not matter.)",
"task_id": "local-seed16-t00005-task_parents-f61",
"task_type": "task_parents"
} | [
"f32",
"f60"
] | List the immediate input nodes to f61. (Order does not matter.) | [
"def f197(a0, a1):\n a = a0 + -5 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -5",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[1], values[1])\n values[3] = C3\n values[4] = K4(values[1], values[1])\n values[5] = f5(values[0], values[... | [
"def f197(a0, a1):\n a = a0 + -5 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -5",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[1], values[1])\n values[3] = C3\n values[4] = K4(values[1], values[1])\n values[5] = f5(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. | 200 | 0.1 | 0.25 | 5 | 165 |
16 | {
"answer": [
"C91",
"f47"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f100"
},
"question": "List the immediate input nodes to f100. (Order does not matter.)",
"task_id": "local-seed16-t00006-task_parents-f100",
"task_type": "task_parents"
} | [
"C91",
"f47"
] | List the immediate input nodes to f100. (Order does not matter.) | [
"def f197(a0, a1):\n a = a0 + -5 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -5",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[1], values[1])\n values[3] = C3\n values[4] = K4(values[1], values[1])\n values[5] = f5(values[0], values[... | [
"def f197(a0, a1):\n a = a0 + -5 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -5",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[1], values[1])\n values[3] = C3\n values[4] = K4(values[1], values[1])\n values[5] = f5(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. | 200 | 0.1 | 0.25 | 5 | 166 |
16 | {
"answer": [
"C0",
"C1"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f5"
},
"question": "List the immediate input nodes to f5. (Order does not matter.)",
"task_id": "local-seed16-t00007-task_parents-f5",
"task_type": "task_parents"
} | [
"C0",
"C1"
] | List the immediate input nodes to f5. (Order does not matter.) | [
"def f197(a0, a1):\n a = a0 + -5 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -5",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[1], values[1])\n values[3] = C3\n values[4] = K4(values[1], values[1])\n values[5] = f5(values[0], values[... | [
"def f197(a0, a1):\n a = a0 + -5 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -5",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[1], values[1])\n values[3] = C3\n values[4] = K4(values[1], values[1])\n values[5] = f5(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. | 200 | 0.1 | 0.25 | 5 | 167 |
16 | {
"answer": [
"f13",
"f82"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f92"
},
"question": "List the immediate input nodes to f92. (Order does not matter.)",
"task_id": "local-seed16-t00008-task_parents-f92",
"task_type": "task_parents"
} | [
"f13",
"f82"
] | List the immediate input nodes to f92. (Order does not matter.) | [
"def f197(a0, a1):\n a = a0 + -5 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -5",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[1], values[1])\n values[3] = C3\n values[4] = K4(values[1], values[1])\n values[5] = f5(values[0], values[... | [
"def f197(a0, a1):\n a = a0 + -5 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -5",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[1], values[1])\n values[3] = C3\n values[4] = K4(values[1], values[1])\n values[5] = f5(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. | 200 | 0.1 | 0.25 | 5 | 168 |
16 | {
"answer": [
"f66",
"f71"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f177"
},
"question": "List the immediate input nodes to f177. (Order does not matter.)",
"task_id": "local-seed16-t00009-task_parents-f177",
"task_type": "task_parents"
} | [
"f66",
"f71"
] | List the immediate input nodes to f177. (Order does not matter.) | [
"def f197(a0, a1):\n a = a0 + -5 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -5",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[1], values[1])\n values[3] = C3\n values[4] = K4(values[1], values[1])\n values[5] = f5(values[0], values[... | [
"def f197(a0, a1):\n a = a0 + -5 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -5",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[1], values[1])\n values[3] = C3\n values[4] = K4(values[1], values[1])\n values[5] = f5(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. | 200 | 0.1 | 0.25 | 5 | 169 |
17 | {
"answer": [
"C52",
"f126"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f189"
},
"question": "List the immediate input nodes to f189. (Order does not matter.)",
"task_id": "local-seed17-t00000-task_parents-f189",
"task_type": "task_parents"
} | [
"C52",
"f126"
] | List the immediate input nodes to f189. (Order does not matter.) | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 3) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 3) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 170 |
17 | {
"answer": [
"K66",
"f82"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f153"
},
"question": "List the immediate input nodes to f153. (Order does not matter.)",
"task_id": "local-seed17-t00001-task_parents-f153",
"task_type": "task_parents"
} | [
"K66",
"f82"
] | List the immediate input nodes to f153. (Order does not matter.) | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 3) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 3) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 171 |
17 | {
"answer": [
"C7",
"f71"
],
"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-seed17-t00002-task_parents-f116",
"task_type": "task_parents"
} | [
"C7",
"f71"
] | List the immediate input nodes to f116. (Order does not matter.) | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 3) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 3) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 172 |
17 | {
"answer": [
"C60",
"f100"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f137"
},
"question": "List the immediate input nodes to f137. (Order does not matter.)",
"task_id": "local-seed17-t00003-task_parents-f137",
"task_type": "task_parents"
} | [
"C60",
"f100"
] | List the immediate input nodes to f137. (Order does not matter.) | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 3) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 3) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 173 |
17 | {
"answer": [
"f101",
"f55"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f111"
},
"question": "List the immediate input nodes to f111. (Order does not matter.)",
"task_id": "local-seed17-t00004-task_parents-f111",
"task_type": "task_parents"
} | [
"f101",
"f55"
] | List the immediate input nodes to f111. (Order does not matter.) | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 3) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 3) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 174 |
17 | {
"answer": [
"f34",
"f36"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f70"
},
"question": "List the immediate input nodes to f70. (Order does not matter.)",
"task_id": "local-seed17-t00005-task_parents-f70",
"task_type": "task_parents"
} | [
"f34",
"f36"
] | List the immediate input nodes to f70. (Order does not matter.) | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 3) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 3) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 175 |
17 | {
"answer": [
"f138",
"f153"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f197"
},
"question": "List the immediate input nodes to f197. (Order does not matter.)",
"task_id": "local-seed17-t00006-task_parents-f197",
"task_type": "task_parents"
} | [
"f138",
"f153"
] | List the immediate input nodes to f197. (Order does not matter.) | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 3) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 3) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 176 |
17 | {
"answer": [
"C7",
"f36"
],
"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-seed17-t00007-task_parents-f105",
"task_type": "task_parents"
} | [
"C7",
"f36"
] | List the immediate input nodes to f105. (Order does not matter.) | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 3) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 3) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 177 |
17 | {
"answer": [
"C8",
"f36"
],
"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-seed17-t00008-task_parents-f46",
"task_type": "task_parents"
} | [
"C8",
"f36"
] | List the immediate input nodes to f46. (Order does not matter.) | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 3) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 3) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 178 |
17 | {
"answer": [
"C8",
"C8"
],
"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-seed17-t00009-task_parents-f17",
"task_type": "task_parents"
} | [
"C8",
"C8"
] | List the immediate input nodes to f17. (Order does not matter.) | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 3) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 3) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 179 |
18 | {
"answer": [
"C0",
"C38"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f73"
},
"question": "List the immediate input nodes to f73. (Order does not matter.)",
"task_id": "local-seed18-t00000-task_parents-f73",
"task_type": "task_parents"
} | [
"C0",
"C38"
] | List the immediate input nodes to f73. (Order does not matter.) | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 8) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 8) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 180 |
18 | {
"answer": [
"f27",
"f51"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f54"
},
"question": "List the immediate input nodes to f54. (Order does not matter.)",
"task_id": "local-seed18-t00001-task_parents-f54",
"task_type": "task_parents"
} | [
"f27",
"f51"
] | List the immediate input nodes to f54. (Order does not matter.) | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 8) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 8) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 181 |
18 | {
"answer": [
"C166",
"f115"
],
"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-seed18-t00002-task_parents-f175",
"task_type": "task_parents"
} | [
"C166",
"f115"
] | List the immediate input nodes to f175. (Order does not matter.) | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 8) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 8) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 182 |
18 | {
"answer": [
"f88",
"f99"
],
"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-seed18-t00003-task_parents-f129",
"task_type": "task_parents"
} | [
"f88",
"f99"
] | List the immediate input nodes to f129. (Order does not matter.) | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 8) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 8) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 183 |
18 | {
"answer": [
"K82",
"f43"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f96"
},
"question": "List the immediate input nodes to f96. (Order does not matter.)",
"task_id": "local-seed18-t00004-task_parents-f96",
"task_type": "task_parents"
} | [
"K82",
"f43"
] | List the immediate input nodes to f96. (Order does not matter.) | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 8) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 8) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 184 |
18 | {
"answer": [
"f18",
"f66"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f78"
},
"question": "List the immediate input nodes to f78. (Order does not matter.)",
"task_id": "local-seed18-t00005-task_parents-f78",
"task_type": "task_parents"
} | [
"f18",
"f66"
] | List the immediate input nodes to f78. (Order does not matter.) | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 8) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 8) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 185 |
18 | {
"answer": [
"C5",
"f152"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f193"
},
"question": "List the immediate input nodes to f193. (Order does not matter.)",
"task_id": "local-seed18-t00006-task_parents-f193",
"task_type": "task_parents"
} | [
"C5",
"f152"
] | List the immediate input nodes to f193. (Order does not matter.) | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 8) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 8) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 186 |
18 | {
"answer": [
"f27",
"f50"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f194"
},
"question": "List the immediate input nodes to f194. (Order does not matter.)",
"task_id": "local-seed18-t00007-task_parents-f194",
"task_type": "task_parents"
} | [
"f27",
"f50"
] | List the immediate input nodes to f194. (Order does not matter.) | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 8) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 8) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 187 |
18 | {
"answer": [
"C0",
"C38"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f73"
},
"question": "List the immediate input nodes to f73. (Order does not matter.)",
"task_id": "local-seed18-t00008-task_parents-f73",
"task_type": "task_parents"
} | [
"C0",
"C38"
] | List the immediate input nodes to f73. (Order does not matter.) | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 8) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 8) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 188 |
18 | {
"answer": [
"C0",
"f96"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f188"
},
"question": "List the immediate input nodes to f188. (Order does not matter.)",
"task_id": "local-seed18-t00009-task_parents-f188",
"task_type": "task_parents"
} | [
"C0",
"f96"
] | List the immediate input nodes to f188. (Order does not matter.) | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 8) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | [
"def f199(a0, a1):\n acc = 0\n out = []\n base = abs(a1 + 17 + 8) + 1\n for x in a0:\n acc = (acc + x) % base\n out.append(acc)\n return out",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = C3\n values[4] = C4\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 200 | 0.1 | 0.25 | 5 | 189 |
19 | {
"answer": [
"f18",
"f9"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f20"
},
"question": "List the immediate input nodes to f20. (Order does not matter.)",
"task_id": "local-seed19-t00000-task_parents-f20",
"task_type": "task_parents"
} | [
"f18",
"f9"
] | List the immediate input nodes to f20. (Order does not matter.) | [
"def f199(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-8:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = f3(values[0], values[1])\n values[4] = f4(values[1], values[1])\n values[5] = C5\n values[6] = f... | [
"def f199(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-8:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = f3(values[0], values[1])\n values[4] = f4(values[1], values[1])\n values[5] = C5\n values[6] = f... | 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. | 200 | 0.1 | 0.25 | 5 | 190 |
19 | {
"answer": [
"f124",
"f188"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f197"
},
"question": "List the immediate input nodes to f197. (Order does not matter.)",
"task_id": "local-seed19-t00001-task_parents-f197",
"task_type": "task_parents"
} | [
"f124",
"f188"
] | List the immediate input nodes to f197. (Order does not matter.) | [
"def f199(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-8:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = f3(values[0], values[1])\n values[4] = f4(values[1], values[1])\n values[5] = C5\n values[6] = f... | [
"def f199(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-8:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = f3(values[0], values[1])\n values[4] = f4(values[1], values[1])\n values[5] = C5\n values[6] = f... | 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. | 200 | 0.1 | 0.25 | 5 | 191 |
19 | {
"answer": [
"f24",
"f46"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f50"
},
"question": "List the immediate input nodes to f50. (Order does not matter.)",
"task_id": "local-seed19-t00002-task_parents-f50",
"task_type": "task_parents"
} | [
"f24",
"f46"
] | List the immediate input nodes to f50. (Order does not matter.) | [
"def f199(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-8:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = f3(values[0], values[1])\n values[4] = f4(values[1], values[1])\n values[5] = C5\n values[6] = f... | [
"def f199(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-8:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = f3(values[0], values[1])\n values[4] = f4(values[1], values[1])\n values[5] = C5\n values[6] = f... | 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. | 200 | 0.1 | 0.25 | 5 | 192 |
19 | {
"answer": [
"C76",
"f123"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f193"
},
"question": "List the immediate input nodes to f193. (Order does not matter.)",
"task_id": "local-seed19-t00003-task_parents-f193",
"task_type": "task_parents"
} | [
"C76",
"f123"
] | List the immediate input nodes to f193. (Order does not matter.) | [
"def f199(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-8:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = f3(values[0], values[1])\n values[4] = f4(values[1], values[1])\n values[5] = C5\n values[6] = f... | [
"def f199(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-8:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = f3(values[0], values[1])\n values[4] = f4(values[1], values[1])\n values[5] = C5\n values[6] = f... | 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. | 200 | 0.1 | 0.25 | 5 | 193 |
19 | {
"answer": [
"f43",
"f54"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f85"
},
"question": "List the immediate input nodes to f85. (Order does not matter.)",
"task_id": "local-seed19-t00004-task_parents-f85",
"task_type": "task_parents"
} | [
"f43",
"f54"
] | List the immediate input nodes to f85. (Order does not matter.) | [
"def f199(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-8:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = f3(values[0], values[1])\n values[4] = f4(values[1], values[1])\n values[5] = C5\n values[6] = f... | [
"def f199(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-8:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = f3(values[0], values[1])\n values[4] = f4(values[1], values[1])\n values[5] = C5\n values[6] = f... | 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. | 200 | 0.1 | 0.25 | 5 | 194 |
19 | {
"answer": [
"f129",
"f33"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f151"
},
"question": "List the immediate input nodes to f151. (Order does not matter.)",
"task_id": "local-seed19-t00005-task_parents-f151",
"task_type": "task_parents"
} | [
"f129",
"f33"
] | List the immediate input nodes to f151. (Order does not matter.) | [
"def f199(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-8:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = f3(values[0], values[1])\n values[4] = f4(values[1], values[1])\n values[5] = C5\n values[6] = f... | [
"def f199(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-8:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = f3(values[0], values[1])\n values[4] = f4(values[1], values[1])\n values[5] = C5\n values[6] = f... | 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. | 200 | 0.1 | 0.25 | 5 | 195 |
19 | {
"answer": [
"f74",
"f85"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f135"
},
"question": "List the immediate input nodes to f135. (Order does not matter.)",
"task_id": "local-seed19-t00006-task_parents-f135",
"task_type": "task_parents"
} | [
"f74",
"f85"
] | List the immediate input nodes to f135. (Order does not matter.) | [
"def f199(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-8:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = f3(values[0], values[1])\n values[4] = f4(values[1], values[1])\n values[5] = C5\n values[6] = f... | [
"def f199(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-8:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = f3(values[0], values[1])\n values[4] = f4(values[1], values[1])\n values[5] = C5\n values[6] = f... | 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. | 200 | 0.1 | 0.25 | 5 | 196 |
19 | {
"answer": [
"f117",
"f126"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f199"
},
"question": "List the immediate input nodes to f199. (Order does not matter.)",
"task_id": "local-seed19-t00007-task_parents-f199",
"task_type": "task_parents"
} | [
"f117",
"f126"
] | List the immediate input nodes to f199. (Order does not matter.) | [
"def f199(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-8:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = f3(values[0], values[1])\n values[4] = f4(values[1], values[1])\n values[5] = C5\n values[6] = f... | [
"def f199(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-8:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = f3(values[0], values[1])\n values[4] = f4(values[1], values[1])\n values[5] = C5\n values[6] = f... | 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. | 200 | 0.1 | 0.25 | 5 | 197 |
19 | {
"answer": [
"C76",
"f116"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f117"
},
"question": "List the immediate input nodes to f117. (Order does not matter.)",
"task_id": "local-seed19-t00008-task_parents-f117",
"task_type": "task_parents"
} | [
"C76",
"f116"
] | List the immediate input nodes to f117. (Order does not matter.) | [
"def f199(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-8:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = f3(values[0], values[1])\n values[4] = f4(values[1], values[1])\n values[5] = C5\n values[6] = f... | [
"def f199(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-8:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = f3(values[0], values[1])\n values[4] = f4(values[1], values[1])\n values[5] = C5\n values[6] = f... | 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. | 200 | 0.1 | 0.25 | 5 | 198 |
19 | {
"answer": [
"f46",
"f57"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f63"
},
"question": "List the immediate input nodes to f63. (Order does not matter.)",
"task_id": "local-seed19-t00009-task_parents-f63",
"task_type": "task_parents"
} | [
"f46",
"f57"
] | List the immediate input nodes to f63. (Order does not matter.) | [
"def f199(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-8:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = f3(values[0], values[1])\n values[4] = f4(values[1], values[1])\n values[5] = C5\n values[6] = f... | [
"def f199(a0, a1):\n core = a0.strip().lower()\n t = core + str(a1)\n return t[-8:]",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = C2\n values[3] = f3(values[0], values[1])\n values[4] = f4(values[1], values[1])\n values[5] = C5\n values[6] = f... | 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. | 200 | 0.1 | 0.25 | 5 | 199 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.