{"schema":"https://assignee.net/schemas/math-result-v1","schema_version":"1.0","contract_version":"math-result-v1.0","schema_documentation":"https://assignee.net/schemas","changelog_url":"https://assignee.net/changelog","publisher":{"name":"Assignee Research","url":"https://assignee.net"},"result":{"id":"6569040a9409476bad36fd61a7a07e56","problem_id":"e25f9ddf1c214dea8968927d81ae181f","problem_name":"Consecutive Product Parity","domain":"Formal Identities","statement":"For any natural number n, the product of n and (n+1) is divisible by 2.","status":"proven","url":"https://assignee.net/math#result-6569040a9409476bad36fd61a7a07e56","doi":null},"verification":{"state":"FORMAL_PROOF_VERIFIED","label":"Formal proof verified","proof_claim":true,"method":"python_computation","result":"no_counterexample","n_cases":2000,"counterexample_available":false,"cpu_seconds":0.03,"lean4_source_public":true},"artifact_set":[{"type":"manifest","label":"Math result manifest","url":"https://assignee.net/math/6569040a9409476bad36fd61a7a07e56/manifest.json","format":"application/json"},{"type":"lean4_source","label":"Lean4 proof source","url":"https://assignee.net/math/6569040a9409476bad36fd61a7a07e56/lean4","format":"text/plain"}],"interpretation":"Computational evidence is not a formal proof. Formal verification is claimed only when public Lean4 source is attached.","limitations":["Python check code, local file paths, and private execution logs are not exposed in public manifests.","Computational evidence reports bounded search only and can be invalidated by later counterexamples.","Formal proof verification requires public Lean4 source; otherwise the record remains a proof attempt or report."]}