TSTP Solution File: SWB008+2 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SWB008+2 : TPTP v5.2.0. Released v5.2.0.
% Transfm  : none
% Format   : tptp
% Command  : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s

% Computer : art03.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory   : 2018MB
% OS       : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Wed Feb 16 03:07:19 EST 2011

% Result   : Theorem 0.49s
% Output   : Solution 0.49s
% Verified : 
% SZS Type : None (Parsing solution fails)
% Syntax   : Number of formulae    : 0

% Comments : 
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Reading problem from /tmp/SystemOnTPTP21497/SWB008+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP21497/SWB008+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21497/SWB008+2.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=60 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p 
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC  time limit is 120s
% TreeLimitedRun: PID is 21585
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time     : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(iext(uri_owl_sameAs,X1,X2)<=>X1=X2),file('/tmp/SRASS.s.p', owl_eqdis_sameas)).
% fof(2, 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('/tmp/SRASS.s.p', testcase_premise_fullish_008_Inverse_Functional_Data_Properties)).
% fof(3, axiom,![X1]:![X3]:(iext(uri_rdf_type,X1,X3)<=>icext(X3,X1)),file('/tmp/SRASS.s.p', rdfs_cext_def)).
% fof(4, axiom,![X4]:(icext(uri_owl_InverseFunctionalProperty,X4)<=>(ip(X4)&![X5]:![X6]:![X2]:((iext(X4,X5,X2)&iext(X4,X6,X2))=>X5=X6))),file('/tmp/SRASS.s.p', owl_char_inversefunctional)).
% fof(5, conjecture,iext(uri_owl_sameAs,uri_ex_bob,uri_ex_robert),file('/tmp/SRASS.s.p', testcase_conclusion_fullish_008_Inverse_Functional_Data_Properties)).
% fof(6, negated_conjecture,~(iext(uri_owl_sameAs,uri_ex_bob,uri_ex_robert)),inference(assume_negation,[status(cth)],[5])).
% fof(7, negated_conjecture,~(iext(uri_owl_sameAs,uri_ex_bob,uri_ex_robert)),inference(fof_simplification,[status(thm)],[6,theory(equality)])).
% fof(8, plain,![X1]:![X2]:((~(iext(uri_owl_sameAs,X1,X2))|X1=X2)&(~(X1=X2)|iext(uri_owl_sameAs,X1,X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(9, plain,![X3]:![X4]:((~(iext(uri_owl_sameAs,X3,X4))|X3=X4)&(~(X3=X4)|iext(uri_owl_sameAs,X3,X4))),inference(variable_rename,[status(thm)],[8])).
% cnf(10,plain,(iext(uri_owl_sameAs,X1,X2)|X1!=X2),inference(split_conjunct,[status(thm)],[9])).
% cnf(12,plain,(iext(uri_foaf_mbox_sha1sum,uri_ex_robert,literal_plain(dat_str_xyz))),inference(split_conjunct,[status(thm)],[2])).
% cnf(13,plain,(iext(uri_foaf_mbox_sha1sum,uri_ex_bob,literal_plain(dat_str_xyz))),inference(split_conjunct,[status(thm)],[2])).
% cnf(14,plain,(iext(uri_rdf_type,uri_foaf_mbox_sha1sum,uri_owl_InverseFunctionalProperty)),inference(split_conjunct,[status(thm)],[2])).
% fof(16, plain,![X1]:![X3]:((~(iext(uri_rdf_type,X1,X3))|icext(X3,X1))&(~(icext(X3,X1))|iext(uri_rdf_type,X1,X3))),inference(fof_nnf,[status(thm)],[3])).
% fof(17, plain,![X4]:![X5]:((~(iext(uri_rdf_type,X4,X5))|icext(X5,X4))&(~(icext(X5,X4))|iext(uri_rdf_type,X4,X5))),inference(variable_rename,[status(thm)],[16])).
% cnf(19,plain,(icext(X1,X2)|~iext(uri_rdf_type,X2,X1)),inference(split_conjunct,[status(thm)],[17])).
% fof(20, plain,![X4]:((~(icext(uri_owl_InverseFunctionalProperty,X4))|(ip(X4)&![X5]:![X6]:![X2]:((~(iext(X4,X5,X2))|~(iext(X4,X6,X2)))|X5=X6)))&((~(ip(X4))|?[X5]:?[X6]:?[X2]:((iext(X4,X5,X2)&iext(X4,X6,X2))&~(X5=X6)))|icext(uri_owl_InverseFunctionalProperty,X4))),inference(fof_nnf,[status(thm)],[4])).
% fof(21, plain,![X7]:((~(icext(uri_owl_InverseFunctionalProperty,X7))|(ip(X7)&![X8]:![X9]:![X10]:((~(iext(X7,X8,X10))|~(iext(X7,X9,X10)))|X8=X9)))&((~(ip(X7))|?[X11]:?[X12]:?[X13]:((iext(X7,X11,X13)&iext(X7,X12,X13))&~(X11=X12)))|icext(uri_owl_InverseFunctionalProperty,X7))),inference(variable_rename,[status(thm)],[20])).
% fof(22, plain,![X7]:((~(icext(uri_owl_InverseFunctionalProperty,X7))|(ip(X7)&![X8]:![X9]:![X10]:((~(iext(X7,X8,X10))|~(iext(X7,X9,X10)))|X8=X9)))&((~(ip(X7))|((iext(X7,esk1_1(X7),esk3_1(X7))&iext(X7,esk2_1(X7),esk3_1(X7)))&~(esk1_1(X7)=esk2_1(X7))))|icext(uri_owl_InverseFunctionalProperty,X7))),inference(skolemize,[status(esa)],[21])).
% fof(23, plain,![X7]:![X8]:![X9]:![X10]:(((((~(iext(X7,X8,X10))|~(iext(X7,X9,X10)))|X8=X9)&ip(X7))|~(icext(uri_owl_InverseFunctionalProperty,X7)))&((~(ip(X7))|((iext(X7,esk1_1(X7),esk3_1(X7))&iext(X7,esk2_1(X7),esk3_1(X7)))&~(esk1_1(X7)=esk2_1(X7))))|icext(uri_owl_InverseFunctionalProperty,X7))),inference(shift_quantors,[status(thm)],[22])).
% fof(24, plain,![X7]:![X8]:![X9]:![X10]:(((((~(iext(X7,X8,X10))|~(iext(X7,X9,X10)))|X8=X9)|~(icext(uri_owl_InverseFunctionalProperty,X7)))&(ip(X7)|~(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)],[23])).
% cnf(29,plain,(X2=X3|~icext(uri_owl_InverseFunctionalProperty,X1)|~iext(X1,X3,X4)|~iext(X1,X2,X4)),inference(split_conjunct,[status(thm)],[24])).
% cnf(30,negated_conjecture,(~iext(uri_owl_sameAs,uri_ex_bob,uri_ex_robert)),inference(split_conjunct,[status(thm)],[7])).
% cnf(31,plain,(iext(uri_owl_sameAs,X1,X1)),inference(er,[status(thm)],[10,theory(equality)])).
% cnf(33,plain,(icext(uri_owl_InverseFunctionalProperty,uri_foaf_mbox_sha1sum)),inference(spm,[status(thm)],[19,14,theory(equality)])).
% cnf(35,plain,(X1=uri_ex_robert|~icext(uri_owl_InverseFunctionalProperty,uri_foaf_mbox_sha1sum)|~iext(uri_foaf_mbox_sha1sum,X1,literal_plain(dat_str_xyz))),inference(spm,[status(thm)],[29,12,theory(equality)])).
% cnf(50,plain,(X1=uri_ex_robert|$false|~iext(uri_foaf_mbox_sha1sum,X1,literal_plain(dat_str_xyz))),inference(rw,[status(thm)],[35,33,theory(equality)])).
% cnf(51,plain,(X1=uri_ex_robert|~iext(uri_foaf_mbox_sha1sum,X1,literal_plain(dat_str_xyz))),inference(cn,[status(thm)],[50,theory(equality)])).
% cnf(52,plain,(uri_ex_bob=uri_ex_robert),inference(spm,[status(thm)],[51,13,theory(equality)])).
% cnf(53,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[30,52,theory(equality)]),31,theory(equality)])).
% cnf(54,negated_conjecture,($false),inference(cn,[status(thm)],[53,theory(equality)])).
% cnf(55,negated_conjecture,($false),54,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 37
% # ...of these trivial                : 0
% # ...subsumed                        : 1
% # ...remaining for further processing: 36
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 3
% # Generated clauses                  : 19
% # ...of the previous two non-trivial : 16
% # Contextual simplify-reflections    : 1
% # Paramodulations                    : 18
% # Factorizations                     : 0
% # Equation resolutions               : 1
% # Current number of processed clauses: 18
% #    Positive orientable unit clauses: 7
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 0
% #    Non-unit-clauses                : 11
% # Current number of unprocessed clauses: 7
% # ...number of literals in the above : 22
% # Clause-clause subsumption calls (NU) : 6
% # Rec. Clause-clause subsumption calls : 6
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 5
% # Indexed BW rewrite successes       : 1
% # Backwards rewriting index:    27 leaves,   1.30+/-0.656 terms/leaf
% # Paramod-from index:           10 leaves,   1.10+/-0.300 terms/leaf
% # Paramod-into index:           23 leaves,   1.22+/-0.657 terms/leaf
% # -------------------------------------------------
% # User time              : 0.008 s
% # System time            : 0.005 s
% # Total time             : 0.013 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.16 WC
% FINAL PrfWatch: 0.09 CPU 0.16 WC
% SZS output end Solution for /tmp/SystemOnTPTP21497/SWB008+2.tptp
% 
%------------------------------------------------------------------------------