TSTP Solution File: SET097+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET097+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 : appomattox.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:08 EDT 2012
% Result : Theorem 27.83s
% Output : Solution 27.83s
% 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/SystemOnTPTP18172/SET097+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP18172/SET097+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP18172/SET097+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 18270
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% PrfWatch: 3.19 CPU 2.01 WC
% PrfWatch: 6.42 CPU 4.02 WC
% PrfWatch: 9.58 CPU 6.02 WC
% PrfWatch: 13.01 CPU 8.03 WC
% PrfWatch: 15.97 CPU 10.04 WC
% PrfWatch: 19.02 CPU 12.05 WC
% PrfWatch: 21.70 CPU 14.05 WC
% PrfWatch: 24.48 CPU 16.06 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 : 15892
% # ...of these trivial : 36
% # ...subsumed : 12876
% # ...remaining for further processing: 2980
% # Other redundant clauses eliminated : 82
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 49
% # Backward-rewritten : 277
% # Generated clauses : 549024
% # ...of the previous two non-trivial : 509916
% # Contextual simplify-reflections : 2432
% # Paramodulations : 548459
% # Factorizations : 480
% # Equation resolutions : 84
% # Current number of processed clauses: 2649
% # Positive orientable unit clauses: 81
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 65
% # Non-unit-clauses : 2502
% # Current number of unprocessed clauses: 447877
% # ...number of literals in the above : 2062335
% # Clause-clause subsumption calls (NU) : 2203728
% # Rec. Clause-clause subsumption calls : 1335894
% # Non-unit clause-clause subsumptions: 7190
% # Unit Clause-clause subsumption calls : 52981
% # Rewrite failures with RHS unbound : 0
% # BW rewrite match attempts : 725
% # BW rewrite match successes : 501
% # Backwards rewriting index : 9407 nodes, 2510 leaves, 2.54+/-6.460 terms/leaf
% # Paramod-from index : 2356 nodes, 582 leaves, 2.42+/-4.433 terms/leaf
% # Paramod-into index : 5783 nodes, 1500 leaves, 2.51+/-6.063 terms/leaf
% # Paramod-neg-atom index : 1650 nodes, 409 leaves, 2.24+/-2.702 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)))),file('/tmp/SRASS.s.p', 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))))),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))))),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))))),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))))),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))))),inference(shift_quantors,[status(thm)],[275])).
% cnf(277,negated_conjecture,(~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,intersection(complement(unordered_pair(X2,X2)),esk8_0))),inference(rw,[status(thm)],[277,67,theory(equality)]),['unfolding']).
% cnf(342,plain,(member(esk1_1(intersection(X1,X2)),X1)|null_class=intersection(X1,X2)),inference(spm,[status(thm)],[55,73,theory(equality)])).
% cnf(343,plain,(member(esk1_1(intersection(X1,X2)),X2)|null_class=intersection(X1,X2)),inference(spm,[status(thm)],[54,73,theory(equality)])).
% cnf(349,negated_conjecture,(~member(X2,esk8_0)|~member(X1,esk8_0)|~member(X1,complement(unordered_pair(X2,X2)))),inference(spm,[status(thm)],[288,53,theory(equality)])).
% cnf(352,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(358,plain,(member(X1,universal_class)|~member(X1,X2)),inference(spm,[status(thm)],[139,141,theory(equality)])).
% cnf(409,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(415,plain,(member(esk4_2(intersectio
% PrfWatch: 27.43 CPU 18.07 WC
% n(X1,X2),X3),X1)|subclass(intersection(X1,X2),X3)),inference(spm,[status(thm)],[55,138,theory(equality)])).
% cnf(684,negated_conjecture,(member(X1,unordered_pair(X2,X2))|~member(X2,esk8_0)|~member(X1,esk8_0)|~member(X1,universal_class)),inference(spm,[status(thm)],[349,63,theory(equality)])).
% cnf(748,plain,(subclass(X1,intersection(X2,X1))|~member(esk4_2(X1,intersection(X2,X1)),X2)),inference(spm,[status(thm)],[352,138,theory(equality)])).
% cnf(2187,plain,(esk4_2(unordered_pair(X4,X5),X6)=X4|subclass(unordered_pair(X4,X5),X6)|X5!=X4),inference(ef,[status(thm)],[409,theory(equality)])).
% cnf(2202,plain,(esk4_2(unordered_pair(X1,X1),X2)=X1|subclass(unordered_pair(X1,X1),X2)),inference(er,[status(thm)],[2187,theory(equality)])).
% cnf(2268,plain,(subclass(intersection(X1,X2),X1)),inference(spm,[status(thm)],[137,415,theory(equality)])).
% cnf(2741,plain,(subclass(X1,intersection(X1,X1))),inference(spm,[status(thm)],[748,138,theory(equality)])).
% cnf(2744,plain,(intersection(X1,X1)=X1|~subclass(intersection(X1,X1),X1)),inference(spm,[status(thm)],[101,2741,theory(equality)])).
% cnf(2755,plain,(intersection(X1,X1)=X1|$false),inference(rw,[status(thm)],[2744,2268,theory(equality)])).
% cnf(2756,plain,(intersection(X1,X1)=X1),inference(cn,[status(thm)],[2755,theory(equality)])).
% cnf(5471,negated_conjecture,(member(X1,unordered_pair(X2,X2))|~member(X2,esk8_0)|~member(X1,esk8_0)),inference(csr,[status(thm)],[684,358])).
% cnf(5481,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,5471,theory(equality)])).
% cnf(5503,negated_conjecture,(X1=X2|~member(X2,esk8_0)|~member(X1,esk8_0)),inference(spm,[status(thm)],[117,5471,theory(equality)])).
% cnf(5532,negated_conjecture,(X1=esk1_1(esk8_0)|null_class=esk8_0|~member(X1,esk8_0)),inference(spm,[status(thm)],[5503,73,theory(equality)])).
% cnf(5535,negated_conjecture,(X1=esk1_1(esk8_0)|~member(X1,esk8_0)),inference(sr,[status(thm)],[5532,279,theory(equality)])).
% cnf(5630,negated_conjecture,(esk1_1(intersection(esk8_0,X1))=esk1_1(esk8_0)|intersection(esk8_0,X1)=null_class),inference(spm,[status(thm)],[5535,342,theory(equality)])).
% cnf(7266,negated_conjecture,(intersection(esk8_0,X1)=null_class|member(esk1_1(esk8_0),X1)),inference(spm,[status(thm)],[343,5630,theory(equality)])).
% cnf(164947,plain,(subclass(unordered_pair(X1,X1),X2)|~member(X1,X2)),inference(spm,[status(thm)],[137,2202,theory(equality)])).
% cnf(165020,plain,(X1=unordered_pair(X2,X2)|~subclass(X1,unordered_pair(X2,X2))|~member(X2,X1)),inference(spm,[status(thm)],[101,164947,theory(equality)])).
% cnf(711699,negated_conjecture,(subclass(esk8_0,unordered_pair(X1,X1))|~member(X1,esk8_0)),inference(spm,[status(thm)],[5481,138,theory(equality)])).
% cnf(711729,negated_conjecture,(esk8_0=unordered_pair(X1,X1)|~member(X1,esk8_0)),inference(spm,[status(thm)],[165020,711699,theory(equality)])).
% cnf(711764,negated_conjecture,(~member(X1,esk8_0)),inference(sr,[status(thm)],[711729,286,theory(equality)])).
% cnf(712008,negated_conjecture,(intersection(esk8_0,esk8_0)=null_class),inference(spm,[status(thm)],[711764,7266,theory(equality)])).
% cnf(712075,negated_conjecture,(esk8_0=null_class),inference(rw,[status(thm)],[712008,2756,theory(equality)])).
% cnf(712076,negated_conjecture,($false),inference(sr,[status(thm)],[712075,279,theory(equality)])).
% cnf(712077,negated_conjecture,($false),712076,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 27.46 CPU 18.11 WC
% FINAL PrfWatch: 27.46 CPU 18.11 WC
% SZS output end Solution for /tmp/SystemOnTPTP18172/SET097+1.tptp
%
%------------------------------------------------------------------------------