TSTP Solution File: SET123-6 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SET123-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% 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 : Tue Sep 20 05:05:49 EDT 2022
% Result : Unsatisfiable 1.32s 1.12s
% Output : Proof 1.39s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET123-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.07/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.35 % Computer : n013.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat Sep 3 02:39:47 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.35 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.13/0.35 Usage: tptp [options] [-file:]file
% 0.13/0.35 -h, -? prints this message.
% 0.13/0.35 -smt2 print SMT-LIB2 benchmark.
% 0.13/0.35 -m, -model generate model.
% 0.13/0.35 -p, -proof generate proof.
% 0.13/0.35 -c, -core generate unsat core of named formulas.
% 0.13/0.35 -st, -statistics display statistics.
% 0.13/0.35 -t:timeout set timeout (in second).
% 0.13/0.35 -smt2status display status in smt2 format instead of SZS.
% 0.13/0.35 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.13/0.35 -<param>:<value> configuration parameter and value.
% 0.13/0.35 -o:<output-file> file to place output in.
% 1.32/1.12 % SZS status Unsatisfiable
% 1.32/1.12 % SZS output start Proof
% 1.32/1.12 tff(member_type, type, (
% 1.32/1.12 member: ( $i * $i ) > $o)).
% 1.32/1.12 tff(universal_class_type, type, (
% 1.32/1.12 universal_class: $i)).
% 1.32/1.12 tff(x_type, type, (
% 1.32/1.12 x: $i)).
% 1.32/1.12 tff(subclass_type, type, (
% 1.32/1.12 subclass: ( $i * $i ) > $o)).
% 1.32/1.12 tff(set_builder_type, type, (
% 1.32/1.12 set_builder: ( $i * $i ) > $i)).
% 1.32/1.12 tff(z_type, type, (
% 1.32/1.12 z: $i)).
% 1.32/1.12 tff(y_type, type, (
% 1.32/1.12 y: $i)).
% 1.32/1.12 tff(complement_type, type, (
% 1.32/1.12 complement: $i > $i)).
% 1.32/1.12 tff(singleton_type, type, (
% 1.32/1.12 singleton: $i > $i)).
% 1.32/1.12 tff(unordered_pair_type, type, (
% 1.32/1.12 unordered_pair: ( $i * $i ) > $i)).
% 1.32/1.12 tff(intersection_type, type, (
% 1.32/1.12 intersection: ( $i * $i ) > $i)).
% 1.32/1.12 tff(union_type, type, (
% 1.32/1.12 union: ( $i * $i ) > $i)).
% 1.32/1.12 tff(1,assumption,(~member(x, universal_class)), introduced(assumption)).
% 1.32/1.12 tff(2,assumption,(~subclass(set_builder(y, z), universal_class)), introduced(assumption)).
% 1.32/1.12 tff(3,plain,
% 1.32/1.12 (^[X: $i] : refl(subclass(X, universal_class) <=> subclass(X, universal_class))),
% 1.32/1.12 inference(bind,[status(th)],[])).
% 1.32/1.12 tff(4,plain,
% 1.32/1.12 (![X: $i] : subclass(X, universal_class) <=> ![X: $i] : subclass(X, universal_class)),
% 1.32/1.12 inference(quant_intro,[status(thm)],[3])).
% 1.32/1.12 tff(5,plain,
% 1.32/1.12 (![X: $i] : subclass(X, universal_class) <=> ![X: $i] : subclass(X, universal_class)),
% 1.32/1.12 inference(rewrite,[status(thm)],[])).
% 1.32/1.12 tff(6,axiom,(![X: $i] : subclass(X, universal_class)), file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax','class_elements_are_sets')).
% 1.32/1.12 tff(7,plain,
% 1.32/1.12 (![X: $i] : subclass(X, universal_class)),
% 1.32/1.12 inference(modus_ponens,[status(thm)],[6, 5])).
% 1.32/1.12 tff(8,plain,(
% 1.32/1.12 ![X: $i] : subclass(X, universal_class)),
% 1.32/1.12 inference(skolemize,[status(sab)],[7])).
% 1.32/1.12 tff(9,plain,
% 1.32/1.12 (![X: $i] : subclass(X, universal_class)),
% 1.32/1.12 inference(modus_ponens,[status(thm)],[8, 4])).
% 1.32/1.12 tff(10,plain,
% 1.32/1.12 ((~![X: $i] : subclass(X, universal_class)) | subclass(set_builder(y, z), universal_class)),
% 1.32/1.12 inference(quant_inst,[status(thm)],[])).
% 1.32/1.12 tff(11,plain,
% 1.32/1.12 ($false),
% 1.32/1.12 inference(unit_resolution,[status(thm)],[10, 9, 2])).
% 1.32/1.12 tff(12,plain,(subclass(set_builder(y, z), universal_class)), inference(lemma,lemma(discharge,[]))).
% 1.32/1.12 tff(13,plain,
% 1.32/1.12 (member(x, set_builder(y, z)) <=> member(x, set_builder(y, z))),
% 1.32/1.12 inference(rewrite,[status(thm)],[])).
% 1.32/1.12 tff(14,axiom,(member(x, set_builder(y, z))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','prove_set_builder_alternate_defn1_1')).
% 1.32/1.12 tff(15,plain,
% 1.32/1.12 (member(x, set_builder(y, z))),
% 1.32/1.12 inference(modus_ponens,[status(thm)],[14, 13])).
% 1.32/1.12 tff(16,plain,
% 1.32/1.12 (^[Y: $i, U: $i, X: $i] : refl((member(U, Y) | (~member(U, X)) | (~subclass(X, Y))) <=> (member(U, Y) | (~member(U, X)) | (~subclass(X, Y))))),
% 1.32/1.12 inference(bind,[status(th)],[])).
% 1.32/1.12 tff(17,plain,
% 1.32/1.12 (![Y: $i, U: $i, X: $i] : (member(U, Y) | (~member(U, X)) | (~subclass(X, Y))) <=> ![Y: $i, U: $i, X: $i] : (member(U, Y) | (~member(U, X)) | (~subclass(X, Y)))),
% 1.32/1.12 inference(quant_intro,[status(thm)],[16])).
% 1.32/1.12 tff(18,plain,
% 1.32/1.12 (![Y: $i, U: $i, X: $i] : (member(U, Y) | (~member(U, X)) | (~subclass(X, Y))) <=> ![Y: $i, U: $i, X: $i] : (member(U, Y) | (~member(U, X)) | (~subclass(X, Y)))),
% 1.32/1.12 inference(rewrite,[status(thm)],[])).
% 1.32/1.12 tff(19,plain,
% 1.32/1.12 (^[Y: $i, U: $i, X: $i] : trans(monotonicity(rewrite(((~subclass(X, Y)) | (~member(U, X))) <=> ((~member(U, X)) | (~subclass(X, Y)))), ((((~subclass(X, Y)) | (~member(U, X))) | member(U, Y)) <=> (((~member(U, X)) | (~subclass(X, Y))) | member(U, Y)))), rewrite((((~member(U, X)) | (~subclass(X, Y))) | member(U, Y)) <=> (member(U, Y) | (~member(U, X)) | (~subclass(X, Y)))), ((((~subclass(X, Y)) | (~member(U, X))) | member(U, Y)) <=> (member(U, Y) | (~member(U, X)) | (~subclass(X, Y)))))),
% 1.32/1.12 inference(bind,[status(th)],[])).
% 1.32/1.12 tff(20,plain,
% 1.32/1.12 (![Y: $i, U: $i, X: $i] : (((~subclass(X, Y)) | (~member(U, X))) | member(U, Y)) <=> ![Y: $i, U: $i, X: $i] : (member(U, Y) | (~member(U, X)) | (~subclass(X, Y)))),
% 1.32/1.12 inference(quant_intro,[status(thm)],[19])).
% 1.32/1.12 tff(21,axiom,(![Y: $i, U: $i, X: $i] : (((~subclass(X, Y)) | (~member(U, X))) | member(U, Y))), file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax','subclass_members')).
% 1.32/1.12 tff(22,plain,
% 1.32/1.12 (![Y: $i, U: $i, X: $i] : (member(U, Y) | (~member(U, X)) | (~subclass(X, Y)))),
% 1.32/1.12 inference(modus_ponens,[status(thm)],[21, 20])).
% 1.32/1.12 tff(23,plain,
% 1.32/1.12 (![Y: $i, U: $i, X: $i] : (member(U, Y) | (~member(U, X)) | (~subclass(X, Y)))),
% 1.32/1.12 inference(modus_ponens,[status(thm)],[22, 18])).
% 1.32/1.12 tff(24,plain,(
% 1.32/1.12 ![Y: $i, U: $i, X: $i] : (member(U, Y) | (~member(U, X)) | (~subclass(X, Y)))),
% 1.32/1.12 inference(skolemize,[status(sab)],[23])).
% 1.32/1.12 tff(25,plain,
% 1.32/1.12 (![Y: $i, U: $i, X: $i] : (member(U, Y) | (~member(U, X)) | (~subclass(X, Y)))),
% 1.32/1.12 inference(modus_ponens,[status(thm)],[24, 17])).
% 1.32/1.12 tff(26,plain,
% 1.32/1.12 (((~![Y: $i, U: $i, X: $i] : (member(U, Y) | (~member(U, X)) | (~subclass(X, Y)))) | ((~member(x, set_builder(y, z))) | member(x, universal_class) | (~subclass(set_builder(y, z), universal_class)))) <=> ((~![Y: $i, U: $i, X: $i] : (member(U, Y) | (~member(U, X)) | (~subclass(X, Y)))) | (~member(x, set_builder(y, z))) | member(x, universal_class) | (~subclass(set_builder(y, z), universal_class)))),
% 1.32/1.12 inference(rewrite,[status(thm)],[])).
% 1.32/1.12 tff(27,plain,
% 1.32/1.12 ((member(x, universal_class) | (~member(x, set_builder(y, z))) | (~subclass(set_builder(y, z), universal_class))) <=> ((~member(x, set_builder(y, z))) | member(x, universal_class) | (~subclass(set_builder(y, z), universal_class)))),
% 1.32/1.12 inference(rewrite,[status(thm)],[])).
% 1.32/1.12 tff(28,plain,
% 1.32/1.12 (((~![Y: $i, U: $i, X: $i] : (member(U, Y) | (~member(U, X)) | (~subclass(X, Y)))) | (member(x, universal_class) | (~member(x, set_builder(y, z))) | (~subclass(set_builder(y, z), universal_class)))) <=> ((~![Y: $i, U: $i, X: $i] : (member(U, Y) | (~member(U, X)) | (~subclass(X, Y)))) | ((~member(x, set_builder(y, z))) | member(x, universal_class) | (~subclass(set_builder(y, z), universal_class))))),
% 1.32/1.12 inference(monotonicity,[status(thm)],[27])).
% 1.32/1.12 tff(29,plain,
% 1.32/1.12 (((~![Y: $i, U: $i, X: $i] : (member(U, Y) | (~member(U, X)) | (~subclass(X, Y)))) | (member(x, universal_class) | (~member(x, set_builder(y, z))) | (~subclass(set_builder(y, z), universal_class)))) <=> ((~![Y: $i, U: $i, X: $i] : (member(U, Y) | (~member(U, X)) | (~subclass(X, Y)))) | (~member(x, set_builder(y, z))) | member(x, universal_class) | (~subclass(set_builder(y, z), universal_class)))),
% 1.32/1.12 inference(transitivity,[status(thm)],[28, 26])).
% 1.32/1.12 tff(30,plain,
% 1.32/1.12 ((~![Y: $i, U: $i, X: $i] : (member(U, Y) | (~member(U, X)) | (~subclass(X, Y)))) | (member(x, universal_class) | (~member(x, set_builder(y, z))) | (~subclass(set_builder(y, z), universal_class)))),
% 1.32/1.12 inference(quant_inst,[status(thm)],[])).
% 1.32/1.12 tff(31,plain,
% 1.32/1.12 ((~![Y: $i, U: $i, X: $i] : (member(U, Y) | (~member(U, X)) | (~subclass(X, Y)))) | (~member(x, set_builder(y, z))) | member(x, universal_class) | (~subclass(set_builder(y, z), universal_class))),
% 1.32/1.12 inference(modus_ponens,[status(thm)],[30, 29])).
% 1.32/1.12 tff(32,plain,
% 1.32/1.12 ($false),
% 1.32/1.12 inference(unit_resolution,[status(thm)],[31, 25, 15, 12, 1])).
% 1.32/1.12 tff(33,plain,(member(x, universal_class)), inference(lemma,lemma(discharge,[]))).
% 1.32/1.12 tff(34,plain,
% 1.32/1.12 (^[X: $i] : refl((unordered_pair(X, X) = singleton(X)) <=> (unordered_pair(X, X) = singleton(X)))),
% 1.32/1.12 inference(bind,[status(th)],[])).
% 1.32/1.12 tff(35,plain,
% 1.32/1.12 (![X: $i] : (unordered_pair(X, X) = singleton(X)) <=> ![X: $i] : (unordered_pair(X, X) = singleton(X))),
% 1.32/1.12 inference(quant_intro,[status(thm)],[34])).
% 1.32/1.12 tff(36,plain,
% 1.32/1.12 (![X: $i] : (unordered_pair(X, X) = singleton(X)) <=> ![X: $i] : (unordered_pair(X, X) = singleton(X))),
% 1.32/1.12 inference(rewrite,[status(thm)],[])).
% 1.32/1.12 tff(37,axiom,(![X: $i] : (unordered_pair(X, X) = singleton(X))), file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax','singleton_set')).
% 1.32/1.12 tff(38,plain,
% 1.32/1.12 (![X: $i] : (unordered_pair(X, X) = singleton(X))),
% 1.32/1.12 inference(modus_ponens,[status(thm)],[37, 36])).
% 1.32/1.12 tff(39,plain,(
% 1.32/1.12 ![X: $i] : (unordered_pair(X, X) = singleton(X))),
% 1.32/1.12 inference(skolemize,[status(sab)],[38])).
% 1.32/1.12 tff(40,plain,
% 1.32/1.12 (![X: $i] : (unordered_pair(X, X) = singleton(X))),
% 1.32/1.12 inference(modus_ponens,[status(thm)],[39, 35])).
% 1.32/1.12 tff(41,plain,
% 1.32/1.12 ((~![X: $i] : (unordered_pair(X, X) = singleton(X))) | (unordered_pair(y, y) = singleton(y))),
% 1.32/1.12 inference(quant_inst,[status(thm)],[])).
% 1.32/1.12 tff(42,plain,
% 1.32/1.12 (unordered_pair(y, y) = singleton(y)),
% 1.32/1.12 inference(unit_resolution,[status(thm)],[41, 40])).
% 1.32/1.12 tff(43,plain,
% 1.32/1.12 (member(x, unordered_pair(y, y)) <=> member(x, singleton(y))),
% 1.32/1.12 inference(monotonicity,[status(thm)],[42])).
% 1.32/1.12 tff(44,plain,
% 1.32/1.12 (member(x, singleton(y)) <=> member(x, unordered_pair(y, y))),
% 1.32/1.12 inference(symmetry,[status(thm)],[43])).
% 1.32/1.12 tff(45,assumption,(member(x, singleton(y))), introduced(assumption)).
% 1.32/1.12 tff(46,plain,
% 1.32/1.12 (member(x, unordered_pair(y, y))),
% 1.32/1.12 inference(modus_ponens,[status(thm)],[45, 44])).
% 1.32/1.12 tff(47,plain,
% 1.32/1.12 ((~(x = y)) <=> (~(x = y))),
% 1.32/1.12 inference(rewrite,[status(thm)],[])).
% 1.32/1.12 tff(48,axiom,(~(x = y)), file('/export/starexec/sandbox/benchmark/theBenchmark.p','prove_set_builder_alternate_defn1_2')).
% 1.32/1.12 tff(49,plain,
% 1.32/1.12 (~(x = y)),
% 1.32/1.12 inference(modus_ponens,[status(thm)],[48, 47])).
% 1.32/1.12 tff(50,plain,
% 1.32/1.12 (^[Y: $i, U: $i, X: $i] : refl(((U = Y) | (U = X) | (~member(U, unordered_pair(X, Y)))) <=> ((U = Y) | (U = X) | (~member(U, unordered_pair(X, Y)))))),
% 1.32/1.12 inference(bind,[status(th)],[])).
% 1.32/1.12 tff(51,plain,
% 1.32/1.12 (![Y: $i, U: $i, X: $i] : ((U = Y) | (U = X) | (~member(U, unordered_pair(X, Y)))) <=> ![Y: $i, U: $i, X: $i] : ((U = Y) | (U = X) | (~member(U, unordered_pair(X, Y))))),
% 1.32/1.12 inference(quant_intro,[status(thm)],[50])).
% 1.32/1.12 tff(52,plain,
% 1.32/1.12 (![Y: $i, U: $i, X: $i] : ((U = Y) | (U = X) | (~member(U, unordered_pair(X, Y)))) <=> ![Y: $i, U: $i, X: $i] : ((U = Y) | (U = X) | (~member(U, unordered_pair(X, Y))))),
% 1.32/1.12 inference(rewrite,[status(thm)],[])).
% 1.32/1.12 tff(53,plain,
% 1.32/1.12 (^[Y: $i, U: $i, X: $i] : rewrite((((~member(U, unordered_pair(X, Y))) | (U = X)) | (U = Y)) <=> ((U = Y) | (U = X) | (~member(U, unordered_pair(X, Y)))))),
% 1.32/1.12 inference(bind,[status(th)],[])).
% 1.32/1.12 tff(54,plain,
% 1.32/1.12 (![Y: $i, U: $i, X: $i] : (((~member(U, unordered_pair(X, Y))) | (U = X)) | (U = Y)) <=> ![Y: $i, U: $i, X: $i] : ((U = Y) | (U = X) | (~member(U, unordered_pair(X, Y))))),
% 1.32/1.12 inference(quant_intro,[status(thm)],[53])).
% 1.32/1.12 tff(55,axiom,(![Y: $i, U: $i, X: $i] : (((~member(U, unordered_pair(X, Y))) | (U = X)) | (U = Y))), file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax','unordered_pair_member')).
% 1.32/1.12 tff(56,plain,
% 1.32/1.12 (![Y: $i, U: $i, X: $i] : ((U = Y) | (U = X) | (~member(U, unordered_pair(X, Y))))),
% 1.32/1.12 inference(modus_ponens,[status(thm)],[55, 54])).
% 1.32/1.12 tff(57,plain,
% 1.32/1.12 (![Y: $i, U: $i, X: $i] : ((U = Y) | (U = X) | (~member(U, unordered_pair(X, Y))))),
% 1.32/1.12 inference(modus_ponens,[status(thm)],[56, 52])).
% 1.32/1.12 tff(58,plain,(
% 1.32/1.12 ![Y: $i, U: $i, X: $i] : ((U = Y) | (U = X) | (~member(U, unordered_pair(X, Y))))),
% 1.32/1.12 inference(skolemize,[status(sab)],[57])).
% 1.32/1.12 tff(59,plain,
% 1.32/1.12 (![Y: $i, U: $i, X: $i] : ((U = Y) | (U = X) | (~member(U, unordered_pair(X, Y))))),
% 1.32/1.12 inference(modus_ponens,[status(thm)],[58, 51])).
% 1.32/1.12 tff(60,plain,
% 1.32/1.12 (((~![Y: $i, U: $i, X: $i] : ((U = Y) | (U = X) | (~member(U, unordered_pair(X, Y))))) | ((x = y) | (~member(x, unordered_pair(y, y))))) <=> ((~![Y: $i, U: $i, X: $i] : ((U = Y) | (U = X) | (~member(U, unordered_pair(X, Y))))) | (x = y) | (~member(x, unordered_pair(y, y))))),
% 1.32/1.12 inference(rewrite,[status(thm)],[])).
% 1.32/1.12 tff(61,plain,
% 1.32/1.12 (((x = y) | (x = y) | (~member(x, unordered_pair(y, y)))) <=> ((x = y) | (~member(x, unordered_pair(y, y))))),
% 1.32/1.12 inference(rewrite,[status(thm)],[])).
% 1.32/1.12 tff(62,plain,
% 1.32/1.12 (((~![Y: $i, U: $i, X: $i] : ((U = Y) | (U = X) | (~member(U, unordered_pair(X, Y))))) | ((x = y) | (x = y) | (~member(x, unordered_pair(y, y))))) <=> ((~![Y: $i, U: $i, X: $i] : ((U = Y) | (U = X) | (~member(U, unordered_pair(X, Y))))) | ((x = y) | (~member(x, unordered_pair(y, y)))))),
% 1.32/1.12 inference(monotonicity,[status(thm)],[61])).
% 1.32/1.12 tff(63,plain,
% 1.32/1.12 (((~![Y: $i, U: $i, X: $i] : ((U = Y) | (U = X) | (~member(U, unordered_pair(X, Y))))) | ((x = y) | (x = y) | (~member(x, unordered_pair(y, y))))) <=> ((~![Y: $i, U: $i, X: $i] : ((U = Y) | (U = X) | (~member(U, unordered_pair(X, Y))))) | (x = y) | (~member(x, unordered_pair(y, y))))),
% 1.32/1.12 inference(transitivity,[status(thm)],[62, 60])).
% 1.32/1.12 tff(64,plain,
% 1.32/1.12 ((~![Y: $i, U: $i, X: $i] : ((U = Y) | (U = X) | (~member(U, unordered_pair(X, Y))))) | ((x = y) | (x = y) | (~member(x, unordered_pair(y, y))))),
% 1.32/1.12 inference(quant_inst,[status(thm)],[])).
% 1.32/1.12 tff(65,plain,
% 1.32/1.12 ((~![Y: $i, U: $i, X: $i] : ((U = Y) | (U = X) | (~member(U, unordered_pair(X, Y))))) | (x = y) | (~member(x, unordered_pair(y, y)))),
% 1.32/1.12 inference(modus_ponens,[status(thm)],[64, 63])).
% 1.32/1.12 tff(66,plain,
% 1.32/1.12 (~member(x, unordered_pair(y, y))),
% 1.32/1.12 inference(unit_resolution,[status(thm)],[65, 59, 49])).
% 1.32/1.12 tff(67,plain,
% 1.32/1.12 ($false),
% 1.32/1.12 inference(unit_resolution,[status(thm)],[66, 46])).
% 1.32/1.12 tff(68,plain,(~member(x, singleton(y))), inference(lemma,lemma(discharge,[]))).
% 1.32/1.12 tff(69,assumption,(~member(x, complement(singleton(y)))), introduced(assumption)).
% 1.32/1.12 tff(70,plain,
% 1.32/1.12 (^[Z: $i, X: $i] : refl((member(Z, X) | (~member(Z, universal_class)) | member(Z, complement(X))) <=> (member(Z, X) | (~member(Z, universal_class)) | member(Z, complement(X))))),
% 1.32/1.12 inference(bind,[status(th)],[])).
% 1.32/1.12 tff(71,plain,
% 1.32/1.12 (![Z: $i, X: $i] : (member(Z, X) | (~member(Z, universal_class)) | member(Z, complement(X))) <=> ![Z: $i, X: $i] : (member(Z, X) | (~member(Z, universal_class)) | member(Z, complement(X)))),
% 1.32/1.12 inference(quant_intro,[status(thm)],[70])).
% 1.32/1.12 tff(72,plain,
% 1.32/1.12 (![Z: $i, X: $i] : (member(Z, X) | (~member(Z, universal_class)) | member(Z, complement(X))) <=> ![Z: $i, X: $i] : (member(Z, X) | (~member(Z, universal_class)) | member(Z, complement(X)))),
% 1.32/1.12 inference(rewrite,[status(thm)],[])).
% 1.32/1.12 tff(73,plain,
% 1.32/1.12 (^[Z: $i, X: $i] : rewrite((((~member(Z, universal_class)) | member(Z, complement(X))) | member(Z, X)) <=> (member(Z, X) | (~member(Z, universal_class)) | member(Z, complement(X))))),
% 1.32/1.12 inference(bind,[status(th)],[])).
% 1.32/1.12 tff(74,plain,
% 1.32/1.12 (![Z: $i, X: $i] : (((~member(Z, universal_class)) | member(Z, complement(X))) | member(Z, X)) <=> ![Z: $i, X: $i] : (member(Z, X) | (~member(Z, universal_class)) | member(Z, complement(X)))),
% 1.32/1.12 inference(quant_intro,[status(thm)],[73])).
% 1.32/1.12 tff(75,axiom,(![Z: $i, X: $i] : (((~member(Z, universal_class)) | member(Z, complement(X))) | member(Z, X))), file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax','complement2')).
% 1.32/1.12 tff(76,plain,
% 1.32/1.12 (![Z: $i, X: $i] : (member(Z, X) | (~member(Z, universal_class)) | member(Z, complement(X)))),
% 1.32/1.12 inference(modus_ponens,[status(thm)],[75, 74])).
% 1.32/1.12 tff(77,plain,
% 1.32/1.12 (![Z: $i, X: $i] : (member(Z, X) | (~member(Z, universal_class)) | member(Z, complement(X)))),
% 1.32/1.12 inference(modus_ponens,[status(thm)],[76, 72])).
% 1.32/1.12 tff(78,plain,(
% 1.32/1.12 ![Z: $i, X: $i] : (member(Z, X) | (~member(Z, universal_class)) | member(Z, complement(X)))),
% 1.32/1.12 inference(skolemize,[status(sab)],[77])).
% 1.32/1.12 tff(79,plain,
% 1.32/1.12 (![Z: $i, X: $i] : (member(Z, X) | (~member(Z, universal_class)) | member(Z, complement(X)))),
% 1.32/1.12 inference(modus_ponens,[status(thm)],[78, 71])).
% 1.32/1.12 tff(80,plain,
% 1.32/1.12 (((~![Z: $i, X: $i] : (member(Z, X) | (~member(Z, universal_class)) | member(Z, complement(X)))) | (member(x, complement(singleton(y))) | member(x, singleton(y)) | (~member(x, universal_class)))) <=> ((~![Z: $i, X: $i] : (member(Z, X) | (~member(Z, universal_class)) | member(Z, complement(X)))) | member(x, complement(singleton(y))) | member(x, singleton(y)) | (~member(x, universal_class)))),
% 1.32/1.12 inference(rewrite,[status(thm)],[])).
% 1.32/1.12 tff(81,plain,
% 1.32/1.12 ((member(x, singleton(y)) | (~member(x, universal_class)) | member(x, complement(singleton(y)))) <=> (member(x, complement(singleton(y))) | member(x, singleton(y)) | (~member(x, universal_class)))),
% 1.32/1.12 inference(rewrite,[status(thm)],[])).
% 1.32/1.12 tff(82,plain,
% 1.32/1.12 (((~![Z: $i, X: $i] : (member(Z, X) | (~member(Z, universal_class)) | member(Z, complement(X)))) | (member(x, singleton(y)) | (~member(x, universal_class)) | member(x, complement(singleton(y))))) <=> ((~![Z: $i, X: $i] : (member(Z, X) | (~member(Z, universal_class)) | member(Z, complement(X)))) | (member(x, complement(singleton(y))) | member(x, singleton(y)) | (~member(x, universal_class))))),
% 1.32/1.12 inference(monotonicity,[status(thm)],[81])).
% 1.32/1.12 tff(83,plain,
% 1.32/1.12 (((~![Z: $i, X: $i] : (member(Z, X) | (~member(Z, universal_class)) | member(Z, complement(X)))) | (member(x, singleton(y)) | (~member(x, universal_class)) | member(x, complement(singleton(y))))) <=> ((~![Z: $i, X: $i] : (member(Z, X) | (~member(Z, universal_class)) | member(Z, complement(X)))) | member(x, complement(singleton(y))) | member(x, singleton(y)) | (~member(x, universal_class)))),
% 1.32/1.12 inference(transitivity,[status(thm)],[82, 80])).
% 1.32/1.12 tff(84,plain,
% 1.32/1.12 ((~![Z: $i, X: $i] : (member(Z, X) | (~member(Z, universal_class)) | member(Z, complement(X)))) | (member(x, singleton(y)) | (~member(x, universal_class)) | member(x, complement(singleton(y))))),
% 1.32/1.12 inference(quant_inst,[status(thm)],[])).
% 1.32/1.12 tff(85,plain,
% 1.32/1.12 ((~![Z: $i, X: $i] : (member(Z, X) | (~member(Z, universal_class)) | member(Z, complement(X)))) | member(x, complement(singleton(y))) | member(x, singleton(y)) | (~member(x, universal_class))),
% 1.32/1.12 inference(modus_ponens,[status(thm)],[84, 83])).
% 1.32/1.12 tff(86,plain,
% 1.32/1.12 ($false),
% 1.32/1.12 inference(unit_resolution,[status(thm)],[85, 79, 69, 33, 68])).
% 1.32/1.12 tff(87,plain,(member(x, complement(singleton(y)))), inference(lemma,lemma(discharge,[]))).
% 1.32/1.12 tff(88,plain,
% 1.32/1.12 (^[Y: $i, X: $i] : refl((union(singleton(X), Y) = set_builder(X, Y)) <=> (union(singleton(X), Y) = set_builder(X, Y)))),
% 1.32/1.12 inference(bind,[status(th)],[])).
% 1.32/1.12 tff(89,plain,
% 1.32/1.12 (![Y: $i, X: $i] : (union(singleton(X), Y) = set_builder(X, Y)) <=> ![Y: $i, X: $i] : (union(singleton(X), Y) = set_builder(X, Y))),
% 1.32/1.12 inference(quant_intro,[status(thm)],[88])).
% 1.32/1.12 tff(90,plain,
% 1.32/1.12 (![Y: $i, X: $i] : (union(singleton(X), Y) = set_builder(X, Y)) <=> ![Y: $i, X: $i] : (union(singleton(X), Y) = set_builder(X, Y))),
% 1.32/1.12 inference(rewrite,[status(thm)],[])).
% 1.32/1.12 tff(91,axiom,(![Y: $i, X: $i] : (union(singleton(X), Y) = set_builder(X, Y))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','definition_of_set_builder')).
% 1.32/1.12 tff(92,plain,
% 1.32/1.12 (![Y: $i, X: $i] : (union(singleton(X), Y) = set_builder(X, Y))),
% 1.32/1.12 inference(modus_ponens,[status(thm)],[91, 90])).
% 1.32/1.12 tff(93,plain,(
% 1.32/1.12 ![Y: $i, X: $i] : (union(singleton(X), Y) = set_builder(X, Y))),
% 1.32/1.12 inference(skolemize,[status(sab)],[92])).
% 1.32/1.12 tff(94,plain,
% 1.32/1.12 (![Y: $i, X: $i] : (union(singleton(X), Y) = set_builder(X, Y))),
% 1.32/1.12 inference(modus_ponens,[status(thm)],[93, 89])).
% 1.32/1.12 tff(95,plain,
% 1.32/1.12 ((~![Y: $i, X: $i] : (union(singleton(X), Y) = set_builder(X, Y))) | (union(singleton(y), z) = set_builder(y, z))),
% 1.32/1.12 inference(quant_inst,[status(thm)],[])).
% 1.32/1.12 tff(96,plain,
% 1.32/1.12 (union(singleton(y), z) = set_builder(y, z)),
% 1.32/1.12 inference(unit_resolution,[status(thm)],[95, 94])).
% 1.32/1.12 tff(97,plain,
% 1.32/1.12 (^[Y: $i, X: $i] : refl((complement(intersection(complement(X), complement(Y))) = union(X, Y)) <=> (complement(intersection(complement(X), complement(Y))) = union(X, Y)))),
% 1.32/1.12 inference(bind,[status(th)],[])).
% 1.32/1.12 tff(98,plain,
% 1.32/1.12 (![Y: $i, X: $i] : (complement(intersection(complement(X), complement(Y))) = union(X, Y)) <=> ![Y: $i, X: $i] : (complement(intersection(complement(X), complement(Y))) = union(X, Y))),
% 1.32/1.12 inference(quant_intro,[status(thm)],[97])).
% 1.32/1.12 tff(99,plain,
% 1.32/1.12 (![Y: $i, X: $i] : (complement(intersection(complement(X), complement(Y))) = union(X, Y)) <=> ![Y: $i, X: $i] : (complement(intersection(complement(X), complement(Y))) = union(X, Y))),
% 1.32/1.12 inference(rewrite,[status(thm)],[])).
% 1.32/1.12 tff(100,axiom,(![Y: $i, X: $i] : (complement(intersection(complement(X), complement(Y))) = union(X, Y))), file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax','union')).
% 1.32/1.12 tff(101,plain,
% 1.32/1.12 (![Y: $i, X: $i] : (complement(intersection(complement(X), complement(Y))) = union(X, Y))),
% 1.32/1.12 inference(modus_ponens,[status(thm)],[100, 99])).
% 1.32/1.12 tff(102,plain,(
% 1.32/1.12 ![Y: $i, X: $i] : (complement(intersection(complement(X), complement(Y))) = union(X, Y))),
% 1.32/1.12 inference(skolemize,[status(sab)],[101])).
% 1.32/1.12 tff(103,plain,
% 1.32/1.12 (![Y: $i, X: $i] : (complement(intersection(complement(X), complement(Y))) = union(X, Y))),
% 1.32/1.12 inference(modus_ponens,[status(thm)],[102, 98])).
% 1.32/1.12 tff(104,plain,
% 1.32/1.12 ((~![Y: $i, X: $i] : (complement(intersection(complement(X), complement(Y))) = union(X, Y))) | (complement(intersection(complement(singleton(y)), complement(z))) = union(singleton(y), z))),
% 1.39/1.12 inference(quant_inst,[status(thm)],[])).
% 1.39/1.12 tff(105,plain,
% 1.39/1.12 (complement(intersection(complement(singleton(y)), complement(z))) = union(singleton(y), z)),
% 1.39/1.12 inference(unit_resolution,[status(thm)],[104, 103])).
% 1.39/1.12 tff(106,plain,
% 1.39/1.12 (complement(intersection(complement(singleton(y)), complement(z))) = set_builder(y, z)),
% 1.39/1.12 inference(transitivity,[status(thm)],[105, 96])).
% 1.39/1.12 tff(107,plain,
% 1.39/1.12 (member(x, complement(intersection(complement(singleton(y)), complement(z)))) <=> member(x, set_builder(y, z))),
% 1.39/1.12 inference(monotonicity,[status(thm)],[106])).
% 1.39/1.12 tff(108,plain,
% 1.39/1.12 (member(x, set_builder(y, z)) <=> member(x, complement(intersection(complement(singleton(y)), complement(z))))),
% 1.39/1.12 inference(symmetry,[status(thm)],[107])).
% 1.39/1.12 tff(109,plain,
% 1.39/1.12 (member(x, complement(intersection(complement(singleton(y)), complement(z))))),
% 1.39/1.12 inference(modus_ponens,[status(thm)],[15, 108])).
% 1.39/1.12 tff(110,plain,
% 1.39/1.12 (^[Z: $i, X: $i] : refl(((~member(Z, X)) | (~member(Z, complement(X)))) <=> ((~member(Z, X)) | (~member(Z, complement(X)))))),
% 1.39/1.12 inference(bind,[status(th)],[])).
% 1.39/1.12 tff(111,plain,
% 1.39/1.12 (![Z: $i, X: $i] : ((~member(Z, X)) | (~member(Z, complement(X)))) <=> ![Z: $i, X: $i] : ((~member(Z, X)) | (~member(Z, complement(X))))),
% 1.39/1.12 inference(quant_intro,[status(thm)],[110])).
% 1.39/1.12 tff(112,plain,
% 1.39/1.12 (![Z: $i, X: $i] : ((~member(Z, X)) | (~member(Z, complement(X)))) <=> ![Z: $i, X: $i] : ((~member(Z, X)) | (~member(Z, complement(X))))),
% 1.39/1.12 inference(rewrite,[status(thm)],[])).
% 1.39/1.12 tff(113,plain,
% 1.39/1.12 (^[Z: $i, X: $i] : rewrite(((~member(Z, complement(X))) | (~member(Z, X))) <=> ((~member(Z, X)) | (~member(Z, complement(X)))))),
% 1.39/1.12 inference(bind,[status(th)],[])).
% 1.39/1.12 tff(114,plain,
% 1.39/1.12 (![Z: $i, X: $i] : ((~member(Z, complement(X))) | (~member(Z, X))) <=> ![Z: $i, X: $i] : ((~member(Z, X)) | (~member(Z, complement(X))))),
% 1.39/1.12 inference(quant_intro,[status(thm)],[113])).
% 1.39/1.12 tff(115,axiom,(![Z: $i, X: $i] : ((~member(Z, complement(X))) | (~member(Z, X)))), file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax','complement1')).
% 1.39/1.12 tff(116,plain,
% 1.39/1.12 (![Z: $i, X: $i] : ((~member(Z, X)) | (~member(Z, complement(X))))),
% 1.39/1.12 inference(modus_ponens,[status(thm)],[115, 114])).
% 1.39/1.12 tff(117,plain,
% 1.39/1.12 (![Z: $i, X: $i] : ((~member(Z, X)) | (~member(Z, complement(X))))),
% 1.39/1.12 inference(modus_ponens,[status(thm)],[116, 112])).
% 1.39/1.12 tff(118,plain,(
% 1.39/1.12 ![Z: $i, X: $i] : ((~member(Z, X)) | (~member(Z, complement(X))))),
% 1.39/1.12 inference(skolemize,[status(sab)],[117])).
% 1.39/1.12 tff(119,plain,
% 1.39/1.12 (![Z: $i, X: $i] : ((~member(Z, X)) | (~member(Z, complement(X))))),
% 1.39/1.12 inference(modus_ponens,[status(thm)],[118, 111])).
% 1.39/1.12 tff(120,plain,
% 1.39/1.12 (((~![Z: $i, X: $i] : ((~member(Z, X)) | (~member(Z, complement(X))))) | ((~member(x, intersection(complement(singleton(y)), complement(z)))) | (~member(x, complement(intersection(complement(singleton(y)), complement(z))))))) <=> ((~![Z: $i, X: $i] : ((~member(Z, X)) | (~member(Z, complement(X))))) | (~member(x, intersection(complement(singleton(y)), complement(z)))) | (~member(x, complement(intersection(complement(singleton(y)), complement(z))))))),
% 1.39/1.12 inference(rewrite,[status(thm)],[])).
% 1.39/1.12 tff(121,plain,
% 1.39/1.12 ((~![Z: $i, X: $i] : ((~member(Z, X)) | (~member(Z, complement(X))))) | ((~member(x, intersection(complement(singleton(y)), complement(z)))) | (~member(x, complement(intersection(complement(singleton(y)), complement(z))))))),
% 1.39/1.12 inference(quant_inst,[status(thm)],[])).
% 1.39/1.12 tff(122,plain,
% 1.39/1.12 ((~![Z: $i, X: $i] : ((~member(Z, X)) | (~member(Z, complement(X))))) | (~member(x, intersection(complement(singleton(y)), complement(z)))) | (~member(x, complement(intersection(complement(singleton(y)), complement(z)))))),
% 1.39/1.12 inference(modus_ponens,[status(thm)],[121, 120])).
% 1.39/1.12 tff(123,plain,
% 1.39/1.12 ((~member(x, intersection(complement(singleton(y)), complement(z)))) | (~member(x, complement(intersection(complement(singleton(y)), complement(z)))))),
% 1.39/1.12 inference(unit_resolution,[status(thm)],[122, 119])).
% 1.39/1.12 tff(124,plain,
% 1.39/1.12 (~member(x, intersection(complement(singleton(y)), complement(z)))),
% 1.39/1.12 inference(unit_resolution,[status(thm)],[123, 109])).
% 1.39/1.12 tff(125,plain,
% 1.39/1.12 (^[Z: $i, Y: $i, X: $i] : refl((member(Z, intersection(X, Y)) | (~member(Z, Y)) | (~member(Z, X))) <=> (member(Z, intersection(X, Y)) | (~member(Z, Y)) | (~member(Z, X))))),
% 1.39/1.12 inference(bind,[status(th)],[])).
% 1.39/1.12 tff(126,plain,
% 1.39/1.12 (![Z: $i, Y: $i, X: $i] : (member(Z, intersection(X, Y)) | (~member(Z, Y)) | (~member(Z, X))) <=> ![Z: $i, Y: $i, X: $i] : (member(Z, intersection(X, Y)) | (~member(Z, Y)) | (~member(Z, X)))),
% 1.39/1.12 inference(quant_intro,[status(thm)],[125])).
% 1.39/1.12 tff(127,plain,
% 1.39/1.12 (![Z: $i, Y: $i, X: $i] : (member(Z, intersection(X, Y)) | (~member(Z, Y)) | (~member(Z, X))) <=> ![Z: $i, Y: $i, X: $i] : (member(Z, intersection(X, Y)) | (~member(Z, Y)) | (~member(Z, X)))),
% 1.39/1.12 inference(rewrite,[status(thm)],[])).
% 1.39/1.12 tff(128,plain,
% 1.39/1.12 (^[Z: $i, Y: $i, X: $i] : rewrite((((~member(Z, X)) | (~member(Z, Y))) | member(Z, intersection(X, Y))) <=> (member(Z, intersection(X, Y)) | (~member(Z, Y)) | (~member(Z, X))))),
% 1.39/1.12 inference(bind,[status(th)],[])).
% 1.39/1.12 tff(129,plain,
% 1.39/1.12 (![Z: $i, Y: $i, X: $i] : (((~member(Z, X)) | (~member(Z, Y))) | member(Z, intersection(X, Y))) <=> ![Z: $i, Y: $i, X: $i] : (member(Z, intersection(X, Y)) | (~member(Z, Y)) | (~member(Z, X)))),
% 1.39/1.12 inference(quant_intro,[status(thm)],[128])).
% 1.39/1.12 tff(130,axiom,(![Z: $i, Y: $i, X: $i] : (((~member(Z, X)) | (~member(Z, Y))) | member(Z, intersection(X, Y)))), file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax','intersection3')).
% 1.39/1.12 tff(131,plain,
% 1.39/1.12 (![Z: $i, Y: $i, X: $i] : (member(Z, intersection(X, Y)) | (~member(Z, Y)) | (~member(Z, X)))),
% 1.39/1.12 inference(modus_ponens,[status(thm)],[130, 129])).
% 1.39/1.12 tff(132,plain,
% 1.39/1.12 (![Z: $i, Y: $i, X: $i] : (member(Z, intersection(X, Y)) | (~member(Z, Y)) | (~member(Z, X)))),
% 1.39/1.12 inference(modus_ponens,[status(thm)],[131, 127])).
% 1.39/1.12 tff(133,plain,(
% 1.39/1.12 ![Z: $i, Y: $i, X: $i] : (member(Z, intersection(X, Y)) | (~member(Z, Y)) | (~member(Z, X)))),
% 1.39/1.12 inference(skolemize,[status(sab)],[132])).
% 1.39/1.12 tff(134,plain,
% 1.39/1.12 (![Z: $i, Y: $i, X: $i] : (member(Z, intersection(X, Y)) | (~member(Z, Y)) | (~member(Z, X)))),
% 1.39/1.12 inference(modus_ponens,[status(thm)],[133, 126])).
% 1.39/1.12 tff(135,plain,
% 1.39/1.12 (((~![Z: $i, Y: $i, X: $i] : (member(Z, intersection(X, Y)) | (~member(Z, Y)) | (~member(Z, X)))) | (member(x, intersection(complement(singleton(y)), complement(z))) | (~member(x, complement(z))) | (~member(x, complement(singleton(y)))))) <=> ((~![Z: $i, Y: $i, X: $i] : (member(Z, intersection(X, Y)) | (~member(Z, Y)) | (~member(Z, X)))) | member(x, intersection(complement(singleton(y)), complement(z))) | (~member(x, complement(z))) | (~member(x, complement(singleton(y)))))),
% 1.39/1.12 inference(rewrite,[status(thm)],[])).
% 1.39/1.12 tff(136,plain,
% 1.39/1.12 ((~![Z: $i, Y: $i, X: $i] : (member(Z, intersection(X, Y)) | (~member(Z, Y)) | (~member(Z, X)))) | (member(x, intersection(complement(singleton(y)), complement(z))) | (~member(x, complement(z))) | (~member(x, complement(singleton(y)))))),
% 1.39/1.12 inference(quant_inst,[status(thm)],[])).
% 1.39/1.12 tff(137,plain,
% 1.39/1.12 ((~![Z: $i, Y: $i, X: $i] : (member(Z, intersection(X, Y)) | (~member(Z, Y)) | (~member(Z, X)))) | member(x, intersection(complement(singleton(y)), complement(z))) | (~member(x, complement(z))) | (~member(x, complement(singleton(y))))),
% 1.39/1.12 inference(modus_ponens,[status(thm)],[136, 135])).
% 1.39/1.12 tff(138,plain,
% 1.39/1.12 ((~member(x, complement(z))) | (~member(x, complement(singleton(y))))),
% 1.39/1.12 inference(unit_resolution,[status(thm)],[137, 134, 124])).
% 1.39/1.12 tff(139,plain,
% 1.39/1.12 (~member(x, complement(z))),
% 1.39/1.12 inference(unit_resolution,[status(thm)],[138, 87])).
% 1.39/1.12 tff(140,plain,
% 1.39/1.12 ((~member(x, z)) <=> (~member(x, z))),
% 1.39/1.12 inference(rewrite,[status(thm)],[])).
% 1.39/1.12 tff(141,axiom,(~member(x, z)), file('/export/starexec/sandbox/benchmark/theBenchmark.p','prove_set_builder_alternate_defn1_3')).
% 1.39/1.12 tff(142,plain,
% 1.39/1.12 (~member(x, z)),
% 1.39/1.12 inference(modus_ponens,[status(thm)],[141, 140])).
% 1.39/1.12 tff(143,plain,
% 1.39/1.12 (((~![Z: $i, X: $i] : (member(Z, X) | (~member(Z, universal_class)) | member(Z, complement(X)))) | (member(x, z) | member(x, complement(z)) | (~member(x, universal_class)))) <=> ((~![Z: $i, X: $i] : (member(Z, X) | (~member(Z, universal_class)) | member(Z, complement(X)))) | member(x, z) | member(x, complement(z)) | (~member(x, universal_class)))),
% 1.39/1.13 inference(rewrite,[status(thm)],[])).
% 1.39/1.13 tff(144,plain,
% 1.39/1.13 ((member(x, z) | (~member(x, universal_class)) | member(x, complement(z))) <=> (member(x, z) | member(x, complement(z)) | (~member(x, universal_class)))),
% 1.39/1.13 inference(rewrite,[status(thm)],[])).
% 1.39/1.13 tff(145,plain,
% 1.39/1.13 (((~![Z: $i, X: $i] : (member(Z, X) | (~member(Z, universal_class)) | member(Z, complement(X)))) | (member(x, z) | (~member(x, universal_class)) | member(x, complement(z)))) <=> ((~![Z: $i, X: $i] : (member(Z, X) | (~member(Z, universal_class)) | member(Z, complement(X)))) | (member(x, z) | member(x, complement(z)) | (~member(x, universal_class))))),
% 1.39/1.13 inference(monotonicity,[status(thm)],[144])).
% 1.39/1.13 tff(146,plain,
% 1.39/1.13 (((~![Z: $i, X: $i] : (member(Z, X) | (~member(Z, universal_class)) | member(Z, complement(X)))) | (member(x, z) | (~member(x, universal_class)) | member(x, complement(z)))) <=> ((~![Z: $i, X: $i] : (member(Z, X) | (~member(Z, universal_class)) | member(Z, complement(X)))) | member(x, z) | member(x, complement(z)) | (~member(x, universal_class)))),
% 1.39/1.13 inference(transitivity,[status(thm)],[145, 143])).
% 1.39/1.13 tff(147,plain,
% 1.39/1.13 ((~![Z: $i, X: $i] : (member(Z, X) | (~member(Z, universal_class)) | member(Z, complement(X)))) | (member(x, z) | (~member(x, universal_class)) | member(x, complement(z)))),
% 1.39/1.13 inference(quant_inst,[status(thm)],[])).
% 1.39/1.13 tff(148,plain,
% 1.39/1.13 ((~![Z: $i, X: $i] : (member(Z, X) | (~member(Z, universal_class)) | member(Z, complement(X)))) | member(x, z) | member(x, complement(z)) | (~member(x, universal_class))),
% 1.39/1.13 inference(modus_ponens,[status(thm)],[147, 146])).
% 1.39/1.13 tff(149,plain,
% 1.39/1.13 ($false),
% 1.39/1.13 inference(unit_resolution,[status(thm)],[148, 79, 142, 139, 33])).
% 1.39/1.13 % SZS output end Proof
%------------------------------------------------------------------------------