%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : NUM540+2 : TPTP v5.0.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp
% Command  : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s

% Computer : art07.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 Dec 29 19:59:00 EST 2010

% Result   : Theorem 0.97s
% Output   : Solution 0.97s
% 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/SystemOnTPTP15780/NUM540+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP15780/NUM540+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15780/NUM540+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 15876
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time     : 0.020 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(52, conjecture,((aSet0(slbdtrb0(sz00))&![X1]:~(aElementOf0(X1,slbdtrb0(sz00))))=>(~(?[X1]:aElementOf0(X1,slbdtrb0(sz00)))|slbdtrb0(sz00)=slcrc0)),file('/tmp/SRASS.s.p', m__)).
% fof(53, negated_conjecture,~(((aSet0(slbdtrb0(sz00))&![X1]:~(aElementOf0(X1,slbdtrb0(sz00))))=>(~(?[X1]:aElementOf0(X1,slbdtrb0(sz00)))|slbdtrb0(sz00)=slcrc0))),inference(assume_negation,[status(cth)],[52])).
% fof(64, negated_conjecture,~(((aSet0(slbdtrb0(sz00))&![X1]:~(aElementOf0(X1,slbdtrb0(sz00))))=>(~(?[X1]:aElementOf0(X1,slbdtrb0(sz00)))|slbdtrb0(sz00)=slcrc0))),inference(fof_simplification,[status(thm)],[53,theory(equality)])).
% fof(285, negated_conjecture,((aSet0(slbdtrb0(sz00))&![X1]:~(aElementOf0(X1,slbdtrb0(sz00))))&(?[X1]:aElementOf0(X1,slbdtrb0(sz00))&~(slbdtrb0(sz00)=slcrc0))),inference(fof_nnf,[status(thm)],[64])).
% fof(286, negated_conjecture,((aSet0(slbdtrb0(sz00))&![X2]:~(aElementOf0(X2,slbdtrb0(sz00))))&(?[X3]:aElementOf0(X3,slbdtrb0(sz00))&~(slbdtrb0(sz00)=slcrc0))),inference(variable_rename,[status(thm)],[285])).
% fof(287, negated_conjecture,((aSet0(slbdtrb0(sz00))&![X2]:~(aElementOf0(X2,slbdtrb0(sz00))))&(aElementOf0(esk10_0,slbdtrb0(sz00))&~(slbdtrb0(sz00)=slcrc0))),inference(skolemize,[status(esa)],[286])).
% fof(288, negated_conjecture,![X2]:((~(aElementOf0(X2,slbdtrb0(sz00)))&aSet0(slbdtrb0(sz00)))&(aElementOf0(esk10_0,slbdtrb0(sz00))&~(slbdtrb0(sz00)=slcrc0))),inference(shift_quantors,[status(thm)],[287])).
% cnf(290,negated_conjecture,(aElementOf0(esk10_0,slbdtrb0(sz00))),inference(split_conjunct,[status(thm)],[288])).
% cnf(292,negated_conjecture,(~aElementOf0(X1,slbdtrb0(sz00))),inference(split_conjunct,[status(thm)],[288])).
% cnf(294,negated_conjecture,($false),inference(sr,[status(thm)],[290,292,theory(equality)])).
% cnf(295,negated_conjecture,($false),294,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 10
% # ...of these trivial                : 0
% # ...subsumed                        : 0
% # ...remaining for further processing: 10
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 0
% # Generated clauses                  : 1
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections    : 1
% # Paramodulations                    : 0
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 9
% #    Positive orientable unit clauses: 5
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 2
% #    Non-unit-clauses                : 2
% # Current number of unprocessed clauses: 79
% # ...number of literals in the above : 341
% # Clause-clause subsumption calls (NU) : 1
% # Rec. Clause-clause subsumption calls : 1
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 0
% # Indexed BW rewrite successes       : 0
% # Backwards rewriting index:    13 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-from index:            7 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-into index:           12 leaves,   1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time              : 0.017 s
% # System time            : 0.003 s
% # Total time             : 0.020 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.18 WC
% FINAL PrfWatch: 0.11 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP15780/NUM540+2.tptp
% 
%------------------------------------------------------------------------------