↑ Up

Z3---4.15.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Z3---4.15.1
% Problem  : SET079+1 : TPTP v9.0.0. Bugfixed v5.4.0.
% Transfm  : none
% Format   : tptp
% Command  : run_E %s %d THM

% Computer : n013.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sat Jun 21 05:25:08 AM UTC 2025

% Result   : Theorem 3.42s 3.62s
% Output   : Proof 3.42s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : SET079+1 : TPTP v9.0.0. Bugfixed v5.4.0.
% 0.03/0.13  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n013.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Fri Jun 20 04:13:23 EDT 2025
% 0.13/0.35  % CPUTime    : 
% 3.42/3.62  % SZS status Theorem
% 3.42/3.62  % SZS output start Proof
% 3.42/3.62  tff(member_type, type, (
% 3.42/3.62     member: ( $i * $i ) > $o)).
% 3.42/3.62  tff(null_class_type, type, (
% 3.42/3.62     null_class: $i)).
% 3.42/3.62  tff(tptp_fun_X_7_type, type, (
% 3.42/3.62     tptp_fun_X_7: $i)).
% 3.42/3.62  tff(unordered_pair_type, type, (
% 3.42/3.62     unordered_pair: ( $i * $i ) > $i)).
% 3.42/3.62  tff(singleton_type, type, (
% 3.42/3.62     singleton: $i > $i)).
% 3.42/3.62  tff(universal_class_type, type, (
% 3.42/3.62     universal_class: $i)).
% 3.42/3.62  tff(1,plain,
% 3.42/3.62      ((~![X: $i] : ((~member(X, universal_class)) | (~(singleton(X) = null_class)))) <=> (~![X: $i] : ((~member(X, universal_class)) | (~(singleton(X) = null_class))))),
% 3.42/3.62      inference(rewrite,[status(thm)],[])).
% 3.42/3.62  tff(2,plain,
% 3.42/3.62      ((~![X: $i] : (member(X, universal_class) => (~(singleton(X) = null_class)))) <=> (~![X: $i] : ((~member(X, universal_class)) | (~(singleton(X) = null_class))))),
% 3.42/3.62      inference(rewrite,[status(thm)],[])).
% 3.42/3.62  tff(3,axiom,(~![X: $i] : (member(X, universal_class) => (~(singleton(X) = null_class)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','corollary_to_set_in_its_singleton')).
% 3.42/3.62  tff(4,plain,
% 3.42/3.62      (~![X: $i] : ((~member(X, universal_class)) | (~(singleton(X) = null_class)))),
% 3.42/3.62      inference(modus_ponens,[status(thm)],[3, 2])).
% 3.42/3.62  tff(5,plain,
% 3.42/3.62      (~![X: $i] : ((~member(X, universal_class)) | (~(singleton(X) = null_class)))),
% 3.42/3.62      inference(modus_ponens,[status(thm)],[4, 1])).
% 3.42/3.62  tff(6,plain,
% 3.42/3.62      (~![X: $i] : ((~member(X, universal_class)) | (~(singleton(X) = null_class)))),
% 3.42/3.62      inference(modus_ponens,[status(thm)],[5, 1])).
% 3.42/3.62  tff(7,plain,
% 3.42/3.62      (~![X: $i] : ((~member(X, universal_class)) | (~(singleton(X) = null_class)))),
% 3.42/3.62      inference(modus_ponens,[status(thm)],[6, 1])).
% 3.42/3.62  tff(8,plain,(
% 3.42/3.62      ~((~member(X!7, universal_class)) | (~(singleton(X!7) = null_class)))),
% 3.42/3.62      inference(skolemize,[status(sab)],[7])).
% 3.42/3.62  tff(9,plain,
% 3.42/3.62      (singleton(X!7) = null_class),
% 3.42/3.62      inference(or_elim,[status(thm)],[8])).
% 3.42/3.62  tff(10,plain,
% 3.42/3.62      (^[X: $i] : refl((singleton(X) = unordered_pair(X, X)) <=> (singleton(X) = unordered_pair(X, X)))),
% 3.42/3.62      inference(bind,[status(th)],[])).
% 3.42/3.62  tff(11,plain,
% 3.42/3.62      (![X: $i] : (singleton(X) = unordered_pair(X, X)) <=> ![X: $i] : (singleton(X) = unordered_pair(X, X))),
% 3.42/3.62      inference(quant_intro,[status(thm)],[10])).
% 3.42/3.62  tff(12,plain,
% 3.42/3.62      (![X: $i] : (singleton(X) = unordered_pair(X, X)) <=> ![X: $i] : (singleton(X) = unordered_pair(X, X))),
% 3.42/3.62      inference(rewrite,[status(thm)],[])).
% 3.42/3.62  tff(13,axiom,(![X: $i] : (singleton(X) = unordered_pair(X, X))), file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax','singleton_set_defn')).
% 3.42/3.62  tff(14,plain,
% 3.42/3.62      (![X: $i] : (singleton(X) = unordered_pair(X, X))),
% 3.42/3.62      inference(modus_ponens,[status(thm)],[13, 12])).
% 3.42/3.62  tff(15,plain,(
% 3.42/3.62      ![X: $i] : (singleton(X) = unordered_pair(X, X))),
% 3.42/3.62      inference(skolemize,[status(sab)],[14])).
% 3.42/3.62  tff(16,plain,
% 3.42/3.62      (![X: $i] : (singleton(X) = unordered_pair(X, X))),
% 3.42/3.62      inference(modus_ponens,[status(thm)],[15, 11])).
% 3.42/3.62  tff(17,plain,
% 3.42/3.62      ((~![X: $i] : (singleton(X) = unordered_pair(X, X))) | (singleton(X!7) = unordered_pair(X!7, X!7))),
% 3.42/3.62      inference(quant_inst,[status(thm)],[])).
% 3.42/3.62  tff(18,plain,
% 3.42/3.62      (singleton(X!7) = unordered_pair(X!7, X!7)),
% 3.42/3.62      inference(unit_resolution,[status(thm)],[17, 16])).
% 3.42/3.62  tff(19,plain,
% 3.42/3.62      (unordered_pair(X!7, X!7) = singleton(X!7)),
% 3.42/3.62      inference(symmetry,[status(thm)],[18])).
% 3.42/3.62  tff(20,plain,
% 3.42/3.62      (unordered_pair(X!7, X!7) = null_class),
% 3.42/3.62      inference(transitivity,[status(thm)],[19, 9])).
% 3.42/3.62  tff(21,plain,
% 3.42/3.62      (member(X!7, unordered_pair(X!7, X!7)) <=> member(X!7, null_class)),
% 3.42/3.62      inference(monotonicity,[status(thm)],[20])).
% 3.42/3.62  tff(22,plain,
% 3.42/3.62      (member(X!7, null_class) <=> member(X!7, unordered_pair(X!7, X!7))),
% 3.42/3.62      inference(symmetry,[status(thm)],[21])).
% 3.42/3.62  tff(23,plain,
% 3.42/3.62      ((~member(X!7, null_class)) <=> (~member(X!7, unordered_pair(X!7, X!7)))),
% 3.42/3.62      inference(monotonicity,[status(thm)],[22])).
% 3.42/3.62  tff(24,assumption,(~member(X!7, null_class)), introduced(assumption)).
% 3.42/3.62  tff(25,plain,
% 3.42/3.62      (~member(X!7, unordered_pair(X!7, X!7))),
% 3.42/3.62      inference(modus_ponens,[status(thm)],[24, 23])).
% 3.42/3.62  tff(26,plain,
% 3.42/3.62      (^[U: $i, X: $i, Y: $i] : refl((~(((~member(U, universal_class)) | (~((U = Y) | (U = X)))) <=> member(U, unordered_pair(X, Y)))) <=> (~(((~member(U, universal_class)) | (~((U = Y) | (U = X)))) <=> member(U, unordered_pair(X, Y)))))),
% 3.42/3.62      inference(bind,[status(th)],[])).
% 3.42/3.62  tff(27,plain,
% 3.42/3.62      (![U: $i, X: $i, Y: $i] : (~(((~member(U, universal_class)) | (~((U = Y) | (U = X)))) <=> member(U, unordered_pair(X, Y)))) <=> ![U: $i, X: $i, Y: $i] : (~(((~member(U, universal_class)) | (~((U = Y) | (U = X)))) <=> member(U, unordered_pair(X, Y))))),
% 3.42/3.62      inference(quant_intro,[status(thm)],[26])).
% 3.42/3.62  tff(28,plain,
% 3.42/3.62      (^[U: $i, X: $i, Y: $i] : trans(trans(monotonicity(rewrite((member(U, universal_class) & ((U = Y) | (U = X))) <=> (~((~member(U, universal_class)) | (~((U = Y) | (U = X)))))), ((member(U, unordered_pair(X, Y)) <=> (member(U, universal_class) & ((U = Y) | (U = X)))) <=> (member(U, unordered_pair(X, Y)) <=> (~((~member(U, universal_class)) | (~((U = Y) | (U = X)))))))), rewrite((member(U, unordered_pair(X, Y)) <=> (~((~member(U, universal_class)) | (~((U = Y) | (U = X)))))) <=> (~(((~member(U, universal_class)) | (~((U = Y) | (U = X)))) <=> member(U, unordered_pair(X, Y))))), ((member(U, unordered_pair(X, Y)) <=> (member(U, universal_class) & ((U = Y) | (U = X)))) <=> (~(((~member(U, universal_class)) | (~((U = Y) | (U = X)))) <=> member(U, unordered_pair(X, Y)))))), rewrite((~(((~member(U, universal_class)) | (~((U = Y) | (U = X)))) <=> member(U, unordered_pair(X, Y)))) <=> (~(((~member(U, universal_class)) | (~((U = Y) | (U = X)))) <=> member(U, unordered_pair(X, Y))))), ((member(U, unordered_pair(X, Y)) <=> (member(U, universal_class) & ((U = Y) | (U = X)))) <=> (~(((~member(U, universal_class)) | (~((U = Y) | (U = X)))) <=> member(U, unordered_pair(X, Y))))))),
% 3.42/3.62      inference(bind,[status(th)],[])).
% 3.42/3.62  tff(29,plain,
% 3.42/3.62      (![U: $i, X: $i, Y: $i] : (member(U, unordered_pair(X, Y)) <=> (member(U, universal_class) & ((U = Y) | (U = X)))) <=> ![U: $i, X: $i, Y: $i] : (~(((~member(U, universal_class)) | (~((U = Y) | (U = X)))) <=> member(U, unordered_pair(X, Y))))),
% 3.42/3.62      inference(quant_intro,[status(thm)],[28])).
% 3.42/3.62  tff(30,plain,
% 3.42/3.62      (![U: $i, X: $i, Y: $i] : (member(U, unordered_pair(X, Y)) <=> (member(U, universal_class) & ((U = Y) | (U = X)))) <=> ![U: $i, X: $i, Y: $i] : (member(U, unordered_pair(X, Y)) <=> (member(U, universal_class) & ((U = Y) | (U = X))))),
% 3.42/3.62      inference(rewrite,[status(thm)],[])).
% 3.42/3.62  tff(31,plain,
% 3.42/3.62      (^[U: $i, X: $i, Y: $i] : rewrite((member(U, unordered_pair(X, Y)) <=> (member(U, universal_class) & ((U = X) | (U = Y)))) <=> (member(U, unordered_pair(X, Y)) <=> (member(U, universal_class) & ((U = Y) | (U = X)))))),
% 3.42/3.62      inference(bind,[status(th)],[])).
% 3.42/3.62  tff(32,plain,
% 3.42/3.62      (![U: $i, X: $i, Y: $i] : (member(U, unordered_pair(X, Y)) <=> (member(U, universal_class) & ((U = X) | (U = Y)))) <=> ![U: $i, X: $i, Y: $i] : (member(U, unordered_pair(X, Y)) <=> (member(U, universal_class) & ((U = Y) | (U = X))))),
% 3.42/3.62      inference(quant_intro,[status(thm)],[31])).
% 3.42/3.62  tff(33,axiom,(![U: $i, X: $i, Y: $i] : (member(U, unordered_pair(X, Y)) <=> (member(U, universal_class) & ((U = X) | (U = Y))))), file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax','unordered_pair_defn')).
% 3.42/3.62  tff(34,plain,
% 3.42/3.62      (![U: $i, X: $i, Y: $i] : (member(U, unordered_pair(X, Y)) <=> (member(U, universal_class) & ((U = Y) | (U = X))))),
% 3.42/3.62      inference(modus_ponens,[status(thm)],[33, 32])).
% 3.42/3.62  tff(35,plain,
% 3.42/3.62      (![U: $i, X: $i, Y: $i] : (member(U, unordered_pair(X, Y)) <=> (member(U, universal_class) & ((U = Y) | (U = X))))),
% 3.42/3.62      inference(modus_ponens,[status(thm)],[34, 30])).
% 3.42/3.62  tff(36,plain,(
% 3.42/3.62      ![U: $i, X: $i, Y: $i] : (member(U, unordered_pair(X, Y)) <=> (member(U, universal_class) & ((U = Y) | (U = X))))),
% 3.42/3.62      inference(skolemize,[status(sab)],[35])).
% 3.42/3.62  tff(37,plain,
% 3.42/3.62      (![U: $i, X: $i, Y: $i] : (~(((~member(U, universal_class)) | (~((U = Y) | (U = X)))) <=> member(U, unordered_pair(X, Y))))),
% 3.42/3.62      inference(modus_ponens,[status(thm)],[36, 29])).
% 3.42/3.62  tff(38,plain,
% 3.42/3.62      (![U: $i, X: $i, Y: $i] : (~(((~member(U, universal_class)) | (~((U = Y) | (U = X)))) <=> member(U, unordered_pair(X, Y))))),
% 3.42/3.62      inference(modus_ponens,[status(thm)],[37, 27])).
% 3.42/3.62  tff(39,plain,
% 3.42/3.62      (((~![U: $i, X: $i, Y: $i] : (~(((~member(U, universal_class)) | (~((U = Y) | (U = X)))) <=> member(U, unordered_pair(X, Y))))) | (member(X!7, universal_class) <=> member(X!7, unordered_pair(X!7, X!7)))) <=> ((~![U: $i, X: $i, Y: $i] : (~(((~member(U, universal_class)) | (~((U = Y) | (U = X)))) <=> member(U, unordered_pair(X, Y))))) | (member(X!7, universal_class) <=> member(X!7, unordered_pair(X!7, X!7))))),
% 3.42/3.62      inference(rewrite,[status(thm)],[])).
% 3.42/3.62  tff(40,plain,
% 3.42/3.62      ((~(~(member(X!7, universal_class) <=> member(X!7, unordered_pair(X!7, X!7))))) <=> (member(X!7, universal_class) <=> member(X!7, unordered_pair(X!7, X!7)))),
% 3.42/3.62      inference(rewrite,[status(thm)],[])).
% 3.42/3.62  tff(41,plain,
% 3.42/3.62      ((~(member(X!7, universal_class) <=> member(X!7, unordered_pair(X!7, X!7)))) <=> (~(member(X!7, universal_class) <=> member(X!7, unordered_pair(X!7, X!7))))),
% 3.42/3.62      inference(rewrite,[status(thm)],[])).
% 3.42/3.62  tff(42,plain,
% 3.42/3.62      (((~member(X!7, universal_class)) <=> member(X!7, unordered_pair(X!7, X!7))) <=> (~(member(X!7, universal_class) <=> member(X!7, unordered_pair(X!7, X!7))))),
% 3.42/3.62      inference(rewrite,[status(thm)],[])).
% 3.42/3.62  tff(43,plain,
% 3.42/3.62      (((~member(X!7, universal_class)) | $false) <=> (~member(X!7, universal_class))),
% 3.42/3.62      inference(rewrite,[status(thm)],[])).
% 3.42/3.62  tff(44,plain,
% 3.42/3.62      ((~$true) <=> $false),
% 3.42/3.62      inference(rewrite,[status(thm)],[])).
% 3.42/3.62  tff(45,plain,
% 3.42/3.62      (($true | $true) <=> $true),
% 3.42/3.62      inference(rewrite,[status(thm)],[])).
% 3.42/3.62  tff(46,plain,
% 3.42/3.62      ((X!7 = X!7) <=> $true),
% 3.42/3.62      inference(rewrite,[status(thm)],[])).
% 3.42/3.62  tff(47,plain,
% 3.42/3.62      (((X!7 = X!7) | (X!7 = X!7)) <=> ($true | $true)),
% 3.42/3.62      inference(monotonicity,[status(thm)],[46, 46])).
% 3.42/3.62  tff(48,plain,
% 3.42/3.62      (((X!7 = X!7) | (X!7 = X!7)) <=> $true),
% 3.42/3.62      inference(transitivity,[status(thm)],[47, 45])).
% 3.42/3.62  tff(49,plain,
% 3.42/3.62      ((~((X!7 = X!7) | (X!7 = X!7))) <=> (~$true)),
% 3.42/3.62      inference(monotonicity,[status(thm)],[48])).
% 3.42/3.62  tff(50,plain,
% 3.42/3.62      ((~((X!7 = X!7) | (X!7 = X!7))) <=> $false),
% 3.42/3.62      inference(transitivity,[status(thm)],[49, 44])).
% 3.42/3.62  tff(51,plain,
% 3.42/3.62      (((~member(X!7, universal_class)) | (~((X!7 = X!7) | (X!7 = X!7)))) <=> ((~member(X!7, universal_class)) | $false)),
% 3.42/3.62      inference(monotonicity,[status(thm)],[50])).
% 3.42/3.62  tff(52,plain,
% 3.42/3.62      (((~member(X!7, universal_class)) | (~((X!7 = X!7) | (X!7 = X!7)))) <=> (~member(X!7, universal_class))),
% 3.42/3.62      inference(transitivity,[status(thm)],[51, 43])).
% 3.42/3.62  tff(53,plain,
% 3.42/3.62      ((((~member(X!7, universal_class)) | (~((X!7 = X!7) | (X!7 = X!7)))) <=> member(X!7, unordered_pair(X!7, X!7))) <=> ((~member(X!7, universal_class)) <=> member(X!7, unordered_pair(X!7, X!7)))),
% 3.42/3.62      inference(monotonicity,[status(thm)],[52])).
% 3.42/3.62  tff(54,plain,
% 3.42/3.62      ((((~member(X!7, universal_class)) | (~((X!7 = X!7) | (X!7 = X!7)))) <=> member(X!7, unordered_pair(X!7, X!7))) <=> (~(member(X!7, universal_class) <=> member(X!7, unordered_pair(X!7, X!7))))),
% 3.42/3.62      inference(transitivity,[status(thm)],[53, 42])).
% 3.42/3.62  tff(55,plain,
% 3.42/3.62      ((((~member(X!7, universal_class)) | (~((X!7 = X!7) | (X!7 = X!7)))) <=> member(X!7, unordered_pair(X!7, X!7))) <=> (~(member(X!7, universal_class) <=> member(X!7, unordered_pair(X!7, X!7))))),
% 3.42/3.62      inference(transitivity,[status(thm)],[54, 41])).
% 3.42/3.62  tff(56,plain,
% 3.42/3.62      ((~(((~member(X!7, universal_class)) | (~((X!7 = X!7) | (X!7 = X!7)))) <=> member(X!7, unordered_pair(X!7, X!7)))) <=> (~(~(member(X!7, universal_class) <=> member(X!7, unordered_pair(X!7, X!7)))))),
% 3.42/3.62      inference(monotonicity,[status(thm)],[55])).
% 3.42/3.62  tff(57,plain,
% 3.42/3.62      ((~(((~member(X!7, universal_class)) | (~((X!7 = X!7) | (X!7 = X!7)))) <=> member(X!7, unordered_pair(X!7, X!7)))) <=> (member(X!7, universal_class) <=> member(X!7, unordered_pair(X!7, X!7)))),
% 3.42/3.62      inference(transitivity,[status(thm)],[56, 40])).
% 3.42/3.62  tff(58,plain,
% 3.42/3.62      (((~![U: $i, X: $i, Y: $i] : (~(((~member(U, universal_class)) | (~((U = Y) | (U = X)))) <=> member(U, unordered_pair(X, Y))))) | (~(((~member(X!7, universal_class)) | (~((X!7 = X!7) | (X!7 = X!7)))) <=> member(X!7, unordered_pair(X!7, X!7))))) <=> ((~![U: $i, X: $i, Y: $i] : (~(((~member(U, universal_class)) | (~((U = Y) | (U = X)))) <=> member(U, unordered_pair(X, Y))))) | (member(X!7, universal_class) <=> member(X!7, unordered_pair(X!7, X!7))))),
% 3.42/3.63      inference(monotonicity,[status(thm)],[57])).
% 3.42/3.63  tff(59,plain,
% 3.42/3.63      (((~![U: $i, X: $i, Y: $i] : (~(((~member(U, universal_class)) | (~((U = Y) | (U = X)))) <=> member(U, unordered_pair(X, Y))))) | (~(((~member(X!7, universal_class)) | (~((X!7 = X!7) | (X!7 = X!7)))) <=> member(X!7, unordered_pair(X!7, X!7))))) <=> ((~![U: $i, X: $i, Y: $i] : (~(((~member(U, universal_class)) | (~((U = Y) | (U = X)))) <=> member(U, unordered_pair(X, Y))))) | (member(X!7, universal_class) <=> member(X!7, unordered_pair(X!7, X!7))))),
% 3.42/3.63      inference(transitivity,[status(thm)],[58, 39])).
% 3.42/3.63  tff(60,plain,
% 3.42/3.63      ((~![U: $i, X: $i, Y: $i] : (~(((~member(U, universal_class)) | (~((U = Y) | (U = X)))) <=> member(U, unordered_pair(X, Y))))) | (~(((~member(X!7, universal_class)) | (~((X!7 = X!7) | (X!7 = X!7)))) <=> member(X!7, unordered_pair(X!7, X!7))))),
% 3.42/3.63      inference(quant_inst,[status(thm)],[])).
% 3.42/3.63  tff(61,plain,
% 3.42/3.63      ((~![U: $i, X: $i, Y: $i] : (~(((~member(U, universal_class)) | (~((U = Y) | (U = X)))) <=> member(U, unordered_pair(X, Y))))) | (member(X!7, universal_class) <=> member(X!7, unordered_pair(X!7, X!7)))),
% 3.42/3.63      inference(modus_ponens,[status(thm)],[60, 59])).
% 3.42/3.63  tff(62,plain,
% 3.42/3.63      (member(X!7, universal_class) <=> member(X!7, unordered_pair(X!7, X!7))),
% 3.42/3.63      inference(unit_resolution,[status(thm)],[61, 38])).
% 3.42/3.63  tff(63,plain,
% 3.42/3.63      (member(X!7, universal_class)),
% 3.42/3.63      inference(or_elim,[status(thm)],[8])).
% 3.42/3.63  tff(64,plain,
% 3.42/3.63      ((~(member(X!7, universal_class) <=> member(X!7, unordered_pair(X!7, X!7)))) | (~member(X!7, universal_class)) | member(X!7, unordered_pair(X!7, X!7))),
% 3.42/3.63      inference(tautology,[status(thm)],[])).
% 3.42/3.63  tff(65,plain,
% 3.42/3.63      ((~(member(X!7, universal_class) <=> member(X!7, unordered_pair(X!7, X!7)))) | member(X!7, unordered_pair(X!7, X!7))),
% 3.42/3.63      inference(unit_resolution,[status(thm)],[64, 63])).
% 3.42/3.63  tff(66,plain,
% 3.42/3.63      (member(X!7, unordered_pair(X!7, X!7))),
% 3.42/3.63      inference(unit_resolution,[status(thm)],[65, 62])).
% 3.42/3.63  tff(67,plain,
% 3.42/3.63      ($false),
% 3.42/3.63      inference(unit_resolution,[status(thm)],[66, 25])).
% 3.42/3.63  tff(68,plain,(member(X!7, null_class)), inference(lemma,lemma(discharge,[]))).
% 3.42/3.63  tff(69,plain,
% 3.42/3.63      (^[X: $i] : refl((~member(X, null_class)) <=> (~member(X, null_class)))),
% 3.42/3.63      inference(bind,[status(th)],[])).
% 3.42/3.63  tff(70,plain,
% 3.42/3.63      (![X: $i] : (~member(X, null_class)) <=> ![X: $i] : (~member(X, null_class))),
% 3.42/3.63      inference(quant_intro,[status(thm)],[69])).
% 3.42/3.63  tff(71,plain,
% 3.42/3.63      (![X: $i] : (~member(X, null_class)) <=> ![X: $i] : (~member(X, null_class))),
% 3.42/3.63      inference(rewrite,[status(thm)],[])).
% 3.42/3.63  tff(72,axiom,(![X: $i] : (~member(X, null_class))), file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax','null_class_defn')).
% 3.42/3.63  tff(73,plain,
% 3.42/3.63      (![X: $i] : (~member(X, null_class))),
% 3.42/3.63      inference(modus_ponens,[status(thm)],[72, 71])).
% 3.42/3.63  tff(74,plain,(
% 3.42/3.63      ![X: $i] : (~member(X, null_class))),
% 3.42/3.63      inference(skolemize,[status(sab)],[73])).
% 3.42/3.63  tff(75,plain,
% 3.42/3.63      (![X: $i] : (~member(X, null_class))),
% 3.42/3.63      inference(modus_ponens,[status(thm)],[74, 70])).
% 3.42/3.63  tff(76,plain,
% 3.42/3.63      ((~![X: $i] : (~member(X, null_class))) | (~member(X!7, null_class))),
% 3.42/3.63      inference(quant_inst,[status(thm)],[])).
% 3.42/3.63  tff(77,plain,
% 3.42/3.63      ($false),
% 3.42/3.63      inference(unit_resolution,[status(thm)],[76, 75, 68])).
% 3.42/3.63  % SZS output end Proof
% 3.47/3.63  % E exiting
%------------------------------------------------------------------------------