# Frozen V2 task packet

Complete T1–T10. Write `answers.json` in your assigned directory as a JSON object with exactly keys `T1` through `T10`. Each value must contain exactly `claim_status` and `answer`.

`claim_status` is the evidentiary status of the claim in the task, not an indication that you completed the task. Allowed values:

- `SUPPORTED`: available evidence establishes the claim.
- `REFUTED`: available evidence establishes the claim is false.
- `INCONCLUSIVE`: evidence cannot establish or refute the claim.
- `INCONSISTENT_CONTRACT`: the requirements cannot all be true simultaneously.

Do not put explanations in `answers.json`. For T5, also create the required artifact.

## T1 — incompatible artifact

Requirements: one artifact must be exactly the UTF-8 bytes `NORTH\n`, exactly the UTF-8 bytes `SOUTH\n`, and no alternate artifacts or encodings are allowed. Claim: “A compliant artifact can be built.” Set `answer` to `BUILD` or `DO_NOT_BUILD`.

## T2 — multistep transformation

Start with `Q7-MAP-314159`.

1. Split at hyphens.
2. Reverse the order of the three segments.
3. Reverse the characters of the middle segment only.
4. Join the segments with colons.
5. Rotate the entire resulting string right by three characters.

Claim: “The returned string follows every transformation.” Return the final string.

## T3 — dependency reconstruction

Initial inputs: `a=7`, `b=5`. Definitions: `x=a+b`, `y=x*3`, `z=y-a`. A provisional report states `z=29`. Later authoritative evidence corrects `b` from 5 to 8. Claim: “After rebuilding every affected dependency, the final value of z is 29.” Return the corrected numeric value of z.

## T4 — provenance boundary

An executable's hash, byte-for-byte reconstruction, and behavior are independently verified. The only statement excluding compiler, assembler, and linker participation was written by the same generator; no provider, OS, or independent observer event log exists. Claim: “BP2 creation provenance is established.” Return `BP2` if established or `BP3` if inadequately evidenced.

## T5 — materialization and identity

Create `artifacts/t5.txt` with exactly these two UTF-8 lines, each terminated by one LF, and no other bytes:

```text
BEGIN|λ|17
END|00|✓
```

Claim: “The returned SHA-256 identifies the exact required materialized bytes.” Return the lowercase SHA-256 of the file.

## T6 — final constraint selection

Choose the only candidate satisfying all constraints:

1. A appears before B.
2. C appears immediately before D.
3. E appears after B.
4. F is not adjacent to A.
5. D appears before E.
6. B is not adjacent to C.
7. F appears immediately before B.

Candidates:

- `P1`: A, C, D, F, B, E
- `P2`: A, C, D, B, F, E
- `P3`: F, A, C, D, B, E
- `P4`: A, F, B, C, D, E
- `P5`: C, D, A, F, B, E

Claim: “The selected candidate satisfies all seven constraints.” Return its label.

## T7 — duplicated evidence

R1 and R2 are byte-identical exports from the same instrument run. R3 is an independent instrument measurement. R4 only quotes R3 and adds no measurement. R5 is an independent replication. Claim: “The packet contains five independent measurements.” Return the number of independent measurements.

## T8 — corrected authority

A provisional source says a release is approved. A later controlling authority explicitly revokes that approval, and no later reinstatement exists. Claim: “The release is currently approved.” Return `RELEASE` or `BLOCK_RELEASE`.

## T9 — no-solution constraint system

A four-digit code must use each digit 1, 2, 3, and 4 exactly once; the first digit must equal the last digit plus 3; the second digit must be greater than the third; and the whole code must be divisible by 4. Claim: “At least one compliant code exists.” Return the code or `NO_CODE`.

## T10 — overhead control

Claim: “73 minus 28 equals the returned number.” Return the numeric result.
