TSTP Solution File: ALG040+1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : ALG040+1 : TPTP v8.1.0. Released v2.7.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n004.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 6 16:07:28 EDT 2022
% Result : Theorem 0.13s 0.41s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : ALG040+1 : TPTP v8.1.0. Released v2.7.0.
% 0.07/0.14 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.35 % Computer : n004.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 : Mon Aug 29 13:09:20 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.36 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.13/0.36 Usage: tptp [options] [-file:]file
% 0.13/0.36 -h, -? prints this message.
% 0.13/0.36 -smt2 print SMT-LIB2 benchmark.
% 0.13/0.36 -m, -model generate model.
% 0.13/0.36 -p, -proof generate proof.
% 0.13/0.36 -c, -core generate unsat core of named formulas.
% 0.13/0.36 -st, -statistics display statistics.
% 0.13/0.36 -t:timeout set timeout (in second).
% 0.13/0.36 -smt2status display status in smt2 format instead of SZS.
% 0.13/0.36 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.13/0.36 -<param>:<value> configuration parameter and value.
% 0.13/0.36 -o:<output-file> file to place output in.
% 0.13/0.41 % SZS status Theorem
% 0.13/0.41 % SZS output start Proof
% 0.13/0.41 tff(h_type, type, (
% 0.13/0.41 h: $i > $i)).
% 0.13/0.41 tff(tptp_fun_U_0_type, type, (
% 0.13/0.41 tptp_fun_U_0: $i)).
% 0.13/0.41 tff(op2_type, type, (
% 0.13/0.41 op2: ( $i * $i ) > $i)).
% 0.13/0.41 tff(tptp_fun_V_1_type, type, (
% 0.13/0.41 tptp_fun_V_1: $i > $i)).
% 0.13/0.41 tff(op1_type, type, (
% 0.13/0.41 op1: ( $i * $i ) > $i)).
% 0.13/0.41 tff(j_type, type, (
% 0.13/0.41 j: $i > $i)).
% 0.13/0.41 tff(sorti1_type, type, (
% 0.13/0.41 sorti1: $i > $o)).
% 0.13/0.41 tff(sorti2_type, type, (
% 0.13/0.41 sorti2: $i > $o)).
% 0.13/0.41 tff(1,plain,
% 0.13/0.41 (^[U: $i] : refl(((~sorti1(U)) | sorti2(h(U))) <=> ((~sorti1(U)) | sorti2(h(U))))),
% 0.13/0.41 inference(bind,[status(th)],[])).
% 0.13/0.41 tff(2,plain,
% 0.13/0.41 (![U: $i] : ((~sorti1(U)) | sorti2(h(U))) <=> ![U: $i] : ((~sorti1(U)) | sorti2(h(U)))),
% 0.13/0.41 inference(quant_intro,[status(thm)],[1])).
% 0.13/0.41 tff(3,plain,
% 0.13/0.41 (![U: $i] : ((~sorti1(U)) | sorti2(h(U))) <=> ![U: $i] : ((~sorti1(U)) | sorti2(h(U)))),
% 0.13/0.41 inference(rewrite,[status(thm)],[])).
% 0.13/0.41 tff(4,plain,
% 0.13/0.41 ((~((![U: $i] : (sorti1(U) => sorti2(h(U))) & ![V: $i] : (sorti2(V) => sorti1(j(V)))) => (~(((![W: $i] : (sorti1(W) => ![X: $i] : (sorti1(X) => (h(op1(W, X)) = op2(h(W), h(X))))) & ![Y: $i] : (sorti2(Y) => ![Z: $i] : (sorti2(Z) => (j(op2(Y, Z)) = op1(j(Y), j(Z)))))) & ![X1: $i] : (sorti2(X1) => (h(j(X1)) = X1))) & ![X2: $i] : (sorti1(X2) => (j(h(X2)) = X2)))))) <=> (~((~(![U: $i] : ((~sorti1(U)) | sorti2(h(U))) & ![V: $i] : ((~sorti2(V)) | sorti1(j(V))))) | (~(![W: $i] : ((~sorti1(W)) | ![X: $i] : ((~sorti1(X)) | (h(op1(W, X)) = op2(h(W), h(X))))) & ![Y: $i] : ((~sorti2(Y)) | ![Z: $i] : ((~sorti2(Z)) | (j(op2(Y, Z)) = op1(j(Y), j(Z))))) & ![X1: $i] : ((~sorti2(X1)) | (h(j(X1)) = X1)) & ![X2: $i] : ((~sorti1(X2)) | (j(h(X2)) = X2))))))),
% 0.13/0.41 inference(rewrite,[status(thm)],[])).
% 0.13/0.41 tff(5,axiom,(~((![U: $i] : (sorti1(U) => sorti2(h(U))) & ![V: $i] : (sorti2(V) => sorti1(j(V)))) => (~(((![W: $i] : (sorti1(W) => ![X: $i] : (sorti1(X) => (h(op1(W, X)) = op2(h(W), h(X))))) & ![Y: $i] : (sorti2(Y) => ![Z: $i] : (sorti2(Z) => (j(op2(Y, Z)) = op1(j(Y), j(Z)))))) & ![X1: $i] : (sorti2(X1) => (h(j(X1)) = X1))) & ![X2: $i] : (sorti1(X2) => (j(h(X2)) = X2)))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','co1')).
% 0.13/0.41 tff(6,plain,
% 0.13/0.41 (~((~(![U: $i] : ((~sorti1(U)) | sorti2(h(U))) & ![V: $i] : ((~sorti2(V)) | sorti1(j(V))))) | (~(![W: $i] : ((~sorti1(W)) | ![X: $i] : ((~sorti1(X)) | (h(op1(W, X)) = op2(h(W), h(X))))) & ![Y: $i] : ((~sorti2(Y)) | ![Z: $i] : ((~sorti2(Z)) | (j(op2(Y, Z)) = op1(j(Y), j(Z))))) & ![X1: $i] : ((~sorti2(X1)) | (h(j(X1)) = X1)) & ![X2: $i] : ((~sorti1(X2)) | (j(h(X2)) = X2)))))),
% 0.13/0.41 inference(modus_ponens,[status(thm)],[5, 4])).
% 0.13/0.41 tff(7,plain,
% 0.13/0.41 (![U: $i] : ((~sorti1(U)) | sorti2(h(U))) & ![V: $i] : ((~sorti2(V)) | sorti1(j(V)))),
% 0.13/0.41 inference(or_elim,[status(thm)],[6])).
% 0.13/0.41 tff(8,plain,
% 0.13/0.41 (![U: $i] : ((~sorti1(U)) | sorti2(h(U)))),
% 0.13/0.41 inference(and_elim,[status(thm)],[7])).
% 0.13/0.41 tff(9,plain,
% 0.13/0.41 (![U: $i] : ((~sorti1(U)) | sorti2(h(U)))),
% 0.13/0.41 inference(modus_ponens,[status(thm)],[8, 3])).
% 0.13/0.41 tff(10,plain,(
% 0.13/0.41 ![U: $i] : ((~sorti1(U)) | sorti2(h(U)))),
% 0.13/0.41 inference(skolemize,[status(sab)],[9])).
% 0.13/0.41 tff(11,plain,
% 0.13/0.41 (![U: $i] : ((~sorti1(U)) | sorti2(h(U)))),
% 0.13/0.41 inference(modus_ponens,[status(thm)],[10, 2])).
% 0.13/0.41 tff(12,plain,
% 0.13/0.41 ((sorti1(U!0) & ![V: $i] : ((~sorti1(V)) | (op1(V, V) = U!0))) <=> (sorti1(U!0) & ![V: $i] : ((~sorti1(V)) | (op1(V, V) = U!0)))),
% 0.13/0.41 inference(rewrite,[status(thm)],[])).
% 0.13/0.41 tff(13,plain,
% 0.13/0.41 (?[U: $i] : (sorti1(U) & ![V: $i] : ((~sorti1(V)) | (op1(V, V) = U))) <=> ?[U: $i] : (sorti1(U) & ![V: $i] : ((~sorti1(V)) | (op1(V, V) = U)))),
% 0.13/0.41 inference(rewrite,[status(thm)],[])).
% 0.13/0.41 tff(14,plain,
% 0.13/0.41 (^[U: $i] : rewrite((sorti1(U) & ![V: $i] : (sorti1(V) => (op1(V, V) = U))) <=> (sorti1(U) & ![V: $i] : ((~sorti1(V)) | (op1(V, V) = U))))),
% 0.13/0.41 inference(bind,[status(th)],[])).
% 0.13/0.41 tff(15,plain,
% 0.13/0.41 (?[U: $i] : (sorti1(U) & ![V: $i] : (sorti1(V) => (op1(V, V) = U))) <=> ?[U: $i] : (sorti1(U) & ![V: $i] : ((~sorti1(V)) | (op1(V, V) = U)))),
% 0.13/0.41 inference(quant_intro,[status(thm)],[14])).
% 0.13/0.41 tff(16,axiom,(?[U: $i] : (sorti1(U) & ![V: $i] : (sorti1(V) => (op1(V, V) = U)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','ax3')).
% 0.13/0.41 tff(17,plain,
% 0.13/0.41 (?[U: $i] : (sorti1(U) & ![V: $i] : ((~sorti1(V)) | (op1(V, V) = U)))),
% 0.13/0.41 inference(modus_ponens,[status(thm)],[16, 15])).
% 0.13/0.41 tff(18,plain,
% 0.13/0.41 (?[U: $i] : (sorti1(U) & ![V: $i] : ((~sorti1(V)) | (op1(V, V) = U)))),
% 0.13/0.41 inference(modus_ponens,[status(thm)],[17, 13])).
% 0.13/0.41 tff(19,plain,
% 0.13/0.41 (sorti1(U!0) & ![V: $i] : ((~sorti1(V)) | (op1(V, V) = U!0))),
% 0.13/0.41 inference(modus_ponens,[status(thm)],[18, 12])).
% 0.13/0.41 tff(20,plain,
% 0.13/0.41 (sorti1(U!0)),
% 0.13/0.41 inference(and_elim,[status(thm)],[19])).
% 0.13/0.41 tff(21,plain,
% 0.13/0.41 (((~![U: $i] : ((~sorti1(U)) | sorti2(h(U)))) | ((~sorti1(U!0)) | sorti2(h(U!0)))) <=> ((~![U: $i] : ((~sorti1(U)) | sorti2(h(U)))) | (~sorti1(U!0)) | sorti2(h(U!0)))),
% 0.13/0.41 inference(rewrite,[status(thm)],[])).
% 0.13/0.41 tff(22,plain,
% 0.13/0.41 ((~![U: $i] : ((~sorti1(U)) | sorti2(h(U)))) | ((~sorti1(U!0)) | sorti2(h(U!0)))),
% 0.13/0.41 inference(quant_inst,[status(thm)],[])).
% 0.13/0.41 tff(23,plain,
% 0.13/0.41 ((~![U: $i] : ((~sorti1(U)) | sorti2(h(U)))) | (~sorti1(U!0)) | sorti2(h(U!0))),
% 0.13/0.41 inference(modus_ponens,[status(thm)],[22, 21])).
% 0.13/0.41 tff(24,plain,
% 0.13/0.41 (sorti2(h(U!0))),
% 0.13/0.41 inference(unit_resolution,[status(thm)],[23, 20, 11])).
% 0.13/0.41 tff(25,plain,
% 0.13/0.41 (^[U: $i] : refl(((~sorti2(U)) | (~((~sorti2(tptp_fun_V_1(U))) | (op2(tptp_fun_V_1(U), tptp_fun_V_1(U)) = U)))) <=> ((~sorti2(U)) | (~((~sorti2(tptp_fun_V_1(U))) | (op2(tptp_fun_V_1(U), tptp_fun_V_1(U)) = U)))))),
% 0.13/0.41 inference(bind,[status(th)],[])).
% 0.13/0.41 tff(26,plain,
% 0.13/0.41 (![U: $i] : ((~sorti2(U)) | (~((~sorti2(tptp_fun_V_1(U))) | (op2(tptp_fun_V_1(U), tptp_fun_V_1(U)) = U)))) <=> ![U: $i] : ((~sorti2(U)) | (~((~sorti2(tptp_fun_V_1(U))) | (op2(tptp_fun_V_1(U), tptp_fun_V_1(U)) = U))))),
% 0.13/0.41 inference(quant_intro,[status(thm)],[25])).
% 0.13/0.41 tff(27,plain,
% 0.13/0.41 ((~?[U: $i] : (sorti2(U) & ![V: $i] : ((~sorti2(V)) | (op2(V, V) = U)))) <=> (~?[U: $i] : (sorti2(U) & ![V: $i] : ((~sorti2(V)) | (op2(V, V) = U))))),
% 0.13/0.41 inference(rewrite,[status(thm)],[])).
% 0.13/0.41 tff(28,plain,
% 0.13/0.41 ((~?[U: $i] : (sorti2(U) & ![V: $i] : (sorti2(V) => (op2(V, V) = U)))) <=> (~?[U: $i] : (sorti2(U) & ![V: $i] : ((~sorti2(V)) | (op2(V, V) = U))))),
% 0.13/0.41 inference(rewrite,[status(thm)],[])).
% 0.13/0.41 tff(29,axiom,(~?[U: $i] : (sorti2(U) & ![V: $i] : (sorti2(V) => (op2(V, V) = U)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','ax4')).
% 0.13/0.41 tff(30,plain,
% 0.13/0.41 (~?[U: $i] : (sorti2(U) & ![V: $i] : ((~sorti2(V)) | (op2(V, V) = U)))),
% 0.13/0.41 inference(modus_ponens,[status(thm)],[29, 28])).
% 0.13/0.41 tff(31,plain,
% 0.13/0.41 (~?[U: $i] : (sorti2(U) & ![V: $i] : ((~sorti2(V)) | (op2(V, V) = U)))),
% 0.13/0.41 inference(modus_ponens,[status(thm)],[30, 27])).
% 0.13/0.41 tff(32,plain,
% 0.13/0.41 (~?[U: $i] : (sorti2(U) & ![V: $i] : ((~sorti2(V)) | (op2(V, V) = U)))),
% 0.13/0.41 inference(modus_ponens,[status(thm)],[31, 27])).
% 0.13/0.41 tff(33,plain,
% 0.13/0.41 (~?[U: $i] : (sorti2(U) & ![V: $i] : ((~sorti2(V)) | (op2(V, V) = U)))),
% 0.13/0.41 inference(modus_ponens,[status(thm)],[32, 27])).
% 0.13/0.41 tff(34,plain,
% 0.13/0.41 (~?[U: $i] : (sorti2(U) & ![V: $i] : ((~sorti2(V)) | (op2(V, V) = U)))),
% 0.13/0.41 inference(modus_ponens,[status(thm)],[33, 27])).
% 0.13/0.41 tff(35,plain,
% 0.13/0.41 (~?[U: $i] : (sorti2(U) & ![V: $i] : ((~sorti2(V)) | (op2(V, V) = U)))),
% 0.13/0.41 inference(modus_ponens,[status(thm)],[34, 27])).
% 0.13/0.41 tff(36,plain,
% 0.13/0.41 (~?[U: $i] : (sorti2(U) & ![V: $i] : ((~sorti2(V)) | (op2(V, V) = U)))),
% 0.13/0.41 inference(modus_ponens,[status(thm)],[35, 27])).
% 0.13/0.41 tff(37,plain,
% 0.13/0.41 (^[U: $i] : nnf_neg(refl($oeq((~sorti2(U)), (~sorti2(U)))), sk($oeq((~![V: $i] : ((~sorti2(V)) | (op2(V, V) = U))), (~((~sorti2(tptp_fun_V_1(U))) | (op2(tptp_fun_V_1(U), tptp_fun_V_1(U)) = U))))), $oeq((~(sorti2(U) & ![V: $i] : ((~sorti2(V)) | (op2(V, V) = U)))), ((~sorti2(U)) | (~((~sorti2(tptp_fun_V_1(U))) | (op2(tptp_fun_V_1(U), tptp_fun_V_1(U)) = U))))))),
% 0.13/0.41 inference(bind,[status(th)],[])).
% 0.13/0.41 tff(38,plain,(
% 0.13/0.41 ![U: $i] : ((~sorti2(U)) | (~((~sorti2(tptp_fun_V_1(U))) | (op2(tptp_fun_V_1(U), tptp_fun_V_1(U)) = U))))),
% 0.13/0.41 inference(nnf-neg,[status(sab)],[36, 37])).
% 0.13/0.41 tff(39,plain,
% 0.13/0.41 (![U: $i] : ((~sorti2(U)) | (~((~sorti2(tptp_fun_V_1(U))) | (op2(tptp_fun_V_1(U), tptp_fun_V_1(U)) = U))))),
% 0.13/0.41 inference(modus_ponens,[status(thm)],[38, 26])).
% 0.13/0.41 tff(40,plain,
% 0.13/0.41 (((~![U: $i] : ((~sorti2(U)) | (~((~sorti2(tptp_fun_V_1(U))) | (op2(tptp_fun_V_1(U), tptp_fun_V_1(U)) = U))))) | ((~sorti2(h(U!0))) | (~((~sorti2(tptp_fun_V_1(h(U!0)))) | (op2(tptp_fun_V_1(h(U!0)), tptp_fun_V_1(h(U!0))) = h(U!0)))))) <=> ((~![U: $i] : ((~sorti2(U)) | (~((~sorti2(tptp_fun_V_1(U))) | (op2(tptp_fun_V_1(U), tptp_fun_V_1(U)) = U))))) | (~sorti2(h(U!0))) | (~((~sorti2(tptp_fun_V_1(h(U!0)))) | (op2(tptp_fun_V_1(h(U!0)), tptp_fun_V_1(h(U!0))) = h(U!0)))))),
% 0.20/0.41 inference(rewrite,[status(thm)],[])).
% 0.20/0.41 tff(41,plain,
% 0.20/0.41 ((~![U: $i] : ((~sorti2(U)) | (~((~sorti2(tptp_fun_V_1(U))) | (op2(tptp_fun_V_1(U), tptp_fun_V_1(U)) = U))))) | ((~sorti2(h(U!0))) | (~((~sorti2(tptp_fun_V_1(h(U!0)))) | (op2(tptp_fun_V_1(h(U!0)), tptp_fun_V_1(h(U!0))) = h(U!0)))))),
% 0.20/0.41 inference(quant_inst,[status(thm)],[])).
% 0.20/0.41 tff(42,plain,
% 0.20/0.41 ((~![U: $i] : ((~sorti2(U)) | (~((~sorti2(tptp_fun_V_1(U))) | (op2(tptp_fun_V_1(U), tptp_fun_V_1(U)) = U))))) | (~sorti2(h(U!0))) | (~((~sorti2(tptp_fun_V_1(h(U!0)))) | (op2(tptp_fun_V_1(h(U!0)), tptp_fun_V_1(h(U!0))) = h(U!0))))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[41, 40])).
% 0.20/0.41 tff(43,plain,
% 0.20/0.41 (~((~sorti2(tptp_fun_V_1(h(U!0)))) | (op2(tptp_fun_V_1(h(U!0)), tptp_fun_V_1(h(U!0))) = h(U!0)))),
% 0.20/0.41 inference(unit_resolution,[status(thm)],[42, 39, 24])).
% 0.20/0.41 tff(44,plain,
% 0.20/0.41 (((~sorti2(tptp_fun_V_1(h(U!0)))) | (op2(tptp_fun_V_1(h(U!0)), tptp_fun_V_1(h(U!0))) = h(U!0))) | sorti2(tptp_fun_V_1(h(U!0)))),
% 0.20/0.41 inference(tautology,[status(thm)],[])).
% 0.20/0.41 tff(45,plain,
% 0.20/0.41 (sorti2(tptp_fun_V_1(h(U!0)))),
% 0.20/0.41 inference(unit_resolution,[status(thm)],[44, 43])).
% 0.20/0.41 tff(46,plain,
% 0.20/0.41 (^[V: $i] : refl(((~sorti2(V)) | sorti1(j(V))) <=> ((~sorti2(V)) | sorti1(j(V))))),
% 0.20/0.41 inference(bind,[status(th)],[])).
% 0.20/0.41 tff(47,plain,
% 0.20/0.41 (![V: $i] : ((~sorti2(V)) | sorti1(j(V))) <=> ![V: $i] : ((~sorti2(V)) | sorti1(j(V)))),
% 0.20/0.41 inference(quant_intro,[status(thm)],[46])).
% 0.20/0.41 tff(48,plain,
% 0.20/0.41 (![V: $i] : ((~sorti2(V)) | sorti1(j(V))) <=> ![V: $i] : ((~sorti2(V)) | sorti1(j(V)))),
% 0.20/0.41 inference(rewrite,[status(thm)],[])).
% 0.20/0.41 tff(49,plain,
% 0.20/0.41 (![V: $i] : ((~sorti2(V)) | sorti1(j(V)))),
% 0.20/0.41 inference(and_elim,[status(thm)],[7])).
% 0.20/0.41 tff(50,plain,
% 0.20/0.41 (![V: $i] : ((~sorti2(V)) | sorti1(j(V)))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[49, 48])).
% 0.20/0.41 tff(51,plain,(
% 0.20/0.41 ![V: $i] : ((~sorti2(V)) | sorti1(j(V)))),
% 0.20/0.41 inference(skolemize,[status(sab)],[50])).
% 0.20/0.41 tff(52,plain,
% 0.20/0.41 (![V: $i] : ((~sorti2(V)) | sorti1(j(V)))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[51, 47])).
% 0.20/0.41 tff(53,plain,
% 0.20/0.41 (((~![V: $i] : ((~sorti2(V)) | sorti1(j(V)))) | ((~sorti2(tptp_fun_V_1(h(U!0)))) | sorti1(j(tptp_fun_V_1(h(U!0)))))) <=> ((~![V: $i] : ((~sorti2(V)) | sorti1(j(V)))) | (~sorti2(tptp_fun_V_1(h(U!0)))) | sorti1(j(tptp_fun_V_1(h(U!0)))))),
% 0.20/0.41 inference(rewrite,[status(thm)],[])).
% 0.20/0.41 tff(54,plain,
% 0.20/0.41 ((~![V: $i] : ((~sorti2(V)) | sorti1(j(V)))) | ((~sorti2(tptp_fun_V_1(h(U!0)))) | sorti1(j(tptp_fun_V_1(h(U!0)))))),
% 0.20/0.41 inference(quant_inst,[status(thm)],[])).
% 0.20/0.41 tff(55,plain,
% 0.20/0.41 ((~![V: $i] : ((~sorti2(V)) | sorti1(j(V)))) | (~sorti2(tptp_fun_V_1(h(U!0)))) | sorti1(j(tptp_fun_V_1(h(U!0))))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[54, 53])).
% 0.20/0.41 tff(56,plain,
% 0.20/0.41 (sorti1(j(tptp_fun_V_1(h(U!0))))),
% 0.20/0.41 inference(unit_resolution,[status(thm)],[55, 52, 45])).
% 0.20/0.41 tff(57,plain,
% 0.20/0.41 (^[V: $i] : refl(((~sorti1(V)) | (op1(V, V) = U!0)) <=> ((~sorti1(V)) | (op1(V, V) = U!0)))),
% 0.20/0.41 inference(bind,[status(th)],[])).
% 0.20/0.41 tff(58,plain,
% 0.20/0.41 (![V: $i] : ((~sorti1(V)) | (op1(V, V) = U!0)) <=> ![V: $i] : ((~sorti1(V)) | (op1(V, V) = U!0))),
% 0.20/0.41 inference(quant_intro,[status(thm)],[57])).
% 0.20/0.41 tff(59,plain,
% 0.20/0.41 (![V: $i] : ((~sorti1(V)) | (op1(V, V) = U!0))),
% 0.20/0.41 inference(and_elim,[status(thm)],[19])).
% 0.20/0.41 tff(60,plain,
% 0.20/0.41 (![V: $i] : ((~sorti1(V)) | (op1(V, V) = U!0))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[59, 58])).
% 0.20/0.41 tff(61,plain,
% 0.20/0.41 (((~![V: $i] : ((~sorti1(V)) | (op1(V, V) = U!0))) | ((~sorti1(j(tptp_fun_V_1(h(U!0))))) | (op1(j(tptp_fun_V_1(h(U!0))), j(tptp_fun_V_1(h(U!0)))) = U!0))) <=> ((~![V: $i] : ((~sorti1(V)) | (op1(V, V) = U!0))) | (~sorti1(j(tptp_fun_V_1(h(U!0))))) | (op1(j(tptp_fun_V_1(h(U!0))), j(tptp_fun_V_1(h(U!0)))) = U!0))),
% 0.20/0.41 inference(rewrite,[status(thm)],[])).
% 0.20/0.41 tff(62,plain,
% 0.20/0.41 ((~![V: $i] : ((~sorti1(V)) | (op1(V, V) = U!0))) | ((~sorti1(j(tptp_fun_V_1(h(U!0))))) | (op1(j(tptp_fun_V_1(h(U!0))), j(tptp_fun_V_1(h(U!0)))) = U!0))),
% 0.20/0.41 inference(quant_inst,[status(thm)],[])).
% 0.20/0.41 tff(63,plain,
% 0.20/0.41 ((~![V: $i] : ((~sorti1(V)) | (op1(V, V) = U!0))) | (~sorti1(j(tptp_fun_V_1(h(U!0))))) | (op1(j(tptp_fun_V_1(h(U!0))), j(tptp_fun_V_1(h(U!0)))) = U!0)),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[62, 61])).
% 0.20/0.41 tff(64,plain,
% 0.20/0.41 (op1(j(tptp_fun_V_1(h(U!0))), j(tptp_fun_V_1(h(U!0)))) = U!0),
% 0.20/0.41 inference(unit_resolution,[status(thm)],[63, 60, 56])).
% 0.20/0.41 tff(65,plain,
% 0.20/0.41 (h(op1(j(tptp_fun_V_1(h(U!0))), j(tptp_fun_V_1(h(U!0))))) = h(U!0)),
% 0.20/0.41 inference(monotonicity,[status(thm)],[64])).
% 0.20/0.41 tff(66,plain,
% 0.20/0.41 (^[W: $i] : refl(((~sorti1(W)) | ![X: $i] : ((~sorti1(X)) | (h(op1(W, X)) = op2(h(W), h(X))))) <=> ((~sorti1(W)) | ![X: $i] : ((~sorti1(X)) | (h(op1(W, X)) = op2(h(W), h(X))))))),
% 0.20/0.41 inference(bind,[status(th)],[])).
% 0.20/0.41 tff(67,plain,
% 0.20/0.41 (![W: $i] : ((~sorti1(W)) | ![X: $i] : ((~sorti1(X)) | (h(op1(W, X)) = op2(h(W), h(X))))) <=> ![W: $i] : ((~sorti1(W)) | ![X: $i] : ((~sorti1(X)) | (h(op1(W, X)) = op2(h(W), h(X)))))),
% 0.20/0.41 inference(quant_intro,[status(thm)],[66])).
% 0.20/0.41 tff(68,plain,
% 0.20/0.41 (^[W: $i] : rewrite(((~sorti1(W)) | ![X: $i] : ((~sorti1(X)) | (h(op1(W, X)) = op2(h(W), h(X))))) <=> ((~sorti1(W)) | ![X: $i] : ((~sorti1(X)) | (h(op1(W, X)) = op2(h(W), h(X))))))),
% 0.20/0.41 inference(bind,[status(th)],[])).
% 0.20/0.41 tff(69,plain,
% 0.20/0.41 (![W: $i] : ((~sorti1(W)) | ![X: $i] : ((~sorti1(X)) | (h(op1(W, X)) = op2(h(W), h(X))))) <=> ![W: $i] : ((~sorti1(W)) | ![X: $i] : ((~sorti1(X)) | (h(op1(W, X)) = op2(h(W), h(X)))))),
% 0.20/0.41 inference(quant_intro,[status(thm)],[68])).
% 0.20/0.41 tff(70,plain,
% 0.20/0.41 (![W: $i] : ((~sorti1(W)) | ![X: $i] : ((~sorti1(X)) | (h(op1(W, X)) = op2(h(W), h(X))))) <=> ![W: $i] : ((~sorti1(W)) | ![X: $i] : ((~sorti1(X)) | (h(op1(W, X)) = op2(h(W), h(X)))))),
% 0.20/0.41 inference(transitivity,[status(thm)],[69, 67])).
% 0.20/0.41 tff(71,plain,
% 0.20/0.41 (![W: $i] : ((~sorti1(W)) | ![X: $i] : ((~sorti1(X)) | (h(op1(W, X)) = op2(h(W), h(X))))) <=> ![W: $i] : ((~sorti1(W)) | ![X: $i] : ((~sorti1(X)) | (h(op1(W, X)) = op2(h(W), h(X)))))),
% 0.20/0.41 inference(rewrite,[status(thm)],[])).
% 0.20/0.41 tff(72,plain,
% 0.20/0.41 (![W: $i] : ((~sorti1(W)) | ![X: $i] : ((~sorti1(X)) | (h(op1(W, X)) = op2(h(W), h(X))))) & ![Y: $i] : ((~sorti2(Y)) | ![Z: $i] : ((~sorti2(Z)) | (j(op2(Y, Z)) = op1(j(Y), j(Z))))) & ![X1: $i] : ((~sorti2(X1)) | (h(j(X1)) = X1)) & ![X2: $i] : ((~sorti1(X2)) | (j(h(X2)) = X2))),
% 0.20/0.41 inference(or_elim,[status(thm)],[6])).
% 0.20/0.41 tff(73,plain,
% 0.20/0.41 (![W: $i] : ((~sorti1(W)) | ![X: $i] : ((~sorti1(X)) | (h(op1(W, X)) = op2(h(W), h(X)))))),
% 0.20/0.41 inference(and_elim,[status(thm)],[72])).
% 0.20/0.41 tff(74,plain,
% 0.20/0.41 (![W: $i] : ((~sorti1(W)) | ![X: $i] : ((~sorti1(X)) | (h(op1(W, X)) = op2(h(W), h(X)))))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[73, 71])).
% 0.20/0.41 tff(75,plain,(
% 0.20/0.41 ![W: $i] : ((~sorti1(W)) | ![X: $i] : ((~sorti1(X)) | (h(op1(W, X)) = op2(h(W), h(X)))))),
% 0.20/0.41 inference(skolemize,[status(sab)],[74])).
% 0.20/0.41 tff(76,plain,
% 0.20/0.41 (![W: $i] : ((~sorti1(W)) | ![X: $i] : ((~sorti1(X)) | (h(op1(W, X)) = op2(h(W), h(X)))))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[75, 70])).
% 0.20/0.41 tff(77,plain,
% 0.20/0.41 (((~![W: $i] : ((~sorti1(W)) | ![X: $i] : ((~sorti1(X)) | (h(op1(W, X)) = op2(h(W), h(X)))))) | ((~sorti1(j(tptp_fun_V_1(h(U!0))))) | ![X: $i] : ((~sorti1(X)) | (h(op1(j(tptp_fun_V_1(h(U!0))), X)) = op2(h(j(tptp_fun_V_1(h(U!0)))), h(X)))))) <=> ((~![W: $i] : ((~sorti1(W)) | ![X: $i] : ((~sorti1(X)) | (h(op1(W, X)) = op2(h(W), h(X)))))) | (~sorti1(j(tptp_fun_V_1(h(U!0))))) | ![X: $i] : ((~sorti1(X)) | (h(op1(j(tptp_fun_V_1(h(U!0))), X)) = op2(h(j(tptp_fun_V_1(h(U!0)))), h(X)))))),
% 0.20/0.41 inference(rewrite,[status(thm)],[])).
% 0.20/0.41 tff(78,plain,
% 0.20/0.41 ((~![W: $i] : ((~sorti1(W)) | ![X: $i] : ((~sorti1(X)) | (h(op1(W, X)) = op2(h(W), h(X)))))) | ((~sorti1(j(tptp_fun_V_1(h(U!0))))) | ![X: $i] : ((~sorti1(X)) | (h(op1(j(tptp_fun_V_1(h(U!0))), X)) = op2(h(j(tptp_fun_V_1(h(U!0)))), h(X)))))),
% 0.20/0.41 inference(quant_inst,[status(thm)],[])).
% 0.20/0.41 tff(79,plain,
% 0.20/0.41 ((~![W: $i] : ((~sorti1(W)) | ![X: $i] : ((~sorti1(X)) | (h(op1(W, X)) = op2(h(W), h(X)))))) | (~sorti1(j(tptp_fun_V_1(h(U!0))))) | ![X: $i] : ((~sorti1(X)) | (h(op1(j(tptp_fun_V_1(h(U!0))), X)) = op2(h(j(tptp_fun_V_1(h(U!0)))), h(X))))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[78, 77])).
% 0.20/0.41 tff(80,plain,
% 0.20/0.41 (![X: $i] : ((~sorti1(X)) | (h(op1(j(tptp_fun_V_1(h(U!0))), X)) = op2(h(j(tptp_fun_V_1(h(U!0)))), h(X))))),
% 0.20/0.41 inference(unit_resolution,[status(thm)],[79, 76, 56])).
% 0.20/0.41 tff(81,plain,
% 0.20/0.41 (((~![X: $i] : ((~sorti1(X)) | (h(op1(j(tptp_fun_V_1(h(U!0))), X)) = op2(h(j(tptp_fun_V_1(h(U!0)))), h(X))))) | ((~sorti1(j(tptp_fun_V_1(h(U!0))))) | (h(op1(j(tptp_fun_V_1(h(U!0))), j(tptp_fun_V_1(h(U!0))))) = op2(h(j(tptp_fun_V_1(h(U!0)))), h(j(tptp_fun_V_1(h(U!0)))))))) <=> ((~![X: $i] : ((~sorti1(X)) | (h(op1(j(tptp_fun_V_1(h(U!0))), X)) = op2(h(j(tptp_fun_V_1(h(U!0)))), h(X))))) | (~sorti1(j(tptp_fun_V_1(h(U!0))))) | (h(op1(j(tptp_fun_V_1(h(U!0))), j(tptp_fun_V_1(h(U!0))))) = op2(h(j(tptp_fun_V_1(h(U!0)))), h(j(tptp_fun_V_1(h(U!0)))))))),
% 0.20/0.41 inference(rewrite,[status(thm)],[])).
% 0.20/0.41 tff(82,plain,
% 0.20/0.41 ((~![X: $i] : ((~sorti1(X)) | (h(op1(j(tptp_fun_V_1(h(U!0))), X)) = op2(h(j(tptp_fun_V_1(h(U!0)))), h(X))))) | ((~sorti1(j(tptp_fun_V_1(h(U!0))))) | (h(op1(j(tptp_fun_V_1(h(U!0))), j(tptp_fun_V_1(h(U!0))))) = op2(h(j(tptp_fun_V_1(h(U!0)))), h(j(tptp_fun_V_1(h(U!0)))))))),
% 0.20/0.41 inference(quant_inst,[status(thm)],[])).
% 0.20/0.41 tff(83,plain,
% 0.20/0.41 ((~![X: $i] : ((~sorti1(X)) | (h(op1(j(tptp_fun_V_1(h(U!0))), X)) = op2(h(j(tptp_fun_V_1(h(U!0)))), h(X))))) | (~sorti1(j(tptp_fun_V_1(h(U!0))))) | (h(op1(j(tptp_fun_V_1(h(U!0))), j(tptp_fun_V_1(h(U!0))))) = op2(h(j(tptp_fun_V_1(h(U!0)))), h(j(tptp_fun_V_1(h(U!0))))))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[82, 81])).
% 0.20/0.41 tff(84,plain,
% 0.20/0.41 (h(op1(j(tptp_fun_V_1(h(U!0))), j(tptp_fun_V_1(h(U!0))))) = op2(h(j(tptp_fun_V_1(h(U!0)))), h(j(tptp_fun_V_1(h(U!0)))))),
% 0.20/0.41 inference(unit_resolution,[status(thm)],[83, 56, 80])).
% 0.20/0.41 tff(85,plain,
% 0.20/0.41 (op2(h(j(tptp_fun_V_1(h(U!0)))), h(j(tptp_fun_V_1(h(U!0))))) = h(op1(j(tptp_fun_V_1(h(U!0))), j(tptp_fun_V_1(h(U!0)))))),
% 0.20/0.41 inference(symmetry,[status(thm)],[84])).
% 0.20/0.41 tff(86,plain,
% 0.20/0.41 (^[X1: $i] : refl(((~sorti2(X1)) | (h(j(X1)) = X1)) <=> ((~sorti2(X1)) | (h(j(X1)) = X1)))),
% 0.20/0.41 inference(bind,[status(th)],[])).
% 0.20/0.41 tff(87,plain,
% 0.20/0.41 (![X1: $i] : ((~sorti2(X1)) | (h(j(X1)) = X1)) <=> ![X1: $i] : ((~sorti2(X1)) | (h(j(X1)) = X1))),
% 0.20/0.41 inference(quant_intro,[status(thm)],[86])).
% 0.20/0.41 tff(88,plain,
% 0.20/0.41 (![X1: $i] : ((~sorti2(X1)) | (h(j(X1)) = X1)) <=> ![X1: $i] : ((~sorti2(X1)) | (h(j(X1)) = X1))),
% 0.20/0.41 inference(rewrite,[status(thm)],[])).
% 0.20/0.41 tff(89,plain,
% 0.20/0.41 (![X1: $i] : ((~sorti2(X1)) | (h(j(X1)) = X1))),
% 0.20/0.41 inference(and_elim,[status(thm)],[72])).
% 0.20/0.41 tff(90,plain,
% 0.20/0.41 (![X1: $i] : ((~sorti2(X1)) | (h(j(X1)) = X1))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[89, 88])).
% 0.20/0.41 tff(91,plain,(
% 0.20/0.41 ![X1: $i] : ((~sorti2(X1)) | (h(j(X1)) = X1))),
% 0.20/0.41 inference(skolemize,[status(sab)],[90])).
% 0.20/0.41 tff(92,plain,
% 0.20/0.41 (![X1: $i] : ((~sorti2(X1)) | (h(j(X1)) = X1))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[91, 87])).
% 0.20/0.41 tff(93,plain,
% 0.20/0.41 (((~![X1: $i] : ((~sorti2(X1)) | (h(j(X1)) = X1))) | ((~sorti2(tptp_fun_V_1(h(U!0)))) | (h(j(tptp_fun_V_1(h(U!0)))) = tptp_fun_V_1(h(U!0))))) <=> ((~![X1: $i] : ((~sorti2(X1)) | (h(j(X1)) = X1))) | (~sorti2(tptp_fun_V_1(h(U!0)))) | (h(j(tptp_fun_V_1(h(U!0)))) = tptp_fun_V_1(h(U!0))))),
% 0.20/0.41 inference(rewrite,[status(thm)],[])).
% 0.20/0.41 tff(94,plain,
% 0.20/0.41 ((~![X1: $i] : ((~sorti2(X1)) | (h(j(X1)) = X1))) | ((~sorti2(tptp_fun_V_1(h(U!0)))) | (h(j(tptp_fun_V_1(h(U!0)))) = tptp_fun_V_1(h(U!0))))),
% 0.20/0.41 inference(quant_inst,[status(thm)],[])).
% 0.20/0.41 tff(95,plain,
% 0.20/0.41 ((~![X1: $i] : ((~sorti2(X1)) | (h(j(X1)) = X1))) | (~sorti2(tptp_fun_V_1(h(U!0)))) | (h(j(tptp_fun_V_1(h(U!0)))) = tptp_fun_V_1(h(U!0)))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[94, 93])).
% 0.20/0.41 tff(96,plain,
% 0.20/0.41 (h(j(tptp_fun_V_1(h(U!0)))) = tptp_fun_V_1(h(U!0))),
% 0.20/0.41 inference(unit_resolution,[status(thm)],[95, 92, 45])).
% 0.20/0.41 tff(97,plain,
% 0.20/0.41 (tptp_fun_V_1(h(U!0)) = h(j(tptp_fun_V_1(h(U!0))))),
% 0.20/0.41 inference(symmetry,[status(thm)],[96])).
% 0.20/0.41 tff(98,plain,
% 0.20/0.41 (op2(tptp_fun_V_1(h(U!0)), tptp_fun_V_1(h(U!0))) = op2(h(j(tptp_fun_V_1(h(U!0)))), h(j(tptp_fun_V_1(h(U!0)))))),
% 0.20/0.42 inference(monotonicity,[status(thm)],[97, 97])).
% 0.20/0.42 tff(99,plain,
% 0.20/0.42 (op2(tptp_fun_V_1(h(U!0)), tptp_fun_V_1(h(U!0))) = h(U!0)),
% 0.20/0.42 inference(transitivity,[status(thm)],[98, 85, 65])).
% 0.20/0.42 tff(100,plain,
% 0.20/0.42 (((~sorti2(tptp_fun_V_1(h(U!0)))) | (op2(tptp_fun_V_1(h(U!0)), tptp_fun_V_1(h(U!0))) = h(U!0))) | (~(op2(tptp_fun_V_1(h(U!0)), tptp_fun_V_1(h(U!0))) = h(U!0)))),
% 0.20/0.42 inference(tautology,[status(thm)],[])).
% 0.20/0.42 tff(101,plain,
% 0.20/0.42 (~(op2(tptp_fun_V_1(h(U!0)), tptp_fun_V_1(h(U!0))) = h(U!0))),
% 0.20/0.42 inference(unit_resolution,[status(thm)],[100, 43])).
% 0.20/0.42 tff(102,plain,
% 0.20/0.42 ($false),
% 0.20/0.42 inference(unit_resolution,[status(thm)],[101, 99])).
% 0.20/0.42 % SZS output end Proof
%------------------------------------------------------------------------------