TSTP Solution File: SWB008+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWB008+2 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n021.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 : 600s
% DateTime : Tue Jul 19 19:01:56 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 23 ( 10 unt; 0 def)
% Number of atoms : 63 ( 12 equ)
% Maximal formula atoms : 15 ( 2 avg)
% Number of connectives : 66 ( 26 ~; 25 |; 11 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 8 con; 0-1 aty)
% Number of variables : 38 ( 5 sgn 21 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(owl_char_inversefunctional,axiom,
! [X4] :
( icext(uri_owl_InverseFunctionalProperty,X4)
<=> ( ip(X4)
& ! [X5,X6,X3] :
( ( iext(X4,X5,X3)
& iext(X4,X6,X3) )
=> X5 = X6 ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',owl_char_inversefunctional) ).
fof(rdfs_cext_def,axiom,
! [X1,X2] :
( iext(uri_rdf_type,X1,X2)
<=> icext(X2,X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',rdfs_cext_def) ).
fof(testcase_premise_fullish_008_Inverse_Functional_Data_Properties,axiom,
( iext(uri_rdf_type,uri_foaf_mbox_sha1sum,uri_owl_DatatypeProperty)
& iext(uri_rdf_type,uri_foaf_mbox_sha1sum,uri_owl_InverseFunctionalProperty)
& iext(uri_foaf_mbox_sha1sum,uri_ex_bob,literal_plain(dat_str_xyz))
& iext(uri_foaf_mbox_sha1sum,uri_ex_robert,literal_plain(dat_str_xyz)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',testcase_premise_fullish_008_Inverse_Functional_Data_Properties) ).
fof(testcase_conclusion_fullish_008_Inverse_Functional_Data_Properties,conjecture,
iext(uri_owl_sameAs,uri_ex_bob,uri_ex_robert),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',testcase_conclusion_fullish_008_Inverse_Functional_Data_Properties) ).
fof(owl_eqdis_sameas,axiom,
! [X1,X3] :
( iext(uri_owl_sameAs,X1,X3)
<=> X1 = X3 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',owl_eqdis_sameas) ).
fof(c_0_5,plain,
! [X7,X8,X9,X10,X7] :
( ( ip(X7)
| ~ icext(uri_owl_InverseFunctionalProperty,X7) )
& ( ~ iext(X7,X8,X10)
| ~ iext(X7,X9,X10)
| X8 = X9
| ~ icext(uri_owl_InverseFunctionalProperty,X7) )
& ( iext(X7,esk1_1(X7),esk3_1(X7))
| ~ ip(X7)
| icext(uri_owl_InverseFunctionalProperty,X7) )
& ( iext(X7,esk2_1(X7),esk3_1(X7))
| ~ ip(X7)
| icext(uri_owl_InverseFunctionalProperty,X7) )
& ( esk1_1(X7) != esk2_1(X7)
| ~ ip(X7)
| icext(uri_owl_InverseFunctionalProperty,X7) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[owl_char_inversefunctional])])])])])])]) ).
fof(c_0_6,plain,
! [X3,X4,X3,X4] :
( ( ~ iext(uri_rdf_type,X3,X4)
| icext(X4,X3) )
& ( ~ icext(X4,X3)
| iext(uri_rdf_type,X3,X4) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rdfs_cext_def])])])]) ).
cnf(c_0_7,plain,
( X2 = X3
| ~ icext(uri_owl_InverseFunctionalProperty,X1)
| ~ iext(X1,X3,X4)
| ~ iext(X1,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( icext(X1,X2)
| ~ iext(uri_rdf_type,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( X1 = X2
| ~ iext(uri_rdf_type,X3,uri_owl_InverseFunctionalProperty)
| ~ iext(X3,X2,X4)
| ~ iext(X3,X1,X4) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,plain,
iext(uri_rdf_type,uri_foaf_mbox_sha1sum,uri_owl_InverseFunctionalProperty),
inference(split_conjunct,[status(thm)],[testcase_premise_fullish_008_Inverse_Functional_Data_Properties]) ).
fof(c_0_11,negated_conjecture,
~ iext(uri_owl_sameAs,uri_ex_bob,uri_ex_robert),
inference(assume_negation,[status(cth)],[testcase_conclusion_fullish_008_Inverse_Functional_Data_Properties]) ).
cnf(c_0_12,plain,
( X1 = X2
| ~ iext(uri_foaf_mbox_sha1sum,X2,X3)
| ~ iext(uri_foaf_mbox_sha1sum,X1,X3) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
iext(uri_foaf_mbox_sha1sum,uri_ex_robert,literal_plain(dat_str_xyz)),
inference(split_conjunct,[status(thm)],[testcase_premise_fullish_008_Inverse_Functional_Data_Properties]) ).
fof(c_0_14,plain,
! [X4,X5,X4,X5] :
( ( ~ iext(uri_owl_sameAs,X4,X5)
| X4 = X5 )
& ( X4 != X5
| iext(uri_owl_sameAs,X4,X5) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[owl_eqdis_sameas])])])]) ).
fof(c_0_15,negated_conjecture,
~ iext(uri_owl_sameAs,uri_ex_bob,uri_ex_robert),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( X1 = uri_ex_robert
| ~ iext(uri_foaf_mbox_sha1sum,X1,literal_plain(dat_str_xyz)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
iext(uri_foaf_mbox_sha1sum,uri_ex_bob,literal_plain(dat_str_xyz)),
inference(split_conjunct,[status(thm)],[testcase_premise_fullish_008_Inverse_Functional_Data_Properties]) ).
cnf(c_0_18,plain,
( iext(uri_owl_sameAs,X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
~ iext(uri_owl_sameAs,uri_ex_bob,uri_ex_robert),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
uri_ex_robert = uri_ex_bob,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
iext(uri_owl_sameAs,X1,X1),
inference(er,[status(thm)],[c_0_18]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWB008+2 : TPTP v8.1.0. Released v5.2.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n021.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Wed Jun 1 02:28:15 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41 # Preprocessing time : 0.013 s
% 0.23/1.41
% 0.23/1.41 # Failure: Out of unprocessed clauses!
% 0.23/1.41 # OLD status GaveUp
% 0.23/1.41 # Parsed axioms : 5
% 0.23/1.41 # Removed by relevancy pruning/SinE : 3
% 0.23/1.41 # Initial clauses : 3
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 3
% 0.23/1.41 # Processed clauses : 4
% 0.23/1.41 # ...of these trivial : 0
% 0.23/1.41 # ...subsumed : 0
% 0.23/1.41 # ...remaining for further processing : 4
% 0.23/1.41 # Other redundant clauses eliminated : 1
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 0
% 0.23/1.41 # Backward-rewritten : 0
% 0.23/1.41 # Generated clauses : 1
% 0.23/1.41 # ...of the previous two non-trivial : 1
% 0.23/1.41 # Contextual simplify-reflections : 0
% 0.23/1.41 # Paramodulations : 0
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 1
% 0.23/1.41 # Current number of processed clauses : 3
% 0.23/1.41 # Positive orientable unit clauses : 1
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 1
% 0.23/1.41 # Non-unit-clauses : 1
% 0.23/1.41 # Current number of unprocessed clauses: 0
% 0.23/1.41 # ...number of literals in the above : 0
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 0
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 0
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 0
% 0.23/1.41 # Non-unit clause-clause subsumptions : 0
% 0.23/1.41 # Unit Clause-clause subsumption calls : 0
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 2
% 0.23/1.41 # BW rewrite match successes : 0
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 166
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.011 s
% 0.23/1.41 # System time : 0.002 s
% 0.23/1.41 # Total time : 0.013 s
% 0.23/1.41 # Maximum resident set size: 2772 pages
% 0.23/1.41 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.23/1.41 # Preprocessing time : 0.014 s
% 0.23/1.41
% 0.23/1.41 # Proof found!
% 0.23/1.41 # SZS status Theorem
% 0.23/1.41 # SZS output start CNFRefutation
% See solution above
% 0.23/1.41 # Proof object total steps : 23
% 0.23/1.41 # Proof object clause steps : 13
% 0.23/1.41 # Proof object formula steps : 10
% 0.23/1.41 # Proof object conjectures : 5
% 0.23/1.41 # Proof object clause conjectures : 2
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 7
% 0.23/1.41 # Proof object initial formulas used : 5
% 0.23/1.41 # Proof object generating inferences : 4
% 0.23/1.41 # Proof object simplifying inferences : 4
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 5
% 0.23/1.41 # Removed by relevancy pruning/SinE : 0
% 0.23/1.41 # Initial clauses : 14
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 14
% 0.23/1.41 # Processed clauses : 22
% 0.23/1.41 # ...of these trivial : 0
% 0.23/1.41 # ...subsumed : 0
% 0.23/1.41 # ...remaining for further processing : 22
% 0.23/1.41 # Other redundant clauses eliminated : 1
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 2
% 0.23/1.41 # Backward-rewritten : 3
% 0.23/1.41 # Generated clauses : 16
% 0.23/1.41 # ...of the previous two non-trivial : 13
% 0.23/1.41 # Contextual simplify-reflections : 1
% 0.23/1.41 # Paramodulations : 15
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 1
% 0.23/1.41 # Current number of processed clauses : 16
% 0.23/1.41 # Positive orientable unit clauses : 5
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 0
% 0.23/1.41 # Non-unit-clauses : 11
% 0.23/1.41 # Current number of unprocessed clauses: 4
% 0.23/1.41 # ...number of literals in the above : 12
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 5
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 24
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 19
% 0.23/1.41 # Non-unit clause-clause subsumptions : 3
% 0.23/1.41 # Unit Clause-clause subsumption calls : 11
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 4
% 0.23/1.41 # BW rewrite match successes : 1
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 900
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.015 s
% 0.23/1.41 # System time : 0.000 s
% 0.23/1.41 # Total time : 0.015 s
% 0.23/1.41 # Maximum resident set size: 2772 pages
%------------------------------------------------------------------------------