ClarusC64 commited on
Commit
a49f37d
·
verified ·
1 Parent(s): 1694667

Upload 4 files

Browse files
Files changed (4) hide show
  1. AF-RECOND-01-scorer-v0.2.py +198 -0
  2. README.md +71 -0
  3. test.csv +81 -0
  4. train (1).csv +0 -0
AF-RECOND-01-scorer-v0.2.py ADDED
@@ -0,0 +1,198 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ #!/usr/bin/env python3
2
+ """AF-RECOND-01 v0.2 strict JSON final-answer scorer.
3
+
4
+ Usage:
5
+ python scorer.py --predictions predictions.csv --gold data/test.csv
6
+
7
+ Predictions CSV columns: id,prediction
8
+ Gold CSV columns: id,family,expected_answer
9
+ Optional gold column: initial_state
10
+
11
+ Exit codes: 0 = complete, well-formed submission; 1 = missing or invalid
12
+ predictions; 2 = input or configuration error. Wrong but well-formed
13
+ answers do not change the exit code.
14
+ """
15
+ import argparse
16
+ import collections
17
+ import csv
18
+ import hashlib
19
+ import json
20
+ import pathlib
21
+ import sys
22
+
23
+ VERSION = "0.2"
24
+
25
+
26
+ def sha256(path):
27
+ digest = hashlib.sha256()
28
+ with open(path, "rb") as stream:
29
+ for chunk in iter(lambda: stream.read(65536), b""):
30
+ digest.update(chunk)
31
+ return digest.hexdigest()
32
+
33
+
34
+ def reject_duplicate_keys(pairs):
35
+ result = {}
36
+ for key, value in pairs:
37
+ if key in result:
38
+ raise ValueError(f"Duplicate JSON key: {key}")
39
+ result[key] = value
40
+ return result
41
+
42
+
43
+ def reject_constant(value):
44
+ raise ValueError(f"Nonstandard JSON constant: {value}")
45
+
46
+
47
+ def parse_json(value):
48
+ return json.loads(
49
+ value,
50
+ object_pairs_hook=reject_duplicate_keys,
51
+ parse_constant=reject_constant,
52
+ )
53
+
54
+
55
+ def parse_answer(value):
56
+ if not isinstance(value, str):
57
+ return None, "invalid_format"
58
+ try:
59
+ parsed = parse_json(value)
60
+ if not isinstance(parsed, dict):
61
+ return None, "invalid_format"
62
+ return parsed, None
63
+ except (ValueError, TypeError, RecursionError, OverflowError):
64
+ return None, "invalid_format"
65
+
66
+
67
+ def strict_equal(left, right):
68
+ if type(left) is not type(right):
69
+ return False
70
+ if isinstance(left, dict):
71
+ return (left.keys() == right.keys()
72
+ and all(strict_equal(left[k], right[k]) for k in left))
73
+ if isinstance(left, list):
74
+ return (len(left) == len(right)
75
+ and all(strict_equal(a, b) for a, b in zip(left, right)))
76
+ return left == right
77
+
78
+
79
+ def read_csv(path, required):
80
+ with open(path, encoding="utf-8-sig", newline="") as handle:
81
+ reader = csv.DictReader(handle)
82
+ if not reader.fieldnames or not set(required).issubset(reader.fieldnames):
83
+ raise ValueError(f"{path}: missing required columns: {', '.join(required)}")
84
+ rows = {}
85
+ for row in reader:
86
+ key = (row.get("id") or "").strip()
87
+ if not key:
88
+ raise ValueError(f"{path}: blank ID")
89
+ if key in rows:
90
+ raise ValueError(f"{path}: duplicate ID {key}")
91
+ rows[key] = row
92
+ return rows
93
+
94
+
95
+ def main(argv=None):
96
+ parser = argparse.ArgumentParser(description=__doc__)
97
+ parser.add_argument("--predictions", type=pathlib.Path, required=True)
98
+ parser.add_argument("--gold", type=pathlib.Path, default=pathlib.Path("data/test.csv"))
99
+ parser.add_argument("--output", type=pathlib.Path, default=pathlib.Path("scores.json"))
100
+ parser.add_argument("--include-answers", action="store_true")
101
+ args = parser.parse_args(argv)
102
+ try:
103
+ gold = read_csv(args.gold, ["id", "family", "expected_answer"])
104
+ predictions = read_csv(args.predictions, ["id", "prediction"])
105
+ unknown = sorted(set(predictions) - set(gold))
106
+ if unknown:
107
+ raise ValueError(f"Unknown prediction IDs: {', '.join(unknown[:10])}")
108
+ if not gold:
109
+ raise ValueError("Gold CSV contains no records")
110
+
111
+ expected_values = {}
112
+ initial_values = {}
113
+ for key, row in gold.items():
114
+ expected, error = parse_answer(row.get("expected_answer"))
115
+ if error:
116
+ raise ValueError(f"Invalid gold answer for {key}")
117
+ expected_values[key] = expected
118
+ initial = (row.get("initial_state") or "").strip()
119
+ if initial:
120
+ state, error = parse_answer(initial)
121
+ if error:
122
+ raise ValueError(f"Invalid gold initial_state for {key}")
123
+ initial_values[key] = state
124
+
125
+ stats = collections.defaultdict(
126
+ lambda: {"total": 0, "correct": 0, "missing": 0, "invalid_format": 0}
127
+ )
128
+ details = []
129
+ for key, row in gold.items():
130
+ family = row["family"]
131
+ item = stats[family]
132
+ item["total"] += 1
133
+ raw = (predictions.get(key, {}).get("prediction") or "").strip()
134
+ missing = not raw
135
+ actual, error = (parse_answer(raw) if not missing else (None, None))
136
+ invalid = not missing and error is not None
137
+ correct = (not missing and not invalid
138
+ and strict_equal(actual, expected_values[key]))
139
+ item["correct"] += int(correct)
140
+ item["missing"] += int(missing)
141
+ item["invalid_format"] += int(invalid)
142
+ entry = {"id": key, "family": family, "correct": correct,
143
+ "missing": missing, "invalid_format": invalid}
144
+ if args.include_answers:
145
+ entry["prediction"] = raw
146
+ entry["expected_answer"] = expected_values[key]
147
+ details.append(entry)
148
+
149
+ total = len(gold)
150
+ correct = sum(s["correct"] for s in stats.values())
151
+ missing = sum(s["missing"] for s in stats.values())
152
+ invalid = sum(s["invalid_format"] for s in stats.values())
153
+ stale_correct = sum(
154
+ strict_equal(initial, expected_values[key])
155
+ for key, initial in initial_values.items()
156
+ )
157
+ report = {
158
+ "dataset": "AF-RECOND-01",
159
+ "scorer_version": VERSION,
160
+ "total": total,
161
+ "correct": correct,
162
+ "accuracy": round(correct / total, 6),
163
+ "complete": missing == 0 and invalid == 0,
164
+ "missing": missing,
165
+ "invalid_format": invalid,
166
+ "by_family": {
167
+ family: {**s, "accuracy": round(s["correct"] / s["total"], 6)}
168
+ for family, s in sorted(stats.items())
169
+ },
170
+ "baselines": {
171
+ "stale_initial_state": {
172
+ "applicable": len(initial_values),
173
+ "correct": stale_correct,
174
+ }
175
+ },
176
+ "sha256": {
177
+ "gold": sha256(args.gold),
178
+ "predictions": sha256(args.predictions),
179
+ "scorer": sha256(pathlib.Path(__file__)),
180
+ },
181
+ "scope": "Final-answer accuracy only; not evidence of internal frame release",
182
+ "details": details,
183
+ }
184
+ args.output.parent.mkdir(parents=True, exist_ok=True)
185
+ args.output.write_text(
186
+ json.dumps(report, indent=2, ensure_ascii=False, allow_nan=False) + "\n",
187
+ encoding="utf-8",
188
+ )
189
+ print(json.dumps({k: v for k, v in report.items() if k != "details"},
190
+ indent=2, ensure_ascii=False))
191
+ return 1 if missing or invalid else 0
192
+ except (OSError, ValueError, csv.Error, RecursionError) as error:
193
+ print(f"Error: {error}", file=sys.stderr)
194
+ return 2
195
+
196
+
197
+ if __name__ == "__main__":
198
+ sys.exit(main())
README.md CHANGED
@@ -1,3 +1,74 @@
1
  ---
 
 
2
  license: cc-by-4.0
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
3
  ---
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
  ---
2
+ language:
3
+ - en
4
  license: cc-by-4.0
5
+ task_categories:
6
+ - question-answering
7
+ pretty_name: "AIRFRAME — Obstruction & Constraint Revision Benchmark"
8
+ tags:
9
+ - airframe
10
+ - apertience
11
+ - relational-reasoning
12
+ - constraint-revision
13
+ - synthetic-data
14
+ - reasoning-evaluation
15
+ size_categories:
16
+ - n<1K
17
+ configs:
18
+ - config_name: default
19
+ data_files:
20
+ - split: train
21
+ path: data/train.csv
22
+ - split: test
23
+ path: data/test.csv
24
  ---
