%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SWB002+3 : 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 : Fri Feb 25 03:05:27 EST 2011

% Result   : Theorem 1.20s
% Output   : Solution 1.20s
% 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/SystemOnTPTP29462/SWB002+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP29462/SWB002+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP29462/SWB002+3.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 29550
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time     : 0.033 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,?[X1]:(iext(uri_ex_p,uri_ex_s,X1)&iext(uri_ex_q,X1,uri_ex_s)),file('/tmp/SRASS.s.p', testcase_premise_fullish_002_Existential_Blank_Nodes)).
% fof(140, conjecture,?[X22]:?[X23]:(iext(uri_ex_p,X22,X23)&iext(uri_ex_q,X23,X22)),file('/tmp/SRASS.s.p', testcase_conclusion_fullish_002_Existential_Blank_Nodes)).
% fof(141, negated_conjecture,~(?[X22]:?[X23]:(iext(uri_ex_p,X22,X23)&iext(uri_ex_q,X23,X22))),inference(assume_negation,[status(cth)],[140])).
% fof(145, plain,?[X2]:(iext(uri_ex_p,uri_ex_s,X2)&iext(uri_ex_q,X2,uri_ex_s)),inference(variable_rename,[status(thm)],[1])).
% fof(146, plain,(iext(uri_ex_p,uri_ex_s,esk1_0)&iext(uri_ex_q,esk1_0,uri_ex_s)),inference(skolemize,[status(esa)],[145])).
% cnf(147,plain,(iext(uri_ex_q,esk1_0,uri_ex_s)),inference(split_conjunct,[status(thm)],[146])).
% cnf(148,plain,(iext(uri_ex_p,uri_ex_s,esk1_0)),inference(split_conjunct,[status(thm)],[146])).
% fof(596, negated_conjecture,![X22]:![X23]:(~(iext(uri_ex_p,X22,X23))|~(iext(uri_ex_q,X23,X22))),inference(fof_nnf,[status(thm)],[141])).
% fof(597, negated_conjecture,![X24]:![X25]:(~(iext(uri_ex_p,X24,X25))|~(iext(uri_ex_q,X25,X24))),inference(variable_rename,[status(thm)],[596])).
% cnf(598,negated_conjecture,(~iext(uri_ex_q,X1,X2)|~iext(uri_ex_p,X2,X1)),inference(split_conjunct,[status(thm)],[597])).
% cnf(649,negated_conjecture,(~iext(uri_ex_p,uri_ex_s,esk1_0)),inference(spm,[status(thm)],[598,147,theory(equality)])).
% cnf(650,negated_conjecture,($false),inference(rw,[status(thm)],[649,148,theory(equality)])).
% cnf(651,negated_conjecture,($false),inference(cn,[status(thm)],[650,theory(equality)])).
% cnf(652,negated_conjecture,($false),651,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 253
% # ...of these trivial                : 2
% # ...subsumed                        : 18
% # ...remaining for further processing: 233
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 2
% # Backward-rewritten                 : 0
% # Generated clauses                  : 1
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections    : 25
% # Paramodulations                    : 1
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 23
% #    Positive orientable unit clauses: 18
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 0
% #    Non-unit-clauses                : 5
% # Current number of unprocessed clauses: 185
% # ...number of literals in the above : 683
% # Clause-clause subsumption calls (NU) : 2070
% # Rec. Clause-clause subsumption calls : 717
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 3
% # Indexed BW rewrite successes       : 0
% # Backwards rewriting index:    49 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-from index:           18 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-into index:           45 leaves,   1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time              : 0.055 s
% # System time            : 0.004 s
% # Total time             : 0.059 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.16 CPU 0.26 WC
% FINAL PrfWatch: 0.16 CPU 0.26 WC
% SZS output end Solution for /tmp/SystemOnTPTP29462/SWB002+3.tptp
% 
%------------------------------------------------------------------------------