TSTP Solution File: SEU137+2 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SEU137+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n007.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 07:27:41 EDT 2022
% Result : Theorem 0.20s 0.41s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU137+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.35 % Computer : n007.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 09:22:49 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.
% 0.20/0.41 % SZS status Theorem
% 0.20/0.41 % SZS output start Proof
% 0.20/0.41 tff(set_union2_type, type, (
% 0.20/0.41 set_union2: ( $i * $i ) > $i)).
% 0.20/0.41 tff(set_difference_type, type, (
% 0.20/0.41 set_difference: ( $i * $i ) > $i)).
% 0.20/0.41 tff(tptp_fun_A_10_type, type, (
% 0.20/0.41 tptp_fun_A_10: $i)).
% 0.20/0.41 tff(tptp_fun_B_9_type, type, (
% 0.20/0.41 tptp_fun_B_9: $i)).
% 0.20/0.41 tff(subset_type, type, (
% 0.20/0.41 subset: ( $i * $i ) > $o)).
% 0.20/0.41 tff(1,plain,
% 0.20/0.41 (^[A: $i, B: $i] : refl((set_union2(A, set_difference(B, A)) = set_union2(A, B)) <=> (set_union2(A, set_difference(B, A)) = set_union2(A, B)))),
% 0.20/0.41 inference(bind,[status(th)],[])).
% 0.20/0.41 tff(2,plain,
% 0.20/0.41 (![A: $i, B: $i] : (set_union2(A, set_difference(B, A)) = set_union2(A, B)) <=> ![A: $i, B: $i] : (set_union2(A, set_difference(B, A)) = set_union2(A, B))),
% 0.20/0.41 inference(quant_intro,[status(thm)],[1])).
% 0.20/0.41 tff(3,plain,
% 0.20/0.41 (![A: $i, B: $i] : (set_union2(A, set_difference(B, A)) = set_union2(A, B)) <=> ![A: $i, B: $i] : (set_union2(A, set_difference(B, A)) = set_union2(A, B))),
% 0.20/0.41 inference(rewrite,[status(thm)],[])).
% 0.20/0.41 tff(4,axiom,(![A: $i, B: $i] : (set_union2(A, set_difference(B, A)) = set_union2(A, B))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','t39_xboole_1')).
% 0.20/0.41 tff(5,plain,
% 0.20/0.41 (![A: $i, B: $i] : (set_union2(A, set_difference(B, A)) = set_union2(A, B))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[4, 3])).
% 0.20/0.41 tff(6,plain,(
% 0.20/0.41 ![A: $i, B: $i] : (set_union2(A, set_difference(B, A)) = set_union2(A, B))),
% 0.20/0.41 inference(skolemize,[status(sab)],[5])).
% 0.20/0.41 tff(7,plain,
% 0.20/0.41 (![A: $i, B: $i] : (set_union2(A, set_difference(B, A)) = set_union2(A, B))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[6, 2])).
% 0.20/0.41 tff(8,plain,
% 0.20/0.41 ((~![A: $i, B: $i] : (set_union2(A, set_difference(B, A)) = set_union2(A, B))) | (set_union2(A!10, set_difference(B!9, A!10)) = set_union2(A!10, B!9))),
% 0.20/0.41 inference(quant_inst,[status(thm)],[])).
% 0.20/0.41 tff(9,plain,
% 0.20/0.41 (set_union2(A!10, set_difference(B!9, A!10)) = set_union2(A!10, B!9)),
% 0.20/0.41 inference(unit_resolution,[status(thm)],[8, 7])).
% 0.20/0.41 tff(10,plain,
% 0.20/0.41 (set_union2(A!10, B!9) = set_union2(A!10, set_difference(B!9, A!10))),
% 0.20/0.41 inference(symmetry,[status(thm)],[9])).
% 0.20/0.41 tff(11,plain,
% 0.20/0.41 ((~![A: $i, B: $i] : ((~subset(A, B)) | (B = set_union2(A, set_difference(B, A))))) <=> (~![A: $i, B: $i] : ((~subset(A, B)) | (B = set_union2(A, set_difference(B, A)))))),
% 0.20/0.41 inference(rewrite,[status(thm)],[])).
% 0.20/0.41 tff(12,plain,
% 0.20/0.41 ((~![A: $i, B: $i] : (subset(A, B) => (B = set_union2(A, set_difference(B, A))))) <=> (~![A: $i, B: $i] : ((~subset(A, B)) | (B = set_union2(A, set_difference(B, A)))))),
% 0.20/0.41 inference(rewrite,[status(thm)],[])).
% 0.20/0.41 tff(13,axiom,(~![A: $i, B: $i] : (subset(A, B) => (B = set_union2(A, set_difference(B, A))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','t45_xboole_1')).
% 0.20/0.41 tff(14,plain,
% 0.20/0.41 (~![A: $i, B: $i] : ((~subset(A, B)) | (B = set_union2(A, set_difference(B, A))))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[13, 12])).
% 0.20/0.41 tff(15,plain,
% 0.20/0.41 (~![A: $i, B: $i] : ((~subset(A, B)) | (B = set_union2(A, set_difference(B, A))))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[14, 11])).
% 0.20/0.41 tff(16,plain,
% 0.20/0.41 (~![A: $i, B: $i] : ((~subset(A, B)) | (B = set_union2(A, set_difference(B, A))))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[15, 11])).
% 0.20/0.41 tff(17,plain,
% 0.20/0.41 (~![A: $i, B: $i] : ((~subset(A, B)) | (B = set_union2(A, set_difference(B, A))))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[16, 11])).
% 0.20/0.41 tff(18,plain,
% 0.20/0.41 (~![A: $i, B: $i] : ((~subset(A, B)) | (B = set_union2(A, set_difference(B, A))))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[17, 11])).
% 0.20/0.41 tff(19,plain,
% 0.20/0.41 (~![A: $i, B: $i] : ((~subset(A, B)) | (B = set_union2(A, set_difference(B, A))))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[18, 11])).
% 0.20/0.41 tff(20,plain,
% 0.20/0.41 (~![A: $i, B: $i] : ((~subset(A, B)) | (B = set_union2(A, set_difference(B, A))))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[19, 11])).
% 0.20/0.41 tff(21,plain,(
% 0.20/0.41 ~((~subset(A!10, B!9)) | (B!9 = set_union2(A!10, set_difference(B!9, A!10))))),
% 0.20/0.41 inference(skolemize,[status(sab)],[20])).
% 0.20/0.41 tff(22,plain,
% 0.20/0.41 (subset(A!10, B!9)),
% 0.20/0.41 inference(or_elim,[status(thm)],[21])).
% 0.20/0.41 tff(23,plain,
% 0.20/0.41 (^[A: $i, B: $i] : refl(((~subset(A, B)) | (set_union2(A, B) = B)) <=> ((~subset(A, B)) | (set_union2(A, B) = B)))),
% 0.20/0.42 inference(bind,[status(th)],[])).
% 0.20/0.42 tff(24,plain,
% 0.20/0.42 (![A: $i, B: $i] : ((~subset(A, B)) | (set_union2(A, B) = B)) <=> ![A: $i, B: $i] : ((~subset(A, B)) | (set_union2(A, B) = B))),
% 0.20/0.42 inference(quant_intro,[status(thm)],[23])).
% 0.20/0.42 tff(25,plain,
% 0.20/0.42 (![A: $i, B: $i] : ((~subset(A, B)) | (set_union2(A, B) = B)) <=> ![A: $i, B: $i] : ((~subset(A, B)) | (set_union2(A, B) = B))),
% 0.20/0.42 inference(rewrite,[status(thm)],[])).
% 0.20/0.42 tff(26,plain,
% 0.20/0.42 (^[A: $i, B: $i] : rewrite((subset(A, B) => (set_union2(A, B) = B)) <=> ((~subset(A, B)) | (set_union2(A, B) = B)))),
% 0.20/0.42 inference(bind,[status(th)],[])).
% 0.20/0.42 tff(27,plain,
% 0.20/0.42 (![A: $i, B: $i] : (subset(A, B) => (set_union2(A, B) = B)) <=> ![A: $i, B: $i] : ((~subset(A, B)) | (set_union2(A, B) = B))),
% 0.20/0.42 inference(quant_intro,[status(thm)],[26])).
% 0.20/0.42 tff(28,axiom,(![A: $i, B: $i] : (subset(A, B) => (set_union2(A, B) = B))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','t12_xboole_1')).
% 0.20/0.42 tff(29,plain,
% 0.20/0.42 (![A: $i, B: $i] : ((~subset(A, B)) | (set_union2(A, B) = B))),
% 0.20/0.42 inference(modus_ponens,[status(thm)],[28, 27])).
% 0.20/0.42 tff(30,plain,
% 0.20/0.42 (![A: $i, B: $i] : ((~subset(A, B)) | (set_union2(A, B) = B))),
% 0.20/0.42 inference(modus_ponens,[status(thm)],[29, 25])).
% 0.20/0.42 tff(31,plain,(
% 0.20/0.42 ![A: $i, B: $i] : ((~subset(A, B)) | (set_union2(A, B) = B))),
% 0.20/0.42 inference(skolemize,[status(sab)],[30])).
% 0.20/0.42 tff(32,plain,
% 0.20/0.42 (![A: $i, B: $i] : ((~subset(A, B)) | (set_union2(A, B) = B))),
% 0.20/0.42 inference(modus_ponens,[status(thm)],[31, 24])).
% 0.20/0.42 tff(33,plain,
% 0.20/0.42 (((~![A: $i, B: $i] : ((~subset(A, B)) | (set_union2(A, B) = B))) | ((~subset(A!10, B!9)) | (set_union2(A!10, B!9) = B!9))) <=> ((~![A: $i, B: $i] : ((~subset(A, B)) | (set_union2(A, B) = B))) | (~subset(A!10, B!9)) | (set_union2(A!10, B!9) = B!9))),
% 0.20/0.42 inference(rewrite,[status(thm)],[])).
% 0.20/0.42 tff(34,plain,
% 0.20/0.42 ((~![A: $i, B: $i] : ((~subset(A, B)) | (set_union2(A, B) = B))) | ((~subset(A!10, B!9)) | (set_union2(A!10, B!9) = B!9))),
% 0.20/0.42 inference(quant_inst,[status(thm)],[])).
% 0.20/0.42 tff(35,plain,
% 0.20/0.42 ((~![A: $i, B: $i] : ((~subset(A, B)) | (set_union2(A, B) = B))) | (~subset(A!10, B!9)) | (set_union2(A!10, B!9) = B!9)),
% 0.20/0.42 inference(modus_ponens,[status(thm)],[34, 33])).
% 0.20/0.42 tff(36,plain,
% 0.20/0.42 (set_union2(A!10, B!9) = B!9),
% 0.20/0.42 inference(unit_resolution,[status(thm)],[35, 32, 22])).
% 0.20/0.42 tff(37,plain,
% 0.20/0.42 (B!9 = set_union2(A!10, B!9)),
% 0.20/0.42 inference(symmetry,[status(thm)],[36])).
% 0.20/0.42 tff(38,plain,
% 0.20/0.42 (B!9 = set_union2(A!10, set_difference(B!9, A!10))),
% 0.20/0.42 inference(transitivity,[status(thm)],[37, 10])).
% 0.20/0.42 tff(39,plain,
% 0.20/0.42 (~(B!9 = set_union2(A!10, set_difference(B!9, A!10)))),
% 0.20/0.42 inference(or_elim,[status(thm)],[21])).
% 0.20/0.42 tff(40,plain,
% 0.20/0.42 ($false),
% 0.20/0.42 inference(unit_resolution,[status(thm)],[39, 38])).
% 0.20/0.42 % SZS output end Proof
%------------------------------------------------------------------------------