{
  "generated_at_utc": "2026-10-08T22:58:57.219901+00:00",
  "source_commit": "fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb",
  "status": "passed",
  "checks": 40,
  "passed": 40,
  "cases": [
    {
      "name": "generated-nine-job-heuristic-counterexample",
      "model_origin": "self-authored finite control, not customer or published benchmark",
      "input": {
        "job_ids": [
          "0",
          "1",
          "2",
          "3",
          "4",
          "5",
          "6",
          "7",
          "8"
        ],
        "precedence": [
          [
            "0",
            "5"
          ],
          [
            "1",
            "6"
          ],
          [
            "2",
            "4"
          ],
          [
            "2",
            "5"
          ],
          [
            "3",
            "4"
          ],
          [
            "5",
            "6"
          ],
          [
            "5",
            "7"
          ],
          [
            "5",
            "8"
          ]
        ],
        "model": {
          "machine_count": 3,
          "processing_times": "all_one",
          "nonpreemptive": true,
          "machines": "identical",
          "release_times": "all_zero",
          "communication_delays": "none",
          "eligibility": "all_machines",
          "additional_resources": "none"
        },
        "deadline": 3
      },
      "input_sha256": "5f07ef188247622754aeca57cb53e31d2f8cb0d31de1f75595332f1749321e54",
      "expected_optimum": 3,
      "comparison": {
        "status": "proposal_checked",
        "ortools_version": "9.15.6755",
        "solver_status": "OPTIMAL",
        "proposed_slots": [
          [
            "0",
            "2",
            "3"
          ],
          [
            "1",
            "4",
            "5"
          ],
          [
            "6",
            "7",
            "8"
          ]
        ],
        "direct_witness_audit": {
          "valid": true,
          "makespan": 3,
          "errors": []
        },
        "input_proposed_schedule_audit": null,
        "solver_objective": 3,
        "solver_reported_lower_bound": 3.0,
        "solver_reported_wall_time_seconds": 0.033010000000000005,
        "solver_limits": {
          "seconds": 2.0,
          "workers": 1,
          "random_seed": 124
        },
        "independently_certified_optimum": 3,
        "proposal_matches_independent_optimum": true,
        "independently_evaluated_deadline": {
          "feasible": true,
          "basis": "checked_schedule_meets_deadline"
        },
        "independent_reference": {
          "status": "complete",
          "exact_optimum": 3,
          "optimal_slots": [
            [
              "0",
              "2",
              "3"
            ],
            [
              "1",
              "4",
              "5"
            ],
            [
              "6",
              "7",
              "8"
            ]
          ],
          "feasibility_by_deadline": {
            "feasible": true,
            "basis": "checked_schedule_meets_deadline"
          },
          "deadline": 3,
          "lower_bound": 3,
          "lower_bound_components": {
            "capacity": 3,
            "longest_precedence_chain": 3
          },
          "valid_upper_bound": 3,
          "upper_bound_slots": [
            [
              "0",
              "2",
              "3"
            ],
            [
              "1",
              "4",
              "5"
            ],
            [
              "6",
              "7",
              "8"
            ]
          ],
          "proposed_schedule_audit": {
            "valid": true,
            "makespan": 3,
            "errors": []
          },
          "states": 0,
          "transitions": 0,
          "limits": {
            "jobs": 18,
            "states": 50000,
            "transitions": 2000000
          },
          "input_sha256": "40436a6fa043a53b808d903e9f5a75e7838545591abb4333f0e112efeb840f06",
          "source_connection": {
            "family": "124",
            "source_commit": "fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb",
            "source_polynomial_algorithm_implemented": false,
            "source_exponent": 150020
          },
          "algorithm": "Breadth-first search of completed-job ideals; exponential in the number of jobs, with hard resource caps.",
          "source_proof_verification": "not_run",
          "formal_program_verification": "not_run",
          "interpretation": "Exact finite optimum only after completed search or an independently checked witness attaining an elementary lower bound. A valid schedule is not alone an optimality certificate. No claim for unequal jobs, eligibility, release dates, setup, communication delay or general production scheduling.",
          "completion_basis": "checked_witness_attains_elementary_lower_bound"
        },
        "model_text_sha256": "5f7244c34ac3d076ec01234235bc99031f02d42391b629f11b59123cf2030a4b",
        "model_text_hash_interpretation": "UTF-8 text of this runtime model proto, not a cross-version canonical encoding.",
        "source_polynomial_algorithm_implemented": false,
        "source_proof_verification": "not_run",
        "formal_program_verification": "not_run",
        "interpretation": "CP-SAT status and bound are solver reports. Independent finite optimality requires completed reference search or a directly checked schedule attaining its elementary lower bound. No performance comparison or broader model guarantee is inferred."
      }
    },
    {
      "name": "generated-six-job-synchronization-bottleneck",
      "model_origin": "self-authored finite control, not customer or published benchmark",
      "input": {
        "job_ids": [
          "0",
          "1",
          "2",
          "3",
          "4",
          "5"
        ],
        "precedence": [
          [
            "0",
            "1"
          ],
          [
            "0",
            "4"
          ],
          [
            "0",
            "5"
          ],
          [
            "2",
            "3"
          ]
        ],
        "model": {
          "machine_count": 3,
          "processing_times": "all_one",
          "nonpreemptive": true,
          "machines": "identical",
          "release_times": "all_zero",
          "communication_delays": "none",
          "eligibility": "all_machines",
          "additional_resources": "none"
        },
        "deadline": 2
      },
      "input_sha256": "c7c815e33ad7371857234508fabfef497ae6161f2917da096df1a8139ffb1ec4",
      "expected_optimum": 3,
      "comparison": {
        "status": "proposal_checked",
        "ortools_version": "9.15.6755",
        "solver_status": "OPTIMAL",
        "proposed_slots": [
          [
            "0",
            "2"
          ],
          [
            "1",
            "3",
            "5"
          ],
          [
            "4"
          ]
        ],
        "direct_witness_audit": {
          "valid": true,
          "makespan": 3,
          "errors": []
        },
        "input_proposed_schedule_audit": null,
        "solver_objective": 3,
        "solver_reported_lower_bound": 3.0,
        "solver_reported_wall_time_seconds": 0.000478,
        "solver_limits": {
          "seconds": 2.0,
          "workers": 1,
          "random_seed": 124
        },
        "independently_certified_optimum": 3,
        "proposal_matches_independent_optimum": true,
        "independently_evaluated_deadline": {
          "feasible": false,
          "basis": "complete_exact_search"
        },
        "independent_reference": {
          "status": "complete",
          "exact_optimum": 3,
          "optimal_slots": [
            [
              "0",
              "2"
            ],
            [
              "1",
              "3",
              "4"
            ],
            [
              "5"
            ]
          ],
          "feasibility_by_deadline": {
            "feasible": false,
            "basis": "complete_exact_search"
          },
          "deadline": 2,
          "lower_bound": 2,
          "lower_bound_components": {
            "capacity": 2,
            "longest_precedence_chain": 2
          },
          "valid_upper_bound": 3,
          "upper_bound_slots": [
            [
              "0",
              "2"
            ],
            [
              "1",
              "3",
              "4"
            ],
            [
              "5"
            ]
          ],
          "proposed_schedule_audit": {
            "valid": true,
            "makespan": 3,
            "errors": []
          },
          "states": 27,
          "transitions": 35,
          "limits": {
            "jobs": 18,
            "states": 50000,
            "transitions": 2000000
          },
          "input_sha256": "63d70674a61c6c916d4383c3c0c56dfe066a32c16cd700f9737d65406efa486f",
          "source_connection": {
            "family": "124",
            "source_commit": "fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb",
            "source_polynomial_algorithm_implemented": false,
            "source_exponent": 150020
          },
          "algorithm": "Breadth-first search of completed-job ideals; exponential in the number of jobs, with hard resource caps.",
          "source_proof_verification": "not_run",
          "formal_program_verification": "not_run",
          "interpretation": "Exact finite optimum only after completed search or an independently checked witness attaining an elementary lower bound. A valid schedule is not alone an optimality certificate. No claim for unequal jobs, eligibility, release dates, setup, communication delay or general production scheduling.",
          "completion_basis": "complete_breadth_first_search"
        },
        "model_text_sha256": "d0495dc5aeb26fe8edaf96a0be5fa8128304ce4d39adb24844b404f5937d7f50",
        "model_text_hash_interpretation": "UTF-8 text of this runtime model proto, not a cross-version canonical encoding.",
        "source_polynomial_algorithm_implemented": false,
        "source_proof_verification": "not_run",
        "formal_program_verification": "not_run",
        "interpretation": "CP-SAT status and bound are solver reports. Independent finite optimality requires completed reference search or a directly checked schedule attaining its elementary lower bound. No performance comparison or broader model guarantee is inferred."
      }
    },
    {
      "name": "generated-independent-18",
      "model_origin": "self-authored finite control, not customer or published benchmark",
      "input": {
        "job_ids": [
          "0",
          "1",
          "2",
          "3",
          "4",
          "5",
          "6",
          "7",
          "8",
          "9",
          "10",
          "11",
          "12",
          "13",
          "14",
          "15",
          "16",
          "17"
        ],
        "precedence": [],
        "model": {
          "machine_count": 3,
          "processing_times": "all_one",
          "nonpreemptive": true,
          "machines": "identical",
          "release_times": "all_zero",
          "communication_delays": "none",
          "eligibility": "all_machines",
          "additional_resources": "none"
        },
        "deadline": 6
      },
      "input_sha256": "ca766f93bd4fa92f1ce51f53a4b3b82b966894b822f469ab1d67958d6fb77ff9",
      "expected_optimum": 6,
      "comparison": {
        "status": "proposal_checked",
        "ortools_version": "9.15.6755",
        "solver_status": "FEASIBLE",
        "proposed_slots": [
          [
            "5",
            "10",
            "16"
          ],
          [
            "3",
            "13",
            "14"
          ],
          [
            "2",
            "6",
            "15"
          ],
          [
            "0",
            "4",
            "12"
          ],
          [
            "9",
            "11",
            "17"
          ],
          [
            "1",
            "7",
            "8"
          ]
        ],
        "direct_witness_audit": {
          "valid": true,
          "makespan": 6,
          "errors": []
        },
        "input_proposed_schedule_audit": null,
        "solver_objective": 6,
        "solver_reported_lower_bound": 1.0,
        "solver_reported_wall_time_seconds": 2.0007010000000003,
        "solver_limits": {
          "seconds": 2.0,
          "workers": 1,
          "random_seed": 124
        },
        "independently_certified_optimum": 6,
        "proposal_matches_independent_optimum": true,
        "independently_evaluated_deadline": {
          "feasible": true,
          "basis": "checked_schedule_meets_deadline"
        },
        "independent_reference": {
          "status": "complete",
          "exact_optimum": 6,
          "optimal_slots": [
            [
              "0",
              "1",
              "2"
            ],
            [
              "3",
              "4",
              "5"
            ],
            [
              "6",
              "7",
              "8"
            ],
            [
              "9",
              "10",
              "11"
            ],
            [
              "12",
              "13",
              "14"
            ],
            [
              "15",
              "16",
              "17"
            ]
          ],
          "feasibility_by_deadline": {
            "feasible": true,
            "basis": "checked_schedule_meets_deadline"
          },
          "deadline": 6,
          "lower_bound": 6,
          "lower_bound_components": {
            "capacity": 6,
            "longest_precedence_chain": 1
          },
          "valid_upper_bound": 6,
          "upper_bound_slots": [
            [
              "0",
              "1",
              "2"
            ],
            [
              "3",
              "4",
              "5"
            ],
            [
              "6",
              "7",
              "8"
            ],
            [
              "9",
              "10",
              "11"
            ],
            [
              "12",
              "13",
              "14"
            ],
            [
              "15",
              "16",
              "17"
            ]
          ],
          "proposed_schedule_audit": {
            "valid": true,
            "makespan": 6,
            "errors": []
          },
          "states": 0,
          "transitions": 0,
          "limits": {
            "jobs": 18,
            "states": 50000,
            "transitions": 2000000
          },
          "input_sha256": "87328a67f20d8fcb02733656dce0ce50b3d0cb816d596e182c04880a1888c498",
          "source_connection": {
            "family": "124",
            "source_commit": "fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb",
            "source_polynomial_algorithm_implemented": false,
            "source_exponent": 150020
          },
          "algorithm": "Breadth-first search of completed-job ideals; exponential in the number of jobs, with hard resource caps.",
          "source_proof_verification": "not_run",
          "formal_program_verification": "not_run",
          "interpretation": "Exact finite optimum only after completed search or an independently checked witness attaining an elementary lower bound. A valid schedule is not alone an optimality certificate. No claim for unequal jobs, eligibility, release dates, setup, communication delay or general production scheduling.",
          "completion_basis": "checked_witness_attains_elementary_lower_bound"
        },
        "model_text_sha256": "152c5b61bfa392c8b4b199a7b8ea32e2d43f0dbf0c59fe5037b1ef1cd293135a",
        "model_text_hash_interpretation": "UTF-8 text of this runtime model proto, not a cross-version canonical encoding.",
        "source_polynomial_algorithm_implemented": false,
        "source_proof_verification": "not_run",
        "formal_program_verification": "not_run",
        "interpretation": "CP-SAT status and bound are solver reports. Independent finite optimality requires completed reference search or a directly checked schedule attaining its elementary lower bound. No performance comparison or broader model guarantee is inferred."
      }
    },
    {
      "name": "generated-chain-18",
      "model_origin": "self-authored finite control, not customer or published benchmark",
      "input": {
        "job_ids": [
          "0",
          "1",
          "2",
          "3",
          "4",
          "5",
          "6",
          "7",
          "8",
          "9",
          "10",
          "11",
          "12",
          "13",
          "14",
          "15",
          "16",
          "17"
        ],
        "precedence": [
          [
            "0",
            "1"
          ],
          [
            "1",
            "2"
          ],
          [
            "2",
            "3"
          ],
          [
            "3",
            "4"
          ],
          [
            "4",
            "5"
          ],
          [
            "5",
            "6"
          ],
          [
            "6",
            "7"
          ],
          [
            "7",
            "8"
          ],
          [
            "8",
            "9"
          ],
          [
            "9",
            "10"
          ],
          [
            "10",
            "11"
          ],
          [
            "11",
            "12"
          ],
          [
            "12",
            "13"
          ],
          [
            "13",
            "14"
          ],
          [
            "14",
            "15"
          ],
          [
            "15",
            "16"
          ],
          [
            "16",
            "17"
          ]
        ],
        "model": {
          "machine_count": 3,
          "processing_times": "all_one",
          "nonpreemptive": true,
          "machines": "identical",
          "release_times": "all_zero",
          "communication_delays": "none",
          "eligibility": "all_machines",
          "additional_resources": "none"
        },
        "deadline": 17
      },
      "input_sha256": "dc6e24389d60e9435b364224f8d4cec24e715e307413d7c8eaaecbf25f2ce9f1",
      "expected_optimum": 18,
      "comparison": {
        "status": "proposal_checked",
        "ortools_version": "9.15.6755",
        "solver_status": "OPTIMAL",
        "proposed_slots": [
          [
            "0"
          ],
          [
            "1"
          ],
          [
            "2"
          ],
          [
            "3"
          ],
          [
            "4"
          ],
          [
            "5"
          ],
          [
            "6"
          ],
          [
            "7"
          ],
          [
            "8"
          ],
          [
            "9"
          ],
          [
            "10"
          ],
          [
            "11"
          ],
          [
            "12"
          ],
          [
            "13"
          ],
          [
            "14"
          ],
          [
            "15"
          ],
          [
            "16"
          ],
          [
            "17"
          ]
        ],
        "direct_witness_audit": {
          "valid": true,
          "makespan": 18,
          "errors": []
        },
        "input_proposed_schedule_audit": null,
        "solver_objective": 18,
        "solver_reported_lower_bound": 18.0,
        "solver_reported_wall_time_seconds": 0.00037000000000000005,
        "solver_limits": {
          "seconds": 2.0,
          "workers": 1,
          "random_seed": 124
        },
        "independently_certified_optimum": 18,
        "proposal_matches_independent_optimum": true,
        "independently_evaluated_deadline": {
          "feasible": false,
          "basis": "elementary_lower_bound_exceeds_deadline"
        },
        "independent_reference": {
          "status": "complete",
          "exact_optimum": 18,
          "optimal_slots": [
            [
              "0"
            ],
            [
              "1"
            ],
            [
              "2"
            ],
            [
              "3"
            ],
            [
              "4"
            ],
            [
              "5"
            ],
            [
              "6"
            ],
            [
              "7"
            ],
            [
              "8"
            ],
            [
              "9"
            ],
            [
              "10"
            ],
            [
              "11"
            ],
            [
              "12"
            ],
            [
              "13"
            ],
            [
              "14"
            ],
            [
              "15"
            ],
            [
              "16"
            ],
            [
              "17"
            ]
          ],
          "feasibility_by_deadline": {
            "feasible": false,
            "basis": "elementary_lower_bound_exceeds_deadline"
          },
          "deadline": 17,
          "lower_bound": 18,
          "lower_bound_components": {
            "capacity": 6,
            "longest_precedence_chain": 18
          },
          "valid_upper_bound": 18,
          "upper_bound_slots": [
            [
              "0"
            ],
            [
              "1"
            ],
            [
              "2"
            ],
            [
              "3"
            ],
            [
              "4"
            ],
            [
              "5"
            ],
            [
              "6"
            ],
            [
              "7"
            ],
            [
              "8"
            ],
            [
              "9"
            ],
            [
              "10"
            ],
            [
              "11"
            ],
            [
              "12"
            ],
            [
              "13"
            ],
            [
              "14"
            ],
            [
              "15"
            ],
            [
              "16"
            ],
            [
              "17"
            ]
          ],
          "proposed_schedule_audit": {
            "valid": true,
            "makespan": 18,
            "errors": []
          },
          "states": 0,
          "transitions": 0,
          "limits": {
            "jobs": 18,
            "states": 50000,
            "transitions": 2000000
          },
          "input_sha256": "bca74213fd0dbcc1c2c5b89055aa04b01964507b2f606ad50e176112cf40a2f7",
          "source_connection": {
            "family": "124",
            "source_commit": "fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb",
            "source_polynomial_algorithm_implemented": false,
            "source_exponent": 150020
          },
          "algorithm": "Breadth-first search of completed-job ideals; exponential in the number of jobs, with hard resource caps.",
          "source_proof_verification": "not_run",
          "formal_program_verification": "not_run",
          "interpretation": "Exact finite optimum only after completed search or an independently checked witness attaining an elementary lower bound. A valid schedule is not alone an optimality certificate. No claim for unequal jobs, eligibility, release dates, setup, communication delay or general production scheduling.",
          "completion_basis": "checked_witness_attains_elementary_lower_bound"
        },
        "model_text_sha256": "24437339836ca0fd7970486a9dcc36df5e0c3d96799808591653bd18e9de9b06",
        "model_text_hash_interpretation": "UTF-8 text of this runtime model proto, not a cross-version canonical encoding.",
        "source_polynomial_algorithm_implemented": false,
        "source_proof_verification": "not_run",
        "formal_program_verification": "not_run",
        "interpretation": "CP-SAT status and bound are solver reports. Independent finite optimality requires completed reference search or a directly checked schedule attaining its elementary lower bound. No performance comparison or broader model guarantee is inferred."
      }
    },
    {
      "name": "generated-two-stage-barrier-12",
      "model_origin": "self-authored finite control, not customer or published benchmark",
      "input": {
        "job_ids": [
          "0",
          "1",
          "2",
          "3",
          "4",
          "5",
          "6",
          "7",
          "8",
          "9",
          "10",
          "11"
        ],
        "precedence": [
          [
            "0",
            "6"
          ],
          [
            "0",
            "7"
          ],
          [
            "0",
            "8"
          ],
          [
            "0",
            "9"
          ],
          [
            "0",
            "10"
          ],
          [
            "0",
            "11"
          ],
          [
            "1",
            "6"
          ],
          [
            "1",
            "7"
          ],
          [
            "1",
            "8"
          ],
          [
            "1",
            "9"
          ],
          [
            "1",
            "10"
          ],
          [
            "1",
            "11"
          ],
          [
            "2",
            "6"
          ],
          [
            "2",
            "7"
          ],
          [
            "2",
            "8"
          ],
          [
            "2",
            "9"
          ],
          [
            "2",
            "10"
          ],
          [
            "2",
            "11"
          ],
          [
            "3",
            "6"
          ],
          [
            "3",
            "7"
          ],
          [
            "3",
            "8"
          ],
          [
            "3",
            "9"
          ],
          [
            "3",
            "10"
          ],
          [
            "3",
            "11"
          ],
          [
            "4",
            "6"
          ],
          [
            "4",
            "7"
          ],
          [
            "4",
            "8"
          ],
          [
            "4",
            "9"
          ],
          [
            "4",
            "10"
          ],
          [
            "4",
            "11"
          ],
          [
            "5",
            "6"
          ],
          [
            "5",
            "7"
          ],
          [
            "5",
            "8"
          ],
          [
            "5",
            "9"
          ],
          [
            "5",
            "10"
          ],
          [
            "5",
            "11"
          ]
        ],
        "model": {
          "machine_count": 3,
          "processing_times": "all_one",
          "nonpreemptive": true,
          "machines": "identical",
          "release_times": "all_zero",
          "communication_delays": "none",
          "eligibility": "all_machines",
          "additional_resources": "none"
        },
        "deadline": 4
      },
      "input_sha256": "30c76bef2a74dc135d2b2c3af12bcec18594631a494fb0450debf6e56b448074",
      "expected_optimum": 4,
      "comparison": {
        "status": "proposal_checked",
        "ortools_version": "9.15.6755",
        "solver_status": "OPTIMAL",
        "proposed_slots": [
          [
            "1",
            "2",
            "5"
          ],
          [
            "0",
            "3",
            "4"
          ],
          [
            "8",
            "9",
            "11"
          ],
          [
            "6",
            "7",
            "10"
          ]
        ],
        "direct_witness_audit": {
          "valid": true,
          "makespan": 4,
          "errors": []
        },
        "input_proposed_schedule_audit": null,
        "solver_objective": 4,
        "solver_reported_lower_bound": 4.0,
        "solver_reported_wall_time_seconds": 0.00144,
        "solver_limits": {
          "seconds": 2.0,
          "workers": 1,
          "random_seed": 124
        },
        "independently_certified_optimum": 4,
        "proposal_matches_independent_optimum": true,
        "independently_evaluated_deadline": {
          "feasible": true,
          "basis": "checked_schedule_meets_deadline"
        },
        "independent_reference": {
          "status": "complete",
          "exact_optimum": 4,
          "optimal_slots": [
            [
              "0",
              "1",
              "2"
            ],
            [
              "3",
              "4",
              "5"
            ],
            [
              "6",
              "7",
              "8"
            ],
            [
              "9",
              "10",
              "11"
            ]
          ],
          "feasibility_by_deadline": {
            "feasible": true,
            "basis": "checked_schedule_meets_deadline"
          },
          "deadline": 4,
          "lower_bound": 4,
          "lower_bound_components": {
            "capacity": 4,
            "longest_precedence_chain": 2
          },
          "valid_upper_bound": 4,
          "upper_bound_slots": [
            [
              "0",
              "1",
              "2"
            ],
            [
              "3",
              "4",
              "5"
            ],
            [
              "6",
              "7",
              "8"
            ],
            [
              "9",
              "10",
              "11"
            ]
          ],
          "proposed_schedule_audit": {
            "valid": true,
            "makespan": 4,
            "errors": []
          },
          "states": 0,
          "transitions": 0,
          "limits": {
            "jobs": 18,
            "states": 50000,
            "transitions": 2000000
          },
          "input_sha256": "4f98c2263c0872f3c4f56e352146f439adf33bf711a99a1883d18a5762da8159",
          "source_connection": {
            "family": "124",
            "source_commit": "fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb",
            "source_polynomial_algorithm_implemented": false,
            "source_exponent": 150020
          },
          "algorithm": "Breadth-first search of completed-job ideals; exponential in the number of jobs, with hard resource caps.",
          "source_proof_verification": "not_run",
          "formal_program_verification": "not_run",
          "interpretation": "Exact finite optimum only after completed search or an independently checked witness attaining an elementary lower bound. A valid schedule is not alone an optimality certificate. No claim for unequal jobs, eligibility, release dates, setup, communication delay or general production scheduling.",
          "completion_basis": "checked_witness_attains_elementary_lower_bound"
        },
        "model_text_sha256": "4022b3a16f9ec321042f84e8070d76998135406e85e066647abb6010ee64d131",
        "model_text_hash_interpretation": "UTF-8 text of this runtime model proto, not a cross-version canonical encoding.",
        "source_polynomial_algorithm_implemented": false,
        "source_proof_verification": "not_run",
        "formal_program_verification": "not_run",
        "interpretation": "CP-SAT status and bound are solver reports. Independent finite optimality requires completed reference search or a directly checked schedule attaining its elementary lower bound. No performance comparison or broader model guarantee is inferred."
      }
    },
    {
      "name": "generated-unbalanced-fork-8",
      "model_origin": "self-authored finite control, not customer or published benchmark",
      "input": {
        "job_ids": [
          "0",
          "1",
          "2",
          "3",
          "4",
          "5",
          "6",
          "7"
        ],
        "precedence": [
          [
            "0",
            "1"
          ],
          [
            "0",
            "2"
          ],
          [
            "0",
            "3"
          ],
          [
            "0",
            "4"
          ],
          [
            "0",
            "5"
          ],
          [
            "0",
            "6"
          ],
          [
            "0",
            "7"
          ]
        ],
        "model": {
          "machine_count": 3,
          "processing_times": "all_one",
          "nonpreemptive": true,
          "machines": "identical",
          "release_times": "all_zero",
          "communication_delays": "none",
          "eligibility": "all_machines",
          "additional_resources": "none"
        },
        "deadline": 3
      },
      "input_sha256": "ef2a9086f71415314f9cefec6fbdb74eb988247c44de848ad5ffd5afc7e3347d",
      "expected_optimum": 4,
      "comparison": {
        "status": "proposal_checked",
        "ortools_version": "9.15.6755",
        "solver_status": "OPTIMAL",
        "proposed_slots": [
          [
            "0"
          ],
          [
            "1",
            "4",
            "5"
          ],
          [
            "2",
            "3",
            "7"
          ],
          [
            "6"
          ]
        ],
        "direct_witness_audit": {
          "valid": true,
          "makespan": 4,
          "errors": []
        },
        "input_proposed_schedule_audit": null,
        "solver_objective": 4,
        "solver_reported_lower_bound": 4.0,
        "solver_reported_wall_time_seconds": 0.000586,
        "solver_limits": {
          "seconds": 2.0,
          "workers": 1,
          "random_seed": 124
        },
        "independently_certified_optimum": 4,
        "proposal_matches_independent_optimum": true,
        "independently_evaluated_deadline": {
          "feasible": false,
          "basis": "complete_exact_search"
        },
        "independent_reference": {
          "status": "complete",
          "exact_optimum": 4,
          "optimal_slots": [
            [
              "0"
            ],
            [
              "1",
              "2",
              "3"
            ],
            [
              "4",
              "5",
              "6"
            ],
            [
              "7"
            ]
          ],
          "feasibility_by_deadline": {
            "feasible": false,
            "basis": "complete_exact_search"
          },
          "deadline": 3,
          "lower_bound": 3,
          "lower_bound_components": {
            "capacity": 3,
            "longest_precedence_chain": 2
          },
          "valid_upper_bound": 4,
          "upper_bound_slots": [
            [
              "0"
            ],
            [
              "1",
              "2",
              "3"
            ],
            [
              "4",
              "5",
              "6"
            ],
            [
              "7"
            ]
          ],
          "proposed_schedule_audit": {
            "valid": true,
            "makespan": 4,
            "errors": []
          },
          "states": 129,
          "transitions": 1367,
          "limits": {
            "jobs": 18,
            "states": 50000,
            "transitions": 2000000
          },
          "input_sha256": "9bc8ca56e61c870b2d124dab07f9be117c77ab9a80e928baaf8125d5c5ff3c47",
          "source_connection": {
            "family": "124",
            "source_commit": "fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb",
            "source_polynomial_algorithm_implemented": false,
            "source_exponent": 150020
          },
          "algorithm": "Breadth-first search of completed-job ideals; exponential in the number of jobs, with hard resource caps.",
          "source_proof_verification": "not_run",
          "formal_program_verification": "not_run",
          "interpretation": "Exact finite optimum only after completed search or an independently checked witness attaining an elementary lower bound. A valid schedule is not alone an optimality certificate. No claim for unequal jobs, eligibility, release dates, setup, communication delay or general production scheduling.",
          "completion_basis": "complete_breadth_first_search"
        },
        "model_text_sha256": "5fe02dd1d87707ee8ded83e479c9c3b0a9bf80a0b6bb1697e0de45328737368b",
        "model_text_hash_interpretation": "UTF-8 text of this runtime model proto, not a cross-version canonical encoding.",
        "source_polynomial_algorithm_implemented": false,
        "source_proof_verification": "not_run",
        "formal_program_verification": "not_run",
        "interpretation": "CP-SAT status and bound are solver reports. Independent finite optimality requires completed reference search or a directly checked schedule attaining its elementary lower bound. No performance comparison or broader model guarantee is inferred."
      }
    },
    {
      "name": "generated-diamond-4",
      "model_origin": "self-authored finite control, not customer or published benchmark",
      "input": {
        "job_ids": [
          "0",
          "1",
          "2",
          "3"
        ],
        "precedence": [
          [
            "0",
            "1"
          ],
          [
            "0",
            "2"
          ],
          [
            "1",
            "3"
          ],
          [
            "2",
            "3"
          ]
        ],
        "model": {
          "machine_count": 3,
          "processing_times": "all_one",
          "nonpreemptive": true,
          "machines": "identical",
          "release_times": "all_zero",
          "communication_delays": "none",
          "eligibility": "all_machines",
          "additional_resources": "none"
        },
        "deadline": 3
      },
      "input_sha256": "7443d34a892070aebda8f668d4bf2c7b286ed5aec0cb31c6ad0b854c252fac0d",
      "expected_optimum": 3,
      "comparison": {
        "status": "proposal_checked",
        "ortools_version": "9.15.6755",
        "solver_status": "OPTIMAL",
        "proposed_slots": [
          [
            "0"
          ],
          [
            "1",
            "2"
          ],
          [
            "3"
          ]
        ],
        "direct_witness_audit": {
          "valid": true,
          "makespan": 3,
          "errors": []
        },
        "input_proposed_schedule_audit": null,
        "solver_objective": 3,
        "solver_reported_lower_bound": 3.0,
        "solver_reported_wall_time_seconds": 0.000384,
        "solver_limits": {
          "seconds": 2.0,
          "workers": 1,
          "random_seed": 124
        },
        "independently_certified_optimum": 3,
        "proposal_matches_independent_optimum": true,
        "independently_evaluated_deadline": {
          "feasible": true,
          "basis": "checked_schedule_meets_deadline"
        },
        "independent_reference": {
          "status": "complete",
          "exact_optimum": 3,
          "optimal_slots": [
            [
              "0"
            ],
            [
              "1",
              "2"
            ],
            [
              "3"
            ]
          ],
          "feasibility_by_deadline": {
            "feasible": true,
            "basis": "checked_schedule_meets_deadline"
          },
          "deadline": 3,
          "lower_bound": 3,
          "lower_bound_components": {
            "capacity": 2,
            "longest_precedence_chain": 3
          },
          "valid_upper_bound": 3,
          "upper_bound_slots": [
            [
              "0"
            ],
            [
              "1",
              "2"
            ],
            [
              "3"
            ]
          ],
          "proposed_schedule_audit": {
            "valid": true,
            "makespan": 3,
            "errors": []
          },
          "states": 0,
          "transitions": 0,
          "limits": {
            "jobs": 18,
            "states": 50000,
            "transitions": 2000000
          },
          "input_sha256": "653a74dc16d90627f8775e83a55c27f60551f4ba75fbb4c404d002af485d4882",
          "source_connection": {
            "family": "124",
            "source_commit": "fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb",
            "source_polynomial_algorithm_implemented": false,
            "source_exponent": 150020
          },
          "algorithm": "Breadth-first search of completed-job ideals; exponential in the number of jobs, with hard resource caps.",
          "source_proof_verification": "not_run",
          "formal_program_verification": "not_run",
          "interpretation": "Exact finite optimum only after completed search or an independently checked witness attaining an elementary lower bound. A valid schedule is not alone an optimality certificate. No claim for unequal jobs, eligibility, release dates, setup, communication delay or general production scheduling.",
          "completion_basis": "checked_witness_attains_elementary_lower_bound"
        },
        "model_text_sha256": "d609b628bedd14c393b0736830d77c2c95280e33f2ba56a4d0badc76c360d9d1",
        "model_text_hash_interpretation": "UTF-8 text of this runtime model proto, not a cross-version canonical encoding.",
        "source_polynomial_algorithm_implemented": false,
        "source_proof_verification": "not_run",
        "formal_program_verification": "not_run",
        "interpretation": "CP-SAT status and bound are solver reports. Independent finite optimality requires completed reference search or a directly checked schedule attaining its elementary lower bound. No performance comparison or broader model guarantee is inferred."
      }
    },
    {
      "name": "generated-three-chains-12",
      "model_origin": "self-authored finite control, not customer or published benchmark",
      "input": {
        "job_ids": [
          "0",
          "1",
          "2",
          "3",
          "4",
          "5",
          "6",
          "7",
          "8",
          "9",
          "10",
          "11"
        ],
        "precedence": [
          [
            "0",
            "1"
          ],
          [
            "1",
            "2"
          ],
          [
            "2",
            "3"
          ],
          [
            "4",
            "5"
          ],
          [
            "5",
            "6"
          ],
          [
            "6",
            "7"
          ],
          [
            "8",
            "9"
          ],
          [
            "9",
            "10"
          ],
          [
            "10",
            "11"
          ]
        ],
        "model": {
          "machine_count": 3,
          "processing_times": "all_one",
          "nonpreemptive": true,
          "machines": "identical",
          "release_times": "all_zero",
          "communication_delays": "none",
          "eligibility": "all_machines",
          "additional_resources": "none"
        },
        "deadline": 4
      },
      "input_sha256": "9a958815950956809f14fd4c00c465ce0f6b5874162738a7aace6f0743ff0d35",
      "expected_optimum": 4,
      "comparison": {
        "status": "proposal_checked",
        "ortools_version": "9.15.6755",
        "solver_status": "OPTIMAL",
        "proposed_slots": [
          [
            "0",
            "4",
            "8"
          ],
          [
            "1",
            "5",
            "9"
          ],
          [
            "2",
            "6",
            "10"
          ],
          [
            "3",
            "7",
            "11"
          ]
        ],
        "direct_witness_audit": {
          "valid": true,
          "makespan": 4,
          "errors": []
        },
        "input_proposed_schedule_audit": null,
        "solver_objective": 4,
        "solver_reported_lower_bound": 4.0,
        "solver_reported_wall_time_seconds": 0.000657,
        "solver_limits": {
          "seconds": 2.0,
          "workers": 1,
          "random_seed": 124
        },
        "independently_certified_optimum": 4,
        "proposal_matches_independent_optimum": true,
        "independently_evaluated_deadline": {
          "feasible": true,
          "basis": "checked_schedule_meets_deadline"
        },
        "independent_reference": {
          "status": "complete",
          "exact_optimum": 4,
          "optimal_slots": [
            [
              "0",
              "4",
              "8"
            ],
            [
              "1",
              "5",
              "9"
            ],
            [
              "2",
              "6",
              "10"
            ],
            [
              "3",
              "7",
              "11"
            ]
          ],
          "feasibility_by_deadline": {
            "feasible": true,
            "basis": "checked_schedule_meets_deadline"
          },
          "deadline": 4,
          "lower_bound": 4,
          "lower_bound_components": {
            "capacity": 4,
            "longest_precedence_chain": 4
          },
          "valid_upper_bound": 4,
          "upper_bound_slots": [
            [
              "0",
              "4",
              "8"
            ],
            [
              "1",
              "5",
              "9"
            ],
            [
              "2",
              "6",
              "10"
            ],
            [
              "3",
              "7",
              "11"
            ]
          ],
          "proposed_schedule_audit": {
            "valid": true,
            "makespan": 4,
            "errors": []
          },
          "states": 0,
          "transitions": 0,
          "limits": {
            "jobs": 18,
            "states": 50000,
            "transitions": 2000000
          },
          "input_sha256": "8f36fe68d439b1c6b6b6a86ef1075e49a463cf3676e98b30a2a1c03ce702173d",
          "source_connection": {
            "family": "124",
            "source_commit": "fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb",
            "source_polynomial_algorithm_implemented": false,
            "source_exponent": 150020
          },
          "algorithm": "Breadth-first search of completed-job ideals; exponential in the number of jobs, with hard resource caps.",
          "source_proof_verification": "not_run",
          "formal_program_verification": "not_run",
          "interpretation": "Exact finite optimum only after completed search or an independently checked witness attaining an elementary lower bound. A valid schedule is not alone an optimality certificate. No claim for unequal jobs, eligibility, release dates, setup, communication delay or general production scheduling.",
          "completion_basis": "checked_witness_attains_elementary_lower_bound"
        },
        "model_text_sha256": "244ff10d4b8bbf48bb0957463a106c4ad3c79dfd8e576fbccb5397bdd16fdf3d",
        "model_text_hash_interpretation": "UTF-8 text of this runtime model proto, not a cross-version canonical encoding.",
        "source_polynomial_algorithm_implemented": false,
        "source_proof_verification": "not_run",
        "formal_program_verification": "not_run",
        "interpretation": "CP-SAT status and bound are solver reports. Independent finite optimality requires completed reference search or a directly checked schedule attaining its elementary lower bound. No performance comparison or broader model guarantee is inferred."
      }
    }
  ],
  "exhaustion_control": {
    "status": "proposal_checked",
    "ortools_version": "9.15.6755",
    "solver_status": "OPTIMAL",
    "proposed_slots": [
      [
        "0",
        "2"
      ],
      [
        "1",
        "3",
        "5"
      ],
      [
        "4"
      ]
    ],
    "direct_witness_audit": {
      "valid": true,
      "makespan": 3,
      "errors": []
    },
    "input_proposed_schedule_audit": null,
    "solver_objective": 3,
    "solver_reported_lower_bound": 3.0,
    "solver_reported_wall_time_seconds": 0.00037000000000000005,
    "solver_limits": {
      "seconds": 2.0,
      "workers": 1,
      "random_seed": 124
    },
    "independently_certified_optimum": null,
    "proposal_matches_independent_optimum": null,
    "independently_evaluated_deadline": null,
    "independent_reference": {
      "status": "budget_exceeded",
      "exact_optimum": null,
      "optimal_slots": null,
      "feasibility_by_deadline": null,
      "deadline": 2,
      "lower_bound": 2,
      "lower_bound_components": {
        "capacity": 2,
        "longest_precedence_chain": 2
      },
      "valid_upper_bound": 3,
      "upper_bound_slots": [
        [
          "0",
          "2"
        ],
        [
          "1",
          "3",
          "4"
        ],
        [
          "5"
        ]
      ],
      "proposed_schedule_audit": {
        "valid": true,
        "makespan": 3,
        "errors": []
      },
      "states": 1,
      "transitions": 1,
      "limits": {
        "jobs": 18,
        "states": 1,
        "transitions": 2000000
      },
      "input_sha256": "63d70674a61c6c916d4383c3c0c56dfe066a32c16cd700f9737d65406efa486f",
      "source_connection": {
        "family": "124",
        "source_commit": "fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb",
        "source_polynomial_algorithm_implemented": false,
        "source_exponent": 150020
      },
      "algorithm": "Breadth-first search of completed-job ideals; exponential in the number of jobs, with hard resource caps.",
      "source_proof_verification": "not_run",
      "formal_program_verification": "not_run",
      "interpretation": "Exact finite optimum only after completed search or an independently checked witness attaining an elementary lower bound. A valid schedule is not alone an optimality certificate. No claim for unequal jobs, eligibility, release dates, setup, communication delay or general production scheduling.",
      "reason": "State budget exhausted"
    },
    "model_text_sha256": "d0495dc5aeb26fe8edaf96a0be5fa8128304ce4d39adb24844b404f5937d7f50",
    "model_text_hash_interpretation": "UTF-8 text of this runtime model proto, not a cross-version canonical encoding.",
    "source_polynomial_algorithm_implemented": false,
    "source_proof_verification": "not_run",
    "formal_program_verification": "not_run",
    "interpretation": "CP-SAT status and bound are solver reports. Independent finite optimality requires completed reference search or a directly checked schedule attaining its elementary lower bound. No performance comparison or broader model guarantee is inferred."
  },
  "environment": {
    "executable": "/tmp/openai-math-scheduling-20261009-FKmLBr/bin/python3",
    "python": "3.12.14 (main, Aug 25 2026, 13:50:33) [Clang 22.1.3 ]",
    "platform": "macOS-27.2-arm64-arm-64bit",
    "packages": {
      "ortools": "9.15.6755",
      "numpy": "2.5.3",
      "pandas": "3.0.6",
      "protobuf": "6.33.6",
      "absl-py": "2.5.0"
    },
    "install_report": "research/prototypes/ortools-install-report-2026-10-09-v1.json",
    "isolation": "fresh preserved virtual environment; existing SciPy/Python installations untouched"
  },
  "file_hashes": [
    {
      "path": "/Users/bradleymutemi/Documents/ultimate/research/tools/validate_scheduling_baseline_2026_10_09.py",
      "sha256": "9f4b8f00c295a848e40a9c95a450d96faf2b24dad5fbf52601d3261077e20774"
    },
    {
      "path": "/Users/bradleymutemi/Documents/ultimate/research/tools/solve_and_audit_three_machine.py",
      "sha256": "8706abf5071c535dba05e3a2192eaf4cc5f0cfc8f68ffa0c4e7535f6cd2809ce"
    },
    {
      "path": "/Users/bradleymutemi/Documents/ultimate/research/tools/three_machine_reference.py",
      "sha256": "a3b808e5e2e9a686fbef79a7df13ac313933a2ff9f865a042f898a1ebb99e6c4"
    },
    {
      "path": "/tmp/openai-math-scheduling-20261009-FKmLBr/lib/python3.12/site-packages/ortools/sat/python/cp_model.py",
      "sha256": "b5f2a3ae5c418d11af23cb77a766fa10103c8bb71703dafa1ecad74823603f25"
    }
  ],
  "interpretation": "All eight generated controls have an existing-solver optimum checked by finite reference evidence. Timing is a diagnostic of single dependent runs, not a performance study. No practical advantage for the source algorithm, production model bridge, formal acceptance or buyer willingness to pay is demonstrated."
}