TSTP Solution File: SET098+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET098+1 : TPTP v5.3.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : helena.cs.miami.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Core(TM)2 CPU 6600 @ 2.40GHz @ 2400MHz
% Memory : 1003MB
% OS : Linux 2.6.32.26-175.fc12.x86_64
% CPULimit : 300s
% DateTime : Fri Jun 15 11:08:13 EDT 2012
% Result : Theorem 28.64s
% Output : Solution 28.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/SystemOnTPTP12643/SET098+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP12643/SET098+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP12643/SET098+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.5/eproof_ram --print-statistics -xAuto -tAuto --cpu-limit=60 --memory-limit=Auto --tstp-format /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC time limit is 120s
% TreeLimitedRun: PID is 12741
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% PrfWatch: 3.17 CPU 2.01 WC
% PrfWatch: 6.37 CPU 4.02 WC
% PrfWatch: 9.49 CPU 6.02 WC
% PrfWatch: 12.83 CPU 8.03 WC
% PrfWatch: 15.79 CPU 10.04 WC
% PrfWatch: 18.82 CPU 12.05 WC
% PrfWatch: 21.47 CPU 14.06 WC
% PrfWatch: 24.23 CPU 16.08 WC
% PrfWatch: 27.15 CPU 18.08 WC
% # Auto-Ordering is analysing problem.
% # Problem is type GHSMNFFMS21MD
% # Auto-mode selected ordering type KBO6
% # Auto-mode selected ordering precedence scheme <invfreq>
% # Auto-mode selected weight ordering scheme <invfreqrank>
% #
% # Auto-Heuristic is analysing problem.
% # Problem is type GHSMNFFMS21MD
% # Auto-Mode selected heuristic G_E___103_C18_F1_PI_AE_Q4_CS_SP_S0Y
% # and selection function SelectMaxLComplexAvoidPosPred.
% #
% # Initializing proof state
% # Scanning for AC axioms
% # intersection is commutative
% # AC handling enabled dynamically
% # Proof found!
% # SZS status Theorem
% # Parsed axioms : 44
% # Removed by relevancy pruning : 0
% # Initial clauses : 92
% # Removed in clause preprocessing : 8
% # Initial clauses in saturation : 84
% # Processed clauses : 16214
% # ...of these trivial : 36
% # ...subsumed : 13151
% # ...remaining for further processing: 3027
% # Other redundant clauses eliminated : 82
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 49
% # Backward-rewritten : 275
% # Generated clauses : 565224
% # ...of the previous two non-trivial : 524761
% # Contextual simplify-reflections : 2533
% # Paramodulations : 564658
% # Factorizations : 481
% # Equation resolutions : 84
% # Current number of processed clauses: 2698
% # Positive orientable unit clauses: 81
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 65
% # Non-unit-clauses : 2551
% # Current number of unprocessed clauses: 462912
% # ...number of literals in the above : 2142413
% # Clause-clause subsumption calls (NU) : 2365347
% # Rec. Clause-clause subsumption calls : 1415574
% # Non-unit clause-clause subsumptions: 7526
% # Unit Clause-clause subsumption calls : 52882
% # Rewrite failures with RHS unbound : 0
% # BW rewrite match attempts : 721
% # BW rewrite match successes : 497
% # Backwards rewriting index : 9505 nodes, 2543 leaves, 2.62+/-7.384 terms/leaf
% # Paramod-from index : 2356 nodes, 582 leaves, 2.47+/-4.531 terms/leaf
% # Paramod-into index : 5827 nodes, 1515 leaves, 2.63+/-7.278 terms/leaf
% # Paramod-neg-atom index : 1659 nodes, 412 leaves, 2.25+/-2.753 terms/leaf
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:(member(X3,intersection(X1,X2))<=>(member(X3,X1)&member(X3,X2))),file('/tmp/SRASS.s.p', intersection)).
% fof(3, axiom,![X1]:![X3]:(member(X3,complement(X1))<=>(member(X3,universal_class)&~(member(X3,X1)))),file('/tmp/SRASS.s.p', complement)).
% fof(4, axiom,![X1]:singleton(X1)=unordered_pair(X1,X1),file('/tmp/SRASS.s.p', singleton_set_defn)).
% fof(5, axiom,![X1]:(~(X1=null_class)=>?[X4]:((member(X4,universal_class)&member(X4,X1))&disjoint(X4,X1))),file('/tmp/SRASS.s.p', regularity)).
% fof(10, axiom,![X1]:![X2]:(X1=X2<=>(subclass(X1,X2)&subclass(X2,X1))),file('/tmp/SRASS.s.p', extensionality)).
% fof(12, axiom,![X4]:![X1]:![X2]:(member(X4,unordered_pair(X1,X2))<=>(member(X4,universal_class)&(X4=X1|X4=X2))),file('/tmp/SRASS.s.p', unordered_pair_defn)).
% fof(16, axiom,![X1]:![X2]:(subclass(X1,X2)<=>![X4]:(member(X4,X1)=>member(X4,X2))),file('/tmp/SRASS.s.p', subclass_defn)).
% fof(17, axiom,![X1]:subclass(X1,universal_class),file('/tmp/SRASS.s.p', class_elements_are_sets)).
% fof(44, conjecture,![X1]:((X1=null_class|?[X2]:singleton(X2)=X1)|?[X8]:(member(X8,X1)&?[X9]:(member(X9,intersection(complement(singleton(X8)),X1))&member(X9,X1)))),file('/tmp/SRASS.s.p', corollary_1_to_number_of_elements_in_class)).
% fof(45, negated_conjecture,~(![X1]:((X1=null_class|?[X2]:singleton(X2)=X1)|?[X8]:(member(X8,X1)&?[X9]:(member(X9,intersection(complement(singleton(X8)),X1))&member(X9,X1))))),inference(assume_negation,[status(cth)],[44])).
% fof(47, plain,![X1]:![X3]:(member(X3,complement(X1))<=>(member(X3,universal_class)&~(member(X3,X1)))),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(48, plain,![X1]:![X2]:![X3]:((~(member(X3,intersection(X1,X2)))|(member(X3,X1)&member(X3,X2)))&((~(member(X3,X1))|~(member(X3,X2)))|member(X3,intersection(X1,X2)))),inference(fof_nnf,[status(thm)],[1])).
% fof(49, plain,(![X1]:![X2]:![X3]:(~(member(X3,intersection(X1,X2)))|(member(X3,X1)&member(X3,X2)))&![X1]:![X2]:![X3]:((~(member(X3,X1))|~(member(X3,X2)))|member(X3,intersection(X1,X2)))),inference(shift_quantors,[status(thm)],[48])).
% fof(50, plain,(![X4]:![X5]:![X6]:(~(member(X6,intersection(X4,X5)))|(member(X6,X4)&member(X6,X5)))&![X7]:![X8]:![X9]:((~(member(X9,X7))|~(member(X9,X8)))|member(X9,intersection(X7,X8)))),inference(variable_rename,[status(thm)],[49])).
% fof(51, plain,![X4]:![X5]:![X6]:![X7]:![X8]:![X9]:((~(member(X6,intersection(X4,X5)))|(member(X6,X4)&member(X6,X5)))&((~(member(X9,X7))|~(member(X9,X8)))|member(X9,intersection(X7,X8)))),inference(shift_quantors,[status(thm)],[50])).
% fof(52, plain,![X4]:![X5]:![X6]:![X7]:![X8]:![X9]:(((member(X6,X4)|~(member(X6,intersection(X4,X5))))&(member(X6,X5)|~(member(X6,intersection(X4,X5)))))&((~(member(X9,X7))|~(member(X9,X8)))|member(X9,intersection(X7,X8)))),inference(distribute,[status(thm)],[51])).
% cnf(53,plain,(member(X1,intersection(X2,X3))|~member(X1,X3)|~member(X1,X2)),inference(split_conjunct,[status(thm)],[52])).
% cnf(54,plain,(member(X1,X3)|~member(X1,intersection(X2,X3))),inference(split_conjunct,[status(thm)],[52])).
% cnf(55,plain,(member(X1,X2)|~member(X1,intersection(X2,X3))),inference(split_conjunct,[status(thm)],[52])).
% fof(58, plain,![X1]:![X3]:((~(member(X3,complement(X1)))|(member(X3,universal_class)&~(member(X3,X1))))&((~(member(X3,universal_class))|member(X3,X1))|member(X3,complement(X1)))),inference(fof_nnf,[status(thm)],[47])).
% fof(59, plain,(![X1]:![X3]:(~(member(X3,complement(X1)))|(member(X3,universal_class)&~(member(X3,X1))))&![X1]:![X3]:((~(member(X3,universal_class))|member(X3,X1))|member(X3,complement(X1)))),inference(shift_quantors,[status(thm)],[58])).
% fof(60, plain,(![X4]:![X5]:(~(member(X5,complement(X4)))|(member(X5,universal_class)&~(member(X5,X4))))&![X6]:![X7]:((~(member(X7,universal_class))|member(X7,X6))|member(X7,complement(X6)))),inference(variable_rename,[status(thm)],[59])).
% fof(61, plain,![X4]:![X5]:![X6]:![X7]:((~(member(X5,complement(X4)))|(member(X5,universal_class)&~(member(X5,X4))))&((~(member(X7,universal_class))|member(X7,X6))|member(X7,complement(X6)))),inference(shift_quantors,[status(thm)],[60])).
% fof(62, plain,![X4]:![X5]:![X6]:![X7]:(((member(X5,universal_class)|~(member(X5,complement(X4))))&(~(member(X5,X4))|~(member(X5,complement(X4)))))&((~(member(X7,universal_class))|member(X7,X6))|member(X7,complement(X6)))),inference(distribute,[status(thm)],[61])).
% cnf(63,plain,(member(X1,complement(X2))|member(X1,X2)|~member(X1,universal_class)),inference(split_conjunct,[status(thm)],[62])).
% fof(66, plain,![X2]:singleton(X2)=unordered_pair(X2,X2),inference(variable_rename,[status(thm)],[4])).
% cnf(67,plain,(singleton(X1)=unordered_pair(X1,X1)),inference(split_conjunct,[status(thm)],[66])).
% fof(68, plain,![X1]:(X1=null_class|?[X4]:((member(X4,universal_class)&member(X4,X1))&disjoint(X4,X1))),inference(fof_nnf,[status(thm)],[5])).
% fof(69, plain,![X5]:(X5=null_class|?[X6]:((member(X6,universal_class)&member(X6,X5))&disjoint(X6,X5))),inference(variable_rename,[status(thm)],[68])).
% fof(70, plain,![X5]:(X5=null_class|((member(esk1_1(X5),universal_class)&member(esk1_1(X5),X5))&disjoint(esk1_1(X5),X5))),inference(skolemize,[status(esa)],[69])).
% fof(71, plain,![X5]:(((member(esk1_1(X5),universal_class)|X5=null_class)&(member(esk1_1(X5),X5)|X5=null_class))&(disjoint(esk1_1(X5),X5)|X5=null_class)),inference(distribute,[status(thm)],[70])).
% cnf(73,plain,(X1=null_class|member(esk1_1(X1),X1)),inference(split_conjunct,[status(thm)],[71])).
% fof(96, plain,![X1]:![X2]:((~(X1=X2)|(subclass(X1,X2)&subclass(X2,X1)))&((~(subclass(X1,X2))|~(subclass(X2,X1)))|X1=X2)),inference(fof_nnf,[status(thm)],[10])).
% fof(97, plain,(![X1]:![X2]:(~(X1=X2)|(subclass(X1,X2)&subclass(X2,X1)))&![X1]:![X2]:((~(subclass(X1,X2))|~(subclass(X2,X1)))|X1=X2)),inference(shift_quantors,[status(thm)],[96])).
% fof(98, plain,(![X3]:![X4]:(~(X3=X4)|(subclass(X3,X4)&subclass(X4,X3)))&![X5]:![X6]:((~(subclass(X5,X6))|~(subclass(X6,X5)))|X5=X6)),inference(variable_rename,[status(thm)],[97])).
% fof(99, plain,![X3]:![X4]:![X5]:![X6]:((~(X3=X4)|(subclass(X3,X4)&subclass(X4,X3)))&((~(subclass(X5,X6))|~(subclass(X6,X5)))|X5=X6)),inference(shift_quantors,[status(thm)],[98])).
% fof(100, plain,![X3]:![X4]:![X5]:![X6]:(((subclass(X3,X4)|~(X3=X4))&(subclass(X4,X3)|~(X3=X4)))&((~(subclass(X5,X6))|~(subclass(X6,X5)))|X5=X6)),inference(distribute,[status(thm)],[99])).
% cnf(101,plain,(X1=X2|~subclass(X2,X1)|~subclass(X1,X2)),inference(split_conjunct,[status(thm)],[100])).
% fof(110, plain,![X4]:![X1]:![X2]:((~(member(X4,unordered_pair(X1,X2)))|(member(X4,universal_class)&(X4=X1|X4=X2)))&((~(member(X4,universal_class))|(~(X4=X1)&~(X4=X2)))|member(X4,unordered_pair(X1,X2)))),inference(fof_nnf,[status(thm)],[12])).
% fof(111, plain,(![X4]:![X1]:![X2]:(~(member(X4,unordered_pair(X1,X2)))|(member(X4,universal_class)&(X4=X1|X4=X2)))&![X4]:![X1]:![X2]:((~(member(X4,universal_class))|(~(X4=X1)&~(X4=X2)))|member(X4,unordered_pair(X1,X2)))),inference(shift_quantors,[status(thm)],[110])).
% fof(112, plain,(![X5]:![X6]:![X7]:(~(member(X5,unordered_pair(X6,X7)))|(member(X5,universal_class)&(X5=X6|X5=X7)))&![X8]:![X9]:![X10]:((~(member(X8,universal_class))|(~(X8=X9)&~(X8=X10)))|member(X8,unordered_pair(X9,X10)))),inference(variable_rename,[status(thm)],[111])).
% fof(113, plain,![X5]:![X6]:![X7]:![X8]:![X9]:![X10]:((~(member(X5,unordered_pair(X6,X7)))|(member(X5,universal_class)&(X5=X6|X5=X7)))&((~(member(X8,universal_class))|(~(X8=X9)&~(X8=X10)))|member(X8,unordered_pair(X9,X10)))),inference(shift_quantors,[status(thm)],[112])).
% fof(114, plain,![X5]:![X6]:![X7]:![X8]:![X9]:![X10]:(((member(X5,universal_class)|~(member(X5,unordered_pair(X6,X7))))&((X5=X6|X5=X7)|~(member(X5,unordered_pair(X6,X7)))))&(((~(X8=X9)|~(member(X8,universal_class)))|member(X8,unordered_pair(X9,X10)))&((~(X8=X10)|~(member(X8,universal_class)))|member(X8,unordered_pair(X9,X10))))),inference(distribute,[status(thm)],[113])).
% cnf(117,plain,(X1=X3|X1=X2|~member(X1,unordered_pair(X2,X3))),inference(split_conjunct,[status(thm)],[114])).
% fof(131, plain,![X1]:![X2]:((~(subclass(X1,X2))|![X4]:(~(member(X4,X1))|member(X4,X2)))&(?[X4]:(member(X4,X1)&~(member(X4,X2)))|subclass(X1,X2))),inference(fof_nnf,[status(thm)],[16])).
% fof(132, plain,(![X1]:![X2]:(~(subclass(X1,X2))|![X4]:(~(member(X4,X1))|member(X4,X2)))&![X1]:![X2]:(?[X4]:(member(X4,X1)&~(member(X4,X2)))|subclass(X1,X2))),inference(shift_quantors,[status(thm)],[131])).
% fof(133, plain,(![X5]:![X6]:(~(subclass(X5,X6))|![X7]:(~(member(X7,X5))|member(X7,X6)))&![X8]:![X9]:(?[X10]:(member(X10,X8)&~(member(X10,X9)))|subclass(X8,X9))),inference(variable_rename,[status(thm)],[132])).
% fof(134, plain,(![X5]:![X6]:(~(subclass(X5,X6))|![X7]:(~(member(X7,X5))|member(X7,X6)))&![X8]:![X9]:((member(esk4_2(X8,X9),X8)&~(member(esk4_2(X8,X9),X9)))|subclass(X8,X9))),inference(skolemize,[status(esa)],[133])).
% fof(135, plain,![X5]:![X6]:![X7]:![X8]:![X9]:((~(subclass(X5,X6))|(~(member(X7,X5))|member(X7,X6)))&((member(esk4_2(X8,X9),X8)&~(member(esk4_2(X8,X9),X9)))|subclass(X8,X9))),inference(shift_quantors,[status(thm)],[134])).
% fof(136, plain,![X5]:![X6]:![X7]:![X8]:![X9]:((~(subclass(X5,X6))|(~(member(X7,X5))|member(X7,X6)))&((member(esk4_2(X8,X9),X8)|subclass(X8,X9))&(~(member(esk4_2(X8,X9),X9))|subclass(X8,X9)))),inference(distribute,[status(thm)],[135])).
% cnf(137,plain,(subclass(X1,X2)|~member(esk4_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[136])).
% cnf(138,plain,(subclass(X1,X2)|member(esk4_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[136])).
% cnf(139,plain,(member(X1,X2)|~member(X1,X3)|~subclass(X3,X2)),inference(split_conjunct,[status(thm)],[136])).
% fof(140, plain,![X2]:subclass(X2,universal_class),inference(variable_rename,[status(thm)],[17])).
% cnf(141,plain,(subclass(X1,universal_class)),inference(split_conjunct,[status(thm)],[140])).
% fof(273, negated_conjecture,?[X1]:((~(X1=null_class)&![X2]:~(singleton(X2)=X1))&![X8]:(~(member(X8,X1))|![X9]:(~(member(X9,intersection(complement(singleton(X8)),X1)))|~(member(X9,X1))))),inference(fof_nnf,[status(thm)],[45])).
% fof(274, negated_conjecture,?[X10]:((~(X10=null_class)&![X11]:~(singleton(X11)=X10))&![X12]:(~(member(X12,X10))|![X13]:(~(member(X13,intersection(complement(singleton(X12)),X10)))|~(member(X13,X10))))),inference(variable_rename,[status(thm)],[273])).
% fof(275, negated_conjecture,((~(esk8_0=null_class)&![X11]:~(singleton(X11)=esk8_0))&![X12]:(~(member(X12,esk8_0))|![X13]:(~(member(X13,intersection(complement(singleton(X12)),esk8_0)))|~(member(X13,esk8_0))))),inference(skolemize,[status(esa)],[274])).
% fof(276, negated_conjecture,![X11]:![X12]:![X13]:((~(esk8_0=null_class)&~(singleton(X11)=esk8_0))&(~(member(X12,esk8_0))|(~(member(X13,intersection(complement(singleton(X12)),esk8_0)))|~(member(X13,esk8_0))))),inference(shift_quantors,[status(thm)],[275])).
% cnf(277,negated_conjecture,(~member(X1,esk8_0)|~member(X1,intersection(complement(singleton(X2)),esk8_0))|~member(X2,esk8_0)),inference(split_conjunct,[status(thm)],[276])).
% cnf(278,negated_conjecture,(singleton(X1)!=esk8_0),inference(split_conjunct,[status(thm)],[276])).
% cnf(279,negated_conjecture,(esk8_0!=null_class),inference(split_conjunct,[status(thm)],[276])).
% cnf(286,negated_conjecture,(unordered_pair(X1,X1)!=esk8_0),inference(rw,[status(thm)],[278,67,theory(equality)]),['unfolding']).
% cnf(288,negated_conjecture,(~member(X2,esk8_0)|~member(X1,esk8_0)|~member(X1,intersection(complement(unordered_pair(X2,X2)),esk8_0))),inference(rw,[status(thm)],[277,67,theory(equality)]),['unfolding']).
% cnf(341,plain,(member(esk1_1(intersection(X1,X2)),X1)|null_class=intersection(X1,X2)),inference(spm,[status(thm)],[55,73,theory(equality)])).
% cnf(342,plain,(member(esk1_1(intersection(X1,X2)),X2)|null_class=intersection(X1,X2)),inference(spm,[status(thm)],[54,73,theory(equality)])).
% cnf(350,plain,(subclass(X1,intersection(X2,X3))|~member(esk4_2(X1,intersection(X2,X3)),X3)|~member(esk4_2(X1,intersection(X2,X3)),X2)),inference(spm,[status(thm)],[137,53,theory(equality)])).
% cnf(356,plain,(member(X1,universal_class)|~member(X1,X2)),inference(spm,[status(thm)],[139,141,theory(equality)])).
% cnf(360,negated_conjecture,(~member(X1,intersection(complement(unordered_pair(X2,X2)),esk8_0))|~member(X2,esk8_0)),inference(csr,[status(thm)],[288,54])).
% cnf(362,negated_conjecture,(~member(X2,esk8_0)|~member(X1,esk8_0)|~member(X1,complement(unordered_pair(X2,X2)))),inference(spm,[status(thm)],[360,53,theory(equality)])).
% cnf(410,plain,(esk4_2(unordered_pair(X1,X2),X3)=X1|esk4_2(unordered_pair(X1,X2),X3)=X2|subclass(unordered_pair(X1,X2),X3)),inference(spm,[status(thm)],[117,138,theory(equality)])).
% cnf(416,plain,(member(esk4_2(intersection(X1,X2),X3),X1)|subclass(intersection(X1,X2),X3)),inference(spm,[status(thm)],[55,138,theory(equality)])).
% cnf(683,negated_conjecture,(member(X1,unordered_pair(X2,X2))|~member(X2,esk8_0)|~member(X1,esk8_0)|~member(X1,universal_class)),inference(spm,[status(thm)],[362,63,theory(equality)])).
% cnf(736,plain,(subclass(X1,intersection(X2,X1))|~member(esk4_2(X1,intersection(X2,X1)),X2)),inference(spm,[status(thm)],[350,138,theory(equality)])).
% cnf(2162,plain,(esk4_2(unordered_pair(X4,X5),X6)=X4|subclass(unordered_pair(X4,X5),X6)|X5!=X4),inference(ef,[status(thm)],[410,theory(equality)])).
% cnf(2177,plain,(esk4_2(unordered_pair(X1,X1),X2)=X1|subclass(unordered_pair(X1,X1),X2)),inference(er,[status(thm)],[2162,theory(equality)])).
% cnf(2243,plain,(subclass(intersection(X1,X2),X1)),inference(spm,[status(thm)],[137,416,theory(equality)])).
% cnf(2764,plain,(subclass(X1,intersection(X1,X1))),inference(spm,[status(thm)],[736,138,theory(equality)])).
% cnf(2834,plain,(intersection(X1,X1)=X1|~subclass(intersection(X1,X1),X1)),inference(spm,[status(thm)],[101,2764,theory(equality)])).
% cnf(2845,plain,(intersection(X1,X1)=X1|$false),inference(rw,[status(thm)],[2834,2243,theory(equality)])).
% cnf(2846,plain,(intersection(X1,X1)=X1),inference(cn,[status(thm)],[2845,theory(equality)])).
% cnf(5544,negated_conjecture,(member(X1,unordered_pair(X2,X2))|~member(X2,esk8_0)|~member(X1,esk8_0)),inference(csr,[status(thm)],[683,356])).
% cnf(5554,negated_conjecture,(subclass(X1,unordered_pair(X2,X2))|~member(X2,esk8_0)|~member(esk4_2(X1,unordered_pair(X2,X2)),esk8_0)),inference(spm,[status(thm)],[137,5544,theory(equality)])).
% cnf(5576,negated_conjecture,(X1=X2|~member(X2,esk8_0)|~member(X1,esk8_0)),inference(spm,[status(thm)],[117,5544,theory(equality)])).
% cnf(5605,negated_conjecture,(X1=esk1_1(esk8_0)|null_class=esk8_0|~member(X1,esk8_0)),inference(spm,[status(thm)],[5576,73,theory(equality)])).
% cnf(5609,negated_conjecture,(X1=esk1_1(esk8_0)|~member(X1,esk8_0)),inference(sr,[status(thm)],[5605,279,theory(equality)])).
% cnf(5666,negated_conjecture,(esk1_1(intersection(esk8_0,X1))=esk1_1(esk8_0)|intersection(esk8_0,X1)=null_class),inference(spm,[status(thm)],[5609,341,theory(equality)])).
% cnf(7267,negated_conjecture,(intersection(esk8_0,X1)=null_class|member(esk1_1(esk8_0),X1)),inference(spm,[status(thm)],[342,5666,theory(equality)])).
% cnf(164111,plain,(subclass(unordered_pair(X1,X1),X2)|~member(X1,X2)),inference(spm,[status(thm)],[137,2177,theory(equality)])).
% cnf(164183,plain,(X1=unordered_pair(X2,X2)|~subclass(X1,unordered_pair(X2,X2))|~member(X2,X1)),inference(spm,[status(thm)],[101,164111,theory(equality)])).
% cnf(734787,negated_conjecture,(subclass(esk8_0,unordered_pair(X1,X1))|~member(X1,esk8_0)),inference(spm,[status(thm)],[5554,138,theory(equality)])).
% cnf(734792,negated_conjecture,(esk8_0=unordered_pair(X1,X1)|~member(X1,esk8_0)),inference(spm,[status(thm)],[164183,734787,theory(equality)])).
% cnf(734827,negated_conjecture,(~member(X1,esk8_0)),inference(sr,[status(thm)],[734792,286,theory(equality)])).
% cnf(735073,negated_conjecture,(intersection(esk8_0,esk8_0)=null_class),inference(spm,[status(thm)],[734827,7267,theory(equality)])).
% cnf(735143,negated_conjecture,(esk8_0=null_class),inference(rw,[status(thm)],[735073,2846,theory(equality)])).
% cnf(735144,negated_conjecture,($false),inference(sr,[status(thm)],[735143,279,theory(equality)])).
% cnf(735145,negated_conjecture,($false),735144,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 28.27 CPU 18.86 WC
% FINAL PrfWatch: 28.27 CPU 18.86 WC
% SZS output end Solution for /tmp/SystemOnTPTP12643/SET098+1.tptp
%
%------------------------------------------------------------------------------