TSTP Solution File: SET063+4 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SET063+4 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n016.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:17 EDT 2022
% Result : Theorem 0.20s 0.39s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET063+4 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.12/0.34 % Computer : n016.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sat Sep 3 02:17:21 EDT 2022
% 0.12/0.34 % 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.20/0.39 % SZS status Theorem
% 0.20/0.39 % SZS output start Proof
% 0.20/0.39 tff(member_type, type, (
% 0.20/0.39 member: ( $i * $i ) > $o)).
% 0.20/0.39 tff(empty_set_type, type, (
% 0.20/0.39 empty_set: $i)).
% 0.20/0.39 tff(tptp_fun_X_0_type, type, (
% 0.20/0.39 tptp_fun_X_0: ( $i * $i ) > $i)).
% 0.20/0.39 tff(intersection_type, type, (
% 0.20/0.39 intersection: ( $i * $i ) > $i)).
% 0.20/0.39 tff(tptp_fun_A_3_type, type, (
% 0.20/0.39 tptp_fun_A_3: $i)).
% 0.20/0.39 tff(subset_type, type, (
% 0.20/0.39 subset: ( $i * $i ) > $o)).
% 0.20/0.39 tff(equal_set_type, type, (
% 0.20/0.39 equal_set: ( $i * $i ) > $o)).
% 0.20/0.39 tff(1,plain,
% 0.20/0.39 (^[A: $i, B: $i] : refl((~((~((~subset(A, B)) | ![X: $i] : ((~member(X, A)) | member(X, B)))) | (~(subset(A, B) | (~((~member(tptp_fun_X_0(B, A), A)) | member(tptp_fun_X_0(B, A), B))))))) <=> (~((~((~subset(A, B)) | ![X: $i] : ((~member(X, A)) | member(X, B)))) | (~(subset(A, B) | (~((~member(tptp_fun_X_0(B, A), A)) | member(tptp_fun_X_0(B, A), B))))))))),
% 0.20/0.39 inference(bind,[status(th)],[])).
% 0.20/0.39 tff(2,plain,
% 0.20/0.39 (![A: $i, B: $i] : (~((~((~subset(A, B)) | ![X: $i] : ((~member(X, A)) | member(X, B)))) | (~(subset(A, B) | (~((~member(tptp_fun_X_0(B, A), A)) | member(tptp_fun_X_0(B, A), B))))))) <=> ![A: $i, B: $i] : (~((~((~subset(A, B)) | ![X: $i] : ((~member(X, A)) | member(X, B)))) | (~(subset(A, B) | (~((~member(tptp_fun_X_0(B, A), A)) | member(tptp_fun_X_0(B, A), B)))))))),
% 0.20/0.39 inference(quant_intro,[status(thm)],[1])).
% 0.20/0.39 tff(3,plain,
% 0.20/0.39 (^[A: $i, B: $i] : rewrite((~((~((~subset(A, B)) | ![X: $i] : ((~member(X, A)) | member(X, B)))) | (~(subset(A, B) | (~((~member(tptp_fun_X_0(B, A), A)) | member(tptp_fun_X_0(B, A), B))))))) <=> (~((~((~subset(A, B)) | ![X: $i] : ((~member(X, A)) | member(X, B)))) | (~(subset(A, B) | (~((~member(tptp_fun_X_0(B, A), A)) | member(tptp_fun_X_0(B, A), B))))))))),
% 0.20/0.39 inference(bind,[status(th)],[])).
% 0.20/0.39 tff(4,plain,
% 0.20/0.39 (![A: $i, B: $i] : (~((~((~subset(A, B)) | ![X: $i] : ((~member(X, A)) | member(X, B)))) | (~(subset(A, B) | (~((~member(tptp_fun_X_0(B, A), A)) | member(tptp_fun_X_0(B, A), B))))))) <=> ![A: $i, B: $i] : (~((~((~subset(A, B)) | ![X: $i] : ((~member(X, A)) | member(X, B)))) | (~(subset(A, B) | (~((~member(tptp_fun_X_0(B, A), A)) | member(tptp_fun_X_0(B, A), B)))))))),
% 0.20/0.39 inference(quant_intro,[status(thm)],[3])).
% 0.20/0.39 tff(5,plain,
% 0.20/0.39 (![A: $i, B: $i] : (~((~((~subset(A, B)) | ![X: $i] : ((~member(X, A)) | member(X, B)))) | (~(subset(A, B) | (~((~member(tptp_fun_X_0(B, A), A)) | member(tptp_fun_X_0(B, A), B))))))) <=> ![A: $i, B: $i] : (~((~((~subset(A, B)) | ![X: $i] : ((~member(X, A)) | member(X, B)))) | (~(subset(A, B) | (~((~member(tptp_fun_X_0(B, A), A)) | member(tptp_fun_X_0(B, A), B)))))))),
% 0.20/0.39 inference(transitivity,[status(thm)],[4, 2])).
% 0.20/0.39 tff(6,plain,
% 0.20/0.39 (^[A: $i, B: $i] : trans(monotonicity(rewrite(((~subset(A, B)) | ![X: $i] : ((~member(X, A)) | member(X, B))) <=> ((~subset(A, B)) | ![X: $i] : ((~member(X, A)) | member(X, B)))), rewrite((subset(A, B) | (~((~member(tptp_fun_X_0(B, A), A)) | member(tptp_fun_X_0(B, A), B)))) <=> (subset(A, B) | (~((~member(tptp_fun_X_0(B, A), A)) | member(tptp_fun_X_0(B, A), B))))), ((((~subset(A, B)) | ![X: $i] : ((~member(X, A)) | member(X, B))) & (subset(A, B) | (~((~member(tptp_fun_X_0(B, A), A)) | member(tptp_fun_X_0(B, A), B))))) <=> (((~subset(A, B)) | ![X: $i] : ((~member(X, A)) | member(X, B))) & (subset(A, B) | (~((~member(tptp_fun_X_0(B, A), A)) | member(tptp_fun_X_0(B, A), B))))))), rewrite((((~subset(A, B)) | ![X: $i] : ((~member(X, A)) | member(X, B))) & (subset(A, B) | (~((~member(tptp_fun_X_0(B, A), A)) | member(tptp_fun_X_0(B, A), B))))) <=> (~((~((~subset(A, B)) | ![X: $i] : ((~member(X, A)) | member(X, B)))) | (~(subset(A, B) | (~((~member(tptp_fun_X_0(B, A), A)) | member(tptp_fun_X_0(B, A), B)))))))), ((((~subset(A, B)) | ![X: $i] : ((~member(X, A)) | member(X, B))) & (subset(A, B) | (~((~member(tptp_fun_X_0(B, A), A)) | member(tptp_fun_X_0(B, A), B))))) <=> (~((~((~subset(A, B)) | ![X: $i] : ((~member(X, A)) | member(X, B)))) | (~(subset(A, B) | (~((~member(tptp_fun_X_0(B, A), A)) | member(tptp_fun_X_0(B, A), B)))))))))),
% 0.20/0.39 inference(bind,[status(th)],[])).
% 0.20/0.39 tff(7,plain,
% 0.20/0.39 (![A: $i, B: $i] : (((~subset(A, B)) | ![X: $i] : ((~member(X, A)) | member(X, B))) & (subset(A, B) | (~((~member(tptp_fun_X_0(B, A), A)) | member(tptp_fun_X_0(B, A), B))))) <=> ![A: $i, B: $i] : (~((~((~subset(A, B)) | ![X: $i] : ((~member(X, A)) | member(X, B)))) | (~(subset(A, B) | (~((~member(tptp_fun_X_0(B, A), A)) | member(tptp_fun_X_0(B, A), B)))))))),
% 0.20/0.39 inference(quant_intro,[status(thm)],[6])).
% 0.20/0.39 tff(8,plain,
% 0.20/0.39 (![A: $i, B: $i] : (subset(A, B) <=> ![X: $i] : ((~member(X, A)) | member(X, B))) <=> ![A: $i, B: $i] : (subset(A, B) <=> ![X: $i] : ((~member(X, A)) | member(X, B)))),
% 0.20/0.39 inference(rewrite,[status(thm)],[])).
% 0.20/0.39 tff(9,plain,
% 0.20/0.39 (^[A: $i, B: $i] : rewrite((subset(A, B) <=> ![X: $i] : (member(X, A) => member(X, B))) <=> (subset(A, B) <=> ![X: $i] : ((~member(X, A)) | member(X, B))))),
% 0.20/0.39 inference(bind,[status(th)],[])).
% 0.20/0.39 tff(10,plain,
% 0.20/0.39 (![A: $i, B: $i] : (subset(A, B) <=> ![X: $i] : (member(X, A) => member(X, B))) <=> ![A: $i, B: $i] : (subset(A, B) <=> ![X: $i] : ((~member(X, A)) | member(X, B)))),
% 0.20/0.39 inference(quant_intro,[status(thm)],[9])).
% 0.20/0.39 tff(11,axiom,(![A: $i, B: $i] : (subset(A, B) <=> ![X: $i] : (member(X, A) => member(X, B)))), file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax','subset')).
% 0.20/0.39 tff(12,plain,
% 0.20/0.39 (![A: $i, B: $i] : (subset(A, B) <=> ![X: $i] : ((~member(X, A)) | member(X, B)))),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[11, 10])).
% 0.20/0.39 tff(13,plain,
% 0.20/0.39 (![A: $i, B: $i] : (subset(A, B) <=> ![X: $i] : ((~member(X, A)) | member(X, B)))),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[12, 8])).
% 0.20/0.39 tff(14,plain,(
% 0.20/0.39 ![A: $i, B: $i] : (((~subset(A, B)) | ![X: $i] : ((~member(X, A)) | member(X, B))) & (subset(A, B) | (~((~member(tptp_fun_X_0(B, A), A)) | member(tptp_fun_X_0(B, A), B)))))),
% 0.20/0.39 inference(skolemize,[status(sab)],[13])).
% 0.20/0.39 tff(15,plain,
% 0.20/0.39 (![A: $i, B: $i] : (~((~((~subset(A, B)) | ![X: $i] : ((~member(X, A)) | member(X, B)))) | (~(subset(A, B) | (~((~member(tptp_fun_X_0(B, A), A)) | member(tptp_fun_X_0(B, A), B)))))))),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[14, 7])).
% 0.20/0.39 tff(16,plain,
% 0.20/0.39 (![A: $i, B: $i] : (~((~((~subset(A, B)) | ![X: $i] : ((~member(X, A)) | member(X, B)))) | (~(subset(A, B) | (~((~member(tptp_fun_X_0(B, A), A)) | member(tptp_fun_X_0(B, A), B)))))))),
% 0.20/0.39 inference(modus_ponens,[status(thm)],[15, 5])).
% 0.20/0.39 tff(17,plain,
% 0.20/0.39 ((~![A: $i, B: $i] : (~((~((~subset(A, B)) | ![X: $i] : ((~member(X, A)) | member(X, B)))) | (~(subset(A, B) | (~((~member(tptp_fun_X_0(B, A), A)) | member(tptp_fun_X_0(B, A), B)))))))) | (~((~((~subset(empty_set, intersection(A!3, empty_set))) | ![X: $i] : ((~member(X, empty_set)) | member(X, intersection(A!3, empty_set))))) | (~(subset(empty_set, intersection(A!3, empty_set)) | (~((~member(tptp_fun_X_0(intersection(A!3, empty_set), empty_set), empty_set)) | member(tptp_fun_X_0(intersection(A!3, empty_set), empty_set), intersection(A!3, empty_set))))))))),
% 0.20/0.39 inference(quant_inst,[status(thm)],[])).
% 0.20/0.39 tff(18,plain,
% 0.20/0.39 (~((~((~subset(empty_set, intersection(A!3, empty_set))) | ![X: $i] : ((~member(X, empty_set)) | member(X, intersection(A!3, empty_set))))) | (~(subset(empty_set, intersection(A!3, empty_set)) | (~((~member(tptp_fun_X_0(intersection(A!3, empty_set), empty_set), empty_set)) | member(tptp_fun_X_0(intersection(A!3, empty_set), empty_set), intersection(A!3, empty_set)))))))),
% 0.20/0.39 inference(unit_resolution,[status(thm)],[17, 16])).
% 0.20/0.39 tff(19,plain,
% 0.20/0.39 (((~((~subset(empty_set, intersection(A!3, empty_set))) | ![X: $i] : ((~member(X, empty_set)) | member(X, intersection(A!3, empty_set))))) | (~(subset(empty_set, intersection(A!3, empty_set)) | (~((~member(tptp_fun_X_0(intersection(A!3, empty_set), empty_set), empty_set)) | member(tptp_fun_X_0(intersection(A!3, empty_set), empty_set), intersection(A!3, empty_set))))))) | (subset(empty_set, intersection(A!3, empty_set)) | (~((~member(tptp_fun_X_0(intersection(A!3, empty_set), empty_set), empty_set)) | member(tptp_fun_X_0(intersection(A!3, empty_set), empty_set), intersection(A!3, empty_set)))))),
% 0.20/0.39 inference(tautology,[status(thm)],[])).
% 0.20/0.39 tff(20,plain,
% 0.20/0.39 (subset(empty_set, intersection(A!3, empty_set)) | (~((~member(tptp_fun_X_0(intersection(A!3, empty_set), empty_set), empty_set)) | member(tptp_fun_X_0(intersection(A!3, empty_set), empty_set), intersection(A!3, empty_set))))),
% 0.20/0.40 inference(unit_resolution,[status(thm)],[19, 18])).
% 0.20/0.40 tff(21,assumption,((~((~subset(intersection(A!3, empty_set), empty_set)) | ![X: $i] : ((~member(X, intersection(A!3, empty_set))) | member(X, empty_set)))) | (~(subset(intersection(A!3, empty_set), empty_set) | (~((~member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), intersection(A!3, empty_set))) | member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), empty_set)))))), introduced(assumption)).
% 0.20/0.40 tff(22,plain,
% 0.20/0.40 ((~![A: $i, B: $i] : (~((~((~subset(A, B)) | ![X: $i] : ((~member(X, A)) | member(X, B)))) | (~(subset(A, B) | (~((~member(tptp_fun_X_0(B, A), A)) | member(tptp_fun_X_0(B, A), B)))))))) | (~((~((~subset(intersection(A!3, empty_set), empty_set)) | ![X: $i] : ((~member(X, intersection(A!3, empty_set))) | member(X, empty_set)))) | (~(subset(intersection(A!3, empty_set), empty_set) | (~((~member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), intersection(A!3, empty_set))) | member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), empty_set)))))))),
% 0.20/0.40 inference(quant_inst,[status(thm)],[])).
% 0.20/0.40 tff(23,plain,
% 0.20/0.40 ($false),
% 0.20/0.40 inference(unit_resolution,[status(thm)],[22, 16, 21])).
% 0.20/0.40 tff(24,plain,(~((~((~subset(intersection(A!3, empty_set), empty_set)) | ![X: $i] : ((~member(X, intersection(A!3, empty_set))) | member(X, empty_set)))) | (~(subset(intersection(A!3, empty_set), empty_set) | (~((~member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), intersection(A!3, empty_set))) | member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), empty_set))))))), inference(lemma,lemma(discharge,[]))).
% 0.20/0.40 tff(25,plain,
% 0.20/0.40 (((~((~subset(intersection(A!3, empty_set), empty_set)) | ![X: $i] : ((~member(X, intersection(A!3, empty_set))) | member(X, empty_set)))) | (~(subset(intersection(A!3, empty_set), empty_set) | (~((~member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), intersection(A!3, empty_set))) | member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), empty_set)))))) | (subset(intersection(A!3, empty_set), empty_set) | (~((~member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), intersection(A!3, empty_set))) | member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), empty_set))))),
% 0.20/0.40 inference(tautology,[status(thm)],[])).
% 0.20/0.40 tff(26,plain,
% 0.20/0.40 (subset(intersection(A!3, empty_set), empty_set) | (~((~member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), intersection(A!3, empty_set))) | member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), empty_set)))),
% 0.20/0.40 inference(unit_resolution,[status(thm)],[25, 24])).
% 0.20/0.40 tff(27,assumption,(~((~member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), intersection(A!3, empty_set))) | member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), empty_set))), introduced(assumption)).
% 0.20/0.40 tff(28,plain,
% 0.20/0.40 (((~member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), intersection(A!3, empty_set))) | member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), empty_set)) | (~member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), empty_set))),
% 0.20/0.40 inference(tautology,[status(thm)],[])).
% 0.20/0.40 tff(29,plain,
% 0.20/0.40 (~member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), empty_set)),
% 0.20/0.40 inference(unit_resolution,[status(thm)],[28, 27])).
% 0.20/0.40 tff(30,plain,
% 0.20/0.40 (((~member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), intersection(A!3, empty_set))) | member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), empty_set)) | member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), intersection(A!3, empty_set))),
% 0.20/0.40 inference(tautology,[status(thm)],[])).
% 0.20/0.40 tff(31,plain,
% 0.20/0.40 (member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), intersection(A!3, empty_set))),
% 0.20/0.40 inference(unit_resolution,[status(thm)],[30, 27])).
% 0.20/0.40 tff(32,assumption,(~(member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), intersection(A!3, empty_set)) <=> (~((~member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), A!3)) | (~member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), empty_set)))))), introduced(assumption)).
% 0.20/0.40 tff(33,plain,
% 0.20/0.40 (^[X: $i, A: $i, B: $i] : refl((member(X, intersection(A, B)) <=> (~((~member(X, A)) | (~member(X, B))))) <=> (member(X, intersection(A, B)) <=> (~((~member(X, A)) | (~member(X, B))))))),
% 0.20/0.40 inference(bind,[status(th)],[])).
% 0.20/0.40 tff(34,plain,
% 0.20/0.40 (![X: $i, A: $i, B: $i] : (member(X, intersection(A, B)) <=> (~((~member(X, A)) | (~member(X, B))))) <=> ![X: $i, A: $i, B: $i] : (member(X, intersection(A, B)) <=> (~((~member(X, A)) | (~member(X, B)))))),
% 0.20/0.40 inference(quant_intro,[status(thm)],[33])).
% 0.20/0.40 tff(35,plain,
% 0.20/0.40 (^[X: $i, A: $i, B: $i] : rewrite((member(X, intersection(A, B)) <=> (member(X, A) & member(X, B))) <=> (member(X, intersection(A, B)) <=> (~((~member(X, A)) | (~member(X, B))))))),
% 0.20/0.40 inference(bind,[status(th)],[])).
% 0.20/0.40 tff(36,plain,
% 0.20/0.40 (![X: $i, A: $i, B: $i] : (member(X, intersection(A, B)) <=> (member(X, A) & member(X, B))) <=> ![X: $i, A: $i, B: $i] : (member(X, intersection(A, B)) <=> (~((~member(X, A)) | (~member(X, B)))))),
% 0.20/0.40 inference(quant_intro,[status(thm)],[35])).
% 0.20/0.40 tff(37,plain,
% 0.20/0.40 (![X: $i, A: $i, B: $i] : (member(X, intersection(A, B)) <=> (member(X, A) & member(X, B))) <=> ![X: $i, A: $i, B: $i] : (member(X, intersection(A, B)) <=> (member(X, A) & member(X, B)))),
% 0.20/0.40 inference(rewrite,[status(thm)],[])).
% 0.20/0.40 tff(38,axiom,(![X: $i, A: $i, B: $i] : (member(X, intersection(A, B)) <=> (member(X, A) & member(X, B)))), file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax','intersection')).
% 0.20/0.40 tff(39,plain,
% 0.20/0.40 (![X: $i, A: $i, B: $i] : (member(X, intersection(A, B)) <=> (member(X, A) & member(X, B)))),
% 0.20/0.40 inference(modus_ponens,[status(thm)],[38, 37])).
% 0.20/0.40 tff(40,plain,(
% 0.20/0.40 ![X: $i, A: $i, B: $i] : (member(X, intersection(A, B)) <=> (member(X, A) & member(X, B)))),
% 0.20/0.40 inference(skolemize,[status(sab)],[39])).
% 0.20/0.40 tff(41,plain,
% 0.20/0.40 (![X: $i, A: $i, B: $i] : (member(X, intersection(A, B)) <=> (~((~member(X, A)) | (~member(X, B)))))),
% 0.20/0.40 inference(modus_ponens,[status(thm)],[40, 36])).
% 0.20/0.40 tff(42,plain,
% 0.20/0.40 (![X: $i, A: $i, B: $i] : (member(X, intersection(A, B)) <=> (~((~member(X, A)) | (~member(X, B)))))),
% 0.20/0.40 inference(modus_ponens,[status(thm)],[41, 34])).
% 0.20/0.40 tff(43,plain,
% 0.20/0.40 ((~![X: $i, A: $i, B: $i] : (member(X, intersection(A, B)) <=> (~((~member(X, A)) | (~member(X, B)))))) | (member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), intersection(A!3, empty_set)) <=> (~((~member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), A!3)) | (~member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), empty_set)))))),
% 0.20/0.40 inference(quant_inst,[status(thm)],[])).
% 0.20/0.40 tff(44,plain,
% 0.20/0.40 ($false),
% 0.20/0.40 inference(unit_resolution,[status(thm)],[43, 42, 32])).
% 0.20/0.40 tff(45,plain,(member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), intersection(A!3, empty_set)) <=> (~((~member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), A!3)) | (~member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), empty_set))))), inference(lemma,lemma(discharge,[]))).
% 0.20/0.40 tff(46,plain,
% 0.20/0.40 ((~(member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), intersection(A!3, empty_set)) <=> (~((~member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), A!3)) | (~member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), empty_set)))))) | (~member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), intersection(A!3, empty_set))) | (~((~member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), A!3)) | (~member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), empty_set))))),
% 0.20/0.40 inference(tautology,[status(thm)],[])).
% 0.20/0.40 tff(47,plain,
% 0.20/0.40 ((~member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), intersection(A!3, empty_set))) | (~((~member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), A!3)) | (~member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), empty_set))))),
% 0.20/0.40 inference(unit_resolution,[status(thm)],[46, 45])).
% 0.20/0.40 tff(48,plain,
% 0.20/0.40 (~((~member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), A!3)) | (~member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), empty_set)))),
% 0.20/0.40 inference(unit_resolution,[status(thm)],[47, 31])).
% 0.20/0.40 tff(49,plain,
% 0.20/0.40 (((~member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), A!3)) | (~member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), empty_set))) | member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), empty_set)),
% 0.20/0.40 inference(tautology,[status(thm)],[])).
% 0.20/0.40 tff(50,plain,
% 0.20/0.40 ($false),
% 0.20/0.40 inference(unit_resolution,[status(thm)],[49, 48, 29])).
% 0.20/0.40 tff(51,plain,((~member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), intersection(A!3, empty_set))) | member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), empty_set)), inference(lemma,lemma(discharge,[]))).
% 0.20/0.40 tff(52,plain,
% 0.20/0.40 ((~(subset(intersection(A!3, empty_set), empty_set) | (~((~member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), intersection(A!3, empty_set))) | member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), empty_set))))) | subset(intersection(A!3, empty_set), empty_set) | (~((~member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), intersection(A!3, empty_set))) | member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), empty_set)))),
% 0.20/0.40 inference(tautology,[status(thm)],[])).
% 0.20/0.40 tff(53,plain,
% 0.20/0.40 ((~(subset(intersection(A!3, empty_set), empty_set) | (~((~member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), intersection(A!3, empty_set))) | member(tptp_fun_X_0(empty_set, intersection(A!3, empty_set)), empty_set))))) | subset(intersection(A!3, empty_set), empty_set)),
% 0.20/0.40 inference(unit_resolution,[status(thm)],[52, 51])).
% 0.20/0.40 tff(54,plain,
% 0.20/0.40 (subset(intersection(A!3, empty_set), empty_set)),
% 0.20/0.40 inference(unit_resolution,[status(thm)],[53, 26])).
% 0.20/0.40 tff(55,plain,
% 0.20/0.40 (^[A: $i, B: $i] : refl((equal_set(A, B) <=> (~((~subset(A, B)) | (~subset(B, A))))) <=> (equal_set(A, B) <=> (~((~subset(A, B)) | (~subset(B, A))))))),
% 0.20/0.40 inference(bind,[status(th)],[])).
% 0.20/0.40 tff(56,plain,
% 0.20/0.40 (![A: $i, B: $i] : (equal_set(A, B) <=> (~((~subset(A, B)) | (~subset(B, A))))) <=> ![A: $i, B: $i] : (equal_set(A, B) <=> (~((~subset(A, B)) | (~subset(B, A)))))),
% 0.20/0.40 inference(quant_intro,[status(thm)],[55])).
% 0.20/0.40 tff(57,plain,
% 0.20/0.40 (^[A: $i, B: $i] : rewrite((equal_set(A, B) <=> (subset(A, B) & subset(B, A))) <=> (equal_set(A, B) <=> (~((~subset(A, B)) | (~subset(B, A))))))),
% 0.20/0.40 inference(bind,[status(th)],[])).
% 0.20/0.40 tff(58,plain,
% 0.20/0.40 (![A: $i, B: $i] : (equal_set(A, B) <=> (subset(A, B) & subset(B, A))) <=> ![A: $i, B: $i] : (equal_set(A, B) <=> (~((~subset(A, B)) | (~subset(B, A)))))),
% 0.20/0.40 inference(quant_intro,[status(thm)],[57])).
% 0.20/0.40 tff(59,plain,
% 0.20/0.40 (![A: $i, B: $i] : (equal_set(A, B) <=> (subset(A, B) & subset(B, A))) <=> ![A: $i, B: $i] : (equal_set(A, B) <=> (subset(A, B) & subset(B, A)))),
% 0.20/0.40 inference(rewrite,[status(thm)],[])).
% 0.20/0.40 tff(60,axiom,(![A: $i, B: $i] : (equal_set(A, B) <=> (subset(A, B) & subset(B, A)))), file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax','equal_set')).
% 0.20/0.40 tff(61,plain,
% 0.20/0.40 (![A: $i, B: $i] : (equal_set(A, B) <=> (subset(A, B) & subset(B, A)))),
% 0.20/0.40 inference(modus_ponens,[status(thm)],[60, 59])).
% 0.20/0.40 tff(62,plain,(
% 0.20/0.40 ![A: $i, B: $i] : (equal_set(A, B) <=> (subset(A, B) & subset(B, A)))),
% 0.20/0.40 inference(skolemize,[status(sab)],[61])).
% 0.20/0.40 tff(63,plain,
% 0.20/0.40 (![A: $i, B: $i] : (equal_set(A, B) <=> (~((~subset(A, B)) | (~subset(B, A)))))),
% 0.20/0.40 inference(modus_ponens,[status(thm)],[62, 58])).
% 0.20/0.40 tff(64,plain,
% 0.20/0.40 (![A: $i, B: $i] : (equal_set(A, B) <=> (~((~subset(A, B)) | (~subset(B, A)))))),
% 0.20/0.40 inference(modus_ponens,[status(thm)],[63, 56])).
% 0.20/0.40 tff(65,plain,
% 0.20/0.40 ((~![A: $i, B: $i] : (equal_set(A, B) <=> (~((~subset(A, B)) | (~subset(B, A)))))) | (equal_set(intersection(A!3, empty_set), empty_set) <=> (~((~subset(intersection(A!3, empty_set), empty_set)) | (~subset(empty_set, intersection(A!3, empty_set))))))),
% 0.20/0.40 inference(quant_inst,[status(thm)],[])).
% 0.20/0.40 tff(66,plain,
% 0.20/0.40 (equal_set(intersection(A!3, empty_set), empty_set) <=> (~((~subset(intersection(A!3, empty_set), empty_set)) | (~subset(empty_set, intersection(A!3, empty_set)))))),
% 0.20/0.40 inference(unit_resolution,[status(thm)],[65, 64])).
% 0.20/0.40 tff(67,plain,
% 0.20/0.40 ((~![A: $i] : equal_set(intersection(A, empty_set), empty_set)) <=> (~![A: $i] : equal_set(intersection(A, empty_set), empty_set))),
% 0.20/0.40 inference(rewrite,[status(thm)],[])).
% 0.20/0.40 tff(68,axiom,(~![A: $i] : equal_set(intersection(A, empty_set), empty_set)), file('/export/starexec/sandbox/benchmark/theBenchmark.p','thI17')).
% 0.20/0.40 tff(69,plain,
% 0.20/0.40 (~![A: $i] : equal_set(intersection(A, empty_set), empty_set)),
% 0.20/0.40 inference(modus_ponens,[status(thm)],[68, 67])).
% 0.20/0.40 tff(70,plain,
% 0.20/0.40 (~![A: $i] : equal_set(intersection(A, empty_set), empty_set)),
% 0.20/0.40 inference(modus_ponens,[status(thm)],[69, 67])).
% 0.20/0.40 tff(71,plain,
% 0.20/0.40 (~![A: $i] : equal_set(intersection(A, empty_set), empty_set)),
% 0.20/0.40 inference(modus_ponens,[status(thm)],[70, 67])).
% 0.20/0.40 tff(72,plain,
% 0.20/0.40 (~![A: $i] : equal_set(intersection(A, empty_set), empty_set)),
% 0.20/0.40 inference(modus_ponens,[status(thm)],[71, 67])).
% 0.20/0.40 tff(73,plain,
% 0.20/0.40 (~![A: $i] : equal_set(intersection(A, empty_set), empty_set)),
% 0.20/0.40 inference(modus_ponens,[status(thm)],[72, 67])).
% 0.20/0.40 tff(74,plain,
% 0.20/0.40 (~![A: $i] : equal_set(intersection(A, empty_set), empty_set)),
% 0.20/0.40 inference(modus_ponens,[status(thm)],[73, 67])).
% 0.20/0.40 tff(75,plain,
% 0.20/0.40 (~![A: $i] : equal_set(intersection(A, empty_set), empty_set)),
% 0.20/0.40 inference(modus_ponens,[status(thm)],[74, 67])).
% 0.20/0.40 tff(76,plain,(
% 0.20/0.40 ~equal_set(intersection(A!3, empty_set), empty_set)),
% 0.20/0.40 inference(skolemize,[status(sab)],[75])).
% 0.20/0.40 tff(77,plain,
% 0.20/0.40 ((~(equal_set(intersection(A!3, empty_set), empty_set) <=> (~((~subset(intersection(A!3, empty_set), empty_set)) | (~subset(empty_set, intersection(A!3, empty_set))))))) | equal_set(intersection(A!3, empty_set), empty_set) | ((~subset(intersection(A!3, empty_set), empty_set)) | (~subset(empty_set, intersection(A!3, empty_set))))),
% 0.20/0.40 inference(tautology,[status(thm)],[])).
% 0.20/0.40 tff(78,plain,
% 0.20/0.40 ((~(equal_set(intersection(A!3, empty_set), empty_set) <=> (~((~subset(intersection(A!3, empty_set), empty_set)) | (~subset(empty_set, intersection(A!3, empty_set))))))) | ((~subset(intersection(A!3, empty_set), empty_set)) | (~subset(empty_set, intersection(A!3, empty_set))))),
% 0.20/0.40 inference(unit_resolution,[status(thm)],[77, 76])).
% 0.20/0.40 tff(79,plain,
% 0.20/0.40 ((~subset(intersection(A!3, empty_set), empty_set)) | (~subset(empty_set, intersection(A!3, empty_set)))),
% 0.20/0.40 inference(unit_resolution,[status(thm)],[78, 66])).
% 0.20/0.40 tff(80,plain,
% 0.20/0.40 ((~((~subset(intersection(A!3, empty_set), empty_set)) | (~subset(empty_set, intersection(A!3, empty_set))))) | (~subset(intersection(A!3, empty_set), empty_set)) | (~subset(empty_set, intersection(A!3, empty_set)))),
% 0.20/0.40 inference(tautology,[status(thm)],[])).
% 0.20/0.40 tff(81,plain,
% 0.20/0.40 ((~subset(intersection(A!3, empty_set), empty_set)) | (~subset(empty_set, intersection(A!3, empty_set)))),
% 0.20/0.40 inference(unit_resolution,[status(thm)],[80, 79])).
% 0.20/0.40 tff(82,plain,
% 0.20/0.40 (~subset(empty_set, intersection(A!3, empty_set))),
% 0.20/0.40 inference(unit_resolution,[status(thm)],[81, 54])).
% 0.20/0.40 tff(83,plain,
% 0.20/0.40 ((~(subset(empty_set, intersection(A!3, empty_set)) | (~((~member(tptp_fun_X_0(intersection(A!3, empty_set), empty_set), empty_set)) | member(tptp_fun_X_0(intersection(A!3, empty_set), empty_set), intersection(A!3, empty_set)))))) | subset(empty_set, intersection(A!3, empty_set)) | (~((~member(tptp_fun_X_0(intersection(A!3, empty_set), empty_set), empty_set)) | member(tptp_fun_X_0(intersection(A!3, empty_set), empty_set), intersection(A!3, empty_set))))),
% 0.20/0.40 inference(tautology,[status(thm)],[])).
% 0.20/0.40 tff(84,plain,
% 0.20/0.40 ((~(subset(empty_set, intersection(A!3, empty_set)) | (~((~member(tptp_fun_X_0(intersection(A!3, empty_set), empty_set), empty_set)) | member(tptp_fun_X_0(intersection(A!3, empty_set), empty_set), intersection(A!3, empty_set)))))) | (~((~member(tptp_fun_X_0(intersection(A!3, empty_set), empty_set), empty_set)) | member(tptp_fun_X_0(intersection(A!3, empty_set), empty_set), intersection(A!3, empty_set))))),
% 0.20/0.40 inference(unit_resolution,[status(thm)],[83, 82])).
% 0.20/0.40 tff(85,plain,
% 0.20/0.40 (~((~member(tptp_fun_X_0(intersection(A!3, empty_set), empty_set), empty_set)) | member(tptp_fun_X_0(intersection(A!3, empty_set), empty_set), intersection(A!3, empty_set)))),
% 0.20/0.40 inference(unit_resolution,[status(thm)],[84, 20])).
% 0.20/0.41 tff(86,plain,
% 0.20/0.41 (((~member(tptp_fun_X_0(intersection(A!3, empty_set), empty_set), empty_set)) | member(tptp_fun_X_0(intersection(A!3, empty_set), empty_set), intersection(A!3, empty_set))) | member(tptp_fun_X_0(intersection(A!3, empty_set), empty_set), empty_set)),
% 0.20/0.41 inference(tautology,[status(thm)],[])).
% 0.20/0.41 tff(87,plain,
% 0.20/0.41 (member(tptp_fun_X_0(intersection(A!3, empty_set), empty_set), empty_set)),
% 0.20/0.41 inference(unit_resolution,[status(thm)],[86, 85])).
% 0.20/0.41 tff(88,plain,
% 0.20/0.41 (^[X: $i] : refl((~member(X, empty_set)) <=> (~member(X, empty_set)))),
% 0.20/0.41 inference(bind,[status(th)],[])).
% 0.20/0.41 tff(89,plain,
% 0.20/0.41 (![X: $i] : (~member(X, empty_set)) <=> ![X: $i] : (~member(X, empty_set))),
% 0.20/0.41 inference(quant_intro,[status(thm)],[88])).
% 0.20/0.41 tff(90,plain,
% 0.20/0.41 (![X: $i] : (~member(X, empty_set)) <=> ![X: $i] : (~member(X, empty_set))),
% 0.20/0.41 inference(rewrite,[status(thm)],[])).
% 0.20/0.41 tff(91,axiom,(![X: $i] : (~member(X, empty_set))), file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax','empty_set')).
% 0.20/0.41 tff(92,plain,
% 0.20/0.41 (![X: $i] : (~member(X, empty_set))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[91, 90])).
% 0.20/0.41 tff(93,plain,(
% 0.20/0.41 ![X: $i] : (~member(X, empty_set))),
% 0.20/0.41 inference(skolemize,[status(sab)],[92])).
% 0.20/0.41 tff(94,plain,
% 0.20/0.41 (![X: $i] : (~member(X, empty_set))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[93, 89])).
% 0.20/0.41 tff(95,plain,
% 0.20/0.41 ((~![X: $i] : (~member(X, empty_set))) | (~member(tptp_fun_X_0(intersection(A!3, empty_set), empty_set), empty_set))),
% 0.20/0.41 inference(quant_inst,[status(thm)],[])).
% 0.20/0.41 tff(96,plain,
% 0.20/0.41 ($false),
% 0.20/0.41 inference(unit_resolution,[status(thm)],[95, 94, 87])).
% 0.20/0.41 % SZS output end Proof
%------------------------------------------------------------------------------