{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,5]],"date-time":"2026-10-05T16:52:38Z","timestamp":1791219158293,"version":"4.1.0"},"reference-count":0,"publisher":"EasyChair","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>We announce a tool for mapping derivations produced by the E theorem<\/jats:p><jats:p>prover to Mizar proofs.  Our mapping complements earlier work that<\/jats:p><jats:p>generates problems for automated theorem provers from Mizar inference<\/jats:p><jats:p>checking problems.  We describe the tool, explain the mapping, and<\/jats:p><jats:p>show how we solved some of the difficulties that arise in mapping<\/jats:p><jats:p>proofs between different logical formalisms, even when they are based<\/jats:p><jats:p>on the same notion of logical consequence, as Mizar and E are (namely,<\/jats:p><jats:p>first-order classical logic with identity).<\/jats:p>","DOI":"10.29007\/s1ts","type":"proceedings-article","created":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T22:59:08Z","timestamp":1516748348000},"page":"3--7","source":"Crossref","is-referenced-by-count":2,"title":["Escape to Mizar from ATPs"],"prefix":"10.29007","volume":"21","author":[{"given":"Jesse","family":"Alama","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"11545","event":{"name":"PAAR-2012. Third Workshop on Practical Aspects of Automated Reasoning"},"container-title":["EPiC Series in Computing"],"original-title":[],"deposited":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T22:59:09Z","timestamp":1516748349000},"score":1,"resource":{"primary":{"URL":"https:\/\/easychair.org\/publications\/paper\/wBpw"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.29007\/s1ts","relation":{},"ISSN":["2398-7340"],"issn-type":[{"value":"2398-7340","type":"print"}],"subject":[]}}