TSTP Solution File: SET964+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET964+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:25:36 EST 2010
% Result : Theorem 5.00s
% Output : Solution 5.00s
% 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/SystemOnTPTP12359/SET964+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP12359/SET964+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP12359/SET964+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 12455
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.92 CPU 2.02 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 3.53 CPU 4.02 WC
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:(X1=empty_set<=>![X2]:~(in(X2,X1))),file('/tmp/SRASS.s.p', d1_xboole_0)).
% fof(3, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(in(X3,X1)=>in(X3,X2))),file('/tmp/SRASS.s.p', d3_tarski)).
% fof(5, 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(9, axiom,![X1]:![X2]:unordered_pair(X1,X2)=unordered_pair(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_tarski)).
% fof(10, axiom,![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(12, 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]:~(((~(X1=empty_set)&(subset(cartesian_product2(X2,X1),cartesian_product2(X3,X1))|subset(cartesian_product2(X1,X2),cartesian_product2(X1,X3))))&~(subset(X2,X3)))),file('/tmp/SRASS.s.p', t117_zfmisc_1)).
% fof(14, negated_conjecture,~(![X1]:![X2]:![X3]:~(((~(X1=empty_set)&(subset(cartesian_product2(X2,X1),cartesian_product2(X3,X1))|subset(cartesian_product2(X1,X2),cartesian_product2(X1,X3))))&~(subset(X2,X3))))),inference(assume_negation,[status(cth)],[13])).
% fof(15, plain,![X1]:(X1=empty_set<=>![X2]:~(in(X2,X1))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(19, negated_conjecture,~(![X1]:![X2]:![X3]:~(((~(X1=empty_set)&(subset(cartesian_product2(X2,X1),cartesian_product2(X3,X1))|subset(cartesian_product2(X1,X2),cartesian_product2(X1,X3))))&~(subset(X2,X3))))),inference(fof_simplification,[status(thm)],[14,theory(equality)])).
% fof(22, plain,![X1]:((~(X1=empty_set)|![X2]:~(in(X2,X1)))&(?[X2]:in(X2,X1)|X1=empty_set)),inference(fof_nnf,[status(thm)],[15])).
% fof(23, plain,![X3]:((~(X3=empty_set)|![X4]:~(in(X4,X3)))&(?[X5]:in(X5,X3)|X3=empty_set)),inference(variable_rename,[status(thm)],[22])).
% fof(24, plain,![X3]:((~(X3=empty_set)|![X4]:~(in(X4,X3)))&(in(esk1_1(X3),X3)|X3=empty_set)),inference(skolemize,[status(esa)],[23])).
% fof(25, plain,![X3]:![X4]:((~(in(X4,X3))|~(X3=empty_set))&(in(esk1_1(X3),X3)|X3=empty_set)),inference(shift_quantors,[status(thm)],[24])).
% cnf(26,plain,(X1=empty_set|in(esk1_1(X1),X1)),inference(split_conjunct,[status(thm)],[25])).
% cnf(27,plain,(X1!=empty_set|~in(X2,X1)),inference(split_conjunct,[status(thm)],[25])).
% fof(28, plain,![X1]:![X2]:((~(subset(X1,X2))|![X3]:(~(in(X3,X1))|in(X3,X2)))&(?[X3]:(in(X3,X1)&~(in(X3,X2)))|subset(X1,X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(29, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&(?[X7]:(in(X7,X4)&~(in(X7,X5)))|subset(X4,X5))),inference(variable_rename,[status(thm)],[28])).
% fof(30, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&((in(esk2_2(X4,X5),X4)&~(in(esk2_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[29])).
% fof(31, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk2_2(X4,X5),X4)&~(in(esk2_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[30])).
% fof(32, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk2_2(X4,X5),X4)|subset(X4,X5))&(~(in(esk2_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[31])).
% cnf(33,plain,(subset(X1,X2)|~in(esk2_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[32])).
% cnf(34,plain,(subset(X1,X2)|in(esk2_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[32])).
% cnf(35,plain,(in(X3,X2)|~subset(X1,X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[32])).
% fof(37, 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)],[5])).
% fof(38, 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)],[37])).
% fof(39, plain,![X7]:![X8]:![X9]:((~(X9=cartesian_product2(X7,X8))|![X10]:((~(in(X10,X9))|((in(esk3_4(X7,X8,X9,X10),X7)&in(esk4_4(X7,X8,X9,X10),X8))&X10=ordered_pair(esk3_4(X7,X8,X9,X10),esk4_4(X7,X8,X9,X10))))&(![X13]:![X14]:((~(in(X13,X7))|~(in(X14,X8)))|~(X10=ordered_pair(X13,X14)))|in(X10,X9))))&(((~(in(esk5_3(X7,X8,X9),X9))|![X16]:![X17]:((~(in(X16,X7))|~(in(X17,X8)))|~(esk5_3(X7,X8,X9)=ordered_pair(X16,X17))))&(in(esk5_3(X7,X8,X9),X9)|((in(esk6_3(X7,X8,X9),X7)&in(esk7_3(X7,X8,X9),X8))&esk5_3(X7,X8,X9)=ordered_pair(esk6_3(X7,X8,X9),esk7_3(X7,X8,X9)))))|X9=cartesian_product2(X7,X8))),inference(skolemize,[status(esa)],[38])).
% fof(40, plain,![X7]:![X8]:![X9]:![X10]:![X13]:![X14]:![X16]:![X17]:((((((~(in(X16,X7))|~(in(X17,X8)))|~(esk5_3(X7,X8,X9)=ordered_pair(X16,X17)))|~(in(esk5_3(X7,X8,X9),X9)))&(in(esk5_3(X7,X8,X9),X9)|((in(esk6_3(X7,X8,X9),X7)&in(esk7_3(X7,X8,X9),X8))&esk5_3(X7,X8,X9)=ordered_pair(esk6_3(X7,X8,X9),esk7_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(esk3_4(X7,X8,X9,X10),X7)&in(esk4_4(X7,X8,X9,X10),X8))&X10=ordered_pair(esk3_4(X7,X8,X9,X10),esk4_4(X7,X8,X9,X10)))))|~(X9=cartesian_product2(X7,X8)))),inference(shift_quantors,[status(thm)],[39])).
% fof(41, plain,![X7]:![X8]:![X9]:![X10]:![X13]:![X14]:![X16]:![X17]:((((((~(in(X16,X7))|~(in(X17,X8)))|~(esk5_3(X7,X8,X9)=ordered_pair(X16,X17)))|~(in(esk5_3(X7,X8,X9),X9)))|X9=cartesian_product2(X7,X8))&((((in(esk6_3(X7,X8,X9),X7)|in(esk5_3(X7,X8,X9),X9))|X9=cartesian_product2(X7,X8))&((in(esk7_3(X7,X8,X9),X8)|in(esk5_3(X7,X8,X9),X9))|X9=cartesian_product2(X7,X8)))&((esk5_3(X7,X8,X9)=ordered_pair(esk6_3(X7,X8,X9),esk7_3(X7,X8,X9))|in(esk5_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(esk3_4(X7,X8,X9,X10),X7)|~(in(X10,X9)))|~(X9=cartesian_product2(X7,X8)))&((in(esk4_4(X7,X8,X9,X10),X8)|~(in(X10,X9)))|~(X9=cartesian_product2(X7,X8))))&((X10=ordered_pair(esk3_4(X7,X8,X9,X10),esk4_4(X7,X8,X9,X10))|~(in(X10,X9)))|~(X9=cartesian_product2(X7,X8)))))),inference(distribute,[status(thm)],[40])).
% cnf(44,plain,(in(esk3_4(X2,X3,X1,X4),X2)|X1!=cartesian_product2(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[41])).
% cnf(48,plain,(X1=cartesian_product2(X2,X3)|in(esk5_3(X2,X3,X1),X1)|in(esk6_3(X2,X3,X1),X2)),inference(split_conjunct,[status(thm)],[41])).
% fof(59, plain,![X3]:![X4]:unordered_pair(X3,X4)=unordered_pair(X4,X3),inference(variable_rename,[status(thm)],[9])).
% cnf(60,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X1)),inference(split_conjunct,[status(thm)],[59])).
% fof(61, plain,![X1]:![X2]:![X3]:![X4]:((~(in(ordered_pair(X1,X2),cartesian_product2(X3,X4)))|(in(X1,X3)&in(X2,X4)))&((~(in(X1,X3))|~(in(X2,X4)))|in(ordered_pair(X1,X2),cartesian_product2(X3,X4)))),inference(fof_nnf,[status(thm)],[10])).
% fof(62, plain,![X5]:![X6]:![X7]:![X8]:((~(in(ordered_pair(X5,X6),cartesian_product2(X7,X8)))|(in(X5,X7)&in(X6,X8)))&((~(in(X5,X7))|~(in(X6,X8)))|in(ordered_pair(X5,X6),cartesian_product2(X7,X8)))),inference(variable_rename,[status(thm)],[61])).
% fof(63, plain,![X5]:![X6]:![X7]:![X8]:(((in(X5,X7)|~(in(ordered_pair(X5,X6),cartesian_product2(X7,X8))))&(in(X6,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)))),inference(distribute,[status(thm)],[62])).
% cnf(64,plain,(in(ordered_pair(X1,X2),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3)),inference(split_conjunct,[status(thm)],[63])).
% cnf(65,plain,(in(X2,X4)|~in(ordered_pair(X1,X2),cartesian_product2(X3,X4))),inference(split_conjunct,[status(thm)],[63])).
% cnf(66,plain,(in(X1,X3)|~in(ordered_pair(X1,X2),cartesian_product2(X3,X4))),inference(split_conjunct,[status(thm)],[63])).
% fof(69, plain,![X3]:![X4]:ordered_pair(X3,X4)=unordered_pair(unordered_pair(X3,X4),singleton(X3)),inference(variable_rename,[status(thm)],[12])).
% cnf(70,plain,(ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1))),inference(split_conjunct,[status(thm)],[69])).
% fof(71, negated_conjecture,?[X1]:?[X2]:?[X3]:((~(X1=empty_set)&(subset(cartesian_product2(X2,X1),cartesian_product2(X3,X1))|subset(cartesian_product2(X1,X2),cartesian_product2(X1,X3))))&~(subset(X2,X3))),inference(fof_nnf,[status(thm)],[19])).
% fof(72, negated_conjecture,?[X4]:?[X5]:?[X6]:((~(X4=empty_set)&(subset(cartesian_product2(X5,X4),cartesian_product2(X6,X4))|subset(cartesian_product2(X4,X5),cartesian_product2(X4,X6))))&~(subset(X5,X6))),inference(variable_rename,[status(thm)],[71])).
% fof(73, negated_conjecture,((~(esk10_0=empty_set)&(subset(cartesian_product2(esk11_0,esk10_0),cartesian_product2(esk12_0,esk10_0))|subset(cartesian_product2(esk10_0,esk11_0),cartesian_product2(esk10_0,esk12_0))))&~(subset(esk11_0,esk12_0))),inference(skolemize,[status(esa)],[72])).
% cnf(74,negated_conjecture,(~subset(esk11_0,esk12_0)),inference(split_conjunct,[status(thm)],[73])).
% cnf(75,negated_conjecture,(subset(cartesian_product2(esk10_0,esk11_0),cartesian_product2(esk10_0,esk12_0))|subset(cartesian_product2(esk11_0,esk10_0),cartesian_product2(esk12_0,esk10_0))),inference(split_conjunct,[status(thm)],[73])).
% cnf(76,negated_conjecture,(esk10_0!=empty_set),inference(split_conjunct,[status(thm)],[73])).
% cnf(78,plain,(in(X2,X4)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))),inference(rw,[status(thm)],[65,70,theory(equality)]),['unfolding']).
% cnf(79,plain,(in(X1,X3)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))),inference(rw,[status(thm)],[66,70,theory(equality)]),['unfolding']).
% cnf(80,plain,(in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3)),inference(rw,[status(thm)],[64,70,theory(equality)]),['unfolding']).
% cnf(97,negated_conjecture,(in(X1,cartesian_product2(esk12_0,esk10_0))|subset(cartesian_product2(esk10_0,esk11_0),cartesian_product2(esk10_0,esk12_0))|~in(X1,cartesian_product2(esk11_0,esk10_0))),inference(spm,[status(thm)],[35,75,theory(equality)])).
% cnf(99,plain,(empty_set!=X1|cartesian_product2(X1,X2)!=X3|~in(X4,X3)),inference(spm,[status(thm)],[27,44,theory(equality)])).
% cnf(105,plain,(in(X1,X2)|~in(unordered_pair(singleton(X3),unordered_pair(X3,X1)),cartesian_product2(X4,X2))),inference(spm,[status(thm)],[78,60,theory(equality)])).
% cnf(130,plain,(in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3)),inference(spm,[status(thm)],[80,60,theory(equality)])).
% cnf(146,plain,(empty_set!=X1|~in(X2,cartesian_product2(X1,X3))),inference(er,[status(thm)],[99,theory(equality)])).
% cnf(154,plain,(empty_set=cartesian_product2(X1,X2)|empty_set!=X1),inference(spm,[status(thm)],[146,26,theory(equality)])).
% cnf(162,plain,(empty_set!=X1|~in(X2,empty_set)),inference(spm,[status(thm)],[146,154,theory(equality)])).
% fof(168, plain,(~(epred1_0)<=>![X1]:~(empty_set=X1)),introduced(definition),['split']).
% cnf(169,plain,(epred1_0|empty_set!=X1),inference(split_equiv,[status(thm)],[168])).
% fof(170, plain,(~(epred2_0)<=>![X2]:~(in(X2,empty_set))),introduced(definition),['split']).
% cnf(171,plain,(epred2_0|~in(X2,empty_set)),inference(split_equiv,[status(thm)],[170])).
% cnf(172,plain,(~epred2_0|~epred1_0),inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[162,168,theory(equality)]),170,theory(equality)]),['split']).
% cnf(173,plain,(epred1_0),inference(er,[status(thm)],[169,theory(equality)])).
% cnf(174,plain,(~epred2_0|$false),inference(rw,[status(thm)],[172,173,theory(equality)])).
% cnf(175,plain,(~epred2_0),inference(cn,[status(thm)],[174,theory(equality)])).
% cnf(177,plain,(~in(X2,empty_set)),inference(sr,[status(thm)],[171,175,theory(equality)])).
% cnf(179,plain,(cartesian_product2(empty_set,X1)=X2|in(esk5_3(empty_set,X1,X2),X2)),inference(spm,[status(thm)],[177,48,theory(equality)])).
% cnf(234,plain,(cartesian_product2(empty_set,X1)=empty_set),inference(spm,[status(thm)],[177,179,theory(equality)])).
% cnf(245,plain,(empty_set=X2|in(esk5_3(empty_set,X1,X2),X2)),inference(rw,[status(thm)],[179,234,theory(equality)])).
% cnf(337,negated_conjecture,(in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(esk12_0,esk10_0))|subset(cartesian_product2(esk10_0,esk11_0),cartesian_product2(esk10_0,esk12_0))|~in(X2,esk10_0)|~in(X1,esk11_0)),inference(spm,[status(thm)],[97,80,theory(equality)])).
% cnf(3483,negated_conjecture,(in(X1,esk12_0)|subset(cartesian_product2(esk10_0,esk11_0),cartesian_product2(esk10_0,esk12_0))|~in(X2,esk10_0)|~in(X1,esk11_0)),inference(spm,[status(thm)],[79,337,theory(equality)])).
% cnf(85217,negated_conjecture,(in(X1,esk12_0)|subset(cartesian_product2(esk10_0,esk11_0),cartesian_product2(esk10_0,esk12_0))|empty_set=esk10_0|~in(X1,esk11_0)),inference(spm,[status(thm)],[3483,245,theory(equality)])).
% cnf(85232,negated_conjecture,(in(X1,esk12_0)|subset(cartesian_product2(esk10_0,esk11_0),cartesian_product2(esk10_0,esk12_0))|~in(X1,esk11_0)),inference(sr,[status(thm)],[85217,76,theory(equality)])).
% cnf(85788,negated_conjecture,(in(esk2_2(esk11_0,X1),esk12_0)|subset(cartesian_product2(esk10_0,esk11_0),cartesian_product2(esk10_0,esk12_0))|subset(esk11_0,X1)),inference(spm,[status(thm)],[85232,34,theory(equality)])).
% cnf(85874,negated_conjecture,(subset(esk11_0,esk12_0)|subset(cartesian_product2(esk10_0,esk11_0),cartesian_product2(esk10_0,esk12_0))),inference(spm,[status(thm)],[33,85788,theory(equality)])).
% cnf(85875,negated_conjecture,(subset(cartesian_product2(esk10_0,esk11_0),cartesian_product2(esk10_0,esk12_0))),inference(sr,[status(thm)],[85874,74,theory(equality)])).
% cnf(85876,negated_conjecture,(in(X1,cartesian_product2(esk10_0,esk12_0))|~in(X1,cartesian_product2(esk10_0,esk11_0))),inference(spm,[status(thm)],[35,85875,theory(equality)])).
% cnf(85992,negated_conjecture,(in(X1,esk12_0)|~in(unordered_pair(singleton(X2),unordered_pair(X2,X1)),cartesian_product2(esk10_0,esk11_0))),inference(spm,[status(thm)],[105,85876,theory(equality)])).
% cnf(87873,negated_conjecture,(in(X1,esk12_0)|~in(X1,esk11_0)|~in(X2,esk10_0)),inference(spm,[status(thm)],[85992,130,theory(equality)])).
% cnf(87918,negated_conjecture,(in(X1,esk12_0)|empty_set=esk10_0|~in(X1,esk11_0)),inference(spm,[status(thm)],[87873,245,theory(equality)])).
% cnf(87933,negated_conjecture,(in(X1,esk12_0)|~in(X1,esk11_0)),inference(sr,[status(thm)],[87918,76,theory(equality)])).
% cnf(87945,negated_conjecture,(subset(X1,esk12_0)|~in(esk2_2(X1,esk12_0),esk11_0)),inference(spm,[status(thm)],[33,87933,theory(equality)])).
% cnf(87964,negated_conjecture,(subset(esk11_0,esk12_0)),inference(spm,[status(thm)],[87945,34,theory(equality)])).
% cnf(87965,negated_conjecture,($false),inference(sr,[status(thm)],[87964,74,theory(equality)])).
% cnf(87966,negated_conjecture,($false),87965,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 10511
% # ...of these trivial : 1
% # ...subsumed : 10001
% # ...remaining for further processing: 509
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 52
% # Backward-rewritten : 68
% # Generated clauses : 60495
% # ...of the previous two non-trivial : 56409
% # Contextual simplify-reflections : 15662
% # Paramodulations : 60420
% # Factorizations : 0
% # Equation resolutions : 63
% # Current number of processed clauses: 359
% # Positive orientable unit clauses: 11
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 16
% # Non-unit-clauses : 331
% # Current number of unprocessed clauses: 40193
% # ...number of literals in the above : 194748
% # Clause-clause subsumption calls (NU) : 261080
% # Rec. Clause-clause subsumption calls : 192102
% # Unit Clause-clause subsumption calls : 733
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 11
% # Indexed BW rewrite successes : 9
% # Backwards rewriting index: 166 leaves, 2.57+/-3.007 terms/leaf
% # Paramod-from index: 47 leaves, 1.81+/-1.214 terms/leaf
% # Paramod-into index: 151 leaves, 2.26+/-2.234 terms/leaf
% # -------------------------------------------------
% # User time : 2.484 s
% # System time : 0.081 s
% # Total time : 2.565 s
% # Maximum resident set size: 0 pages
% PrfWatch: 4.20 CPU 4.92 WC
% FINAL PrfWatch: 4.20 CPU 4.92 WC
% SZS output end Solution for /tmp/SystemOnTPTP12359/SET964+1.tptp
%
%------------------------------------------------------------------------------