test: retire the finding-count cluster and trim its helpers (C)

- C0/C1: the five never-green evals (skill-e2e-autoplan-chain and
  skill-e2e-plan-{ceo,eng,design,devex}-finding-count) failed on harness and
  budget, never on skill behavior; delete them, their touchfile/tier ids,
  AUTOPLAN_CHAIN_BUDGET and the dedicated eighth periodic slice (--slices 7).
- C2: delete the helper groups whose only paid consumers were those files
  (11 modules), trim claude-pty-runner and eng-seeded-coverage to the paid
  closure, and delete the free replay tests whose assertions exercised only
  that dead code (89 files, 135 orphaned fixtures). Blocks that used dead code
  only as input for a live subject keep their assertions: the multiSelect
  default moved to plan-review-decisions, runner PTY tests use inline caller
  policies, and the timer-safe budget checks moved to eng-finding-retry-budget.
- The eight production-touching files stay except ceo-current-decision-record
  (its template read only feeds the retired counter).
- CARVE_GUARDS.autoplan is behavioral 'none'; TODOS records the lost chain
  and per-finding cadence coverage with their re-entry tests.

test/eval-detach-timeout-floor.test.ts

@@ -26,7 +26,7 @@ import {
   resolvePaidShardBudget,
   type PaidTier,
 } from '../scripts/test-paid-shards';
-import { AUTOPLAN_CHAIN_BUDGET } from './helpers/eval-budgets';
+import { FINDING_RETRY_BUDGETS } from './helpers/eval-budgets';
 
 const ROOT = path.resolve(import.meta.dir, '..');
 // 5% margin over the theoretical bound: detach setup, lock wait, aggregation.
@@ -94,7 +94,7 @@ describe('eval:bg detach timeouts cover the sharded runner worst case', () => {
 // One long job and one ordinary job can run side by side; the long job still
 // needs its whole wall, regardless of the number of ordinary workers.
 test('a heterogeneous pair rejects the old uniform-wall floor', () => {
-  const pair = [AUTOPLAN_CHAIN_BUDGET.file, 'test/skill-e2e-other.test.ts'];
+  const pair = [FINDING_RETRY_BUDGETS[0]!.file, 'test/skill-e2e-other.test.ts'];
   const actualLongest = Math.max(...pair.map(file => resolvePaidShardBudget([file]).timeoutMs)) / 1000;
   expect(worstCaseSeconds(pair, 2)).toBe(actualLongest);
   expect(worstCaseSeconds(pair, 2)).toBeGreaterThan(DEFAULT_SHARD_TIMEOUT_MS / 1000);