{
  "@context": "https://w3id.org/codemeta/3.0",
  "@type": "SoftwareSourceCode",
  "name": "Claim Verification: \u201cThe binary operator eml is defined by the expression eml(a, b) = (a) - (b). There exists a finite binary tree consisting solely of eml operations, whose 10 leaves are drawn from \\1, x, y\\, such that the tree evaluates exactly to x + y. The tree has K = 19 tokens (9 eml operations and 10 leaves), and the identity holds for all real x and y (and formally for all complex x, y in the algebraic setting where    is the identity).\u201d \u2014 Proved",
  "description": "Verdict: PROVED",
  "version": "1.18.0",
  "dateCreated": "2026-04-16",
  "license": "https://spdx.org/licenses/MIT",
  "codeRepository": "https://github.com/yaniv-golan/proof-engine",
  "url": "https://proofengine.info/proofs/eml-k19-addition-tree/",
  "author": [
    {
      "@type": "Organization",
      "name": "Proof Engine"
    }
  ],
  "identifier": "https://doi.org/10.5281/zenodo.19635620",
  "isBasedOn": [
    {
      "@type": "CreativeWork",
      "@id": "https://doi.org/10.5281/zenodo.19626399",
      "identifier": [
        "https://proofengine.info/proofs/the-binary-operator-defined-by-text-eml-a-b-exp-a-ln-b-satisfies-text-eml-x-1/",
        "https://doi.org/10.5281/zenodo.19626399"
      ],
      "name": "EXP identity eml(x,1)=exp(x)"
    },
    {
      "@type": "CreativeWork",
      "@id": "https://doi.org/10.5281/zenodo.19626401",
      "identifier": [
        "https://proofengine.info/proofs/eml-triple-nesting-recovers-ln-x/",
        "https://doi.org/10.5281/zenodo.19626401"
      ],
      "name": "LN identity from K=7 triple nesting"
    }
  ]
}