%------------------------------------------------------------------------------
% File : Z3---4.15.1
% Problem : SET081+1 : TPTP v9.0.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp
% Command : run_E %s %d THM
% Computer : n006.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 0.12s 0.38s
% Output : Proof 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET081+1 : TPTP v9.0.0. Bugfixed v5.4.0.
% 0.11/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n006.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Fri Jun 20 04:13:05 EDT 2025
% 0.12/0.33 % CPUTime :
% 0.12/0.38 % SZS status Theorem
% 0.12/0.38 % SZS output start Proof
% 0.12/0.38 tff(member_type, type, (
% 0.12/0.38 member: ( $i * $i ) > $o)).
% 0.12/0.38 tff(unordered_pair_type, type, (
% 0.12/0.38 unordered_pair: ( $i * $i ) > $i)).
% 0.12/0.38 tff(tptp_fun_X_8_type, type, (
% 0.12/0.38 tptp_fun_X_8: $i)).
% 0.12/0.38 tff(tptp_fun_Y_7_type, type, (
% 0.12/0.38 tptp_fun_Y_7: $i)).
% 0.12/0.38 tff(singleton_type, type, (
% 0.12/0.38 singleton: $i > $i)).
% 0.12/0.38 tff(universal_class_type, type, (
% 0.12/0.38 universal_class: $i)).
% 0.12/0.38 tff(1,plain,
% 0.12/0.38 (^[X: $i] : refl((singleton(X) = unordered_pair(X, X)) <=> (singleton(X) = unordered_pair(X, X)))),
% 0.12/0.38 inference(bind,[status(th)],[])).
% 0.12/0.38 tff(2,plain,
% 0.12/0.38 (![X: $i] : (singleton(X) = unordered_pair(X, X)) <=> ![X: $i] : (singleton(X) = unordered_pair(X, X))),
% 0.12/0.38 inference(quant_intro,[status(thm)],[1])).
% 0.12/0.38 tff(3,plain,
% 0.12/0.38 (![X: $i] : (singleton(X) = unordered_pair(X, X)) <=> ![X: $i] : (singleton(X) = unordered_pair(X, X))),
% 0.12/0.38 inference(rewrite,[status(thm)],[])).
% 0.12/0.38 tff(4,axiom,(![X: $i] : (singleton(X) = unordered_pair(X, X))), file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax','singleton_set_defn')).
% 0.12/0.38 tff(5,plain,
% 0.12/0.38 (![X: $i] : (singleton(X) = unordered_pair(X, X))),
% 0.12/0.38 inference(modus_ponens,[status(thm)],[4, 3])).
% 0.12/0.38 tff(6,plain,(
% 0.12/0.38 ![X: $i] : (singleton(X) = unordered_pair(X, X))),
% 0.12/0.38 inference(skolemize,[status(sab)],[5])).
% 0.12/0.38 tff(7,plain,
% 0.12/0.38 (![X: $i] : (singleton(X) = unordered_pair(X, X))),
% 0.12/0.38 inference(modus_ponens,[status(thm)],[6, 2])).
% 0.12/0.38 tff(8,plain,
% 0.12/0.38 ((~![X: $i] : (singleton(X) = unordered_pair(X, X))) | (singleton(X!8) = unordered_pair(X!8, X!8))),
% 0.12/0.38 inference(quant_inst,[status(thm)],[])).
% 0.12/0.38 tff(9,plain,
% 0.12/0.38 (singleton(X!8) = unordered_pair(X!8, X!8)),
% 0.12/0.38 inference(unit_resolution,[status(thm)],[8, 7])).
% 0.12/0.38 tff(10,plain,
% 0.12/0.38 (unordered_pair(X!8, X!8) = singleton(X!8)),
% 0.12/0.38 inference(symmetry,[status(thm)],[9])).
% 0.12/0.38 tff(11,plain,
% 0.12/0.38 (member(Y!7, unordered_pair(X!8, X!8)) <=> member(Y!7, singleton(X!8))),
% 0.12/0.38 inference(monotonicity,[status(thm)],[10])).
% 0.12/0.38 tff(12,plain,
% 0.12/0.38 (member(Y!7, singleton(X!8)) <=> member(Y!7, unordered_pair(X!8, X!8))),
% 0.12/0.38 inference(symmetry,[status(thm)],[11])).
% 0.12/0.38 tff(13,plain,
% 0.12/0.38 ((~![X: $i, Y: $i] : ((~member(Y, singleton(X))) | (Y = X))) <=> (~![X: $i, Y: $i] : ((~member(Y, singleton(X))) | (Y = X)))),
% 0.12/0.38 inference(rewrite,[status(thm)],[])).
% 0.12/0.38 tff(14,plain,
% 0.12/0.38 ((~![X: $i, Y: $i] : (member(Y, singleton(X)) => (Y = X))) <=> (~![X: $i, Y: $i] : ((~member(Y, singleton(X))) | (Y = X)))),
% 0.12/0.38 inference(rewrite,[status(thm)],[])).
% 0.12/0.38 tff(15,axiom,(~![X: $i, Y: $i] : (member(Y, singleton(X)) => (Y = X))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','only_member_in_singleton')).
% 0.12/0.38 tff(16,plain,
% 0.12/0.38 (~![X: $i, Y: $i] : ((~member(Y, singleton(X))) | (Y = X))),
% 0.12/0.38 inference(modus_ponens,[status(thm)],[15, 14])).
% 0.12/0.38 tff(17,plain,
% 0.12/0.38 (~![X: $i, Y: $i] : ((~member(Y, singleton(X))) | (Y = X))),
% 0.12/0.38 inference(modus_ponens,[status(thm)],[16, 13])).
% 0.12/0.38 tff(18,plain,
% 0.12/0.38 (~![X: $i, Y: $i] : ((~member(Y, singleton(X))) | (Y = X))),
% 0.12/0.38 inference(modus_ponens,[status(thm)],[17, 13])).
% 0.12/0.38 tff(19,plain,
% 0.12/0.38 (~![X: $i, Y: $i] : ((~member(Y, singleton(X))) | (Y = X))),
% 0.12/0.38 inference(modus_ponens,[status(thm)],[18, 13])).
% 0.12/0.38 tff(20,plain,(
% 0.12/0.38 ~((~member(Y!7, singleton(X!8))) | (Y!7 = X!8))),
% 0.12/0.38 inference(skolemize,[status(sab)],[19])).
% 0.12/0.38 tff(21,plain,
% 0.12/0.38 (member(Y!7, singleton(X!8))),
% 0.12/0.38 inference(or_elim,[status(thm)],[20])).
% 0.12/0.38 tff(22,plain,
% 0.12/0.38 (member(Y!7, unordered_pair(X!8, X!8))),
% 0.12/0.38 inference(modus_ponens,[status(thm)],[21, 12])).
% 0.12/0.38 tff(23,plain,
% 0.12/0.38 (^[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)))))),
% 0.12/0.38 inference(bind,[status(th)],[])).
% 0.12/0.38 tff(24,plain,
% 0.12/0.38 (![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))))),
% 0.12/0.38 inference(quant_intro,[status(thm)],[23])).
% 0.12/0.38 tff(25,plain,
% 0.12/0.38 (^[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))))))),
% 0.12/0.38 inference(bind,[status(th)],[])).
% 0.12/0.38 tff(26,plain,
% 0.12/0.38 (![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))))),
% 0.12/0.38 inference(quant_intro,[status(thm)],[25])).
% 0.12/0.38 tff(27,plain,
% 0.12/0.38 (![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))))),
% 0.12/0.38 inference(rewrite,[status(thm)],[])).
% 0.12/0.38 tff(28,plain,
% 0.12/0.38 (^[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)))))),
% 0.12/0.38 inference(bind,[status(th)],[])).
% 0.12/0.38 tff(29,plain,
% 0.12/0.38 (![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))))),
% 0.12/0.38 inference(quant_intro,[status(thm)],[28])).
% 0.12/0.38 tff(30,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')).
% 0.12/0.38 tff(31,plain,
% 0.12/0.38 (![U: $i, X: $i, Y: $i] : (member(U, unordered_pair(X, Y)) <=> (member(U, universal_class) & ((U = Y) | (U = X))))),
% 0.12/0.38 inference(modus_ponens,[status(thm)],[30, 29])).
% 0.12/0.38 tff(32,plain,
% 0.12/0.38 (![U: $i, X: $i, Y: $i] : (member(U, unordered_pair(X, Y)) <=> (member(U, universal_class) & ((U = Y) | (U = X))))),
% 0.12/0.38 inference(modus_ponens,[status(thm)],[31, 27])).
% 0.12/0.38 tff(33,plain,(
% 0.12/0.38 ![U: $i, X: $i, Y: $i] : (member(U, unordered_pair(X, Y)) <=> (member(U, universal_class) & ((U = Y) | (U = X))))),
% 0.12/0.38 inference(skolemize,[status(sab)],[32])).
% 0.12/0.38 tff(34,plain,
% 0.12/0.38 (![U: $i, X: $i, Y: $i] : (~(((~member(U, universal_class)) | (~((U = Y) | (U = X)))) <=> member(U, unordered_pair(X, Y))))),
% 0.12/0.38 inference(modus_ponens,[status(thm)],[33, 26])).
% 0.12/0.38 tff(35,plain,
% 0.12/0.38 (![U: $i, X: $i, Y: $i] : (~(((~member(U, universal_class)) | (~((U = Y) | (U = X)))) <=> member(U, unordered_pair(X, Y))))),
% 0.12/0.38 inference(modus_ponens,[status(thm)],[34, 24])).
% 0.12/0.38 tff(36,plain,
% 0.12/0.38 (((~![U: $i, X: $i, Y: $i] : (~(((~member(U, universal_class)) | (~((U = Y) | (U = X)))) <=> member(U, unordered_pair(X, Y))))) | (~(((~(Y!7 = X!8)) | (~member(Y!7, universal_class))) <=> member(Y!7, unordered_pair(X!8, X!8))))) <=> ((~![U: $i, X: $i, Y: $i] : (~(((~member(U, universal_class)) | (~((U = Y) | (U = X)))) <=> member(U, unordered_pair(X, Y))))) | (~(((~(Y!7 = X!8)) | (~member(Y!7, universal_class))) <=> member(Y!7, unordered_pair(X!8, X!8)))))),
% 0.12/0.38 inference(rewrite,[status(thm)],[])).
% 0.12/0.38 tff(37,plain,
% 0.12/0.38 ((~(((~(Y!7 = X!8)) | (~member(Y!7, universal_class))) <=> member(Y!7, unordered_pair(X!8, X!8)))) <=> (~(((~(Y!7 = X!8)) | (~member(Y!7, universal_class))) <=> member(Y!7, unordered_pair(X!8, X!8))))),
% 0.12/0.39 inference(rewrite,[status(thm)],[])).
% 0.12/0.39 tff(38,plain,
% 0.12/0.39 ((((~member(Y!7, universal_class)) | (~((Y!7 = X!8) | (Y!7 = X!8)))) <=> member(Y!7, unordered_pair(X!8, X!8))) <=> (((~(Y!7 = X!8)) | (~member(Y!7, universal_class))) <=> member(Y!7, unordered_pair(X!8, X!8)))),
% 0.12/0.39 inference(rewrite,[status(thm)],[])).
% 0.12/0.39 tff(39,plain,
% 0.12/0.39 ((~(((~member(Y!7, universal_class)) | (~((Y!7 = X!8) | (Y!7 = X!8)))) <=> member(Y!7, unordered_pair(X!8, X!8)))) <=> (~(((~(Y!7 = X!8)) | (~member(Y!7, universal_class))) <=> member(Y!7, unordered_pair(X!8, X!8))))),
% 0.12/0.39 inference(monotonicity,[status(thm)],[38])).
% 0.12/0.39 tff(40,plain,
% 0.12/0.39 ((~(((~member(Y!7, universal_class)) | (~((Y!7 = X!8) | (Y!7 = X!8)))) <=> member(Y!7, unordered_pair(X!8, X!8)))) <=> (~(((~(Y!7 = X!8)) | (~member(Y!7, universal_class))) <=> member(Y!7, unordered_pair(X!8, X!8))))),
% 0.12/0.39 inference(transitivity,[status(thm)],[39, 37])).
% 0.12/0.39 tff(41,plain,
% 0.12/0.39 (((~![U: $i, X: $i, Y: $i] : (~(((~member(U, universal_class)) | (~((U = Y) | (U = X)))) <=> member(U, unordered_pair(X, Y))))) | (~(((~member(Y!7, universal_class)) | (~((Y!7 = X!8) | (Y!7 = X!8)))) <=> member(Y!7, unordered_pair(X!8, X!8))))) <=> ((~![U: $i, X: $i, Y: $i] : (~(((~member(U, universal_class)) | (~((U = Y) | (U = X)))) <=> member(U, unordered_pair(X, Y))))) | (~(((~(Y!7 = X!8)) | (~member(Y!7, universal_class))) <=> member(Y!7, unordered_pair(X!8, X!8)))))),
% 0.12/0.39 inference(monotonicity,[status(thm)],[40])).
% 0.12/0.39 tff(42,plain,
% 0.12/0.39 (((~![U: $i, X: $i, Y: $i] : (~(((~member(U, universal_class)) | (~((U = Y) | (U = X)))) <=> member(U, unordered_pair(X, Y))))) | (~(((~member(Y!7, universal_class)) | (~((Y!7 = X!8) | (Y!7 = X!8)))) <=> member(Y!7, unordered_pair(X!8, X!8))))) <=> ((~![U: $i, X: $i, Y: $i] : (~(((~member(U, universal_class)) | (~((U = Y) | (U = X)))) <=> member(U, unordered_pair(X, Y))))) | (~(((~(Y!7 = X!8)) | (~member(Y!7, universal_class))) <=> member(Y!7, unordered_pair(X!8, X!8)))))),
% 0.12/0.39 inference(transitivity,[status(thm)],[41, 36])).
% 0.12/0.39 tff(43,plain,
% 0.12/0.39 ((~![U: $i, X: $i, Y: $i] : (~(((~member(U, universal_class)) | (~((U = Y) | (U = X)))) <=> member(U, unordered_pair(X, Y))))) | (~(((~member(Y!7, universal_class)) | (~((Y!7 = X!8) | (Y!7 = X!8)))) <=> member(Y!7, unordered_pair(X!8, X!8))))),
% 0.12/0.39 inference(quant_inst,[status(thm)],[])).
% 0.12/0.39 tff(44,plain,
% 0.12/0.39 ((~![U: $i, X: $i, Y: $i] : (~(((~member(U, universal_class)) | (~((U = Y) | (U = X)))) <=> member(U, unordered_pair(X, Y))))) | (~(((~(Y!7 = X!8)) | (~member(Y!7, universal_class))) <=> member(Y!7, unordered_pair(X!8, X!8))))),
% 0.12/0.39 inference(modus_ponens,[status(thm)],[43, 42])).
% 0.12/0.39 tff(45,plain,
% 0.12/0.39 (~(((~(Y!7 = X!8)) | (~member(Y!7, universal_class))) <=> member(Y!7, unordered_pair(X!8, X!8)))),
% 0.12/0.39 inference(unit_resolution,[status(thm)],[44, 35])).
% 0.12/0.39 tff(46,plain,
% 0.12/0.39 (~(Y!7 = X!8)),
% 0.12/0.39 inference(or_elim,[status(thm)],[20])).
% 0.12/0.39 tff(47,plain,
% 0.12/0.39 (((~(Y!7 = X!8)) | (~member(Y!7, universal_class))) | (Y!7 = X!8)),
% 0.12/0.39 inference(tautology,[status(thm)],[])).
% 0.12/0.39 tff(48,plain,
% 0.12/0.39 ((~(Y!7 = X!8)) | (~member(Y!7, universal_class))),
% 0.12/0.39 inference(unit_resolution,[status(thm)],[47, 46])).
% 0.12/0.39 tff(49,plain,
% 0.12/0.39 ((((~(Y!7 = X!8)) | (~member(Y!7, universal_class))) <=> member(Y!7, unordered_pair(X!8, X!8))) | (~((~(Y!7 = X!8)) | (~member(Y!7, universal_class)))) | (~member(Y!7, unordered_pair(X!8, X!8)))),
% 0.12/0.39 inference(tautology,[status(thm)],[])).
% 0.12/0.39 tff(50,plain,
% 0.12/0.39 ((((~(Y!7 = X!8)) | (~member(Y!7, universal_class))) <=> member(Y!7, unordered_pair(X!8, X!8))) | (~member(Y!7, unordered_pair(X!8, X!8)))),
% 0.12/0.39 inference(unit_resolution,[status(thm)],[49, 48])).
% 0.12/0.39 tff(51,plain,
% 0.12/0.39 (~member(Y!7, unordered_pair(X!8, X!8))),
% 0.12/0.39 inference(unit_resolution,[status(thm)],[50, 45])).
% 0.12/0.39 tff(52,plain,
% 0.12/0.39 ($false),
% 0.12/0.39 inference(unit_resolution,[status(thm)],[51, 22])).
% 0.12/0.39 % SZS output end Proof
% 0.12/0.39 % E exiting
%------------------------------------------------------------------------------