%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SET099+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 : hopewell.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:15 EDT 2012

% Result   : Theorem 90.58s
% Output   : Solution 90.94s
% 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/SystemOnTPTP10171/SET099+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% not found
% Adding ~C to TBU       ... ~corollary_2_to_number_of_elements_in_class:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT   ... WARNING: TreeLimitedRun lost 59.39s, total lost is 59.39s
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... intersection: CSA axiom intersection found
% Looking for CSA axiom ... null_class_defn:
%  CSA axiom null_class_defn found
% Looking for CSA axiom ... complement:
%  CSA axiom complement found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ... not found
% Looking for CSA axiom ... singleton_set_defn:
%  CSA axiom singleton_set_defn found
% Looking for CSA axiom ... regularity:
%  CSA axiom regularity found
% Looking for CSA axiom ... domain_of:
%  CSA axiom domain_of found
% ---- Iteration 3 (6 axioms selected)
% Looking for TBU SAT   ... yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... disjoint_defn:
%  CSA axiom disjoint_defn found
% Looking for CSA axiom ... restrict_defn:
%  CSA axiom restrict_defn found
% Looking for CSA axiom ... ordered_pair_defn: CSA axiom ordered_pair_defn found
% ---- Iteration 4 (9 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... extensionality: CSA axiom extensionality found
% Looking for CSA axiom ... choice:
%  CSA axiom choice found
% Looking for CSA axiom ... unordered_pair_defn:
%  CSA axiom unordered_pair_defn found
% ---- Iteration 5 (12 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ... not found
% Looking for CSA axiom ... successor_defn:
%  CSA axiom successor_defn found
% Looking for CSA axiom ... union_defn:
%  CSA axiom union_defn found
% Looking for CSA axiom ... apply_defn:
%  CSA axiom apply_defn found
% ---- Iteration 6 (15 axioms selected)
% Looking for TBU SAT   ... yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... subclass_defn:
%  CSA axiom subclass_defn found
% Looking for CSA axiom ... class_elements_are_sets:
%  CSA axiom class_elements_are_sets found
% Looking for CSA axiom ... replacement: CSA axiom replacement found
% ---- Iteration 7 (18 axioms selected)
% Looking for TBU SAT   ... 
% no
% Looking for TBU UNS   ... 
% yes - theorem proved
% ---- Selection completed
% Selected axioms are   ... :replacement:class_elements_are_sets:subclass_defn:apply_defn:union_defn:successor_defn:unordered_pair_defn:choice:extensionality:ordered_pair_defn:restrict_defn:disjoint_defn:domain_of:regularity:singleton_set_defn:complement:null_class_defn:intersection (18)
% Unselected axioms are ... :identity_relation:element_relation_defn:sum_class_defn:compose_defn2:unordered_pair:inductive_defn:flip:image_defn:first_second:rotate_defn:infinity:power_class_defn:cross_product:range_of_defn:sum_class:power_class:cross_product_defn:flip_defn:inverse_defn:successor_relation_defn2:element_relation:rotate:successor_relation_defn1:compose_defn1:function_defn (25)
% SZS status THM for /tmp/SystemOnTPTP10171/SET099+1.tptp
% Looking for THM       ... 
% found
% SZS output start Solution for /tmp/SystemOnTPTP10171/SET099+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.5/eproof_ram --print-statistics -xAuto -tAuto --cpu-limit=600 --memory-limit=Auto --tstp-format /tmp/SRASS.s.p 
% TreeLimitedRun: CPU time limit is 600s
% TreeLimitedRun: WC  time limit is 1200s
% TreeLimitedRun: PID is 13033
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Auto-Ordering is analysing problem.
% # Problem is type GHSFNFFMF21MM
% # 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 GHSFNFFMF21MM
% # 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                      : 19
% # Removed by relevancy pruning       : 0
% # Initial clauses                    : 41
% # Removed in clause preprocessing    : 5
% # Initial clauses in saturation      : 36
% # Processed clauses                  : 1369
% # ...of these trivial                : 11
% # ...subsumed                        : 871
% # ...remaining for further processing: 487
% # Other redundant clauses eliminated : 20
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 37
% # Backward-rewritten                 : 25
% # Generated clauses                  : 11299
% # ...of the previous two non-trivial : 6706
% # Contextual simplify-reflections    : 165
% # Paramodulations                    : 11243
% # Factorizations                     : 35
% # Equation resolutions               : 20
% # Current number of processed clauses: 420
% #    Positive orientable unit clauses: 65
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 27
% #    Non-unit-clauses                : 328
% # Current number of unprocessed clauses: 4881
% # ...number of literals in the above : 15472
% # Clause-clause subsumption calls (NU) : 19226
% # Rec. Clause-clause subsumption calls : 13532
% # Non-unit clause-clause subsumptions: 571
% # Unit Clause-clause subsumption calls : 2887
% # Rewrite failures with RHS unbound  : 0
% # BW rewrite match attempts          : 57
% # BW rewrite match successes         : 8
% # Backwards rewriting index :  1689 nodes,   382 leaves,   1.67+/-1.958 terms/leaf
% # Paramod-from index      :   777 nodes,   163 leaves,   1.36+/-1.217 terms/leaf
% # Paramod-into index      :  1276 nodes,   277 leaves,   1.44+/-1.153 terms/leaf
% # Paramod-neg-atom index  :   350 nodes,    82 leaves,   1.70+/-1.765 terms/leaf
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:subclass(X1,universal_class),file('/tmp/SRASS.s.p', class_elements_are_sets)).
% fof(3, axiom,![X1]:![X3]:(subclass(X1,X3)<=>![X4]:(member(X4,X1)=>member(X4,X3))),file('/tmp/SRASS.s.p', subclass_defn)).
% fof(7, axiom,![X4]:![X1]:![X3]:(member(X4,unordered_pair(X1,X3))<=>(member(X4,universal_class)&(X4=X1|X4=X3))),file('/tmp/SRASS.s.p', unordered_pair_defn)).
% fof(9, axiom,![X1]:![X3]:(X1=X3<=>(subclass(X1,X3)&subclass(X3,X1))),file('/tmp/SRASS.s.p', extensionality)).
% fof(14, axiom,![X1]:(~(X1=null_class)=>?[X4]:((member(X4,universal_class)&member(X4,X1))&disjoint(X4,X1))),file('/tmp/SRASS.s.p', regularity)).
% fof(15, axiom,![X1]:singleton(X1)=unordered_pair(X1,X1),file('/tmp/SRASS.s.p', singleton_set_defn)).
% fof(16, axiom,![X1]:![X5]:(member(X5,complement(X1))<=>(member(X5,universal_class)&~(member(X5,X1)))),file('/tmp/SRASS.s.p', complement)).
% fof(17, axiom,![X1]:~(member(X1,null_class)),file('/tmp/SRASS.s.p', null_class_defn)).
% fof(18, axiom,![X1]:![X3]:![X5]:(member(X5,intersection(X1,X3))<=>(member(X5,X1)&member(X5,X3))),file('/tmp/SRASS.s.p', intersection)).
% fof(19, conjecture,![X1]:(![X4]:![X7]:((member(X4,X1)&member(X7,intersection(complement(singleton(X4)),X1)))=>X4=X7)=>(X1=null_class|?[X3]:singleton(X3)=X1)),file('/tmp/SRASS.s.p', corollary_2_to_number_of_elements_in_class)).
% fof(20, negated_conjecture,~(![X1]:(![X4]:![X7]:((member(X4,X1)&member(X7,intersection(complement(singleton(X4)),X1)))=>X4=X7)=>(X1=null_class|?[X3]:singleton(X3)=X1))),inference(assume_negation,[status(cth)],[19])).
% fof(21, plain,![X1]:![X5]:(member(X5,complement(X1))<=>(member(X5,universal_class)&~(member(X5,X1)))),inference(fof_simplification,[status(thm)],[16,theory(equality)])).
% fof(22, plain,![X1]:~(member(X1,null_class)),inference(fof_simplification,[status(thm)],[17,theory(equality)])).
% fof(26, plain,![X2]:subclass(X2,universal_class),inference(variable_rename,[status(thm)],[2])).
% cnf(27,plain,(subclass(X1,universal_class)),inference(split_conjunct,[status(thm)],[26])).
% fof(28, plain,![X1]:![X3]:((~(subclass(X1,X3))|![X4]:(~(member(X4,X1))|member(X4,X3)))&(?[X4]:(member(X4,X1)&~(member(X4,X3)))|subclass(X1,X3))),inference(fof_nnf,[status(thm)],[3])).
% fof(29, plain,(![X1]:![X3]:(~(subclass(X1,X3))|![X4]:(~(member(X4,X1))|member(X4,X3)))&![X1]:![X3]:(?[X4]:(member(X4,X1)&~(member(X4,X3)))|subclass(X1,X3))),inference(shift_quantors,[status(thm)],[28])).
% fof(30, 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)],[29])).
% fof(31, plain,(![X5]:![X6]:(~(subclass(X5,X6))|![X7]:(~(member(X7,X5))|member(X7,X6)))&![X8]:![X9]:((member(esk1_2(X8,X9),X8)&~(member(esk1_2(X8,X9),X9)))|subclass(X8,X9))),inference(skolemize,[status(esa)],[30])).
% fof(32, plain,![X5]:![X6]:![X7]:![X8]:![X9]:((~(subclass(X5,X6))|(~(member(X7,X5))|member(X7,X6)))&((member(esk1_2(X8,X9),X8)&~(member(esk1_2(X8,X9),X9)))|subclass(X8,X9))),inference(shift_quantors,[status(thm)],[31])).
% fof(33, plain,![X5]:![X6]:![X7]:![X8]:![X9]:((~(subclass(X5,X6))|(~(member(X7,X5))|member(X7,X6)))&((member(esk1_2(X8,X9),X8)|subclass(X8,X9))&(~(member(esk1_2(X8,X9),X9))|subclass(X8,X9)))),inference(distribute,[status(thm)],[32])).
% cnf(34,plain,(subclass(X1,X2)|~member(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[33])).
% cnf(35,plain,(subclass(X1,X2)|member(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[33])).
% cnf(36,plain,(member(X1,X2)|~member(X1,X3)|~subclass(X3,X2)),inference(split_conjunct,[status(thm)],[33])).
% fof(49, plain,![X4]:![X1]:![X3]:((~(member(X4,unordered_pair(X1,X3)))|(member(X4,universal_class)&(X4=X1|X4=X3)))&((~(member(X4,universal_class))|(~(X4=X1)&~(X4=X3)))|member(X4,unordered_pair(X1,X3)))),inference(fof_nnf,[status(thm)],[7])).
% fof(50, plain,(![X4]:![X1]:![X3]:(~(member(X4,unordered_pair(X1,X3)))|(member(X4,universal_class)&(X4=X1|X4=X3)))&![X4]:![X1]:![X3]:((~(member(X4,universal_class))|(~(X4=X1)&~(X4=X3)))|member(X4,unordered_pair(X1,X3)))),inference(shift_quantors,[status(thm)],[49])).
% fof(51, 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)],[50])).
% fof(52, 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)],[51])).
% fof(53, 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)],[52])).
% cnf(54,plain,(member(X1,unordered_pair(X2,X3))|~member(X1,universal_class)|X1!=X3),inference(split_conjunct,[status(thm)],[53])).
% cnf(56,plain,(X1=X3|X1=X2|~member(X1,unordered_pair(X2,X3))),inference(split_conjunct,[status(thm)],[53])).
% fof(64, plain,![X1]:![X3]:((~(X1=X3)|(subclass(X1,X3)&subclass(X3,X1)))&((~(subclass(X1,X3))|~(subclass(X3,X1)))|X1=X3)),inference(fof_nnf,[status(thm)],[9])).
% fof(65, plain,(![X1]:![X3]:(~(X1=X3)|(subclass(X1,X3)&subclass(X3,X1)))&![X1]:![X3]:((~(subclass(X1,X3))|~(subclass(X3,X1)))|X1=X3)),inference(shift_quantors,[status(thm)],[64])).
% fof(66, plain,(![X4]:![X5]:(~(X4=X5)|(subclass(X4,X5)&subclass(X5,X4)))&![X6]:![X7]:((~(subclass(X6,X7))|~(subclass(X7,X6)))|X6=X7)),inference(variable_rename,[status(thm)],[65])).
% fof(67, plain,![X4]:![X5]:![X6]:![X7]:((~(X4=X5)|(subclass(X4,X5)&subclass(X5,X4)))&((~(subclass(X6,X7))|~(subclass(X7,X6)))|X6=X7)),inference(shift_quantors,[status(thm)],[66])).
% fof(68, plain,![X4]:![X5]:![X6]:![X7]:(((subclass(X4,X5)|~(X4=X5))&(subclass(X5,X4)|~(X4=X5)))&((~(subclass(X6,X7))|~(subclass(X7,X6)))|X6=X7)),inference(distribute,[status(thm)],[67])).
% cnf(69,plain,(X1=X2|~subclass(X2,X1)|~subclass(X1,X2)),inference(split_conjunct,[status(thm)],[68])).
% fof(93, plain,![X1]:(X1=null_class|?[X4]:((member(X4,universal_class)&member(X4,X1))&disjoint(X4,X1))),inference(fof_nnf,[status(thm)],[14])).
% fof(94, plain,![X5]:(X5=null_class|?[X6]:((member(X6,universal_class)&member(X6,X5))&disjoint(X6,X5))),inference(variable_rename,[status(thm)],[93])).
% fof(95, plain,![X5]:(X5=null_class|((member(esk4_1(X5),universal_class)&member(esk4_1(X5),X5))&disjoint(esk4_1(X5),X5))),inference(skolemize,[status(esa)],[94])).
% fof(96, plain,![X5]:(((member(esk4_1(X5),universal_class)|X5=null_class)&(member(esk4_1(X5),X5)|X5=null_class))&(disjoint(esk4_1(X5),X5)|X5=null_class)),inference(distribute,[status(thm)],[95])).
% cnf(98,plain,(X1=null_class|member(esk4_1(X1),X1)),inference(split_conjunct,[status(thm)],[96])).
% cnf(99,plain,(X1=null_class|member(esk4_1(X1),universal_class)),inference(split_conjunct,[status(thm)],[96])).
% fof(100, plain,![X2]:singleton(X2)=unordered_pair(X2,X2),inference(variable_rename,[status(thm)],[15])).
% cnf(101,plain,(singleton(X1)=unordered_pair(X1,X1)),inference(split_conjunct,[status(thm)],[100])).
% fof(102, plain,![X1]:![X5]:((~(member(X5,complement(X1)))|(member(X5,universal_class)&~(member(X5,X1))))&((~(member(X5,universal_class))|member(X5,X1))|member(X5,complement(X1)))),inference(fof_nnf,[status(thm)],[21])).
% fof(103, plain,(![X1]:![X5]:(~(member(X5,complement(X1)))|(member(X5,universal_class)&~(member(X5,X1))))&![X1]:![X5]:((~(member(X5,universal_class))|member(X5,X1))|member(X5,complement(X1)))),inference(shift_quantors,[status(thm)],[102])).
% fof(104, plain,(![X6]:![X7]:(~(member(X7,complement(X6)))|(member(X7,universal_class)&~(member(X7,X6))))&![X8]:![X9]:((~(member(X9,universal_class))|member(X9,X8))|member(X9,complement(X8)))),inference(variable_rename,[status(thm)],[103])).
% fof(105, plain,![X6]:![X7]:![X8]:![X9]:((~(member(X7,complement(X6)))|(member(X7,universal_class)&~(member(X7,X6))))&((~(member(X9,universal_class))|member(X9,X8))|member(X9,complement(X8)))),inference(shift_quantors,[status(thm)],[104])).
% fof(106, plain,![X6]:![X7]:![X8]:![X9]:(((member(X7,universal_class)|~(member(X7,complement(X6))))&(~(member(X7,X6))|~(member(X7,complement(X6)))))&((~(member(X9,universal_class))|member(X9,X8))|member(X9,complement(X8)))),inference(distribute,[status(thm)],[105])).
% cnf(107,plain,(member(X1,complement(X2))|member(X1,X2)|~member(X1,universal_class)),inference(split_conjunct,[status(thm)],[106])).
% cnf(108,plain,(~member(X1,complement(X2))|~member(X1,X2)),inference(split_conjunct,[status(thm)],[106])).
% fof(110, plain,![X2]:~(member(X2,null_class)),inference(variable_rename,[status(thm)],[22])).
% cnf(111,plain,(~member(X1,null_class)),inference(split_conjunct,[status(thm)],[110])).
% fof(112, plain,![X1]:![X3]:![X5]:((~(member(X5,intersection(X1,X3)))|(member(X5,X1)&member(X5,X3)))&((~(member(X5,X1))|~(member(X5,X3)))|member(X5,intersection(X1,X3)))),inference(fof_nnf,[status(thm)],[18])).
% fof(113, plain,(![X1]:![X3]:![X5]:(~(member(X5,intersection(X1,X3)))|(member(X5,X1)&member(X5,X3)))&![X1]:![X3]:![X5]:((~(member(X5,X1))|~(member(X5,X3)))|member(X5,intersection(X1,X3)))),inference(shift_quantors,[status(thm)],[112])).
% fof(114, plain,(![X6]:![X7]:![X8]:(~(member(X8,intersection(X6,X7)))|(member(X8,X6)&member(X8,X7)))&![X9]:![X10]:![X11]:((~(member(X11,X9))|~(member(X11,X10)))|member(X11,intersection(X9,X10)))),inference(variable_rename,[status(thm)],[113])).
% fof(115, plain,![X6]:![X7]:![X8]:![X9]:![X10]:![X11]:((~(member(X8,intersection(X6,X7)))|(member(X8,X6)&member(X8,X7)))&((~(member(X11,X9))|~(member(X11,X10)))|member(X11,intersection(X9,X10)))),inference(shift_quantors,[status(thm)],[114])).
% fof(116, plain,![X6]:![X7]:![X8]:![X9]:![X10]:![X11]:(((member(X8,X6)|~(member(X8,intersection(X6,X7))))&(member(X8,X7)|~(member(X8,intersection(X6,X7)))))&((~(member(X11,X9))|~(member(X11,X10)))|member(X11,intersection(X9,X10)))),inference(distribute,[status(thm)],[115])).
% cnf(117,plain,(member(X1,intersection(X2,X3))|~member(X1,X3)|~member(X1,X2)),inference(split_conjunct,[status(thm)],[116])).
% cnf(118,plain,(member(X1,X3)|~member(X1,intersection(X2,X3))),inference(split_conjunct,[status(thm)],[116])).
% cnf(119,plain,(member(X1,X2)|~member(X1,intersection(X2,X3))),inference(split_conjunct,[status(thm)],[116])).
% fof(120, negated_conjecture,?[X1]:(![X4]:![X7]:((~(member(X4,X1))|~(member(X7,intersection(complement(singleton(X4)),X1))))|X4=X7)&(~(X1=null_class)&![X3]:~(singleton(X3)=X1))),inference(fof_nnf,[status(thm)],[20])).
% fof(121, negated_conjecture,?[X8]:(![X9]:![X10]:((~(member(X9,X8))|~(member(X10,intersection(complement(singleton(X9)),X8))))|X9=X10)&(~(X8=null_class)&![X11]:~(singleton(X11)=X8))),inference(variable_rename,[status(thm)],[120])).
% fof(122, negated_conjecture,(![X9]:![X10]:((~(member(X9,esk5_0))|~(member(X10,intersection(complement(singleton(X9)),esk5_0))))|X9=X10)&(~(esk5_0=null_class)&![X11]:~(singleton(X11)=esk5_0))),inference(skolemize,[status(esa)],[121])).
% fof(123, negated_conjecture,![X9]:![X10]:![X11]:(((~(member(X9,esk5_0))|~(member(X10,intersection(complement(singleton(X9)),esk5_0))))|X9=X10)&(~(esk5_0=null_class)&~(singleton(X11)=esk5_0))),inference(shift_quantors,[status(thm)],[122])).
% cnf(124,negated_conjecture,(singleton(X1)!=esk5_0),inference(split_conjunct,[status(thm)],[123])).
% cnf(125,negated_conjecture,(esk5_0!=null_class),inference(split_conjunct,[status(thm)],[123])).
% cnf(126,negated_conjecture,(X1=X2|~member(X2,intersection(complement(singleton(X1)),esk5_0))|~member(X1,esk5_0)),inference(split_conjunct,[status(thm)],[123])).
% cnf(131,negated_conjecture,(X1=X2|~member(X1,esk5_0)|~member(X2,intersection(complement(unordered_pair(X1,X1)),esk5_0))),inference(rw,[status(thm)],[126,101,theory(equality)]),['unfolding']).
% cnf(132,negated_conjecture,(unordered_pair(X1,X1)!=esk5_0),inference(rw,[status(thm)],[124,101,theory(equality)]),['unfolding']).
% cnf(142,plain,(member(esk4_1(intersection(X1,X2)),X2)|null_class=intersection(X1,X2)),inference(spm,[status(thm)],[118,98,theory(equality)])).
% cnf(143,plain,(member(esk4_1(intersection(X1,X2)),X1)|null_class=intersection(X1,X2)),inference(spm,[status(thm)],[119,98,theory(equality)])).
% cnf(149,plain,(member(X1,unordered_pair(X2,X1))|~member(X1,universal_class)),inference(er,[status(thm)],[54,theory(equality)])).
% cnf(153,negated_conjecture,(X1=esk4_1(intersection(complement(unordered_pair(X1,X1)),esk5_0))|null_class=intersection(complement(unordered_pair(X1,X1)),esk5_0)|~member(X1,esk5_0)),inference(spm,[status(thm)],[131,98,theory(equality)])).
% cnf(162,plain,(esk1_2(unordered_pair(X1,X2),X3)=X1|esk1_2(unordered_pair(X1,X2),X3)=X2|subclass(unordered_pair(X1,X2),X3)),inference(spm,[status(thm)],[56,35,theory(equality)])).
% cnf(193,plain,(member(X1,universal_class)|~member(X1,X2)),inference(spm,[status(thm)],[36,27,theory(equality)])).
% cnf(256,plain,(intersection(complement(X1),X2)=null_class|~member(esk4_1(intersection(complement(X1),X2)),X1)),inference(spm,[status(thm)],[108,143,theory(equality)])).
% cnf(505,negated_conjecture,(intersection(complement(unordered_pair(X1,X1)),esk5_0)=null_class|~member(X1,unordered_pair(X1,X1))|~member(X1,esk5_0)),inference(spm,[status(thm)],[256,153,theory(equality)])).
% cnf(543,plain,(esk1_2(unordered_pair(X4,X5),X6)=X4|subclass(unordered_pair(X4,X5),X6)|X5!=X4),inference(ef,[status(thm)],[162,theory(equality)])).
% cnf(549,plain,(esk1_2(unordered_pair(X1,X1),X2)=X1|subclass(unordered_pair(X1,X1),X2)),inference(er,[status(thm)],[543,theory(equality)])).
% cnf(588,negated_conjecture,(intersection(complement(unordered_pair(X1,X1)),esk5_0)=null_class|~member(X1,esk5_0)|~member(X1,universal_class)),inference(spm,[status(thm)],[505,149,theory(equality)])).
% cnf(647,negated_conjecture,(intersection(complement(unordered_pair(X1,X1)),esk5_0)=null_class|~member(X1,esk5_0)),inference(csr,[status(thm)],[588,193])).
% cnf(649,negated_conjecture,(member(X1,null_class)|~member(X1,esk5_0)|~member(X1,complement(unordered_pair(X2,X2)))|~member(X2,esk5_0)),inference(spm,[status(thm)],[117,647,theory(equality)])).
% cnf(665,negated_conjecture,(~member(X1,esk5_0)|~member(X1,complement(unordered_pair(X2,X2)))|~member(X2,esk5_0)),inference(sr,[status(thm)],[649,111,theory(equality)])).
% cnf(1186,negated_conjecture,(member(X1,unordered_pair(X2,X2))|~member(X1,esk5_0)|~member(X2,esk5_0)|~member(X1,universal_class)),inference(spm,[status(thm)],[665,107,theory(equality)])).
% cnf(1256,negated_conjecture,(member(X1,unordered_pair(X2,X2))|~member(X1,esk5_0)|~member(X2,esk5_0)),inference(csr,[status(thm)],[1186,193])).
% cnf(1280,negated_conjecture,(X1=X2|~member(X1,esk5_0)|~member(X2,esk5_0)),inference(spm,[status(thm)],[56,1256,theory(equality)])).
% cnf(1292,negated_conjecture,(esk4_1(esk5_0)=X1|null_class=esk5_0|~member(X1,esk5_0)),inference(spm,[status(thm)],[1280,98,theory(equality)])).
% cnf(1304,negated_conjecture,(esk4_1(esk5_0)=X1|~member(X1,esk5_0)),inference(sr,[status(thm)],[1292,125,theory(equality)])).
% cnf(1306,negated_conjecture,(esk4_1(esk5_0)=esk4_1(intersection(X1,esk5_0))|intersection(X1,esk5_0)=null_class),inference(spm,[status(thm)],[1304,142,theory(equality)])).
% cnf(1319,negated_conjecture,(esk4_1(esk5_0)=esk1_2(esk5_0,X1)|subclass(esk5_0,X1)),inference(spm,[status(thm)],[1304,35,theory(equality)])).
% cnf(1752,negated_conjecture,(intersection(X1,esk5_0)=null_class|member(esk4_1(esk5_0),esk5_0)),inference(spm,[status(thm)],[142,1306,theory(equality)])).
% cnf(1953,negated_conjecture,(member(X1,null_class)|member(esk4_1(esk5_0),esk5_0)|~member(X1,esk5_0)|~member(X1,X2)),inference(spm,[status(thm)],[117,1752,theory(equality)])).
% cnf(1976,negated_conjecture,(member(esk4_1(esk5_0),esk5_0)|~member(X1,esk5_0)|~member(X1,X2)),inference(sr,[status(thm)],[1953,111,theory(equality)])).
% cnf(2254,negated_conjecture,(member(esk4_1(esk5_0),esk5_0)|null_class=esk5_0|~member(esk4_1(esk5_0),X1)),inference(spm,[status(thm)],[1976,98,theory(equality)])).
% cnf(2276,negated_conjecture,(member(esk4_1(esk5_0),esk5_0)|~member(esk4_1(esk5_0),X1)),inference(sr,[status(thm)],[2254,125,theory(equality)])).
% cnf(2325,negated_conjecture,(member(esk4_1(esk5_0),esk5_0)|null_class=esk5_0),inference(spm,[status(thm)],[2276,99,theory(equality)])).
% cnf(2329,negated_conjecture,(member(esk4_1(esk5_0),esk5_0)),inference(sr,[status(thm)],[2325,125,theory(equality)])).
% cnf(7189,negated_conjecture,(subclass(esk5_0,X1)|~member(esk4_1(esk5_0),X1)),inference(spm,[status(thm)],[34,1319,theory(equality)])).
% cnf(7218,negated_conjecture,(subclass(esk5_0,unordered_pair(X1,X1))|~member(esk4_1(esk5_0),esk5_0)|~member(X1,esk5_0)),inference(spm,[status(thm)],[7189,1256,theory(equality)])).
% cnf(7238,negated_conjecture,(subclass(esk5_0,unordered_pair(X1,X1))|$false|~member(X1,esk5_0)),inference(rw,[status(thm)],[7218,2329,theory(equality)])).
% cnf(7239,negated_conjecture,(subclass(esk5_0,unordered_pair(X1,X1))|~member(X1,esk5_0)),inference(cn,[status(thm)],[7238,theory(equality)])).
% cnf(7758,negated_conjecture,(unordered_pair(X1,X1)=esk5_0|~subclass(unordered_pair(X1,X1),esk5_0)|~member(X1,esk5_0)),inference(spm,[status(thm)],[69,7239,theory(equality)])).
% cnf(7764,negated_conjecture,(~subclass(unordered_pair(X1,X1),esk5_0)|~member(X1,esk5_0)),inference(sr,[status(thm)],[7758,132,theory(equality)])).
% cnf(17716,plain,(subclass(unordered_pair(X1,X1),X2)|~member(X1,X2)),inference(spm,[status(thm)],[34,549,theory(equality)])).
% cnf(18681,negated_conjecture,(~member(X1,esk5_0)),inference(spm,[status(thm)],[7764,17716,theory(equality)])).
% cnf(18765,negated_conjecture,($false),inference(sr,[status(thm)],[2329,18681,theory(equality)])).
% cnf(18766,negated_conjecture,($false),18765,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.34 CPU 0.24 WC
% FINAL PrfWatch: 0.34 CPU 0.24 WC
% SZS output end Solution for /tmp/SystemOnTPTP10171/SET099+1.tptp
% 
%------------------------------------------------------------------------------