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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SWB017+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 : art05.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:28:52 EST 2011

% Result   : Theorem 0.50s
% Output   : Solution 0.50s
% 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/SystemOnTPTP24557/SWB017+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP24557/SWB017+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP24557/SWB017+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 24645
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time     : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(iext(uri_owl_differentFrom,X1,X2)<=>~(X1=X2)),file('/tmp/SRASS.s.p', owl_eqdis_differentfrom)).
% fof(2, axiom,((iext(uri_owl_propertyDisjointWith,uri_ex_notInstanceOf,uri_rdf_type)&iext(uri_rdf_type,uri_ex_w,uri_ex_c))&iext(uri_ex_notInstanceOf,uri_ex_u,uri_ex_c)),file('/tmp/SRASS.s.p', testcase_premise_fullish_017_Built_in_Based_Definitions)).
% fof(3, axiom,![X3]:![X4]:(iext(uri_owl_propertyDisjointWith,X3,X4)<=>((ip(X3)&ip(X4))&![X1]:![X2]:~((iext(X3,X1,X2)&iext(X4,X1,X2))))),file('/tmp/SRASS.s.p', owl_eqdis_propertydisjointwith)).
% fof(4, conjecture,iext(uri_owl_differentFrom,uri_ex_w,uri_ex_u),file('/tmp/SRASS.s.p', testcase_conclusion_fullish_017_Built_in_Based_Definitions)).
% fof(5, negated_conjecture,~(iext(uri_owl_differentFrom,uri_ex_w,uri_ex_u)),inference(assume_negation,[status(cth)],[4])).
% fof(6, negated_conjecture,~(iext(uri_owl_differentFrom,uri_ex_w,uri_ex_u)),inference(fof_simplification,[status(thm)],[5,theory(equality)])).
% fof(7, plain,![X1]:![X2]:((~(iext(uri_owl_differentFrom,X1,X2))|~(X1=X2))&(X1=X2|iext(uri_owl_differentFrom,X1,X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(8, plain,![X3]:![X4]:((~(iext(uri_owl_differentFrom,X3,X4))|~(X3=X4))&(X3=X4|iext(uri_owl_differentFrom,X3,X4))),inference(variable_rename,[status(thm)],[7])).
% cnf(9,plain,(iext(uri_owl_differentFrom,X1,X2)|X1=X2),inference(split_conjunct,[status(thm)],[8])).
% cnf(11,plain,(iext(uri_ex_notInstanceOf,uri_ex_u,uri_ex_c)),inference(split_conjunct,[status(thm)],[2])).
% cnf(12,plain,(iext(uri_rdf_type,uri_ex_w,uri_ex_c)),inference(split_conjunct,[status(thm)],[2])).
% cnf(13,plain,(iext(uri_owl_propertyDisjointWith,uri_ex_notInstanceOf,uri_rdf_type)),inference(split_conjunct,[status(thm)],[2])).
% fof(14, plain,![X3]:![X4]:((~(iext(uri_owl_propertyDisjointWith,X3,X4))|((ip(X3)&ip(X4))&![X1]:![X2]:(~(iext(X3,X1,X2))|~(iext(X4,X1,X2)))))&(((~(ip(X3))|~(ip(X4)))|?[X1]:?[X2]:(iext(X3,X1,X2)&iext(X4,X1,X2)))|iext(uri_owl_propertyDisjointWith,X3,X4))),inference(fof_nnf,[status(thm)],[3])).
% fof(15, plain,![X5]:![X6]:((~(iext(uri_owl_propertyDisjointWith,X5,X6))|((ip(X5)&ip(X6))&![X7]:![X8]:(~(iext(X5,X7,X8))|~(iext(X6,X7,X8)))))&(((~(ip(X5))|~(ip(X6)))|?[X9]:?[X10]:(iext(X5,X9,X10)&iext(X6,X9,X10)))|iext(uri_owl_propertyDisjointWith,X5,X6))),inference(variable_rename,[status(thm)],[14])).
% fof(16, plain,![X5]:![X6]:((~(iext(uri_owl_propertyDisjointWith,X5,X6))|((ip(X5)&ip(X6))&![X7]:![X8]:(~(iext(X5,X7,X8))|~(iext(X6,X7,X8)))))&(((~(ip(X5))|~(ip(X6)))|(iext(X5,esk1_2(X5,X6),esk2_2(X5,X6))&iext(X6,esk1_2(X5,X6),esk2_2(X5,X6))))|iext(uri_owl_propertyDisjointWith,X5,X6))),inference(skolemize,[status(esa)],[15])).
% fof(17, plain,![X5]:![X6]:![X7]:![X8]:((((~(iext(X5,X7,X8))|~(iext(X6,X7,X8)))&(ip(X5)&ip(X6)))|~(iext(uri_owl_propertyDisjointWith,X5,X6)))&(((~(ip(X5))|~(ip(X6)))|(iext(X5,esk1_2(X5,X6),esk2_2(X5,X6))&iext(X6,esk1_2(X5,X6),esk2_2(X5,X6))))|iext(uri_owl_propertyDisjointWith,X5,X6))),inference(shift_quantors,[status(thm)],[16])).
% fof(18, plain,![X5]:![X6]:![X7]:![X8]:((((~(iext(X5,X7,X8))|~(iext(X6,X7,X8)))|~(iext(uri_owl_propertyDisjointWith,X5,X6)))&((ip(X5)|~(iext(uri_owl_propertyDisjointWith,X5,X6)))&(ip(X6)|~(iext(uri_owl_propertyDisjointWith,X5,X6)))))&(((iext(X5,esk1_2(X5,X6),esk2_2(X5,X6))|(~(ip(X5))|~(ip(X6))))|iext(uri_owl_propertyDisjointWith,X5,X6))&((iext(X6,esk1_2(X5,X6),esk2_2(X5,X6))|(~(ip(X5))|~(ip(X6))))|iext(uri_owl_propertyDisjointWith,X5,X6)))),inference(distribute,[status(thm)],[17])).
% cnf(23,plain,(~iext(uri_owl_propertyDisjointWith,X1,X2)|~iext(X2,X3,X4)|~iext(X1,X3,X4)),inference(split_conjunct,[status(thm)],[18])).
% cnf(24,negated_conjecture,(~iext(uri_owl_differentFrom,uri_ex_w,uri_ex_u)),inference(split_conjunct,[status(thm)],[6])).
% cnf(26,negated_conjecture,(uri_ex_w=uri_ex_u),inference(spm,[status(thm)],[24,9,theory(equality)])).
% cnf(29,plain,(~iext(uri_rdf_type,X1,X2)|~iext(uri_ex_notInstanceOf,X1,X2)),inference(spm,[status(thm)],[23,13,theory(equality)])).
% cnf(37,plain,(iext(uri_rdf_type,uri_ex_u,uri_ex_c)),inference(rw,[status(thm)],[12,26,theory(equality)])).
% cnf(40,plain,(~iext(uri_ex_notInstanceOf,uri_ex_u,uri_ex_c)),inference(spm,[status(thm)],[29,37,theory(equality)])).
% cnf(45,plain,($false),inference(rw,[status(thm)],[40,11,theory(equality)])).
% cnf(46,plain,($false),inference(cn,[status(thm)],[45,theory(equality)])).
% cnf(47,plain,($false),46,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 28
% # ...of these trivial                : 0
% # ...subsumed                        : 1
% # ...remaining for further processing: 27
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 2
% # Generated clauses                  : 14
% # ...of the previous two non-trivial : 15
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 13
% # Factorizations                     : 0
% # Equation resolutions               : 1
% # Current number of processed clauses: 13
% #    Positive orientable unit clauses: 5
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 1
% #    Non-unit-clauses                : 7
% # Current number of unprocessed clauses: 9
% # ...number of literals in the above : 33
% # Clause-clause subsumption calls (NU) : 8
% # Rec. Clause-clause subsumption calls : 8
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 1
% # Indexed BW rewrite successes       : 1
% # Backwards rewriting index:    21 leaves,   1.33+/-0.471 terms/leaf
% # Paramod-from index:            7 leaves,   1.14+/-0.350 terms/leaf
% # Paramod-into index:           17 leaves,   1.29+/-0.456 terms/leaf
% # -------------------------------------------------
% # User time              : 0.010 s
% # System time            : 0.002 s
% # Total time             : 0.012 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.17 WC
% FINAL PrfWatch: 0.10 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP24557/SWB017+2.tptp
% 
%------------------------------------------------------------------------------