%------------------------------------------------------------------------------
% File : Z3---4.15.1
% Problem : SET148+3 : TPTP v9.0.0. Released v2.2.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:21 AM UTC 2025
% Result : Theorem 0.20s 0.37s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET148+3 : TPTP v9.0.0. Released v2.2.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n006.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Fri Jun 20 04:24:35 EDT 2025
% 0.11/0.33 % CPUTime :
% 0.20/0.37 % SZS status Theorem
% 0.20/0.37 % SZS output start Proof
% 0.20/0.37 tff(subset_type, type, (
% 0.20/0.37 subset: ( $i * $i ) > $o)).
% 0.20/0.37 tff(tptp_fun_B_2_type, type, (
% 0.20/0.37 tptp_fun_B_2: $i)).
% 0.20/0.37 tff(intersection_type, type, (
% 0.20/0.37 intersection: ( $i * $i ) > $i)).
% 0.20/0.37 tff(1,plain,
% 0.20/0.37 ((~![B: $i] : (intersection(B, B) = B)) <=> (~![B: $i] : (intersection(B, B) = B))),
% 0.20/0.37 inference(rewrite,[status(thm)],[])).
% 0.20/0.37 tff(2,axiom,(~![B: $i] : (intersection(B, B) = B)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','prove_idempotency_of_intersection')).
% 0.20/0.37 tff(3,plain,
% 0.20/0.37 (~![B: $i] : (intersection(B, B) = B)),
% 0.20/0.37 inference(modus_ponens,[status(thm)],[2, 1])).
% 0.20/0.37 tff(4,plain,
% 0.20/0.37 (~![B: $i] : (intersection(B, B) = B)),
% 0.20/0.37 inference(modus_ponens,[status(thm)],[3, 1])).
% 0.20/0.37 tff(5,plain,
% 0.20/0.37 (~![B: $i] : (intersection(B, B) = B)),
% 0.20/0.37 inference(modus_ponens,[status(thm)],[4, 1])).
% 0.20/0.37 tff(6,plain,
% 0.20/0.37 (~![B: $i] : (intersection(B, B) = B)),
% 0.20/0.37 inference(modus_ponens,[status(thm)],[5, 1])).
% 0.20/0.37 tff(7,plain,(
% 0.20/0.37 ~(intersection(B!2, B!2) = B!2)),
% 0.20/0.37 inference(skolemize,[status(sab)],[6])).
% 0.20/0.37 tff(8,plain,
% 0.20/0.37 (^[B: $i, C: $i] : refl(((~subset(B, C)) | (intersection(B, C) = B)) <=> ((~subset(B, C)) | (intersection(B, C) = B)))),
% 0.20/0.37 inference(bind,[status(th)],[])).
% 0.20/0.37 tff(9,plain,
% 0.20/0.37 (![B: $i, C: $i] : ((~subset(B, C)) | (intersection(B, C) = B)) <=> ![B: $i, C: $i] : ((~subset(B, C)) | (intersection(B, C) = B))),
% 0.20/0.37 inference(quant_intro,[status(thm)],[8])).
% 0.20/0.37 tff(10,plain,
% 0.20/0.37 (![B: $i, C: $i] : ((~subset(B, C)) | (intersection(B, C) = B)) <=> ![B: $i, C: $i] : ((~subset(B, C)) | (intersection(B, C) = B))),
% 0.20/0.37 inference(rewrite,[status(thm)],[])).
% 0.20/0.37 tff(11,plain,
% 0.20/0.37 (^[B: $i, C: $i] : rewrite((subset(B, C) => (intersection(B, C) = B)) <=> ((~subset(B, C)) | (intersection(B, C) = B)))),
% 0.20/0.37 inference(bind,[status(th)],[])).
% 0.20/0.37 tff(12,plain,
% 0.20/0.37 (![B: $i, C: $i] : (subset(B, C) => (intersection(B, C) = B)) <=> ![B: $i, C: $i] : ((~subset(B, C)) | (intersection(B, C) = B))),
% 0.20/0.37 inference(quant_intro,[status(thm)],[11])).
% 0.20/0.37 tff(13,axiom,(![B: $i, C: $i] : (subset(B, C) => (intersection(B, C) = B))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','subset_intersection')).
% 0.20/0.37 tff(14,plain,
% 0.20/0.37 (![B: $i, C: $i] : ((~subset(B, C)) | (intersection(B, C) = B))),
% 0.20/0.37 inference(modus_ponens,[status(thm)],[13, 12])).
% 0.20/0.37 tff(15,plain,
% 0.20/0.37 (![B: $i, C: $i] : ((~subset(B, C)) | (intersection(B, C) = B))),
% 0.20/0.37 inference(modus_ponens,[status(thm)],[14, 10])).
% 0.20/0.37 tff(16,plain,(
% 0.20/0.37 ![B: $i, C: $i] : ((~subset(B, C)) | (intersection(B, C) = B))),
% 0.20/0.37 inference(skolemize,[status(sab)],[15])).
% 0.20/0.37 tff(17,plain,
% 0.20/0.37 (![B: $i, C: $i] : ((~subset(B, C)) | (intersection(B, C) = B))),
% 0.20/0.37 inference(modus_ponens,[status(thm)],[16, 9])).
% 0.20/0.37 tff(18,plain,
% 0.20/0.37 (((~![B: $i, C: $i] : ((~subset(B, C)) | (intersection(B, C) = B))) | ((~subset(B!2, B!2)) | (intersection(B!2, B!2) = B!2))) <=> ((~![B: $i, C: $i] : ((~subset(B, C)) | (intersection(B, C) = B))) | (~subset(B!2, B!2)) | (intersection(B!2, B!2) = B!2))),
% 0.20/0.37 inference(rewrite,[status(thm)],[])).
% 0.20/0.37 tff(19,plain,
% 0.20/0.37 ((~![B: $i, C: $i] : ((~subset(B, C)) | (intersection(B, C) = B))) | ((~subset(B!2, B!2)) | (intersection(B!2, B!2) = B!2))),
% 0.20/0.37 inference(quant_inst,[status(thm)],[])).
% 0.20/0.37 tff(20,plain,
% 0.20/0.37 ((~![B: $i, C: $i] : ((~subset(B, C)) | (intersection(B, C) = B))) | (~subset(B!2, B!2)) | (intersection(B!2, B!2) = B!2)),
% 0.20/0.37 inference(modus_ponens,[status(thm)],[19, 18])).
% 0.20/0.37 tff(21,plain,
% 0.20/0.37 (~subset(B!2, B!2)),
% 0.20/0.37 inference(unit_resolution,[status(thm)],[20, 17, 7])).
% 0.20/0.37 tff(22,plain,
% 0.20/0.37 (^[B: $i] : refl(subset(B, B) <=> subset(B, B))),
% 0.20/0.37 inference(bind,[status(th)],[])).
% 0.20/0.37 tff(23,plain,
% 0.20/0.37 (![B: $i] : subset(B, B) <=> ![B: $i] : subset(B, B)),
% 0.20/0.37 inference(quant_intro,[status(thm)],[22])).
% 0.20/0.37 tff(24,plain,
% 0.20/0.37 (![B: $i] : subset(B, B) <=> ![B: $i] : subset(B, B)),
% 0.20/0.37 inference(rewrite,[status(thm)],[])).
% 0.20/0.37 tff(25,axiom,(![B: $i] : subset(B, B)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','reflexivity_of_subset')).
% 0.20/0.37 tff(26,plain,
% 0.20/0.37 (![B: $i] : subset(B, B)),
% 0.20/0.37 inference(modus_ponens,[status(thm)],[25, 24])).
% 0.20/0.37 tff(27,plain,(
% 0.20/0.37 ![B: $i] : subset(B, B)),
% 0.20/0.37 inference(skolemize,[status(sab)],[26])).
% 0.20/0.37 tff(28,plain,
% 0.20/0.37 (![B: $i] : subset(B, B)),
% 0.20/0.37 inference(modus_ponens,[status(thm)],[27, 23])).
% 0.20/0.37 tff(29,plain,
% 0.20/0.37 ((~![B: $i] : subset(B, B)) | subset(B!2, B!2)),
% 0.20/0.37 inference(quant_inst,[status(thm)],[])).
% 0.20/0.37 tff(30,plain,
% 0.20/0.37 ($false),
% 0.20/0.37 inference(unit_resolution,[status(thm)],[29, 28, 21])).
% 0.20/0.37 % SZS output end Proof
% 0.20/0.37 % E exiting
%------------------------------------------------------------------------------