%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU157+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Thu Dec 30 01:25:24 EST 2010
% Result : Theorem 1.61s
% Output : Solution 1.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/SystemOnTPTP24298/SEU157+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP24298/SEU157+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP24298/SEU157+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 24430
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% 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(5, 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(7, 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(13, 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(14, 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)],[13])).
% fof(21, 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(22, 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)],[21])).
% fof(23, 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)],[22])).
% fof(24, 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)],[23])).
% fof(25, 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)],[24])).
% cnf(26,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)],[25])).
% cnf(27,plain,(in(esk2_4(X2,X3,X1,X4),X3)|X1!=cartesian_product2(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[25])).
% cnf(28,plain,(in(esk1_4(X2,X3,X1,X4),X2)|X1!=cartesian_product2(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[25])).
% cnf(29,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)],[25])).
% fof(40, plain,![X1]:![X2]:![X3]:![X4]:(~(ordered_pair(X1,X2)=ordered_pair(X3,X4))|(X1=X3&X2=X4)),inference(fof_nnf,[status(thm)],[5])).
% fof(41, plain,![X5]:![X6]:![X7]:![X8]:(~(ordered_pair(X5,X6)=ordered_pair(X7,X8))|(X5=X7&X6=X8)),inference(variable_rename,[status(thm)],[40])).
% fof(42, 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)],[41])).
% cnf(43,plain,(X2=X4|ordered_pair(X1,X2)!=ordered_pair(X3,X4)),inference(split_conjunct,[status(thm)],[42])).
% cnf(44,plain,(X1=X3|ordered_pair(X1,X2)!=ordered_pair(X3,X4)),inference(split_conjunct,[status(thm)],[42])).
% fof(47, plain,![X3]:![X4]:unordered_pair(X3,X4)=unordered_pair(X4,X3),inference(variable_rename,[status(thm)],[7])).
% cnf(48,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X1)),inference(split_conjunct,[status(thm)],[47])).
% fof(49, plain,![X3]:![X4]:ordered_pair(X3,X4)=unordered_pair(unordered_pair(X3,X4),singleton(X3)),inference(variable_rename,[status(thm)],[8])).
% cnf(50,plain,(ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1))),inference(split_conjunct,[status(thm)],[49])).
% fof(55, 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)],[14])).
% fof(56, 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)],[55])).
% fof(57, negated_conjecture,((~(in(ordered_pair(esk8_0,esk9_0),cartesian_product2(esk10_0,esk11_0)))|(~(in(esk8_0,esk10_0))|~(in(esk9_0,esk11_0))))&(in(ordered_pair(esk8_0,esk9_0),cartesian_product2(esk10_0,esk11_0))|(in(esk8_0,esk10_0)&in(esk9_0,esk11_0)))),inference(skolemize,[status(esa)],[56])).
% fof(58, negated_conjecture,((~(in(ordered_pair(esk8_0,esk9_0),cartesian_product2(esk10_0,esk11_0)))|(~(in(esk8_0,esk10_0))|~(in(esk9_0,esk11_0))))&((in(esk8_0,esk10_0)|in(ordered_pair(esk8_0,esk9_0),cartesian_product2(esk10_0,esk11_0)))&(in(esk9_0,esk11_0)|in(ordered_pair(esk8_0,esk9_0),cartesian_product2(esk10_0,esk11_0))))),inference(distribute,[status(thm)],[57])).
% cnf(59,negated_conjecture,(in(ordered_pair(esk8_0,esk9_0),cartesian_product2(esk10_0,esk11_0))|in(esk9_0,esk11_0)),inference(split_conjunct,[status(thm)],[58])).
% cnf(60,negated_conjecture,(in(ordered_pair(esk8_0,esk9_0),cartesian_product2(esk10_0,esk11_0))|in(esk8_0,esk10_0)),inference(split_conjunct,[status(thm)],[58])).
% cnf(61,negated_conjecture,(~in(esk9_0,esk11_0)|~in(esk8_0,esk10_0)|~in(ordered_pair(esk8_0,esk9_0),cartesian_product2(esk10_0,esk11_0))),inference(split_conjunct,[status(thm)],[58])).
% cnf(62,negated_conjecture,(in(esk8_0,esk10_0)|in(unordered_pair(unordered_pair(esk8_0,esk9_0),singleton(esk8_0)),cartesian_product2(esk10_0,esk11_0))),inference(rw,[status(thm)],[60,50,theory(equality)]),['unfolding']).
% cnf(63,negated_conjecture,(in(esk9_0,esk11_0)|in(unordered_pair(unordered_pair(esk8_0,esk9_0),singleton(esk8_0)),cartesian_product2(esk10_0,esk11_0))),inference(rw,[status(thm)],[59,50,theory(equality)]),['unfolding']).
% cnf(65,plain,(X2=X4|unordered_pair(unordered_pair(X1,X2),singleton(X1))!=unordered_pair(unordered_pair(X3,X4),singleton(X3))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[43,50,theory(equality)]),50,theory(equality)]),['unfolding']).
% cnf(66,plain,(X1=X3|unordered_pair(unordered_pair(X1,X2),singleton(X1))!=unordered_pair(unordered_pair(X3,X4),singleton(X3))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[44,50,theory(equality)]),50,theory(equality)]),['unfolding']).
% cnf(67,plain,(unordered_pair(unordered_pair(esk1_4(X2,X3,X1,X4),esk2_4(X2,X3,X1,X4)),singleton(esk1_4(X2,X3,X1,X4)))=X4|cartesian_product2(X2,X3)!=X1|~in(X4,X1)),inference(rw,[status(thm)],[26,50,theory(equality)]),['unfolding']).
% cnf(68,plain,(in(X4,X1)|cartesian_product2(X2,X3)!=X1|unordered_pair(unordered_pair(X5,X6),singleton(X5))!=X4|~in(X6,X3)|~in(X5,X2)),inference(rw,[status(thm)],[29,50,theory(equality)]),['unfolding']).
% cnf(71,negated_conjecture,(~in(esk8_0,esk10_0)|~in(esk9_0,esk11_0)|~in(unordered_pair(unordered_pair(esk8_0,esk9_0),singleton(esk8_0)),cartesian_product2(esk10_0,esk11_0))),inference(rw,[status(thm)],[61,50,theory(equality)]),['unfolding']).
% cnf(72,plain,(unordered_pair(singleton(esk1_4(X2,X3,X1,X4)),unordered_pair(esk1_4(X2,X3,X1,X4),esk2_4(X2,X3,X1,X4)))=X4|cartesian_product2(X2,X3)!=X1|~in(X4,X1)),inference(rw,[status(thm)],[67,48,theory(equality)])).
% cnf(85,plain,(X1=X2|unordered_pair(unordered_pair(X3,X1),singleton(X3))!=unordered_pair(singleton(X4),unordered_pair(X4,X2))),inference(spm,[status(thm)],[65,48,theory(equality)])).
% cnf(94,plain,(X1=X2|unordered_pair(unordered_pair(X1,X3),singleton(X1))!=unordered_pair(singleton(X2),unordered_pair(X2,X4))),inference(spm,[status(thm)],[66,48,theory(equality)])).
% cnf(102,plain,(in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3)|cartesian_product2(X4,X5)!=X3|~in(X2,X5)|~in(X1,X4)),inference(er,[status(thm)],[68,theory(equality)])).
% cnf(174,plain,(X1=esk2_4(X2,X3,X4,X5)|unordered_pair(unordered_pair(X6,X1),singleton(X6))!=X5|cartesian_product2(X2,X3)!=X4|~in(X5,X4)),inference(spm,[status(thm)],[85,72,theory(equality)])).
% cnf(201,plain,(X1=esk1_4(X2,X3,X4,X5)|unordered_pair(unordered_pair(X1,X6),singleton(X1))!=X5|cartesian_product2(X2,X3)!=X4|~in(X5,X4)),inference(spm,[status(thm)],[94,72,theory(equality)])).
% cnf(289,plain,(in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3)),inference(er,[status(thm)],[102,theory(equality)])).
% cnf(433,negated_conjecture,(~in(esk8_0,esk10_0)|~in(esk9_0,esk11_0)),inference(spm,[status(thm)],[71,289,theory(equality)])).
% cnf(517,plain,(X1=esk2_4(X2,X3,X4,unordered_pair(unordered_pair(X5,X1),singleton(X5)))|cartesian_product2(X2,X3)!=X4|~in(unordered_pair(unordered_pair(X5,X1),singleton(X5)),X4)),inference(er,[status(thm)],[174,theory(equality)])).
% cnf(524,plain,(X1=esk1_4(X2,X3,X4,unordered_pair(unordered_pair(X1,X5),singleton(X1)))|cartesian_product2(X2,X3)!=X4|~in(unordered_pair(unordered_pair(X1,X5),singleton(X1)),X4)),inference(er,[status(thm)],[201,theory(equality)])).
% cnf(595,plain,(in(X5,X2)|cartesian_product2(X1,X2)!=X3|~in(unordered_pair(unordered_pair(X4,X5),singleton(X4)),X3)),inference(spm,[status(thm)],[27,517,theory(equality)])).
% cnf(724,negated_conjecture,(in(esk9_0,X1)|in(esk9_0,esk11_0)|cartesian_product2(X2,X1)!=cartesian_product2(esk10_0,esk11_0)),inference(spm,[status(thm)],[595,63,theory(equality)])).
% cnf(731,negated_conjecture,(in(esk9_0,esk11_0)),inference(er,[status(thm)],[724,theory(equality)])).
% cnf(738,negated_conjecture,(~in(esk8_0,esk10_0)|$false),inference(rw,[status(thm)],[433,731,theory(equality)])).
% cnf(739,negated_conjecture,(~in(esk8_0,esk10_0)),inference(cn,[status(thm)],[738,theory(equality)])).
% cnf(742,negated_conjecture,(in(unordered_pair(unordered_pair(esk8_0,esk9_0),singleton(esk8_0)),cartesian_product2(esk10_0,esk11_0))),inference(sr,[status(thm)],[62,739,theory(equality)])).
% cnf(5110,plain,(in(X4,X1)|cartesian_product2(X1,X2)!=X3|~in(unordered_pair(unordered_pair(X4,X5),singleton(X4)),X3)),inference(spm,[status(thm)],[28,524,theory(equality)])).
% cnf(5410,negated_conjecture,(in(esk8_0,X1)|cartesian_product2(X1,X2)!=cartesian_product2(esk10_0,esk11_0)),inference(spm,[status(thm)],[5110,742,theory(equality)])).
% cnf(5413,negated_conjecture,(in(esk8_0,esk10_0)),inference(er,[status(thm)],[5410,theory(equality)])).
% cnf(5414,negated_conjecture,($false),inference(sr,[status(thm)],[5413,739,theory(equality)])).
% cnf(5415,negated_conjecture,($false),5414,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 2045
% # ...of these trivial : 1
% # ...subsumed : 1343
% # ...remaining for further processing: 701
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 6
% # Backward-rewritten : 7
% # Generated clauses : 4358
% # ...of the previous two non-trivial : 4332
% # Contextual simplify-reflections : 895
% # Paramodulations : 4063
% # Factorizations : 0
% # Equation resolutions : 294
% # Current number of processed clauses: 669
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 9
% # Non-unit-clauses : 656
% # Current number of unprocessed clauses: 2322
% # ...number of literals in the above : 11100
% # Clause-clause subsumption calls (NU) : 151316
% # Rec. Clause-clause subsumption calls : 48298
% # Unit Clause-clause subsumption calls : 27
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 17
% # Indexed BW rewrite successes : 17
% # Backwards rewriting index: 120 leaves, 10.29+/-26.620 terms/leaf
% # Paramod-from index: 17 leaves, 1.29+/-0.456 terms/leaf
% # Paramod-into index: 102 leaves, 10.62+/-28.359 terms/leaf
% # -------------------------------------------------
% # User time : 0.416 s
% # System time : 0.008 s
% # Total time : 0.424 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.59 CPU 0.67 WC
% FINAL PrfWatch: 0.59 CPU 0.67 WC
% SZS output end Solution for /tmp/SystemOnTPTP24298/SEU157+1.tptp
%
%------------------------------------------------------------------------------