TSTP Solution File: SWB001+3 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : SWB001+3 : TPTP v8.1.2. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% Computer : n013.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 20:12:39 EDT 2023
% Result : Theorem 5.84s 1.16s
% Output : Proof 5.84s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWB001+3 : TPTP v8.1.2. Released v5.2.0.
% 0.00/0.14 % Command : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.14/0.35 % Computer : n013.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun Aug 27 07:34:17 EDT 2023
% 0.14/0.36 % CPUTime :
% 5.84/1.16 Command-line arguments: --no-flatten-goal
% 5.84/1.16
% 5.84/1.16 % SZS status Theorem
% 5.84/1.16
% 5.84/1.16 % SZS output start Proof
% 5.84/1.16 Take the following subset of the input axioms:
% 5.84/1.16 fof(testcase_conclusion_fullish_001_Subgraph_Entailment, conjecture, iext(uri_rdf_type, uri_ex_r, uri_owl_Restriction) & iext(uri_owl_onProperty, uri_ex_r, uri_ex_p)).
% 5.84/1.16 fof(testcase_premise_fullish_001_Subgraph_Entailment, axiom, iext(uri_rdfs_subClassOf, uri_ex_c, uri_ex_r) & (iext(uri_rdf_type, uri_ex_r, uri_owl_Restriction) & (iext(uri_owl_onProperty, uri_ex_r, uri_ex_p) & iext(uri_owl_someValuesFrom, uri_ex_r, uri_ex_d)))).
% 5.84/1.16
% 5.84/1.16 Now clausify the problem and encode Horn clauses using encoding 3 of
% 5.84/1.16 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 5.84/1.16 We repeatedly replace C & s=t => u=v by the two clauses:
% 5.84/1.16 fresh(y, y, x1...xn) = u
% 5.84/1.16 C => fresh(s, t, x1...xn) = v
% 5.84/1.16 where fresh is a fresh function symbol and x1..xn are the free
% 5.84/1.16 variables of u and v.
% 5.84/1.16 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 5.84/1.16 input problem has no model of domain size 1).
% 5.84/1.16
% 5.84/1.16 The encoding turns the above axioms into the following unit equations and goals:
% 5.84/1.16
% 5.84/1.16 Axiom 1 (testcase_premise_fullish_001_Subgraph_Entailment_1): iext(uri_owl_onProperty, uri_ex_r, uri_ex_p) = true2.
% 5.84/1.16 Axiom 2 (testcase_premise_fullish_001_Subgraph_Entailment): iext(uri_rdf_type, uri_ex_r, uri_owl_Restriction) = true2.
% 5.84/1.16
% 5.84/1.16 Goal 1 (testcase_conclusion_fullish_001_Subgraph_Entailment): tuple2(iext(uri_rdf_type, uri_ex_r, uri_owl_Restriction), iext(uri_owl_onProperty, uri_ex_r, uri_ex_p)) = tuple2(true2, true2).
% 5.84/1.16 Proof:
% 5.84/1.16 tuple2(iext(uri_rdf_type, uri_ex_r, uri_owl_Restriction), iext(uri_owl_onProperty, uri_ex_r, uri_ex_p))
% 5.84/1.16 = { by axiom 1 (testcase_premise_fullish_001_Subgraph_Entailment_1) }
% 5.84/1.16 tuple2(iext(uri_rdf_type, uri_ex_r, uri_owl_Restriction), true2)
% 5.84/1.16 = { by axiom 2 (testcase_premise_fullish_001_Subgraph_Entailment) }
% 5.84/1.16 tuple2(true2, true2)
% 5.84/1.16 % SZS output end Proof
% 5.84/1.16
% 5.84/1.16 RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------