25
+
26
+ # AIRFRAME — Obstruction & Constraint Revision Benchmark
27
+
28
+ **AF-RECOND-01 v0.1** is a synthetic reasoning dataset with 400 generated challenges (320 train / 80 test). It asks systems to respond to changed constraints rather than repeat an earlier solution.
29
+
30
+ ## Four challenge families
31
+
32
+ | Family | Records | Task |
33
+ |---|---:|---|
34
+ | Constraint invalidation | 100 | Recompute the least-cost directed route after an edge disappears |
35
+ | Minimal reconditioning | 100 | Choose an option and the least costly necessary requirement relaxations |
36
+ | Compound obstruction | 100 | Choose a feasible pair under joint resource, duration, and exclusion constraints |
37
+ | Nonclosure recovery | 100 | Count and identify alternative simple paths after node exclusion |
38
+
39
+ Each family has 80 training and 20 test instances. The data uses bounded finite problems with exact answers. It does **not** establish internal frame release, general agentic recovery, or novel intelligence mechanisms.
40
+
41
+ ## Files
42
+
43
+ - `data/train.csv` — public training examples with gold answers
44
+ - `data/test.csv` — public test examples with gold answers, **not a blind benchmark**
45
+ - `scorer.py` — deterministic final-answer evaluator
46
+ - `generate.py` — deterministic generator, seed 20261115
47
+
48
+ ## Columns
49
+
50
+ `id`, `family`, `challenge`, `expected_answer`, `initial_state`, `obstruction`, `instance`, `scoring_rule`.
51
+
52
+ The `challenge` contains the task and input instance. `expected_answer` is a JSON object serialized as a CSV string. `instance` contains machine-readable source parameters. `initial_state` may be `null` for families without a single prior solution. `obstruction` identifies the constraint being revised or imposed.
53
+
54
+ ## Run the scorer
55
+
56
+ Create `predictions.csv` with columns `id,prediction`. The prediction cell must contain a valid JSON object matching the requested output shape. Use CSV quoting around JSON values.
57
+
58
+ ```bash
59
+ python scorer.py --predictions predictions.csv --gold data/test.csv
60
+ ```
61
+
62
+ The scorer writes `scores.json` with total and per-family accuracy, missing and invalid-format counts, and SHA-256 hashes. It does not disclose gold answers in its output unless `--include-answers` is passed. Note that the public CSV already contains answers.
63
+
64
+ ## Interpretation and limits
65
+
66
+ A correct response demonstrates final-answer accuracy on the specific finite problem. It does not prove the model detected an obstruction internally or performed the intended reasoning. A programmatic solver can solve these tasks. The train/test split is stratified, but examples share generator families and may admit heuristics. Do not use this release to claim superiority over existing reasoning benchmarks or to infer internal representations.
67
+
68
+ ## Reproducibility
69
+
70
+ Run `python generate.py` to recreate the two CSV splits. The generator uses only Python's standard library. The dataset is offered under CC BY 4.0; source-code files can be separately licensed under MIT if their copyright holder chooses.
71
+
72
+ ## Citation
73
+
74
+ AIRFRAME, *AF-RECOND-01: Obstruction & Constraint Revision Benchmark*, version 0.1 (2026). Cite the dataset repository URL and version used.
test.csv ADDED
@@ -0,0 +1,81 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ id,family,challenge,expected_answer,initial_state,obstruction,instance,scoring_rule
2
+ AF-RECOND-01-0191,minimal_reconditioning,"Each option has three capability values. An option must meet each requirement unless that requirement is relaxed. Select an option and relaxation indices minimizing (sum of relaxation costs, number of relaxed requirements, option price, option ID, relaxation-index list), in that order. Return JSON {""option"":ID,""relax"":[zero-based indices],""total_cost"":option price plus relaxation costs}. Data: {""options"":[{""id"":""P0"",""price"":6,""values"":[3,5,1]},{""id"":""P1"",""price"":18,""values"":[2,10,5]},{""id"":""P2"",""price"":12,""values"":[9,1,10]},{""id"":""P3"",""price"":15,""values"":[2,1,3]},{""id"":""P4"",""price"":8,""values"":[10,9,3]}],""relaxation_costs"":[7,5,3],""requirements"":[8,6,6]}","{""option"":""P4"",""relax"":[2],""total_cost"":11}",null,"{""requirements"":[8,6,6]}","{""options"":[{""id"":""P0"",""price"":6,""values"":[3,5,1]},{""id"":""P1"",""price"":18,""values"":[2,10,5]},{""id"":""P2"",""price"":12,""values"":[9,1,10]},{""id"":""P3"",""price"":15,""values"":[2,1,3]},{""id"":""P4"",""price"":8,""values"":[10,9,3]}],""relaxation_costs"":[7,5,3],""requirements"":[8,6,6]}",exact_json
3
+ AF-RECOND-01-0014,constraint_invalidation,"A directed weighted graph has lost removed_edge. Find the minimum-cost remaining route from start to end. Break cost ties by lexicographically smallest complete path. Return JSON {""cost"":integer,""path"":[node,...]}. Data: {""edges"":[[""A"",""B"",3],[""A"",""C"",5],[""A"",""E"",5],[""A"",""F"",4],[""B"",""C"",1],[""B"",""D"",3],[""B"",""E"",7],[""C"",""D"",5],[""C"",""F"",6],[""C"",""G"",9],[""D"",""E"",3],[""E"",""F"",1],[""E"",""G"",1]],""end"":""G"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G""],""removed_edge"":[""A"",""E""],""start"":""A""}","{""cost"":10,""path"":[""A"",""B"",""D"",""E"",""G""]}","{""cost"":6,""path"":[""A"",""E"",""G""]}","{""removed_edge"":[""A"",""E""]}","{""edges"":[[""A"",""B"",3],[""A"",""C"",5],[""A"",""E"",5],[""A"",""F"",4],[""B"",""C"",1],[""B"",""D"",3],[""B"",""E"",7],[""C"",""D"",5],[""C"",""F"",6],[""C"",""G"",9],[""D"",""E"",3],[""E"",""F"",1],[""E"",""G"",1]],""end"":""G"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G""],""removed_edge"":[""A"",""E""],""start"":""A""}",exact_json
4
+ AF-RECOND-01-0005,constraint_invalidation,"A directed weighted graph has lost removed_edge. Find the minimum-cost remaining route from start to end. Break cost ties by lexicographically smallest complete path. Return JSON {""cost"":integer,""path"":[node,...]}. Data: {""edges"":[[""A"",""B"",4],[""A"",""D"",6],[""A"",""F"",5],[""B"",""E"",9],[""B"",""G"",6],[""C"",""E"",8],[""C"",""F"",7],[""D"",""E"",4],[""D"",""G"",2],[""E"",""F"",9],[""F"",""G"",2]],""end"":""G"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G""],""removed_edge"":[""A"",""F""],""start"":""A""}","{""cost"":8,""path"":[""A"",""D"",""G""]}","{""cost"":7,""path"":[""A"",""F"",""G""]}","{""removed_edge"":[""A"",""F""]}","{""edges"":[[""A"",""B"",4],[""A"",""D"",6],[""A"",""F"",5],[""B"",""E"",9],[""B"",""G"",6],[""C"",""E"",8],[""C"",""F"",7],[""D"",""E"",4],[""D"",""G"",2],[""E"",""F"",9],[""F"",""G"",2]],""end"":""G"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G""],""removed_edge"":[""A"",""F""],""start"":""A""}",exact_json
5
+ AF-RECOND-01-0320,nonclosure_recovery,"After excluding blocked nodes, enumerate all simple directed paths from start to end. Sort by (number of nodes in path, lexicographic node sequence). Return JSON {""count"":number of paths,""first_two"":[first two paths]}. Data: {""blocked"":[""E""],""edges"":[[""A"",""B""],[""A"",""C""],[""A"",""D""],[""A"",""E""],[""A"",""F""],[""B"",""D""],[""B"",""E""],[""B"",""F""],[""D"",""E""],[""D"",""F""],[""E"",""F""]],""end"":""F"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F""],""start"":""A""}","{""count"":4,""first_two"":[[""A"",""F""],[""A"",""B"",""F""]]}",null,"{""blocked"":[""E""]}","{""blocked"":[""E""],""edges"":[[""A"",""B""],[""A"",""C""],[""A"",""D""],[""A"",""E""],[""A"",""F""],[""B"",""D""],[""B"",""E""],[""B"",""F""],[""D"",""E""],[""D"",""F""],[""E"",""F""]],""end"":""F"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F""],""start"":""A""}",exact_json
6
+ AF-RECOND-01-0137,minimal_reconditioning,"Each option has three capability values. An option must meet each requirement unless that requirement is relaxed. Select an option and relaxation indices minimizing (sum of relaxation costs, number of relaxed requirements, option price, option ID, relaxation-index list), in that order. Return JSON {""option"":ID,""relax"":[zero-based indices],""total_cost"":option price plus relaxation costs}. Data: {""options"":[{""id"":""P0"",""price"":10,""values"":[2,3,8]},{""id"":""P1"",""price"":11,""values"":[4,5,9]},{""id"":""P2"",""price"":2,""values"":[2,4,4]},{""id"":""P3"",""price"":2,""values"":[6,3,9]},{""id"":""P4"",""price"":4,""values"":[2,9,10]}],""relaxation_costs"":[4,12,4],""requirements"":[5,8,7]}","{""option"":""P4"",""relax"":[0],""total_cost"":8}",null,"{""requirements"":[5,8,7]}","{""options"":[{""id"":""P0"",""price"":10,""values"":[2,3,8]},{""id"":""P1"",""price"":11,""values"":[4,5,9]},{""id"":""P2"",""price"":2,""values"":[2,4,4]},{""id"":""P3"",""price"":2,""values"":[6,3,9]},{""id"":""P4"",""price"":4,""values"":[2,9,10]}],""relaxation_costs"":[4,12,4],""requirements"":[5,8,7]}",exact_json
7
+ AF-RECOND-01-0351,nonclosure_recovery,"After excluding blocked nodes, enumerate all simple directed paths from start to end. Sort by (number of nodes in path, lexicographic node sequence). Return JSON {""count"":number of paths,""first_two"":[first two paths]}. Data: {""blocked"":[""E""],""edges"":[[""A"",""B""],[""A"",""C""],[""A"",""E""],[""A"",""F""],[""B"",""C""],[""B"",""D""],[""B"",""E""],[""B"",""F""],[""C"",""F""],[""D"",""E""]],""end"":""F"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F""],""start"":""A""}","{""count"":4,""first_two"":[[""A"",""F""],[""A"",""B"",""F""]]}",null,"{""blocked"":[""E""]}","{""blocked"":[""E""],""edges"":[[""A"",""B""],[""A"",""C""],[""A"",""E""],[""A"",""F""],[""B"",""C""],[""B"",""D""],[""B"",""E""],[""B"",""F""],[""C"",""F""],[""D"",""E""]],""end"":""F"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F""],""start"":""A""}",exact_json
8
+ AF-RECOND-01-0349,nonclosure_recovery,"After excluding blocked nodes, enumerate all simple directed paths from start to end. Sort by (number of nodes in path, lexicographic node sequence). Return JSON {""count"":number of paths,""first_two"":[first two paths]}. Data: {""blocked"":[""F""],""edges"":[[""A"",""B""],[""A"",""E""],[""A"",""F""],[""A"",""G""],[""B"",""D""],[""B"",""F""],[""B"",""G""],[""B"",""H""],[""C"",""D""],[""D"",""G""],[""E"",""F""],[""E"",""H""],[""F"",""H""],[""G"",""H""]],""end"":""H"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G"",""H""],""start"":""A""}","{""count"":5,""first_two"":[[""A"",""B"",""H""],[""A"",""E"",""H""]]}",null,"{""blocked"":[""F""]}","{""blocked"":[""F""],""edges"":[[""A"",""B""],[""A"",""E""],[""A"",""F""],[""A"",""G""],[""B"",""D""],[""B"",""F""],[""B"",""G""],[""B"",""H""],[""C"",""D""],[""D"",""G""],[""E"",""F""],[""E"",""H""],[""F"",""H""],[""G"",""H""]],""end"":""H"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G"",""H""],""start"":""A""}",exact_json
9
+ AF-RECOND-01-0266,compound_obstruction,"Choose one option from A and one from B. Their summed resource and duration must not exceed the caps, and forbidden_pairs cannot be chosen. Minimize total cost; break ties by A ID then B ID. Return JSON {""A"":ID,""B"":ID,""cost"":integer}. Data: {""duration_cap"":8,""forbidden_pairs"":[[""A1"",""B3""]],""options_A"":[{""cost"":13,""duration"":4,""id"":""A0"",""resource"":6},{""cost"":2,""duration"":1,""id"":""A1"",""resource"":2},{""cost"":6,""duration"":4,""id"":""A2"",""resource"":1},{""cost"":15,""duration"":1,""id"":""A3"",""resource"":7}],""options_B"":[{""cost"":15,""duration"":6,""id"":""B0"",""resource"":4},{""cost"":12,""duration"":2,""id"":""B1"",""resource"":2},{""cost"":12,""duration"":4,""id"":""B2"",""resource"":5},{""cost"":2,""duration"":2,""id"":""B3"",""resource"":3}],""resource_cap"":10}","{""A"":""A2"",""B"":""B3"",""cost"":8}","{""A"":""A1"",""B"":""B3""}","{""forbidden_pairs"":[[""A1"",""B3""]]}","{""duration_cap"":8,""forbidden_pairs"":[[""A1"",""B3""]],""options_A"":[{""cost"":13,""duration"":4,""id"":""A0"",""resource"":6},{""cost"":2,""duration"":1,""id"":""A1"",""resource"":2},{""cost"":6,""duration"":4,""id"":""A2"",""resource"":1},{""cost"":15,""duration"":1,""id"":""A3"",""resource"":7}],""options_B"":[{""cost"":15,""duration"":6,""id"":""B0"",""resource"":4},{""cost"":12,""duration"":2,""id"":""B1"",""resource"":2},{""cost"":12,""duration"":4,""id"":""B2"",""resource"":5},{""cost"":2,""duration"":2,""id"":""B3"",""resource"":3}],""resource_cap"":10}",exact_json
10
+ AF-RECOND-01-0024,constraint_invalidation,"A directed weighted graph has lost removed_edge. Find the minimum-cost remaining route from start to end. Break cost ties by lexicographically smallest complete path. Return JSON {""cost"":integer,""path"":[node,...]}. Data: {""edges"":[[""A"",""B"",2],[""B"",""C"",2],[""B"",""D"",2],[""C"",""E"",2],[""D"",""F"",9],[""E"",""F"",8]],""end"":""F"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F""],""removed_edge"":[""B"",""D""],""start"":""A""}","{""cost"":14,""path"":[""A"",""B"",""C"",""E"",""F""]}","{""cost"":13,""path"":[""A"",""B"",""D"",""F""]}","{""removed_edge"":[""B"",""D""]}","{""edges"":[[""A"",""B"",2],[""B"",""C"",2],[""B"",""D"",2],[""C"",""E"",2],[""D"",""F"",9],[""E"",""F"",8]],""end"":""F"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F""],""removed_edge"":[""B"",""D""],""start"":""A""}",exact_json
11
+ AF-RECOND-01-0310,nonclosure_recovery,"After excluding blocked nodes, enumerate all simple directed paths from start to end. Sort by (number of nodes in path, lexicographic node sequence). Return JSON {""count"":number of paths,""first_two"":[first two paths]}. Data: {""blocked"":[""G""],""edges"":[[""A"",""B""],[""A"",""F""],[""A"",""G""],[""A"",""H""],[""B"",""D""],[""B"",""E""],[""B"",""F""],[""B"",""G""],[""B"",""H""],[""C"",""D""],[""C"",""F""],[""C"",""H""],[""D"",""F""],[""E"",""F""],[""E"",""G""],[""E"",""H""],[""F"",""G""],[""G"",""H""]],""end"":""H"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G"",""H""],""start"":""A""}","{""count"":3,""first_two"":[[""A"",""H""],[""A"",""B"",""H""]]}",null,"{""blocked"":[""G""]}","{""blocked"":[""G""],""edges"":[[""A"",""B""],[""A"",""F""],[""A"",""G""],[""A"",""H""],[""B"",""D""],[""B"",""E""],[""B"",""F""],[""B"",""G""],[""B"",""H""],[""C"",""D""],[""C"",""F""],[""C"",""H""],[""D"",""F""],[""E"",""F""],[""E"",""G""],[""E"",""H""],[""F"",""G""],[""G"",""H""]],""end"":""H"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G"",""H""],""start"":""A""}",exact_json
12
+ AF-RECOND-01-0011,constraint_invalidation,"A directed weighted graph has lost removed_edge. Find the minimum-cost remaining route from start to end. Break cost ties by lexicographically smallest complete path. Return JSON {""cost"":integer,""path"":[node,...]}. Data: {""edges"":[[""A"",""C"",8],[""A"",""G"",4],[""A"",""H"",9],[""B"",""C"",5],[""B"",""D"",4],[""B"",""E"",9],[""B"",""G"",3],[""C"",""F"",2],[""D"",""E"",3],[""D"",""H"",2],[""E"",""F"",1],[""E"",""G"",8],[""E"",""H"",8],[""F"",""G"",8],[""F"",""H"",6],[""G"",""H"",3]],""end"":""H"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G"",""H""],""removed_edge"":[""G"",""H""],""start"":""A""}","{""cost"":9,""path"":[""A"",""H""]}","{""cost"":7,""path"":[""A"",""G"",""H""]}","{""removed_edge"":[""G"",""H""]}","{""edges"":[[""A"",""C"",8],[""A"",""G"",4],[""A"",""H"",9],[""B"",""C"",5],[""B"",""D"",4],[""B"",""E"",9],[""B"",""G"",3],[""C"",""F"",2],[""D"",""E"",3],[""D"",""H"",2],[""E"",""F"",1],[""E"",""G"",8],[""E"",""H"",8],[""F"",""G"",8],[""F"",""H"",6],[""G"",""H"",3]],""end"":""H"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G"",""H""],""removed_edge"":[""G"",""H""],""start"":""A""}",exact_json
13
+ AF-RECOND-01-0136,minimal_reconditioning,"Each option has three capability values. An option must meet each requirement unless that requirement is relaxed. Select an option and relaxation indices minimizing (sum of relaxation costs, number of relaxed requirements, option price, option ID, relaxation-index list), in that order. Return JSON {""option"":ID,""relax"":[zero-based indices],""total_cost"":option price plus relaxation costs}. Data: {""options"":[{""id"":""P0"",""price"":2,""values"":[9,5,3]},{""id"":""P1"",""price"":12,""values"":[3,10,8]},{""id"":""P2"",""price"":14,""values"":[8,10,5]},{""id"":""P3"",""price"":19,""values"":[5,6,6]},{""id"":""P4"",""price"":17,""values"":[5,10,4]}],""relaxation_costs"":[4,7,4],""requirements"":[8,5,8]}","{""option"":""P0"",""relax"":[2],""total_cost"":6}",null,"{""requirements"":[8,5,8]}","{""options"":[{""id"":""P0"",""price"":2,""values"":[9,5,3]},{""id"":""P1"",""price"":12,""values"":[3,10,8]},{""id"":""P2"",""price"":14,""values"":[8,10,5]},{""id"":""P3"",""price"":19,""values"":[5,6,6]},{""id"":""P4"",""price"":17,""values"":[5,10,4]}],""relaxation_costs"":[4,7,4],""requirements"":[8,5,8]}",exact_json
14
+ AF-RECOND-01-0032,constraint_invalidation,"A directed weighted graph has lost removed_edge. Find the minimum-cost remaining route from start to end. Break cost ties by lexicographically smallest complete path. Return JSON {""cost"":integer,""path"":[node,...]}. Data: {""edges"":[[""A"",""B"",7],[""A"",""C"",7],[""A"",""F"",2],[""B"",""E"",8],[""B"",""F"",1],[""B"",""G"",5],[""C"",""D"",4],[""C"",""E"",1],[""C"",""F"",7],[""C"",""G"",4],[""D"",""F"",6]],""end"":""G"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G""],""removed_edge"":[""A"",""C""],""start"":""A""}","{""cost"":12,""path"":[""A"",""B"",""G""]}","{""cost"":11,""path"":[""A"",""C"",""G""]}","{""removed_edge"":[""A"",""C""]}","{""edges"":[[""A"",""B"",7],[""A"",""C"",7],[""A"",""F"",2],[""B"",""E"",8],[""B"",""F"",1],[""B"",""G"",5],[""C"",""D"",4],[""C"",""E"",1],[""C"",""F"",7],[""C"",""G"",4],[""D"",""F"",6]],""end"":""G"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G""],""removed_edge"":[""A"",""C""],""start"":""A""}",exact_json
15
+ AF-RECOND-01-0079,constraint_invalidation,"A directed weighted graph has lost removed_edge. Find the minimum-cost remaining route from start to end. Break cost ties by lexicographically smallest complete path. Return JSON {""cost"":integer,""path"":[node,...]}. Data: {""edges"":[[""A"",""B"",7],[""A"",""D"",4],[""B"",""C"",6],[""B"",""D"",8],[""B"",""F"",9],[""C"",""D"",5],[""C"",""E"",6],[""E"",""F"",8]],""end"":""F"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F""],""removed_edge"":[""B"",""F""],""start"":""A""}","{""cost"":27,""path"":[""A"",""B"",""C"",""E"",""F""]}","{""cost"":16,""path"":[""A"",""B"",""F""]}","{""removed_edge"":[""B"",""F""]}","{""edges"":[[""A"",""B"",7],[""A"",""D"",4],[""B"",""C"",6],[""B"",""D"",8],[""B"",""F"",9],[""C"",""D"",5],[""C"",""E"",6],[""E"",""F"",8]],""end"":""F"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F""],""removed_edge"":[""B"",""F""],""start"":""A""}",exact_json
16
+ AF-RECOND-01-0273,compound_obstruction,"Choose one option from A and one from B. Their summed resource and duration must not exceed the caps, and forbidden_pairs cannot be chosen. Minimize total cost; break ties by A ID then B ID. Return JSON {""A"":ID,""B"":ID,""cost"":integer}. Data: {""duration_cap"":12,""forbidden_pairs"":[[""A3"",""B2""]],""options_A"":[{""cost"":15,""duration"":2,""id"":""A0"",""resource"":2},{""cost"":12,""duration"":4,""id"":""A1"",""resource"":7},{""cost"":11,""duration"":8,""id"":""A2"",""resource"":5},{""cost"":13,""duration"":7,""id"":""A3"",""resource"":1}],""options_B"":[{""cost"":6,""duration"":8,""id"":""B0"",""resource"":2},{""cost"":9,""duration"":6,""id"":""B1"",""resource"":4},{""cost"":7,""duration"":1,""id"":""B2"",""resource"":3},{""cost"":13,""duration"":5,""id"":""B3"",""resource"":3}],""resource_cap"":6}","{""A"":""A0"",""B"":""B0"",""cost"":21}","{""A"":""A3"",""B"":""B2""}","{""forbidden_pairs"":[[""A3"",""B2""]]}","{""duration_cap"":12,""forbidden_pairs"":[[""A3"",""B2""]],""options_A"":[{""cost"":15,""duration"":2,""id"":""A0"",""resource"":2},{""cost"":12,""duration"":4,""id"":""A1"",""resource"":7},{""cost"":11,""duration"":8,""id"":""A2"",""resource"":5},{""cost"":13,""duration"":7,""id"":""A3"",""resource"":1}],""options_B"":[{""cost"":6,""duration"":8,""id"":""B0"",""resource"":2},{""cost"":9,""duration"":6,""id"":""B1"",""resource"":4},{""cost"":7,""duration"":1,""id"":""B2"",""resource"":3},{""cost"":13,""duration"":5,""id"":""B3"",""resource"":3}],""resource_cap"":6}",exact_json
17
+ AF-RECOND-01-0347,nonclosure_recovery,"After excluding blocked nodes, enumerate all simple directed paths from start to end. Sort by (number of nodes in path, lexicographic node sequence). Return JSON {""count"":number of paths,""first_two"":[first two paths]}. Data: {""blocked"":[""E""],""edges"":[[""A"",""B""],[""A"",""E""],[""A"",""F""],[""A"",""G""],[""B"",""C""],[""B"",""D""],[""C"",""D""],[""C"",""G""],[""D"",""F""],[""D"",""G""],[""E"",""F""],[""F"",""G""]],""end"":""G"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G""],""start"":""A""}","{""count"":7,""first_two"":[[""A"",""G""],[""A"",""F"",""G""]]}",null,"{""blocked"":[""E""]}","{""blocked"":[""E""],""edges"":[[""A"",""B""],[""A"",""E""],[""A"",""F""],[""A"",""G""],[""B"",""C""],[""B"",""D""],[""C"",""D""],[""C"",""G""],[""D"",""F""],[""D"",""G""],[""E"",""F""],[""F"",""G""]],""end"":""G"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G""],""start"":""A""}",exact_json
18
+ AF-RECOND-01-0164,minimal_reconditioning,"Each option has three capability values. An option must meet each requirement unless that requirement is relaxed. Select an option and relaxation indices minimizing (sum of relaxation costs, number of relaxed requirements, option price, option ID, relaxation-index list), in that order. Return JSON {""option"":ID,""relax"":[zero-based indices],""total_cost"":option price plus relaxation costs}. Data: {""options"":[{""id"":""P0"",""price"":5,""values"":[7,7,1]},{""id"":""P1"",""price"":6,""values"":[3,3,5]},{""id"":""P2"",""price"":11,""values"":[2,9,8]},{""id"":""P3"",""price"":14,""values"":[2,4,2]},{""id"":""P4"",""price"":8,""values"":[4,2,10]}],""relaxation_costs"":[8,9,9],""requirements"":[7,3,8]}","{""option"":""P2"",""relax"":[0],""total_cost"":19}",null,"{""requirements"":[7,3,8]}","{""options"":[{""id"":""P0"",""price"":5,""values"":[7,7,1]},{""id"":""P1"",""price"":6,""values"":[3,3,5]},{""id"":""P2"",""price"":11,""values"":[2,9,8]},{""id"":""P3"",""price"":14,""values"":[2,4,2]},{""id"":""P4"",""price"":8,""values"":[4,2,10]}],""relaxation_costs"":[8,9,9],""requirements"":[7,3,8]}",exact_json
19
+ AF-RECOND-01-0381,nonclosure_recovery,"After excluding blocked nodes, enumerate all simple directed paths from start to end. Sort by (number of nodes in path, lexicographic node sequence). Return JSON {""count"":number of paths,""first_two"":[first two paths]}. Data: {""blocked"":[""D""],""edges"":[[""A"",""C""],[""A"",""D""],[""A"",""E""],[""A"",""F""],[""A"",""G""],[""B"",""C""],[""B"",""D""],[""B"",""F""],[""B"",""G""],[""C"",""D""],[""C"",""E""],[""C"",""F""],[""D"",""E""],[""D"",""G""],[""E"",""F""],[""F"",""G""]],""end"":""G"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G""],""start"":""A""}","{""count"":5,""first_two"":[[""A"",""G""],[""A"",""F"",""G""]]}",null,"{""blocked"":[""D""]}","{""blocked"":[""D""],""edges"":[[""A"",""C""],[""A"",""D""],[""A"",""E""],[""A"",""F""],[""A"",""G""],[""B"",""C""],[""B"",""D""],[""B"",""F""],[""B"",""G""],[""C"",""D""],[""C"",""E""],[""C"",""F""],[""D"",""E""],[""D"",""G""],[""E"",""F""],[""F"",""G""]],""end"":""G"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G""],""start"":""A""}",exact_json
20
+ AF-RECOND-01-0192,minimal_reconditioning,"Each option has three capability values. An option must meet each requirement unless that requirement is relaxed. Select an option and relaxation indices minimizing (sum of relaxation costs, number of relaxed requirements, option price, option ID, relaxation-index list), in that order. Return JSON {""option"":ID,""relax"":[zero-based indices],""total_cost"":option price plus relaxation costs}. Data: {""options"":[{""id"":""P0"",""price"":18,""values"":[4,6,1]},{""id"":""P1"",""price"":11,""values"":[5,2,10]},{""id"":""P2"",""price"":19,""values"":[1,2,1]},{""id"":""P3"",""price"":17,""values"":[5,5,9]},{""id"":""P4"",""price"":4,""values"":[8,6,4]}],""relaxation_costs"":[12,8,4],""requirements"":[5,8,8]}","{""option"":""P1"",""relax"":[1],""total_cost"":19}",null,"{""requirements"":[5,8,8]}","{""options"":[{""id"":""P0"",""price"":18,""values"":[4,6,1]},{""id"":""P1"",""price"":11,""values"":[5,2,10]},{""id"":""P2"",""price"":19,""values"":[1,2,1]},{""id"":""P3"",""price"":17,""values"":[5,5,9]},{""id"":""P4"",""price"":4,""values"":[8,6,4]}],""relaxation_costs"":[12,8,4],""requirements"":[5,8,8]}",exact_json
21
+ AF-RECOND-01-0243,compound_obstruction,"Choose one option from A and one from B. Their summed resource and duration must not exceed the caps, and forbidden_pairs cannot be chosen. Minimize total cost; break ties by A ID then B ID. Return JSON {""A"":ID,""B"":ID,""cost"":integer}. Data: {""duration_cap"":11,""forbidden_pairs"":[[""A3"",""B3""]],""options_A"":[{""cost"":12,""duration"":3,""id"":""A0"",""resource"":5},{""cost"":6,""duration"":5,""id"":""A1"",""resource"":5},{""cost"":13,""duration"":2,""id"":""A2"",""resource"":4},{""cost"":5,""duration"":6,""id"":""A3"",""resource"":3}],""options_B"":[{""cost"":7,""duration"":6,""id"":""B0"",""resource"":6},{""cost"":6,""duration"":8,""id"":""B1"",""resource"":6},{""cost"":10,""duration"":8,""id"":""B2"",""resource"":1},{""cost"":1,""duration"":4,""id"":""B3"",""resource"":2}],""resource_cap"":9}","{""A"":""A1"",""B"":""B3"",""cost"":7}","{""A"":""A3"",""B"":""B3""}","{""forbidden_pairs"":[[""A3"",""B3""]]}","{""duration_cap"":11,""forbidden_pairs"":[[""A3"",""B3""]],""options_A"":[{""cost"":12,""duration"":3,""id"":""A0"",""resource"":5},{""cost"":6,""duration"":5,""id"":""A1"",""resource"":5},{""cost"":13,""duration"":2,""id"":""A2"",""resource"":4},{""cost"":5,""duration"":6,""id"":""A3"",""resource"":3}],""options_B"":[{""cost"":7,""duration"":6,""id"":""B0"",""resource"":6},{""cost"":6,""duration"":8,""id"":""B1"",""resource"":6},{""cost"":10,""duration"":8,""id"":""B2"",""resource"":1},{""cost"":1,""duration"":4,""id"":""B3"",""resource"":2}],""resource_cap"":9}",exact_json
22
+ AF-RECOND-01-0240,compound_obstruction,"Choose one option from A and one from B. Their summed resource and duration must not exceed the caps, and forbidden_pairs cannot be chosen. Minimize total cost; break ties by A ID then B ID. Return JSON {""A"":ID,""B"":ID,""cost"":integer}. Data: {""duration_cap"":11,""forbidden_pairs"":[[""A2"",""B2""]],""options_A"":[{""cost"":12,""duration"":2,""id"":""A0"",""resource"":3},{""cost"":2,""duration"":5,""id"":""A1"",""resource"":3},{""cost"":1,""duration"":1,""id"":""A2"",""resource"":1},{""cost"":10,""duration"":7,""id"":""A3"",""resource"":1}],""options_B"":[{""cost"":7,""duration"":1,""id"":""B0"",""resource"":2},{""cost"":13,""duration"":4,""id"":""B1"",""resource"":6},{""cost"":3,""duration"":8,""id"":""B2"",""resource"":1},{""cost"":10,""duration"":4,""id"":""B3"",""resource"":7}],""resource_cap"":11}","{""A"":""A2"",""B"":""B0"",""cost"":8}","{""A"":""A2"",""B"":""B2""}","{""forbidden_pairs"":[[""A2"",""B2""]]}","{""duration_cap"":11,""forbidden_pairs"":[[""A2"",""B2""]],""options_A"":[{""cost"":12,""duration"":2,""id"":""A0"",""resource"":3},{""cost"":2,""duration"":5,""id"":""A1"",""resource"":3},{""cost"":1,""duration"":1,""id"":""A2"",""resource"":1},{""cost"":10,""duration"":7,""id"":""A3"",""resource"":1}],""options_B"":[{""cost"":7,""duration"":1,""id"":""B0"",""resource"":2},{""cost"":13,""duration"":4,""id"":""B1"",""resource"":6},{""cost"":3,""duration"":8,""id"":""B2"",""resource"":1},{""cost"":10,""duration"":4,""id"":""B3"",""resource"":7}],""resource_cap"":11}",exact_json
23
+ AF-RECOND-01-0348,nonclosure_recovery,"After excluding blocked nodes, enumerate all simple directed paths from start to end. Sort by (number of nodes in path, lexicographic node sequence). Return JSON {""count"":number of paths,""first_two"":[first two paths]}. Data: {""blocked"":[""B""],""edges"":[[""A"",""B""],[""A"",""C""],[""A"",""D""],[""A"",""E""],[""A"",""F""],[""B"",""D""],[""B"",""F""],[""B"",""G""],[""D"",""E""],[""D"",""G""],[""E"",""F""],[""F"",""G""]],""end"":""G"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G""],""start"":""A""}","{""count"":4,""first_two"":[[""A"",""D"",""G""],[""A"",""F"",""G""]]}",null,"{""blocked"":[""B""]}","{""blocked"":[""B""],""edges"":[[""A"",""B""],[""A"",""C""],[""A"",""D""],[""A"",""E""],[""A"",""F""],[""B"",""D""],[""B"",""F""],[""B"",""G""],[""D"",""E""],[""D"",""G""],[""E"",""F""],[""F"",""G""]],""end"":""G"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G""],""start"":""A""}",exact_json
24
+ AF-RECOND-01-0085,constraint_invalidation,"A directed weighted graph has lost removed_edge. Find the minimum-cost remaining route from start to end. Break cost ties by lexicographically smallest complete path. Return JSON {""cost"":integer,""path"":[node,...]}. Data: {""edges"":[[""A"",""C"",6],[""A"",""D"",7],[""A"",""E"",9],[""C"",""E"",4],[""D"",""E"",1],[""E"",""F"",4]],""end"":""F"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F""],""removed_edge"":[""D"",""E""],""start"":""A""}","{""cost"":13,""path"":[""A"",""E"",""F""]}","{""cost"":12,""path"":[""A"",""D"",""E"",""F""]}","{""removed_edge"":[""D"",""E""]}","{""edges"":[[""A"",""C"",6],[""A"",""D"",7],[""A"",""E"",9],[""C"",""E"",4],[""D"",""E"",1],[""E"",""F"",4]],""end"":""F"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F""],""removed_edge"":[""D"",""E""],""start"":""A""}",exact_json
25
+ AF-RECOND-01-0195,minimal_reconditioning,"Each option has three capability values. An option must meet each requirement unless that requirement is relaxed. Select an option and relaxation indices minimizing (sum of relaxation costs, number of relaxed requirements, option price, option ID, relaxation-index list), in that order. Return JSON {""option"":ID,""relax"":[zero-based indices],""total_cost"":option price plus relaxation costs}. Data: {""options"":[{""id"":""P0"",""price"":5,""values"":[3,1,10]},{""id"":""P1"",""price"":17,""values"":[2,9,1]},{""id"":""P2"",""price"":15,""values"":[10,6,3]},{""id"":""P3"",""price"":5,""values"":[8,2,6]},{""id"":""P4"",""price"":8,""values"":[10,8,4]}],""relaxation_costs"":[9,14,7],""requirements"":[8,3,5]}","{""option"":""P4"",""relax"":[2],""total_cost"":15}",null,"{""requirements"":[8,3,5]}","{""options"":[{""id"":""P0"",""price"":5,""values"":[3,1,10]},{""id"":""P1"",""price"":17,""values"":[2,9,1]},{""id"":""P2"",""price"":15,""values"":[10,6,3]},{""id"":""P3"",""price"":5,""values"":[8,2,6]},{""id"":""P4"",""price"":8,""values"":[10,8,4]}],""relaxation_costs"":[9,14,7],""requirements"":[8,3,5]}",exact_json
26
+ AF-RECOND-01-0298,compound_obstruction,"Choose one option from A and one from B. Their summed resource and duration must not exceed the caps, and forbidden_pairs cannot be chosen. Minimize total cost; break ties by A ID then B ID. Return JSON {""A"":ID,""B"":ID,""cost"":integer}. Data: {""duration_cap"":13,""forbidden_pairs"":[[""A2"",""B1""]],""options_A"":[{""cost"":15,""duration"":3,""id"":""A0"",""resource"":2},{""cost"":2,""duration"":7,""id"":""A1"",""resource"":1},{""cost"":1,""duration"":2,""id"":""A2"",""resource"":3},{""cost"":7,""duration"":8,""id"":""A3"",""resource"":6}],""options_B"":[{""cost"":14,""duration"":1,""id"":""B0"",""resource"":2},{""cost"":4,""duration"":4,""id"":""B1"",""resource"":5},{""cost"":8,""duration"":1,""id"":""B2"",""resource"":4},{""cost"":13,""duration"":7,""id"":""B3"",""resource"":2}],""resource_cap"":9}","{""A"":""A1"",""B"":""B1"",""cost"":6}","{""A"":""A2"",""B"":""B1""}","{""forbidden_pairs"":[[""A2"",""B1""]]}","{""duration_cap"":13,""forbidden_pairs"":[[""A2"",""B1""]],""options_A"":[{""cost"":15,""duration"":3,""id"":""A0"",""resource"":2},{""cost"":2,""duration"":7,""id"":""A1"",""resource"":1},{""cost"":1,""duration"":2,""id"":""A2"",""resource"":3},{""cost"":7,""duration"":8,""id"":""A3"",""resource"":6}],""options_B"":[{""cost"":14,""duration"":1,""id"":""B0"",""resource"":2},{""cost"":4,""duration"":4,""id"":""B1"",""resource"":5},{""cost"":8,""duration"":1,""id"":""B2"",""resource"":4},{""cost"":13,""duration"":7,""id"":""B3"",""resource"":2}],""resource_cap"":9}",exact_json
27
+ AF-RECOND-01-0215,compound_obstruction,"Choose one option from A and one from B. Their summed resource and duration must not exceed the caps, and forbidden_pairs cannot be chosen. Minimize total cost; break ties by A ID then B ID. Return JSON {""A"":ID,""B"":ID,""cost"":integer}. Data: {""duration_cap"":7,""forbidden_pairs"":[[""A2"",""B3""]],""options_A"":[{""cost"":11,""duration"":8,""id"":""A0"",""resource"":7},{""cost"":4,""duration"":7,""id"":""A1"",""resource"":7},{""cost"":3,""duration"":4,""id"":""A2"",""resource"":6},{""cost"":12,""duration"":1,""id"":""A3"",""resource"":5}],""options_B"":[{""cost"":14,""duration"":1,""id"":""B0"",""resource"":5},{""cost"":7,""duration"":4,""id"":""B1"",""resource"":2},{""cost"":7,""duration"":6,""id"":""B2"",""resource"":5},{""cost"":8,""duration"":2,""id"":""B3"",""resource"":3}],""resource_cap"":9}","{""A"":""A3"",""B"":""B1"",""cost"":19}","{""A"":""A2"",""B"":""B3""}","{""forbidden_pairs"":[[""A2"",""B3""]]}","{""duration_cap"":7,""forbidden_pairs"":[[""A2"",""B3""]],""options_A"":[{""cost"":11,""duration"":8,""id"":""A0"",""resource"":7},{""cost"":4,""duration"":7,""id"":""A1"",""resource"":7},{""cost"":3,""duration"":4,""id"":""A2"",""resource"":6},{""cost"":12,""duration"":1,""id"":""A3"",""resource"":5}],""options_B"":[{""cost"":14,""duration"":1,""id"":""B0"",""resource"":5},{""cost"":7,""duration"":4,""id"":""B1"",""resource"":2},{""cost"":7,""duration"":6,""id"":""B2"",""resource"":5},{""cost"":8,""duration"":2,""id"":""B3"",""resource"":3}],""resource_cap"":9}",exact_json
28
+ AF-RECOND-01-0370,nonclosure_recovery,"After excluding blocked nodes, enumerate all simple directed paths from start to end. Sort by (number of nodes in path, lexicographic node sequence). Return JSON {""count"":number of paths,""first_two"":[first two paths]}. Data: {""blocked"":[""B""],""edges"":[[""A"",""B""],[""A"",""C""],[""A"",""E""],[""A"",""G""],[""B"",""D""],[""B"",""E""],[""B"",""F""],[""C"",""D""],[""C"",""F""],[""C"",""G""],[""C"",""H""],[""D"",""G""],[""E"",""F""],[""E"",""G""],[""E"",""H""],[""F"",""H""],[""G"",""H""]],""end"":""H"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G"",""H""],""start"":""A""}","{""count"":8,""first_two"":[[""A"",""C"",""H""],[""A"",""E"",""H""]]}",null,"{""blocked"":[""B""]}","{""blocked"":[""B""],""edges"":[[""A"",""B""],[""A"",""C""],[""A"",""E""],[""A"",""G""],[""B"",""D""],[""B"",""E""],[""B"",""F""],[""C"",""D""],[""C"",""F""],[""C"",""G""],[""C"",""H""],[""D"",""G""],[""E"",""F""],[""E"",""G""],[""E"",""H""],[""F"",""H""],[""G"",""H""]],""end"":""H"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G"",""H""],""start"":""A""}",exact_json
29
+ AF-RECOND-01-0035,constraint_invalidation,"A directed weighted graph has lost removed_edge. Find the minimum-cost remaining route from start to end. Break cost ties by lexicographically smallest complete path. Return JSON {""cost"":integer,""path"":[node,...]}. Data: {""edges"":[[""A"",""B"",4],[""A"",""C"",5],[""A"",""F"",6],[""B"",""D"",6],[""B"",""E"",7],[""B"",""G"",1],[""C"",""F"",9],[""C"",""G"",1],[""D"",""E"",2],[""D"",""F"",1],[""E"",""F"",7]],""end"":""G"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G""],""removed_edge"":[""A"",""B""],""start"":""A""}","{""cost"":6,""path"":[""A"",""C"",""G""]}","{""cost"":5,""path"":[""A"",""B"",""G""]}","{""removed_edge"":[""A"",""B""]}","{""edges"":[[""A"",""B"",4],[""A"",""C"",5],[""A"",""F"",6],[""B"",""D"",6],[""B"",""E"",7],[""B"",""G"",1],[""C"",""F"",9],[""C"",""G"",1],[""D"",""E"",2],[""D"",""F"",1],[""E"",""F"",7]],""end"":""G"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G""],""removed_edge"":[""A"",""B""],""start"":""A""}",exact_json
30
+ AF-RECOND-01-0226,compound_obstruction,"Choose one option from A and one from B. Their summed resource and duration must not exceed the caps, and forbidden_pairs cannot be chosen. Minimize total cost; break ties by A ID then B ID. Return JSON {""A"":ID,""B"":ID,""cost"":integer}. Data: {""duration_cap"":10,""forbidden_pairs"":[[""A0"",""B3""]],""options_A"":[{""cost"":10,""duration"":1,""id"":""A0"",""resource"":3},{""cost"":15,""duration"":3,""id"":""A1"",""resource"":5},{""cost"":3,""duration"":7,""id"":""A2"",""resource"":6},{""cost"":1,""duration"":7,""id"":""A3"",""resource"":4}],""options_B"":[{""cost"":2,""duration"":6,""id"":""B0"",""resource"":6},{""cost"":11,""duration"":5,""id"":""B1"",""resource"":1},{""cost"":12,""duration"":7,""id"":""B2"",""resource"":6},{""cost"":3,""duration"":4,""id"":""B3"",""resource"":2}],""resource_cap"":6}","{""A"":""A0"",""B"":""B1"",""cost"":21}","{""A"":""A0"",""B"":""B3""}","{""forbidden_pairs"":[[""A0"",""B3""]]}","{""duration_cap"":10,""forbidden_pairs"":[[""A0"",""B3""]],""options_A"":[{""cost"":10,""duration"":1,""id"":""A0"",""resource"":3},{""cost"":15,""duration"":3,""id"":""A1"",""resource"":5},{""cost"":3,""duration"":7,""id"":""A2"",""resource"":6},{""cost"":1,""duration"":7,""id"":""A3"",""resource"":4}],""options_B"":[{""cost"":2,""duration"":6,""id"":""B0"",""resource"":6},{""cost"":11,""duration"":5,""id"":""B1"",""resource"":1},{""cost"":12,""duration"":7,""id"":""B2"",""resource"":6},{""cost"":3,""duration"":4,""id"":""B3"",""resource"":2}],""resource_cap"":6}",exact_json
31
+ AF-RECOND-01-0268,compound_obstruction,"Choose one option from A and one from B. Their summed resource and duration must not exceed the caps, and forbidden_pairs cannot be chosen. Minimize total cost; break ties by A ID then B ID. Return JSON {""A"":ID,""B"":ID,""cost"":integer}. Data: {""duration_cap"":12,""forbidden_pairs"":[[""A2"",""B0""]],""options_A"":[{""cost"":5,""duration"":6,""id"":""A0"",""resource"":3},{""cost"":4,""duration"":7,""id"":""A1"",""resource"":4},{""cost"":6,""duration"":2,""id"":""A2"",""resource"":2},{""cost"":7,""duration"":8,""id"":""A3"",""resource"":7}],""options_B"":[{""cost"":3,""duration"":7,""id"":""B0"",""resource"":7},{""cost"":12,""duration"":8,""id"":""B1"",""resource"":3},{""cost"":7,""duration"":7,""id"":""B2"",""resource"":3},{""cost"":6,""duration"":6,""id"":""B3"",""resource"":6}],""resource_cap"":9}","{""A"":""A0"",""B"":""B3"",""cost"":11}","{""A"":""A2"",""B"":""B0""}","{""forbidden_pairs"":[[""A2"",""B0""]]}","{""duration_cap"":12,""forbidden_pairs"":[[""A2"",""B0""]],""options_A"":[{""cost"":5,""duration"":6,""id"":""A0"",""resource"":3},{""cost"":4,""duration"":7,""id"":""A1"",""resource"":4},{""cost"":6,""duration"":2,""id"":""A2"",""resource"":2},{""cost"":7,""duration"":8,""id"":""A3"",""resource"":7}],""options_B"":[{""cost"":3,""duration"":7,""id"":""B0"",""resource"":7},{""cost"":12,""duration"":8,""id"":""B1"",""resource"":3},{""cost"":7,""duration"":7,""id"":""B2"",""resource"":3},{""cost"":6,""duration"":6,""id"":""B3"",""resource"":6}],""resource_cap"":9}",exact_json
32
+ AF-RECOND-01-0241,compound_obstruction,"Choose one option from A and one from B. Their summed resource and duration must not exceed the caps, and forbidden_pairs cannot be chosen. Minimize total cost; break ties by A ID then B ID. Return JSON {""A"":ID,""B"":ID,""cost"":integer}. Data: {""duration_cap"":8,""forbidden_pairs"":[[""A2"",""B1""]],""options_A"":[{""cost"":9,""duration"":2,""id"":""A0"",""resource"":7},{""cost"":13,""duration"":4,""id"":""A1"",""resource"":5},{""cost"":8,""duration"":3,""id"":""A2"",""resource"":3},{""cost"":10,""duration"":2,""id"":""A3"",""resource"":1}],""options_B"":[{""cost"":5,""duration"":1,""id"":""B0"",""resource"":5},{""cost"":4,""duration"":1,""id"":""B1"",""resource"":1},{""cost"":12,""duration"":1,""id"":""B2"",""resource"":6},{""cost"":3,""duration"":7,""id"":""B3"",""resource"":5}],""resource_cap"":9}","{""A"":""A0"",""B"":""B1"",""cost"":13}","{""A"":""A2"",""B"":""B1""}","{""forbidden_pairs"":[[""A2"",""B1""]]}","{""duration_cap"":8,""forbidden_pairs"":[[""A2"",""B1""]],""options_A"":[{""cost"":9,""duration"":2,""id"":""A0"",""resource"":7},{""cost"":13,""duration"":4,""id"":""A1"",""resource"":5},{""cost"":8,""duration"":3,""id"":""A2"",""resource"":3},{""cost"":10,""duration"":2,""id"":""A3"",""resource"":1}],""options_B"":[{""cost"":5,""duration"":1,""id"":""B0"",""resource"":5},{""cost"":4,""duration"":1,""id"":""B1"",""resource"":1},{""cost"":12,""duration"":1,""id"":""B2"",""resource"":6},{""cost"":3,""duration"":7,""id"":""B3"",""resource"":5}],""resource_cap"":9}",exact_json
33
+ AF-RECOND-01-0341,nonclosure_recovery,"After excluding blocked nodes, enumerate all simple directed paths from start to end. Sort by (number of nodes in path, lexicographic node sequence). Return JSON {""count"":number of paths,""first_two"":[first two paths]}. Data: {""blocked"":[""C""],""edges"":[[""A"",""B""],[""A"",""C""],[""A"",""F""],[""B"",""D""],[""B"",""F""],[""B"",""G""],[""C"",""D""],[""C"",""E""],[""C"",""F""],[""C"",""G""],[""D"",""E""],[""D"",""F""],[""E"",""F""],[""F"",""G""]],""end"":""G"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G""],""start"":""A""}","{""count"":5,""first_two"":[[""A"",""B"",""G""],[""A"",""F"",""G""]]}",null,"{""blocked"":[""C""]}","{""blocked"":[""C""],""edges"":[[""A"",""B""],[""A"",""C""],[""A"",""F""],[""B"",""D""],[""B"",""F""],[""B"",""G""],[""C"",""D""],[""C"",""E""],[""C"",""F""],[""C"",""G""],[""D"",""E""],[""D"",""F""],[""E"",""F""],[""F"",""G""]],""end"":""G"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G""],""start"":""A""}",exact_json
34
+ AF-RECOND-01-0017,constraint_invalidation,"A directed weighted graph has lost removed_edge. Find the minimum-cost remaining route from start to end. Break cost ties by lexicographically smallest complete path. Return JSON {""cost"":integer,""path"":[node,...]}. Data: {""edges"":[[""A"",""D"",4],[""A"",""E"",8],[""A"",""F"",4],[""A"",""G"",1],[""B"",""C"",3],[""B"",""D"",9],[""B"",""E"",6],[""B"",""H"",9],[""C"",""E"",4],[""C"",""F"",7],[""C"",""G"",9],[""C"",""H"",2],[""D"",""E"",8],[""D"",""G"",4],[""D"",""H"",3],[""E"",""F"",9],[""E"",""G"",1],[""E"",""H"",4],[""G"",""H"",1]],""end"":""H"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G"",""H""],""removed_edge"":[""G"",""H""],""start"":""A""}","{""cost"":7,""path"":[""A"",""D"",""H""]}","{""cost"":2,""path"":[""A"",""G"",""H""]}","{""removed_edge"":[""G"",""H""]}","{""edges"":[[""A"",""D"",4],[""A"",""E"",8],[""A"",""F"",4],[""A"",""G"",1],[""B"",""C"",3],[""B"",""D"",9],[""B"",""E"",6],[""B"",""H"",9],[""C"",""E"",4],[""C"",""F"",7],[""C"",""G"",9],[""C"",""H"",2],[""D"",""E"",8],[""D"",""G"",4],[""D"",""H"",3],[""E"",""F"",9],[""E"",""G"",1],[""E"",""H"",4],[""G"",""H"",1]],""end"":""H"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G"",""H""],""removed_edge"":[""G"",""H""],""start"":""A""}",exact_json
35
+ AF-RECOND-01-0382,nonclosure_recovery,"After excluding blocked nodes, enumerate all simple directed paths from start to end. Sort by (number of nodes in path, lexicographic node sequence). Return JSON {""count"":number of paths,""first_two"":[first two paths]}. Data: {""blocked"":[""C""],""edges"":[[""A"",""B""],[""A"",""C""],[""A"",""E""],[""A"",""F""],[""B"",""C""],[""B"",""D""],[""C"",""D""],[""C"",""E""],[""D"",""E""],[""E"",""F""]],""end"":""F"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F""],""start"":""A""}","{""count"":3,""first_two"":[[""A"",""F""],[""A"",""E"",""F""]]}",null,"{""blocked"":[""C""]}","{""blocked"":[""C""],""edges"":[[""A"",""B""],[""A"",""C""],[""A"",""E""],[""A"",""F""],[""B"",""C""],[""B"",""D""],[""C"",""D""],[""C"",""E""],[""D"",""E""],[""E"",""F""]],""end"":""F"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F""],""start"":""A""}",exact_json
36
+ AF-RECOND-01-0028,constraint_invalidation,"A directed weighted graph has lost removed_edge. Find the minimum-cost remaining route from start to end. Break cost ties by lexicographically smallest complete path. Return JSON {""cost"":integer,""path"":[node,...]}. Data: {""edges"":[[""A"",""C"",9],[""A"",""D"",4],[""A"",""G"",6],[""B"",""C"",9],[""B"",""E"",4],[""C"",""D"",3],[""C"",""G"",4],[""D"",""F"",2],[""D"",""G"",2],[""E"",""F"",3]],""end"":""G"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G""],""removed_edge"":[""A"",""D""],""start"":""A""}","{""cost"":6,""path"":[""A"",""G""]}","{""cost"":6,""path"":[""A"",""D"",""G""]}","{""removed_edge"":[""A"",""D""]}","{""edges"":[[""A"",""C"",9],[""A"",""D"",4],[""A"",""G"",6],[""B"",""C"",9],[""B"",""E"",4],[""C"",""D"",3],[""C"",""G"",4],[""D"",""F"",2],[""D"",""G"",2],[""E"",""F"",3]],""end"":""G"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G""],""removed_edge"":[""A"",""D""],""start"":""A""}",exact_json
37
+ AF-RECOND-01-0359,nonclosure_recovery,"After excluding blocked nodes, enumerate all simple directed paths from start to end. Sort by (number of nodes in path, lexicographic node sequence). Return JSON {""count"":number of paths,""first_two"":[first two paths]}. Data: {""blocked"":[""D""],""edges"":[[""A"",""C""],[""A"",""D""],[""A"",""E""],[""B"",""C""],[""B"",""D""],[""B"",""E""],[""B"",""F""],[""C"",""E""],[""E"",""F""]],""end"":""F"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F""],""start"":""A""}","{""count"":2,""first_two"":[[""A"",""E"",""F""],[""A"",""C"",""E"",""F""]]}",null,"{""blocked"":[""D""]}","{""blocked"":[""D""],""edges"":[[""A"",""C""],[""A"",""D""],[""A"",""E""],[""B"",""C""],[""B"",""D""],[""B"",""E""],[""B"",""F""],[""C"",""E""],[""E"",""F""]],""end"":""F"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F""],""start"":""A""}",exact_json
38
+ AF-RECOND-01-0204,compound_obstruction,"Choose one option from A and one from B. Their summed resource and duration must not exceed the caps, and forbidden_pairs cannot be chosen. Minimize total cost; break ties by A ID then B ID. Return JSON {""A"":ID,""B"":ID,""cost"":integer}. Data: {""duration_cap"":9,""forbidden_pairs"":[[""A2"",""B3""]],""options_A"":[{""cost"":9,""duration"":8,""id"":""A0"",""resource"":7},{""cost"":4,""duration"":6,""id"":""A1"",""resource"":7},{""cost"":3,""duration"":1,""id"":""A2"",""resource"":7},{""cost"":4,""duration"":3,""id"":""A3"",""resource"":3}],""options_B"":[{""cost"":15,""duration"":6,""id"":""B0"",""resource"":4},{""cost"":9,""duration"":5,""id"":""B1"",""resource"":7},{""cost"":13,""duration"":5,""id"":""B2"",""resource"":5},{""cost"":6,""duration"":1,""id"":""B3"",""resource"":2}],""resource_cap"":10}","{""A"":""A1"",""B"":""B3"",""cost"":10}","{""A"":""A2"",""B"":""B3""}","{""forbidden_pairs"":[[""A2"",""B3""]]}","{""duration_cap"":9,""forbidden_pairs"":[[""A2"",""B3""]],""options_A"":[{""cost"":9,""duration"":8,""id"":""A0"",""resource"":7},{""cost"":4,""duration"":6,""id"":""A1"",""resource"":7},{""cost"":3,""duration"":1,""id"":""A2"",""resource"":7},{""cost"":4,""duration"":3,""id"":""A3"",""resource"":3}],""options_B"":[{""cost"":15,""duration"":6,""id"":""B0"",""resource"":4},{""cost"":9,""duration"":5,""id"":""B1"",""resource"":7},{""cost"":13,""duration"":5,""id"":""B2"",""resource"":5},{""cost"":6,""duration"":1,""id"":""B3"",""resource"":2}],""resource_cap"":10}",exact_json
39
+ AF-RECOND-01-0196,minimal_reconditioning,"Each option has three capability values. An option must meet each requirement unless that requirement is relaxed. Select an option and relaxation indices minimizing (sum of relaxation costs, number of relaxed requirements, option price, option ID, relaxation-index list), in that order. Return JSON {""option"":ID,""relax"":[zero-based indices],""total_cost"":option price plus relaxation costs}. Data: {""options"":[{""id"":""P0"",""price"":13,""values"":[2,3,3]},{""id"":""P1"",""price"":18,""values"":[9,3,1]},{""id"":""P2"",""price"":15,""values"":[9,5,3]},{""id"":""P3"",""price"":8,""values"":[9,10,7]},{""id"":""P4"",""price"":8,""values"":[1,7,8]}],""relaxation_costs"":[5,3,7],""requirements"":[5,3,8]}","{""option"":""P4"",""relax"":[0],""total_cost"":13}",null,"{""requirements"":[5,3,8]}","{""options"":[{""id"":""P0"",""price"":13,""values"":[2,3,3]},{""id"":""P1"",""price"":18,""values"":[9,3,1]},{""id"":""P2"",""price"":15,""values"":[9,5,3]},{""id"":""P3"",""price"":8,""values"":[9,10,7]},{""id"":""P4"",""price"":8,""values"":[1,7,8]}],""relaxation_costs"":[5,3,7],""requirements"":[5,3,8]}",exact_json
40
+ AF-RECOND-01-0203,compound_obstruction,"Choose one option from A and one from B. Their summed resource and duration must not exceed the caps, and forbidden_pairs cannot be chosen. Minimize total cost; break ties by A ID then B ID. Return JSON {""A"":ID,""B"":ID,""cost"":integer}. Data: {""duration_cap"":12,""forbidden_pairs"":[[""A3"",""B2""]],""options_A"":[{""cost"":14,""duration"":8,""id"":""A0"",""resource"":3},{""cost"":7,""duration"":3,""id"":""A1"",""resource"":6},{""cost"":13,""duration"":6,""id"":""A2"",""resource"":5},{""cost"":3,""duration"":4,""id"":""A3"",""resource"":2}],""options_B"":[{""cost"":5,""duration"":2,""id"":""B0"",""resource"":4},{""cost"":11,""duration"":4,""id"":""B1"",""resource"":2},{""cost"":1,""duration"":1,""id"":""B2"",""resource"":6},{""cost"":10,""duration"":4,""id"":""B3"",""resource"":7}],""resource_cap"":9}","{""A"":""A3"",""B"":""B0"",""cost"":8}","{""A"":""A3"",""B"":""B2""}","{""forbidden_pairs"":[[""A3"",""B2""]]}","{""duration_cap"":12,""forbidden_pairs"":[[""A3"",""B2""]],""options_A"":[{""cost"":14,""duration"":8,""id"":""A0"",""resource"":3},{""cost"":7,""duration"":3,""id"":""A1"",""resource"":6},{""cost"":13,""duration"":6,""id"":""A2"",""resource"":5},{""cost"":3,""duration"":4,""id"":""A3"",""resource"":2}],""options_B"":[{""cost"":5,""duration"":2,""id"":""B0"",""resource"":4},{""cost"":11,""duration"":4,""id"":""B1"",""resource"":2},{""cost"":1,""duration"":1,""id"":""B2"",""resource"":6},{""cost"":10,""duration"":4,""id"":""B3"",""resource"":7}],""resource_cap"":9}",exact_json
41
+ AF-RECOND-01-0013,constraint_invalidation,"A directed weighted graph has lost removed_edge. Find the minimum-cost remaining route from start to end. Break cost ties by lexicographically smallest complete path. Return JSON {""cost"":integer,""path"":[node,...]}. Data: {""edges"":[[""A"",""B"",1],[""A"",""H"",6],[""B"",""H"",1],[""C"",""F"",2],[""C"",""G"",5],[""D"",""G"",3],[""E"",""F"",1],[""E"",""G"",3],[""G"",""H"",5]],""end"":""H"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G"",""H""],""removed_edge"":[""B"",""H""],""start"":""A""}","{""cost"":6,""path"":[""A"",""H""]}","{""cost"":2,""path"":[""A"",""B"",""H""]}","{""removed_edge"":[""B"",""H""]}","{""edges"":[[""A"",""B"",1],[""A"",""H"",6],[""B"",""H"",1],[""C"",""F"",2],[""C"",""G"",5],[""D"",""G"",3],[""E"",""F"",1],[""E"",""G"",3],[""G"",""H"",5]],""end"":""H"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G"",""H""],""removed_edge"":[""B"",""H""],""start"":""A""}",exact_json
42
+ AF-RECOND-01-0044,constraint_invalidation,"A directed weighted graph has lost removed_edge. Find the minimum-cost remaining route from start to end. Break cost ties by lexicographically smallest complete path. Return JSON {""cost"":integer,""path"":[node,...]}. Data: {""edges"":[[""A"",""C"",3],[""A"",""D"",6],[""A"",""E"",5],[""A"",""F"",2],[""B"",""E"",6],[""B"",""G"",6],[""B"",""H"",9],[""C"",""D"",6],[""C"",""E"",7],[""D"",""E"",4],[""D"",""G"",1],[""E"",""F"",4],[""E"",""G"",4],[""G"",""H"",4]],""end"":""H"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G"",""H""],""removed_edge"":[""D"",""G""],""start"":""A""}","{""cost"":13,""path"":[""A"",""E"",""G"",""H""]}","{""cost"":11,""path"":[""A"",""D"",""G"",""H""]}","{""removed_edge"":[""D"",""G""]}","{""edges"":[[""A"",""C"",3],[""A"",""D"",6],[""A"",""E"",5],[""A"",""F"",2],[""B"",""E"",6],[""B"",""G"",6],[""B"",""H"",9],[""C"",""D"",6],[""C"",""E"",7],[""D"",""E"",4],[""D"",""G"",1],[""E"",""F"",4],[""E"",""G"",4],[""G"",""H"",4]],""end"":""H"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G"",""H""],""removed_edge"":[""D"",""G""],""start"":""A""}",exact_json
43
+ AF-RECOND-01-0376,nonclosure_recovery,"After excluding blocked nodes, enumerate all simple directed paths from start to end. Sort by (number of nodes in path, lexicographic node sequence). Return JSON {""count"":number of paths,""first_two"":[first two paths]}. Data: {""blocked"":[""F""],""edges"":[[""A"",""F""],[""A"",""G""],[""A"",""H""],[""B"",""D""],[""B"",""E""],[""B"",""F""],[""B"",""G""],[""C"",""F""],[""C"",""G""],[""C"",""H""],[""D"",""E""],[""D"",""F""],[""E"",""F""],[""E"",""G""],[""E"",""H""],[""F"",""G""],[""F"",""H""],[""G"",""H""]],""end"":""H"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G"",""H""],""start"":""A""}","{""count"":2,""first_two"":[[""A"",""H""],[""A"",""G"",""H""]]}",null,"{""blocked"":[""F""]}","{""blocked"":[""F""],""edges"":[[""A"",""F""],[""A"",""G""],[""A"",""H""],[""B"",""D""],[""B"",""E""],[""B"",""F""],[""B"",""G""],[""C"",""F""],[""C"",""G""],[""C"",""H""],[""D"",""E""],[""D"",""F""],[""E"",""F""],[""E"",""G""],[""E"",""H""],[""F"",""G""],[""F"",""H""],[""G"",""H""]],""end"":""H"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G"",""H""],""start"":""A""}",exact_json
44
+ AF-RECOND-01-0377,nonclosure_recovery,"After excluding blocked nodes, enumerate all simple directed paths from start to end. Sort by (number of nodes in path, lexicographic node sequence). Return JSON {""count"":number of paths,""first_two"":[first two paths]}. Data: {""blocked"":[""C""],""edges"":[[""A"",""B""],[""A"",""C""],[""A"",""D""],[""A"",""E""],[""A"",""G""],[""A"",""H""],[""B"",""C""],[""B"",""D""],[""B"",""F""],[""B"",""H""],[""C"",""E""],[""C"",""F""],[""C"",""H""],[""D"",""E""],[""D"",""F""],[""D"",""G""],[""E"",""F""],[""E"",""G""],[""E"",""H""],[""F"",""G""]],""end"":""H"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G"",""H""],""start"":""A""}","{""count"":5,""first_two"":[[""A"",""H""],[""A"",""B"",""H""]]}",null,"{""blocked"":[""C""]}","{""blocked"":[""C""],""edges"":[[""A"",""B""],[""A"",""C""],[""A"",""D""],[""A"",""E""],[""A"",""G""],[""A"",""H""],[""B"",""C""],[""B"",""D""],[""B"",""F""],[""B"",""H""],[""C"",""E""],[""C"",""F""],[""C"",""H""],[""D"",""E""],[""D"",""F""],[""D"",""G""],[""E"",""F""],[""E"",""G""],[""E"",""H""],[""F"",""G""]],""end"":""H"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G"",""H""],""start"":""A""}",exact_json
45
+ AF-RECOND-01-0172,minimal_reconditioning,"Each option has three capability values. An option must meet each requirement unless that requirement is relaxed. Select an option and relaxation indices minimizing (sum of relaxation costs, number of relaxed requirements, option price, option ID, relaxation-index list), in that order. Return JSON {""option"":ID,""relax"":[zero-based indices],""total_cost"":option price plus relaxation costs}. Data: {""options"":[{""id"":""P0"",""price"":14,""values"":[10,7,2]},{""id"":""P1"",""price"":10,""values"":[7,6,6]},{""id"":""P2"",""price"":17,""values"":[5,9,3]},{""id"":""P3"",""price"":5,""values"":[8,3,4]},{""id"":""P4"",""price"":13,""values"":[3,1,9]}],""relaxation_costs"":[7,8,7],""requirements"":[7,8,5]}","{""option"":""P1"",""relax"":[1],""total_cost"":18}",null,"{""requirements"":[7,8,5]}","{""options"":[{""id"":""P0"",""price"":14,""values"":[10,7,2]},{""id"":""P1"",""price"":10,""values"":[7,6,6]},{""id"":""P2"",""price"":17,""values"":[5,9,3]},{""id"":""P3"",""price"":5,""values"":[8,3,4]},{""id"":""P4"",""price"":13,""values"":[3,1,9]}],""relaxation_costs"":[7,8,7],""requirements"":[7,8,5]}",exact_json
46
+ AF-RECOND-01-0300,compound_obstruction,"Choose one option from A and one from B. Their summed resource and duration must not exceed the caps, and forbidden_pairs cannot be chosen. Minimize total cost; break ties by A ID then B ID. Return JSON {""A"":ID,""B"":ID,""cost"":integer}. Data: {""duration_cap"":7,""forbidden_pairs"":[[""A0"",""B2""]],""options_A"":[{""cost"":7,""duration"":1,""id"":""A0"",""resource"":6},{""cost"":8,""duration"":4,""id"":""A1"",""resource"":6},{""cost"":15,""duration"":1,""id"":""A2"",""resource"":5},{""cost"":8,""duration"":7,""id"":""A3"",""resource"":1}],""options_B"":[{""cost"":15,""duration"":4,""id"":""B0"",""resource"":2},{""cost"":7,""duration"":7,""id"":""B1"",""resource"":6},{""cost"":7,""duration"":2,""id"":""B2"",""resource"":3},{""cost"":9,""duration"":6,""id"":""B3"",""resource"":7}],""resource_cap"":9}","{""A"":""A1"",""B"":""B2"",""cost"":15}","{""A"":""A0"",""B"":""B2""}","{""forbidden_pairs"":[[""A0"",""B2""]]}","{""duration_cap"":7,""forbidden_pairs"":[[""A0"",""B2""]],""options_A"":[{""cost"":7,""duration"":1,""id"":""A0"",""resource"":6},{""cost"":8,""duration"":4,""id"":""A1"",""resource"":6},{""cost"":15,""duration"":1,""id"":""A2"",""resource"":5},{""cost"":8,""duration"":7,""id"":""A3"",""resource"":1}],""options_B"":[{""cost"":15,""duration"":4,""id"":""B0"",""resource"":2},{""cost"":7,""duration"":7,""id"":""B1"",""resource"":6},{""cost"":7,""duration"":2,""id"":""B2"",""resource"":3},{""cost"":9,""duration"":6,""id"":""B3"",""resource"":7}],""resource_cap"":9}",exact_json
47
+ AF-RECOND-01-0016,constraint_invalidation,"A directed weighted graph has lost removed_edge. Find the minimum-cost remaining route from start to end. Break cost ties by lexicographically smallest complete path. Return JSON {""cost"":integer,""path"":[node,...]}. Data: {""edges"":[[""A"",""B"",8],[""A"",""D"",9],[""A"",""E"",8],[""A"",""F"",7],[""B"",""D"",2],[""B"",""E"",8],[""B"",""G"",7],[""C"",""D"",4],[""C"",""E"",9],[""D"",""E"",9],[""D"",""F"",9],[""E"",""F"",4],[""F"",""G"",1]],""end"":""G"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G""],""removed_edge"":[""A"",""F""],""start"":""A""}","{""cost"":13,""path"":[""A"",""E"",""F"",""G""]}","{""cost"":8,""path"":[""A"",""F"",""G""]}","{""removed_edge"":[""A"",""F""]}","{""edges"":[[""A"",""B"",8],[""A"",""D"",9],[""A"",""E"",8],[""A"",""F"",7],[""B"",""D"",2],[""B"",""E"",8],[""B"",""G"",7],[""C"",""D"",4],[""C"",""E"",9],[""D"",""E"",9],[""D"",""F"",9],[""E"",""F"",4],[""F"",""G"",1]],""end"":""G"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G""],""removed_edge"":[""A"",""F""],""start"":""A""}",exact_json
48
+ AF-RECOND-01-0112,minimal_reconditioning,"Each option has three capability values. An option must meet each requirement unless that requirement is relaxed. Select an option and relaxation indices minimizing (sum of relaxation costs, number of relaxed requirements, option price, option ID, relaxation-index list), in that order. Return JSON {""option"":ID,""relax"":[zero-based indices],""total_cost"":option price plus relaxation costs}. Data: {""options"":[{""id"":""P0"",""price"":19,""values"":[8,1,7]},{""id"":""P1"",""price"":3,""values"":[9,7,3]},{""id"":""P2"",""price"":3,""values"":[9,4,2]},{""id"":""P3"",""price"":14,""values"":[4,1,6]},{""id"":""P4"",""price"":12,""values"":[4,5,10]}],""relaxation_costs"":[8,10,14],""requirements"":[7,7,5]}","{""option"":""P0"",""relax"":[1],""total_cost"":29}",null,"{""requirements"":[7,7,5]}","{""options"":[{""id"":""P0"",""price"":19,""values"":[8,1,7]},{""id"":""P1"",""price"":3,""values"":[9,7,3]},{""id"":""P2"",""price"":3,""values"":[9,4,2]},{""id"":""P3"",""price"":14,""values"":[4,1,6]},{""id"":""P4"",""price"":12,""values"":[4,5,10]}],""relaxation_costs"":[8,10,14],""requirements"":[7,7,5]}",exact_json
49
+ AF-RECOND-01-0063,constraint_invalidation,"A directed weighted graph has lost removed_edge. Find the minimum-cost remaining route from start to end. Break cost ties by lexicographically smallest complete path. Return JSON {""cost"":integer,""path"":[node,...]}. Data: {""edges"":[[""A"",""D"",2],[""A"",""F"",2],[""B"",""C"",1],[""B"",""D"",7],[""B"",""E"",7],[""B"",""G"",3],[""B"",""H"",2],[""D"",""H"",5],[""E"",""F"",5],[""E"",""G"",9],[""F"",""G"",6],[""F"",""H"",2],[""G"",""H"",6]],""end"":""H"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G"",""H""],""removed_edge"":[""F"",""H""],""start"":""A""}","{""cost"":7,""path"":[""A"",""D"",""H""]}","{""cost"":4,""path"":[""A"",""F"",""H""]}","{""removed_edge"":[""F"",""H""]}","{""edges"":[[""A"",""D"",2],[""A"",""F"",2],[""B"",""C"",1],[""B"",""D"",7],[""B"",""E"",7],[""B"",""G"",3],[""B"",""H"",2],[""D"",""H"",5],[""E"",""F"",5],[""E"",""G"",9],[""F"",""G"",6],[""F"",""H"",2],[""G"",""H"",6]],""end"":""H"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G"",""H""],""removed_edge"":[""F"",""H""],""start"":""A""}",exact_json
50
+ AF-RECOND-01-0277,compound_obstruction,"Choose one option from A and one from B. Their summed resource and duration must not exceed the caps, and forbidden_pairs cannot be chosen. Minimize total cost; break ties by A ID then B ID. Return JSON {""A"":ID,""B"":ID,""cost"":integer}. Data: {""duration_cap"":8,""forbidden_pairs"":[[""A3"",""B0""]],""options_A"":[{""cost"":11,""duration"":8,""id"":""A0"",""resource"":3},{""cost"":13,""duration"":4,""id"":""A1"",""resource"":1},{""cost"":11,""duration"":7,""id"":""A2"",""resource"":5},{""cost"":9,""duration"":3,""id"":""A3"",""resource"":1}],""options_B"":[{""cost"":6,""duration"":1,""id"":""B0"",""resource"":7},{""cost"":6,""duration"":2,""id"":""B1"",""resource"":4},{""cost"":7,""duration"":2,""id"":""B2"",""resource"":1},{""cost"":7,""duration"":7,""id"":""B3"",""resource"":5}],""resource_cap"":8}","{""A"":""A3"",""B"":""B1"",""cost"":15}","{""A"":""A3"",""B"":""B0""}","{""forbidden_pairs"":[[""A3"",""B0""]]}","{""duration_cap"":8,""forbidden_pairs"":[[""A3"",""B0""]],""options_A"":[{""cost"":11,""duration"":8,""id"":""A0"",""resource"":3},{""cost"":13,""duration"":4,""id"":""A1"",""resource"":1},{""cost"":11,""duration"":7,""id"":""A2"",""resource"":5},{""cost"":9,""duration"":3,""id"":""A3"",""resource"":1}],""options_B"":[{""cost"":6,""duration"":1,""id"":""B0"",""resource"":7},{""cost"":6,""duration"":2,""id"":""B1"",""resource"":4},{""cost"":7,""duration"":2,""id"":""B2"",""resource"":1},{""cost"":7,""duration"":7,""id"":""B3"",""resource"":5}],""resource_cap"":8}",exact_json
51
+ AF-RECOND-01-0012,constraint_invalidation,"A directed weighted graph has lost removed_edge. Find the minimum-cost remaining route from start to end. Break cost ties by lexicographically smallest complete path. Return JSON {""cost"":integer,""path"":[node,...]}. Data: {""edges"":[[""A"",""C"",6],[""A"",""D"",9],[""A"",""E"",8],[""B"",""C"",7],[""B"",""D"",6],[""C"",""D"",3],[""C"",""F"",3],[""E"",""F"",5]],""end"":""F"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F""],""removed_edge"":[""C"",""F""],""start"":""A""}","{""cost"":13,""path"":[""A"",""E"",""F""]}","{""cost"":9,""path"":[""A"",""C"",""F""]}","{""removed_edge"":[""C"",""F""]}","{""edges"":[[""A"",""C"",6],[""A"",""D"",9],[""A"",""E"",8],[""B"",""C"",7],[""B"",""D"",6],[""C"",""D"",3],[""C"",""F"",3],[""E"",""F"",5]],""end"":""F"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F""],""removed_edge"":[""C"",""F""],""start"":""A""}",exact_json
52
+ AF-RECOND-01-0190,minimal_reconditioning,"Each option has three capability values. An option must meet each requirement unless that requirement is relaxed. Select an option and relaxation indices minimizing (sum of relaxation costs, number of relaxed requirements, option price, option ID, relaxation-index list), in that order. Return JSON {""option"":ID,""relax"":[zero-based indices],""total_cost"":option price plus relaxation costs}. Data: {""options"":[{""id"":""P0"",""price"":6,""values"":[1,10,2]},{""id"":""P1"",""price"":2,""values"":[4,3,9]},{""id"":""P2"",""price"":9,""values"":[10,2,4]},{""id"":""P3"",""price"":13,""values"":[8,4,5]},{""id"":""P4"",""price"":9,""values"":[10,4,3]}],""relaxation_costs"":[5,3,7],""requirements"":[7,8,5]}","{""option"":""P3"",""relax"":[1],""total_cost"":16}",null,"{""requirements"":[7,8,5]}","{""options"":[{""id"":""P0"",""price"":6,""values"":[1,10,2]},{""id"":""P1"",""price"":2,""values"":[4,3,9]},{""id"":""P2"",""price"":9,""values"":[10,2,4]},{""id"":""P3"",""price"":13,""values"":[8,4,5]},{""id"":""P4"",""price"":9,""values"":[10,4,3]}],""relaxation_costs"":[5,3,7],""requirements"":[7,8,5]}",exact_json
53
+ AF-RECOND-01-0148,minimal_reconditioning,"Each option has three capability values. An option must meet each requirement unless that requirement is relaxed. Select an option and relaxation indices minimizing (sum of relaxation costs, number of relaxed requirements, option price, option ID, relaxation-index list), in that order. Return JSON {""option"":ID,""relax"":[zero-based indices],""total_cost"":option price plus relaxation costs}. Data: {""options"":[{""id"":""P0"",""price"":13,""values"":[3,5,3]},{""id"":""P1"",""price"":8,""values"":[7,3,6]},{""id"":""P2"",""price"":11,""values"":[5,9,8]},{""id"":""P3"",""price"":3,""values"":[4,6,9]},{""id"":""P4"",""price"":9,""values"":[8,9,4]}],""relaxation_costs"":[14,5,14],""requirements"":[8,3,6]}","{""option"":""P3"",""relax"":[0],""total_cost"":17}",null,"{""requirements"":[8,3,6]}","{""options"":[{""id"":""P0"",""price"":13,""values"":[3,5,3]},{""id"":""P1"",""price"":8,""values"":[7,3,6]},{""id"":""P2"",""price"":11,""values"":[5,9,8]},{""id"":""P3"",""price"":3,""values"":[4,6,9]},{""id"":""P4"",""price"":9,""values"":[8,9,4]}],""relaxation_costs"":[14,5,14],""requirements"":[8,3,6]}",exact_json
54
+ AF-RECOND-01-0304,nonclosure_recovery,"After excluding blocked nodes, enumerate all simple directed paths from start to end. Sort by (number of nodes in path, lexicographic node sequence). Return JSON {""count"":number of paths,""first_two"":[first two paths]}. Data: {""blocked"":[""G""],""edges"":[[""A"",""D""],[""A"",""F""],[""A"",""G""],[""A"",""H""],[""B"",""E""],[""B"",""F""],[""B"",""G""],[""B"",""H""],[""C"",""E""],[""C"",""G""],[""C"",""H""],[""D"",""E""],[""D"",""F""],[""D"",""H""],[""E"",""F""],[""F"",""H""]],""end"":""H"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G"",""H""],""start"":""A""}","{""count"":5,""first_two"":[[""A"",""H""],[""A"",""D"",""H""]]}",null,"{""blocked"":[""G""]}","{""blocked"":[""G""],""edges"":[[""A"",""D""],[""A"",""F""],[""A"",""G""],[""A"",""H""],[""B"",""E""],[""B"",""F""],[""B"",""G""],[""B"",""H""],[""C"",""E""],[""C"",""G""],[""C"",""H""],[""D"",""E""],[""D"",""F""],[""D"",""H""],[""E"",""F""],[""F"",""H""]],""end"":""H"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G"",""H""],""start"":""A""}",exact_json
55
+ AF-RECOND-01-0008,constraint_invalidation,"A directed weighted graph has lost removed_edge. Find the minimum-cost remaining route from start to end. Break cost ties by lexicographically smallest complete path. Return JSON {""cost"":integer,""path"":[node,...]}. Data: {""edges"":[[""A"",""C"",5],[""A"",""D"",6],[""A"",""F"",8],[""A"",""G"",7],[""B"",""D"",4],[""B"",""G"",1],[""B"",""H"",1],[""C"",""F"",3],[""C"",""H"",6],[""D"",""E"",6],[""D"",""F"",3],[""D"",""G"",4],[""D"",""H"",8],[""E"",""G"",7],[""E"",""H"",7],[""F"",""G"",9]],""end"":""H"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G"",""H""],""removed_edge"":[""A"",""C""],""start"":""A""}","{""cost"":14,""path"":[""A"",""D"",""H""]}","{""cost"":11,""path"":[""A"",""C"",""H""]}","{""removed_edge"":[""A"",""C""]}","{""edges"":[[""A"",""C"",5],[""A"",""D"",6],[""A"",""F"",8],[""A"",""G"",7],[""B"",""D"",4],[""B"",""G"",1],[""B"",""H"",1],[""C"",""F"",3],[""C"",""H"",6],[""D"",""E"",6],[""D"",""F"",3],[""D"",""G"",4],[""D"",""H"",8],[""E"",""G"",7],[""E"",""H"",7],[""F"",""G"",9]],""end"":""H"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G"",""H""],""removed_edge"":[""A"",""C""],""start"":""A""}",exact_json
56
+ AF-RECOND-01-0106,minimal_reconditioning,"Each option has three capability values. An option must meet each requirement unless that requirement is relaxed. Select an option and relaxation indices minimizing (sum of relaxation costs, number of relaxed requirements, option price, option ID, relaxation-index list), in that order. Return JSON {""option"":ID,""relax"":[zero-based indices],""total_cost"":option price plus relaxation costs}. Data: {""options"":[{""id"":""P0"",""price"":13,""values"":[6,3,6]},{""id"":""P1"",""price"":15,""values"":[4,1,9]},{""id"":""P2"",""price"":13,""values"":[1,5,7]},{""id"":""P3"",""price"":10,""values"":[1,9,1]},{""id"":""P4"",""price"":4,""values"":[4,3,7]}],""relaxation_costs"":[13,13,3],""requirements"":[3,7,7]}","{""option"":""P4"",""relax"":[1],""total_cost"":17}",null,"{""requirements"":[3,7,7]}","{""options"":[{""id"":""P0"",""price"":13,""values"":[6,3,6]},{""id"":""P1"",""price"":15,""values"":[4,1,9]},{""id"":""P2"",""price"":13,""values"":[1,5,7]},{""id"":""P3"",""price"":10,""values"":[1,9,1]},{""id"":""P4"",""price"":4,""values"":[4,3,7]}],""relaxation_costs"":[13,13,3],""requirements"":[3,7,7]}",exact_json
57
+ AF-RECOND-01-0250,compound_obstruction,"Choose one option from A and one from B. Their summed resource and duration must not exceed the caps, and forbidden_pairs cannot be chosen. Minimize total cost; break ties by A ID then B ID. Return JSON {""A"":ID,""B"":ID,""cost"":integer}. Data: {""duration_cap"":11,""forbidden_pairs"":[[""A0"",""B0""]],""options_A"":[{""cost"":1,""duration"":5,""id"":""A0"",""resource"":7},{""cost"":4,""duration"":6,""id"":""A1"",""resource"":7},{""cost"":6,""duration"":4,""id"":""A2"",""resource"":1},{""cost"":8,""duration"":6,""id"":""A3"",""resource"":3}],""options_B"":[{""cost"":1,""duration"":6,""id"":""B0"",""resource"":3},{""cost"":9,""duration"":3,""id"":""B1"",""resource"":3},{""cost"":13,""duration"":1,""id"":""B2"",""resource"":6},{""cost"":5,""duration"":6,""id"":""B3"",""resource"":3}],""resource_cap"":10}","{""A"":""A0"",""B"":""B3"",""cost"":6}","{""A"":""A0"",""B"":""B0""}","{""forbidden_pairs"":[[""A0"",""B0""]]}","{""duration_cap"":11,""forbidden_pairs"":[[""A0"",""B0""]],""options_A"":[{""cost"":1,""duration"":5,""id"":""A0"",""resource"":7},{""cost"":4,""duration"":6,""id"":""A1"",""resource"":7},{""cost"":6,""duration"":4,""id"":""A2"",""resource"":1},{""cost"":8,""duration"":6,""id"":""A3"",""resource"":3}],""options_B"":[{""cost"":1,""duration"":6,""id"":""B0"",""resource"":3},{""cost"":9,""duration"":3,""id"":""B1"",""resource"":3},{""cost"":13,""duration"":1,""id"":""B2"",""resource"":6},{""cost"":5,""duration"":6,""id"":""B3"",""resource"":3}],""resource_cap"":10}",exact_json
58
+ AF-RECOND-01-0144,minimal_reconditioning,"Each option has three capability values. An option must meet each requirement unless that requirement is relaxed. Select an option and relaxation indices minimizing (sum of relaxation costs, number of relaxed requirements, option price, option ID, relaxation-index list), in that order. Return JSON {""option"":ID,""relax"":[zero-based indices],""total_cost"":option price plus relaxation costs}. Data: {""options"":[{""id"":""P0"",""price"":13,""values"":[5,3,9]},{""id"":""P1"",""price"":13,""values"":[6,3,2]},{""id"":""P2"",""price"":14,""values"":[2,1,5]},{""id"":""P3"",""price"":20,""values"":[8,2,5]},{""id"":""P4"",""price"":12,""values"":[3,8,1]}],""relaxation_costs"":[7,10,4],""requirements"":[7,7,4]}","{""option"":""P3"",""relax"":[1],""total_cost"":30}",null,"{""requirements"":[7,7,4]}","{""options"":[{""id"":""P0"",""price"":13,""values"":[5,3,9]},{""id"":""P1"",""price"":13,""values"":[6,3,2]},{""id"":""P2"",""price"":14,""values"":[2,1,5]},{""id"":""P3"",""price"":20,""values"":[8,2,5]},{""id"":""P4"",""price"":12,""values"":[3,8,1]}],""relaxation_costs"":[7,10,4],""requirements"":[7,7,4]}",exact_json
59
+ AF-RECOND-01-0180,minimal_reconditioning,"Each option has three capability values. An option must meet each requirement unless that requirement is relaxed. Select an option and relaxation indices minimizing (sum of relaxation costs, number of relaxed requirements, option price, option ID, relaxation-index list), in that order. Return JSON {""option"":ID,""relax"":[zero-based indices],""total_cost"":option price plus relaxation costs}. Data: {""options"":[{""id"":""P0"",""price"":15,""values"":[5,10,10]},{""id"":""P1"",""price"":7,""values"":[10,3,1]},{""id"":""P2"",""price"":2,""values"":[3,1,4]},{""id"":""P3"",""price"":15,""values"":[10,5,8]},{""id"":""P4"",""price"":14,""values"":[7,2,4]}],""relaxation_costs"":[9,6,5],""requirements"":[7,6,6]}","{""option"":""P3"",""relax"":[1],""total_cost"":21}",null,"{""requirements"":[7,6,6]}","{""options"":[{""id"":""P0"",""price"":15,""values"":[5,10,10]},{""id"":""P1"",""price"":7,""values"":[10,3,1]},{""id"":""P2"",""price"":2,""values"":[3,1,4]},{""id"":""P3"",""price"":15,""values"":[10,5,8]},{""id"":""P4"",""price"":14,""values"":[7,2,4]}],""relaxation_costs"":[9,6,5],""requirements"":[7,6,6]}",exact_json
60
+ AF-RECOND-01-0154,minimal_reconditioning,"Each option has three capability values. An option must meet each requirement unless that requirement is relaxed. Select an option and relaxation indices minimizing (sum of relaxation costs, number of relaxed requirements, option price, option ID, relaxation-index list), in that order. Return JSON {""option"":ID,""relax"":[zero-based indices],""total_cost"":option price plus relaxation costs}. Data: {""options"":[{""id"":""P0"",""price"":18,""values"":[1,2,3]},{""id"":""P1"",""price"":16,""values"":[10,3,1]},{""id"":""P2"",""price"":10,""values"":[3,2,6]},{""id"":""P3"",""price"":17,""values"":[6,6,4]},{""id"":""P4"",""price"":12,""values"":[5,10,2]}],""relaxation_costs"":[3,5,3],""requirements"":[8,4,4]}","{""option"":""P3"",""relax"":[0],""total_cost"":20}",null,"{""requirements"":[8,4,4]}","{""options"":[{""id"":""P0"",""price"":18,""values"":[1,2,3]},{""id"":""P1"",""price"":16,""values"":[10,3,1]},{""id"":""P2"",""price"":10,""values"":[3,2,6]},{""id"":""P3"",""price"":17,""values"":[6,6,4]},{""id"":""P4"",""price"":12,""values"":[5,10,2]}],""relaxation_costs"":[3,5,3],""requirements"":[8,4,4]}",exact_json
61
+ AF-RECOND-01-0366,nonclosure_recovery,"After excluding blocked nodes, enumerate all simple directed paths from start to end. Sort by (number of nodes in path, lexicographic node sequence). Return JSON {""count"":number of paths,""first_two"":[first two paths]}. Data: {""blocked"":[""G""],""edges"":[[""A"",""B""],[""A"",""D""],[""A"",""G""],[""A"",""H""],[""B"",""C""],[""B"",""E""],[""B"",""H""],[""C"",""D""],[""C"",""F""],[""C"",""G""],[""G"",""H""]],""end"":""H"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G"",""H""],""start"":""A""}","{""count"":2,""first_two"":[[""A"",""H""],[""A"",""B"",""H""]]}",null,"{""blocked"":[""G""]}","{""blocked"":[""G""],""edges"":[[""A"",""B""],[""A"",""D""],[""A"",""G""],[""A"",""H""],[""B"",""C""],[""B"",""E""],[""B"",""H""],[""C"",""D""],[""C"",""F""],[""C"",""G""],[""G"",""H""]],""end"":""H"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G"",""H""],""start"":""A""}",exact_json
62
+ AF-RECOND-01-0255,compound_obstruction,"Choose one option from A and one from B. Their summed resource and duration must not exceed the caps, and forbidden_pairs cannot be chosen. Minimize total cost; break ties by A ID then B ID. Return JSON {""A"":ID,""B"":ID,""cost"":integer}. Data: {""duration_cap"":8,""forbidden_pairs"":[[""A1"",""B2""]],""options_A"":[{""cost"":11,""duration"":6,""id"":""A0"",""resource"":7},{""cost"":5,""duration"":2,""id"":""A1"",""resource"":4},{""cost"":9,""duration"":3,""id"":""A2"",""resource"":1},{""cost"":1,""duration"":8,""id"":""A3"",""resource"":1}],""options_B"":[{""cost"":15,""duration"":3,""id"":""B0"",""resource"":2},{""cost"":10,""duration"":4,""id"":""B1"",""resource"":5},{""cost"":9,""duration"":4,""id"":""B2"",""resource"":5},{""cost"":14,""duration"":2,""id"":""B3"",""resource"":7}],""resource_cap"":10}","{""A"":""A1"",""B"":""B1"",""cost"":15}","{""A"":""A1"",""B"":""B2""}","{""forbidden_pairs"":[[""A1"",""B2""]]}","{""duration_cap"":8,""forbidden_pairs"":[[""A1"",""B2""]],""options_A"":[{""cost"":11,""duration"":6,""id"":""A0"",""resource"":7},{""cost"":5,""duration"":2,""id"":""A1"",""resource"":4},{""cost"":9,""duration"":3,""id"":""A2"",""resource"":1},{""cost"":1,""duration"":8,""id"":""A3"",""resource"":1}],""options_B"":[{""cost"":15,""duration"":3,""id"":""B0"",""resource"":2},{""cost"":10,""duration"":4,""id"":""B1"",""resource"":5},{""cost"":9,""duration"":4,""id"":""B2"",""resource"":5},{""cost"":14,""duration"":2,""id"":""B3"",""resource"":7}],""resource_cap"":10}",exact_json
63
+ AF-RECOND-01-0283,compound_obstruction,"Choose one option from A and one from B. Their summed resource and duration must not exceed the caps, and forbidden_pairs cannot be chosen. Minimize total cost; break ties by A ID then B ID. Return JSON {""A"":ID,""B"":ID,""cost"":integer}. Data: {""duration_cap"":12,""forbidden_pairs"":[[""A2"",""B0""]],""options_A"":[{""cost"":8,""duration"":6,""id"":""A0"",""resource"":3},{""cost"":12,""duration"":8,""id"":""A1"",""resource"":5},{""cost"":5,""duration"":2,""id"":""A2"",""resource"":1},{""cost"":15,""duration"":6,""id"":""A3"",""resource"":7}],""options_B"":[{""cost"":2,""duration"":8,""id"":""B0"",""resource"":3},{""cost"":1,""duration"":7,""id"":""B1"",""resource"":7},{""cost"":4,""duration"":7,""id"":""B2"",""resource"":5},{""cost"":9,""duration"":5,""id"":""B3"",""resource"":3}],""resource_cap"":7}","{""A"":""A2"",""B"":""B2"",""cost"":9}","{""A"":""A2"",""B"":""B0""}","{""forbidden_pairs"":[[""A2"",""B0""]]}","{""duration_cap"":12,""forbidden_pairs"":[[""A2"",""B0""]],""options_A"":[{""cost"":8,""duration"":6,""id"":""A0"",""resource"":3},{""cost"":12,""duration"":8,""id"":""A1"",""resource"":5},{""cost"":5,""duration"":2,""id"":""A2"",""resource"":1},{""cost"":15,""duration"":6,""id"":""A3"",""resource"":7}],""options_B"":[{""cost"":2,""duration"":8,""id"":""B0"",""resource"":3},{""cost"":1,""duration"":7,""id"":""B1"",""resource"":7},{""cost"":4,""duration"":7,""id"":""B2"",""resource"":5},{""cost"":9,""duration"":5,""id"":""B3"",""resource"":3}],""resource_cap"":7}",exact_json
64
+ AF-RECOND-01-0040,constraint_invalidation,"A directed weighted graph has lost removed_edge. Find the minimum-cost remaining route from start to end. Break cost ties by lexicographically smallest complete path. Return JSON {""cost"":integer,""path"":[node,...]}. Data: {""edges"":[[""A"",""B"",7],[""A"",""C"",1],[""A"",""E"",3],[""A"",""F"",6],[""B"",""D"",8],[""C"",""D"",1],[""C"",""E"",1],[""D"",""F"",3]],""end"":""F"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F""],""removed_edge"":[""C"",""D""],""start"":""A""}","{""cost"":6,""path"":[""A"",""F""]}","{""cost"":5,""path"":[""A"",""C"",""D"",""F""]}","{""removed_edge"":[""C"",""D""]}","{""edges"":[[""A"",""B"",7],[""A"",""C"",1],[""A"",""E"",3],[""A"",""F"",6],[""B"",""D"",8],[""C"",""D"",1],[""C"",""E"",1],[""D"",""F"",3]],""end"":""F"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F""],""removed_edge"":[""C"",""D""],""start"":""A""}",exact_json
65
+ AF-RECOND-01-0378,nonclosure_recovery,"After excluding blocked nodes, enumerate all simple directed paths from start to end. Sort by (number of nodes in path, lexicographic node sequence). Return JSON {""count"":number of paths,""first_two"":[first two paths]}. Data: {""blocked"":[""E""],""edges"":[[""A"",""B""],[""A"",""C""],[""A"",""E""],[""B"",""C""],[""C"",""D""],[""C"",""E""],[""C"",""F""],[""D"",""F""],[""E"",""F""]],""end"":""F"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F""],""start"":""A""}","{""count"":4,""first_two"":[[""A"",""C"",""F""],[""A"",""B"",""C"",""F""]]}",null,"{""blocked"":[""E""]}","{""blocked"":[""E""],""edges"":[[""A"",""B""],[""A"",""C""],[""A"",""E""],[""B"",""C""],[""C"",""D""],[""C"",""E""],[""C"",""F""],[""D"",""F""],[""E"",""F""]],""end"":""F"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F""],""start"":""A""}",exact_json
66
+ AF-RECOND-01-0175,minimal_reconditioning,"Each option has three capability values. An option must meet each requirement unless that requirement is relaxed. Select an option and relaxation indices minimizing (sum of relaxation costs, number of relaxed requirements, option price, option ID, relaxation-index list), in that order. Return JSON {""option"":ID,""relax"":[zero-based indices],""total_cost"":option price plus relaxation costs}. Data: {""options"":[{""id"":""P0"",""price"":13,""values"":[6,9,10]},{""id"":""P1"",""price"":19,""values"":[5,9,9]},{""id"":""P2"",""price"":8,""values"":[2,8,2]},{""id"":""P3"",""price"":8,""values"":[9,3,7]},{""id"":""P4"",""price"":14,""values"":[6,6,9]}],""relaxation_costs"":[9,4,4],""requirements"":[8,5,8]}","{""option"":""P3"",""relax"":[1,2],""total_cost"":16}",null,"{""requirements"":[8,5,8]}","{""options"":[{""id"":""P0"",""price"":13,""values"":[6,9,10]},{""id"":""P1"",""price"":19,""values"":[5,9,9]},{""id"":""P2"",""price"":8,""values"":[2,8,2]},{""id"":""P3"",""price"":8,""values"":[9,3,7]},{""id"":""P4"",""price"":14,""values"":[6,6,9]}],""relaxation_costs"":[9,4,4],""requirements"":[8,5,8]}",exact_json
67
+ AF-RECOND-01-0093,constraint_invalidation,"A directed weighted graph has lost removed_edge. Find the minimum-cost remaining route from start to end. Break cost ties by lexicographically smallest complete path. Return JSON {""cost"":integer,""path"":[node,...]}. Data: {""edges"":[[""A"",""B"",7],[""A"",""C"",4],[""A"",""D"",7],[""B"",""D"",6],[""B"",""F"",2],[""C"",""D"",1],[""C"",""F"",3],[""D"",""E"",8],[""D"",""F"",5]],""end"":""F"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F""],""removed_edge"":[""C"",""F""],""start"":""A""}","{""cost"":9,""path"":[""A"",""B"",""F""]}","{""cost"":7,""path"":[""A"",""C"",""F""]}","{""removed_edge"":[""C"",""F""]}","{""edges"":[[""A"",""B"",7],[""A"",""C"",4],[""A"",""D"",7],[""B"",""D"",6],[""B"",""F"",2],[""C"",""D"",1],[""C"",""F"",3],[""D"",""E"",8],[""D"",""F"",5]],""end"":""F"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F""],""removed_edge"":[""C"",""F""],""start"":""A""}",exact_json
68
+ AF-RECOND-01-0327,nonclosure_recovery,"After excluding blocked nodes, enumerate all simple directed paths from start to end. Sort by (number of nodes in path, lexicographic node sequence). Return JSON {""count"":number of paths,""first_two"":[first two paths]}. Data: {""blocked"":[""D""],""edges"":[[""A"",""C""],[""A"",""D""],[""A"",""F""],[""B"",""C""],[""B"",""D""],[""B"",""E""],[""B"",""F""],[""B"",""G""],[""B"",""H""],[""C"",""E""],[""C"",""F""],[""C"",""G""],[""D"",""E""],[""D"",""F""],[""E"",""F""],[""E"",""G""],[""F"",""G""],[""F"",""H""],[""G"",""H""]],""end"":""H"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G"",""H""],""start"":""A""}","{""count"":8,""first_two"":[[""A"",""F"",""H""],[""A"",""C"",""F"",""H""]]}",null,"{""blocked"":[""D""]}","{""blocked"":[""D""],""edges"":[[""A"",""C""],[""A"",""D""],[""A"",""F""],[""B"",""C""],[""B"",""D""],[""B"",""E""],[""B"",""F""],[""B"",""G""],[""B"",""H""],[""C"",""E""],[""C"",""F""],[""C"",""G""],[""D"",""E""],[""D"",""F""],[""E"",""F""],[""E"",""G""],[""F"",""G""],[""F"",""H""],[""G"",""H""]],""end"":""H"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G"",""H""],""start"":""A""}",exact_json
69
+ AF-RECOND-01-0338,nonclosure_recovery,"After excluding blocked nodes, enumerate all simple directed paths from start to end. Sort by (number of nodes in path, lexicographic node sequence). Return JSON {""count"":number of paths,""first_two"":[first two paths]}. Data: {""blocked"":[""D""],""edges"":[[""A"",""B""],[""A"",""C""],[""A"",""D""],[""A"",""E""],[""B"",""D""],[""B"",""E""],[""B"",""F""],[""C"",""E""],[""C"",""F""],[""D"",""F""],[""D"",""G""],[""E"",""G""],[""F"",""H""]],""end"":""H"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G"",""H""],""start"":""A""}","{""count"":2,""first_two"":[[""A"",""B"",""F"",""H""],[""A"",""C"",""F"",""H""]]}",null,"{""blocked"":[""D""]}","{""blocked"":[""D""],""edges"":[[""A"",""B""],[""A"",""C""],[""A"",""D""],[""A"",""E""],[""B"",""D""],[""B"",""E""],[""B"",""F""],[""C"",""E""],[""C"",""F""],[""D"",""F""],[""D"",""G""],[""E"",""G""],[""F"",""H""]],""end"":""H"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G"",""H""],""start"":""A""}",exact_json
70
+ AF-RECOND-01-0387,nonclosure_recovery,"After excluding blocked nodes, enumerate all simple directed paths from start to end. Sort by (number of nodes in path, lexicographic node sequence). Return JSON {""count"":number of paths,""first_two"":[first two paths]}. Data: {""blocked"":[""D""],""edges"":[[""A"",""B""],[""A"",""D""],[""A"",""H""],[""B"",""F""],[""B"",""G""],[""B"",""H""],[""C"",""D""],[""C"",""E""],[""C"",""G""],[""D"",""F""],[""D"",""G""],[""E"",""F""],[""E"",""G""],[""F"",""G""],[""F"",""H""],[""G"",""H""]],""end"":""H"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G"",""H""],""start"":""A""}","{""count"":5,""first_two"":[[""A"",""H""],[""A"",""B"",""H""]]}",null,"{""blocked"":[""D""]}","{""blocked"":[""D""],""edges"":[[""A"",""B""],[""A"",""D""],[""A"",""H""],[""B"",""F""],[""B"",""G""],[""B"",""H""],[""C"",""D""],[""C"",""E""],[""C"",""G""],[""D"",""F""],[""D"",""G""],[""E"",""F""],[""E"",""G""],[""F"",""G""],[""F"",""H""],[""G"",""H""]],""end"":""H"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G"",""H""],""start"":""A""}",exact_json
71
+ AF-RECOND-01-0110,minimal_reconditioning,"Each option has three capability values. An option must meet each requirement unless that requirement is relaxed. Select an option and relaxation indices minimizing (sum of relaxation costs, number of relaxed requirements, option price, option ID, relaxation-index list), in that order. Return JSON {""option"":ID,""relax"":[zero-based indices],""total_cost"":option price plus relaxation costs}. Data: {""options"":[{""id"":""P0"",""price"":7,""values"":[10,2,2]},{""id"":""P1"",""price"":11,""values"":[3,1,1]},{""id"":""P2"",""price"":3,""values"":[7,3,8]},{""id"":""P3"",""price"":12,""values"":[5,7,8]},{""id"":""P4"",""price"":10,""values"":[4,6,2]}],""relaxation_costs"":[10,7,9],""requirements"":[8,4,4]}","{""option"":""P3"",""relax"":[0],""total_cost"":22}",null,"{""requirements"":[8,4,4]}","{""options"":[{""id"":""P0"",""price"":7,""values"":[10,2,2]},{""id"":""P1"",""price"":11,""values"":[3,1,1]},{""id"":""P2"",""price"":3,""values"":[7,3,8]},{""id"":""P3"",""price"":12,""values"":[5,7,8]},{""id"":""P4"",""price"":10,""values"":[4,6,2]}],""relaxation_costs"":[10,7,9],""requirements"":[8,4,4]}",exact_json
72
+ AF-RECOND-01-0303,nonclosure_recovery,"After excluding blocked nodes, enumerate all simple directed paths from start to end. Sort by (number of nodes in path, lexicographic node sequence). Return JSON {""count"":number of paths,""first_two"":[first two paths]}. Data: {""blocked"":[""D""],""edges"":[[""A"",""B""],[""A"",""C""],[""A"",""D""],[""A"",""E""],[""A"",""F""],[""B"",""D""],[""B"",""E""],[""B"",""F""],[""B"",""G""],[""C"",""G""],[""D"",""E""],[""D"",""G""],[""E"",""F""],[""E"",""G""]],""end"":""G"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G""],""start"":""A""}","{""count"":4,""first_two"":[[""A"",""B"",""G""],[""A"",""C"",""G""]]}",null,"{""blocked"":[""D""]}","{""blocked"":[""D""],""edges"":[[""A"",""B""],[""A"",""C""],[""A"",""D""],[""A"",""E""],[""A"",""F""],[""B"",""D""],[""B"",""E""],[""B"",""F""],[""B"",""G""],[""C"",""G""],[""D"",""E""],[""D"",""G""],[""E"",""F""],[""E"",""G""]],""end"":""G"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G""],""start"":""A""}",exact_json
73
+ AF-RECOND-01-0128,minimal_reconditioning,"Each option has three capability values. An option must meet each requirement unless that requirement is relaxed. Select an option and relaxation indices minimizing (sum of relaxation costs, number of relaxed requirements, option price, option ID, relaxation-index list), in that order. Return JSON {""option"":ID,""relax"":[zero-based indices],""total_cost"":option price plus relaxation costs}. Data: {""options"":[{""id"":""P0"",""price"":4,""values"":[1,4,9]},{""id"":""P1"",""price"":16,""values"":[7,3,9]},{""id"":""P2"",""price"":20,""values"":[4,6,9]},{""id"":""P3"",""price"":17,""values"":[2,9,8]},{""id"":""P4"",""price"":15,""values"":[6,5,10]}],""relaxation_costs"":[13,12,3],""requirements"":[5,7,3]}","{""option"":""P4"",""relax"":[1],""total_cost"":27}",null,"{""requirements"":[5,7,3]}","{""options"":[{""id"":""P0"",""price"":4,""values"":[1,4,9]},{""id"":""P1"",""price"":16,""values"":[7,3,9]},{""id"":""P2"",""price"":20,""values"":[4,6,9]},{""id"":""P3"",""price"":17,""values"":[2,9,8]},{""id"":""P4"",""price"":15,""values"":[6,5,10]}],""relaxation_costs"":[13,12,3],""requirements"":[5,7,3]}",exact_json
74
+ AF-RECOND-01-0174,minimal_reconditioning,"Each option has three capability values. An option must meet each requirement unless that requirement is relaxed. Select an option and relaxation indices minimizing (sum of relaxation costs, number of relaxed requirements, option price, option ID, relaxation-index list), in that order. Return JSON {""option"":ID,""relax"":[zero-based indices],""total_cost"":option price plus relaxation costs}. Data: {""options"":[{""id"":""P0"",""price"":5,""values"":[6,1,2]},{""id"":""P1"",""price"":15,""values"":[3,5,2]},{""id"":""P2"",""price"":15,""values"":[4,10,10]},{""id"":""P3"",""price"":20,""values"":[6,1,8]},{""id"":""P4"",""price"":5,""values"":[9,9,6]}],""relaxation_costs"":[13,13,3],""requirements"":[6,5,8]}","{""option"":""P4"",""relax"":[2],""total_cost"":8}",null,"{""requirements"":[6,5,8]}","{""options"":[{""id"":""P0"",""price"":5,""values"":[6,1,2]},{""id"":""P1"",""price"":15,""values"":[3,5,2]},{""id"":""P2"",""price"":15,""values"":[4,10,10]},{""id"":""P3"",""price"":20,""values"":[6,1,8]},{""id"":""P4"",""price"":5,""values"":[9,9,6]}],""relaxation_costs"":[13,13,3],""requirements"":[6,5,8]}",exact_json
75
+ AF-RECOND-01-0065,constraint_invalidation,"A directed weighted graph has lost removed_edge. Find the minimum-cost remaining route from start to end. Break cost ties by lexicographically smallest complete path. Return JSON {""cost"":integer,""path"":[node,...]}. Data: {""edges"":[[""A"",""C"",7],[""A"",""E"",4],[""A"",""F"",1],[""B"",""E"",5],[""B"",""F"",1],[""C"",""D"",9],[""C"",""E"",2],[""D"",""E"",2],[""D"",""F"",4],[""E"",""G"",7]],""end"":""G"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G""],""removed_edge"":[""A"",""E""],""start"":""A""}","{""cost"":16,""path"":[""A"",""C"",""E"",""G""]}","{""cost"":11,""path"":[""A"",""E"",""G""]}","{""removed_edge"":[""A"",""E""]}","{""edges"":[[""A"",""C"",7],[""A"",""E"",4],[""A"",""F"",1],[""B"",""E"",5],[""B"",""F"",1],[""C"",""D"",9],[""C"",""E"",2],[""D"",""E"",2],[""D"",""F"",4],[""E"",""G"",7]],""end"":""G"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F"",""G""],""removed_edge"":[""A"",""E""],""start"":""A""}",exact_json
76
+ AF-RECOND-01-0265,compound_obstruction,"Choose one option from A and one from B. Their summed resource and duration must not exceed the caps, and forbidden_pairs cannot be chosen. Minimize total cost; break ties by A ID then B ID. Return JSON {""A"":ID,""B"":ID,""cost"":integer}. Data: {""duration_cap"":13,""forbidden_pairs"":[[""A1"",""B1""]],""options_A"":[{""cost"":10,""duration"":1,""id"":""A0"",""resource"":3},{""cost"":1,""duration"":8,""id"":""A1"",""resource"":1},{""cost"":14,""duration"":7,""id"":""A2"",""resource"":7},{""cost"":11,""duration"":8,""id"":""A3"",""resource"":7}],""options_B"":[{""cost"":14,""duration"":6,""id"":""B0"",""resource"":7},{""cost"":10,""duration"":3,""id"":""B1"",""resource"":7},{""cost"":13,""duration"":8,""id"":""B2"",""resource"":1},{""cost"":14,""duration"":8,""id"":""B3"",""resource"":3}],""resource_cap"":11}","{""A"":""A0"",""B"":""B1"",""cost"":20}","{""A"":""A1"",""B"":""B1""}","{""forbidden_pairs"":[[""A1"",""B1""]]}","{""duration_cap"":13,""forbidden_pairs"":[[""A1"",""B1""]],""options_A"":[{""cost"":10,""duration"":1,""id"":""A0"",""resource"":3},{""cost"":1,""duration"":8,""id"":""A1"",""resource"":1},{""cost"":14,""duration"":7,""id"":""A2"",""resource"":7},{""cost"":11,""duration"":8,""id"":""A3"",""resource"":7}],""options_B"":[{""cost"":14,""duration"":6,""id"":""B0"",""resource"":7},{""cost"":10,""duration"":3,""id"":""B1"",""resource"":7},{""cost"":13,""duration"":8,""id"":""B2"",""resource"":1},{""cost"":14,""duration"":8,""id"":""B3"",""resource"":3}],""resource_cap"":11}",exact_json
77
+ AF-RECOND-01-0227,compound_obstruction,"Choose one option from A and one from B. Their summed resource and duration must not exceed the caps, and forbidden_pairs cannot be chosen. Minimize total cost; break ties by A ID then B ID. Return JSON {""A"":ID,""B"":ID,""cost"":integer}. Data: {""duration_cap"":9,""forbidden_pairs"":[[""A0"",""B0""]],""options_A"":[{""cost"":1,""duration"":2,""id"":""A0"",""resource"":1},{""cost"":5,""duration"":4,""id"":""A1"",""resource"":1},{""cost"":7,""duration"":6,""id"":""A2"",""resource"":2},{""cost"":7,""duration"":3,""id"":""A3"",""resource"":7}],""options_B"":[{""cost"":3,""duration"":7,""id"":""B0"",""resource"":6},{""cost"":9,""duration"":1,""id"":""B1"",""resource"":7},{""cost"":11,""duration"":5,""id"":""B2"",""resource"":2},{""cost"":3,""duration"":1,""id"":""B3"",""resource"":4}],""resource_cap"":7}","{""A"":""A0"",""B"":""B3"",""cost"":4}","{""A"":""A0"",""B"":""B0""}","{""forbidden_pairs"":[[""A0"",""B0""]]}","{""duration_cap"":9,""forbidden_pairs"":[[""A0"",""B0""]],""options_A"":[{""cost"":1,""duration"":2,""id"":""A0"",""resource"":1},{""cost"":5,""duration"":4,""id"":""A1"",""resource"":1},{""cost"":7,""duration"":6,""id"":""A2"",""resource"":2},{""cost"":7,""duration"":3,""id"":""A3"",""resource"":7}],""options_B"":[{""cost"":3,""duration"":7,""id"":""B0"",""resource"":6},{""cost"":9,""duration"":1,""id"":""B1"",""resource"":7},{""cost"":11,""duration"":5,""id"":""B2"",""resource"":2},{""cost"":3,""duration"":1,""id"":""B3"",""resource"":4}],""resource_cap"":7}",exact_json
78
+ AF-RECOND-01-0218,compound_obstruction,"Choose one option from A and one from B. Their summed resource and duration must not exceed the caps, and forbidden_pairs cannot be chosen. Minimize total cost; break ties by A ID then B ID. Return JSON {""A"":ID,""B"":ID,""cost"":integer}. Data: {""duration_cap"":8,""forbidden_pairs"":[[""A1"",""B3""]],""options_A"":[{""cost"":9,""duration"":8,""id"":""A0"",""resource"":3},{""cost"":2,""duration"":4,""id"":""A1"",""resource"":1},{""cost"":5,""duration"":8,""id"":""A2"",""resource"":4},{""cost"":6,""duration"":5,""id"":""A3"",""resource"":3}],""options_B"":[{""cost"":7,""duration"":7,""id"":""B0"",""resource"":5},{""cost"":14,""duration"":2,""id"":""B1"",""resource"":3},{""cost"":10,""duration"":6,""id"":""B2"",""resource"":5},{""cost"":11,""duration"":2,""id"":""B3"",""resource"":7}],""resource_cap"":8}","{""A"":""A1"",""B"":""B1"",""cost"":16}","{""A"":""A1"",""B"":""B3""}","{""forbidden_pairs"":[[""A1"",""B3""]]}","{""duration_cap"":8,""forbidden_pairs"":[[""A1"",""B3""]],""options_A"":[{""cost"":9,""duration"":8,""id"":""A0"",""resource"":3},{""cost"":2,""duration"":4,""id"":""A1"",""resource"":1},{""cost"":5,""duration"":8,""id"":""A2"",""resource"":4},{""cost"":6,""duration"":5,""id"":""A3"",""resource"":3}],""options_B"":[{""cost"":7,""duration"":7,""id"":""B0"",""resource"":5},{""cost"":14,""duration"":2,""id"":""B1"",""resource"":3},{""cost"":10,""duration"":6,""id"":""B2"",""resource"":5},{""cost"":11,""duration"":2,""id"":""B3"",""resource"":7}],""resource_cap"":8}",exact_json
79
+ AF-RECOND-01-0007,constraint_invalidation,"A directed weighted graph has lost removed_edge. Find the minimum-cost remaining route from start to end. Break cost ties by lexicographically smallest complete path. Return JSON {""cost"":integer,""path"":[node,...]}. Data: {""edges"":[[""A"",""B"",6],[""A"",""C"",1],[""B"",""C"",4],[""B"",""F"",1],[""C"",""F"",9]],""end"":""F"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F""],""removed_edge"":[""A"",""B""],""start"":""A""}","{""cost"":10,""path"":[""A"",""C"",""F""]}","{""cost"":7,""path"":[""A"",""B"",""F""]}","{""removed_edge"":[""A"",""B""]}","{""edges"":[[""A"",""B"",6],[""A"",""C"",1],[""B"",""C"",4],[""B"",""F"",1],[""C"",""F"",9]],""end"":""F"",""nodes"":[""A"",""B"",""C"",""D"",""E"",""F""],""removed_edge"":[""A"",""B""],""start"":""A""}",exact_json
80
+ AF-RECOND-01-0293,compound_obstruction,"Choose one option from A and one from B. Their summed resource and duration must not exceed the caps, and forbidden_pairs cannot be chosen. Minimize total cost; break ties by A ID then B ID. Return JSON {""A"":ID,""B"":ID,""cost"":integer}. Data: {""duration_cap"":12,""forbidden_pairs"":[[""A1"",""B0""]],""options_A"":[{""cost"":11,""duration"":7,""id"":""A0"",""resource"":4},{""cost"":3,""duration"":2,""id"":""A1"",""resource"":5},{""cost"":7,""duration"":2,""id"":""A2"",""resource"":6},{""cost"":9,""duration"":2,""id"":""A3"",""resource"":5}],""options_B"":[{""cost"":4,""duration"":4,""id"":""B0"",""resource"":3},{""cost"":9,""duration"":7,""id"":""B1"",""resource"":5},{""cost"":5,""duration"":1,""id"":""B2"",""resource"":5},{""cost"":13,""duration"":8,""id"":""B3"",""resource"":6}],""resource_cap"":8}","{""A"":""A3"",""B"":""B0"",""cost"":13}","{""A"":""A1"",""B"":""B0""}","{""forbidden_pairs"":[[""A1"",""B0""]]}","{""duration_cap"":12,""forbidden_pairs"":[[""A1"",""B0""]],""options_A"":[{""cost"":11,""duration"":7,""id"":""A0"",""resource"":4},{""cost"":3,""duration"":2,""id"":""A1"",""resource"":5},{""cost"":7,""duration"":2,""id"":""A2"",""resource"":6},{""cost"":9,""duration"":2,""id"":""A3"",""resource"":5}],""options_B"":[{""cost"":4,""duration"":4,""id"":""B0"",""resource"":3},{""cost"":9,""duration"":7,""id"":""B1"",""resource"":5},{""cost"":5,""duration"":1,""id"":""B2"",""resource"":5},{""cost"":13,""duration"":8,""id"":""B3"",""resource"":6}],""resource_cap"":8}",exact_json
81
+ AF-RECOND-01-0193,minimal_reconditioning,"Each option has three capability values. An option must meet each requirement unless that requirement is relaxed. Select an option and relaxation indices minimizing (sum of relaxation costs, number of relaxed requirements, option price, option ID, relaxation-index list), in that order. Return JSON {""option"":ID,""relax"":[zero-based indices],""total_cost"":option price plus relaxation costs}. Data: {""options"":[{""id"":""P0"",""price"":9,""values"":[4,1,1]},{""id"":""P1"",""price"":8,""values"":[5,10,6]},{""id"":""P2"",""price"":8,""values"":[6,6,3]},{""id"":""P3"",""price"":10,""values"":[2,4,7]},{""id"":""P4"",""price"":6,""values"":[1,10,3]}],""relaxation_costs"":[9,14,12],""requirements"":[3,5,8]}","{""option"":""P1"",""relax"":[2],""total_cost"":20}",null,"{""requirements"":[3,5,8]}","{""options"":[{""id"":""P0"",""price"":9,""values"":[4,1,1]},{""id"":""P1"",""price"":8,""values"":[5,10,6]},{""id"":""P2"",""price"":8,""values"":[6,6,3]},{""id"":""P3"",""price"":10,""values"":[2,4,7]},{""id"":""P4"",""price"":6,""values"":[1,10,3]}],""relaxation_costs"":[9,14,12],""requirements"":[3,5,8]}",exact_json
train (1).csv ADDED
The diff for this file is too large to render. See raw diff