TSTP Solution File: SEU294+3 by Z3---4.8.9.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Z3---4.8.9.0
% Problem  : SEU294+3 : TPTP v8.1.0. Released v3.2.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 07:28:44 EDT 2022

% Result   : Theorem 0.10s 0.38s
% Output   : Proof 0.10s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem  : SEU294+3 : TPTP v8.1.0. Released v3.2.0.
% 0.10/0.11  % Command  : z3_tptp -proof -model -t:%d -file:%s
% 0.10/0.32  % Computer : n022.cluster.edu
% 0.10/0.32  % Model    : x86_64 x86_64
% 0.10/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32  % Memory   : 8042.1875MB
% 0.10/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32  % CPULimit : 300
% 0.10/0.32  % WCLimit  : 300
% 0.10/0.32  % DateTime : Sat Sep  3 11:43:09 EDT 2022
% 0.10/0.32  % CPUTime  : 
% 0.10/0.32  Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.10/0.32  Usage: tptp [options] [-file:]file
% 0.10/0.32    -h, -?       prints this message.
% 0.10/0.32    -smt2        print SMT-LIB2 benchmark.
% 0.10/0.32    -m, -model   generate model.
% 0.10/0.32    -p, -proof   generate proof.
% 0.10/0.32    -c, -core    generate unsat core of named formulas.
% 0.10/0.32    -st, -statistics display statistics.
% 0.10/0.32    -t:timeout   set timeout (in second).
% 0.10/0.32    -smt2status  display status in smt2 format instead of SZS.
% 0.10/0.32    -check_status check the status produced by Z3 against annotation in benchmark.
% 0.10/0.32    -<param>:<value> configuration parameter and value.
% 0.10/0.32    -o:<output-file> file to place output in.
% 0.10/0.38  % SZS status Theorem
% 0.10/0.38  % SZS output start Proof
% 0.10/0.38  tff(element_type, type, (
% 0.10/0.38     element: ( $i * $i ) > $o)).
% 0.10/0.38  tff(powerset_type, type, (
% 0.10/0.38     powerset: $i > $i)).
% 0.10/0.38  tff(tptp_fun_B_26_type, type, (
% 0.10/0.38     tptp_fun_B_26: $i)).
% 0.10/0.38  tff(tptp_fun_A_27_type, type, (
% 0.10/0.38     tptp_fun_A_27: $i)).
% 0.10/0.38  tff(subset_type, type, (
% 0.10/0.38     subset: ( $i * $i ) > $o)).
% 0.10/0.38  tff(finite_type, type, (
% 0.10/0.38     finite: $i > $o)).
% 0.10/0.38  tff(1,plain,
% 0.10/0.38      (^[A: $i, B: $i] : refl((element(A, powerset(B)) <=> subset(A, B)) <=> (element(A, powerset(B)) <=> subset(A, B)))),
% 0.10/0.38      inference(bind,[status(th)],[])).
% 0.10/0.38  tff(2,plain,
% 0.10/0.38      (![A: $i, B: $i] : (element(A, powerset(B)) <=> subset(A, B)) <=> ![A: $i, B: $i] : (element(A, powerset(B)) <=> subset(A, B))),
% 0.10/0.38      inference(quant_intro,[status(thm)],[1])).
% 0.10/0.38  tff(3,plain,
% 0.10/0.38      (![A: $i, B: $i] : (element(A, powerset(B)) <=> subset(A, B)) <=> ![A: $i, B: $i] : (element(A, powerset(B)) <=> subset(A, B))),
% 0.10/0.38      inference(rewrite,[status(thm)],[])).
% 0.10/0.38  tff(4,axiom,(![A: $i, B: $i] : (element(A, powerset(B)) <=> subset(A, B))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','t3_subset')).
% 0.10/0.38  tff(5,plain,
% 0.10/0.38      (![A: $i, B: $i] : (element(A, powerset(B)) <=> subset(A, B))),
% 0.10/0.38      inference(modus_ponens,[status(thm)],[4, 3])).
% 0.10/0.38  tff(6,plain,(
% 0.10/0.38      ![A: $i, B: $i] : (element(A, powerset(B)) <=> subset(A, B))),
% 0.10/0.38      inference(skolemize,[status(sab)],[5])).
% 0.10/0.38  tff(7,plain,
% 0.10/0.38      (![A: $i, B: $i] : (element(A, powerset(B)) <=> subset(A, B))),
% 0.10/0.38      inference(modus_ponens,[status(thm)],[6, 2])).
% 0.10/0.38  tff(8,plain,
% 0.10/0.38      ((~![A: $i, B: $i] : (element(A, powerset(B)) <=> subset(A, B))) | (element(A!27, powerset(B!26)) <=> subset(A!27, B!26))),
% 0.10/0.38      inference(quant_inst,[status(thm)],[])).
% 0.10/0.38  tff(9,plain,
% 0.10/0.38      (element(A!27, powerset(B!26)) <=> subset(A!27, B!26)),
% 0.10/0.38      inference(unit_resolution,[status(thm)],[8, 7])).
% 0.10/0.38  tff(10,plain,
% 0.10/0.38      ((~![A: $i, B: $i] : (finite(A) | (~(subset(A, B) & finite(B))))) <=> (~![A: $i, B: $i] : (finite(A) | (~(subset(A, B) & finite(B)))))),
% 0.10/0.38      inference(rewrite,[status(thm)],[])).
% 0.10/0.38  tff(11,plain,
% 0.10/0.38      ((~![A: $i, B: $i] : ((subset(A, B) & finite(B)) => finite(A))) <=> (~![A: $i, B: $i] : (finite(A) | (~(subset(A, B) & finite(B)))))),
% 0.10/0.38      inference(rewrite,[status(thm)],[])).
% 0.10/0.38  tff(12,axiom,(~![A: $i, B: $i] : ((subset(A, B) & finite(B)) => finite(A))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','t13_finset_1')).
% 0.10/0.38  tff(13,plain,
% 0.10/0.38      (~![A: $i, B: $i] : (finite(A) | (~(subset(A, B) & finite(B))))),
% 0.10/0.38      inference(modus_ponens,[status(thm)],[12, 11])).
% 0.10/0.38  tff(14,plain,
% 0.10/0.38      (~![A: $i, B: $i] : (finite(A) | (~(subset(A, B) & finite(B))))),
% 0.10/0.38      inference(modus_ponens,[status(thm)],[13, 10])).
% 0.10/0.38  tff(15,plain,
% 0.10/0.38      (~![A: $i, B: $i] : (finite(A) | (~(subset(A, B) & finite(B))))),
% 0.10/0.38      inference(modus_ponens,[status(thm)],[14, 10])).
% 0.10/0.38  tff(16,plain,
% 0.10/0.38      (~![A: $i, B: $i] : (finite(A) | (~(subset(A, B) & finite(B))))),
% 0.10/0.38      inference(modus_ponens,[status(thm)],[15, 10])).
% 0.10/0.38  tff(17,plain,
% 0.10/0.38      (~![A: $i, B: $i] : (finite(A) | (~(subset(A, B) & finite(B))))),
% 0.10/0.38      inference(modus_ponens,[status(thm)],[16, 10])).
% 0.10/0.38  tff(18,plain,
% 0.10/0.38      (~![A: $i, B: $i] : (finite(A) | (~(subset(A, B) & finite(B))))),
% 0.10/0.38      inference(modus_ponens,[status(thm)],[17, 10])).
% 0.10/0.38  tff(19,plain,
% 0.10/0.38      (~![A: $i, B: $i] : (finite(A) | (~(subset(A, B) & finite(B))))),
% 0.10/0.38      inference(modus_ponens,[status(thm)],[18, 10])).
% 0.10/0.38  tff(20,plain,(
% 0.10/0.38      ~(finite(A!27) | (~(subset(A!27, B!26) & finite(B!26))))),
% 0.10/0.38      inference(skolemize,[status(sab)],[19])).
% 0.10/0.38  tff(21,plain,
% 0.10/0.38      (subset(A!27, B!26) & finite(B!26)),
% 0.10/0.38      inference(or_elim,[status(thm)],[20])).
% 0.10/0.38  tff(22,plain,
% 0.10/0.38      (subset(A!27, B!26)),
% 0.10/0.38      inference(and_elim,[status(thm)],[21])).
% 0.10/0.38  tff(23,plain,
% 0.10/0.38      ((~(element(A!27, powerset(B!26)) <=> subset(A!27, B!26))) | element(A!27, powerset(B!26)) | (~subset(A!27, B!26))),
% 0.10/0.38      inference(tautology,[status(thm)],[])).
% 0.10/0.38  tff(24,plain,
% 0.10/0.38      ((~(element(A!27, powerset(B!26)) <=> subset(A!27, B!26))) | element(A!27, powerset(B!26))),
% 0.10/0.38      inference(unit_resolution,[status(thm)],[23, 22])).
% 0.10/0.38  tff(25,plain,
% 0.10/0.38      (element(A!27, powerset(B!26))),
% 0.10/0.38      inference(unit_resolution,[status(thm)],[24, 9])).
% 0.10/0.38  tff(26,plain,
% 0.10/0.38      (finite(B!26)),
% 0.10/0.38      inference(and_elim,[status(thm)],[21])).
% 0.10/0.39  tff(27,plain,
% 0.10/0.39      (^[A: $i] : refl(((~finite(A)) | ![B: $i] : (finite(B) | (~element(B, powerset(A))))) <=> ((~finite(A)) | ![B: $i] : (finite(B) | (~element(B, powerset(A))))))),
% 0.10/0.39      inference(bind,[status(th)],[])).
% 0.10/0.39  tff(28,plain,
% 0.10/0.39      (![A: $i] : ((~finite(A)) | ![B: $i] : (finite(B) | (~element(B, powerset(A))))) <=> ![A: $i] : ((~finite(A)) | ![B: $i] : (finite(B) | (~element(B, powerset(A)))))),
% 0.10/0.39      inference(quant_intro,[status(thm)],[27])).
% 0.10/0.39  tff(29,plain,
% 0.10/0.39      (^[A: $i] : rewrite(((~finite(A)) | ![B: $i] : (finite(B) | (~element(B, powerset(A))))) <=> ((~finite(A)) | ![B: $i] : (finite(B) | (~element(B, powerset(A))))))),
% 0.10/0.39      inference(bind,[status(th)],[])).
% 0.10/0.39  tff(30,plain,
% 0.10/0.39      (![A: $i] : ((~finite(A)) | ![B: $i] : (finite(B) | (~element(B, powerset(A))))) <=> ![A: $i] : ((~finite(A)) | ![B: $i] : (finite(B) | (~element(B, powerset(A)))))),
% 0.10/0.39      inference(quant_intro,[status(thm)],[29])).
% 0.10/0.39  tff(31,plain,
% 0.10/0.39      (![A: $i] : ((~finite(A)) | ![B: $i] : (finite(B) | (~element(B, powerset(A))))) <=> ![A: $i] : ((~finite(A)) | ![B: $i] : (finite(B) | (~element(B, powerset(A)))))),
% 0.10/0.39      inference(transitivity,[status(thm)],[30, 28])).
% 0.10/0.39  tff(32,plain,
% 0.10/0.39      (![A: $i] : ((~finite(A)) | ![B: $i] : (finite(B) | (~element(B, powerset(A))))) <=> ![A: $i] : ((~finite(A)) | ![B: $i] : (finite(B) | (~element(B, powerset(A)))))),
% 0.10/0.39      inference(rewrite,[status(thm)],[])).
% 0.10/0.39  tff(33,plain,
% 0.10/0.39      (^[A: $i] : trans(monotonicity(quant_intro(proof_bind(^[B: $i] : rewrite((element(B, powerset(A)) => finite(B)) <=> (finite(B) | (~element(B, powerset(A)))))), (![B: $i] : (element(B, powerset(A)) => finite(B)) <=> ![B: $i] : (finite(B) | (~element(B, powerset(A)))))), ((finite(A) => ![B: $i] : (element(B, powerset(A)) => finite(B))) <=> (finite(A) => ![B: $i] : (finite(B) | (~element(B, powerset(A))))))), rewrite((finite(A) => ![B: $i] : (finite(B) | (~element(B, powerset(A))))) <=> ((~finite(A)) | ![B: $i] : (finite(B) | (~element(B, powerset(A)))))), ((finite(A) => ![B: $i] : (element(B, powerset(A)) => finite(B))) <=> ((~finite(A)) | ![B: $i] : (finite(B) | (~element(B, powerset(A)))))))),
% 0.10/0.39      inference(bind,[status(th)],[])).
% 0.10/0.39  tff(34,plain,
% 0.10/0.39      (![A: $i] : (finite(A) => ![B: $i] : (element(B, powerset(A)) => finite(B))) <=> ![A: $i] : ((~finite(A)) | ![B: $i] : (finite(B) | (~element(B, powerset(A)))))),
% 0.10/0.39      inference(quant_intro,[status(thm)],[33])).
% 0.10/0.39  tff(35,axiom,(![A: $i] : (finite(A) => ![B: $i] : (element(B, powerset(A)) => finite(B)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','cc2_finset_1')).
% 0.10/0.39  tff(36,plain,
% 0.10/0.39      (![A: $i] : ((~finite(A)) | ![B: $i] : (finite(B) | (~element(B, powerset(A)))))),
% 0.10/0.39      inference(modus_ponens,[status(thm)],[35, 34])).
% 0.10/0.39  tff(37,plain,
% 0.10/0.39      (![A: $i] : ((~finite(A)) | ![B: $i] : (finite(B) | (~element(B, powerset(A)))))),
% 0.10/0.39      inference(modus_ponens,[status(thm)],[36, 32])).
% 0.10/0.39  tff(38,plain,(
% 0.10/0.39      ![A: $i] : ((~finite(A)) | ![B: $i] : (finite(B) | (~element(B, powerset(A)))))),
% 0.10/0.39      inference(skolemize,[status(sab)],[37])).
% 0.10/0.39  tff(39,plain,
% 0.10/0.39      (![A: $i] : ((~finite(A)) | ![B: $i] : (finite(B) | (~element(B, powerset(A)))))),
% 0.10/0.39      inference(modus_ponens,[status(thm)],[38, 31])).
% 0.10/0.39  tff(40,plain,
% 0.10/0.39      (((~![A: $i] : ((~finite(A)) | ![B: $i] : (finite(B) | (~element(B, powerset(A)))))) | ((~finite(B!26)) | ![B: $i] : (finite(B) | (~element(B, powerset(B!26)))))) <=> ((~![A: $i] : ((~finite(A)) | ![B: $i] : (finite(B) | (~element(B, powerset(A)))))) | (~finite(B!26)) | ![B: $i] : (finite(B) | (~element(B, powerset(B!26)))))),
% 0.10/0.39      inference(rewrite,[status(thm)],[])).
% 0.10/0.39  tff(41,plain,
% 0.10/0.39      ((~![A: $i] : ((~finite(A)) | ![B: $i] : (finite(B) | (~element(B, powerset(A)))))) | ((~finite(B!26)) | ![B: $i] : (finite(B) | (~element(B, powerset(B!26)))))),
% 0.10/0.39      inference(quant_inst,[status(thm)],[])).
% 0.10/0.39  tff(42,plain,
% 0.10/0.39      ((~![A: $i] : ((~finite(A)) | ![B: $i] : (finite(B) | (~element(B, powerset(A)))))) | (~finite(B!26)) | ![B: $i] : (finite(B) | (~element(B, powerset(B!26))))),
% 0.10/0.39      inference(modus_ponens,[status(thm)],[41, 40])).
% 0.10/0.39  tff(43,plain,
% 0.10/0.39      (![B: $i] : (finite(B) | (~element(B, powerset(B!26))))),
% 0.10/0.39      inference(unit_resolution,[status(thm)],[42, 39, 26])).
% 0.10/0.39  tff(44,plain,
% 0.10/0.39      (~finite(A!27)),
% 0.10/0.39      inference(or_elim,[status(thm)],[20])).
% 0.10/0.39  tff(45,plain,
% 0.10/0.39      (((~![B: $i] : (finite(B) | (~element(B, powerset(B!26))))) | (finite(A!27) | (~element(A!27, powerset(B!26))))) <=> ((~![B: $i] : (finite(B) | (~element(B, powerset(B!26))))) | finite(A!27) | (~element(A!27, powerset(B!26))))),
% 0.10/0.39      inference(rewrite,[status(thm)],[])).
% 0.10/0.39  tff(46,plain,
% 0.10/0.39      ((~![B: $i] : (finite(B) | (~element(B, powerset(B!26))))) | (finite(A!27) | (~element(A!27, powerset(B!26))))),
% 0.10/0.39      inference(quant_inst,[status(thm)],[])).
% 0.10/0.39  tff(47,plain,
% 0.10/0.39      ((~![B: $i] : (finite(B) | (~element(B, powerset(B!26))))) | finite(A!27) | (~element(A!27, powerset(B!26)))),
% 0.10/0.39      inference(modus_ponens,[status(thm)],[46, 45])).
% 0.10/0.39  tff(48,plain,
% 0.10/0.39      ($false),
% 0.10/0.39      inference(unit_resolution,[status(thm)],[47, 44, 43, 25])).
% 0.10/0.39  % SZS output end Proof
%------------------------------------------------------------------------------