%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET876+1 : TPTP v5.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art01.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 00:14:14 EST 2010
% Result : Theorem 1.05s
% Output : Solution 1.05s
% 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/SystemOnTPTP29316/SET876+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP29316/SET876+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP29316/SET876+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 29412
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:(X2=singleton(X1)<=>![X3]:(in(X3,X2)<=>X3=X1)),file('/tmp/SRASS.s.p', d1_tarski)).
% fof(3, axiom,![X1]:![X2]:(~(in(X1,X2))=>disjoint(singleton(X1),X2)),file('/tmp/SRASS.s.p', l28_zfmisc_1)).
% fof(7, conjecture,![X1]:![X2]:(~(X1=X2)=>disjoint(singleton(X1),singleton(X2))),file('/tmp/SRASS.s.p', t17_zfmisc_1)).
% fof(8, negated_conjecture,~(![X1]:![X2]:(~(X1=X2)=>disjoint(singleton(X1),singleton(X2)))),inference(assume_negation,[status(cth)],[7])).
% fof(9, plain,![X1]:![X2]:(~(in(X1,X2))=>disjoint(singleton(X1),X2)),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(15, plain,![X1]:![X2]:((~(X2=singleton(X1))|![X3]:((~(in(X3,X2))|X3=X1)&(~(X3=X1)|in(X3,X2))))&(?[X3]:((~(in(X3,X2))|~(X3=X1))&(in(X3,X2)|X3=X1))|X2=singleton(X1))),inference(fof_nnf,[status(thm)],[2])).
% fof(16, plain,![X4]:![X5]:((~(X5=singleton(X4))|![X6]:((~(in(X6,X5))|X6=X4)&(~(X6=X4)|in(X6,X5))))&(?[X7]:((~(in(X7,X5))|~(X7=X4))&(in(X7,X5)|X7=X4))|X5=singleton(X4))),inference(variable_rename,[status(thm)],[15])).
% fof(17, plain,![X4]:![X5]:((~(X5=singleton(X4))|![X6]:((~(in(X6,X5))|X6=X4)&(~(X6=X4)|in(X6,X5))))&(((~(in(esk1_2(X4,X5),X5))|~(esk1_2(X4,X5)=X4))&(in(esk1_2(X4,X5),X5)|esk1_2(X4,X5)=X4))|X5=singleton(X4))),inference(skolemize,[status(esa)],[16])).
% fof(18, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|X6=X4)&(~(X6=X4)|in(X6,X5)))|~(X5=singleton(X4)))&(((~(in(esk1_2(X4,X5),X5))|~(esk1_2(X4,X5)=X4))&(in(esk1_2(X4,X5),X5)|esk1_2(X4,X5)=X4))|X5=singleton(X4))),inference(shift_quantors,[status(thm)],[17])).
% fof(19, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|X6=X4)|~(X5=singleton(X4)))&((~(X6=X4)|in(X6,X5))|~(X5=singleton(X4))))&(((~(in(esk1_2(X4,X5),X5))|~(esk1_2(X4,X5)=X4))|X5=singleton(X4))&((in(esk1_2(X4,X5),X5)|esk1_2(X4,X5)=X4)|X5=singleton(X4)))),inference(distribute,[status(thm)],[18])).
% cnf(23,plain,(X3=X2|X1!=singleton(X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[19])).
% fof(24, plain,![X1]:![X2]:(in(X1,X2)|disjoint(singleton(X1),X2)),inference(fof_nnf,[status(thm)],[9])).
% fof(25, plain,![X3]:![X4]:(in(X3,X4)|disjoint(singleton(X3),X4)),inference(variable_rename,[status(thm)],[24])).
% cnf(26,plain,(disjoint(singleton(X1),X2)|in(X1,X2)),inference(split_conjunct,[status(thm)],[25])).
% fof(36, negated_conjecture,?[X1]:?[X2]:(~(X1=X2)&~(disjoint(singleton(X1),singleton(X2)))),inference(fof_nnf,[status(thm)],[8])).
% fof(37, negated_conjecture,?[X3]:?[X4]:(~(X3=X4)&~(disjoint(singleton(X3),singleton(X4)))),inference(variable_rename,[status(thm)],[36])).
% fof(38, negated_conjecture,(~(esk4_0=esk5_0)&~(disjoint(singleton(esk4_0),singleton(esk5_0)))),inference(skolemize,[status(esa)],[37])).
% cnf(39,negated_conjecture,(~disjoint(singleton(esk4_0),singleton(esk5_0))),inference(split_conjunct,[status(thm)],[38])).
% cnf(40,negated_conjecture,(esk4_0!=esk5_0),inference(split_conjunct,[status(thm)],[38])).
% cnf(43,negated_conjecture,(in(esk4_0,singleton(esk5_0))),inference(spm,[status(thm)],[39,26,theory(equality)])).
% cnf(51,negated_conjecture,(X1=esk4_0|singleton(X1)!=singleton(esk5_0)),inference(spm,[status(thm)],[23,43,theory(equality)])).
% cnf(52,negated_conjecture,(esk5_0=esk4_0),inference(er,[status(thm)],[51,theory(equality)])).
% cnf(53,negated_conjecture,($false),inference(sr,[status(thm)],[52,40,theory(equality)])).
% cnf(54,negated_conjecture,($false),53,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 25
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 25
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 12
% # ...of the previous two non-trivial : 10
% # Contextual simplify-reflections : 0
% # Paramodulations : 10
% # Factorizations : 0
% # Equation resolutions : 2
% # Current number of processed clauses: 13
% # Positive orientable unit clauses: 2
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 8
% # Current number of unprocessed clauses: 7
% # ...number of literals in the above : 18
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 17 leaves, 1.18+/-0.513 terms/leaf
% # Paramod-from index: 5 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 16 leaves, 1.06+/-0.242 terms/leaf
% # -------------------------------------------------
% # User time : 0.011 s
% # System time : 0.002 s
% # Total time : 0.013 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.18 WC
% FINAL PrfWatch: 0.12 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP29316/SET876+1.tptp
%
%------------------------------------------------------------------------------