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

% Computer : art04.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 20:07:40 EST 2010

% Result   : Theorem 2.62s
% Output   : Solution 2.62s
% 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/SystemOnTPTP26848/NUM564+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP26848/NUM564+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP26848/NUM564+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 26944
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time     : 0.538 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(79, conjecture,((aSet0(slcrc0)&~(?[X1]:aElementOf0(X1,slcrc0)))=>((![X1]:(aElementOf0(X1,slcrc0)=>aElementOf0(X1,xS))|aSubsetOf0(slcrc0,xS))|aElementOf0(slcrc0,slbdtsldtrb0(xS,sz00)))),file('/tmp/SRASS.s.p', m__)).
% fof(80, negated_conjecture,~(((aSet0(slcrc0)&~(?[X1]:aElementOf0(X1,slcrc0)))=>((![X1]:(aElementOf0(X1,slcrc0)=>aElementOf0(X1,xS))|aSubsetOf0(slcrc0,xS))|aElementOf0(slcrc0,slbdtsldtrb0(xS,sz00))))),inference(assume_negation,[status(cth)],[79])).
% fof(4439, negated_conjecture,((aSet0(slcrc0)&![X1]:~(aElementOf0(X1,slcrc0)))&((?[X1]:(aElementOf0(X1,slcrc0)&~(aElementOf0(X1,xS)))&~(aSubsetOf0(slcrc0,xS)))&~(aElementOf0(slcrc0,slbdtsldtrb0(xS,sz00))))),inference(fof_nnf,[status(thm)],[80])).
% fof(4440, negated_conjecture,((aSet0(slcrc0)&![X2]:~(aElementOf0(X2,slcrc0)))&((?[X3]:(aElementOf0(X3,slcrc0)&~(aElementOf0(X3,xS)))&~(aSubsetOf0(slcrc0,xS)))&~(aElementOf0(slcrc0,slbdtsldtrb0(xS,sz00))))),inference(variable_rename,[status(thm)],[4439])).
% fof(4441, negated_conjecture,((aSet0(slcrc0)&![X2]:~(aElementOf0(X2,slcrc0)))&(((aElementOf0(esk30_0,slcrc0)&~(aElementOf0(esk30_0,xS)))&~(aSubsetOf0(slcrc0,xS)))&~(aElementOf0(slcrc0,slbdtsldtrb0(xS,sz00))))),inference(skolemize,[status(esa)],[4440])).
% fof(4442, negated_conjecture,![X2]:((~(aElementOf0(X2,slcrc0))&aSet0(slcrc0))&(((aElementOf0(esk30_0,slcrc0)&~(aElementOf0(esk30_0,xS)))&~(aSubsetOf0(slcrc0,xS)))&~(aElementOf0(slcrc0,slbdtsldtrb0(xS,sz00))))),inference(shift_quantors,[status(thm)],[4441])).
% cnf(4446,negated_conjecture,(aElementOf0(esk30_0,slcrc0)),inference(split_conjunct,[status(thm)],[4442])).
% cnf(4448,negated_conjecture,(~aElementOf0(X1,slcrc0)),inference(split_conjunct,[status(thm)],[4442])).
% cnf(4449,negated_conjecture,($false),inference(sr,[status(thm)],[4446,4448,theory(equality)])).
% cnf(4450,negated_conjecture,($false),4449,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 12
% # ...of these trivial                : 0
% # ...subsumed                        : 0
% # ...remaining for further processing: 12
% # 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    : 0
% # Paramodulations                    : 0
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 11
% #    Positive orientable unit clauses: 8
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 3
% #    Non-unit-clauses                : 0
% # Current number of unprocessed clauses: 2800
% # ...number of literals in the above : 34064
% # 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        : 0
% # Indexed BW rewrite successes       : 0
% # Backwards rewriting index:    18 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-from index:            8 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-into index:           17 leaves,   1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time              : 0.510 s
% # System time            : 0.029 s
% # Total time             : 0.539 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.64 CPU 1.71 WC
% FINAL PrfWatch: 1.64 CPU 1.71 WC
% SZS output end Solution for /tmp/SystemOnTPTP26848/NUM564+3.tptp
% 
%------------------------------------------------------------------------------