%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU158+2 : TPTP v5.0.0. Released v3.3.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 : Thu Dec 30 01:20:58 EST 2010
% Result : Theorem 1.14s
% Output : Solution 1.14s
% 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/SystemOnTPTP21529/SEU158+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP21529/SEU158+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21529/SEU158+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 21625
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.023 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:![X2]:(subset(singleton(X1),X2)<=>in(X1,X2)),file('/tmp/SRASS.s.p', l2_zfmisc_1)).
% fof(58, axiom,![X1]:unordered_pair(X1,X1)=singleton(X1),file('/tmp/SRASS.s.p', t69_enumset1)).
% fof(88, conjecture,![X1]:![X2]:(subset(singleton(X1),X2)<=>in(X1,X2)),file('/tmp/SRASS.s.p', t37_zfmisc_1)).
% fof(89, negated_conjecture,~(![X1]:![X2]:(subset(singleton(X1),X2)<=>in(X1,X2))),inference(assume_negation,[status(cth)],[88])).
% fof(113, plain,![X1]:![X2]:((~(subset(singleton(X1),X2))|in(X1,X2))&(~(in(X1,X2))|subset(singleton(X1),X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(114, plain,![X3]:![X4]:((~(subset(singleton(X3),X4))|in(X3,X4))&(~(in(X3,X4))|subset(singleton(X3),X4))),inference(variable_rename,[status(thm)],[113])).
% cnf(115,plain,(subset(singleton(X1),X2)|~in(X1,X2)),inference(split_conjunct,[status(thm)],[114])).
% cnf(116,plain,(in(X1,X2)|~subset(singleton(X1),X2)),inference(split_conjunct,[status(thm)],[114])).
% fof(333, plain,![X2]:unordered_pair(X2,X2)=singleton(X2),inference(variable_rename,[status(thm)],[58])).
% cnf(334,plain,(unordered_pair(X1,X1)=singleton(X1)),inference(split_conjunct,[status(thm)],[333])).
% fof(417, negated_conjecture,?[X1]:?[X2]:((~(subset(singleton(X1),X2))|~(in(X1,X2)))&(subset(singleton(X1),X2)|in(X1,X2))),inference(fof_nnf,[status(thm)],[89])).
% fof(418, negated_conjecture,?[X3]:?[X4]:((~(subset(singleton(X3),X4))|~(in(X3,X4)))&(subset(singleton(X3),X4)|in(X3,X4))),inference(variable_rename,[status(thm)],[417])).
% fof(419, negated_conjecture,((~(subset(singleton(esk22_0),esk23_0))|~(in(esk22_0,esk23_0)))&(subset(singleton(esk22_0),esk23_0)|in(esk22_0,esk23_0))),inference(skolemize,[status(esa)],[418])).
% cnf(420,negated_conjecture,(in(esk22_0,esk23_0)|subset(singleton(esk22_0),esk23_0)),inference(split_conjunct,[status(thm)],[419])).
% cnf(421,negated_conjecture,(~in(esk22_0,esk23_0)|~subset(singleton(esk22_0),esk23_0)),inference(split_conjunct,[status(thm)],[419])).
% cnf(425,negated_conjecture,(in(esk22_0,esk23_0)|subset(unordered_pair(esk22_0,esk22_0),esk23_0)),inference(rw,[status(thm)],[420,334,theory(equality)]),['unfolding']).
% cnf(433,plain,(in(X1,X2)|~subset(unordered_pair(X1,X1),X2)),inference(rw,[status(thm)],[116,334,theory(equality)]),['unfolding']).
% cnf(434,plain,(subset(unordered_pair(X1,X1),X2)|~in(X1,X2)),inference(rw,[status(thm)],[115,334,theory(equality)]),['unfolding']).
% cnf(442,negated_conjecture,(~in(esk22_0,esk23_0)|~subset(unordered_pair(esk22_0,esk22_0),esk23_0)),inference(rw,[status(thm)],[421,334,theory(equality)]),['unfolding']).
% cnf(475,negated_conjecture,(~in(esk22_0,esk23_0)),inference(csr,[status(thm)],[442,434])).
% cnf(476,negated_conjecture,(subset(unordered_pair(esk22_0,esk22_0),esk23_0)),inference(sr,[status(thm)],[425,475,theory(equality)])).
% cnf(546,negated_conjecture,(in(esk22_0,esk23_0)),inference(spm,[status(thm)],[433,476,theory(equality)])).
% cnf(548,negated_conjecture,($false),inference(sr,[status(thm)],[546,475,theory(equality)])).
% cnf(549,negated_conjecture,($false),548,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 169
% # ...of these trivial : 1
% # ...subsumed : 6
% # ...remaining for further processing: 162
% # Other redundant clauses eliminated : 6
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 59
% # ...of the previous two non-trivial : 44
% # Contextual simplify-reflections : 1
% # Paramodulations : 51
% # Factorizations : 0
% # Equation resolutions : 7
% # Current number of processed clauses: 29
% # Positive orientable unit clauses: 12
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 4
% # Non-unit-clauses : 12
% # Current number of unprocessed clauses: 136
% # ...number of literals in the above : 320
% # Clause-clause subsumption calls (NU) : 259
% # Rec. Clause-clause subsumption calls : 202
% # Unit Clause-clause subsumption calls : 4
% # Rewrite failures with RHS unbound : 2
% # Indexed BW rewrite attempts : 26
% # Indexed BW rewrite successes : 22
% # Backwards rewriting index: 30 leaves, 1.30+/-0.823 terms/leaf
% # Paramod-from index: 15 leaves, 1.13+/-0.340 terms/leaf
% # Paramod-into index: 28 leaves, 1.29+/-0.839 terms/leaf
% # -------------------------------------------------
% # User time : 0.030 s
% # System time : 0.005 s
% # Total time : 0.035 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.22 WC
% FINAL PrfWatch: 0.12 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP21529/SEU158+2.tptp
%
%------------------------------------------------------------------------------