%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SEU157+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 : art04.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:45 EST 2010

% Result   : Theorem 79.97s
% Output   : Solution 80.61s
% 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/SystemOnTPTP19999/SEU157+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% not found
% Adding ~C to TBU       ... ~l55_zfmisc_1:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... antisymmetry_r2_hidden:
%  CSA axiom antisymmetry_r2_hidden found
% Looking for CSA axiom ... d2_zfmisc_1: CSA axiom d2_zfmisc_1 found
% Looking for CSA axiom ... t33_zfmisc_1:
%  CSA axiom t33_zfmisc_1 found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT   ... 
% no
% Looking for TBU UNS   ... 
% yes - theorem proved
% ---- Selection completed
% Selected axioms are   ... :t33_zfmisc_1:d2_zfmisc_1:antisymmetry_r2_hidden (3)
% Unselected axioms are ... :t2_tarski:d3_tarski:fc1_zfmisc_1:rc1_xboole_0:rc2_xboole_0:reflexivity_r1_tarski:symmetry_r1_xboole_0:t1_xboole_1:t7_boole:t3_xboole_0:commutativity_k2_tarski:commutativity_k2_xboole_0:commutativity_k3_xboole_0:idempotence_k2_xboole_0:idempotence_k3_xboole_0:l25_zfmisc_1:l28_zfmisc_1:t10_zfmisc_1:t4_xboole_0:t8_boole:l2_zfmisc_1:d1_tarski:d1_xboole_0:d2_xboole_0:d4_xboole_0:d5_tarski:l50_zfmisc_1:d10_xboole_0:d2_tarski:d3_xboole_0:d4_tarski:t63_xboole_1:fc1_xboole_0:fc2_xboole_0:fc3_xboole_0:antisymmetry_r2_xboole_0:d1_zfmisc_1:irreflexivity_r2_xboole_0:l23_zfmisc_1:l3_zfmisc_1:t2_xboole_1:t12_xboole_1:t17_xboole_1:t19_xboole_1:t26_xboole_1:t28_xboole_1:t33_xboole_1:t36_xboole_1:t3_xboole_1:t6_zfmisc_1:t7_xboole_1:t8_xboole_1:t60_xboole_1:l1_zfmisc_1:t1_boole:t2_boole:t39_xboole_1:t3_boole:t40_xboole_1:t48_xboole_1:t4_boole:t69_enumset1:t6_boole:t83_xboole_1:t8_zfmisc_1:t9_zfmisc_1:l32_xboole_1:t37_xboole_1:d7_xboole_0:d8_xboole_0:l4_zfmisc_1:t45_xboole_1:t1_zfmisc_1:dt_k1_tarski:dt_k1_xboole_0:dt_k1_zfmisc_1:dt_k2_tarski:dt_k2_xboole_0:dt_k2_zfmisc_1:dt_k3_tarski:dt_k3_xboole_0:dt_k4_tarski:dt_k4_xboole_0 (83)
% SZS status THM for /tmp/SystemOnTPTP19999/SEU157+2.tptp
% Looking for THM       ... 
% found
% SZS output start Solution for /tmp/SystemOnTPTP19999/SEU157+2.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=600 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p 
% TreeLimitedRun: CPU time limit is 600s
% TreeLimitedRun: WC  time limit is 1200s
% TreeLimitedRun: PID is 21001
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time     : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:![X4]:(ordered_pair(X1,X2)=ordered_pair(X3,X4)=>(X1=X3&X2=X4)),file('/tmp/SRASS.s.p', t33_zfmisc_1)).
% fof(2, axiom,![X1]:![X2]:![X3]:(X3=cartesian_product2(X1,X2)<=>![X4]:(in(X4,X3)<=>?[X5]:?[X6]:((in(X5,X1)&in(X6,X2))&X4=ordered_pair(X5,X6)))),file('/tmp/SRASS.s.p', d2_zfmisc_1)).
% fof(4, conjecture,![X1]:![X2]:![X3]:![X4]:(in(ordered_pair(X1,X2),cartesian_product2(X3,X4))<=>(in(X1,X3)&in(X2,X4))),file('/tmp/SRASS.s.p', l55_zfmisc_1)).
% fof(5, negated_conjecture,~(![X1]:![X2]:![X3]:![X4]:(in(ordered_pair(X1,X2),cartesian_product2(X3,X4))<=>(in(X1,X3)&in(X2,X4)))),inference(assume_negation,[status(cth)],[4])).
% fof(7, plain,![X1]:![X2]:![X3]:![X4]:(~(ordered_pair(X1,X2)=ordered_pair(X3,X4))|(X1=X3&X2=X4)),inference(fof_nnf,[status(thm)],[1])).
% fof(8, plain,![X5]:![X6]:![X7]:![X8]:(~(ordered_pair(X5,X6)=ordered_pair(X7,X8))|(X5=X7&X6=X8)),inference(variable_rename,[status(thm)],[7])).
% fof(9, plain,![X5]:![X6]:![X7]:![X8]:((X5=X7|~(ordered_pair(X5,X6)=ordered_pair(X7,X8)))&(X6=X8|~(ordered_pair(X5,X6)=ordered_pair(X7,X8)))),inference(distribute,[status(thm)],[8])).
% cnf(10,plain,(X2=X4|ordered_pair(X1,X2)!=ordered_pair(X3,X4)),inference(split_conjunct,[status(thm)],[9])).
% cnf(11,plain,(X1=X3|ordered_pair(X1,X2)!=ordered_pair(X3,X4)),inference(split_conjunct,[status(thm)],[9])).
% fof(12, plain,![X1]:![X2]:![X3]:((~(X3=cartesian_product2(X1,X2))|![X4]:((~(in(X4,X3))|?[X5]:?[X6]:((in(X5,X1)&in(X6,X2))&X4=ordered_pair(X5,X6)))&(![X5]:![X6]:((~(in(X5,X1))|~(in(X6,X2)))|~(X4=ordered_pair(X5,X6)))|in(X4,X3))))&(?[X4]:((~(in(X4,X3))|![X5]:![X6]:((~(in(X5,X1))|~(in(X6,X2)))|~(X4=ordered_pair(X5,X6))))&(in(X4,X3)|?[X5]:?[X6]:((in(X5,X1)&in(X6,X2))&X4=ordered_pair(X5,X6))))|X3=cartesian_product2(X1,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(13, plain,![X7]:![X8]:![X9]:((~(X9=cartesian_product2(X7,X8))|![X10]:((~(in(X10,X9))|?[X11]:?[X12]:((in(X11,X7)&in(X12,X8))&X10=ordered_pair(X11,X12)))&(![X13]:![X14]:((~(in(X13,X7))|~(in(X14,X8)))|~(X10=ordered_pair(X13,X14)))|in(X10,X9))))&(?[X15]:((~(in(X15,X9))|![X16]:![X17]:((~(in(X16,X7))|~(in(X17,X8)))|~(X15=ordered_pair(X16,X17))))&(in(X15,X9)|?[X18]:?[X19]:((in(X18,X7)&in(X19,X8))&X15=ordered_pair(X18,X19))))|X9=cartesian_product2(X7,X8))),inference(variable_rename,[status(thm)],[12])).
% fof(14, plain,![X7]:![X8]:![X9]:((~(X9=cartesian_product2(X7,X8))|![X10]:((~(in(X10,X9))|((in(esk1_4(X7,X8,X9,X10),X7)&in(esk2_4(X7,X8,X9,X10),X8))&X10=ordered_pair(esk1_4(X7,X8,X9,X10),esk2_4(X7,X8,X9,X10))))&(![X13]:![X14]:((~(in(X13,X7))|~(in(X14,X8)))|~(X10=ordered_pair(X13,X14)))|in(X10,X9))))&(((~(in(esk3_3(X7,X8,X9),X9))|![X16]:![X17]:((~(in(X16,X7))|~(in(X17,X8)))|~(esk3_3(X7,X8,X9)=ordered_pair(X16,X17))))&(in(esk3_3(X7,X8,X9),X9)|((in(esk4_3(X7,X8,X9),X7)&in(esk5_3(X7,X8,X9),X8))&esk3_3(X7,X8,X9)=ordered_pair(esk4_3(X7,X8,X9),esk5_3(X7,X8,X9)))))|X9=cartesian_product2(X7,X8))),inference(skolemize,[status(esa)],[13])).
% fof(15, plain,![X7]:![X8]:![X9]:![X10]:![X13]:![X14]:![X16]:![X17]:((((((~(in(X16,X7))|~(in(X17,X8)))|~(esk3_3(X7,X8,X9)=ordered_pair(X16,X17)))|~(in(esk3_3(X7,X8,X9),X9)))&(in(esk3_3(X7,X8,X9),X9)|((in(esk4_3(X7,X8,X9),X7)&in(esk5_3(X7,X8,X9),X8))&esk3_3(X7,X8,X9)=ordered_pair(esk4_3(X7,X8,X9),esk5_3(X7,X8,X9)))))|X9=cartesian_product2(X7,X8))&(((((~(in(X13,X7))|~(in(X14,X8)))|~(X10=ordered_pair(X13,X14)))|in(X10,X9))&(~(in(X10,X9))|((in(esk1_4(X7,X8,X9,X10),X7)&in(esk2_4(X7,X8,X9,X10),X8))&X10=ordered_pair(esk1_4(X7,X8,X9,X10),esk2_4(X7,X8,X9,X10)))))|~(X9=cartesian_product2(X7,X8)))),inference(shift_quantors,[status(thm)],[14])).
% fof(16, plain,![X7]:![X8]:![X9]:![X10]:![X13]:![X14]:![X16]:![X17]:((((((~(in(X16,X7))|~(in(X17,X8)))|~(esk3_3(X7,X8,X9)=ordered_pair(X16,X17)))|~(in(esk3_3(X7,X8,X9),X9)))|X9=cartesian_product2(X7,X8))&((((in(esk4_3(X7,X8,X9),X7)|in(esk3_3(X7,X8,X9),X9))|X9=cartesian_product2(X7,X8))&((in(esk5_3(X7,X8,X9),X8)|in(esk3_3(X7,X8,X9),X9))|X9=cartesian_product2(X7,X8)))&((esk3_3(X7,X8,X9)=ordered_pair(esk4_3(X7,X8,X9),esk5_3(X7,X8,X9))|in(esk3_3(X7,X8,X9),X9))|X9=cartesian_product2(X7,X8))))&(((((~(in(X13,X7))|~(in(X14,X8)))|~(X10=ordered_pair(X13,X14)))|in(X10,X9))|~(X9=cartesian_product2(X7,X8)))&((((in(esk1_4(X7,X8,X9,X10),X7)|~(in(X10,X9)))|~(X9=cartesian_product2(X7,X8)))&((in(esk2_4(X7,X8,X9,X10),X8)|~(in(X10,X9)))|~(X9=cartesian_product2(X7,X8))))&((X10=ordered_pair(esk1_4(X7,X8,X9,X10),esk2_4(X7,X8,X9,X10))|~(in(X10,X9)))|~(X9=cartesian_product2(X7,X8)))))),inference(distribute,[status(thm)],[15])).
% cnf(17,plain,(X4=ordered_pair(esk1_4(X2,X3,X1,X4),esk2_4(X2,X3,X1,X4))|X1!=cartesian_product2(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[16])).
% cnf(18,plain,(in(esk2_4(X2,X3,X1,X4),X3)|X1!=cartesian_product2(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[16])).
% cnf(19,plain,(in(esk1_4(X2,X3,X1,X4),X2)|X1!=cartesian_product2(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[16])).
% cnf(20,plain,(in(X4,X1)|X1!=cartesian_product2(X2,X3)|X4!=ordered_pair(X5,X6)|~in(X6,X3)|~in(X5,X2)),inference(split_conjunct,[status(thm)],[16])).
% fof(28, negated_conjecture,?[X1]:?[X2]:?[X3]:?[X4]:((~(in(ordered_pair(X1,X2),cartesian_product2(X3,X4)))|(~(in(X1,X3))|~(in(X2,X4))))&(in(ordered_pair(X1,X2),cartesian_product2(X3,X4))|(in(X1,X3)&in(X2,X4)))),inference(fof_nnf,[status(thm)],[5])).
% fof(29, negated_conjecture,?[X5]:?[X6]:?[X7]:?[X8]:((~(in(ordered_pair(X5,X6),cartesian_product2(X7,X8)))|(~(in(X5,X7))|~(in(X6,X8))))&(in(ordered_pair(X5,X6),cartesian_product2(X7,X8))|(in(X5,X7)&in(X6,X8)))),inference(variable_rename,[status(thm)],[28])).
% fof(30, negated_conjecture,((~(in(ordered_pair(esk6_0,esk7_0),cartesian_product2(esk8_0,esk9_0)))|(~(in(esk6_0,esk8_0))|~(in(esk7_0,esk9_0))))&(in(ordered_pair(esk6_0,esk7_0),cartesian_product2(esk8_0,esk9_0))|(in(esk6_0,esk8_0)&in(esk7_0,esk9_0)))),inference(skolemize,[status(esa)],[29])).
% fof(31, negated_conjecture,((~(in(ordered_pair(esk6_0,esk7_0),cartesian_product2(esk8_0,esk9_0)))|(~(in(esk6_0,esk8_0))|~(in(esk7_0,esk9_0))))&((in(esk6_0,esk8_0)|in(ordered_pair(esk6_0,esk7_0),cartesian_product2(esk8_0,esk9_0)))&(in(esk7_0,esk9_0)|in(ordered_pair(esk6_0,esk7_0),cartesian_product2(esk8_0,esk9_0))))),inference(distribute,[status(thm)],[30])).
% cnf(32,negated_conjecture,(in(ordered_pair(esk6_0,esk7_0),cartesian_product2(esk8_0,esk9_0))|in(esk7_0,esk9_0)),inference(split_conjunct,[status(thm)],[31])).
% cnf(33,negated_conjecture,(in(ordered_pair(esk6_0,esk7_0),cartesian_product2(esk8_0,esk9_0))|in(esk6_0,esk8_0)),inference(split_conjunct,[status(thm)],[31])).
% cnf(34,negated_conjecture,(~in(esk7_0,esk9_0)|~in(esk6_0,esk8_0)|~in(ordered_pair(esk6_0,esk7_0),cartesian_product2(esk8_0,esk9_0))),inference(split_conjunct,[status(thm)],[31])).
% cnf(43,plain,(in(ordered_pair(X1,X2),X3)|cartesian_product2(X4,X5)!=X3|~in(X2,X5)|~in(X1,X4)),inference(er,[status(thm)],[20,theory(equality)])).
% cnf(49,plain,(esk2_4(X1,X2,X3,X4)=X5|X4!=ordered_pair(X6,X5)|cartesian_product2(X1,X2)!=X3|~in(X4,X3)),inference(spm,[status(thm)],[10,17,theory(equality)])).
% cnf(51,plain,(esk1_4(X1,X2,X3,X4)=X5|X4!=ordered_pair(X5,X6)|cartesian_product2(X1,X2)!=X3|~in(X4,X3)),inference(spm,[status(thm)],[11,17,theory(equality)])).
% cnf(61,plain,(in(ordered_pair(X1,X2),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3)),inference(er,[status(thm)],[43,theory(equality)])).
% cnf(63,negated_conjecture,(~in(esk6_0,esk8_0)|~in(esk7_0,esk9_0)),inference(spm,[status(thm)],[34,61,theory(equality)])).
% cnf(66,plain,(esk2_4(X1,X2,X3,ordered_pair(X4,X5))=X5|cartesian_product2(X1,X2)!=X3|~in(ordered_pair(X4,X5),X3)),inference(er,[status(thm)],[49,theory(equality)])).
% cnf(73,plain,(in(X5,X2)|cartesian_product2(X1,X2)!=X3|~in(ordered_pair(X4,X5),X3)),inference(spm,[status(thm)],[18,66,theory(equality)])).
% cnf(80,negated_conjecture,(in(esk7_0,X1)|in(esk7_0,esk9_0)|cartesian_product2(X2,X1)!=cartesian_product2(esk8_0,esk9_0)),inference(spm,[status(thm)],[73,32,theory(equality)])).
% cnf(91,negated_conjecture,(in(esk7_0,esk9_0)),inference(er,[status(thm)],[80,theory(equality)])).
% cnf(94,negated_conjecture,(~in(esk6_0,esk8_0)|$false),inference(rw,[status(thm)],[63,91,theory(equality)])).
% cnf(95,negated_conjecture,(~in(esk6_0,esk8_0)),inference(cn,[status(thm)],[94,theory(equality)])).
% cnf(107,negated_conjecture,(in(ordered_pair(esk6_0,esk7_0),cartesian_product2(esk8_0,esk9_0))),inference(sr,[status(thm)],[33,95,theory(equality)])).
% cnf(158,plain,(esk1_4(X1,X2,X3,ordered_pair(X4,X5))=X4|cartesian_product2(X1,X2)!=X3|~in(ordered_pair(X4,X5),X3)),inference(er,[status(thm)],[51,theory(equality)])).
% cnf(292,plain,(in(X4,X1)|cartesian_product2(X1,X2)!=X3|~in(ordered_pair(X4,X5),X3)),inference(spm,[status(thm)],[19,158,theory(equality)])).
% cnf(299,negated_conjecture,(in(esk6_0,X1)|cartesian_product2(X1,X2)!=cartesian_product2(esk8_0,esk9_0)),inference(spm,[status(thm)],[292,107,theory(equality)])).
% cnf(303,negated_conjecture,(in(esk6_0,esk8_0)),inference(er,[status(thm)],[299,theory(equality)])).
% cnf(304,negated_conjecture,($false),inference(sr,[status(thm)],[303,95,theory(equality)])).
% cnf(305,negated_conjecture,($false),304,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 127
% # ...of these trivial                : 0
% # ...subsumed                        : 24
% # ...remaining for further processing: 103
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 4
% # Backward-rewritten                 : 4
% # Generated clauses                  : 247
% # ...of the previous two non-trivial : 234
% # Contextual simplify-reflections    : 12
% # Paramodulations                    : 210
% # Factorizations                     : 0
% # Equation resolutions               : 36
% # Current number of processed clauses: 80
% #    Positive orientable unit clauses: 2
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 3
% #    Non-unit-clauses                : 75
% # Current number of unprocessed clauses: 133
% # ...number of literals in the above : 600
% # Clause-clause subsumption calls (NU) : 643
% # Rec. Clause-clause subsumption calls : 418
% # Unit Clause-clause subsumption calls : 7
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 1
% # Indexed BW rewrite successes       : 1
% # Backwards rewriting index:    56 leaves,   2.61+/-4.130 terms/leaf
% # Paramod-from index:           12 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-into index:           48 leaves,   2.31+/-3.029 terms/leaf
% # -------------------------------------------------
% # User time              : 0.022 s
% # System time            : 0.005 s
% # Total time             : 0.027 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.23 WC
% FINAL PrfWatch: 0.12 CPU 0.23 WC
% SZS output end Solution for /tmp/SystemOnTPTP19999/SEU157+2.tptp
% 
%------------------------------------------------------------------------------