TSTP Solution File: SEU174+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU174+2 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art05.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:26:05 EST 2010
% Result : Theorem 9.20s
% Output : Solution 9.20s
% 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/SystemOnTPTP21361/SEU174+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP21361/SEU174+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21361/SEU174+2.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 21457
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% PrfWatch: 1.94 CPU 2.01 WC
% PrfWatch: 3.93 CPU 4.02 WC
% # Preprocessing time : 0.029 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 5.92 CPU 6.02 WC
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:![X2]:(element(X2,powerset(powerset(X1)))=>complements_of_subsets(X1,complements_of_subsets(X1,X2))=X2),file('/tmp/SRASS.s.p', involutiveness_k7_setfam_1)).
% fof(6, axiom,![X1]:![X2]:(![X3]:(in(X3,X1)=>in(X3,X2))=>element(X1,powerset(X2))),file('/tmp/SRASS.s.p', l71_subset_1)).
% fof(7, axiom,![X1]:![X2]:(element(X1,powerset(X2))<=>subset(X1,X2)),file('/tmp/SRASS.s.p', t3_subset)).
% fof(8, axiom,![X1]:![X2]:![X3]:((in(X1,X2)&element(X2,powerset(X3)))=>element(X1,X3)),file('/tmp/SRASS.s.p', t4_subset)).
% fof(11, axiom,![X1]:(subset(X1,empty_set)=>X1=empty_set),file('/tmp/SRASS.s.p', t3_xboole_1)).
% fof(12, axiom,![X1]:![X2]:(element(X2,powerset(powerset(X1)))=>![X3]:(element(X3,powerset(powerset(X1)))=>(X3=complements_of_subsets(X1,X2)<=>![X4]:(element(X4,powerset(X1))=>(in(X4,X3)<=>in(subset_complement(X1,X4),X2)))))),file('/tmp/SRASS.s.p', d8_setfam_1)).
% fof(17, axiom,![X1]:~(singleton(X1)=empty_set),file('/tmp/SRASS.s.p', l1_zfmisc_1)).
% fof(19, axiom,![X1]:set_difference(X1,empty_set)=X1,file('/tmp/SRASS.s.p', t3_boole)).
% fof(22, axiom,![X1]:set_intersection2(X1,empty_set)=empty_set,file('/tmp/SRASS.s.p', t2_boole)).
% fof(30, axiom,![X1]:![X2]:set_union2(X1,X2)=set_union2(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_xboole_0)).
% fof(31, axiom,![X1]:![X2]:set_intersection2(X1,X2)=set_intersection2(X2,X1),file('/tmp/SRASS.s.p', commutativity_k3_xboole_0)).
% fof(43, axiom,![X1]:![X2]:(set_difference(X1,X2)=empty_set<=>subset(X1,X2)),file('/tmp/SRASS.s.p', l32_xboole_1)).
% fof(46, axiom,![X1]:![X2]:(disjoint(X1,X2)<=>set_intersection2(X1,X2)=empty_set),file('/tmp/SRASS.s.p', d7_xboole_0)).
% fof(66, axiom,![X1]:![X2]:![X3]:((subset(X1,X2)&disjoint(X2,X3))=>disjoint(X1,X3)),file('/tmp/SRASS.s.p', t63_xboole_1)).
% fof(68, axiom,![X1]:![X2]:set_union2(X1,set_difference(X2,X1))=set_union2(X1,X2),file('/tmp/SRASS.s.p', t39_xboole_1)).
% fof(69, axiom,![X1]:![X2]:set_difference(set_union2(X1,X2),X2)=set_difference(X1,X2),file('/tmp/SRASS.s.p', t40_xboole_1)).
% fof(71, axiom,![X1]:![X2]:set_difference(X1,set_difference(X1,X2))=set_intersection2(X1,X2),file('/tmp/SRASS.s.p', t48_xboole_1)).
% fof(73, axiom,![X1]:unordered_pair(X1,X1)=singleton(X1),file('/tmp/SRASS.s.p', t69_enumset1)).
% fof(74, axiom,![X1]:![X2]:(disjoint(X1,X2)<=>set_difference(X1,X2)=X1),file('/tmp/SRASS.s.p', t83_xboole_1)).
% fof(88, axiom,![X1]:![X2]:subset(X1,set_union2(X1,X2)),file('/tmp/SRASS.s.p', t7_xboole_1)).
% fof(98, axiom,![X1]:![X2]:(subset(singleton(X1),X2)<=>in(X1,X2)),file('/tmp/SRASS.s.p', l2_zfmisc_1)).
% fof(106, 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(122, conjecture,![X1]:![X2]:(element(X2,powerset(powerset(X1)))=>~((~(X2=empty_set)&complements_of_subsets(X1,X2)=empty_set))),file('/tmp/SRASS.s.p', t46_setfam_1)).
% fof(123, negated_conjecture,~(![X1]:![X2]:(element(X2,powerset(powerset(X1)))=>~((~(X2=empty_set)&complements_of_subsets(X1,X2)=empty_set)))),inference(assume_negation,[status(cth)],[122])).
% fof(141, 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)],[106,theory(equality)])).
% fof(149, plain,![X1]:![X2]:(~(element(X2,powerset(powerset(X1))))|complements_of_subsets(X1,complements_of_subsets(X1,X2))=X2),inference(fof_nnf,[status(thm)],[3])).
% fof(150, plain,![X3]:![X4]:(~(element(X4,powerset(powerset(X3))))|complements_of_subsets(X3,complements_of_subsets(X3,X4))=X4),inference(variable_rename,[status(thm)],[149])).
% cnf(151,plain,(complements_of_subsets(X1,complements_of_subsets(X1,X2))=X2|~element(X2,powerset(powerset(X1)))),inference(split_conjunct,[status(thm)],[150])).
% fof(157, plain,![X1]:![X2]:(?[X3]:(in(X3,X1)&~(in(X3,X2)))|element(X1,powerset(X2))),inference(fof_nnf,[status(thm)],[6])).
% fof(158, plain,![X4]:![X5]:(?[X6]:(in(X6,X4)&~(in(X6,X5)))|element(X4,powerset(X5))),inference(variable_rename,[status(thm)],[157])).
% fof(159, plain,![X4]:![X5]:((in(esk2_2(X4,X5),X4)&~(in(esk2_2(X4,X5),X5)))|element(X4,powerset(X5))),inference(skolemize,[status(esa)],[158])).
% fof(160, plain,![X4]:![X5]:((in(esk2_2(X4,X5),X4)|element(X4,powerset(X5)))&(~(in(esk2_2(X4,X5),X5))|element(X4,powerset(X5)))),inference(distribute,[status(thm)],[159])).
% cnf(162,plain,(element(X1,powerset(X2))|in(esk2_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[160])).
% fof(163, plain,![X1]:![X2]:((~(element(X1,powerset(X2)))|subset(X1,X2))&(~(subset(X1,X2))|element(X1,powerset(X2)))),inference(fof_nnf,[status(thm)],[7])).
% fof(164, plain,![X3]:![X4]:((~(element(X3,powerset(X4)))|subset(X3,X4))&(~(subset(X3,X4))|element(X3,powerset(X4)))),inference(variable_rename,[status(thm)],[163])).
% cnf(166,plain,(subset(X1,X2)|~element(X1,powerset(X2))),inference(split_conjunct,[status(thm)],[164])).
% fof(167, plain,![X1]:![X2]:![X3]:((~(in(X1,X2))|~(element(X2,powerset(X3))))|element(X1,X3)),inference(fof_nnf,[status(thm)],[8])).
% fof(168, plain,![X4]:![X5]:![X6]:((~(in(X4,X5))|~(element(X5,powerset(X6))))|element(X4,X6)),inference(variable_rename,[status(thm)],[167])).
% cnf(169,plain,(element(X1,X2)|~element(X3,powerset(X2))|~in(X1,X3)),inference(split_conjunct,[status(thm)],[168])).
% fof(179, plain,![X1]:(~(subset(X1,empty_set))|X1=empty_set),inference(fof_nnf,[status(thm)],[11])).
% fof(180, plain,![X2]:(~(subset(X2,empty_set))|X2=empty_set),inference(variable_rename,[status(thm)],[179])).
% cnf(181,plain,(X1=empty_set|~subset(X1,empty_set)),inference(split_conjunct,[status(thm)],[180])).
% fof(182, plain,![X1]:![X2]:(~(element(X2,powerset(powerset(X1))))|![X3]:(~(element(X3,powerset(powerset(X1))))|((~(X3=complements_of_subsets(X1,X2))|![X4]:(~(element(X4,powerset(X1)))|((~(in(X4,X3))|in(subset_complement(X1,X4),X2))&(~(in(subset_complement(X1,X4),X2))|in(X4,X3)))))&(?[X4]:(element(X4,powerset(X1))&((~(in(X4,X3))|~(in(subset_complement(X1,X4),X2)))&(in(X4,X3)|in(subset_complement(X1,X4),X2))))|X3=complements_of_subsets(X1,X2))))),inference(fof_nnf,[status(thm)],[12])).
% fof(183, plain,![X5]:![X6]:(~(element(X6,powerset(powerset(X5))))|![X7]:(~(element(X7,powerset(powerset(X5))))|((~(X7=complements_of_subsets(X5,X6))|![X8]:(~(element(X8,powerset(X5)))|((~(in(X8,X7))|in(subset_complement(X5,X8),X6))&(~(in(subset_complement(X5,X8),X6))|in(X8,X7)))))&(?[X9]:(element(X9,powerset(X5))&((~(in(X9,X7))|~(in(subset_complement(X5,X9),X6)))&(in(X9,X7)|in(subset_complement(X5,X9),X6))))|X7=complements_of_subsets(X5,X6))))),inference(variable_rename,[status(thm)],[182])).
% fof(184, plain,![X5]:![X6]:(~(element(X6,powerset(powerset(X5))))|![X7]:(~(element(X7,powerset(powerset(X5))))|((~(X7=complements_of_subsets(X5,X6))|![X8]:(~(element(X8,powerset(X5)))|((~(in(X8,X7))|in(subset_complement(X5,X8),X6))&(~(in(subset_complement(X5,X8),X6))|in(X8,X7)))))&((element(esk4_3(X5,X6,X7),powerset(X5))&((~(in(esk4_3(X5,X6,X7),X7))|~(in(subset_complement(X5,esk4_3(X5,X6,X7)),X6)))&(in(esk4_3(X5,X6,X7),X7)|in(subset_complement(X5,esk4_3(X5,X6,X7)),X6))))|X7=complements_of_subsets(X5,X6))))),inference(skolemize,[status(esa)],[183])).
% fof(185, plain,![X5]:![X6]:![X7]:![X8]:(((((~(element(X8,powerset(X5)))|((~(in(X8,X7))|in(subset_complement(X5,X8),X6))&(~(in(subset_complement(X5,X8),X6))|in(X8,X7))))|~(X7=complements_of_subsets(X5,X6)))&((element(esk4_3(X5,X6,X7),powerset(X5))&((~(in(esk4_3(X5,X6,X7),X7))|~(in(subset_complement(X5,esk4_3(X5,X6,X7)),X6)))&(in(esk4_3(X5,X6,X7),X7)|in(subset_complement(X5,esk4_3(X5,X6,X7)),X6))))|X7=complements_of_subsets(X5,X6)))|~(element(X7,powerset(powerset(X5)))))|~(element(X6,powerset(powerset(X5))))),inference(shift_quantors,[status(thm)],[184])).
% fof(186, plain,![X5]:![X6]:![X7]:![X8]:(((((((~(in(X8,X7))|in(subset_complement(X5,X8),X6))|~(element(X8,powerset(X5))))|~(X7=complements_of_subsets(X5,X6)))|~(element(X7,powerset(powerset(X5)))))|~(element(X6,powerset(powerset(X5)))))&(((((~(in(subset_complement(X5,X8),X6))|in(X8,X7))|~(element(X8,powerset(X5))))|~(X7=complements_of_subsets(X5,X6)))|~(element(X7,powerset(powerset(X5)))))|~(element(X6,powerset(powerset(X5))))))&((((element(esk4_3(X5,X6,X7),powerset(X5))|X7=complements_of_subsets(X5,X6))|~(element(X7,powerset(powerset(X5)))))|~(element(X6,powerset(powerset(X5)))))&(((((~(in(esk4_3(X5,X6,X7),X7))|~(in(subset_complement(X5,esk4_3(X5,X6,X7)),X6)))|X7=complements_of_subsets(X5,X6))|~(element(X7,powerset(powerset(X5)))))|~(element(X6,powerset(powerset(X5)))))&((((in(esk4_3(X5,X6,X7),X7)|in(subset_complement(X5,esk4_3(X5,X6,X7)),X6))|X7=complements_of_subsets(X5,X6))|~(element(X7,powerset(powerset(X5)))))|~(element(X6,powerset(powerset(X5)))))))),inference(distribute,[status(thm)],[185])).
% cnf(191,plain,(in(subset_complement(X2,X4),X1)|~element(X1,powerset(powerset(X2)))|~element(X3,powerset(powerset(X2)))|X3!=complements_of_subsets(X2,X1)|~element(X4,powerset(X2))|~in(X4,X3)),inference(split_conjunct,[status(thm)],[186])).
% fof(209, plain,![X2]:~(singleton(X2)=empty_set),inference(variable_rename,[status(thm)],[17])).
% cnf(210,plain,(singleton(X1)!=empty_set),inference(split_conjunct,[status(thm)],[209])).
% fof(213, plain,![X2]:set_difference(X2,empty_set)=X2,inference(variable_rename,[status(thm)],[19])).
% cnf(214,plain,(set_difference(X1,empty_set)=X1),inference(split_conjunct,[status(thm)],[213])).
% fof(220, plain,![X2]:set_intersection2(X2,empty_set)=empty_set,inference(variable_rename,[status(thm)],[22])).
% cnf(221,plain,(set_intersection2(X1,empty_set)=empty_set),inference(split_conjunct,[status(thm)],[220])).
% fof(241, plain,![X3]:![X4]:set_union2(X3,X4)=set_union2(X4,X3),inference(variable_rename,[status(thm)],[30])).
% cnf(242,plain,(set_union2(X1,X2)=set_union2(X2,X1)),inference(split_conjunct,[status(thm)],[241])).
% fof(243, plain,![X3]:![X4]:set_intersection2(X3,X4)=set_intersection2(X4,X3),inference(variable_rename,[status(thm)],[31])).
% cnf(244,plain,(set_intersection2(X1,X2)=set_intersection2(X2,X1)),inference(split_conjunct,[status(thm)],[243])).
% fof(281, plain,![X1]:![X2]:((~(set_difference(X1,X2)=empty_set)|subset(X1,X2))&(~(subset(X1,X2))|set_difference(X1,X2)=empty_set)),inference(fof_nnf,[status(thm)],[43])).
% fof(282, plain,![X3]:![X4]:((~(set_difference(X3,X4)=empty_set)|subset(X3,X4))&(~(subset(X3,X4))|set_difference(X3,X4)=empty_set)),inference(variable_rename,[status(thm)],[281])).
% cnf(283,plain,(set_difference(X1,X2)=empty_set|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[282])).
% fof(295, 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)],[46])).
% fof(296, 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)],[295])).
% cnf(298,plain,(set_intersection2(X1,X2)=empty_set|~disjoint(X1,X2)),inference(split_conjunct,[status(thm)],[296])).
% fof(409, plain,![X1]:![X2]:![X3]:((~(subset(X1,X2))|~(disjoint(X2,X3)))|disjoint(X1,X3)),inference(fof_nnf,[status(thm)],[66])).
% fof(410, plain,![X4]:![X5]:![X6]:((~(subset(X4,X5))|~(disjoint(X5,X6)))|disjoint(X4,X6)),inference(variable_rename,[status(thm)],[409])).
% cnf(411,plain,(disjoint(X1,X2)|~disjoint(X3,X2)|~subset(X1,X3)),inference(split_conjunct,[status(thm)],[410])).
% fof(415, plain,![X3]:![X4]:set_union2(X3,set_difference(X4,X3))=set_union2(X3,X4),inference(variable_rename,[status(thm)],[68])).
% cnf(416,plain,(set_union2(X1,set_difference(X2,X1))=set_union2(X1,X2)),inference(split_conjunct,[status(thm)],[415])).
% fof(417, plain,![X3]:![X4]:set_difference(set_union2(X3,X4),X4)=set_difference(X3,X4),inference(variable_rename,[status(thm)],[69])).
% cnf(418,plain,(set_difference(set_union2(X1,X2),X2)=set_difference(X1,X2)),inference(split_conjunct,[status(thm)],[417])).
% fof(425, plain,![X3]:![X4]:set_difference(X3,set_difference(X3,X4))=set_intersection2(X3,X4),inference(variable_rename,[status(thm)],[71])).
% cnf(426,plain,(set_difference(X1,set_difference(X1,X2))=set_intersection2(X1,X2)),inference(split_conjunct,[status(thm)],[425])).
% fof(433, plain,![X2]:unordered_pair(X2,X2)=singleton(X2),inference(variable_rename,[status(thm)],[73])).
% cnf(434,plain,(unordered_pair
% PrfWatch: 7.90 CPU 8.03 WC
% (X1,X1)=singleton(X1)),inference(split_conjunct,[status(thm)],[433])).
% fof(435, plain,![X1]:![X2]:((~(disjoint(X1,X2))|set_difference(X1,X2)=X1)&(~(set_difference(X1,X2)=X1)|disjoint(X1,X2))),inference(fof_nnf,[status(thm)],[74])).
% fof(436, plain,![X3]:![X4]:((~(disjoint(X3,X4))|set_difference(X3,X4)=X3)&(~(set_difference(X3,X4)=X3)|disjoint(X3,X4))),inference(variable_rename,[status(thm)],[435])).
% cnf(438,plain,(set_difference(X1,X2)=X1|~disjoint(X1,X2)),inference(split_conjunct,[status(thm)],[436])).
% fof(494, plain,![X3]:![X4]:subset(X3,set_union2(X3,X4)),inference(variable_rename,[status(thm)],[88])).
% cnf(495,plain,(subset(X1,set_union2(X1,X2))),inference(split_conjunct,[status(thm)],[494])).
% fof(526, plain,![X1]:![X2]:((~(subset(singleton(X1),X2))|in(X1,X2))&(~(in(X1,X2))|subset(singleton(X1),X2))),inference(fof_nnf,[status(thm)],[98])).
% fof(527, plain,![X3]:![X4]:((~(subset(singleton(X3),X4))|in(X3,X4))&(~(in(X3,X4))|subset(singleton(X3),X4))),inference(variable_rename,[status(thm)],[526])).
% cnf(528,plain,(subset(singleton(X1),X2)|~in(X1,X2)),inference(split_conjunct,[status(thm)],[527])).
% fof(555, 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)],[141])).
% fof(556, 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)],[555])).
% fof(557, plain,![X4]:![X5]:((disjoint(X4,X5)|in(esk23_2(X4,X5),set_intersection2(X4,X5)))&(![X7]:~(in(X7,set_intersection2(X4,X5)))|~(disjoint(X4,X5)))),inference(skolemize,[status(esa)],[556])).
% fof(558, plain,![X4]:![X5]:![X7]:((~(in(X7,set_intersection2(X4,X5)))|~(disjoint(X4,X5)))&(disjoint(X4,X5)|in(esk23_2(X4,X5),set_intersection2(X4,X5)))),inference(shift_quantors,[status(thm)],[557])).
% cnf(559,plain,(in(esk23_2(X1,X2),set_intersection2(X1,X2))|disjoint(X1,X2)),inference(split_conjunct,[status(thm)],[558])).
% fof(605, negated_conjecture,?[X1]:?[X2]:(element(X2,powerset(powerset(X1)))&(~(X2=empty_set)&complements_of_subsets(X1,X2)=empty_set)),inference(fof_nnf,[status(thm)],[123])).
% fof(606, negated_conjecture,?[X3]:?[X4]:(element(X4,powerset(powerset(X3)))&(~(X4=empty_set)&complements_of_subsets(X3,X4)=empty_set)),inference(variable_rename,[status(thm)],[605])).
% fof(607, negated_conjecture,(element(esk31_0,powerset(powerset(esk30_0)))&(~(esk31_0=empty_set)&complements_of_subsets(esk30_0,esk31_0)=empty_set)),inference(skolemize,[status(esa)],[606])).
% cnf(608,negated_conjecture,(complements_of_subsets(esk30_0,esk31_0)=empty_set),inference(split_conjunct,[status(thm)],[607])).
% cnf(609,negated_conjecture,(esk31_0!=empty_set),inference(split_conjunct,[status(thm)],[607])).
% cnf(610,negated_conjecture,(element(esk31_0,powerset(powerset(esk30_0)))),inference(split_conjunct,[status(thm)],[607])).
% cnf(627,plain,(subset(unordered_pair(X1,X1),X2)|~in(X1,X2)),inference(rw,[status(thm)],[528,434,theory(equality)]),['unfolding']).
% cnf(635,plain,(unordered_pair(X1,X1)!=empty_set),inference(rw,[status(thm)],[210,434,theory(equality)]),['unfolding']).
% cnf(639,plain,(set_difference(X1,set_difference(X1,empty_set))=empty_set),inference(rw,[status(thm)],[221,426,theory(equality)]),['unfolding']).
% cnf(640,plain,(set_difference(X1,set_difference(X1,X2))=set_difference(X2,set_difference(X2,X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[244,426,theory(equality)]),426,theory(equality)]),['unfolding']).
% cnf(642,plain,(disjoint(X1,X2)|in(esk23_2(X1,X2),set_difference(X1,set_difference(X1,X2)))),inference(rw,[status(thm)],[559,426,theory(equality)]),['unfolding']).
% cnf(646,plain,(set_difference(X1,set_difference(X1,X2))=empty_set|~disjoint(X1,X2)),inference(rw,[status(thm)],[298,426,theory(equality)]),['unfolding']).
% cnf(672,plain,(set_difference(X1,X1)=empty_set),inference(rw,[status(thm)],[639,214,theory(equality)])).
% cnf(681,plain,(in(subset_complement(X2,X4),X1)|complements_of_subsets(X2,X1)!=X3|~in(X4,X3)|~element(X3,powerset(powerset(X2)))|~element(X1,powerset(powerset(X2)))),inference(csr,[status(thm)],[191,169])).
% cnf(690,negated_conjecture,(subset(esk31_0,powerset(esk30_0))),inference(spm,[status(thm)],[166,610,theory(equality)])).
% cnf(763,negated_conjecture,(complements_of_subsets(esk30_0,empty_set)=esk31_0|~element(esk31_0,powerset(powerset(esk30_0)))),inference(spm,[status(thm)],[151,608,theory(equality)])).
% cnf(764,negated_conjecture,(complements_of_subsets(esk30_0,empty_set)=esk31_0|$false),inference(rw,[status(thm)],[763,610,theory(equality)])).
% cnf(765,negated_conjecture,(complements_of_subsets(esk30_0,empty_set)=esk31_0),inference(cn,[status(thm)],[764,theory(equality)])).
% cnf(774,plain,(set_difference(set_union2(X1,X2),set_difference(X2,X1))=set_difference(X1,set_difference(X2,X1))),inference(spm,[status(thm)],[418,416,theory(equality)])).
% cnf(775,plain,(set_difference(set_union2(X2,X1),X2)=set_difference(X1,X2)),inference(spm,[status(thm)],[418,242,theory(equality)])).
% cnf(823,plain,(set_difference(X1,set_difference(X1,X2))=set_difference(X2,empty_set)|~subset(X2,X1)),inference(spm,[status(thm)],[640,283,theory(equality)])).
% cnf(836,plain,(set_difference(X1,set_difference(X1,X2))=X2|~subset(X2,X1)),inference(rw,[status(thm)],[823,214,theory(equality)])).
% cnf(900,plain,(set_difference(X1,empty_set)=empty_set|~disjoint(X1,set_difference(X1,X2))|~disjoint(X1,X2)),inference(spm,[status(thm)],[646,646,theory(equality)])).
% cnf(912,plain,(X1=empty_set|~disjoint(X1,set_difference(X1,X2))|~disjoint(X1,X2)),inference(rw,[status(thm)],[900,214,theory(equality)])).
% cnf(930,plain,(empty_set=unordered_pair(X1,X1)|~in(X1,empty_set)),inference(spm,[status(thm)],[181,627,theory(equality)])).
% cnf(935,plain,(~in(X1,empty_set)),inference(sr,[status(thm)],[930,635,theory(equality)])).
% cnf(2234,negated_conjecture,(in(subset_complement(esk30_0,X1),X2)|complements_of_subsets(esk30_0,X2)!=esk31_0|~in(X1,esk31_0)|~element(X2,powerset(powerset(esk30_0)))),inference(spm,[status(thm)],[681,610,theory(equality)])).
% cnf(2739,plain,(element(empty_set,powerset(X1))),inference(spm,[status(thm)],[935,162,theory(equality)])).
% cnf(2803,negated_conjecture,(disjoint(esk31_0,X1)|~disjoint(powerset(esk30_0),X1)),inference(spm,[status(thm)],[411,690,theory(equality)])).
% cnf(5416,plain,(set_difference(set_union2(X1,X2),set_difference(X2,X1))=X1|~subset(X1,set_union2(X1,X2))),inference(spm,[status(thm)],[836,775,theory(equality)])).
% cnf(5449,plain,(set_difference(X1,set_difference(X2,X1))=X1|~subset(X1,set_union2(X1,X2))),inference(rw,[status(thm)],[5416,774,theory(equality)])).
% cnf(5450,plain,(set_difference(X1,set_difference(X2,X1))=X1|$false),inference(rw,[status(thm)],[5449,495,theory(equality)])).
% cnf(5451,plain,(set_difference(X1,set_difference(X2,X1))=X1),inference(cn,[status(thm)],[5450,theory(equality)])).
% cnf(84835,plain,(disjoint(X1,set_difference(X2,X1))|in(esk23_2(X1,set_difference(X2,X1)),set_difference(X1,X1))),inference(spm,[status(thm)],[642,5451,theory(equality)])).
% cnf(85117,plain,(disjoint(X1,set_difference(X2,X1))|in(esk23_2(X1,set_difference(X2,X1)),empty_set)),inference(rw,[status(thm)],[84835,672,theory(equality)])).
% cnf(85118,plain,(disjoint(X1,set_difference(X2,X1))),inference(sr,[status(thm)],[85117,935,theory(equality)])).
% cnf(85805,negated_conjecture,(disjoint(esk31_0,set_difference(X1,powerset(esk30_0)))),inference(spm,[status(thm)],[2803,85118,theory(equality)])).
% cnf(86057,negated_conjecture,(set_difference(esk31_0,set_difference(X1,powerset(esk30_0)))=esk31_0),inference(spm,[status(thm)],[438,85805,theory(equality)])).
% cnf(86066,negated_conjecture,(esk31_0=empty_set|~disjoint(esk31_0,powerset(esk30_0))),inference(spm,[status(thm)],[912,85805,theory(equality)])).
% cnf(86108,negated_conjecture,(~disjoint(esk31_0,powerset(esk30_0))),inference(sr,[status(thm)],[86066,609,theory(equality)])).
% cnf(86962,negated_conjecture,(disjoint(esk31_0,powerset(esk30_0))|in(esk23_2(esk31_0,powerset(esk30_0)),esk31_0)),inference(spm,[status(thm)],[642,86057,theory(equality)])).
% cnf(87236,negated_conjecture,(in(esk23_2(esk31_0,powerset(esk30_0)),esk31_0)),inference(sr,[status(thm)],[86962,86108,theory(equality)])).
% cnf(141521,negated_conjecture,(complements_of_subsets(esk30_0,empty_set)!=esk31_0|~in(X1,esk31_0)|~element(empty_set,powerset(powerset(esk30_0)))),inference(spm,[status(thm)],[935,2234,theory(equality)])).
% cnf(141615,negated_conjecture,($false|~in(X1,esk31_0)|~element(empty_set,powerset(powerset(esk30_0)))),inference(rw,[status(thm)],[141521,765,theory(equality)])).
% cnf(141616,negated_conjecture,($false|~in(X1,esk31_0)|$false),inference(rw,[status(thm)],[141615,2739,theory(equality)])).
% cnf(141617,negated_conjecture,(~in(X1,esk31_0)),inference(cn,[status(thm)],[141616,theory(equality)])).
% cnf(141737,negated_conjecture,($false),inference(sr,[status(thm)],[87236,141617,theory(equality)])).
% cnf(141738,negated_conjecture,($false),141737,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 10261
% # ...of these trivial : 99
% # ...subsumed : 7872
% # ...remaining for further processing: 2290
% # Other redundant clauses eliminated : 871
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 98
% # Backward-rewritten : 18
% # Generated clauses : 111473
% # ...of the previous two non-trivial : 102623
% # Contextual simplify-reflections : 2661
% # Paramodulations : 110379
% # Factorizations : 56
% # Equation resolutions : 1034
% # Current number of processed clauses: 1992
% # Positive orientable unit clauses: 119
% # Positive unorientable unit clauses: 4
% # Negative unit clauses : 225
% # Non-unit-clauses : 1644
% # Current number of unprocessed clauses: 91474
% # ...number of literals in the above : 444419
% # Clause-clause subsumption calls (NU) : 157250
% # Rec. Clause-clause subsumption calls : 128757
% # Unit Clause-clause subsumption calls : 2045
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 178
% # Indexed BW rewrite successes : 40
% # Backwards rewriting index: 1198 leaves, 1.58+/-1.926 terms/leaf
% # Paramod-from index: 438 leaves, 1.26+/-0.706 terms/leaf
% # Paramod-into index: 1038 leaves, 1.52+/-1.723 terms/leaf
% # -------------------------------------------------
% # User time : 5.432 s
% # System time : 0.157 s
% # Total time : 5.589 s
% # Maximum resident set size: 0 pages
% PrfWatch: 7.94 CPU 8.18 WC
% FINAL PrfWatch: 7.94 CPU 8.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP21361/SEU174+2.tptp
%
%------------------------------------------------------------------------------