TSTP Solution File: SET018+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET018+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 : richmond.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:04:21 EDT 2012
% Result : Theorem 0.75s
% Output : Solution 0.75s
% 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/SystemOnTPTP19513/SET018+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP19513/SET018+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP19513/SET018+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 19611
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Auto-Ordering is analysing problem.
% # Problem is type GHSMNFFMM21MD
% # Auto-mode selected ordering type KBO6
% # Auto-mode selected ordering precedence scheme <invfreqconjmax>
% # Auto-mode selected weight ordering scheme <invfreqrank>
% #
% # Auto-Heuristic is analysing problem.
% # Problem is type GHSMNFFMM21MD
% # Auto-Mode selected heuristic G_E___107_C45_F1_PI_AE_Q4_CS_SP_S0Y
% # and selection function SelectMaxLComplexAvoidPosPred.
% #
% # Initializing proof state
% # Scanning for AC axioms
% # 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 : 1613
% # ...of these trivial : 16
% # ...subsumed : 968
% # ...remaining for further processing: 629
% # Other redundant clauses eliminated : 15
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 107
% # Backward-rewritten : 134
% # Generated clauses : 10477
% # ...of the previous two non-trivial : 10013
% # Contextual simplify-reflections : 457
% # Paramodulations : 10437
% # Factorizations : 18
% # Equation resolutions : 17
% # Current number of processed clauses: 382
% # Positive orientable unit clauses: 48
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 14
% # Non-unit-clauses : 320
% # Current number of unprocessed clauses: 3819
% # ...number of literals in the above : 13539
% # Clause-clause subsumption calls (NU) : 87930
% # Rec. Clause-clause subsumption calls : 59711
% # Non-unit clause-clause subsumptions: 1239
% # Unit Clause-clause subsumption calls : 1971
% # Rewrite failures with RHS unbound : 0
% # BW rewrite match attempts : 49
% # BW rewrite match successes : 20
% # Backwards rewriting index : 2388 nodes, 483 leaves, 1.75+/-2.537 terms/leaf
% # Paramod-from index : 783 nodes, 150 leaves, 1.22+/-0.729 terms/leaf
% # Paramod-into index : 1637 nodes, 316 leaves, 1.77+/-2.778 terms/leaf
% # Paramod-neg-atom index : 459 nodes, 92 leaves, 1.39+/-0.896 terms/leaf
% # SZS output start CNFRefutation.
% fof(2, axiom,![X3]:![X4]:![X2]:![X5]:(member(ordered_pair(X3,X4),cross_product(X2,X5))<=>(member(X3,X2)&member(X4,X5))),file('/tmp/SRASS.s.p', cross_product_defn)).
% fof(4, axiom,![X3]:![X2]:![X5]:(member(X3,unordered_pair(X2,X5))<=>(member(X3,universal_class)&(X3=X2|X3=X5))),file('/tmp/SRASS.s.p', unordered_pair_defn)).
% fof(5, axiom,![X2]:![X5]:((member(X2,universal_class)&member(X5,universal_class))=>(first(ordered_pair(X2,X5))=X2&second(ordered_pair(X2,X5))=X5)),file('/tmp/SRASS.s.p', first_second)).
% fof(7, axiom,![X3]:![X2]:(member(X3,sum_class(X2))<=>?[X5]:(member(X3,X5)&member(X5,X2))),file('/tmp/SRASS.s.p', sum_class_defn)).
% fof(8, axiom,![X2]:![X5]:(disjoint(X2,X5)<=>![X3]:~((member(X3,X2)&member(X3,X5)))),file('/tmp/SRASS.s.p', disjoint_defn)).
% fof(12, axiom,![X2]:![X5]:member(unordered_pair(X2,X5),universal_class),file('/tmp/SRASS.s.p', unordered_pair)).
% fof(13, axiom,![X2]:![X5]:ordered_pair(X2,X5)=unordered_pair(singleton(X2),unordered_pair(X2,singleton(X5))),file('/tmp/SRASS.s.p', ordered_pair_defn)).
% fof(16, axiom,![X2]:![X1]:(member(X1,complement(X2))<=>(member(X1,universal_class)&~(member(X1,X2)))),file('/tmp/SRASS.s.p', complement)).
% fof(17, axiom,![X2]:(~(X2=null_class)=>?[X3]:((member(X3,universal_class)&member(X3,X2))&disjoint(X3,X2))),file('/tmp/SRASS.s.p', regularity)).
% fof(22, axiom,![X2]:![X5]:(subclass(X2,X5)<=>![X3]:(member(X3,X2)=>member(X3,X5))),file('/tmp/SRASS.s.p', subclass_defn)).
% fof(23, axiom,![X2]:subclass(X2,universal_class),file('/tmp/SRASS.s.p', class_elements_are_sets)).
% fof(25, axiom,![X2]:singleton(X2)=unordered_pair(X2,X2),file('/tmp/SRASS.s.p', singleton_set_defn)).
% fof(28, axiom,![X2]:~(member(X2,null_class)),file('/tmp/SRASS.s.p', null_class_defn)).
% fof(31, axiom,![X2]:![X5]:![X1]:(member(X1,union(X2,X5))<=>(member(X1,X2)|member(X1,X5))),file('/tmp/SRASS.s.p', union_defn)).
% fof(44, conjecture,![X6]:![X2]:![X5]:![X1]:((ordered_pair(X6,X2)=ordered_pair(X5,X1)&member(X2,universal_class))=>X2=X1),file('/tmp/SRASS.s.p', ordered_pair_determines_components2)).
% fof(45, negated_conjecture,~(![X6]:![X2]:![X5]:![X1]:((ordered_pair(X6,X2)=ordered_pair(X5,X1)&member(X2,universal_class))=>X2=X1)),inference(assume_negation,[status(cth)],[44])).
% fof(46, plain,![X2]:![X1]:(member(X1,complement(X2))<=>(member(X1,universal_class)&~(member(X1,X2)))),inference(fof_simplification,[status(thm)],[16,theory(equality)])).
% fof(47, plain,![X2]:~(member(X2,null_class)),inference(fof_simplification,[status(thm)],[28,theory(equality)])).
% fof(57, plain,![X3]:![X4]:![X2]:![X5]:((~(member(ordered_pair(X3,X4),cross_product(X2,X5)))|(member(X3,X2)&member(X4,X5)))&((~(member(X3,X2))|~(member(X4,X5)))|member(ordered_pair(X3,X4),cross_product(X2,X5)))),inference(fof_nnf,[status(thm)],[2])).
% fof(58, plain,(![X3]:![X4]:![X2]:![X5]:(~(member(ordered_pair(X3,X4),cross_product(X2,X5)))|(member(X3,X2)&member(X4,X5)))&![X3]:![X4]:![X2]:![X5]:((~(member(X3,X2))|~(member(X4,X5)))|member(ordered_pair(X3,X4),cross_product(X2,X5)))),inference(shift_quantors,[status(thm)],[57])).
% fof(59, plain,(![X6]:![X7]:![X8]:![X9]:(~(member(ordered_pair(X6,X7),cross_product(X8,X9)))|(member(X6,X8)&member(X7,X9)))&![X10]:![X11]:![X12]:![X13]:((~(member(X10,X12))|~(member(X11,X13)))|member(ordered_pair(X10,X11),cross_product(X12,X13)))),inference(variable_rename,[status(thm)],[58])).
% fof(60, plain,![X6]:![X7]:![X8]:![X9]:![X10]:![X11]:![X12]:![X13]:((~(member(ordered_pair(X6,X7),cross_product(X8,X9)))|(member(X6,X8)&member(X7,X9)))&((~(member(X10,X12))|~(member(X11,X13)))|member(ordered_pair(X10,X11),cross_product(X12,X13)))),inference(shift_quantors,[status(thm)],[59])).
% fof(61, plain,![X6]:![X7]:![X8]:![X9]:![X10]:![X11]:![X12]:![X13]:(((member(X6,X8)|~(member(ordered_pair(X6,X7),cross_product(X8,X9))))&(member(X7,X9)|~(member(ordered_pair(X6,X7),cross_product(X8,X9)))))&((~(member(X10,X12))|~(member(X11,X13)))|member(ordered_pair(X10,X11),cross_product(X12,X13)))),inference(distribute,[status(thm)],[60])).
% cnf(62,plain,(member(ordered_pair(X1,X2),cross_product(X3,X4))|~member(X2,X4)|~member(X1,X3)),inference(split_conjunct,[status(thm)],[61])).
% cnf(63,plain,(member(X2,X4)|~member(ordered_pair(X1,X2),cross_product(X3,X4))),inference(split_conjunct,[status(thm)],[61])).
% cnf(64,plain,(member(X1,X3)|~member(ordered_pair(X1,X2),cross_product(X3,X4))),inference(split_conjunct,[status(thm)],[61])).
% fof(73, plain,![X3]:![X2]:![X5]:((~(member(X3,unordered_pair(X2,X5)))|(member(X3,universal_class)&(X3=X2|X3=X5)))&((~(member(X3,universal_class))|(~(X3=X2)&~(X3=X5)))|member(X3,unordered_pair(X2,X5)))),inference(fof_nnf,[status(thm)],[4])).
% fof(74, plain,(![X3]:![X2]:![X5]:(~(member(X3,unordered_pair(X2,X5)))|(member(X3,universal_class)&(X3=X2|X3=X5)))&![X3]:![X2]:![X5]:((~(member(X3,universal_class))|(~(X3=X2)&~(X3=X5)))|member(X3,unordered_pair(X2,X5)))),inference(shift_quantors,[status(thm)],[73])).
% fof(75, plain,(![X6]:![X7]:![X8]:(~(member(X6,unordered_pair(X7,X8)))|(member(X6,universal_class)&(X6=X7|X6=X8)))&![X9]:![X10]:![X11]:((~(member(X9,universal_class))|(~(X9=X10)&~(X9=X11)))|member(X9,unordered_pair(X10,X11)))),inference(variable_rename,[status(thm)],[74])).
% fof(76, plain,![X6]:![X7]:![X8]:![X9]:![X10]:![X11]:((~(member(X6,unordered_pair(X7,X8)))|(member(X6,universal_class)&(X6=X7|X6=X8)))&((~(member(X9,universal_class))|(~(X9=X10)&~(X9=X11)))|member(X9,unordered_pair(X10,X11)))),inference(shift_quantors,[status(thm)],[75])).
% fof(77, plain,![X6]:![X7]:![X8]:![X9]:![X10]:![X11]:(((member(X6,universal_class)|~(member(X6,unordered_pair(X7,X8))))&((X6=X7|X6=X8)|~(member(X6,unordered_pair(X7,X8)))))&(((~(X9=X10)|~(member(X9,universal_class)))|member(X9,unordered_pair(X10,X11)))&((~(X9=X11)|~(member(X9,universal_class)))|member(X9,unordered_pair(X10,X11))))),inference(distribute,[status(thm)],[76])).
% cnf(78,plain,(member(X1,unordered_pair(X2,X3))|~member(X1,universal_class)|X1!=X3),inference(split_conjunct,[status(thm)],[77])).
% cnf(79,plain,(member(X1,unordered_pair(X2,X3))|~member(X1,universal_class)|X1!=X2),inference(split_conjunct,[status(thm)],[77])).
% cnf(80,plain,(X1=X3|X1=X2|~member(X1,unordered_pair(X2,X3))),inference(split_conjunct,[status(thm)],[77])).
% fof(82, plain,![X2]:![X5]:((~(member(X2,universal_class))|~(member(X5,universal_class)))|(first(ordered_pair(X2,X5))=X2&second(ordered_pair(X2,X5))=X5)),inference(fof_nnf,[status(thm)],[5])).
% fof(83, plain,![X6]:![X7]:((~(member(X6,universal_class))|~(member(X7,universal_class)))|(first(ordered_pair(X6,X7))=X6&second(ordered_pair(X6,X7))=X7)),inference(variable_rename,[status(thm)],[82])).
% fof(84, plain,![X6]:![X7]:((first(ordered_pair(X6,X7))=X6|(~(member(X6,universal_class))|~(member(X7,universal_class))))&(second(ordered_pair(X6,X7))=X7|(~(member(X6,universal_class))|~(member(X7,universal_class))))),inference(distribute,[status(thm)],[83])).
% cnf(85,plain,(second(ordered_pair(X2,X1))=X1|~member(X1,universal_class)|~member(X2,universal_class)),inference(split_conjunct,[status(thm)],[84])).
% fof(96, plain,![X3]:![X2]:((~(member(X3,sum_class(X2)))|?[X5]:(member(X3,X5)&member(X5,X2)))&(![X5]:(~(member(X3,X5))|~(member(X5,X2)))|member(X3,sum_class(X2)))),inference(fof_nnf,[status(thm)],[7])).
% fof(97, plain,(![X3]:![X2]:(~(member(X3,sum_class(X2)))|?[X5]:(member(X3,X5)&member(X5,X2)))&![X3]:![X2]:(![X5]:(~(member(X3,X5))|~(member(X5,X2)))|member(X3,sum_class(X2)))),inference(shift_quantors,[status(thm)],[96])).
% fof(98, plain,(![X6]:![X7]:(~(member(X6,sum_class(X7)))|?[X8]:(member(X6,X8)&member(X8,X7)))&![X9]:![X10]:(![X11]:(~(member(X9,X11))|~(member(X11,X10)))|member(X9,sum_class(X10)))),inference(variable_rename,[status(thm)],[97])).
% fof(99, plain,(![X6]:![X7]:(~(member(X6,sum_class(X7)))|(member(X6,esk2_2(X6,X7))&member(esk2_2(X6,X7),X7)))&![X9]:![X10]:(![X11]:(~(member(X9,X11))|~(member(X11,X10)))|member(X9,sum_class(X10)))),inference(skolemize,[status(esa)],[98])).
% fof(100, plain,![X6]:![X7]:![X9]:![X10]:![X11]:((~(member(X6,sum_class(X7)))|(member(X6,esk2_2(X6,X7))&member(esk2_2(X6,X7),X7)))&((~(member(X9,X11))|~(member(X11,X10)))|member(X9,sum_class(X10)))),inference(shift_quantors,[status(thm)],[99])).
% fof(101, plain,![X6]:![X7]:![X9]:![X10]:![X11]:(((member(X6,esk2_2(X6,X7))|~(member(X6,sum_class(X7))))&(member(esk2_2(X6,X7),X7)|~(member(X6,sum_class(X7)))))&((~(member(X9,X11))|~(member(X11,X10)))|member(X9,sum_class(X10)))),inference(distribute,[status(thm)],[100])).
% cnf(102,plain,(member(X1,sum_class(X2))|~member(X3,X2)|~member(X1,X3)),inference(split_conjunct,[status(thm)],[101])).
% fof(105, plain,![X2]:![X5]:((~(disjoint(X2,X5))|![X3]:(~(member(X3,X2))|~(member(X3,X5))))&(?[X3]:(member(X3,X2)&member(X3,X5))|disjoint(X2,X5))),inference(fof_nnf,[status(thm)],[8])).
% fof(106, plain,(![X2]:![X5]:(~(disjoint(X2,X5))|![X3]:(~(member(X3,X2))|~(member(X3,X5))))&![X2]:![X5]:(?[X3]:(member(X3,X2)&member(X3,X5))|disjoint(X2,X5))),inference(shift_quantors,[status(thm)],[105])).
% fof(107, plain,(![X6]:![X7]:(~(disjoint(X6,X7))|![X8]:(~(member(X8,X6))|~(member(X8,X7))))&![X9]:![X10]:(?[X11]:(member(X11,X9)&member(X11,X10))|disjoint(X9,X10))),inference(variable_rename,[status(thm)],[106])).
% fof(108, plain,(![X6]:![X7]:(~(disjoint(X6,X7))|![X8]:(~(member(X8,X6))|~(member(X8,X7))))&![X9]:![X10]:((member(esk3_2(X9,X10),X9)&member(esk3_2(X9,X10),X10))|disjoint(X9,X10))),inference(skolemize,[status(esa)],[107])).
% fof(109, plain,![X6]:![X7]:![X8]:![X9]:![X10]:((~(disjoint(X6,X7))|(~(member(X8,X6))|~(member(X8,X7))))&((member(esk3_2(X9,X10),X9)&member(esk3_2(X9,X10),X10))|disjoint(X9,X10))),inference(shift_quantors,[status(thm)],[108])).
% fof(110, plain,![X6]:![X7]:![X8]:![X9]:![X10]:((~(disjoint(X6,X7))|(~(member(X8,X6))|~(member(X8,X7))))&((member(esk3_2(X9,X10),X9)|disjoint(X9,X10))&(member(esk3_2(X9,X10),X10)|disjoint(X9,X10)))),inference(distribute,[status(thm)],[109])).
% cnf(113,plain,(~member(X1,X2)|~member(X1,X3)|~disjoint(X3,X2)),inference(split_conjunct,[status(thm)],[110])).
% fof(138, plain,![X6]:![X7]:member(unordered_pair(X6,X7),universal_class),inference(variable_rename,[status(thm)],[12])).
% cnf(139,plain,(member(unordered_pair(X1,X2),universal_class)),inference(split_conjunct,[status(thm)],[138])).
% fof(140, plain,![X6]:![X7]:ordered_pair(X6,X7)=unordered_pair(singleton(X6),unordered_pair(X6,singleton(X7))),inference(variable_rename,[status(thm)],[13])).
% cnf(141,plain,(ordered_pair(X1,X2)=unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2)))),inference(split_conjunct,[status(thm)],[140])).
% fof(148, plain,![X2]:![X1]:((~(member(X1,complement(X2)))|(member(X1,universal_class)&~(member(X1,X2))))&((~(member(X1,universal_class))|member(X1,X2))|member(X1,complement(X2)))),inference(fof_nnf,[status(thm)],[46])).
% fof(149, plain,(![X2]:![X1]:(~(member(X1,complement(X2)))|(member(X1,universal_class)&~(member(X1,X2))))&![X2]:![X1]:((~(member(X1,universal_class))|member(X1,X2))|member(X1,complement(X2)))),inference(shift_quantors,[status(thm)],[148])).
% fof(150, plain,(![X3]:![X4]:(~(member(X4,complement(X3)))|(member(X4,universal_class)&~(member(X4,X3))))&![X5]:![X6]:((~(member(X6,universal_class))|member(X6,X5))|member(X6,complement(X5)))),inference(variable_rename,[status(thm)],[149])).
% fof(151, plain,![X3]:![X4]:![X5]:![X6]:((~(member(X4,complement(X3)))|(member(X4,universal_class)&~(member(X4,X3))))&((~(member(X6,universal_class))|member(X6,X5))|member(X6,complement(X5)))),inference(shift_quantors,[status(thm)],[150])).
% fof(152, plain,![X3]:![X4]:![X5]:![X6]:(((member(X4,universal_class)|~(member(X4,complement(X3))))&(~(member(X4,X3))|~(member(X4,complement(X3)))))&((~(member(X6,universal_class))|member(X6,X5))|member(X6,complement(X5)))),inference(distribute,[status(thm)],[151])).
% cnf(153,plain,(member(X1,complement(X2))|member(X1,X2)|~member(X1,universal_class)),inference(split_conjunct,[status(thm)],[152])).
% cnf(154,plain,(~member(X1,complement(X2))|~member(X1,X2)),inference(split_conjunct,[status(thm)],[152])).
% fof(156, plain,![X2]:(X2=null_class|?[X3]:((member(X3,universal_class)&member(X3,X2))&disjoint(X3,X2))),inference(fof_nnf,[status(thm)],[17])).
% fof(157, plain,![X4]:(X4=null_class|?[X5]:((member(X5,universal_class)&member(X5,X4))&disjoint(X5,X4))),inference(variable_rename,[status(thm)],[156])).
% fof(158, plain,![X4]:(X4=null_class|((member(esk4_1(X4),universal_class)&member(esk4_1(X4),X4))&disjoint(esk4_1(X4),X4))),inference(skolemize,[status(esa)],[157])).
% fof(159, plain,![X4]:(((member(esk4_1(X4),universal_class)|X4=null_class)&(member(esk4_1(X4),X4)|X4=null_class))&(disjoint(esk4_1(X4),X4)|X4=null_class)),inference(distribute,[status(thm)],[158])).
% cnf(160,plain,(X1=null_class|disjoint(esk4_1(X1),X1)),inference(split_conjunct,[status(thm)],[159])).
% cnf(161,plain,(X1=null_class|member(esk4_1(X1),X1)),inference(split_conjunct,[status(thm)],[159])).
% cnf(162,plain,(X1=null_class|member(esk4_1(X1),universal_class)),inference(split_conjunct,[status(thm)],[159])).
% fof(178, plain,![X2]:![X5]:((~(subclass(X2,X5))|![X3]:(~(member(X3,X2))|member(X3,X5)))&(?[X3]:(member(X3,X2)&~(member(X3,X5)))|subclass(X2,X5))),inference(fof_nnf,[status(thm)],[22])).
% fof(179, plain,(![X2]:![X5]:(~(subclass(X2,X5))|![X3]:(~(member(X3,X2))|member(X3,X5)))&![X2]:![X5]:(?[X3]:(member(X3,X2)&~(member(X3,X5)))|subclass(X2,X5))),inference(shift_quantors,[status(thm)],[178])).
% fof(180, plain,(![X6]:![X7]:(~(subclass(X6,X7))|![X8]:(~(member(X8,X6))|member(X8,X7)))&![X9]:![X10]:(?[X11]:(member(X11,X9)&~(member(X11,X10)))|subclass(X9,X10))),inference(variable_rename,[status(thm)],[179])).
% fof(181, plain,(![X6]:![X7]:(~(subclass(X6,X7))|![X8]:(~(member(X8,X6))|member(X8,X7)))&![X9]:![X10]:((member(esk5_2(X9,X10),X9)&~(member(esk5_2(X9,X10),X10)))|subclass(X9,X10))),inference(skolemize,[status(esa)],[180])).
% fof(182, plain,![X6]:![X7]:![X8]:![X9]:![X10]:((~(subclass(X6,X7))|(~(member(X8,X6))|member(X8,X7)))&((member(esk5_2(X9,X10),X9)&~(member(esk5_2(X9,X10),X10)))|subclass(X9,X10))),inference(shift_quantors,[status(thm)],[181])).
% fof(183, plain,![X6]:![X7]:![X8]:![X9]:![X10]:((~(subclass(X6,X7))|(~(member(X8,X6))|member(X8,X7)))&((member(esk5_2(X9,X10),X9)|subclass(X9,X10))&(~(member(esk5_2(X9,X10),X10))|subclass(X9,X10)))),inference(distribute,[status(thm)],[182])).
% cnf(186,plain,(member(X1,X2)|~member(X1,X3)|~subclass(X3,X2)),inference(split_conjunct,[status(thm)],[183])).
% fof(187, plain,![X3]:subclass(X3,universal_class),inference(variable_rename,[status(thm)],[23])).
% cnf(188,plain,(subclass(X1,universal_class)),inference(split_conjunct,[status(thm)],[187])).
% fof(195, plain,![X3]:singleton(X3)=unordered_pair(X3,X3),inference(variable_rename,[status(thm)],[25])).
% cnf(196,plain,(singleton(X1)=unordered_pair(X1,X1)),inference(split_conjunct,[status(thm)],[195])).
% fof(212, plain,![X3]:~(member(X3,null_class)),inference(variable_rename,[status(thm)],[47])).
% cnf(213,plain,(~member(X1,null_class)),inference(split_conjunct,[status(thm)],[212])).
% fof(225, plain,![X2]:![X5]:![X1]:((~(member(X1,union(X2,X5)))|(member(X1,X2)|member(X1,X5)))&((~(member(X1,X2))&~(member(X1,X5)))|member(X1,union(X2,X5)))),inference(fof_nnf,[status(thm)],[31])).
% fof(226, plain,(![X2]:![X5]:![X1]:(~(member(X1,union(X2,X5)))|(member(X1,X2)|member(X1,X5)))&![X2]:![X5]:![X1]:((~(member(X1,X2))&~(member(X1,X5)))|member(X1,union(X2,X5)))),inference(shift_quantors,[status(thm)],[225])).
% fof(227, plain,(![X6]:![X7]:![X8]:(~(member(X8,union(X6,X7)))|(member(X8,X6)|member(X8,X7)))&![X9]:![X10]:![X11]:((~(member(X11,X9))&~(member(X11,X10)))|member(X11,union(X9,X10)))),inference(variable_rename,[status(thm)],[226])).
% fof(228, plain,![X6]:![X7]:![X8]:![X9]:![X10]:![X11]:((~(member(X8,union(X6,X7)))|(member(X8,X6)|member(X8,X7)))&((~(member(X11,X9))&~(member(X11,X10)))|member(X11,union(X9,X10)))),inference(shift_quantors,[status(thm)],[227])).
% fof(229, plain,![X6]:![X7]:![X8]:![X9]:![X10]:![X11]:((~(member(X8,union(X6,X7)))|(member(X8,X6)|member(X8,X7)))&((~(member(X11,X9))|member(X11,union(X9,X10)))&(~(member(X11,X10))|member(X11,union(X9,X10))))),inference(distribute,[status(thm)],[228])).
% cnf(230,plain,(member(X1,union(X2,X3))|~member(X1,X3)),inference(split_conjunct,[status(thm)],[229])).
% fof(273, negated_conjecture,?[X6]:?[X2]:?[X5]:?[X1]:((ordered_pair(X6,X2)=ordered_pair(X5,X1)&member(X2,universal_class))&~(X2=X1)),inference(fof_nnf,[status(thm)],[45])).
% fof(274, negated_conjecture,?[X7]:?[X8]:?[X9]:?[X10]:((ordered_pair(X7,X8)=ordered_pair(X9,X10)&member(X8,universal_class))&~(X8=X10)),inference(variable_rename,[status(thm)],[273])).
% fof(275, negated_conjecture,((ordered_pair(esk8_0,esk9_0)=ordered_pair(esk10_0,esk11_0)&member(esk9_0,universal_class))&~(esk9_0=esk11_0)),inference(skolemize,[status(esa)],[274])).
% cnf(276,negated_conjecture,(esk9_0!=esk11_0),inference(split_conjunct,[status(thm)],[275])).
% cnf(277,negated_conjecture,(member(esk9_0,universal_class)),inference(split_conjunct,[status(thm)],[275])).
% cnf(278,negated_conjecture,(ordered_pair(esk8_0,esk9_0)=ordered_pair(esk10_0,esk11_0)),inference(split_conjunct,[status(thm)],[275])).
% cnf(281,plain,(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2)))=ordered_pair(X1,X2)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[141,196,theory(equality)]),196,theory(equality)]),['unfolding']).
% cnf(307,negated_conjecture,(unordered_pair(unordered_pair(esk10_0,esk10_0),unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0)))=unordered_pair(unordered_pair(esk8_0,esk8_0),unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[278,281,theory(equality)]),281,theory(equality)]),['unfolding']).
% cnf(315,plain,(member(X2,X4)|~member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))),cross_product(X3,X4))),inference(rw,[status(thm)],[63,281,theory(equality)]),['unfolding']).
% cnf(316,plain,(member(X1,X3)|~member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))),cross_product(X3,X4))),inference(rw,[status(thm)],[64,281,theory(equality)]),['unfolding']).
% cnf(325,plain,(second(unordered_pair(unordered_pair(X2,X2),unordered_pair(X2,unordered_pair(X1,X1))))=X1|~member(X2,universal_class)|~member(X1,universal_class)),inference(rw,[status(thm)],[85,281,theory(equality)]),['unfolding']).
% cnf(327,plain,(member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))),cross_product(X3,X4))|~member(X2,X4)|~member(X1,X3)),inference(rw,[status(thm)],[62,281,theory(equality)]),['unfolding']).
% cnf(341,plain,(member(X1,unordered_pair(X2,X1))|~member(X1,universal_class)),inference(er,[status(thm)],[78,theory(equality)])).
% cnf(342,plain,(member(X1,unordered_pair(X1,X2))|~member(X1,universal_class)),inference(er,[status(thm)],[79,theory(equality)])).
% cnf(343,plain,(esk4_1(unordered_pair(X1,X2))=X1|esk4_1(unordered_pair(X1,X2))=X2|null_class=unordered_pair(X1,X2)),inference(spm,[status(thm)],[80,161,theory(equality)])).
% cnf(389,negated_conjecture,(X1=unordered_pair(esk8_0,esk8_0)|X1=unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0))|~member(X1,unordered_pair(unordered_pair(esk10_0,esk10_0),unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0))))),inference(spm,[status(thm)],[80,307,theory(equality)])).
% cnf(397,plain,(member(X1,universal_class)|~member(X1,X2)),inference(spm,[status(thm)],[186,188,theory(equality)])).
% cnf(432,plain,(member(X1,sum_class(universal_class))|~member(X1,unordered_pair(X2,X3))),inference(spm,[status(thm)],[102,139,theory(equality)])).
% cnf(445,plain,(null_class=X1|~member(X2,esk4_1(X1))|~member(X2,X1)),inference(spm,[status(thm)],[113,160,theory(equality)])).
% cnf(458,negated_conjecture,(second(unordered_pair(unordered_pair(esk10_0,esk10_0),unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0))))=esk9_0|~member(esk8_0,universal_class)|~member(esk9_0,universal_class)),inference(spm,[status(thm)],[325,307,theory(equality)])).
% cnf(459,negated_conjecture,(second(unordered_pair(unordered_pair(esk10_0,esk10_0),unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0))))=esk9_0|~member(esk8_0,universal_class)|$false),inference(rw,[status(thm)],[458,277,theory(equality)])).
% cnf(460,negated_conjecture,(second(unordered_pair(unordered_pair(esk10_0,esk10_0),unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0))))=esk9_0|~member(esk8_0,universal_class)),inference(cn,[status(thm)],[459,theory(equality)])).
% cnf(474,negated_conjecture,(member(unordered_pair(unordered_pair(esk10_0,esk10_0),unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0))),cross_product(X1,X2))|~member(esk9_0,X2)|~member(esk8_0,X1)),inference(spm,[status(thm)],[327,307,theory(equality)])).
% cnf(719,negated_conjecture,(member(unordered_pair(esk8_0,esk8_0),unordered_pair(unordered_pair(esk10_0,esk10_0),unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0))))|~member(unordered_pair(esk8_0,esk8_0),universal_class)),inference(spm,[status(thm)],[342,307,theory(equality)])).
% cnf(723,negated_conjecture,(member(unordered_pair(esk8_0,esk8_0),unordered_pair(unordered_pair(esk10_0,esk10_0),unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0))))|$false),inference(rw,[status(thm)],[719,139,theory(equality)])).
% cnf(724,negated_conjecture,(member(unordered_pair(esk8_0,esk8_0),unordered_pair(unordered_pair(esk10_0,esk10_0),unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0))))),inference(cn,[status(thm)],[723,theory(equality)])).
% cnf(736,plain,(null_class=unordered_pair(X1,X2)|esk4_1(unordered_pair(X1,X2))=X2|~member(X3,X1)|~member(X3,unordered_pair(X1,X2))),inference(spm,[status(thm)],[445,343,theory(equality)])).
% cnf(812,plain,(esk4_1(unordered_pair(X1,X2))=X2|unordered_pair(X1,X2)=null_class|~member(X2,X1)|~member(X2,universal_class)),inference(spm,[status(thm)],[736,341,theory(equality)])).
% cnf(895,plain,(esk4_1(unordered_pair(X1,X2))=X2|unordered_pair(X1,X2)=null_class|~member(X2,X1)),inference(csr,[status(thm)],[812,397])).
% cnf(897,plain,(null_class=unordered_pair(X1,X2)|member(X2,unordered_pair(X1,X2))|~member(X2,X1)),inference(spm,[status(thm)],[161,895,theory(equality)])).
% cnf(923,plain,(member(X1,sum_class(universal_class))|unordered_pair(X2,X1)=null_class|~member(X1,X2)),inference(spm,[status(thm)],[432,897,theory(equality)])).
% cnf(968,plain,(unordered_pair(union(X1,X2),X3)=null_class|member(X3,sum_class(universal_class))|~member(X3,X2)),inference(spm,[status(thm)],[923,230,theory(equality)])).
% cnf(1009,negated_conjecture,(unordered_pair(esk8_0,esk8_0)=unordered_pair(esk10_0,esk10_0)|unordered_pair(esk8_0,esk8_0)=unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0))),inference(spm,[status(thm)],[80,724,theory(equality)])).
% cnf(1036,negated_conjecture,(member(unordered_pair(esk11_0,esk11_0),unordered_pair(esk8_0,esk8_0))|unordered_pair(esk8_0,esk8_0)=unordered_pair(esk10_0,esk10_0)|~member(unordered_pair(esk11_0,esk11_0),universal_class)),inference(spm,[status(thm)],[341,1009,theory(equality)])).
% cnf(1059,negated_conjecture,(member(unordered_pair(esk11_0,esk11_0),unordered_pair(esk8_0,esk8_0))|unordered_pair(esk8_0,esk8_0)=unordered_pair(esk10_0,esk10_0)|$false),inference(rw,[status(thm)],[1036,139,theory(equality)])).
% cnf(1060,negated_conjecture,(member(unordered_pair(esk11_0,esk11_0),unordered_pair(esk8_0,esk8_0))|unordered_pair(esk8_0,esk8_0)=unordered_pair(esk10_0,esk10_0)),inference(cn,[status(thm)],[1059,theory(equality)])).
% cnf(1123,negated_conjecture,(unordered_pair(esk11_0,esk11_0)=esk8_0|unordered_pair(esk8_0,esk8_0)=unordered_pair(esk10_0,esk10_0)),inference(spm,[status(thm)],[80,1060,theory(equality)])).
% cnf(1133,negated_conjecture,(X1=esk8_0|unordered_pair(esk11_0,esk11_0)=esk8_0|~member(X1,unordered_pair(esk10_0,esk10_0))),inference(spm,[status(thm)],[80,1123,theory(equality)])).
% cnf(1248,negated_conjecture,(unordered_pair(esk11_0,esk11_0)=esk8_0|esk4_1(unordered_pair(esk10_0,esk10_0))=esk8_0|null_class=unordered_pair(esk10_0,esk10_0)),inference(spm,[status(thm)],[1133,161,theory(equality)])).
% cnf(1533,negated_conjecture,(unordered_pair(union(X1,universal_class),esk9_0)=null_class|member(esk9_0,sum_class(universal_class))),inference(spm,[status(thm)],[968,277,theory(equality)])).
% cnf(1677,negated_conjecture,(member(esk9_0,null_class)|member(esk9_0,sum_class(universal_class))|~member(esk9_0,universal_class)),inference(spm,[status(thm)],[341,1533,theory(equality)])).
% cnf(1683,negated_conjecture,(member(esk9_0,null_class)|member(esk9_0,sum_class(universal_class))|$false),inference(rw,[status(thm)],[1677,277,theory(equality)])).
% cnf(1684,negated_conjecture,(member(esk9_0,null_class)|member(esk9_0,sum_class(universal_class))),inference(cn,[status(thm)],[1683,theory(equality)])).
% cnf(1685,negated_conjecture,(member(esk9_0,sum_class(universal_class))),inference(sr,[status(thm)],[1684,213,theory(equality)])).
% cnf(2069,negated_conjecture,(unordered_pair(esk10_0,esk10_0)=unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0))|unordered_pair(esk10_0,esk10_0)=unordered_pair(esk8_0,esk8_0)|~member(unordered_pair(esk10_0,esk10_0),universal_class)),inference(spm,[status(thm)],[389,342,theory(equality)])).
% cnf(2075,negated_conjecture,(unordered_pair(esk10_0,esk10_0)=unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0))|unordered_pair(esk10_0,esk10_0)=unordered_pair(esk8_0,esk8_0)|$false),inference(rw,[status(thm)],[2069,139,theory(equality)])).
% cnf(2076,negated_conjecture,(unordered_pair(esk10_0,esk10_0)=unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0))|unordered_pair(esk10_0,esk10_0)=unordered_pair(esk8_0,esk8_0)),inference(cn,[status(thm)],[2075,theory(equality)])).
% cnf(2158,negated_conjecture,(member(unordered_pair(esk9_0,esk9_0),unordered_pair(esk10_0,esk10_0))|unordered_pair(esk8_0,esk8_0)=unordered_pair(esk10_0,esk10_0)|~member(unordered_pair(esk9_0,esk9_0),universal_class)),inference(spm,[status(thm)],[341,2076,theory(equality)])).
% cnf(2180,negated_conjecture,(member(unordered_pair(esk9_0,esk9_0),unordered_pair(esk10_0,esk10_0))|unordered_pair(esk8_0,esk8_0)=unordered_pair(esk10_0,esk10_0)|$false),inference(rw,[status(thm)],[2158,139,theory(equality)])).
% cnf(2181,negated_conjecture,(member(unordered_pair(esk9_0,esk9_0),unordered_pair(esk10_0,esk10_0))|unordered_pair(esk8_0,esk8_0)=unordered_pair(esk10_0,esk10_0)),inference(cn,[status(thm)],[2180,theory(equality)])).
% cnf(3370,negated_conjecture,(null_class=unordered_pair(esk10_0,esk10_0)|member(esk8_0,universal_class)|unordered_pair(esk11_0,esk11_0)=esk8_0),inference(spm,[status(thm)],[162,1248,theory(equality)])).
% cnf(3371,negated_conjecture,(null_class=unordered_pair(esk10_0,esk10_0)|member(esk8_0,unordered_pair(esk10_0,esk10_0))|unordered_pair(esk11_0,esk11_0)=esk8_0),inference(spm,[status(thm)],[161,1248,theory(equality)])).
% cnf(4743,negated_conjecture,(esk9_0=esk11_0|~member(esk10_0,universal_class)|~member(esk11_0,universal_class)|~member(esk8_0,universal_class)),inference(spm,[status(thm)],[325,460,theory(equality)])).
% cnf(4746,negated_conjecture,(~member(esk10_0,universal_class)|~member(esk11_0,universal_class)|~member(esk8_0,universal_class)),inference(sr,[status(thm)],[4743,276,theory(equality)])).
% cnf(5414,negated_conjecture,(member(esk11_0,X1)|~member(esk9_0,X1)|~member(esk8_0,X2)),inference(spm,[status(thm)],[315,474,theory(equality)])).
% cnf(5416,negated_conjecture,(member(esk10_0,X1)|~member(esk9_0,X2)|~member(esk8_0,X1)),inference(spm,[status(thm)],[316,474,theory(equality)])).
% cnf(5565,negated_conjecture,(member(esk11_0,X1)|unordered_pair(esk11_0,esk11_0)=esk8_0|unordered_pair(esk10_0,esk10_0)=null_class|~member(esk9_0,X1)),inference(spm,[status(thm)],[5414,3371,theory(equality)])).
% cnf(5590,negated_conjecture,(member(esk10_0,X1)|~member(esk8_0,X1)),inference(spm,[status(thm)],[5416,1685,theory(equality)])).
% cnf(5636,negated_conjecture,(member(esk10_0,complement(X1))|member(esk8_0,X1)|~member(esk8_0,universal_class)),inference(spm,[status(thm)],[5590,153,theory(equality)])).
% cnf(5659,negated_conjecture,(member(esk10_0,universal_class)|unordered_pair(esk11_0,esk11_0)=esk8_0|unordered_pair(esk10_0,esk10_0)=null_class),inference(spm,[status(thm)],[5590,3370,theory(equality)])).
% cnf(6618,negated_conjecture,(member(esk8_0,X1)|~member(esk10_0,X1)|~member(esk8_0,universal_class)),inference(spm,[status(thm)],[154,5636,theory(equality)])).
% cnf(6626,negated_conjecture,(member(esk8_0,X1)|unordered_pair(esk11_0,esk11_0)=esk8_0|unordered_pair(esk10_0,esk10_0)=null_class|~member(esk10_0,X1)),inference(spm,[status(thm)],[6618,3370,theory(equality)])).
% cnf(6963,negated_conjecture,(unordered_pair(esk10_0,esk10_0)=null_class|unordered_pair(esk11_0,esk11_0)=esk8_0|~member(esk10_0,universal_class)|~member(esk11_0,universal_class)),inference(spm,[status(thm)],[4746,6626,theory(equality)])).
% cnf(7100,negated_conjecture,(unordered_pair(esk10_0,esk10_0)=null_class|unordered_pair(esk11_0,esk11_0)=esk8_0|~member(esk11_0,universal_class)),inference(csr,[status(thm)],[6963,5659])).
% cnf(9419,negated_conjecture,(unordered_pair(esk11_0,esk11_0)=esk8_0|unordered_pair(esk10_0,esk10_0)=null_class|~member(esk9_0,universal_class)),inference(spm,[status(thm)],[7100,5565,theory(equality)])).
% cnf(9425,negated_conjecture,(unordered_pair(esk11_0,esk11_0)=esk8_0|unordered_pair(esk10_0,esk10_0)=null_class|$false),inference(rw,[status(thm)],[9419,277,theory(equality)])).
% cnf(9426,negated_conjecture,(unordered_pair(esk11_0,esk11_0)=esk8_0|unordered_pair(esk10_0,esk10_0)=null_class),inference(cn,[status(thm)],[9425,theory(equality)])).
% cnf(9429,negated_conjecture,(member(esk8_0,universal_class)|unordered_pair(esk10_0,esk10_0)=null_class),inference(spm,[status(thm)],[139,9426,theory(equality)])).
% cnf(9543,negated_conjecture,(member(esk10_0,universal_class)|unordered_pair(esk10_0,esk10_0)=null_class),inference(spm,[status(thm)],[5590,9429,theory(equality)])).
% cnf(9547,negated_conjecture,(member(esk11_0,X1)|unordered_pair(esk10_0,esk10_0)=null_class|~member(esk9_0,X1)),inference(spm,[status(thm)],[5414,9429,theory(equality)])).
% cnf(9554,negated_conjecture,(unordered_pair(esk10_0,esk10_0)=null_class|~member(esk10_0,universal_class)|~member(esk11_0,universal_class)),inference(spm,[status(thm)],[4746,9429,theory(equality)])).
% cnf(9625,negated_conjecture,(unordered_pair(esk10_0,esk10_0)=null_class|~member(esk11_0,universal_class)),inference(csr,[status(thm)],[9554,9543])).
% cnf(10460,negated_conjecture,(unordered_pair(esk10_0,esk10_0)=null_class|~member(esk9_0,universal_class)),inference(spm,[status(thm)],[9625,9547,theory(equality)])).
% cnf(10466,negated_conjecture,(unordered_pair(esk10_0,esk10_0)=null_class|$false),inference(rw,[status(thm)],[10460,277,theory(equality)])).
% cnf(10467,negated_conjecture,(unordered_pair(esk10_0,esk10_0)=null_class),inference(cn,[status(thm)],[10466,theory(equality)])).
% cnf(10471,negated_conjecture,(member(esk10_0,null_class)|~member(esk10_0,universal_class)),inference(spm,[status(thm)],[342,10467,theory(equality)])).
% cnf(10572,negated_conjecture,(unordered_pair(esk8_0,esk8_0)=null_class|member(unordered_pair(esk9_0,esk9_0),unordered_pair(esk10_0,esk10_0))),inference(rw,[status(thm)],[2181,10467,theory(equality)])).
% cnf(10573,negated_conjecture,(unordered_pair(esk8_0,esk8_0)=null_class|member(unordered_pair(esk9_0,esk9_0),null_class)),inference(rw,[status(thm)],[10572,10467,theory(equality)])).
% cnf(10574,negated_conjecture,(unordered_pair(esk8_0,esk8_0)=null_class),inference(sr,[status(thm)],[10573,213,theory(equality)])).
% cnf(10622,negated_conjecture,(X1=unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0))|X1=unordered_pair(esk8_0,esk8_0)|~member(X1,unordered_pair(null_class,unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0))))),inference(rw,[status(thm)],[389,10467,theory(equality)])).
% cnf(10624,negated_conjecture,(~member(esk10_0,universal_class)),inference(sr,[status(thm)],[10471,213,theory(equality)])).
% cnf(11158,negated_conjecture,(X1=unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0))|X1=null_class|~member(X1,unordered_pair(null_class,unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0))))),inference(rw,[status(thm)],[10622,10574,theory(equality)])).
% cnf(11190,negated_conjecture,(unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0))=unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0))|unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0))=null_class|~member(unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0)),universal_class)),inference(spm,[status(thm)],[11158,341,theory(equality)])).
% cnf(11196,negated_conjecture,(unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0))=unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0))|unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0))=null_class|$false),inference(rw,[status(thm)],[11190,139,theory(equality)])).
% cnf(11197,negated_conjecture,(unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0))=unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0))|unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0))=null_class),inference(cn,[status(thm)],[11196,theory(equality)])).
% cnf(11316,negated_conjecture,(member(unordered_pair(esk9_0,esk9_0),unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0)))|unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0))=null_class|~member(unordered_pair(esk9_0,esk9_0),universal_class)),inference(spm,[status(thm)],[341,11197,theory(equality)])).
% cnf(11345,negated_conjecture,(member(unordered_pair(esk9_0,esk9_0),unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0)))|unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0))=null_class|$false),inference(rw,[status(thm)],[11316,139,theory(equality)])).
% cnf(11346,negated_conjecture,(member(unordered_pair(esk9_0,esk9_0),unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0)))|unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0))=null_class),inference(cn,[status(thm)],[11345,theory(equality)])).
% cnf(12213,negated_conjecture,(unordered_pair(esk9_0,esk9_0)=esk10_0|unordered_pair(esk9_0,esk9_0)=unordered_pair(esk11_0,esk11_0)|unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0))=null_class),inference(spm,[status(thm)],[80,11346,theory(equality)])).
% cnf(12225,negated_conjecture,(member(unordered_pair(esk11_0,esk11_0),null_class)|unordered_pair(esk11_0,esk11_0)=unordered_pair(esk9_0,esk9_0)|unordered_pair(esk9_0,esk9_0)=esk10_0|~member(unordered_pair(esk11_0,esk11_0),universal_class)),inference(spm,[status(thm)],[341,12213,theory(equality)])).
% cnf(12276,negated_conjecture,(member(unordered_pair(esk11_0,esk11_0),null_class)|unordered_pair(esk11_0,esk11_0)=unordered_pair(esk9_0,esk9_0)|unordered_pair(esk9_0,esk9_0)=esk10_0|$false),inference(rw,[status(thm)],[12225,139,theory(equality)])).
% cnf(12277,negated_conjecture,(member(unordered_pair(esk11_0,esk11_0),null_class)|unordered_pair(esk11_0,esk11_0)=unordered_pair(esk9_0,esk9_0)|unordered_pair(esk9_0,esk9_0)=esk10_0),inference(cn,[status(thm)],[12276,theory(equality)])).
% cnf(12278,negated_conjecture,(unordered_pair(esk11_0,esk11_0)=unordered_pair(esk9_0,esk9_0)|unordered_pair(esk9_0,esk9_0)=esk10_0),inference(sr,[status(thm)],[12277,213,theory(equality)])).
% cnf(12350,negated_conjecture,(X1=esk11_0|unordered_pair(esk9_0,esk9_0)=esk10_0|~member(X1,unordered_pair(esk9_0,esk9_0))),inference(spm,[status(thm)],[80,12278,theory(equality)])).
% cnf(12538,negated_conjecture,(unordered_pair(esk9_0,esk9_0)=esk10_0|esk9_0=esk11_0|~member(esk9_0,universal_class)),inference(spm,[status(thm)],[12350,341,theory(equality)])).
% cnf(12545,negated_conjecture,(unordered_pair(esk9_0,esk9_0)=esk10_0|esk9_0=esk11_0|$false),inference(rw,[status(thm)],[12538,277,theory(equality)])).
% cnf(12546,negated_conjecture,(unordered_pair(esk9_0,esk9_0)=esk10_0|esk9_0=esk11_0),inference(cn,[status(thm)],[12545,theory(equality)])).
% cnf(12547,negated_conjecture,(unordered_pair(esk9_0,esk9_0)=esk10_0),inference(sr,[status(thm)],[12546,276,theory(equality)])).
% cnf(12552,negated_conjecture,(member(esk10_0,universal_class)),inference(spm,[status(thm)],[139,12547,theory(equality)])).
% cnf(12674,negated_conjecture,($false),inference(sr,[status(thm)],[12552,10624,theory(equality)])).
% cnf(12675,negated_conjecture,($false),12674,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.44 CPU 0.35 WC
% FINAL PrfWatch: 0.44 CPU 0.35 WC
% SZS output end Solution for /tmp/SystemOnTPTP19513/SET018+1.tptp
%
%------------------------------------------------------------------------------