%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET977+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 : art05.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:28:30 EST 2010
% Result : Theorem 0.89s
% Output : Solution 0.89s
% 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/SystemOnTPTP7162/SET977+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP7162/SET977+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP7162/SET977+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 7258
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.03 WC
% # Preprocessing time : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:(X1=empty_set<=>![X2]:~(in(X2,X1))),file('/tmp/SRASS.s.p', d1_xboole_0)).
% fof(2, axiom,![X1]:![X2]:![X3]:![X4]:(in(ordered_pair(X1,X2),cartesian_product2(singleton(X3),X4))<=>(X1=X3&in(X2,X4))),file('/tmp/SRASS.s.p', t128_zfmisc_1)).
% fof(3, axiom,![X1]:![X2]:![X3]:![X4]:(in(ordered_pair(X1,X2),cartesian_product2(X3,singleton(X4)))<=>(in(X1,X3)&X2=X4)),file('/tmp/SRASS.s.p', t129_zfmisc_1)).
% 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(11, conjecture,![X1]:![X2]:(~(X1=empty_set)=>(~(cartesian_product2(singleton(X2),X1)=empty_set)&~(cartesian_product2(X1,singleton(X2))=empty_set))),file('/tmp/SRASS.s.p', t130_zfmisc_1)).
% fof(12, negated_conjecture,~(![X1]:![X2]:(~(X1=empty_set)=>(~(cartesian_product2(singleton(X2),X1)=empty_set)&~(cartesian_product2(X1,singleton(X2))=empty_set)))),inference(assume_negation,[status(cth)],[11])).
% fof(13, plain,![X1]:(X1=empty_set<=>![X2]:~(in(X2,X1))),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(17, plain,![X1]:((~(X1=empty_set)|![X2]:~(in(X2,X1)))&(?[X2]:in(X2,X1)|X1=empty_set)),inference(fof_nnf,[status(thm)],[13])).
% fof(18, plain,![X3]:((~(X3=empty_set)|![X4]:~(in(X4,X3)))&(?[X5]:in(X5,X3)|X3=empty_set)),inference(variable_rename,[status(thm)],[17])).
% fof(19, plain,![X3]:((~(X3=empty_set)|![X4]:~(in(X4,X3)))&(in(esk1_1(X3),X3)|X3=empty_set)),inference(skolemize,[status(esa)],[18])).
% fof(20, plain,![X3]:![X4]:((~(in(X4,X3))|~(X3=empty_set))&(in(esk1_1(X3),X3)|X3=empty_set)),inference(shift_quantors,[status(thm)],[19])).
% cnf(21,plain,(X1=empty_set|in(esk1_1(X1),X1)),inference(split_conjunct,[status(thm)],[20])).
% cnf(22,plain,(X1!=empty_set|~in(X2,X1)),inference(split_conjunct,[status(thm)],[20])).
% fof(23, plain,![X1]:![X2]:![X3]:![X4]:((~(in(ordered_pair(X1,X2),cartesian_product2(singleton(X3),X4)))|(X1=X3&in(X2,X4)))&((~(X1=X3)|~(in(X2,X4)))|in(ordered_pair(X1,X2),cartesian_product2(singleton(X3),X4)))),inference(fof_nnf,[status(thm)],[2])).
% fof(24, plain,![X5]:![X6]:![X7]:![X8]:((~(in(ordered_pair(X5,X6),cartesian_product2(singleton(X7),X8)))|(X5=X7&in(X6,X8)))&((~(X5=X7)|~(in(X6,X8)))|in(ordered_pair(X5,X6),cartesian_product2(singleton(X7),X8)))),inference(variable_rename,[status(thm)],[23])).
% fof(25, plain,![X5]:![X6]:![X7]:![X8]:(((X5=X7|~(in(ordered_pair(X5,X6),cartesian_product2(singleton(X7),X8))))&(in(X6,X8)|~(in(ordered_pair(X5,X6),cartesian_product2(singleton(X7),X8)))))&((~(X5=X7)|~(in(X6,X8)))|in(ordered_pair(X5,X6),cartesian_product2(singleton(X7),X8)))),inference(distribute,[status(thm)],[24])).
% cnf(26,plain,(in(ordered_pair(X1,X2),cartesian_product2(singleton(X3),X4))|~in(X2,X4)|X1!=X3),inference(split_conjunct,[status(thm)],[25])).
% fof(29, plain,![X1]:![X2]:![X3]:![X4]:((~(in(ordered_pair(X1,X2),cartesian_product2(X3,singleton(X4))))|(in(X1,X3)&X2=X4))&((~(in(X1,X3))|~(X2=X4))|in(ordered_pair(X1,X2),cartesian_product2(X3,singleton(X4))))),inference(fof_nnf,[status(thm)],[3])).
% fof(30, plain,![X5]:![X6]:![X7]:![X8]:((~(in(ordered_pair(X5,X6),cartesian_product2(X7,singleton(X8))))|(in(X5,X7)&X6=X8))&((~(in(X5,X7))|~(X6=X8))|in(ordered_pair(X5,X6),cartesian_product2(X7,singleton(X8))))),inference(variable_rename,[status(thm)],[29])).
% fof(31, plain,![X5]:![X6]:![X7]:![X8]:(((in(X5,X7)|~(in(ordered_pair(X5,X6),cartesian_product2(X7,singleton(X8)))))&(X6=X8|~(in(ordered_pair(X5,X6),cartesian_product2(X7,singleton(X8))))))&((~(in(X5,X7))|~(X6=X8))|in(ordered_pair(X5,X6),cartesian_product2(X7,singleton(X8))))),inference(distribute,[status(thm)],[30])).
% cnf(32,plain,(in(ordered_pair(X1,X2),cartesian_product2(X3,singleton(X4)))|X2!=X4|~in(X1,X3)),inference(split_conjunct,[status(thm)],[31])).
% fof(45, plain,![X3]:![X4]:ordered_pair(X3,X4)=unordered_pair(unordered_pair(X3,X4),singleton(X3)),inference(variable_rename,[status(thm)],[8])).
% cnf(46,plain,(ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1))),inference(split_conjunct,[status(thm)],[45])).
% fof(51, negated_conjecture,?[X1]:?[X2]:(~(X1=empty_set)&(cartesian_product2(singleton(X2),X1)=empty_set|cartesian_product2(X1,singleton(X2))=empty_set)),inference(fof_nnf,[status(thm)],[12])).
% fof(52, negated_conjecture,?[X3]:?[X4]:(~(X3=empty_set)&(cartesian_product2(singleton(X4),X3)=empty_set|cartesian_product2(X3,singleton(X4))=empty_set)),inference(variable_rename,[status(thm)],[51])).
% fof(53, negated_conjecture,(~(esk4_0=empty_set)&(cartesian_product2(singleton(esk5_0),esk4_0)=empty_set|cartesian_product2(esk4_0,singleton(esk5_0))=empty_set)),inference(skolemize,[status(esa)],[52])).
% cnf(54,negated_conjecture,(cartesian_product2(esk4_0,singleton(esk5_0))=empty_set|cartesian_product2(singleton(esk5_0),esk4_0)=empty_set),inference(split_conjunct,[status(thm)],[53])).
% cnf(55,negated_conjecture,(esk4_0!=empty_set),inference(split_conjunct,[status(thm)],[53])).
% cnf(60,plain,(in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,singleton(X4)))|X2!=X4|~in(X1,X3)),inference(rw,[status(thm)],[32,46,theory(equality)]),['unfolding']).
% cnf(61,plain,(in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(singleton(X3),X4))|X1!=X3|~in(X2,X4)),inference(rw,[status(thm)],[26,46,theory(equality)]),['unfolding']).
% cnf(63,plain,(in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,singleton(X2)))|~in(X1,X3)),inference(er,[status(thm)],[60,theory(equality)])).
% cnf(64,plain,(in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(singleton(X1),X3))|~in(X2,X3)),inference(er,[status(thm)],[61,theory(equality)])).
% cnf(89,plain,(empty_set!=cartesian_product2(X1,singleton(X2))|~in(X3,X1)),inference(spm,[status(thm)],[22,63,theory(equality)])).
% cnf(98,plain,(empty_set!=cartesian_product2(singleton(X1),X2)|~in(X3,X2)),inference(spm,[status(thm)],[22,64,theory(equality)])).
% cnf(112,negated_conjecture,(cartesian_product2(esk4_0,singleton(esk5_0))=empty_set|~in(X1,esk4_0)),inference(spm,[status(thm)],[98,54,theory(equality)])).
% cnf(113,negated_conjecture,(~in(X1,esk4_0)),inference(csr,[status(thm)],[112,89])).
% cnf(114,negated_conjecture,(empty_set=esk4_0),inference(spm,[status(thm)],[113,21,theory(equality)])).
% cnf(115,negated_conjecture,($false),inference(sr,[status(thm)],[114,55,theory(equality)])).
% cnf(116,negated_conjecture,($false),115,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 40
% # ...of these trivial : 0
% # ...subsumed : 1
% # ...remaining for further processing: 39
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 51
% # ...of the previous two non-trivial : 47
% # Contextual simplify-reflections : 1
% # Paramodulations : 49
% # Factorizations : 0
% # Equation resolutions : 2
% # Current number of processed clauses: 21
% # Positive orientable unit clauses: 2
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 5
% # Non-unit-clauses : 13
% # Current number of unprocessed clauses: 39
% # ...number of literals in the above : 75
% # Clause-clause subsumption calls (NU) : 39
% # Rec. Clause-clause subsumption calls : 39
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 25 leaves, 2.00+/-1.470 terms/leaf
% # Paramod-from index: 7 leaves, 1.14+/-0.350 terms/leaf
% # Paramod-into index: 23 leaves, 1.91+/-1.248 terms/leaf
% # -------------------------------------------------
% # User time : 0.013 s
% # System time : 0.004 s
% # Total time : 0.017 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.50 WC
% FINAL PrfWatch: 0.10 CPU 0.50 WC
% SZS output end Solution for /tmp/SystemOnTPTP7162/SET977+1.tptp
%
%------------------------------------------------------------------------------