%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU267+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art06.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 02:43:17 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/SystemOnTPTP31574/SEU267+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP31574/SEU267+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31574/SEU267+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 31670
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:(?[X2]:?[X3]:X1=ordered_pair(X2,X3)=>![X2]:(X2=pair_first(X1)<=>![X3]:![X4]:(X1=ordered_pair(X3,X4)=>X2=X3))),file('/tmp/SRASS.s.p', d1_mcart_1)).
% fof(2, axiom,![X1]:(?[X2]:?[X3]:X1=ordered_pair(X2,X3)=>![X2]:(X2=pair_second(X1)<=>![X3]:![X4]:(X1=ordered_pair(X3,X4)=>X2=X4))),file('/tmp/SRASS.s.p', d2_mcart_1)).
% fof(19, conjecture,![X1]:![X2]:(pair_first(ordered_pair(X1,X2))=X1&pair_second(ordered_pair(X1,X2))=X2),file('/tmp/SRASS.s.p', t7_mcart_1)).
% fof(20, negated_conjecture,~(![X1]:![X2]:(pair_first(ordered_pair(X1,X2))=X1&pair_second(ordered_pair(X1,X2))=X2)),inference(assume_negation,[status(cth)],[19])).
% fof(24, plain,![X1]:(![X2]:![X3]:~(X1=ordered_pair(X2,X3))|![X2]:((~(X2=pair_first(X1))|![X3]:![X4]:(~(X1=ordered_pair(X3,X4))|X2=X3))&(?[X3]:?[X4]:(X1=ordered_pair(X3,X4)&~(X2=X3))|X2=pair_first(X1)))),inference(fof_nnf,[status(thm)],[1])).
% fof(25, plain,![X5]:(![X6]:![X7]:~(X5=ordered_pair(X6,X7))|![X8]:((~(X8=pair_first(X5))|![X9]:![X10]:(~(X5=ordered_pair(X9,X10))|X8=X9))&(?[X11]:?[X12]:(X5=ordered_pair(X11,X12)&~(X8=X11))|X8=pair_first(X5)))),inference(variable_rename,[status(thm)],[24])).
% fof(26, plain,![X5]:(![X6]:![X7]:~(X5=ordered_pair(X6,X7))|![X8]:((~(X8=pair_first(X5))|![X9]:![X10]:(~(X5=ordered_pair(X9,X10))|X8=X9))&((X5=ordered_pair(esk1_2(X5,X8),esk2_2(X5,X8))&~(X8=esk1_2(X5,X8)))|X8=pair_first(X5)))),inference(skolemize,[status(esa)],[25])).
% fof(27, plain,![X5]:![X6]:![X7]:![X8]:![X9]:![X10]:((((~(X5=ordered_pair(X9,X10))|X8=X9)|~(X8=pair_first(X5)))&((X5=ordered_pair(esk1_2(X5,X8),esk2_2(X5,X8))&~(X8=esk1_2(X5,X8)))|X8=pair_first(X5)))|~(X5=ordered_pair(X6,X7))),inference(shift_quantors,[status(thm)],[26])).
% fof(28, plain,![X5]:![X6]:![X7]:![X8]:![X9]:![X10]:((((~(X5=ordered_pair(X9,X10))|X8=X9)|~(X8=pair_first(X5)))|~(X5=ordered_pair(X6,X7)))&(((X5=ordered_pair(esk1_2(X5,X8),esk2_2(X5,X8))|X8=pair_first(X5))|~(X5=ordered_pair(X6,X7)))&((~(X8=esk1_2(X5,X8))|X8=pair_first(X5))|~(X5=ordered_pair(X6,X7))))),inference(distribute,[status(thm)],[27])).
% cnf(31,plain,(X4=X5|X1!=ordered_pair(X2,X3)|X4!=pair_first(X1)|X1!=ordered_pair(X5,X6)),inference(split_conjunct,[status(thm)],[28])).
% fof(32, plain,![X1]:(![X2]:![X3]:~(X1=ordered_pair(X2,X3))|![X2]:((~(X2=pair_second(X1))|![X3]:![X4]:(~(X1=ordered_pair(X3,X4))|X2=X4))&(?[X3]:?[X4]:(X1=ordered_pair(X3,X4)&~(X2=X4))|X2=pair_second(X1)))),inference(fof_nnf,[status(thm)],[2])).
% fof(33, plain,![X5]:(![X6]:![X7]:~(X5=ordered_pair(X6,X7))|![X8]:((~(X8=pair_second(X5))|![X9]:![X10]:(~(X5=ordered_pair(X9,X10))|X8=X10))&(?[X11]:?[X12]:(X5=ordered_pair(X11,X12)&~(X8=X12))|X8=pair_second(X5)))),inference(variable_rename,[status(thm)],[32])).
% fof(34, plain,![X5]:(![X6]:![X7]:~(X5=ordered_pair(X6,X7))|![X8]:((~(X8=pair_second(X5))|![X9]:![X10]:(~(X5=ordered_pair(X9,X10))|X8=X10))&((X5=ordered_pair(esk3_2(X5,X8),esk4_2(X5,X8))&~(X8=esk4_2(X5,X8)))|X8=pair_second(X5)))),inference(skolemize,[status(esa)],[33])).
% fof(35, plain,![X5]:![X6]:![X7]:![X8]:![X9]:![X10]:((((~(X5=ordered_pair(X9,X10))|X8=X10)|~(X8=pair_second(X5)))&((X5=ordered_pair(esk3_2(X5,X8),esk4_2(X5,X8))&~(X8=esk4_2(X5,X8)))|X8=pair_second(X5)))|~(X5=ordered_pair(X6,X7))),inference(shift_quantors,[status(thm)],[34])).
% fof(36, plain,![X5]:![X6]:![X7]:![X8]:![X9]:![X10]:((((~(X5=ordered_pair(X9,X10))|X8=X10)|~(X8=pair_second(X5)))|~(X5=ordered_pair(X6,X7)))&(((X5=ordered_pair(esk3_2(X5,X8),esk4_2(X5,X8))|X8=pair_second(X5))|~(X5=ordered_pair(X6,X7)))&((~(X8=esk4_2(X5,X8))|X8=pair_second(X5))|~(X5=ordered_pair(X6,X7))))),inference(distribute,[status(thm)],[35])).
% cnf(39,plain,(X4=X5|X1!=ordered_pair(X2,X3)|X4!=pair_second(X1)|X1!=ordered_pair(X6,X5)),inference(split_conjunct,[status(thm)],[36])).
% fof(75, negated_conjecture,?[X1]:?[X2]:(~(pair_first(ordered_pair(X1,X2))=X1)|~(pair_second(ordered_pair(X1,X2))=X2)),inference(fof_nnf,[status(thm)],[20])).
% fof(76, negated_conjecture,?[X3]:?[X4]:(~(pair_first(ordered_pair(X3,X4))=X3)|~(pair_second(ordered_pair(X3,X4))=X4)),inference(variable_rename,[status(thm)],[75])).
% fof(77, negated_conjecture,(~(pair_first(ordered_pair(esk8_0,esk9_0))=esk8_0)|~(pair_second(ordered_pair(esk8_0,esk9_0))=esk9_0)),inference(skolemize,[status(esa)],[76])).
% cnf(78,negated_conjecture,(pair_second(ordered_pair(esk8_0,esk9_0))!=esk9_0|pair_first(ordered_pair(esk8_0,esk9_0))!=esk8_0),inference(split_conjunct,[status(thm)],[77])).
% cnf(84,plain,(X1=X2|ordered_pair(X3,X4)!=ordered_pair(X2,X5)|pair_first(ordered_pair(X2,X5))!=X1),inference(er,[status(thm)],[31,theory(equality)])).
% cnf(85,plain,(X1=X2|ordered_pair(X3,X4)!=ordered_pair(X5,X2)|pair_second(ordered_pair(X5,X2))!=X1),inference(er,[status(thm)],[39,theory(equality)])).
% cnf(93,plain,(pair_first(ordered_pair(X1,X2))=X1|ordered_pair(X3,X4)!=ordered_pair(X1,X2)),inference(er,[status(thm)],[84,theory(equality)])).
% cnf(94,plain,(pair_first(ordered_pair(X1,X2))=X1),inference(er,[status(thm)],[93,theory(equality)])).
% cnf(95,plain,(pair_second(ordered_pair(X1,X2))=X2|ordered_pair(X3,X4)!=ordered_pair(X1,X2)),inference(er,[status(thm)],[85,theory(equality)])).
% cnf(99,negated_conjecture,($false|pair_second(ordered_pair(esk8_0,esk9_0))!=esk9_0),inference(rw,[status(thm)],[78,94,theory(equality)])).
% cnf(100,negated_conjecture,(pair_second(ordered_pair(esk8_0,esk9_0))!=esk9_0),inference(cn,[status(thm)],[99,theory(equality)])).
% cnf(101,plain,(pair_second(ordered_pair(X1,X2))=X2),inference(er,[status(thm)],[95,theory(equality)])).
% cnf(105,negated_conjecture,($false),inference(rw,[status(thm)],[100,101,theory(equality)])).
% cnf(106,negated_conjecture,($false),inference(cn,[status(thm)],[105,theory(equality)])).
% cnf(107,negated_conjecture,($false),106,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 50
% # ...of these trivial : 0
% # ...subsumed : 1
% # ...remaining for further processing: 49
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 9
% # Generated clauses : 17
% # ...of the previous two non-trivial : 18
% # Contextual simplify-reflections : 0
% # Paramodulations : 7
% # Factorizations : 0
% # Equation resolutions : 10
% # Current number of processed clauses: 22
% # Positive orientable unit clauses: 5
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 15
% # Current number of unprocessed clauses: 3
% # ...number of literals in the above : 6
% # Clause-clause subsumption calls (NU) : 8
% # Rec. Clause-clause subsumption calls : 8
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 7
% # Indexed BW rewrite successes : 7
% # Backwards rewriting index: 26 leaves, 1.35+/-0.998 terms/leaf
% # Paramod-from index: 7 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 17 leaves, 1.29+/-0.956 terms/leaf
% # -------------------------------------------------
% # User time : 0.012 s
% # System time : 0.003 s
% # Total time : 0.015 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/SystemOnTPTP31574/SEU267+1.tptp
%
%------------------------------------------------------------------------------