%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET958+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 : art03.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:23:43 EST 2010
% Result : Theorem 0.88s
% Output : Solution 0.88s
% 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/SystemOnTPTP11063/SET958+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP11063/SET958+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP11063/SET958+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 11159
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(in(X3,X1)=>in(X3,X2))),file('/tmp/SRASS.s.p', d3_tarski)).
% fof(5, axiom,![X1]:![X2]:unordered_pair(X1,X2)=unordered_pair(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_tarski)).
% fof(8, axiom,![X1]:![X2]:ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1)),file('/tmp/SRASS.s.p', d5_tarski)).
% fof(9, conjecture,![X1]:![X2]:((![X3]:~((in(X3,X1)&![X4]:![X5]:~(X3=ordered_pair(X4,X5))))&![X3]:![X4]:(in(ordered_pair(X3,X4),X1)=>in(ordered_pair(X3,X4),X2)))=>subset(X1,X2)),file('/tmp/SRASS.s.p', t111_zfmisc_1)).
% fof(10, negated_conjecture,~(![X1]:![X2]:((![X3]:~((in(X3,X1)&![X4]:![X5]:~(X3=ordered_pair(X4,X5))))&![X3]:![X4]:(in(ordered_pair(X3,X4),X1)=>in(ordered_pair(X3,X4),X2)))=>subset(X1,X2))),inference(assume_negation,[status(cth)],[9])).
% fof(17, plain,![X1]:![X2]:((~(subset(X1,X2))|![X3]:(~(in(X3,X1))|in(X3,X2)))&(?[X3]:(in(X3,X1)&~(in(X3,X2)))|subset(X1,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(18, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&(?[X7]:(in(X7,X4)&~(in(X7,X5)))|subset(X4,X5))),inference(variable_rename,[status(thm)],[17])).
% fof(19, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&((in(esk1_2(X4,X5),X4)&~(in(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[18])).
% fof(20, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk1_2(X4,X5),X4)&~(in(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[19])).
% fof(21, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk1_2(X4,X5),X4)|subset(X4,X5))&(~(in(esk1_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[20])).
% cnf(22,plain,(subset(X1,X2)|~in(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[21])).
% cnf(23,plain,(subset(X1,X2)|in(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[21])).
% fof(29, plain,![X3]:![X4]:unordered_pair(X3,X4)=unordered_pair(X4,X3),inference(variable_rename,[status(thm)],[5])).
% cnf(30,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X1)),inference(split_conjunct,[status(thm)],[29])).
% fof(37, plain,![X3]:![X4]:ordered_pair(X3,X4)=unordered_pair(unordered_pair(X3,X4),singleton(X3)),inference(variable_rename,[status(thm)],[8])).
% cnf(38,plain,(ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1))),inference(split_conjunct,[status(thm)],[37])).
% fof(39, negated_conjecture,?[X1]:?[X2]:((![X3]:(~(in(X3,X1))|?[X4]:?[X5]:X3=ordered_pair(X4,X5))&![X3]:![X4]:(~(in(ordered_pair(X3,X4),X1))|in(ordered_pair(X3,X4),X2)))&~(subset(X1,X2))),inference(fof_nnf,[status(thm)],[10])).
% fof(40, negated_conjecture,?[X6]:?[X7]:((![X8]:(~(in(X8,X6))|?[X9]:?[X10]:X8=ordered_pair(X9,X10))&![X11]:![X12]:(~(in(ordered_pair(X11,X12),X6))|in(ordered_pair(X11,X12),X7)))&~(subset(X6,X7))),inference(variable_rename,[status(thm)],[39])).
% fof(41, negated_conjecture,((![X8]:(~(in(X8,esk4_0))|X8=ordered_pair(esk6_1(X8),esk7_1(X8)))&![X11]:![X12]:(~(in(ordered_pair(X11,X12),esk4_0))|in(ordered_pair(X11,X12),esk5_0)))&~(subset(esk4_0,esk5_0))),inference(skolemize,[status(esa)],[40])).
% fof(42, negated_conjecture,![X8]:![X11]:![X12]:(((~(in(ordered_pair(X11,X12),esk4_0))|in(ordered_pair(X11,X12),esk5_0))&(~(in(X8,esk4_0))|X8=ordered_pair(esk6_1(X8),esk7_1(X8))))&~(subset(esk4_0,esk5_0))),inference(shift_quantors,[status(thm)],[41])).
% cnf(43,negated_conjecture,(~subset(esk4_0,esk5_0)),inference(split_conjunct,[status(thm)],[42])).
% cnf(44,negated_conjecture,(X1=ordered_pair(esk6_1(X1),esk7_1(X1))|~in(X1,esk4_0)),inference(split_conjunct,[status(thm)],[42])).
% cnf(45,negated_conjecture,(in(ordered_pair(X1,X2),esk5_0)|~in(ordered_pair(X1,X2),esk4_0)),inference(split_conjunct,[status(thm)],[42])).
% cnf(46,negated_conjecture,(unordered_pair(unordered_pair(esk6_1(X1),esk7_1(X1)),singleton(esk6_1(X1)))=X1|~in(X1,esk4_0)),inference(rw,[status(thm)],[44,38,theory(equality)]),['unfolding']).
% cnf(47,negated_conjecture,(in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk5_0)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk4_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[45,38,theory(equality)]),38,theory(equality)]),['unfolding']).
% cnf(49,negated_conjecture,(unordered_pair(singleton(esk6_1(X1)),unordered_pair(esk6_1(X1),esk7_1(X1)))=X1|~in(X1,esk4_0)),inference(rw,[status(thm)],[46,30,theory(equality)])).
% cnf(63,negated_conjecture,(in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),esk5_0)|~in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),esk4_0)),inference(spm,[status(thm)],[47,30,theory(equality)])).
% cnf(89,negated_conjecture,(in(X1,esk5_0)|~in(X1,esk4_0)),inference(spm,[status(thm)],[63,49,theory(equality)])).
% cnf(90,negated_conjecture,(subset(X1,esk5_0)|~in(esk1_2(X1,esk5_0),esk4_0)),inference(spm,[status(thm)],[22,89,theory(equality)])).
% cnf(93,negated_conjecture,(subset(esk4_0,esk5_0)),inference(spm,[status(thm)],[90,23,theory(equality)])).
% cnf(94,negated_conjecture,($false),inference(sr,[status(thm)],[93,43,theory(equality)])).
% cnf(95,negated_conjecture,($false),94,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 41
% # ...of these trivial : 0
% # ...subsumed : 5
% # ...remaining for further processing: 36
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 3
% # Backward-rewritten : 0
% # Generated clauses : 43
% # ...of the previous two non-trivial : 40
% # Contextual simplify-reflections : 0
% # Paramodulations : 43
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 21
% # Positive orientable unit clauses: 2
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 7
% # Non-unit-clauses : 11
% # Current number of unprocessed clauses: 8
% # ...number of literals in the above : 10
% # Clause-clause subsumption calls (NU) : 28
% # Rec. Clause-clause subsumption calls : 28
% # Unit Clause-clause subsumption calls : 4
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 36 leaves, 1.25+/-0.546 terms/leaf
% # Paramod-from index: 6 leaves, 1.17+/-0.373 terms/leaf
% # Paramod-into index: 33 leaves, 1.18+/-0.386 terms/leaf
% # -------------------------------------------------
% # User time : 0.010 s
% # System time : 0.003 s
% # Total time : 0.013 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.17 WC
% FINAL PrfWatch: 0.09 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP11063/SET958+1.tptp
%
%------------------------------------------------------------------------------