%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU141+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 : art07.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:15:19 EST 2010
% Result : Theorem 1.64s
% Output : Solution 1.64s
% 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/SystemOnTPTP18385/SEU141+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP18385/SEU141+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP18385/SEU141+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 18481
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(disjoint(X1,X2)=>disjoint(X2,X1)),file('/tmp/SRASS.s.p', symmetry_r1_xboole_0)).
% fof(2, axiom,![X1]:![X2]:![X3]:(X3=set_difference(X1,X2)<=>![X4]:(in(X4,X3)<=>(in(X4,X1)&~(in(X4,X2))))),file('/tmp/SRASS.s.p', d4_xboole_0)).
% fof(7, axiom,![X1]:![X2]:(disjoint(X1,X2)<=>set_intersection2(X1,X2)=empty_set),file('/tmp/SRASS.s.p', d7_xboole_0)).
% fof(8, axiom,![X1]:![X2]:set_intersection2(X1,X2)=set_intersection2(X2,X1),file('/tmp/SRASS.s.p', commutativity_k3_xboole_0)).
% fof(12, axiom,![X1]:![X2]:(~((~(disjoint(X1,X2))&![X3]:~(in(X3,set_intersection2(X1,X2)))))&~((?[X3]:in(X3,set_intersection2(X1,X2))&disjoint(X1,X2)))),file('/tmp/SRASS.s.p', t4_xboole_0)).
% fof(15, 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(16, axiom,![X1]:set_intersection2(X1,empty_set)=empty_set,file('/tmp/SRASS.s.p', t2_boole)).
% fof(24, conjecture,![X1]:![X2]:(disjoint(X1,X2)<=>set_difference(X1,X2)=X1),file('/tmp/SRASS.s.p', t83_xboole_1)).
% fof(25, negated_conjecture,~(![X1]:![X2]:(disjoint(X1,X2)<=>set_difference(X1,X2)=X1)),inference(assume_negation,[status(cth)],[24])).
% fof(26, plain,![X1]:![X2]:![X3]:(X3=set_difference(X1,X2)<=>![X4]:(in(X4,X3)<=>(in(X4,X1)&~(in(X4,X2))))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(28, plain,![X1]:![X2]:(~((~(disjoint(X1,X2))&![X3]:~(in(X3,set_intersection2(X1,X2)))))&~((?[X3]:in(X3,set_intersection2(X1,X2))&disjoint(X1,X2)))),inference(fof_simplification,[status(thm)],[12,theory(equality)])).
% fof(30, plain,![X1]:![X2]:(~(disjoint(X1,X2))|disjoint(X2,X1)),inference(fof_nnf,[status(thm)],[1])).
% fof(31, plain,![X3]:![X4]:(~(disjoint(X3,X4))|disjoint(X4,X3)),inference(variable_rename,[status(thm)],[30])).
% cnf(32,plain,(disjoint(X1,X2)|~disjoint(X2,X1)),inference(split_conjunct,[status(thm)],[31])).
% fof(33, plain,![X1]:![X2]:![X3]:((~(X3=set_difference(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_difference(X1,X2))),inference(fof_nnf,[status(thm)],[26])).
% fof(34, plain,![X5]:![X6]:![X7]:((~(X7=set_difference(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_difference(X5,X6))),inference(variable_rename,[status(thm)],[33])).
% fof(35, plain,![X5]:![X6]:![X7]:((~(X7=set_difference(X5,X6))|![X8]:((~(in(X8,X7))|(in(X8,X5)&~(in(X8,X6))))&((~(in(X8,X5))|in(X8,X6))|in(X8,X7))))&(((~(in(esk1_3(X5,X6,X7),X7))|(~(in(esk1_3(X5,X6,X7),X5))|in(esk1_3(X5,X6,X7),X6)))&(in(esk1_3(X5,X6,X7),X7)|(in(esk1_3(X5,X6,X7),X5)&~(in(esk1_3(X5,X6,X7),X6)))))|X7=set_difference(X5,X6))),inference(skolemize,[status(esa)],[34])).
% fof(36, 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_difference(X5,X6)))&(((~(in(esk1_3(X5,X6,X7),X7))|(~(in(esk1_3(X5,X6,X7),X5))|in(esk1_3(X5,X6,X7),X6)))&(in(esk1_3(X5,X6,X7),X7)|(in(esk1_3(X5,X6,X7),X5)&~(in(esk1_3(X5,X6,X7),X6)))))|X7=set_difference(X5,X6))),inference(shift_quantors,[status(thm)],[35])).
% fof(37, plain,![X5]:![X6]:![X7]:![X8]:(((((in(X8,X5)|~(in(X8,X7)))|~(X7=set_difference(X5,X6)))&((~(in(X8,X6))|~(in(X8,X7)))|~(X7=set_difference(X5,X6))))&(((~(in(X8,X5))|in(X8,X6))|in(X8,X7))|~(X7=set_difference(X5,X6))))&(((~(in(esk1_3(X5,X6,X7),X7))|(~(in(esk1_3(X5,X6,X7),X5))|in(esk1_3(X5,X6,X7),X6)))|X7=set_difference(X5,X6))&(((in(esk1_3(X5,X6,X7),X5)|in(esk1_3(X5,X6,X7),X7))|X7=set_difference(X5,X6))&((~(in(esk1_3(X5,X6,X7),X6))|in(esk1_3(X5,X6,X7),X7))|X7=set_difference(X5,X6))))),inference(distribute,[status(thm)],[36])).
% cnf(39,plain,(X1=set_difference(X2,X3)|in(esk1_3(X2,X3,X1),X1)|in(esk1_3(X2,X3,X1),X2)),inference(split_conjunct,[status(thm)],[37])).
% cnf(40,plain,(X1=set_difference(X2,X3)|in(esk1_3(X2,X3,X1),X3)|~in(esk1_3(X2,X3,X1),X2)|~in(esk1_3(X2,X3,X1),X1)),inference(split_conjunct,[status(thm)],[37])).
% cnf(42,plain,(X1!=set_difference(X2,X3)|~in(X4,X1)|~in(X4,X3)),inference(split_conjunct,[status(thm)],[37])).
% fof(53, plain,![X1]:![X2]:((~(disjoint(X1,X2))|set_intersection2(X1,X2)=empty_set)&(~(set_intersection2(X1,X2)=empty_set)|disjoint(X1,X2))),inference(fof_nnf,[status(thm)],[7])).
% fof(54, plain,![X3]:![X4]:((~(disjoint(X3,X4))|set_intersection2(X3,X4)=empty_set)&(~(set_intersection2(X3,X4)=empty_set)|disjoint(X3,X4))),inference(variable_rename,[status(thm)],[53])).
% cnf(55,plain,(disjoint(X1,X2)|set_intersection2(X1,X2)!=empty_set),inference(split_conjunct,[status(thm)],[54])).
% cnf(56,plain,(set_intersection2(X1,X2)=empty_set|~disjoint(X1,X2)),inference(split_conjunct,[status(thm)],[54])).
% fof(57, plain,![X3]:![X4]:set_intersection2(X3,X4)=set_intersection2(X4,X3),inference(variable_rename,[status(thm)],[8])).
% cnf(58,plain,(set_intersection2(X1,X2)=set_intersection2(X2,X1)),inference(split_conjunct,[status(thm)],[57])).
% fof(70, plain,![X1]:![X2]:((disjoint(X1,X2)|?[X3]:in(X3,set_intersection2(X1,X2)))&(![X3]:~(in(X3,set_intersection2(X1,X2)))|~(disjoint(X1,X2)))),inference(fof_nnf,[status(thm)],[28])).
% fof(71, plain,![X4]:![X5]:((disjoint(X4,X5)|?[X6]:in(X6,set_intersection2(X4,X5)))&(![X7]:~(in(X7,set_intersection2(X4,X5)))|~(disjoint(X4,X5)))),inference(variable_rename,[status(thm)],[70])).
% fof(72, plain,![X4]:![X5]:((disjoint(X4,X5)|in(esk2_2(X4,X5),set_intersection2(X4,X5)))&(![X7]:~(in(X7,set_intersection2(X4,X5)))|~(disjoint(X4,X5)))),inference(skolemize,[status(esa)],[71])).
% fof(73, plain,![X4]:![X5]:![X7]:((~(in(X7,set_intersection2(X4,X5)))|~(disjoint(X4,X5)))&(disjoint(X4,X5)|in(esk2_2(X4,X5),set_intersection2(X4,X5)))),inference(shift_quantors,[status(thm)],[72])).
% cnf(74,plain,(in(esk2_2(X1,X2),set_intersection2(X1,X2))|disjoint(X1,X2)),inference(split_conjunct,[status(thm)],[73])).
% cnf(75,plain,(~disjoint(X1,X2)|~in(X3,set_intersection2(X1,X2))),inference(split_conjunct,[status(thm)],[73])).
% fof(82, 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)],[15])).
% fof(83, 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)],[82])).
% fof(84, 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(esk5_3(X5,X6,X7),X7))|(~(in(esk5_3(X5,X6,X7),X5))|~(in(esk5_3(X5,X6,X7),X6))))&(in(esk5_3(X5,X6,X7),X7)|(in(esk5_3(X5,X6,X7),X5)&in(esk5_3(X5,X6,X7),X6))))|X7=set_intersection2(X5,X6))),inference(skolemize,[status(esa)],[83])).
% fof(85, 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(esk5_3(X5,X6,X7),X7))|(~(in(esk5_3(X5,X6,X7),X5))|~(in(esk5_3(X5,X6,X7),X6))))&(in(esk5_3(X5,X6,X7),X7)|(in(esk5_3(X5,X6,X7),X5)&in(esk5_3(X5,X6,X7),X6))))|X7=set_intersection2(X5,X6))),inference(shift_quantors,[status(thm)],[84])).
% fof(86, 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(esk5_3(X5,X6,X7),X7))|(~(in(esk5_3(X5,X6,X7),X5))|~(in(esk5_3(X5,X6,X7),X6))))|X7=set_intersection2(X5,X6))&(((in(esk5_3(X5,X6,X7),X5)|in(esk5_3(X5,X6,X7),X7))|X7=set_intersection2(X5,X6))&((in(esk5_3(X5,X6,X7),X6)|in(esk5_3(X5,X6,X7),X7))|X7=set_intersection2(X5,X6))))),inference(distribute,[status(thm)],[85])).
% cnf(87,plain,(X1=set_intersection2(X2,X3)|in(esk5_3(X2,X3,X1),X1)|in(esk5_3(X2,X3,X1),X3)),inference(split_conjunct,[status(thm)],[86])).
% cnf(88,plain,(X1=set_intersection2(X2,X3)|in(esk5_3(X2,X3,X1),X1)|in(esk5_3(X2,X3,X1),X2)),inference(split_conjunct,[status(thm)],[86])).
% cnf(90,plain,(in(X4,X1)|X1!=set_intersection2(X2,X3)|~in(X4,X3)|~in(X4,X2)),inference(split_conjunct,[status(thm)],[86])).
% fof(93, plain,![X2]:set_intersection2(X2,empty_set)=empty_set,inference(variable_rename,[status(thm)],[16])).
% cnf(94,plain,(set_intersection2(X1,empty_set)=empty_set),inference(split_conjunct,[status(thm)],[93])).
% fof(113, negated_conjecture,?[X1]:?[X2]:((~(disjoint(X1,X2))|~(set_difference(X1,X2)=X1))&(disjoint(X1,X2)|set_difference(X1,X2)=X1)),inference(fof_nnf,[status(thm)],[25])).
% fof(114, negated_conjecture,?[X3]:?[X4]:((~(disjoint(X3,X4))|~(set_difference(X3,X4)=X3))&(disjoint(X3,X4)|set_difference(X3,X4)=X3)),inference(variable_rename,[status(thm)],[113])).
% fof(115, negated_conjecture,((~(disjoint(esk7_0,esk8_0))|~(set_difference(esk7_0,esk8_0)=esk7_0))&(disjoint(esk7_0,esk8_0)|set_difference(esk7_0,esk8_0)=esk7_0)),inference(skolemize,[status(esa)],[114])).
% cnf(116,negated_conjecture,(set_difference(esk7_0,esk8_0)=esk7_0|disjoint(esk7_0,esk8_0)),inference(split_conjunct,[status(thm)],[115])).
% cnf(117,negated_conjecture,(set_difference(esk7_0,esk8_0)!=esk7_0|~disjoint(esk7_0,esk8_0)),inference(split_conjunct,[status(thm)],[115])).
% cnf(125,negated_conjecture,(set_intersection2(esk7_0,esk8_0)=empty_set|set_difference(esk7_0,esk8_0)=esk7_0),inference(spm,[status(thm)],[56,116,theory(equality)])).
% cnf(135,negated_conjecture,(in(esk2_2(esk7_0,esk8_0),set_intersection2(esk7_0,esk8_0))|set_difference(esk7_0,esk8_0)!=esk7_0),inference(spm,[status(thm)],[117,74,theory(equality)])).
% cnf(137,plain,(disjoint(X1,X2)|in(esk2_2(X2,X1),set_intersection2(X2,X1))),inference(spm,[status(thm)],[32,74,theory(equality)])).
% cnf(138,plain,(~in(X1,empty_set)|~disjoint(X2,empty_set)),inference(spm,[status(thm)],[75,94,theory(equality)])).
% cnf(154,plain,(~in(X1,X2)|~in(X1,set_difference(X3,X2))),inference(er,[status(thm)],[42,theory(equality)])).
% cnf(174,plain,(in(X1,set_intersection2(X2,X3))|~in(X1,X3)|~in(X1,X2)),inference(er,[status(thm)],[90,theory(equality)])).
% cnf(285,negated_conjecture,(in(esk2_2(esk7_0,esk8_0),set_intersection2(esk7_0,esk8_0))|in(esk1_3(esk7_0,esk8_0,X1),esk7_0)|in(esk1_3(esk7_0,esk8_0,X1),X1)|X1!=esk7_0),inference(spm,[status(thm)],[135,39,theory(equality)])).
% cnf(296,plain,(set_intersection2(set_difference(X1,X2),X3)=X4|in(esk5_3(set_difference(X1,X2),X3,X4),X4)|~in(esk5_3(set_difference(X1,X2),X3,X4),X2)),inference(spm,[status(thm)],[154,88,theory(equality)])).
% cnf(441,negated_conjecture,(in(esk2_2(esk8_0,esk7_0),set_intersection2(esk8_0,esk7_0))|set_difference(esk7_0,esk8_0)!=esk7_0),inference(spm,[status(thm)],[117,137,theory(equality)])).
% cnf(446,negated_conjecture,(in(esk2_2(esk8_0,esk7_0),set_intersection2(esk7_0,esk8_0))|set_difference(esk7_0,esk8_0)!=esk7_0),inference(rw,[status(thm)],[441,58,theory(equality)])).
% fof(461, plain,(~(epred1_0)<=>![X1]:~(in(X1,empty_set))),introduced(definition),['split']).
% cnf(462,plain,(epred1_0|~in(X1,empty_set)),inference(split_equiv,[status(thm)],[461])).
% fof(463, plain,(~(epred2_0)<=>![X2]:~(disjoint(X2,empty_set))),introduced(definition),['split']).
% cnf(464,plain,(epred2_0|~disjoint(X2,empty_set)),inference(split_equiv,[status(thm)],[463])).
% cnf(465,plain,(~epred2_0|~epred1_0),inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[138,461,theory(equality)]),463,theory(equality)]),['split']).
% cnf(466,plain,(epred2_0|set_intersection2(X1,empty_set)!=empty_set),inference(spm,[status(thm)],[464,55,theory(equality)])).
% cnf(470,plain,(epred2_0|$false),inference(rw,[status(thm)],[466,94,theory(equality)])).
% cnf(471,plain,(epred2_0),inference(cn,[status(thm)],[470,theory(equality)])).
% cnf(476,plain,($false|~epred1_0),inference(rw,[status(thm)],[465,471,theory(equality)])).
% cnf(477,plain,(~epred1_0),inference(cn,[status(thm)],[476,theory(equality)])).
% cnf(479,plain,(~in(X1,empty_set)),inference(sr,[status(thm)],[462,477,theory(equality)])).
% cnf(481,plain,(set_intersection2(X1,X2)=empty_set|in(esk5_3(X1,X2,empty_set),X2)),inference(spm,[status(thm)],[479,87,theory(equality)])).
% cnf(10361,negated_conjecture,(in(esk2_2(esk7_0,esk8_0),set_intersection2(esk7_0,esk8_0))|in(esk1_3(esk7_0,esk8_0,esk7_0),esk7_0)),inference(er,[status(thm)],[285,theory(equality)])).
% cnf(14486,negated_conjecture,(in(esk1_3(esk7_0,esk8_0,esk7_0),esk7_0)|~disjoint(esk7_0,esk8_0)),inference(spm,[status(thm)],[75,10361,theory(equality)])).
% cnf(14543,negated_conjecture,(in(esk1_3(esk7_0,esk8_0,esk7_0),esk7_0)|in(esk2_2(esk8_0,esk7_0),set_intersection2(esk8_0,esk7_0))),inference(spm,[status(thm)],[14486,137,theory(equality)])).
% cnf(14546,negated_conjecture,(in(esk1_3(esk7_0,esk8_0,esk7_0),esk7_0)|in(esk2_2(esk8_0,esk7_0),set_intersection2(esk7_0,esk8_0))),inference(rw,[status(thm)],[14543,58,theory(equality)])).
% cnf(15957,plain,(set_intersection2(set_difference(X1,X2),X2)=empty_set|in(esk5_3(set_difference(X1,X2),X2,empty_set),empty_set)),inference(spm,[status(thm)],[296,481,theory(equality)])).
% cnf(15969,plain,(set_intersection2(set_difference(X1,X2),X2)=empty_set),inference(sr,[status(thm)],[15957,479,theory(equality)])).
% cnf(15970,plain,(set_intersection2(X2,set_difference(X1,X2))=empty_set),inference(rw,[status(thm)],[15969,58,theory(equality)])).
% cnf(16004,negated_conjecture,(set_intersection2(esk8_0,esk7_0)=empty_set|set_intersection2(esk7_0,esk8_0)=empty_set),inference(spm,[status(thm)],[15970,125,theory(equality)])).
% cnf(16071,negated_conjecture,(set_intersection2(esk7_0,esk8_0)=empty_set|set_intersection2(esk7_0,esk8_0)=empty_set),inference(rw,[status(thm)],[16004,58,theory(equality)])).
% cnf(16072,negated_conjecture,(set_intersection2(esk7_0,esk8_0)=empty_set),inference(cn,[status(thm)],[16071,theory(equality)])).
% cnf(16119,negated_conjecture,(in(X1,empty_set)|~in(X1,esk8_0)|~in(X1,esk7_0)),inference(spm,[status(thm)],[174,16072,theory(equality)])).
% cnf(16140,negated_conjecture,(in(esk2_2(esk8_0,esk7_0),empty_set)|in(esk1_3(esk7_0,esk8_0,esk7_0),esk7_0)),inference(rw,[status(thm)],[14546,16072,theory(equality)])).
% cnf(16141,negated_conjecture,(in(esk1_3(esk7_0,esk8_0,esk7_0),esk7_0)),inference(sr,[status(thm)],[16140,479,theory(equality)])).
% cnf(16189,negated_conjecture,(in(esk2_2(esk8_0,esk7_0),empty_set)|set_difference(esk7_0,esk8_0)!=esk7_0),inference(rw,[status(thm)],[446,16072,theory(equality)])).
% cnf(16190,negated_conjecture,(set_difference(esk7_0,esk8_0)!=esk7_0),inference(sr,[status(thm)],[16189,479,theory(equality)])).
% cnf(16231,negated_conjecture,(~in(X1,esk8_0)|~in(X1,esk7_0)),inference(sr,[status(thm)],[16119,479,theory(equality)])).
% cnf(16431,negated_conjecture,(set_difference(esk7_0,esk8_0)=esk7_0|in(esk1_3(esk7_0,esk8_0,esk7_0),esk8_0)|~in(esk1_3(esk7_0,esk8_0,esk7_0),esk7_0)),inference(spm,[status(thm)],[40,16141,theory(equality)])).
% cnf(16462,negated_conjecture,(set_difference(esk7_0,esk8_0)=esk7_0|in(esk1_3(esk7_0,esk8_0,esk7_0),esk8_0)|$false),inference(rw,[status(thm)],[16431,16141,theory(equality)])).
% cnf(16463,negated_conjecture,(set_difference(esk7_0,esk8_0)=esk7_0|in(esk1_3(esk7_0,esk8_0,esk7_0),esk8_0)),inference(cn,[status(thm)],[16462,theory(equality)])).
% cnf(16464,negated_conjecture,(in(esk1_3(esk7_0,esk8_0,esk7_0),esk8_0)),inference(sr,[status(thm)],[16463,16190,theory(equality)])).
% cnf(16822,negated_conjecture,(~in(esk1_3(esk7_0,esk8_0,esk7_0),esk7_0)),inference(spm,[status(thm)],[16231,16464,theory(equality)])).
% cnf(16845,negated_conjecture,($false),inference(rw,[status(thm)],[16822,16141,theory(equality)])).
% cnf(16846,negated_conjecture,($false),inference(cn,[status(thm)],[16845,theory(equality)])).
% cnf(16847,negated_conjecture,($false),16846,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1342
% # ...of these trivial : 12
% # ...subsumed : 859
% # ...remaining for further processing: 471
% # Other redundant clauses eliminated : 109
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 24
% # Backward-rewritten : 67
% # Generated clauses : 13705
% # ...of the previous two non-trivial : 12363
% # Contextual simplify-reflections : 218
% # Paramodulations : 13528
% # Factorizations : 36
% # Equation resolutions : 135
% # Current number of processed clauses: 338
% # Positive orientable unit clauses: 24
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 22
% # Non-unit-clauses : 291
% # Current number of unprocessed clauses: 7309
% # ...number of literals in the above : 35961
% # Clause-clause subsumption calls (NU) : 7005
% # Rec. Clause-clause subsumption calls : 5904
% # Unit Clause-clause subsumption calls : 209
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 39
% # Indexed BW rewrite successes : 22
% # Backwards rewriting index: 166 leaves, 2.05+/-3.443 terms/leaf
% # Paramod-from index: 67 leaves, 1.90+/-2.855 terms/leaf
% # Paramod-into index: 139 leaves, 2.01+/-3.159 terms/leaf
% # -------------------------------------------------
% # User time : 0.503 s
% # System time : 0.020 s
% # Total time : 0.523 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.83 CPU 0.92 WC
% FINAL PrfWatch: 0.83 CPU 0.92 WC
% SZS output end Solution for /tmp/SystemOnTPTP18385/SEU141+1.tptp
%
%------------------------------------------------------------------------------