TSTP Solution File: SET951+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET951+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:22:43 EST 2010
% Result : Theorem 3.98s
% Output : Solution 3.98s
% 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/SystemOnTPTP9768/SET951+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP9768/SET951+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP9768/SET951+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 9864
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.91 CPU 2.01 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:set_intersection2(X1,X2)=set_intersection2(X2,X1),file('/tmp/SRASS.s.p', commutativity_k3_xboole_0)).
% fof(3, 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, axiom,![X1]:![X2]:![X3]:(X3=set_intersection2(X1,X2)<=>![X4]:(in(X4,X3)<=>(in(X4,X1)&in(X4,X2)))),file('/tmp/SRASS.s.p', d3_xboole_0)).
% fof(6, 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(10, axiom,![X1]:![X2]:ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1)),file('/tmp/SRASS.s.p', d5_tarski)).
% fof(11, axiom,![X1]:![X2]:unordered_pair(X1,X2)=unordered_pair(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_tarski)).
% fof(12, conjecture,![X1]:![X2]:![X3]:![X4]:![X5]:~((in(X1,set_intersection2(cartesian_product2(X2,X3),cartesian_product2(X4,X5)))&![X6]:![X7]:~(((X1=ordered_pair(X6,X7)&in(X6,set_intersection2(X2,X4)))&in(X7,set_intersection2(X3,X5)))))),file('/tmp/SRASS.s.p', t104_zfmisc_1)).
% fof(13, negated_conjecture,~(![X1]:![X2]:![X3]:![X4]:![X5]:~((in(X1,set_intersection2(cartesian_product2(X2,X3),cartesian_product2(X4,X5)))&![X6]:![X7]:~(((X1=ordered_pair(X6,X7)&in(X6,set_intersection2(X2,X4)))&in(X7,set_intersection2(X3,X5))))))),inference(assume_negation,[status(cth)],[12])).
% fof(20, plain,![X3]:![X4]:set_intersection2(X3,X4)=set_intersection2(X4,X3),inference(variable_rename,[status(thm)],[2])).
% cnf(21,plain,(set_intersection2(X1,X2)=set_intersection2(X2,X1)),inference(split_conjunct,[status(thm)],[20])).
% fof(22, 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)],[3])).
% fof(23, 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)],[22])).
% fof(24, 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)],[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)))&(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)],[24])).
% fof(26, 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)],[25])).
% cnf(27,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)],[26])).
% cnf(28,plain,(in(esk2_4(X2,X3,X1,X4),X3)|X1!=cartesian_product2(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[26])).
% cnf(29,plain,(in(esk1_4(X2,X3,X1,X4),X2)|X1!=cartesian_product2(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[26])).
% cnf(30,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)],[26])).
% fof(35, plain,![X1]:![X2]:![X3]:((~(X3=set_intersection2(X1,X2))|![X4]:((~(in(X4,X3))|(in(X4,X1)&in(X4,X2)))&((~(in(X4,X1))|~(in(X4,X2)))|in(X4,X3))))&(?[X4]:((~(in(X4,X3))|(~(in(X4,X1))|~(in(X4,X2))))&(in(X4,X3)|(in(X4,X1)&in(X4,X2))))|X3=set_intersection2(X1,X2))),inference(fof_nnf,[status(thm)],[4])).
% fof(36, plain,![X5]:![X6]:![X7]:((~(X7=set_intersection2(X5,X6))|![X8]:((~(in(X8,X7))|(in(X8,X5)&in(X8,X6)))&((~(in(X8,X5))|~(in(X8,X6)))|in(X8,X7))))&(?[X9]:((~(in(X9,X7))|(~(in(X9,X5))|~(in(X9,X6))))&(in(X9,X7)|(in(X9,X5)&in(X9,X6))))|X7=set_intersection2(X5,X6))),inference(variable_rename,[status(thm)],[35])).
% fof(37, plain,![X5]:![X6]:![X7]:((~(X7=set_intersection2(X5,X6))|![X8]:((~(in(X8,X7))|(in(X8,X5)&in(X8,X6)))&((~(in(X8,X5))|~(in(X8,X6)))|in(X8,X7))))&(((~(in(esk6_3(X5,X6,X7),X7))|(~(in(esk6_3(X5,X6,X7),X5))|~(in(esk6_3(X5,X6,X7),X6))))&(in(esk6_3(X5,X6,X7),X7)|(in(esk6_3(X5,X6,X7),X5)&in(esk6_3(X5,X6,X7),X6))))|X7=set_intersection2(X5,X6))),inference(skolemize,[status(esa)],[36])).
% fof(38, plain,![X5]:![X6]:![X7]:![X8]:((((~(in(X8,X7))|(in(X8,X5)&in(X8,X6)))&((~(in(X8,X5))|~(in(X8,X6)))|in(X8,X7)))|~(X7=set_intersection2(X5,X6)))&(((~(in(esk6_3(X5,X6,X7),X7))|(~(in(esk6_3(X5,X6,X7),X5))|~(in(esk6_3(X5,X6,X7),X6))))&(in(esk6_3(X5,X6,X7),X7)|(in(esk6_3(X5,X6,X7),X5)&in(esk6_3(X5,X6,X7),X6))))|X7=set_intersection2(X5,X6))),inference(shift_quantors,[status(thm)],[37])).
% fof(39, plain,![X5]:![X6]:![X7]:![X8]:(((((in(X8,X5)|~(in(X8,X7)))|~(X7=set_intersection2(X5,X6)))&((in(X8,X6)|~(in(X8,X7)))|~(X7=set_intersection2(X5,X6))))&(((~(in(X8,X5))|~(in(X8,X6)))|in(X8,X7))|~(X7=set_intersection2(X5,X6))))&(((~(in(esk6_3(X5,X6,X7),X7))|(~(in(esk6_3(X5,X6,X7),X5))|~(in(esk6_3(X5,X6,X7),X6))))|X7=set_intersection2(X5,X6))&(((in(esk6_3(X5,X6,X7),X5)|in(esk6_3(X5,X6,X7),X7))|X7=set_intersection2(X5,X6))&((in(esk6_3(X5,X6,X7),X6)|in(esk6_3(X5,X6,X7),X7))|X7=set_intersection2(X5,X6))))),inference(distribute,[status(thm)],[38])).
% cnf(43,plain,(in(X4,X1)|X1!=set_intersection2(X2,X3)|~in(X4,X3)|~in(X4,X2)),inference(split_conjunct,[status(thm)],[39])).
% cnf(44,plain,(in(X4,X3)|X1!=set_intersection2(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[39])).
% cnf(45,plain,(in(X4,X2)|X1!=set_intersection2(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[39])).
% fof(48, plain,![X1]:![X2]:![X3]:![X4]:(~(ordered_pair(X1,X2)=ordered_pair(X3,X4))|(X1=X3&X2=X4)),inference(fof_nnf,[status(thm)],[6])).
% fof(49, plain,![X5]:![X6]:![X7]:![X8]:(~(ordered_pair(X5,X6)=ordered_pair(X7,X8))|(X5=X7&X6=X8)),inference(variable_rename,[status(thm)],[48])).
% fof(50, 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)],[49])).
% cnf(51,plain,(X2=X4|ordered_pair(X1,X2)!=ordered_pair(X3,X4)),inference(split_conjunct,[status(thm)],[50])).
% cnf(52,plain,(X1=X3|ordered_pair(X1,X2)!=ordered_pair(X3,X4)),inference(split_conjunct,[status(thm)],[50])).
% fof(61, plain,![X3]:![X4]:ordered_pair(X3,X4)=unordered_pair(unordered_pair(X3,X4),singleton(X3)),inference(variable_rename,[status(thm)],[10])).
% cnf(62,plain,(ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1))),inference(split_conjunct,[status(thm)],[61])).
% fof(63, plain,![X3]:![X4]:unordered_pair(X3,X4)=unordered_pair(X4,X3),inference(variable_rename,[status(thm)],[11])).
% cnf(64,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X1)),inference(split_conjunct,[status(thm)],[63])).
% fof(65, negated_conjecture,?[X1]:?[X2]:?[X3]:?[X4]:?[X5]:(in(X1,set_intersection2(cartesian_product2(X2,X3),cartesian_product2(X4,X5)))&![X6]:![X7]:((~(X1=ordered_pair(X6,X7))|~(in(X6,set_intersection2(X2,X4))))|~(in(X7,set_intersection2(X3,X5))))),inference(fof_nnf,[status(thm)],[13])).
% fof(66, negated_conjecture,?[X8]:?[X9]:?[X10]:?[X11]:?[X12]:(in(X8,set_intersection2(cartesian_product2(X9,X10),cartesian_product2(X11,X12)))&![X13]:![X14]:((~(X8=ordered_pair(X13,X14))|~(in(X13,set_intersection2(X9,X11))))|~(in(X14,set_intersection2(X10,X12))))),inference(variable_rename,[status(thm)],[65])).
% fof(67, negated_conjecture,(in(esk9_0,set_intersection2(cartesian_product2(esk10_0,esk11_0),cartesian_product2(esk12_0,esk13_0)))&![X13]:![X14]:((~(esk9_0=ordered_pair(X13,X14))|~(in(X13,set_intersection2(esk10_0,esk12_0))))|~(in(X14,set_intersection2(esk11_0,esk13_0))))),inference(skolemize,[status(esa)],[66])).
% fof(68, negated_conjecture,![X13]:![X14]:(((~(esk9_0=ordered_pair(X13,X14))|~(in(X13,set_intersection2(esk10_0,esk12_0))))|~(in(X14,set_intersection2(esk11_0,esk13_0))))&in(esk9_0,set_intersection2(cartesian_product2(esk10_0,esk11_0),cartesian_product2(esk12_0,esk13_0)))),inference(shift_quantors,[status(thm)],[67])).
% cnf(69,negated_conjecture,(in(esk9_0,set_intersection2(cartesian_product2(esk10_0,esk11_0),cartesian_product2(esk12_0,esk13_0)))),inference(split_conjunct,[status(thm)],[68])).
% cnf(70,negated_conjecture,(~in(X1,set_intersection2(esk11_0,esk13_0))|~in(X2,set_intersection2(esk10_0,esk12_0))|esk9_0!=ordered_pair(X2,X1)),inference(split_conjunct,[status(thm)],[68])).
% cnf(72,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)],[51,62,theory(equality)]),62,theory(equality)]),['unfolding']).
% cnf(73,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)],[52,62,theory(equality)]),62,theory(equality)]),['unfolding']).
% cnf(74,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)],[27,62,theory(equality)]),['unfolding']).
% cnf(75,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)],[30,62,theory(equality)]),['unfolding']).
% cnf(78,negated_conjecture,(unordered_pair(unordered_pair(X2,X1),singleton(X2))!=esk9_0|~in(X2,set_intersection2(esk10_0,esk12_0))|~in(X1,set_intersection2(esk11_0,esk13_0))),inference(rw,[status(thm)],[70,62,theory(equality)]),['unfolding']).
% cnf(85,negated_conjecture,(unordered_pair(singleton(X1),unordered_pair(X1,X2))!=esk9_0|~in(X1,set_intersection2(esk10_0,esk12_0))|~in(X2,set_intersection2(esk11_0,esk13_0))),inference(spm,[status(thm)],[78,64,theory(equality)])).
% cnf(96,plain,(in(X1,X2)|~in(X1,set_intersection2(X3,X2))),inference(er,[status(thm)],[44,theory(equality)])).
% cnf(101,plain,(in(X1,X2)|~in(X1,set_intersection2(X2,X3))),inference(er,[status(thm)],[45,theory(equality)])).
% cnf(106,plain,(in(X1,set_intersection2(X2,X3))|~in(X1,X3)|~in(X1,X2)),inference(er,[status(thm)],[43,theory(equality)])).
% cnf(114,plain,(X1=X2|unordered_pair(unordered_pair(X3,X1),singleton(X3))!=unordered_pair(singleton(X4),unordered_pair(X4,X2))),inference(spm,[status(thm)],[72,64,theory(equality)])).
% cnf(123,plain,(X1=X2|unordered_pair(unordered_pair(X1,X3),singleton(X1))!=unordered_pair(singleton(X2),unordered_pair(X2,X4))),inference(spm,[status(thm)],[73,64,theory(equality)])).
% cnf(135,plain,(in(X1,X2)|unordered_pair(singleton(X3),unordered_pair(X3,X4))!=X1|cartesian_product2(X5,X6)!=X2|~in(X4,X6)|~in(X3,X5)),inference(spm,[status(thm)],[75,64,theory(equality)])).
% cnf(158,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)],[74,64,theory(equality)])).
% cnf(189,negated_conjecture,(in(esk9_0,cartesian_product2(esk12_0,esk13_0))),inference(spm,[status(thm)],[96,69,theory(equality)])).
% cnf(203,negated_conjecture,(in(esk9_0,cartesian_product2(esk10_0,esk11_0))),inference(spm,[status(thm)],[101,69,theory(equality)])).
% cnf(222,negated_conjecture,(X4!=esk9_0|~in(esk1_4(X1,X2,X3,X4),set_intersection2(esk10_0,esk12_0))|~in(esk2_4(X1,X2,X3,X4),set_intersection2(esk11_0,esk13_0))|cartesian_product2(X1,X2)!=X3|~in(X4,X3)),inference(spm,[status(thm)],[85,158,theory(equality)])).
% cnf(293,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)],[114,158,theory(equality)])).
% cnf(326,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)],[123,158,theory(equality)])).
% cnf(354,plain,(in(X1,X2)|X6!=X1|cartesian_product2(X7,X8)!=X2|~in(esk2_4(X3,X4,X5,X6),X8)|~in(esk1_4(X3,X4,X5,X6),X7)|cartesian_product2(X3,X4)!=X5|~in(X6,X5)),inference(spm,[status(thm)],[135,158,theory(equality)])).
% cnf(355,plain,(in(X1,X2)|cartesian_product2(X3,X4)!=X2|~in(esk2_4(X5,X6,X7,X1),X4)|~in(esk1_4(X5,X6,X7,X1),X3)|cartesian_product2(X5,X6)!=X7|~in(X1,X7)),inference(er,[status(thm)],[354,theory(equality)])).
% cnf(362,negated_conjecture,(cartesian_product2(X1,X2)!=X3|X4!=esk9_0|~in(esk1_4(X1,X2,X3,X4),set_intersection2(esk10_0,esk12_0))|~in(X4,X3)|~in(esk2_4(X1,X2,X3,X4),esk13_0)|~in(esk2_4(X1,X2,X3,X4),esk11_0)),inference(spm,[status(thm)],[222,106,theory(equality)])).
% cnf(476,negated_conjecture,(cartesian_product2(set_intersection2(esk10_0,esk12_0),X1)!=X2|X3!=esk9_0|~in(esk2_4(set_intersection2(esk10_0,esk12_0),X1,X2,X3),esk13_0)|~in(esk2_4(set_intersection2(esk10_0,esk12_0),X1,X2,X3),esk11_0)|~in(X3,X2)),inference(spm,[status(thm)],[362,29,theory(equality)])).
% cnf(859,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)],[293,theory(equality)])).
% cnf(866,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)],[326,theory(equality)])).
% cnf(1159,plain,(in(X1,X2)|cartesian_product2(X3,X4)!=X2|cartesian_product2(X5,X4)!=X6|~in(esk1_4(X5,X4,X6,X1),X3)|~in(X1,X6)),inference(spm,[status(thm)],[355,28,theory(equality)])).
% cnf(1160,plain,(in(X1,X2)|cartesian_product2(set_intersection2(X3,X4),X5)!=X2|cartesian_product2(X6,X5)!=X7|~in(X1,X7)|~in(esk1_4(X6,X5,X7,X1),X4)|~in(esk1_4(X6,X5,X7,X1),X3)),inference(spm,[status(thm)],[1159,106,theory(equality)])).
% cnf(1201,plain,(in(X1,X2)|cartesian_product2(set_intersection2(X3,X4),X5)!=X2|cartesian_product2(X4,X5)!=X6|~in(esk1_4(X4,X5,X6,X1),X3)|~in(X1,X6)),inference(spm,[status(thm)],[1160,29,theory(equality)])).
% cnf(21955,plain,(in(X5,X2)|cartesian_product2(X1,X2)!=X3|~in(unordered_pair(unordered_pair(X4,X5),singleton(X4)),X3)),inference(spm,[status(thm)],[28,859,theory(equality)])).
% cnf(22122,plain,(in(X1,X2)|cartesian_product2(X3,X2)!=X4|~in(unordered_pair(singleton(X5),unordered_pair(X5,X1)),X4)),inference(spm,[status(thm)],[21955,64,theory(equality)])).
% cnf(22267,plain,(in(esk2_4(X1,X2,X3,X4),X5)|cartesian_product2(X6,X5)!=X7|~in(X4,X7)|cartesian_product2(X1,X2)!=X3|~in(X4,X3)),inference(spm,[status(thm)],[22122,158,theory(equality)])).
% cnf(22369,plain,(in(X4,X1)|cartesian_product2(X1,X2)!=X3|~in(unordered_pair(unordered_pair(X4,X5),singleton(X4)),X3)),inference(spm,[status(thm)],[29,866,theory(equality)])).
% cnf(22431,plain,(in(X1,X2)|cartesian_product2(X2,X3)!=X4|~in(unordered_pair(singleton(X1),unordered_pair(X1,X5)),X4)),inference(spm,[status(thm)],[22369,64,theory(equality)])).
% cnf(23614,plain,(in(esk1_4(X1,X2,X3,X4),X5)|cartesian_product2(X5,X6)!=X7|~in(X4,X7)|cartesian_product2(X1,X2)!=X3|~in(X4,X3)),inference(spm,[status(thm)],[22431,158,theory(equality)])).
% cnf(30142,plain,(in(esk2_4(X1,X2,X3,X4),X5)|cartesian_product2(X1,X2)!=X3|~in(X4,cartesian_product2(X6,X5))|~in(X4,X3)),inference(er,[status(thm)],[22267,theory(equality)])).
% cnf(30143,negated_conjecture,(in(esk2_4(X1,X2,X3,esk9_0),esk13_0)|cartesian_product2(X1,X2)!=X3|~in(esk9_0,X3)),inference(spm,[status(thm)],[30142,189,theory(equality)])).
% cnf(30144,negated_conjecture,(in(esk2_4(X1,X2,X3,esk9_0),esk11_0)|cartesian_product2(X1,X2)!=X3|~in(esk9_0,X3)),inference(spm,[status(thm)],[30142,203,theory(equality)])).
% cnf(30315,negated_conjecture,(cartesian_product2(set_intersection2(esk10_0,esk12_0),X1)!=X2|~in(esk2_4(set_intersection2(esk10_0,esk12_0),X1,X2,esk9_0),esk11_0)|~in(esk9_0,X2)),inference(spm,[status(thm)],[476,30143,theory(equality)])).
% cnf(30341,plain,(in(esk1_4(X1,X2,X3,X4),X5)|cartesian_product2(X1,X2)!=X3|~in(X4,cartesian_product2(X5,X6))|~in(X4,X3)),inference(er,[status(thm)],[23614,theory(equality)])).
% cnf(30342,negated_conjecture,(in(esk1_4(X1,X2,X3,esk9_0),esk12_0)|cartesian_product2(X1,X2)!=X3|~in(esk9_0,X3)),inference(spm,[status(thm)],[30341,189,theory(equality)])).
% cnf(34093,negated_conjecture,(in(esk9_0,X1)|cartesian_product2(set_intersection2(esk12_0,X2),X3)!=X1|cartesian_product2(X2,X3)!=X4|~in(esk9_0,X4)),inference(spm,[status(thm)],[1201,30342,theory(equality)])).
% cnf(35370,negated_conjecture,(in(esk9_0,X1)|cartesian_product2(set_intersection2(X2,esk12_0),X3)!=X1|cartesian_product2(X2,X3)!=X4|~in(esk9_0,X4)),inference(spm,[status(thm)],[34093,21,theory(equality)])).
% cnf(36098,negated_conjecture,(in(esk9_0,cartesian_product2(set_intersection2(X1,esk12_0),X2))|cartesian_product2(X1,X2)!=X3|~in(esk9_0,X3)),inference(er,[status(thm)],[35370,theory(equality)])).
% cnf(36105,negated_conjecture,(in(esk9_0,cartesian_product2(set_intersection2(X1,esk12_0),X2))|cartesian_product2(X1,X2)!=cartesian_product2(esk10_0,esk11_0)),inference(spm,[status(thm)],[36098,203,theory(equality)])).
% cnf(47624,negated_conjecture,(cartesian_product2(set_intersection2(esk10_0,esk12_0),X1)!=X2|~in(esk9_0,X2)),inference(csr,[status(thm)],[30315,30144])).
% cnf(47625,negated_conjecture,(~in(esk9_0,cartesian_product2(set_intersection2(esk10_0,esk12_0),X1))),inference(er,[status(thm)],[47624,theory(equality)])).
% cnf(47629,negated_conjecture,(cartesian_product2(esk10_0,X1)!=cartesian_product2(esk10_0,esk11_0)),inference(spm,[status(thm)],[47625,36105,theory(equality)])).
% cnf(47643,negated_conjecture,($false),inference(er,[status(thm)],[47629,theory(equality)])).
% cnf(47644,negated_conjecture,($false),47643,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 8054
% # ...of these trivial : 98
% # ...subsumed : 6439
% # ...remaining for further processing: 1517
% # Other redundant clauses eliminated : 7
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 26
% # Backward-rewritten : 4
% # Generated clauses : 44915
% # ...of the previous two non-trivial : 44511
% # Contextual simplify-reflections : 361
% # Paramodulations : 44500
% # Factorizations : 48
% # Equation resolutions : 367
% # Current number of processed clauses: 1487
% # Positive orientable unit clauses: 13
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 57
% # Non-unit-clauses : 1415
% # Current number of unprocessed clauses: 36412
% # ...number of literals in the above : 142633
% # Clause-clause subsumption calls (NU) : 333669
% # Rec. Clause-clause subsumption calls : 187341
% # Unit Clause-clause subsumption calls : 1477
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 44
% # Indexed BW rewrite successes : 14
% # Backwards rewriting index: 412 leaves, 4.14+/-6.934 terms/leaf
% # Paramod-from index: 44 leaves, 3.48+/-4.979 terms/leaf
% # Paramod-into index: 354 leaves, 3.45+/-4.845 terms/leaf
% # -------------------------------------------------
% # User time : 2.265 s
% # System time : 0.046 s
% # Total time : 2.311 s
% # Maximum resident set size: 0 pages
% PrfWatch: 3.17 CPU 3.48 WC
% FINAL PrfWatch: 3.17 CPU 3.48 WC
% SZS output end Solution for /tmp/SystemOnTPTP9768/SET951+1.tptp
%
%------------------------------------------------------------------------------