TSTP Solution File: SET101+1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SET101+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n022.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 : Tue Sep 20 05:05:39 EDT 2022
% Result : Theorem 0.12s 0.40s
% Output : Proof 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SET101+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.10/0.12 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.12/0.33 % Computer : n022.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 : Sat Sep 3 02:25:09 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.12/0.34 Usage: tptp [options] [-file:]file
% 0.12/0.34 -h, -? prints this message.
% 0.12/0.34 -smt2 print SMT-LIB2 benchmark.
% 0.12/0.34 -m, -model generate model.
% 0.12/0.34 -p, -proof generate proof.
% 0.12/0.34 -c, -core generate unsat core of named formulas.
% 0.12/0.34 -st, -statistics display statistics.
% 0.12/0.34 -t:timeout set timeout (in second).
% 0.12/0.34 -smt2status display status in smt2 format instead of SZS.
% 0.12/0.34 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.12/0.34 -<param>:<value> configuration parameter and value.
% 0.12/0.34 -o:<output-file> file to place output in.
% 0.12/0.40 % SZS status Theorem
% 0.12/0.40 % SZS output start Proof
% 0.12/0.40 tff(member_type, type, (
% 0.12/0.40 member: ( $i * $i ) > $o)).
% 0.12/0.40 tff(unordered_pair_type, type, (
% 0.12/0.40 unordered_pair: ( $i * $i ) > $i)).
% 0.12/0.40 tff(singleton_type, type, (
% 0.12/0.40 singleton: $i > $i)).
% 0.12/0.40 tff(tptp_fun_Y_7_type, type, (
% 0.12/0.40 tptp_fun_Y_7: $i)).
% 0.12/0.40 tff(tptp_fun_X_8_type, type, (
% 0.12/0.40 tptp_fun_X_8: $i)).
% 0.12/0.40 tff(ordered_pair_type, type, (
% 0.12/0.40 ordered_pair: ( $i * $i ) > $i)).
% 0.12/0.40 tff(universal_class_type, type, (
% 0.12/0.40 universal_class: $i)).
% 0.12/0.40 tff(1,plain,
% 0.12/0.40 (^[X: $i, Y: $i] : refl((ordered_pair(X, Y) = unordered_pair(singleton(X), unordered_pair(X, singleton(Y)))) <=> (ordered_pair(X, Y) = unordered_pair(singleton(X), unordered_pair(X, singleton(Y)))))),
% 0.12/0.40 inference(bind,[status(th)],[])).
% 0.12/0.40 tff(2,plain,
% 0.12/0.40 (![X: $i, Y: $i] : (ordered_pair(X, Y) = unordered_pair(singleton(X), unordered_pair(X, singleton(Y)))) <=> ![X: $i, Y: $i] : (ordered_pair(X, Y) = unordered_pair(singleton(X), unordered_pair(X, singleton(Y))))),
% 0.12/0.40 inference(quant_intro,[status(thm)],[1])).
% 0.12/0.40 tff(3,plain,
% 0.12/0.40 (![X: $i, Y: $i] : (ordered_pair(X, Y) = unordered_pair(singleton(X), unordered_pair(X, singleton(Y)))) <=> ![X: $i, Y: $i] : (ordered_pair(X, Y) = unordered_pair(singleton(X), unordered_pair(X, singleton(Y))))),
% 0.12/0.40 inference(rewrite,[status(thm)],[])).
% 0.12/0.40 tff(4,axiom,(![X: $i, Y: $i] : (ordered_pair(X, Y) = unordered_pair(singleton(X), unordered_pair(X, singleton(Y))))), file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax','ordered_pair_defn')).
% 0.12/0.40 tff(5,plain,
% 0.12/0.40 (![X: $i, Y: $i] : (ordered_pair(X, Y) = unordered_pair(singleton(X), unordered_pair(X, singleton(Y))))),
% 0.12/0.40 inference(modus_ponens,[status(thm)],[4, 3])).
% 0.12/0.40 tff(6,plain,(
% 0.12/0.40 ![X: $i, Y: $i] : (ordered_pair(X, Y) = unordered_pair(singleton(X), unordered_pair(X, singleton(Y))))),
% 0.12/0.40 inference(skolemize,[status(sab)],[5])).
% 0.12/0.40 tff(7,plain,
% 0.12/0.40 (![X: $i, Y: $i] : (ordered_pair(X, Y) = unordered_pair(singleton(X), unordered_pair(X, singleton(Y))))),
% 0.12/0.40 inference(modus_ponens,[status(thm)],[6, 2])).
% 0.12/0.40 tff(8,plain,
% 0.12/0.40 ((~![X: $i, Y: $i] : (ordered_pair(X, Y) = unordered_pair(singleton(X), unordered_pair(X, singleton(Y))))) | (ordered_pair(X!8, Y!7) = unordered_pair(singleton(X!8), unordered_pair(X!8, singleton(Y!7))))),
% 0.12/0.40 inference(quant_inst,[status(thm)],[])).
% 0.12/0.40 tff(9,plain,
% 0.12/0.40 (ordered_pair(X!8, Y!7) = unordered_pair(singleton(X!8), unordered_pair(X!8, singleton(Y!7)))),
% 0.12/0.40 inference(unit_resolution,[status(thm)],[8, 7])).
% 0.12/0.40 tff(10,plain,
% 0.12/0.40 (unordered_pair(singleton(X!8), unordered_pair(X!8, singleton(Y!7))) = ordered_pair(X!8, Y!7)),
% 0.12/0.40 inference(symmetry,[status(thm)],[9])).
% 0.12/0.40 tff(11,plain,
% 0.12/0.40 (^[X: $i] : refl((singleton(X) = unordered_pair(X, X)) <=> (singleton(X) = unordered_pair(X, X)))),
% 0.12/0.40 inference(bind,[status(th)],[])).
% 0.12/0.40 tff(12,plain,
% 0.12/0.40 (![X: $i] : (singleton(X) = unordered_pair(X, X)) <=> ![X: $i] : (singleton(X) = unordered_pair(X, X))),
% 0.12/0.40 inference(quant_intro,[status(thm)],[11])).
% 0.12/0.40 tff(13,plain,
% 0.12/0.40 (![X: $i] : (singleton(X) = unordered_pair(X, X)) <=> ![X: $i] : (singleton(X) = unordered_pair(X, X))),
% 0.12/0.40 inference(rewrite,[status(thm)],[])).
% 0.12/0.40 tff(14,axiom,(![X: $i] : (singleton(X) = unordered_pair(X, X))), file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax','singleton_set_defn')).
% 0.12/0.40 tff(15,plain,
% 0.12/0.40 (![X: $i] : (singleton(X) = unordered_pair(X, X))),
% 0.12/0.40 inference(modus_ponens,[status(thm)],[14, 13])).
% 0.12/0.40 tff(16,plain,(
% 0.12/0.40 ![X: $i] : (singleton(X) = unordered_pair(X, X))),
% 0.12/0.40 inference(skolemize,[status(sab)],[15])).
% 0.12/0.40 tff(17,plain,
% 0.12/0.40 (![X: $i] : (singleton(X) = unordered_pair(X, X))),
% 0.12/0.40 inference(modus_ponens,[status(thm)],[16, 12])).
% 0.12/0.40 tff(18,plain,
% 0.12/0.40 ((~![X: $i] : (singleton(X) = unordered_pair(X, X))) | (singleton(X!8) = unordered_pair(X!8, X!8))),
% 0.12/0.40 inference(quant_inst,[status(thm)],[])).
% 0.12/0.40 tff(19,plain,
% 0.12/0.40 (singleton(X!8) = unordered_pair(X!8, X!8)),
% 0.12/0.40 inference(unit_resolution,[status(thm)],[18, 17])).
% 0.12/0.40 tff(20,plain,
% 0.12/0.40 (unordered_pair(X!8, X!8) = singleton(X!8)),
% 0.12/0.40 inference(symmetry,[status(thm)],[19])).
% 0.12/0.40 tff(21,plain,
% 0.12/0.40 (unordered_pair(unordered_pair(X!8, X!8), unordered_pair(X!8, singleton(Y!7))) = unordered_pair(singleton(X!8), unordered_pair(X!8, singleton(Y!7)))),
% 0.12/0.40 inference(monotonicity,[status(thm)],[20])).
% 0.12/0.40 tff(22,plain,
% 0.12/0.40 (unordered_pair(unordered_pair(X!8, X!8), unordered_pair(X!8, singleton(Y!7))) = ordered_pair(X!8, Y!7)),
% 0.12/0.40 inference(transitivity,[status(thm)],[21, 10])).
% 0.12/0.40 tff(23,plain,
% 0.12/0.40 (member(unordered_pair(X!8, X!8), unordered_pair(unordered_pair(X!8, X!8), unordered_pair(X!8, singleton(Y!7)))) <=> member(singleton(X!8), ordered_pair(X!8, Y!7))),
% 0.12/0.40 inference(monotonicity,[status(thm)],[20, 22])).
% 0.12/0.40 tff(24,plain,
% 0.12/0.40 (member(singleton(X!8), ordered_pair(X!8, Y!7)) <=> member(unordered_pair(X!8, X!8), unordered_pair(unordered_pair(X!8, X!8), unordered_pair(X!8, singleton(Y!7))))),
% 0.12/0.40 inference(symmetry,[status(thm)],[23])).
% 0.12/0.40 tff(25,plain,
% 0.12/0.40 ((~member(singleton(X!8), ordered_pair(X!8, Y!7))) <=> (~member(unordered_pair(X!8, X!8), unordered_pair(unordered_pair(X!8, X!8), unordered_pair(X!8, singleton(Y!7)))))),
% 0.12/0.40 inference(monotonicity,[status(thm)],[24])).
% 0.12/0.40 tff(26,plain,
% 0.12/0.40 ((~![X: $i, Y: $i] : member(singleton(X), ordered_pair(X, Y))) <=> (~![X: $i, Y: $i] : member(singleton(X), ordered_pair(X, Y)))),
% 0.12/0.40 inference(rewrite,[status(thm)],[])).
% 0.12/0.40 tff(27,axiom,(~![X: $i, Y: $i] : member(singleton(X), ordered_pair(X, Y))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','singleton_member_of_ordered_pair')).
% 0.12/0.40 tff(28,plain,
% 0.12/0.40 (~![X: $i, Y: $i] : member(singleton(X), ordered_pair(X, Y))),
% 0.12/0.40 inference(modus_ponens,[status(thm)],[27, 26])).
% 0.12/0.40 tff(29,plain,
% 0.12/0.40 (~![X: $i, Y: $i] : member(singleton(X), ordered_pair(X, Y))),
% 0.12/0.40 inference(modus_ponens,[status(thm)],[28, 26])).
% 0.12/0.40 tff(30,plain,
% 0.12/0.40 (~![X: $i, Y: $i] : member(singleton(X), ordered_pair(X, Y))),
% 0.12/0.40 inference(modus_ponens,[status(thm)],[29, 26])).
% 0.12/0.40 tff(31,plain,
% 0.12/0.40 (~![X: $i, Y: $i] : member(singleton(X), ordered_pair(X, Y))),
% 0.12/0.40 inference(modus_ponens,[status(thm)],[30, 26])).
% 0.12/0.40 tff(32,plain,
% 0.12/0.40 (~![X: $i, Y: $i] : member(singleton(X), ordered_pair(X, Y))),
% 0.12/0.40 inference(modus_ponens,[status(thm)],[31, 26])).
% 0.12/0.40 tff(33,plain,
% 0.12/0.40 (~![X: $i, Y: $i] : member(singleton(X), ordered_pair(X, Y))),
% 0.12/0.40 inference(modus_ponens,[status(thm)],[32, 26])).
% 0.12/0.40 tff(34,plain,
% 0.12/0.40 (~![X: $i, Y: $i] : member(singleton(X), ordered_pair(X, Y))),
% 0.12/0.40 inference(modus_ponens,[status(thm)],[33, 26])).
% 0.12/0.40 tff(35,plain,(
% 0.12/0.40 ~member(singleton(X!8), ordered_pair(X!8, Y!7))),
% 0.12/0.40 inference(skolemize,[status(sab)],[34])).
% 0.12/0.40 tff(36,plain,
% 0.12/0.40 (~member(unordered_pair(X!8, X!8), unordered_pair(unordered_pair(X!8, X!8), unordered_pair(X!8, singleton(Y!7))))),
% 0.12/0.40 inference(modus_ponens,[status(thm)],[35, 25])).
% 0.12/0.40 tff(37,plain,
% 0.12/0.40 (^[U: $i, X: $i, Y: $i] : refl((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)))))))),
% 0.12/0.40 inference(bind,[status(th)],[])).
% 0.12/0.40 tff(38,plain,
% 0.12/0.40 (![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.40 inference(quant_intro,[status(thm)],[37])).
% 0.12/0.40 tff(39,plain,
% 0.12/0.40 (^[U: $i, X: $i, Y: $i] : rewrite((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)))))))),
% 0.12/0.40 inference(bind,[status(th)],[])).
% 0.12/0.40 tff(40,plain,
% 0.12/0.40 (![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.40 inference(quant_intro,[status(thm)],[39])).
% 0.12/0.40 tff(41,plain,
% 0.12/0.40 (![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.40 inference(rewrite,[status(thm)],[])).
% 0.12/0.40 tff(42,plain,
% 0.12/0.40 (^[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.40 inference(bind,[status(th)],[])).
% 0.12/0.40 tff(43,plain,
% 0.12/0.40 (![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.40 inference(quant_intro,[status(thm)],[42])).
% 0.12/0.40 tff(44,axiom,(![U: $i, X: $i, Y: $i] : (member(U, unordered_pair(X, Y)) <=> (member(U, universal_class) & ((U = X) | (U = Y))))), file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax','unordered_pair_defn')).
% 0.12/0.40 tff(45,plain,
% 0.12/0.40 (![U: $i, X: $i, Y: $i] : (member(U, unordered_pair(X, Y)) <=> (member(U, universal_class) & ((U = Y) | (U = X))))),
% 0.12/0.40 inference(modus_ponens,[status(thm)],[44, 43])).
% 0.12/0.40 tff(46,plain,
% 0.12/0.40 (![U: $i, X: $i, Y: $i] : (member(U, unordered_pair(X, Y)) <=> (member(U, universal_class) & ((U = Y) | (U = X))))),
% 0.12/0.40 inference(modus_ponens,[status(thm)],[45, 41])).
% 0.12/0.40 tff(47,plain,(
% 0.12/0.40 ![U: $i, X: $i, Y: $i] : (member(U, unordered_pair(X, Y)) <=> (member(U, universal_class) & ((U = Y) | (U = X))))),
% 0.12/0.40 inference(skolemize,[status(sab)],[46])).
% 0.12/0.40 tff(48,plain,
% 0.12/0.40 (![U: $i, X: $i, Y: $i] : (member(U, unordered_pair(X, Y)) <=> (~((~member(U, universal_class)) | (~((U = Y) | (U = X))))))),
% 0.12/0.40 inference(modus_ponens,[status(thm)],[47, 40])).
% 0.12/0.40 tff(49,plain,
% 0.12/0.40 (![U: $i, X: $i, Y: $i] : (member(U, unordered_pair(X, Y)) <=> (~((~member(U, universal_class)) | (~((U = Y) | (U = X))))))),
% 0.12/0.40 inference(modus_ponens,[status(thm)],[48, 38])).
% 0.12/0.40 tff(50,plain,
% 0.12/0.40 (((~![U: $i, X: $i, Y: $i] : (member(U, unordered_pair(X, Y)) <=> (~((~member(U, universal_class)) | (~((U = Y) | (U = X))))))) | (member(unordered_pair(X!8, X!8), unordered_pair(unordered_pair(X!8, X!8), unordered_pair(X!8, singleton(Y!7)))) <=> member(unordered_pair(X!8, X!8), universal_class))) <=> ((~![U: $i, X: $i, Y: $i] : (member(U, unordered_pair(X, Y)) <=> (~((~member(U, universal_class)) | (~((U = Y) | (U = X))))))) | (member(unordered_pair(X!8, X!8), unordered_pair(unordered_pair(X!8, X!8), unordered_pair(X!8, singleton(Y!7)))) <=> member(unordered_pair(X!8, X!8), universal_class)))),
% 0.12/0.40 inference(rewrite,[status(thm)],[])).
% 0.12/0.40 tff(51,plain,
% 0.12/0.40 ((member(unordered_pair(X!8, X!8), unordered_pair(unordered_pair(X!8, X!8), unordered_pair(X!8, singleton(Y!7)))) <=> (~((~member(unordered_pair(X!8, X!8), universal_class)) | (~((unordered_pair(X!8, X!8) = unordered_pair(X!8, singleton(Y!7))) | (unordered_pair(X!8, X!8) = unordered_pair(X!8, X!8))))))) <=> (member(unordered_pair(X!8, X!8), unordered_pair(unordered_pair(X!8, X!8), unordered_pair(X!8, singleton(Y!7)))) <=> member(unordered_pair(X!8, X!8), universal_class))),
% 0.12/0.40 inference(rewrite,[status(thm)],[])).
% 0.12/0.40 tff(52,plain,
% 0.12/0.40 (((~![U: $i, X: $i, Y: $i] : (member(U, unordered_pair(X, Y)) <=> (~((~member(U, universal_class)) | (~((U = Y) | (U = X))))))) | (member(unordered_pair(X!8, X!8), unordered_pair(unordered_pair(X!8, X!8), unordered_pair(X!8, singleton(Y!7)))) <=> (~((~member(unordered_pair(X!8, X!8), universal_class)) | (~((unordered_pair(X!8, X!8) = unordered_pair(X!8, singleton(Y!7))) | (unordered_pair(X!8, X!8) = unordered_pair(X!8, X!8)))))))) <=> ((~![U: $i, X: $i, Y: $i] : (member(U, unordered_pair(X, Y)) <=> (~((~member(U, universal_class)) | (~((U = Y) | (U = X))))))) | (member(unordered_pair(X!8, X!8), unordered_pair(unordered_pair(X!8, X!8), unordered_pair(X!8, singleton(Y!7)))) <=> member(unordered_pair(X!8, X!8), universal_class)))),
% 0.12/0.40 inference(monotonicity,[status(thm)],[51])).
% 0.12/0.40 tff(53,plain,
% 0.12/0.40 (((~![U: $i, X: $i, Y: $i] : (member(U, unordered_pair(X, Y)) <=> (~((~member(U, universal_class)) | (~((U = Y) | (U = X))))))) | (member(unordered_pair(X!8, X!8), unordered_pair(unordered_pair(X!8, X!8), unordered_pair(X!8, singleton(Y!7)))) <=> (~((~member(unordered_pair(X!8, X!8), universal_class)) | (~((unordered_pair(X!8, X!8) = unordered_pair(X!8, singleton(Y!7))) | (unordered_pair(X!8, X!8) = unordered_pair(X!8, X!8)))))))) <=> ((~![U: $i, X: $i, Y: $i] : (member(U, unordered_pair(X, Y)) <=> (~((~member(U, universal_class)) | (~((U = Y) | (U = X))))))) | (member(unordered_pair(X!8, X!8), unordered_pair(unordered_pair(X!8, X!8), unordered_pair(X!8, singleton(Y!7)))) <=> member(unordered_pair(X!8, X!8), universal_class)))),
% 0.12/0.41 inference(transitivity,[status(thm)],[52, 50])).
% 0.12/0.41 tff(54,plain,
% 0.12/0.41 ((~![U: $i, X: $i, Y: $i] : (member(U, unordered_pair(X, Y)) <=> (~((~member(U, universal_class)) | (~((U = Y) | (U = X))))))) | (member(unordered_pair(X!8, X!8), unordered_pair(unordered_pair(X!8, X!8), unordered_pair(X!8, singleton(Y!7)))) <=> (~((~member(unordered_pair(X!8, X!8), universal_class)) | (~((unordered_pair(X!8, X!8) = unordered_pair(X!8, singleton(Y!7))) | (unordered_pair(X!8, X!8) = unordered_pair(X!8, X!8)))))))),
% 0.12/0.41 inference(quant_inst,[status(thm)],[])).
% 0.12/0.41 tff(55,plain,
% 0.12/0.41 ((~![U: $i, X: $i, Y: $i] : (member(U, unordered_pair(X, Y)) <=> (~((~member(U, universal_class)) | (~((U = Y) | (U = X))))))) | (member(unordered_pair(X!8, X!8), unordered_pair(unordered_pair(X!8, X!8), unordered_pair(X!8, singleton(Y!7)))) <=> member(unordered_pair(X!8, X!8), universal_class))),
% 0.12/0.41 inference(modus_ponens,[status(thm)],[54, 53])).
% 0.12/0.41 tff(56,plain,
% 0.12/0.41 (member(unordered_pair(X!8, X!8), unordered_pair(unordered_pair(X!8, X!8), unordered_pair(X!8, singleton(Y!7)))) <=> member(unordered_pair(X!8, X!8), universal_class)),
% 0.12/0.41 inference(unit_resolution,[status(thm)],[55, 49])).
% 0.12/0.41 tff(57,plain,
% 0.12/0.41 (^[X: $i, Y: $i] : refl(member(unordered_pair(X, Y), universal_class) <=> member(unordered_pair(X, Y), universal_class))),
% 0.12/0.41 inference(bind,[status(th)],[])).
% 0.12/0.41 tff(58,plain,
% 0.12/0.41 (![X: $i, Y: $i] : member(unordered_pair(X, Y), universal_class) <=> ![X: $i, Y: $i] : member(unordered_pair(X, Y), universal_class)),
% 0.12/0.41 inference(quant_intro,[status(thm)],[57])).
% 0.12/0.41 tff(59,plain,
% 0.12/0.41 (![X: $i, Y: $i] : member(unordered_pair(X, Y), universal_class) <=> ![X: $i, Y: $i] : member(unordered_pair(X, Y), universal_class)),
% 0.12/0.41 inference(rewrite,[status(thm)],[])).
% 0.12/0.41 tff(60,axiom,(![X: $i, Y: $i] : member(unordered_pair(X, Y), universal_class)), file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax','unordered_pair')).
% 0.12/0.41 tff(61,plain,
% 0.12/0.41 (![X: $i, Y: $i] : member(unordered_pair(X, Y), universal_class)),
% 0.12/0.41 inference(modus_ponens,[status(thm)],[60, 59])).
% 0.12/0.41 tff(62,plain,(
% 0.12/0.41 ![X: $i, Y: $i] : member(unordered_pair(X, Y), universal_class)),
% 0.12/0.41 inference(skolemize,[status(sab)],[61])).
% 0.12/0.41 tff(63,plain,
% 0.12/0.41 (![X: $i, Y: $i] : member(unordered_pair(X, Y), universal_class)),
% 0.12/0.41 inference(modus_ponens,[status(thm)],[62, 58])).
% 0.12/0.41 tff(64,plain,
% 0.12/0.41 ((~![X: $i, Y: $i] : member(unordered_pair(X, Y), universal_class)) | member(unordered_pair(X!8, X!8), universal_class)),
% 0.12/0.41 inference(quant_inst,[status(thm)],[])).
% 0.12/0.41 tff(65,plain,
% 0.12/0.41 (member(unordered_pair(X!8, X!8), universal_class)),
% 0.12/0.41 inference(unit_resolution,[status(thm)],[64, 63])).
% 0.12/0.41 tff(66,plain,
% 0.12/0.41 ((~(member(unordered_pair(X!8, X!8), unordered_pair(unordered_pair(X!8, X!8), unordered_pair(X!8, singleton(Y!7)))) <=> member(unordered_pair(X!8, X!8), universal_class))) | member(unordered_pair(X!8, X!8), unordered_pair(unordered_pair(X!8, X!8), unordered_pair(X!8, singleton(Y!7)))) | (~member(unordered_pair(X!8, X!8), universal_class))),
% 0.12/0.41 inference(tautology,[status(thm)],[])).
% 0.12/0.41 tff(67,plain,
% 0.12/0.41 ((~(member(unordered_pair(X!8, X!8), unordered_pair(unordered_pair(X!8, X!8), unordered_pair(X!8, singleton(Y!7)))) <=> member(unordered_pair(X!8, X!8), universal_class))) | member(unordered_pair(X!8, X!8), unordered_pair(unordered_pair(X!8, X!8), unordered_pair(X!8, singleton(Y!7))))),
% 0.12/0.41 inference(unit_resolution,[status(thm)],[66, 65])).
% 0.12/0.41 tff(68,plain,
% 0.12/0.41 (member(unordered_pair(X!8, X!8), unordered_pair(unordered_pair(X!8, X!8), unordered_pair(X!8, singleton(Y!7))))),
% 0.12/0.41 inference(unit_resolution,[status(thm)],[67, 56])).
% 0.12/0.41 tff(69,plain,
% 0.12/0.41 ($false),
% 0.12/0.41 inference(unit_resolution,[status(thm)],[68, 36])).
% 0.12/0.41 % SZS output end Proof
%------------------------------------------------------------------------------