TSTP Solution File: SET945+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET945+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:02 EST 2010
% Result : Theorem 11.54s
% Output : Solution 11.54s
% 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/SystemOnTPTP9250/SET945+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP9250/SET945+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP9250/SET945+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 9346
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.92 CPU 2.01 WC
% PrfWatch: 3.91 CPU 4.01 WC
% PrfWatch: 5.91 CPU 6.02 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 7.90 CPU 8.02 WC
% PrfWatch: 9.88 CPU 10.03 WC
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:(disjoint(X1,X2)=>disjoint(X2,X1)),file('/tmp/SRASS.s.p', symmetry_r1_xboole_0)).
% fof(3, axiom,![X1]:![X2]:(X2=union(X1)<=>![X3]:(in(X3,X2)<=>?[X4]:(in(X3,X4)&in(X4,X1)))),file('/tmp/SRASS.s.p', d4_tarski)).
% fof(4, 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(5, 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]:set_intersection2(X1,X2)=set_intersection2(X2,X1),file('/tmp/SRASS.s.p', commutativity_k3_xboole_0)).
% fof(7, axiom,![X1]:![X2]:set_intersection2(X1,X1)=X1,file('/tmp/SRASS.s.p', idempotence_k3_xboole_0)).
% fof(10, conjecture,![X1]:![X2]:(![X3]:(in(X3,X1)=>disjoint(X3,X2))=>disjoint(union(X1),X2)),file('/tmp/SRASS.s.p', t98_zfmisc_1)).
% fof(11, negated_conjecture,~(![X1]:![X2]:(![X3]:(in(X3,X1)=>disjoint(X3,X2))=>disjoint(union(X1),X2))),inference(assume_negation,[status(cth)],[10])).
% fof(13, 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)],[4,theory(equality)])).
% fof(18, plain,![X1]:![X2]:(~(disjoint(X1,X2))|disjoint(X2,X1)),inference(fof_nnf,[status(thm)],[2])).
% fof(19, plain,![X3]:![X4]:(~(disjoint(X3,X4))|disjoint(X4,X3)),inference(variable_rename,[status(thm)],[18])).
% cnf(20,plain,(disjoint(X1,X2)|~disjoint(X2,X1)),inference(split_conjunct,[status(thm)],[19])).
% fof(21, plain,![X1]:![X2]:((~(X2=union(X1))|![X3]:((~(in(X3,X2))|?[X4]:(in(X3,X4)&in(X4,X1)))&(![X4]:(~(in(X3,X4))|~(in(X4,X1)))|in(X3,X2))))&(?[X3]:((~(in(X3,X2))|![X4]:(~(in(X3,X4))|~(in(X4,X1))))&(in(X3,X2)|?[X4]:(in(X3,X4)&in(X4,X1))))|X2=union(X1))),inference(fof_nnf,[status(thm)],[3])).
% fof(22, plain,![X5]:![X6]:((~(X6=union(X5))|![X7]:((~(in(X7,X6))|?[X8]:(in(X7,X8)&in(X8,X5)))&(![X9]:(~(in(X7,X9))|~(in(X9,X5)))|in(X7,X6))))&(?[X10]:((~(in(X10,X6))|![X11]:(~(in(X10,X11))|~(in(X11,X5))))&(in(X10,X6)|?[X12]:(in(X10,X12)&in(X12,X5))))|X6=union(X5))),inference(variable_rename,[status(thm)],[21])).
% fof(23, plain,![X5]:![X6]:((~(X6=union(X5))|![X7]:((~(in(X7,X6))|(in(X7,esk1_3(X5,X6,X7))&in(esk1_3(X5,X6,X7),X5)))&(![X9]:(~(in(X7,X9))|~(in(X9,X5)))|in(X7,X6))))&(((~(in(esk2_2(X5,X6),X6))|![X11]:(~(in(esk2_2(X5,X6),X11))|~(in(X11,X5))))&(in(esk2_2(X5,X6),X6)|(in(esk2_2(X5,X6),esk3_2(X5,X6))&in(esk3_2(X5,X6),X5))))|X6=union(X5))),inference(skolemize,[status(esa)],[22])).
% fof(24, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((~(in(esk2_2(X5,X6),X11))|~(in(X11,X5)))|~(in(esk2_2(X5,X6),X6)))&(in(esk2_2(X5,X6),X6)|(in(esk2_2(X5,X6),esk3_2(X5,X6))&in(esk3_2(X5,X6),X5))))|X6=union(X5))&((((~(in(X7,X9))|~(in(X9,X5)))|in(X7,X6))&(~(in(X7,X6))|(in(X7,esk1_3(X5,X6,X7))&in(esk1_3(X5,X6,X7),X5))))|~(X6=union(X5)))),inference(shift_quantors,[status(thm)],[23])).
% fof(25, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((~(in(esk2_2(X5,X6),X11))|~(in(X11,X5)))|~(in(esk2_2(X5,X6),X6)))|X6=union(X5))&(((in(esk2_2(X5,X6),esk3_2(X5,X6))|in(esk2_2(X5,X6),X6))|X6=union(X5))&((in(esk3_2(X5,X6),X5)|in(esk2_2(X5,X6),X6))|X6=union(X5))))&((((~(in(X7,X9))|~(in(X9,X5)))|in(X7,X6))|~(X6=union(X5)))&(((in(X7,esk1_3(X5,X6,X7))|~(in(X7,X6)))|~(X6=union(X5)))&((in(esk1_3(X5,X6,X7),X5)|~(in(X7,X6)))|~(X6=union(X5)))))),inference(distribute,[status(thm)],[24])).
% cnf(26,plain,(in(esk1_3(X2,X1,X3),X2)|X1!=union(X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[25])).
% cnf(27,plain,(in(X3,esk1_3(X2,X1,X3))|X1!=union(X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[25])).
% cnf(29,plain,(X1=union(X2)|in(esk2_2(X2,X1),X1)|in(esk3_2(X2,X1),X2)),inference(split_conjunct,[status(thm)],[25])).
% fof(32, 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)],[13])).
% fof(33, 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)],[32])).
% fof(34, plain,![X4]:![X5]:((disjoint(X4,X5)|in(esk4_2(X4,X5),set_intersection2(X4,X5)))&(![X7]:~(in(X7,set_intersection2(X4,X5)))|~(disjoint(X4,X5)))),inference(skolemize,[status(esa)],[33])).
% fof(35, plain,![X4]:![X5]:![X7]:((~(in(X7,set_intersection2(X4,X5)))|~(disjoint(X4,X5)))&(disjoint(X4,X5)|in(esk4_2(X4,X5),set_intersection2(X4,X5)))),inference(shift_quantors,[status(thm)],[34])).
% cnf(36,plain,(in(esk4_2(X1,X2),set_intersection2(X1,X2))|disjoint(X1,X2)),inference(split_conjunct,[status(thm)],[35])).
% cnf(37,plain,(~disjoint(X1,X2)|~in(X3,set_intersection2(X1,X2))),inference(split_conjunct,[status(thm)],[35])).
% fof(38, 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)],[5])).
% fof(39, 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)],[38])).
% fof(40, 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)],[39])).
% fof(41, 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)],[40])).
% fof(42, 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)],[41])).
% cnf(43,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)],[42])).
% cnf(46,plain,(in(X4,X1)|X1!=set_intersection2(X2,X3)|~in(X4,X3)|~in(X4,X2)),inference(split_conjunct,[status(thm)],[42])).
% cnf(47,plain,(in(X4,X3)|X1!=set_intersection2(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[42])).
% cnf(48,plain,(in(X4,X2)|X1!=set_intersection2(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[42])).
% fof(49, plain,![X3]:![X4]:set_intersection2(X3,X4)=set_intersection2(X4,X3),inference(variable_rename,[status(thm)],[6])).
% cnf(50,plain,(set_intersection2(X1,X2)=set_intersection2(X2,X1)),inference(split_conjunct,[status(thm)],[49])).
% fof(51, plain,![X3]:![X4]:set_intersection2(X3,X3)=X3,inference(variable_rename,[status(thm)],[7])).
% cnf(52,plain,(set_intersection2(X1,X1)=X1),inference(split_conjunct,[status(thm)],[51])).
% fof(59, negated_conjecture,?[X1]:?[X2]:(![X3]:(~(in(X3,X1))|disjoint(X3,X2))&~(disjoint(union(X1),X2))),inference(fof_nnf,[status(thm)],[11])).
% fof(60, negated_conjecture,?[X4]:?[X5]:(![X6]:(~(in(X6,X4))|disjoint(X6,X5))&~(disjoint(union(X4),X5))),inference(variable_rename,[status(thm)],[59])).
% fof(61, negated_conjecture,(![X6]:(~(in(X6,esk8_0))|disjoint(X6,esk9_0))&~(disjoint(union(esk8_0),esk9_0))),inference(skolemize,[status(esa)],[60])).
% fof(62, negated_conjecture,![X6]:((~(in(X6,esk8_0))|disjoint(X6,esk9_0))&~(disjoint(union(esk8_0),esk9_0))),inference(shift_quantors,[status(thm)],[61])).
% cnf(63,negated_conjecture,(~disjoint(union(esk8_0),esk9_0)),inference(split_conjunct,[status(thm)],[62])).
% cnf(64,negated_conjecture,(disjoint(X1,esk9_0)|~in(X1,esk8_0)),inference(split_conjunct,[status(thm)],[62])).
% cnf(69,negated_conjecture,(in(esk4_2(union(esk8_0),esk9_0),set_intersection2(union(esk8_0),esk9_0))),inference(spm,[status(thm)],[63,36,theory(equality)])).
% cnf(71,plain,(in(X1,X2)|~in(X1,set_intersection2(X3,X2))),inference(er,[status(thm)],[47,theory(equality)])).
% cnf(76,plain,(in(X1,X2)|~in(X1,set_intersection2(X2,X3))),inference(er,[status(thm)],[48,theory(equality)])).
% cnf(81,plain,(~disjoint(X1,X1)|~in(X2,X1)),inference(spm,[status(thm)],[37,52,theory(equality)])).
% cnf(84,plain,(in(X1,esk1_3(X2,union(X2),X1))|~in(X1,union(X2))),inference(er,[status(thm)],[27,theory(equality)])).
% cnf(85,plain,(in(esk1_3(X1,union(X1),X2),X1)|~in(X2,union(X1))),inference(er,[status(thm)],[26,theory(equality)])).
% cnf(96,plain,(in(esk2_2(X4,set_intersection2(X1,X2)),set_intersection2(X1,X2))|in(esk3_2(X4,set_intersection2(X1,X2)),X4)|~disjoint(X1,X2)|~in(X3,union(X4))),inference(spm,[status(thm)],[37,29,theory(equality)])).
% cnf(112,plain,(in(X1,set_intersection2(X2,X3))|~in(X1,X3)|~in(X1,X2)),inference(er,[status(thm)],[46,theory(equality)])).
% cnf(152,plain,(set_intersection2(X4,X5)=X5|in(esk5_3(X4,X5,X5),X5)),inference(ef,[status(thm)],[43,theory(equality)])).
% cnf(186,negated_conjecture,(in(esk4_2(union(esk8_0),esk9_0),set_intersection2(esk9_0,union(esk8_0)))),inference(rw,[status(thm)],[69,50,theory(equality)])).
% cnf(189,negated_conjecture,(~disjoint(esk9_0,union(esk8_0))),inference(spm,[status(thm)],[37,186,theory(equality)])).
% cnf(218,negated_conjecture,(in(esk4_2(esk9_0,union(esk8_0)),set_intersection2(esk9_0,union(esk8_0)))),inference(spm,[status(thm)],[189,36,theory(equality)])).
% cnf(219,plain,(in(esk4_2(X1,X1),set_intersection2(X1,X1))|~in(X2,X1)),inference(spm,[status(thm)],[81,36,theory(equality)])).
% cnf(220,plain,(in(esk4_2(X1,X1),X1)|~in(X2,X1)),inference(rw,[status(thm)],[219,52,theory(equality)])).
% cnf(253,negated_conjecture,(in(esk4_2(esk9_0,union(esk8_0)),union(esk8_0))),inference(spm,[status(thm)],[71,218,theory(equality)])).
% cnf(352,negated_conjecture,(in(esk4_2(esk9_0,union(esk8_0)),esk9_0)),inference(spm,[status(thm)],[76,218,theory(equality)])).
% cnf(814,negated_conjecture,(disjoint(esk1_3(esk8_0,union(esk8_0),X1),esk9_0)|~in(X1,union(esk8_0))),inference(spm,[status(thm)],[64,85,theory(equality)])).
% cnf(819,plain,(in(esk4_2(X1,X1),X1)|~in(X2,union(X1))),inference(spm,[status(thm)],[220,85,theory(equality)])).
% cnf(841,negated_conjecture,(in(esk4_2(esk8_0,esk8_0),esk8_0)),inference(spm,[status(thm)],[819,253,theory(equality)])).
% cnf(851,negated_conjecture,(disjoint(esk4_2(esk8_0,esk8_0),esk9_0)),inference(spm,[status(thm)],[64,841,theory(equality)])).
% cnf(868,negated_conjecture,(disjoint(esk9_0,esk4_2(esk8_0,esk8_0))),inference(spm,[status(thm)],[20,851,theory(equality)])).
% cnf(995,negated_conjecture,(disjoint(esk9_0,esk1_3(esk8_0,union(esk8_0),X1))|~in(X1,union(esk8_0))),inference(spm,[status(thm)],[20,814,theory(equality)])).
% cnf(2936,plain,(set_intersection2(X3,set_intersection2(X1,X2))=set_intersection2(X1,X2)|~disjoint(X1,X2)),inference(spm,[status(thm)],[37,152,theory(equality)])).
% cnf(2957,plain,(in(esk4_2(X1,X1),X1)|set_intersection2(X2,X1)=X1),inference(spm,[status(thm)],[220,152,theory(equality)])).
% cnf(3175,plain,(X2=set_intersection2(X2,X1)|in(esk4_2(X2,X2),X2)),inference(spm,[status(thm)],[50,2957,theory(equality)])).
% cnf(3349,plain,(in(esk3_2(X4,set_intersection2(X1,X2)),X4)|~disjoint(X1,X2)|~in(X3,union(X4))),inference(csr,[status(thm)],[96,37])).
% cnf(3370,negated_conjecture,(in(esk3_2(esk8_0,set_intersection2(X1,X2)),esk8_0)|~disjoint(X1,X2)),inference(spm,[status(thm)],[3349,253,theory(equality)])).
% cnf(3633,negated_conjecture,(in(esk3_2(esk8_0,set_intersection2(esk9_0,esk4_2(esk8_0,esk8_0))),esk8_0)),inference(spm,[status(thm)],[3370,868,theory(equality)])).
% cnf(3675,negated_conjecture,(disjoint(esk3_2(esk8_0,set_intersection2(esk9_0,esk4_2(esk8_0,esk8_0))),esk9_0)),inference(spm,[status(thm)],[64,3633,theory(equality)])).
% cnf(3729,negated_conjecture,(disjoint(esk9_0,esk3_2(esk8_0,set_intersection2(esk9_0,esk4_2(esk8_0,esk8_0))))),inference(spm,[status(thm)],[20,3675,theory(equality)])).
% cnf(22588,negated_conjecture,(set_intersection2(X1,set_intersection2(esk9_0,esk4_2(esk8_0,esk8_0)))=set_intersection2(esk9_0,esk4_2(esk8_0,esk8_0))),inference(spm,[status(thm)],[2936,868,theory(equality)])).
% cnf(22705,negated_conjecture,(set_intersection2(esk9_0,esk4_2(esk8_0,esk8_0))=X1|in(esk4_2(X1,X1),X1)),inference(spm,[status(thm)],[3175,22588,theory(equality)])).
% cnf(47583,negated_conjecture,(set_intersection2(esk9_0,esk4_2(esk8_0,esk8_0))=set_intersection2(X1,X2)|~disjoint(X1,X2)),inference(spm,[status(thm)],[37,22705,theory(equality)])).
% cnf(123733,negated_conjecture,(set_intersection2(esk9_0,esk4_2(esk8_0,esk8_0))=set_intersection2(esk9_0,esk3_2(esk8_0,set_intersection2(esk9_0,esk4_2(esk8_0,esk8_0))))),inference(spm,[status(thm)],[47583,3729,theory(equality)])).
% cnf(123803,negated_conjecture,(set_intersection2(esk9_0,esk4_2(esk8_0,esk8_0))=set_intersection2(esk9_0,esk1_3(esk8_0,union(esk8_0),X1))|~in(X1,union(esk8_0))),inference(spm,[status(thm)],[47583,995,theory(equality)])).
% cnf(123918,negated_conjecture,(~disjoint(esk9_0,esk3_2(esk8_0,set_intersection2(esk9_0,esk4_2(esk8_0,esk8_0))))|~in(X1,set_intersection2(esk9_0,esk4_2(esk8_0,esk8_0)))),inference(spm,[status(thm)],[37,123733,theory(equality)])).
% cnf(124193,negated_conjecture,($false|~in(X1,set_intersection2(esk9_0,esk4_2(esk8_0,esk8_0)))),inference(rw,[status(thm)],[123918,3729,theory(equality)])).
% cnf(124194,negated_conjecture,(~in(X1,set_intersection2(esk9_0,esk4_2(esk8_0,esk8_0)))),inference(cn,[status(thm)],[124193,theory(equality)])).
% cnf(159025,negated_conjecture,(set_intersection2(esk9_0,esk1_3(esk8_0,union(esk8_0),esk4_2(esk9_0,union(esk8_0))))=set_intersection2(esk9_0,esk4_2(esk8_0,esk8_0))),inference(spm,[status(thm)],[123803,253,theory(equality)])).
% cnf(159157,negated_conjecture,(in(X1,set_intersection2(esk9_0,esk4_2(esk8_0,esk8_0)))|~in(X1,esk1_3(esk8_0,union(esk8_0),esk4_2(esk9_0,union(esk8_0))))|~in(X1,esk9_0)),inference(spm,[status(thm)],[112,159025,theory(equality)])).
% cnf(159480,negated_conjecture,(~in(X1,esk1_3(esk8_0,union(esk8_0),esk4_2(esk9_0,union(esk8_0))))|~in(X1,esk9_0)),inference(sr,[status(thm)],[159157,124194,theory(equality)])).
% cnf(260525,negated_conjecture,(~in(esk4_2(esk9_0,union(esk8_0)),esk9_0)|~in(esk4_2(esk9_0,union(esk8_0)),union(esk8_0))),inference(spm,[status(thm)],[159480,84,theory(equality)])).
% cnf(260576,negated_conjecture,($false|~in(esk4_2(esk9_0,union(esk8_0)),union(esk8_0))),inference(rw,[status(thm)],[260525,352,theory(equality)])).
% cnf(260577,negated_conjecture,($false|$false),inference(rw,[status(thm)],[260576,253,theory(equality)])).
% cnf(260578,negated_conjecture,($false),inference(cn,[status(thm)],[260577,theory(equality)])).
% cnf(260579,negated_conjecture,($false),260578,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 3406
% # ...of these trivial : 105
% # ...subsumed : 2226
% # ...remaining for further processing: 1075
% # Other redundant clauses eliminated : 569
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 17
% # Backward-rewritten : 74
% # Generated clauses : 235003
% # ...of the previous two non-trivial : 217425
% # Contextual simplify-reflections : 161
% # Paramodulations : 234368
% # Factorizations : 38
% # Equation resolutions : 597
% # Current number of processed clauses: 962
% # Positive orientable unit clauses: 35
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 26
% # Non-unit-clauses : 900
% # Current number of unprocessed clauses: 190336
% # ...number of literals in the above : 949890
% # Clause-clause subsumption calls (NU) : 63025
% # Rec. Clause-clause subsumption calls : 48359
% # Unit Clause-clause subsumption calls : 306
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 648
% # Indexed BW rewrite successes : 9
% # Backwards rewriting index: 377 leaves, 2.42+/-3.360 terms/leaf
% # Paramod-from index: 148 leaves, 2.91+/-4.291 terms/leaf
% # Paramod-into index: 334 leaves, 2.42+/-3.337 terms/leaf
% # -------------------------------------------------
% # User time : 7.191 s
% # System time : 0.224 s
% # Total time : 7.415 s
% # Maximum resident set size: 0 pages
% PrfWatch: 10.71 CPU 10.87 WC
% FINAL PrfWatch: 10.71 CPU 10.87 WC
% SZS output end Solution for /tmp/SystemOnTPTP9250/SET945+1.tptp
%
%------------------------------------------------------------------------------