TSTP Solution File: SET066+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET066+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 : art03.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2800MHz
% Memory : 2005MB
% OS : Linux 2.6.32.26-175.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Fri Jun 15 11:05:52 EDT 2012
% Result : Theorem 116.87s
% Output : Solution 120.43s
% 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/SystemOnTPTP15257/SET066+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% not found
% Adding ~C to TBU ... ~commutativity_of_unordered_pair:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT ... WARNING: TreeLimitedRun lost 60.69s, total lost is 60.69s
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... unordered_pair_defn:
% CSA axiom unordered_pair_defn found
% Looking for CSA axiom ... singleton_set_defn:
% CSA axiom singleton_set_defn found
% Looking for CSA axiom ... unordered_pair:
% CSA axiom unordered_pair found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... ordered_pair_defn:
% CSA axiom ordered_pair_defn found
% Looking for CSA axiom ... extensionality:
% CSA axiom extensionality found
% Looking for CSA axiom ... subclass_defn:
% CSA axiom subclass_defn found
% ---- Iteration 3 (6 axioms selected)
% Looking for TBU SAT ...
% no
% Looking for TBU UNS ...
% yes - theorem proved
% ---- Selection completed
% Selected axioms are ... :subclass_defn:extensionality:ordered_pair_defn:unordered_pair:singleton_set_defn:unordered_pair_defn (6)
% Unselected axioms are ... :class_elements_are_sets:null_class_defn:sum_class_defn:disjoint_defn:union_defn:complement:successor_defn:sum_class:power_class:identity_relation:cross_product_defn:replacement:regularity:element_relation_defn:restrict_defn:compose_defn2:range_of_defn:first_second:successor_relation_defn2:apply_defn:cross_product:rotate_defn:flip_defn:choice:domain_of:infinity:power_class_defn:intersection:element_relation:rotate:flip:successor_relation_defn1:image_defn:compose_defn1:function_defn:inverse_defn:inductive_defn (37)
% SZS status THM for /tmp/SystemOnTPTP15257/SET066+1.tptp
% Looking for THM ...
% found
% SZS output start Solution for /tmp/SystemOnTPTP15257/SET066+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 16966
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.91 CPU 2.04 WC
% # Auto-Ordering is analysing problem.
% # Problem is type GUSFGFFSF22MS
% # 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 GUSFGFFSF22MS
% # 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 : 7
% # Removed by relevancy pruning : 0
% # Initial clauses : 14
% # Removed in clause preprocessing : 2
% # Initial clauses in saturation : 12
% # Processed clauses : 4537
% # ...of these trivial : 84
% # ...subsumed : 3892
% # ...remaining for further processing: 561
% # Other redundant clauses eliminated : 6
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 242
% # Backward-rewritten : 16
% # Generated clauses : 62126
% # ...of the previous two non-trivial : 44665
% # Contextual simplify-reflections : 4464
% # Paramodulations : 62034
% # Factorizations : 77
% # Equation resolutions : 15
% # Current number of processed clauses: 299
% # Positive orientable unit clauses: 9
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 289
% # Current number of unprocessed clauses: 22082
% # ...number of literals in the above : 111228
% # Clause-clause subsumption calls (NU) : 139994
% # Rec. Clause-clause subsumption calls : 69255
% # Non-unit clause-clause subsumptions: 8572
% # Unit Clause-clause subsumption calls : 429
% # Rewrite failures with RHS unbound : 0
% # BW rewrite match attempts : 17
% # BW rewrite match successes : 14
% # Backwards rewriting index : 321 nodes, 76 leaves, 3.26+/-5.557 terms/leaf
% # Paramod-from index : 169 nodes, 38 leaves, 2.47+/-2.521 terms/leaf
% # Paramod-into index : 254 nodes, 56 leaves, 2.38+/-3.015 terms/leaf
% # Paramod-neg-atom index : 75 nodes, 18 leaves, 3.11+/-4.508 terms/leaf
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(subclass(X1,X2)<=>![X3]:(member(X3,X1)=>member(X3,X2))),file('/tmp/SRASS.s.p', subclass_defn)).
% fof(2, axiom,![X1]:![X2]:(X1=X2<=>(subclass(X1,X2)&subclass(X2,X1))),file('/tmp/SRASS.s.p', extensionality)).
% fof(6, axiom,![X3]:![X1]:![X2]:(member(X3,unordered_pair(X1,X2))<=>(member(X3,universal_class)&(X3=X1|X3=X2))),file('/tmp/SRASS.s.p', unordered_pair_defn)).
% fof(7, conjecture,![X1]:![X2]:unordered_pair(X1,X2)=unordered_pair(X2,X1),file('/tmp/SRASS.s.p', commutativity_of_unordered_pair)).
% fof(8, negated_conjecture,~(![X1]:![X2]:unordered_pair(X1,X2)=unordered_pair(X2,X1)),inference(assume_negation,[status(cth)],[7])).
% fof(9, plain,![X1]:![X2]:((~(subclass(X1,X2))|![X3]:(~(member(X3,X1))|member(X3,X2)))&(?[X3]:(member(X3,X1)&~(member(X3,X2)))|subclass(X1,X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(10, plain,(![X1]:![X2]:(~(subclass(X1,X2))|![X3]:(~(member(X3,X1))|member(X3,X2)))&![X1]:![X2]:(?[X3]:(member(X3,X1)&~(member(X3,X2)))|subclass(X1,X2))),inference(shift_quantors,[status(thm)],[9])).
% fof(11, plain,(![X4]:![X5]:(~(subclass(X4,X5))|![X6]:(~(member(X6,X4))|member(X6,X5)))&![X7]:![X8]:(?[X9]:(member(X9,X7)&~(member(X9,X8)))|subclass(X7,X8))),inference(variable_rename,[status(thm)],[10])).
% fof(12, plain,(![X4]:![X5]:(~(subclass(X4,X5))|![X6]:(~(member(X6,X4))|member(X6,X5)))&![X7]:![X8]:((member(esk1_2(X7,X8),X7)&~(member(esk1_2(X7,X8),X8)))|subclass(X7,X8))),inference(skolemize,[status(esa)],[11])).
% fof(13, plain,![X4]:![X5]:![X6]:![X7]:![X8]:((~(subclass(X4,X5))|(~(member(X6,X4))|member(X6,X5)))&((member(esk1_2(X7,X8),X7)&~(member(esk1_2(X7,X8),X8)))|subclass(X7,X8))),inference(shift_quantors,[status(thm)],[12])).
% fof(14, plain,![X4]:![X5]:![X6]:![X7]:![X8]:((~(subclass(X4,X5))|(~(member(X6,X4))|member(X6,X5)))&((member(esk1_2(X7,X8),X7)|subclass(X7,X8))&(~(member(esk1_2(X7,X8),X8))|subclass(X7,X8)))),inference(distribute,[status(thm)],[13])).
% cnf(15,plain,(subclass(X1,X2)|~member(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[14])).
% cnf(16,plain,(subclass(X1,X2)|member(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[14])).
% cnf(17,plain,(member(X1,X2)|~member(X1,X3)|~subclass(X3,X2)),inference(split_conjunct,[status(thm)],[14])).
% fof(18, plain,![X1]:![X2]:((~(X1=X2)|(subclass(X1,X2)&subclass(X2,X1)))&((~(subclass(X1,X2))|~(subclass(X2,X1)))|X1=X2)),inference(fof_nnf,[status(thm)],[2])).
% fof(19, 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)],[18])).
% fof(20, 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)],[19])).
% fof(21, 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)],[20])).
% fof(22, 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)],[21])).
% cnf(23,plain,(X1=X2|~subclass(X2,X1)|~subclass(X1,X2)),inference(split_conjunct,[status(thm)],[22])).
% fof(32, plain,![X3]:![X1]:![X2]:((~(member(X3,unordered_pair(X1,X2)))|(member(X3,universal_class)&(X3=X1|X3=X2)))&((~(member(X3,universal_class))|(~(X3=X1)&~(X3=X2)))|member(X3,unordered_pair(X1,X2)))),inference(fof_nnf,[status(thm)],[6])).
% fof(33, plain,(![X3]:![X1]:![X2]:(~(member(X3,unordered_pair(X1,X2)))|(member(X3,universal_class)&(X3=X1|X3=X2)))&![X3]:![X1]:![X2]:((~(member(X3,universal_class))|(~(X3=X1)&~(X3=X2)))|member(X3,unordered_pair(X1,X2)))),inference(shift_quantors,[status(thm)],[32])).
% fof(34, plain,(![X4]:![X5]:![X6]:(~(member(X4,unordered_pair(X5,X6)))|(member(X4,universal_class)&(X4=X5|X4=X6)))&![X7]:![X8]:![X9]:((~(member(X7,universal_class))|(~(X7=X8)&~(X7=X9)))|member(X7,unordered_pair(X8,X9)))),inference(variable_rename,[status(thm)],[33])).
% fof(35, plain,![X4]:![X5]:![X6]:![X7]:![X8]:![X9]:((~(member(X4,unordered_pair(X5,X6)))|(member(X4,universal_class)&(X4=X5|X4=X6)))&((~(member(X7,universal_class))|(~(X7=X8)&~(X7=X9)))|member(X7,unordered_pair(X8,X9)))),inference(shift_quantors,[status(thm)],[34])).
% fof(36, plain,![X4]:![X5]:![X6]:![X7]:![X8]:![X9]:(((member(X4,universal_class)|~(member(X4,unordered_pair(X5,X6))))&((X4=X5|X4=X6)|~(member(X4,unordered_pair(X5,X6)))))&(((~(X7=X8)|~(member(X7,universal_class)))|member(X7,unordered_pair(X8,X9)))&((~(X7=X9)|~(member(X7,universal_class)))|member(X7,unordered_pair(X8,X9))))),inference(distribute,[status(thm)],[35])).
% cnf(37,plain,(member(X1,unordered_pair(X2,X3))|~member(X1,universal_class)|X1!=X3),inference(split_conjunct,[status(thm)],[36])).
% cnf(38,plain,(member(X1,unordered_pair(X2,X3))|~member(X1,universal_class)|X1!=X2),inference(split_conjunct,[status(thm)],[36])).
% cnf(39,plain,(X1=X3|X1=X2|~member(X1,unordered_pair(X2,X3))),inference(split_conjunct,[status(thm)],[36])).
% cnf(40,plain,(member(X1,universal_class)|~member(X1,unordered_pair(X2,X3))),inference(split_conjunct,[status(thm)],[36])).
% fof(41, negated_conjecture,?[X1]:?[X2]:~(unordered_pair(X1,X2)=unordered_pair(X2,X1)),inference(fof_nnf,[status(thm)],[8])).
% fof(42, negated_conjecture,?[X3]:?[X4]:~(unordered_pair(X3,X4)=unordered_pair(X4,X3)),inference(variable_rename,[status(thm)],[41])).
% fof(43, negated_conjecture,~(unordered_pair(esk2_0,esk3_0)=unordered_pair(esk3_0,esk2_0)),inference(skolemize,[status(esa)],[42])).
% cnf(44,negated_conjecture,(unordered_pair(esk2_0,esk3_0)!=unordered_pair(esk3_0,esk2_0)),inference(split_conjunct,[status(thm)],[43])).
% cnf(48,plain,(member(X1,unordered_pair(X2,X1))|~member(X1,universal_class)),inference(er,[status(thm)],[37,theory(equality)])).
% cnf(49,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)],[39,16,theory(equality)])).
% cnf(50,plain,(member(esk1_2(unordered_pair(X1,X2),X3),universal_class)|subclass(unordered_pair(X1,X2),X3)),inference(spm,[status(thm)],[40,16,theory(equality)])).
% cnf(51,plain,(member(X1,unordered_pair(X1,X2))|~member(X1,universal_class)),inference(er,[status(thm)],[38,theory(equality)])).
% cnf(58,plain,(esk1_2(unordered_pair(X4,X5),X6)=X4|subclass(unordered_pair(X4,X5),X6)|X5!=X4),inference(ef,[status(thm)],[49,theory(equality)])).
% cnf(60,plain,(member(X1,unordered_pair(X1,X2))|subclass(unordered_pair(X1,X2),X3)|esk1_2(unordered_pair(X1,X2),X3)=X2),inference(spm,[status(thm)],[16,49,theory(equality)])).
% cnf(61,plain,(subclass(unordered_pair(X1,X2),X3)|esk1_2(unordered_pair(X1,X2),X3)=X2|~member(X1,X3)),inference(spm,[status(thm)],[15,49,theory(equality)])).
% cnf(62,plain,(member(X2,unordered_pair(X1,X2))|subclass(unordered_pair(X1,X2),X3)|esk1_2(unordered_pair(X1,X2),X3)=X1),inference(spm,[status(thm)],[16,49,theory(equality)])).
% cnf(64,plain,(esk1_2(unordered_pair(X1,X1),X2)=X1|subclass(unordered_pair(X1,X1),X2)),inference(er,[status(thm)],[58,theory(equality)])).
% cnf(66,plain,(member(X1,unordered_pair(X1,X1))|subclass(unordered_pair(X1,X1),X2)),inference(spm,[status(thm)],[16,64,theory(equality)])).
% cnf(67,plain,(subclass(unordered_pair(X1,X1),X2)|~member(X1,X2)),inference(spm,[status(thm)],[15,64,theory(equality)])).
% cnf(68,plain,(X1=unordered_pair(X2,X2)|~subclass(X1,unordered_pair(X2,X2))|~member(X2,X1)),inference(spm,[status(thm)],[23,67,theory(equality)])).
% cnf(77,plain,(member(X1,universal_class)|subclass(unordered_pair(X1,X1),X2)),inference(spm,[status(thm)],[40,66,theory(equality)])).
% cnf(80,plain,(X1=unordered_pair(X2,X2)|member(X2,universal_class)|~subclass(X1,unordered_pair(X2,X2))),inference(spm,[status(thm)],[23,77,theory(equality)])).
% cnf(94,plain,(unordered_pair(X1,X1)=unordered_pair(X2,X2)|member(X2,universal_class)|member(X1,universal_class)),inference(spm,[status(thm)],[80,77,theory(equality)])).
% cnf(145,plain,(subclass(unordered_pair(X1,X2),X3)|member(X1,unordered_pair(X1,X2))|~member(X2,X3)),inference(spm,[status(thm)],[15,60,theory(equality)])).
% cnf(146,plain,(member(X2,universal_class)|subclass(unordered_pair(X1,X2),X3)|member(X1,unordered_pair(X1,X2))),inference(spm,[status(thm)],[50,60,theory(equality)])).
% cnf(163,plain,(member(X2,unordered_pair(X1,X2))|subclass(unordered_pair(X1,X2),X3)|~member(X1,X3)),inference(spm,[status(thm)],[16,61,theory(equality)])).
% cnf(164,plain,(subclass(unordered_pair(X1,X2),X3)|~member(X2,X3)|~member(X1,X3)),inference(spm,[status(thm)],[15,61,theory(equality)])).
% cnf(171,plain,(X1=unordered_pair(X2,X3)|~subclass(X1,unordered_pair(X2,X3))|~member(X3,X1)|~member(X2,X1)),inference(spm,[status(thm)],[23,164,theory(equality)])).
% cnf(183,plain,(member(X1,universal_class)|subclass(unordered_pair(X1,X2),X3)|member(X2,unordered_pair(X1,X2))),inference(spm,[status(thm)],[50,62,theory(equality)])).
% cnf(192,plain,(member(X1,unordered_pair(X1,X2))|subclass(unordered_pair(X1,X2),unordered_pair(X3,X2))|~member(X2,universal_class)),inference(spm,[status(thm)],[145,48,theory(equality)])).
% cnf(193,plain,(member(X1,unordered_pair(X1,X2))|subclass(unordered_pair(X1,X2),unordered_pair(X2,X3))|~member(X2,universal_class)),inference(spm,[status(thm)],[145,51,theory(equality)])).
% cnf(202,plain,(member(X1,unordered_pair(X2,X1))|subclass(unordered_pair(X2,X1),unordered_pair(X3,X2))|~member(X2,universal_class)),inference(spm,[status(thm)],[163,48,theory(equality)])).
% cnf(481,plain,(member(X1,unordered_pair(X1,X2))|subclass(unordered_pair(X1,X2),unordered_pair(X2,X3))),inference(csr,[status(thm)],[193,146])).
% cnf(485,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X2)|member(X1,unordered_pair(X1,X2))|~member(X2,unordered_pair(X1,X2))),inference(spm,[status(thm)],[68,481,theory(equality)])).
% cnf(489,plain,(member(X1,universal_class)|subclass(unordered_pair(X1,X2),unordered_pair(X2,X3))),inference(spm,[status(thm)],[40,481,theory(equality)])).
% cnf(502,plain,(member(X1,unordered_pair(X2,X3))|member(X4,universal_class)|~member(X1,unordered_pair(X4,X2))),inference(spm,[status(thm)],[17,489,theory(equality)])).
% cnf(504,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X2)|member(X1,universal_class)|~member(X2,unordered_pair(X1,X2))),inference(spm,[status(thm)],[68,489,theory(equality)])).
% cnf(505,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X2)|member(X2,universal_class)|member(X1,universal_class)),inference(spm,[status(thm)],[80,489,theory(equality)])).
% cnf(625,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X2)|member(X1,universal_class)|~member(X2,universal_class)),inference(spm,[status(thm)],[504,48,theory(equality)])).
% cnf(627,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X2)|member(X1,universal_class)),inference(csr,[status(thm)],[625,505])).
% cnf(669,plain,(unordered_pair(X1,X2)=unordered_pair(X3,X2)|member(X1,universal_class)|member(X3,universal_class)),inference(spm,[status(thm)],[627,627,theory(equality)])).
% cnf(677,negated_conjecture,(member(esk2_0,universal_class)|unordered_pair(esk3_0,esk3_0)!=unordered_pair(esk3_0,esk2_0)),inference(spm,[status(thm)],[44,627,theory(equality)])).
% cnf(694,plain,(member(X1,universal_class)|subclass(unordered_pair(X2,X2),unordered_pair(X2,X3))),inference(spm,[status(thm)],[489,627,theory(equality)])).
% cnf(755,negated_conjecture,(member(esk2_0,universal_class)|member(esk3_0,universal_class)|member(X1,universal_class)|unordered_pair(X1,esk2_0)!=unordered_pair(esk3_0,esk3_0)),inference(spm,[status(thm)],[677,669,theory(equality)])).
% cnf(877,plain,(member(X1,unordered_pair(X2,X3))|member(X4,universal_class)|~member(X1,unordered_pair(X2,X2))),inference(spm,[status(thm)],[17,694,theory(equality)])).
% cnf(911,negated_conjecture,(member(esk3_0,universal_class)|member(esk2_0,universal_class)|member(X1,universal_class)|unordered_pair(esk2_0,esk2_0)!=unordered_pair(esk3_0,esk3_0)),inference(spm,[status(thm)],[755,627,theory(equality)])).
% cnf(917,negated_conjecture,(member(esk3_0,universal_class)|member(esk2_0,universal_class)|member(X1,universal_class)),inference(csr,[status(thm)],[911,94])).
% cnf(918,negated_conjecture,(member(esk3_0,universal_class)|member(esk2_0,universal_class)),inference(ef,[status(thm)],[917,theory(equality)])).
% cnf(933,negated_conjecture,(member(X1,unordered_pair(X1,esk2_0))|subclass(unordered_pair(X1,esk2_0),unordered_pair(X2,esk2_0))|member(esk3_0,universal_class)),inference(spm,[status(thm)],[192,918,theory(equality)])).
% cnf(963,negated_conjecture,(member(X1,unordered_pair(X2,esk2_0))|member(X3,unordered_pair(X3,esk2_0))|member(esk3_0,universal_class)|~member(X1,unordered_pair(X3,esk2_0))),inference(spm,[status(thm)],[17,933,theory(equality)])).
% cnf(969,negated_conjecture,(member(X1,universal_class)|member(esk3_0,universal_class)|subclass(unordered_pair(X1,esk2_0),unordered_pair(X2,esk2_0))),inference(spm,[status(thm)],[40,933,theory(equality)])).
% cnf(1027,negated_conjecture,(member(X1,unordered_pair(X2,esk2_0))|member(esk3_0,universal_class)|member(X3,universal_class)|~member(X1,unordered_pair(X3,esk2_0))),inference(spm,[status(thm)],[17,969,theory(equality)])).
% cnf(1165,negated_conjecture,(member(X1,unordered_pair(X1,esk2_0))|member(esk2_0,unordered_pair(X2,esk2_0))|member(esk3_0,universal_class)|~member(esk2_0,universal_class)),inference(spm,[status(thm)],[963,48,theory(equality)])).
% cnf(1173,negated_conjecture,(member(esk2_0,unordered_pair(X2,esk2_0))|member(X1,unordered_pair(X1,esk2_0))|member(esk3_0,universal_class)),inference(csr,[status(thm)],[1165,918])).
% cnf(1174,negated_conjecture,(member(esk2_0,unordered_pair(esk2_0,esk2_0))|member(esk3_0,universal_class)),inference(ef,[status(thm)],[1173,theory(equality)])).
% cnf(1233,negated_conjecture,(member(esk2_0,unordered_pair(X1,esk2_0))|member(esk3_0,universal_class)|member(esk2_0,universal_class)),inference(spm,[status(thm)],[1027,1174,theory(equality)])).
% cnf(1244,negated_conjecture,(member(esk2_0,unordered_pair(X1,esk2_0))|member(esk3_0,universal_class)),inference(csr,[status(thm)],[1233,48])).
% cnf(1246,negated_conjecture,(member(X1,unordered_pair(esk2_0,X1))|subclass(unordered_pair(esk2_0,X1),unordered_pair(X2,esk2_0))|member(esk3_0,universal_class)),inference(spm,[status(thm)],[163,1244,theory(equality)])).
% cnf(1306,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X2)|member(X1,unordered_pair(X1,X2))|~member(X2,universal_class)),inference(spm,[status(thm)],[485,48,theory(equality)])).
% cnf(1396,negated_conjecture,(member(esk2_0,unordered_pair(esk2_0,X1))|member(X2,universal_class)|member(esk3_0,universal_class)),inference(spm,[status(thm)],[502,1244,theory(equality)])).
% cnf(1553,negated_conjecture,(member(X1,universal_class)|member(esk3_0,universal_class)|subclass(unordered_pair(esk2_0,X1),unordered_pair(X2,esk2_0))),inference(spm,[status(thm)],[40,1246,theory(equality)])).
% cnf(1581,negated_conjecture,(unordered_pair(esk2_0,X1)=unordered_pair(esk2_0,esk2_0)|member(esk3_0,universal_class)|member(X1,universal_class)|~member(esk2_0,unordered_pair(esk2_0,X1))),inference(spm,[status(thm)],[68,1553,theory(equality)])).
% cnf(1599,negated_conjecture,(unordered_pair(esk2_0,X1)=unordered_pair(esk2_0,esk2_0)|member(esk3_0,universal_class)|member(X1,universal_class)),inference(csr,[status(thm)],[1581,1396])).
% cnf(1648,negated_conjecture,(unordered_pair(X1,esk2_0)=unordered_pair(esk2_0,X2)|member(X1,universal_class)|member(esk3_0,universal_class)|member(X2,universal_class)),inference(spm,[status(thm)],[627,1599,theory(equality)])).
% cnf(1882,negated_conjecture,(member(esk3_0,universal_class)|member(X1,universal_class)|unordered_pair(X1,esk2_0)!=unordered_pair(esk3_0,esk2_0)),inference(spm,[status(thm)],[44,1648,theory(equality)])).
% cnf(1981,negated_conjecture,(member(esk3_0,universal_class)|member(X1,universal_class)),inference(csr,[status(thm)],[1882,669])).
% cnf(1982,negated_conjecture,(member(esk3_0,universal_class)),inference(ef,[status(thm)],[1981,theory(equality)])).
% cnf(1999,negated_conjecture,(member(X1,unordered_pair(X1,esk3_0))|subclass(unordered_pair(X1,esk3_0),unordered_pair(X2,esk3_0))),inference(spm,[status(thm)],[192,1982,theory(equality)])).
% cnf(2029,negated_conjecture,(member(X1,unordered_pair(X2,esk3_0))|member(X3,unordered_pair(X3,esk3_0))|~member(X1,unordered_pair(X3,esk3_0))),inference(spm,[status(thm)],[17,1999,theory(equality)])).
% cnf(2514,negated_conjecture,(member(X1,unordered_pair(X1,esk3_0))|member(esk3_0,unordered_pair(X2,esk3_0))|~member(esk3_0,universal_class)),inference(spm,[status(thm)],[2029,48,theory(equality)])).
% cnf(2526,negated_conjecture,(member(X1,unordered_pair(X1,esk3_0))|member(esk3_0,unordered_pair(X2,esk3_0))|$false),inference(rw,[status(thm)],[2514,1982,theory(equality)])).
% cnf(2527,negated_conjecture,(member(X1,unordered_pair(X1,esk3_0))|member(esk3_0,unordered_pair(X2,esk3_0))),inference(cn,[status(thm)],[2526,theory(equality)])).
% cnf(2529,negated_conjecture,(member(esk3_0,unordered_pair(esk3_0,esk3_0))),inference(ef,[status(thm)],[2527,theory(equality)])).
% cnf(2597,negated_conjecture,(member(X1,unordered_pair(esk3_0,X1))|subclass(unordered_pair(esk3_0,X1),unordered_pair(esk3_0,esk3_0))),inference(spm,[status(thm)],[163,2529,theory(equality)])).
% cnf(2605,negated_conjecture,(member(esk3_0,unordered_pair(esk3_0,X1))|member(X2,universal_class)),inference(spm,[status(thm)],[877,2529,theory(equality)])).
% cnf(2645,negated_conjecture,(unordered_pair(X1,X2)=unordered_pair(X2,X2)|member(X1,unordered_pair(X1,X2))|member(esk3_0,unordered_pair(esk3_0,X3))),inference(spm,[status(thm)],[1306,2605,theory(equality)])).
% cnf(2886,negated_conjecture,(member(X1,universal_class)|subclass(unordered_pair(esk3_0,X1),unordered_pair(esk3_0,esk3_0))),inference(spm,[status(thm)],[40,2597,theory(equality)])).
% cnf(2931,negated_conjecture,(unordered_pair(esk3_0,X1)=unordered_pair(esk3_0,esk3_0)|member(X1,universal_class)|~member(esk3_0,unordered_pair(esk3_0,X1))),inference(spm,[status(thm)],[68,2886,theory(equality)])).
% cnf(2968,negated_conjecture,(unordered_pair(esk3_0,X1)=unordered_pair(esk3_0,esk3_0)|member(X1,universal_class)),inference(csr,[status(thm)],[2931,2605])).
% cnf(3153,negated_conjecture,(member(esk2_0,universal_class)),inference(spm,[status(thm)],[677,2968,theory(equality)])).
% cnf(3305,negated_conjecture,(member(X1,unordered_pair(X1,esk2_0))|subclass(unordered_pair(X1,esk2_0),unordered_pair(X2,esk2_0))),inference(spm,[status(thm)],[192,3153,theory(equality)])).
% cnf(4622,negated_conjecture,(member(X1,unordered_pair(X2,esk2_0))|member(X3,unordered_pair(X3,esk2_0))|~member(X1,unordered_pair(X3,esk2_0))),inference(spm,[status(thm)],[17,3305,theory(equality)])).
% cnf(5061,negated_conjecture,(member(X1,unordered_pair(X1,esk2_0))|member(esk2_0,unordered_pair(X2,esk2_0))|~member(esk2_0,universal_class)),inference(spm,[status(thm)],[4622,48,theory(equality)])).
% cnf(5080,negated_conjecture,(member(X1,unordered_pair(X1,esk2_0))|member(esk2_0,unordered_pair(X2,esk2_0))|$false),inference(rw,[status(thm)],[5061,3153,theory(equality)])).
% cnf(5081,negated_conjecture,(member(X1,unordered_pair(X1,esk2_0))|member(esk2_0,unordered_pair(X2,esk2_0))),inference(cn,[status(thm)],[5080,theory(equality)])).
% cnf(5083,negated_conjecture,(member(esk2_0,unordered_pair(esk2_0,esk2_0))),inference(ef,[status(thm)],[5081,theory(equality)])).
% cnf(5174,negated_conjecture,(member(esk2_0,unordered_pair(esk2_0,X1))|member(X2,universal_class)),inference(spm,[status(thm)],[877,5083,theory(equality)])).
% cnf(5309,negated_conjecture,(unordered_pair(X1,X2)=unordered_pair(X2,X2)|member(X1,unordered_pair(X1,X2))|member(esk2_0,unordered_pair(esk2_0,X3))),inference(spm,[status(thm)],[1306,5174,theory(equality)])).
% cnf(5626,plain,(unordered_pair(X1,X2)=unordered_pair(X3,X4)|~member(X4,unordered_pair(X1,X2))|~member(X3,unordered_pair(X1,X2))|~member(X2,unordered_pair(X3,X4))|~member(X1,unordered_pair(X3,X4))),inference(spm,[status(thm)],[171,164,theory(equality)])).
% cnf(8621,plain,(member(X1,unordered_pair(X2,X1))|subclass(unordered_pair(X2,X1),unordered_pair(X3,X2))),inference(csr,[status(thm)],[202,183])).
% cnf(8625,plain,(unordered_pair(X1,X2)=unordered_pair(X1,X1)|member(X2,unordered_pair(X1,X2))|~member(X1,unordered_pair(X1,X2))),inference(spm,[status(thm)],[68,8621,theory(equality)])).
% cnf(14518,negated_conjecture,(unordered_pair(X1,esk3_0)=unordered_pair(X1,X1)|member(esk3_0,unordered_pair(X1,esk3_0))|member(esk3_0,unordered_pair(X2,esk3_0))),inference(spm,[status(thm)],[8625,2527,theory(equality)])).
% cnf(14522,negated_conjecture,(unordered_pair(X1,esk2_0)=unordered_pair(X1,X1)|member(esk2_0,unordered_pair(X1,esk2_0))|member(esk2_0,unordered_pair(X2,esk2_0))),inference(spm,[status(thm)],[8625,5081,theory(equality)])).
% cnf(19136,negated_conjecture,(unordered_pair(X3,esk3_0)=unordered_pair(X3,X3)|member(esk3_0,unordered_pair(X3,esk3_0))),inference(ef,[status(thm)],[14518,theory(equality)])).
% cnf(19770,negated_conjecture,(member(esk3_0,unordered_pair(X1,X1))|member(esk3_0,unordered_pair(X1,esk3_0))|~member(esk3_0,universal_class)),inference(spm,[status(thm)],[48,19136,theory(equality)])).
% cnf(19868,negated_conjecture,(member(esk3_0,unordered_pair(X1,X1))|member(esk3_0,unordered_pair(X1,esk3_0))|$false),inference(rw,[status(thm)],[19770,1982,theory(equality)])).
% cnf(19869,negated_conjecture,(member(esk3_0,unordered_pair(X1,X1))|member(esk3_0,unordered_pair(X1,esk3_0))),inference(cn,[status(thm)],[19868,theory(equality)])).
% cnf(20098,negated_conjecture,(member(esk3_0,unordered_pair(X1,esk3_0))),inference(spm,[status(thm)],[19869,19136,theory(equality)])).
% cnf(20440,negated_conjecture,(unordered_pair(X3,esk2_0)=unordered_pair(X3,X3)|member(esk2_0,unordered_pair(X3,esk2_0))),inference(ef,[status(thm)],[14522,theory(equality)])).
% cnf(21073,negated_conjecture,(member(esk2_0,unordered_pair(X1,X1))|member(esk2_0,unordered_pair(X1,esk2_0))|~member(esk2_0,universal_class)),inference(spm,[status(thm)],[48,20440,theory(equality)])).
% cnf(21170,negated_conjecture,(member(esk2_0,unordered_pair(X1,X1))|member(esk2_0,unordered_pair(X1,esk2_0))|$false),inference(rw,[status(thm)],[21073,3153,theory(equality)])).
% cnf(21171,negated_conjecture,(member(esk2_0,unordered_pair(X1,X1))|member(esk2_0,unordered_pair(X1,esk2_0))),inference(cn,[status(thm)],[21170,theory(equality)])).
% cnf(21283,negated_conjecture,(member(esk2_0,unordered_pair(X1,esk2_0))),inference(spm,[status(thm)],[21171,20440,theory(equality)])).
% cnf(24776,negated_conjecture,(unordered_pair(esk3_0,X4)=unordered_pair(X4,X4)|member(esk3_0,unordered_pair(esk3_0,X4))),inference(ef,[status(thm)],[2645,theory(equality)])).
% cnf(25399,negated_conjecture,(member(esk3_0,unordered_pair(X1,X1))|member(esk3_0,unordered_pair(esk3_0,X1))|~member(esk3_0,universal_class)),inference(spm,[status(thm)],[51,24776,theory(equality)])).
% cnf(25523,negated_conjecture,(member(esk3_0,unordered_pair(X1,X1))|member(esk3_0,unordered_pair(esk3_0,X1))|$false),inference(rw,[status(thm)],[25399,1982,theory(equality)])).
% cnf(25524,negated_conjecture,(member(esk3_0,unordered_pair(X1,X1))|member(esk3_0,unordered_pair(esk3_0,X1))),inference(cn,[status(thm)],[25523,theory(equality)])).
% cnf(25680,negated_conjecture,(member(esk3_0,unordered_pair(esk3_0,X1))),inference(spm,[status(thm)],[25524,24776,theory(equality)])).
% cnf(25905,negated_conjecture,(unordered_pair(esk2_0,X4)=unordered_pair(X4,X4)|member(esk2_0,unordered_pair(esk2_0,X4))),inference(ef,[status(thm)],[5309,theory(equality)])).
% cnf(26533,negated_conjecture,(member(esk2_0,unordered_pair(X1,X1))|member(esk2_0,unordered_pair(esk2_0,X1))|~member(esk2_0,universal_class)),inference(spm,[status(thm)],[51,25905,theory(equality)])).
% cnf(26657,negated_conjecture,(member(esk2_0,unordered_pair(X1,X1))|member(esk2_0,unordered_pair(esk2_0,X1))|$false),inference(rw,[status(thm)],[26533,3153,theory(equality)])).
% cnf(26658,negated_conjecture,(member(esk2_0,unordered_pair(X1,X1))|member(esk2_0,unordered_pair(esk2_0,X1))),inference(cn,[status(thm)],[26657,theory(equality)])).
% cnf(26804,negated_conjecture,(member(esk2_0,unordered_pair(esk2_0,X1))),inference(spm,[status(thm)],[26658,25905,theory(equality)])).
% cnf(86776,negated_conjecture,(unordered_pair(esk3_0,X1)=unordered_pair(X2,esk3_0)|~member(X2,unordered_pair(esk3_0,X1))|~member(X1,unordered_pair(X2,esk3_0))|~member(esk3_0,unordered_pair(X2,esk3_0))),inference(spm,[status(thm)],[5626,25680,theory(equality)])).
% cnf(86857,negated_conjecture,(unordered_pair(esk3_0,X1)=unordered_pair(X2,esk3_0)|~member(X2,unordered_pair(esk3_0,X1))|~member(X1,unordered_pair(X2,esk3_0))|$false),inference(rw,[status(thm)],[86776,20098,theory(equality)])).
% cnf(86858,negated_conjecture,(unordered_pair(esk3_0,X1)=unordered_pair(X2,esk3_0)|~member(X2,unordered_pair(esk3_0,X1))|~member(X1,unordered_pair(X2,esk3_0))),inference(cn,[status(thm)],[86857,theory(equality)])).
% cnf(86908,negated_conjecture,(unordered_pair(esk3_0,esk2_0)=unordered_pair(esk2_0,esk3_0)|~member(esk2_0,unordered_pair(esk2_0,esk3_0))),inference(spm,[status(thm)],[86858,21283,theory(equality)])).
% cnf(87009,negated_conjecture,(unordered_pair(esk3_0,esk2_0)=unordered_pair(esk2_0,esk3_0)|$false),inference(rw,[status(thm)],[86908,26804,theory(equality)])).
% cnf(87010,negated_conjecture,(unordered_pair(esk3_0,esk2_0)=unordered_pair(esk2_0,esk3_0)),inference(cn,[status(thm)],[87009,theory(equality)])).
% cnf(87011,negated_conjecture,($false),inference(sr,[status(thm)],[87010,44,theory(equality)])).
% cnf(87012,negated_conjecture,($false),87011,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 3.41 CPU 3.56 WC
% FINAL PrfWatch: 3.41 CPU 3.56 WC
% SZS output end Solution for /tmp/SystemOnTPTP15257/SET066+1.tptp
%
%------------------------------------------------------------------------------