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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SWB006+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 02:58:23 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/SystemOnTPTP27276/SWB006+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP27276/SWB006+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP27276/SWB006+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 27364
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 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]:((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(2, axiom,![X2]:![X3]:(iext(uri_owl_sameAs,X2,X3)<=>X2=X3),file('/tmp/SRASS.s.p', owl_eqdis_sameas)).
% fof(3, 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(4, negated_conjecture,~(iext(uri_owl_sameAs,uri_ex_u,uri_ex_w)),inference(assume_negation,[status(cth)],[3])).
% fof(5, negated_conjecture,~(iext(uri_owl_sameAs,uri_ex_u,uri_ex_w)),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(6, 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(7, 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)],[6])).
% cnf(8,plain,(iext(uri_owl_sameAs,esk1_0,uri_ex_w)),inference(split_conjunct,[status(thm)],[7])).
% cnf(9,plain,(iext(uri_owl_sameAs,esk1_0,literal_plain(dat_str_abc))),inference(split_conjunct,[status(thm)],[7])).
% cnf(10,plain,(iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc))),inference(split_conjunct,[status(thm)],[7])).
% fof(11, plain,![X2]:![X3]:((~(iext(uri_owl_sameAs,X2,X3))|X2=X3)&(~(X2=X3)|iext(uri_owl_sameAs,X2,X3))),inference(fof_nnf,[status(thm)],[2])).
% fof(12, plain,![X4]:![X5]:((~(iext(uri_owl_sameAs,X4,X5))|X4=X5)&(~(X4=X5)|iext(uri_owl_sameAs,X4,X5))),inference(variable_rename,[status(thm)],[11])).
% cnf(13,plain,(iext(uri_owl_sameAs,X1,X2)|X1!=X2),inference(split_conjunct,[status(thm)],[12])).
% cnf(14,plain,(X1=X2|~iext(uri_owl_sameAs,X1,X2)),inference(split_conjunct,[status(thm)],[12])).
% cnf(15,negated_conjecture,(~iext(uri_owl_sameAs,uri_ex_u,uri_ex_w)),inference(split_conjunct,[status(thm)],[5])).
% cnf(16,plain,(iext(uri_owl_sameAs,X1,X1)),inference(er,[status(thm)],[13,theory(equality)])).
% cnf(17,plain,(esk1_0=uri_ex_w),inference(spm,[status(thm)],[14,8,theory(equality)])).
% cnf(18,plain,(uri_ex_u=literal_plain(dat_str_abc)),inference(spm,[status(thm)],[14,10,theory(equality)])).
% cnf(20,negated_conjecture,(~iext(uri_owl_sameAs,uri_ex_u,esk1_0)),inference(rw,[status(thm)],[15,17,theory(equality)])).
% cnf(22,plain,(iext(uri_owl_sameAs,esk1_0,uri_ex_u)),inference(rw,[status(thm)],[9,18,theory(equality)])).
% cnf(24,plain,(esk1_0=uri_ex_u),inference(spm,[status(thm)],[14,22,theory(equality)])).
% cnf(26,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[20,24,theory(equality)]),16,theory(equality)])).
% cnf(27,negated_conjecture,($false),inference(cn,[status(thm)],[26,theory(equality)])).
% cnf(28,negated_conjecture,($false),27,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 18
% # ...of these trivial                : 0
% # ...subsumed                        : 0
% # ...remaining for further processing: 18
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 7
% # Generated clauses                  : 5
% # ...of the previous two non-trivial : 8
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 4
% # Factorizations                     : 0
% # Equation resolutions               : 1
% # Current number of processed clauses: 4
% #    Positive orientable unit clauses: 3
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 0
% #    Non-unit-clauses                : 1
% # Current number of unprocessed clauses: 1
% # ...number of literals in the above : 1
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 16
% # Indexed BW rewrite successes       : 3
% # Backwards rewriting index:     6 leaves,   1.17+/-0.373 terms/leaf
% # Paramod-from index:            3 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-into index:            4 leaves,   1.25+/-0.433 terms/leaf
% # -------------------------------------------------
% # User time              : 0.007 s
% # System time            : 0.004 s
% # Total time             : 0.011 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.08 CPU 0.17 WC
% FINAL PrfWatch: 0.08 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP27276/SWB006+2.tptp
% 
%------------------------------------------------------------------------------