↑ Up

SRASS---0.1.THM-Sol.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SWB015+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 03:20:49 EST 2011

% Result   : Theorem 17.50s
% Output   : Solution 17.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/SystemOnTPTP12775/SWB015+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% WARNING: TreeLimitedRun lost 0.63s, total lost is 0.63s
% found
% SZS status THM for /tmp/SystemOnTPTP12775/SWB015+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP12775/SWB015+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 12899
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time     : 0.143 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:(iext(uri_owl_sameAs,X1,X2)<=>X1=X2),file('/tmp/SRASS.s.p', owl_eqdis_sameas)).
% fof(559, conjecture,iext(uri_owl_sameAs,uri_owl_sameAs,uri_owl_sameAs),file('/tmp/SRASS.s.p', testcase_conclusion_fullish_015_Reflective_Tautologies_I)).
% fof(560, negated_conjecture,~(iext(uri_owl_sameAs,uri_owl_sameAs,uri_owl_sameAs)),inference(assume_negation,[status(cth)],[559])).
% fof(583, negated_conjecture,~(iext(uri_owl_sameAs,uri_owl_sameAs,uri_owl_sameAs)),inference(fof_simplification,[status(thm)],[560,theory(equality)])).
% fof(593, plain,![X1]:![X2]:((~(iext(uri_owl_sameAs,X1,X2))|X1=X2)&(~(X1=X2)|iext(uri_owl_sameAs,X1,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(594, plain,![X3]:![X4]:((~(iext(uri_owl_sameAs,X3,X4))|X3=X4)&(~(X3=X4)|iext(uri_owl_sameAs,X3,X4))),inference(variable_rename,[status(thm)],[593])).
% cnf(595,plain,(iext(uri_owl_sameAs,X1,X2)|X1!=X2),inference(split_conjunct,[status(thm)],[594])).
% cnf(2827,negated_conjecture,(~iext(uri_owl_sameAs,uri_owl_sameAs,uri_owl_sameAs)),inference(split_conjunct,[status(thm)],[583])).
% cnf(3000,plain,(iext(uri_owl_sameAs,X1,X1)),inference(er,[status(thm)],[595,theory(equality)])).
% cnf(3106,negated_conjecture,($false),inference(rw,[status(thm)],[2827,3000,theory(equality)])).
% cnf(3107,negated_conjecture,($false),inference(cn,[status(thm)],[3106,theory(equality)])).
% cnf(3108,negated_conjecture,($false),3107,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 1157
% # ...of these trivial                : 3
% # ...subsumed                        : 56
% # ...remaining for further processing: 1098
% # Other redundant clauses eliminated : 16
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 6
% # Backward-rewritten                 : 1
% # Generated clauses                  : 16
% # ...of the previous two non-trivial : 16
% # Contextual simplify-reflections    : 88
% # Paramodulations                    : 0
% # Factorizations                     : 0
% # Equation resolutions               : 16
% # Current number of processed clauses: 1075
% #    Positive orientable unit clauses: 202
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 3
% #    Non-unit-clauses                : 870
% # Current number of unprocessed clauses: 15
% # ...number of literals in the above : 97
% # Clause-clause subsumption calls (NU) : 334268
% # Rec. Clause-clause subsumption calls : 15971
% # Unit Clause-clause subsumption calls : 3
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 5
% # Indexed BW rewrite successes       : 1
% # Backwards rewriting index:   889 leaves,   1.95+/-6.327 terms/leaf
% # Paramod-from index:          411 leaves,   1.43+/-4.921 terms/leaf
% # Paramod-into index:          846 leaves,   1.85+/-6.261 terms/leaf
% # -------------------------------------------------
% # User time              : 0.435 s
% # System time            : 0.011 s
% # Total time             : 0.446 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.67 CPU 0.76 WC
% FINAL PrfWatch: 0.67 CPU 0.76 WC
% SZS output end Solution for /tmp/SystemOnTPTP12775/SWB015+1.tptp
% 
%------------------------------------------------------------------------------