{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FRYNBGGXHMK6EN74FX6SLCX2BN","short_pith_number":"pith:FRYNBGGX","schema_version":"1.0","canonical_sha256":"2c70d098d73b15e237fc2dfd258afa0b51d65f46bd07d793a123b52a208b7eb1","source":{"kind":"arxiv","id":"1503.02971","version":2},"attestation_state":"computed","paper":{"title":"First-Order Logic Theorem Proving and Model Building via Approximation and Instantiation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Andreas Teucke, Christoph Weidenbach","submitted_at":"2015-03-10T16:16:56Z","abstract_excerpt":"In this paper we consider first-order logic theorem proving and model building via approximation and instantiation. Given a clause set we propose its approximation into a simplified clause set where satisfiability is decidable. The approximation extends the signature and preserves unsatisfiability: if the simplified clause set is satisfiable in some model, so is the original clause set in the same model interpreted in the original signature. A refutation generated by a decision procedure on the simplified clause set can then either be lifted to a refutation in the original clause set, or it gu"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1503.02971","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-03-10T16:16:56Z","cross_cats_sorted":[],"title_canon_sha256":"95b1195e8fb0ca3c7afabe458d5af9db35347cfc05a5514e90a8aca0d7d4d3b2","abstract_canon_sha256":"71be271462996b0ea257b4401d7e76a806dabf2a8e4b05759cc1256ac1565b55"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:54.766249Z","signature_b64":"5zbmqGKYEmHa99V1emPR5RMh5PvkaGNh4Nvbn3decpLdpW3m2gRFZ9dbpZZcfCmrtL0o9WC12PRI41RUm5EoAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c70d098d73b15e237fc2dfd258afa0b51d65f46bd07d793a123b52a208b7eb1","last_reissued_at":"2026-05-18T02:03:54.765437Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:54.765437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"First-Order Logic Theorem Proving and Model Building via Approximation and Instantiation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Andreas Teucke, Christoph Weidenbach","submitted_at":"2015-03-10T16:16:56Z","abstract_excerpt":"In this paper we consider first-order logic theorem proving and model building via approximation and instantiation. Given a clause set we propose its approximation into a simplified clause set where satisfiability is decidable. The approximation extends the signature and preserves unsatisfiability: if the simplified clause set is satisfiable in some model, so is the original clause set in the same model interpreted in the original signature. A refutation generated by a decision procedure on the simplified clause set can then either be lifted to a refutation in the original clause set, or it gu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02971","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1503.02971","created_at":"2026-05-18T02:03:54.765581+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.02971v2","created_at":"2026-05-18T02:03:54.765581+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02971","created_at":"2026-05-18T02:03:54.765581+00:00"},{"alias_kind":"pith_short_12","alias_value":"FRYNBGGXHMK6","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"FRYNBGGXHMK6EN74","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"FRYNBGGX","created_at":"2026-05-18T12:29:22.688609+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FRYNBGGXHMK6EN74FX6SLCX2BN","json":"https://pith.science/pith/FRYNBGGXHMK6EN74FX6SLCX2BN.json","graph_json":"https://pith.science/api/pith-number/FRYNBGGXHMK6EN74FX6SLCX2BN/graph.json","events_json":"https://pith.science/api/pith-number/FRYNBGGXHMK6EN74FX6SLCX2BN/events.json","paper":"https://pith.science/paper/FRYNBGGX"},"agent_actions":{"view_html":"https://pith.science/pith/FRYNBGGXHMK6EN74FX6SLCX2BN","download_json":"https://pith.science/pith/FRYNBGGXHMK6EN74FX6SLCX2BN.json","view_paper":"https://pith.science/paper/FRYNBGGX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.02971&json=true","fetch_graph":"https://pith.science/api/pith-number/FRYNBGGXHMK6EN74FX6SLCX2BN/graph.json","fetch_events":"https://pith.science/api/pith-number/FRYNBGGXHMK6EN74FX6SLCX2BN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FRYNBGGXHMK6EN74FX6SLCX2BN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FRYNBGGXHMK6EN74FX6SLCX2BN/action/storage_attestation","attest_author":"https://pith.science/pith/FRYNBGGXHMK6EN74FX6SLCX2BN/action/author_attestation","sign_citation":"https://pith.science/pith/FRYNBGGXHMK6EN74FX6SLCX2BN/action/citation_signature","submit_replication":"https://pith.science/pith/FRYNBGGXHMK6EN74FX6SLCX2BN/action/replication_record"}},"created_at":"2026-05-18T02:03:54.765581+00:00","updated_at":"2026-05-18T02:03:54.765581+00:00"}