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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
0 | {
"answer": [
"C8",
"K21"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f75"
},
"question": "List the immediate input nodes to f75. (Order does not matter.)",
"task_id": "local-seed0-t00000-task_parents-f75",
"task_type": "task_parents"
} | [
"C8",
"K21"
] | List the immediate input nodes to f75. (Order does not matter.) | [
"def f97(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] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n ... | [
"def f97(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] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 100 | 0.1 | 0.25 | 5 | 0 |
0 | {
"answer": [
"K21",
"f54"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f79"
},
"question": "List the immediate input nodes to f79. (Order does not matter.)",
"task_id": "local-seed0-t00001-task_parents-f79",
"task_type": "task_parents"
} | [
"K21",
"f54"
] | List the immediate input nodes to f79. (Order does not matter.) | [
"def f97(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] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n ... | [
"def f97(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] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 100 | 0.1 | 0.25 | 5 | 1 |
0 | {
"answer": [
"C3",
"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-seed0-t00002-task_parents-f17",
"task_type": "task_parents"
} | [
"C3",
"C8"
] | List the immediate input nodes to f17. (Order does not matter.) | [
"def f97(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] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n ... | [
"def f97(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] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 100 | 0.1 | 0.25 | 5 | 2 |
0 | {
"answer": [
"C0",
"f55"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f56"
},
"question": "List the immediate input nodes to f56. (Order does not matter.)",
"task_id": "local-seed0-t00003-task_parents-f56",
"task_type": "task_parents"
} | [
"C0",
"f55"
] | List the immediate input nodes to f56. (Order does not matter.) | [
"def f97(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] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n ... | [
"def f97(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] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 100 | 0.1 | 0.25 | 5 | 3 |
0 | {
"answer": [
"K86",
"f54"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f95"
},
"question": "List the immediate input nodes to f95. (Order does not matter.)",
"task_id": "local-seed0-t00004-task_parents-f95",
"task_type": "task_parents"
} | [
"K86",
"f54"
] | List the immediate input nodes to f95. (Order does not matter.) | [
"def f97(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] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n ... | [
"def f97(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] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 100 | 0.1 | 0.25 | 5 | 4 |
0 | {
"answer": [
"f34",
"f42"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f91"
},
"question": "List the immediate input nodes to f91. (Order does not matter.)",
"task_id": "local-seed0-t00005-task_parents-f91",
"task_type": "task_parents"
} | [
"f34",
"f42"
] | List the immediate input nodes to f91. (Order does not matter.) | [
"def f97(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] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n ... | [
"def f97(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] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 100 | 0.1 | 0.25 | 5 | 5 |
0 | {
"answer": [
"C2",
"f19"
],
"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-seed0-t00006-task_parents-f77",
"task_type": "task_parents"
} | [
"C2",
"f19"
] | List the immediate input nodes to f77. (Order does not matter.) | [
"def f97(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] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n ... | [
"def f97(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] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 100 | 0.1 | 0.25 | 5 | 6 |
0 | {
"answer": [
"f30",
"f42"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f62"
},
"question": "List the immediate input nodes to f62. (Order does not matter.)",
"task_id": "local-seed0-t00007-task_parents-f62",
"task_type": "task_parents"
} | [
"f30",
"f42"
] | List the immediate input nodes to f62. (Order does not matter.) | [
"def f97(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] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n ... | [
"def f97(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] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 100 | 0.1 | 0.25 | 5 | 7 |
0 | {
"answer": [
"f34",
"f39"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f90"
},
"question": "List the immediate input nodes to f90. (Order does not matter.)",
"task_id": "local-seed0-t00008-task_parents-f90",
"task_type": "task_parents"
} | [
"f34",
"f39"
] | List the immediate input nodes to f90. (Order does not matter.) | [
"def f97(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] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n ... | [
"def f97(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] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 100 | 0.1 | 0.25 | 5 | 8 |
0 | {
"answer": [
"f37",
"f42"
],
"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-seed0-t00009-task_parents-f70",
"task_type": "task_parents"
} | [
"f37",
"f42"
] | List the immediate input nodes to f70. (Order does not matter.) | [
"def f97(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] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n ... | [
"def f97(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] = C2\n values[3] = C3\n values[4] = C4\n values[5] = C5\n values[6] = C6\n values[7] = C7\n values[8] = C8\n ... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 100 | 0.1 | 0.25 | 5 | 9 |
1 | {
"answer": [
"C0",
"C0"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f16"
},
"question": "List the immediate input nodes to f16. (Order does not matter.)",
"task_id": "local-seed1-t00000-task_parents-f16",
"task_type": "task_parents"
} | [
"C0",
"C0"
] | List the immediate input nodes to f16. (Order does not matter.) | [
"def f99(a0, a1):\n a = a0 + -9 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -9",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[0], values[0])\n values[3] = f3(values[0], values[0])\n values[4] = C4\n values[5] = f5(values[1], values[0... | [
"def f99(a0, a1):\n a = a0 + -9 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -9",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[0], values[0])\n values[3] = f3(values[0], values[0])\n values[4] = C4\n values[5] = f5(values[1], values[0... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 100 | 0.1 | 0.25 | 5 | 10 |
1 | {
"answer": [
"f24",
"f42"
],
"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-seed1-t00001-task_parents-f66",
"task_type": "task_parents"
} | [
"f24",
"f42"
] | List the immediate input nodes to f66. (Order does not matter.) | [
"def f99(a0, a1):\n a = a0 + -9 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -9",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[0], values[0])\n values[3] = f3(values[0], values[0])\n values[4] = C4\n values[5] = f5(values[1], values[0... | [
"def f99(a0, a1):\n a = a0 + -9 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -9",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[0], values[0])\n values[3] = f3(values[0], values[0])\n values[4] = C4\n values[5] = f5(values[1], values[0... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 100 | 0.1 | 0.25 | 5 | 11 |
1 | {
"answer": [
"f19",
"f38"
],
"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-seed1-t00002-task_parents-f98",
"task_type": "task_parents"
} | [
"f19",
"f38"
] | List the immediate input nodes to f98. (Order does not matter.) | [
"def f99(a0, a1):\n a = a0 + -9 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -9",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[0], values[0])\n values[3] = f3(values[0], values[0])\n values[4] = C4\n values[5] = f5(values[1], values[0... | [
"def f99(a0, a1):\n a = a0 + -9 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -9",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[0], values[0])\n values[3] = f3(values[0], values[0])\n values[4] = C4\n values[5] = f5(values[1], values[0... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 100 | 0.1 | 0.25 | 5 | 12 |
1 | {
"answer": [
"f19",
"f55"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f94"
},
"question": "List the immediate input nodes to f94. (Order does not matter.)",
"task_id": "local-seed1-t00003-task_parents-f94",
"task_type": "task_parents"
} | [
"f19",
"f55"
] | List the immediate input nodes to f94. (Order does not matter.) | [
"def f99(a0, a1):\n a = a0 + -9 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -9",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[0], values[0])\n values[3] = f3(values[0], values[0])\n values[4] = C4\n values[5] = f5(values[1], values[0... | [
"def f99(a0, a1):\n a = a0 + -9 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -9",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[0], values[0])\n values[3] = f3(values[0], values[0])\n values[4] = C4\n values[5] = f5(values[1], values[0... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 100 | 0.1 | 0.25 | 5 | 13 |
1 | {
"answer": [
"C0",
"C0"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f10"
},
"question": "List the immediate input nodes to f10. (Order does not matter.)",
"task_id": "local-seed1-t00004-task_parents-f10",
"task_type": "task_parents"
} | [
"C0",
"C0"
] | List the immediate input nodes to f10. (Order does not matter.) | [
"def f99(a0, a1):\n a = a0 + -9 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -9",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[0], values[0])\n values[3] = f3(values[0], values[0])\n values[4] = C4\n values[5] = f5(values[1], values[0... | [
"def f99(a0, a1):\n a = a0 + -9 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -9",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[0], values[0])\n values[3] = f3(values[0], values[0])\n values[4] = C4\n values[5] = f5(values[1], values[0... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 100 | 0.1 | 0.25 | 5 | 14 |
1 | {
"answer": [
"C1",
"f19"
],
"meta": {
"arity": 2,
"min_arity": 2,
"ordered": false,
"target": "f31"
},
"question": "List the immediate input nodes to f31. (Order does not matter.)",
"task_id": "local-seed1-t00005-task_parents-f31",
"task_type": "task_parents"
} | [
"C1",
"f19"
] | List the immediate input nodes to f31. (Order does not matter.) | [
"def f99(a0, a1):\n a = a0 + -9 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -9",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[0], values[0])\n values[3] = f3(values[0], values[0])\n values[4] = C4\n values[5] = f5(values[1], values[0... | [
"def f99(a0, a1):\n a = a0 + -9 > a1\n b = a0 % 2 == 1\n return a and b or a1 < -9",
"def compute_all():\n values = {}\n values[0] = C0\n values[1] = C1\n values[2] = K2(values[0], values[0])\n values[3] = f3(values[0], values[0])\n values[4] = C4\n values[5] = f5(values[1], values[0... | You are given a Python module and a question about its dependency graph. Answer strictly in the requested format.
Return your answer as JSON only.
- If the answer is a list, return a JSON array of strings.
- If the answer is an integer, return a JSON number.
- If the answer is Yes/No, return a JSON string: "Yes" or "No".
- Do not include extra keys or commentary. | 100 | 0.1 | 0.25 | 5 | 15 |
End of preview. Expand
in Data Studio
README.md exists but content is empty.
- Downloads last month
- 91