TSTP Solution File: SWB006+1 by SRASS---0.1

View Problem - Process Solution

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

% Computer : art06.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 02:58:14 EST 2011

% Result   : Theorem 20.34s
% Output   : Solution 20.34s
% 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/SystemOnTPTP26428/SWB006+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% WARNING: TreeLimitedRun lost 0.31s, total lost is 0.31s
% found
% SZS status THM for /tmp/SystemOnTPTP26428/SWB006+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP26428/SWB006+1.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 26520
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% PrfWatch: 1.50 CPU 2.13 WC
% # Preprocessing time     : 0.145 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 3.46 CPU 4.13 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,?[X1]:((iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc))&iext(uri_owl_sameAs,X1,literal_plain(dat_str_abc)))&iext(uri_owl_sameAs,X1,uri_ex_w)),file('/tmp/SRASS.s.p', testcase_premise_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes)).
% fof(3, axiom,![X2]:![X3]:(iext(uri_owl_sameAs,X2,X3)<=>X2=X3),file('/tmp/SRASS.s.p', owl_eqdis_sameas)).
% fof(560, conjecture,iext(uri_owl_sameAs,uri_ex_u,uri_ex_w),file('/tmp/SRASS.s.p', testcase_conclusion_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes)).
% fof(561, negated_conjecture,~(iext(uri_owl_sameAs,uri_ex_u,uri_ex_w)),inference(assume_negation,[status(cth)],[560])).
% fof(584, negated_conjecture,~(iext(uri_owl_sameAs,uri_ex_u,uri_ex_w)),inference(fof_simplification,[status(thm)],[561,theory(equality)])).
% fof(589, plain,?[X2]:((iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc))&iext(uri_owl_sameAs,X2,literal_plain(dat_str_abc)))&iext(uri_owl_sameAs,X2,uri_ex_w)),inference(variable_rename,[status(thm)],[1])).
% fof(590, plain,((iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc))&iext(uri_owl_sameAs,esk1_0,literal_plain(dat_str_abc)))&iext(uri_owl_sameAs,esk1_0,uri_ex_w)),inference(skolemize,[status(esa)],[589])).
% cnf(591,plain,(iext(uri_owl_sameAs,esk1_0,uri_ex_w)),inference(split_conjunct,[status(thm)],[590])).
% cnf(592,plain,(iext(uri_owl_sameAs,esk1_0,literal_plain(dat_str_abc))),inference(split_conjunct,[status(thm)],[590])).
% cnf(593,plain,(iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc))),inference(split_conjunct,[status(thm)],[590])).
% fof(599, plain,![X2]:![X3]:((~(iext(uri_owl_sameAs,X2,X3))|X2=X3)&(~(X2=X3)|iext(uri_owl_sameAs,X2,X3))),inference(fof_nnf,[status(thm)],[3])).
% fof(600, plain,![X4]:![X5]:((~(iext(uri_owl_sameAs,X4,X5))|X4=X5)&(~(X4=X5)|iext(uri_owl_sameAs,X4,X5))),inference(variable_rename,[status(thm)],[599])).
% cnf(601,plain,(iext(uri_owl_sameAs,X1,X2)|X1!=X2),inference(split_conjunct,[status(thm)],[600])).
% cnf(602,plain,(X1=X2|~iext(uri_owl_sameAs,X1,X2)),inference(split_conjunct,[status(thm)],[600])).
% cnf(2833,negated_conjecture,(~iext(uri_owl_sameAs,uri_ex_u,uri_ex_w)),inference(split_conjunct,[status(thm)],[584])).
% cnf(3006,plain,(iext(uri_owl_sameAs,X1,X1)),inference(er,[status(thm)],[601,theory(equality)])).
% cnf(3112,plain,(esk1_0=uri_ex_w),inference(spm,[status(thm)],[602,591,theory(equality)])).
% cnf(3172,plain,(uri_ex_u=literal_plain(dat_str_abc)),inference(spm,[status(thm)],[602,593,theory(equality)])).
% cnf(47588,negated_conjecture,(~iext(uri_owl_sameAs,uri_ex_u,esk1_0)),inference(rw,[status(thm)],[2833,3112,theory(equality)])).
% cnf(49313,plain,(iext(uri_owl_sameAs,esk1_0,uri_ex_u)),inference(rw,[status(thm)],[592,3172,theory(equality)])).
% cnf(49751,plain,(esk1_0=uri_ex_u),inference(spm,[status(thm)],[602,49313,theory(equality)])).
% cnf(50107,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[47588,49751,theory(equality)]),3006,theory(equality)])).
% cnf(50108,negated_conjecture,($false),inference(cn,[status(thm)],[50107,theory(equality)])).
% cnf(50109,negated_conjecture,($false),50108,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 2408
% # ...of these trivial                : 17
% # ...subsumed                        : 59
% # ...remaining for further processing: 2332
% # Other redundant clauses eliminated : 16
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 6
% # Backward-rewritten                 : 7
% # Generated clauses                  : 39587
% # ...of the previous two non-trivial : 39326
% # Contextual simplify-reflections    : 88
% # Paramodulations                    : 39559
% # Factorizations                     : 12
% # Equation resolutions               : 16
% # Current number of processed clauses: 1209
% #    Positive orientable unit clauses: 294
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 14
% #    Non-unit-clauses                : 901
% # Current number of unprocessed clauses: 38850
% # ...number of literals in the above : 319954
% # Clause-clause subsumption calls (NU) : 862856
% # Rec. Clause-clause subsumption calls : 35206
% # Unit Clause-clause subsumption calls : 5752
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 140
% # Indexed BW rewrite successes       : 3
% # Backwards rewriting index:   997 leaves,   1.84+/-6.036 terms/leaf
% # Paramod-from index:          435 leaves,   1.24+/-3.473 terms/leaf
% # Paramod-into index:          871 leaves,   1.43+/-3.151 terms/leaf
% # -------------------------------------------------
% # User time              : 2.809 s
% # System time            : 0.084 s
% # Total time             : 2.893 s
% # Maximum resident set size: 0 pages
% PrfWatch: 4.12 CPU 4.79 WC
% FINAL PrfWatch: 4.12 CPU 4.79 WC
% SZS output end Solution for /tmp/SystemOnTPTP26428/SWB006+1.tptp
% 
%------------------------------------------------------------------------------