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