TSTP Solution File: ALG178+1 by Z3---4.8.9.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Z3---4.8.9.0
% Problem  : ALG178+1 : TPTP v8.1.0. Released v2.7.0.
% Transfm  : none
% Format   : tptp
% Command  : z3_tptp -proof -model -t:%d -file:%s

% Computer : n017.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:08:55 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  : ALG178+1 : TPTP v8.1.0. Released v2.7.0.
% 0.03/0.12  % Command  : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.33  % Computer : n017.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 300
% 0.13/0.33  % DateTime : Mon Aug 29 13:09:19 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.13/0.34  Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.13/0.34  Usage: tptp [options] [-file:]file
% 0.13/0.34    -h, -?       prints this message.
% 0.13/0.34    -smt2        print SMT-LIB2 benchmark.
% 0.13/0.34    -m, -model   generate model.
% 0.13/0.34    -p, -proof   generate proof.
% 0.13/0.34    -c, -core    generate unsat core of named formulas.
% 0.13/0.34    -st, -statistics display statistics.
% 0.13/0.34    -t:timeout   set timeout (in second).
% 0.13/0.34    -smt2status  display status in smt2 format instead of SZS.
% 0.13/0.34    -check_status check the status produced by Z3 against annotation in benchmark.
% 0.13/0.34    -<param>:<value> configuration parameter and value.
% 0.13/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(tptp_fun_V_1_type, type, (
% 0.20/0.39     tptp_fun_V_1: $i)).
% 0.20/0.39  tff(op2_type, type, (
% 0.20/0.39     op2: ( $i * $i ) > $i)).
% 0.20/0.39  tff(tptp_fun_U_0_type, type, (
% 0.20/0.39     tptp_fun_U_0: $i)).
% 0.20/0.39  tff(h_type, type, (
% 0.20/0.39     h: $i > $i)).
% 0.20/0.39  tff(j_type, type, (
% 0.20/0.39     j: $i > $i)).
% 0.20/0.39  tff(sorti2_type, type, (
% 0.20/0.39     sorti2: $i > $o)).
% 0.20/0.39  tff(sorti1_type, type, (
% 0.20/0.39     sorti1: $i > $o)).
% 0.20/0.39  tff(op1_type, type, (
% 0.20/0.39     op1: ( $i * $i ) > $i)).
% 0.20/0.39  tff(1,plain,
% 0.20/0.39      (^[X1: $i] : refl(((~sorti2(X1)) | (h(j(X1)) = X1)) <=> ((~sorti2(X1)) | (h(j(X1)) = X1)))),
% 0.20/0.39      inference(bind,[status(th)],[])).
% 0.20/0.39  tff(2,plain,
% 0.20/0.39      (![X1: $i] : ((~sorti2(X1)) | (h(j(X1)) = X1)) <=> ![X1: $i] : ((~sorti2(X1)) | (h(j(X1)) = X1))),
% 0.20/0.39      inference(quant_intro,[status(thm)],[1])).
% 0.20/0.39  tff(3,plain,
% 0.20/0.39      (![X1: $i] : ((~sorti2(X1)) | (h(j(X1)) = X1)) <=> ![X1: $i] : ((~sorti2(X1)) | (h(j(X1)) = X1))),
% 0.20/0.39      inference(rewrite,[status(thm)],[])).
% 0.20/0.39  tff(4,plain,
% 0.20/0.39      ((~((![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.20/0.39      inference(rewrite,[status(thm)],[])).
% 0.20/0.39  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.20/0.39  tff(6,plain,
% 0.20/0.39      (~((~(![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.20/0.39      inference(modus_ponens,[status(thm)],[5, 4])).
% 0.20/0.39  tff(7,plain,
% 0.20/0.39      (![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.39      inference(or_elim,[status(thm)],[6])).
% 0.20/0.39  tff(8,plain,
% 0.20/0.39      (![X1: $i] : ((~sorti2(X1)) | (h(j(X1)) = X1))),
% 0.20/0.39      inference(and_elim,[status(thm)],[7])).
% 0.20/0.39  tff(9,plain,
% 0.20/0.39      (![X1: $i] : ((~sorti2(X1)) | (h(j(X1)) = X1))),
% 0.20/0.39      inference(modus_ponens,[status(thm)],[8, 3])).
% 0.20/0.39  tff(10,plain,(
% 0.20/0.39      ![X1: $i] : ((~sorti2(X1)) | (h(j(X1)) = X1))),
% 0.20/0.39      inference(skolemize,[status(sab)],[9])).
% 0.20/0.39  tff(11,plain,
% 0.20/0.39      (![X1: $i] : ((~sorti2(X1)) | (h(j(X1)) = X1))),
% 0.20/0.39      inference(modus_ponens,[status(thm)],[10, 2])).
% 0.20/0.39  tff(12,plain,
% 0.20/0.39      (((~(~sorti2(U!0))) & (~((~sorti2(V!1)) | (op2(U!0, op2(U!0, V!1)) = V!1)))) <=> (sorti2(U!0) & (~((~sorti2(V!1)) | (op2(U!0, op2(U!0, V!1)) = V!1))))),
% 0.20/0.39      inference(rewrite,[status(thm)],[])).
% 0.20/0.39  tff(13,plain,
% 0.20/0.39      ((~![U: $i] : ((~sorti2(U)) | ![V: $i] : ((~sorti2(V)) | (op2(U, op2(U, V)) = V)))) <=> (~![U: $i] : ((~sorti2(U)) | ![V: $i] : ((~sorti2(V)) | (op2(U, op2(U, V)) = V))))),
% 0.20/0.39      inference(rewrite,[status(thm)],[])).
% 0.20/0.39  tff(14,plain,
% 0.20/0.39      ((~![U: $i] : (sorti2(U) => ![V: $i] : (sorti2(V) => (op2(U, op2(U, V)) = V)))) <=> (~![U: $i] : ((~sorti2(U)) | ![V: $i] : ((~sorti2(V)) | (op2(U, op2(U, V)) = V))))),
% 0.20/0.39      inference(rewrite,[status(thm)],[])).
% 0.20/0.39  tff(15,axiom,(~![U: $i] : (sorti2(U) => ![V: $i] : (sorti2(V) => (op2(U, op2(U, V)) = V)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','ax4')).
% 0.20/0.39  tff(16,plain,
% 0.20/0.39      (~![U: $i] : ((~sorti2(U)) | ![V: $i] : ((~sorti2(V)) | (op2(U, op2(U, V)) = V)))),
% 0.20/0.39      inference(modus_ponens,[status(thm)],[15, 14])).
% 0.20/0.39  tff(17,plain,
% 0.20/0.39      (~![U: $i] : ((~sorti2(U)) | ![V: $i] : ((~sorti2(V)) | (op2(U, op2(U, V)) = V)))),
% 0.20/0.39      inference(modus_ponens,[status(thm)],[16, 13])).
% 0.20/0.39  tff(18,plain,
% 0.20/0.39      (~![U: $i] : ((~sorti2(U)) | ![V: $i] : ((~sorti2(V)) | (op2(U, op2(U, V)) = V)))),
% 0.20/0.39      inference(modus_ponens,[status(thm)],[17, 13])).
% 0.20/0.39  tff(19,plain,
% 0.20/0.39      (~![U: $i] : ((~sorti2(U)) | ![V: $i] : ((~sorti2(V)) | (op2(U, op2(U, V)) = V)))),
% 0.20/0.39      inference(modus_ponens,[status(thm)],[18, 13])).
% 0.20/0.39  tff(20,plain,
% 0.20/0.39      (~![U: $i] : ((~sorti2(U)) | ![V: $i] : ((~sorti2(V)) | (op2(U, op2(U, V)) = V)))),
% 0.20/0.39      inference(modus_ponens,[status(thm)],[19, 13])).
% 0.20/0.39  tff(21,plain,
% 0.20/0.39      (~![U: $i] : ((~sorti2(U)) | ![V: $i] : ((~sorti2(V)) | (op2(U, op2(U, V)) = V)))),
% 0.20/0.39      inference(modus_ponens,[status(thm)],[20, 13])).
% 0.20/0.39  tff(22,plain,
% 0.20/0.39      (~![U: $i] : ((~sorti2(U)) | ![V: $i] : ((~sorti2(V)) | (op2(U, op2(U, V)) = V)))),
% 0.20/0.39      inference(modus_ponens,[status(thm)],[21, 13])).
% 0.20/0.39  tff(23,plain,
% 0.20/0.39      (sorti2(U!0) & (~((~sorti2(V!1)) | (op2(U!0, op2(U!0, V!1)) = V!1)))),
% 0.20/0.39      inference(modus_ponens,[status(thm)],[22, 12])).
% 0.20/0.39  tff(24,plain,
% 0.20/0.39      (~((~sorti2(V!1)) | (op2(U!0, op2(U!0, V!1)) = V!1))),
% 0.20/0.39      inference(and_elim,[status(thm)],[23])).
% 0.20/0.39  tff(25,plain,
% 0.20/0.39      (sorti2(V!1)),
% 0.20/0.39      inference(or_elim,[status(thm)],[24])).
% 0.20/0.39  tff(26,plain,
% 0.20/0.39      (((~![X1: $i] : ((~sorti2(X1)) | (h(j(X1)) = X1))) | ((~sorti2(V!1)) | (h(j(V!1)) = V!1))) <=> ((~![X1: $i] : ((~sorti2(X1)) | (h(j(X1)) = X1))) | (~sorti2(V!1)) | (h(j(V!1)) = V!1))),
% 0.20/0.39      inference(rewrite,[status(thm)],[])).
% 0.20/0.39  tff(27,plain,
% 0.20/0.39      ((~![X1: $i] : ((~sorti2(X1)) | (h(j(X1)) = X1))) | ((~sorti2(V!1)) | (h(j(V!1)) = V!1))),
% 0.20/0.39      inference(quant_inst,[status(thm)],[])).
% 0.20/0.39  tff(28,plain,
% 0.20/0.39      ((~![X1: $i] : ((~sorti2(X1)) | (h(j(X1)) = X1))) | (~sorti2(V!1)) | (h(j(V!1)) = V!1)),
% 0.20/0.39      inference(modus_ponens,[status(thm)],[27, 26])).
% 0.20/0.39  tff(29,plain,
% 0.20/0.39      (h(j(V!1)) = V!1),
% 0.20/0.39      inference(unit_resolution,[status(thm)],[28, 25, 11])).
% 0.20/0.39  tff(30,plain,
% 0.20/0.39      (^[V: $i] : refl(((~sorti2(V)) | sorti1(j(V))) <=> ((~sorti2(V)) | sorti1(j(V))))),
% 0.20/0.39      inference(bind,[status(th)],[])).
% 0.20/0.39  tff(31,plain,
% 0.20/0.39      (![V: $i] : ((~sorti2(V)) | sorti1(j(V))) <=> ![V: $i] : ((~sorti2(V)) | sorti1(j(V)))),
% 0.20/0.39      inference(quant_intro,[status(thm)],[30])).
% 0.20/0.39  tff(32,plain,
% 0.20/0.39      (![V: $i] : ((~sorti2(V)) | sorti1(j(V))) <=> ![V: $i] : ((~sorti2(V)) | sorti1(j(V)))),
% 0.20/0.39      inference(rewrite,[status(thm)],[])).
% 0.20/0.39  tff(33,plain,
% 0.20/0.39      (![U: $i] : ((~sorti1(U)) | sorti2(h(U))) & ![V: $i] : ((~sorti2(V)) | sorti1(j(V)))),
% 0.20/0.39      inference(or_elim,[status(thm)],[6])).
% 0.20/0.39  tff(34,plain,
% 0.20/0.39      (![V: $i] : ((~sorti2(V)) | sorti1(j(V)))),
% 0.20/0.39      inference(and_elim,[status(thm)],[33])).
% 0.20/0.39  tff(35,plain,
% 0.20/0.39      (![V: $i] : ((~sorti2(V)) | sorti1(j(V)))),
% 0.20/0.39      inference(modus_ponens,[status(thm)],[34, 32])).
% 0.20/0.39  tff(36,plain,(
% 0.20/0.39      ![V: $i] : ((~sorti2(V)) | sorti1(j(V)))),
% 0.20/0.39      inference(skolemize,[status(sab)],[35])).
% 0.20/0.39  tff(37,plain,
% 0.20/0.39      (![V: $i] : ((~sorti2(V)) | sorti1(j(V)))),
% 0.20/0.39      inference(modus_ponens,[status(thm)],[36, 31])).
% 0.20/0.39  tff(38,plain,
% 0.20/0.39      (sorti2(U!0)),
% 0.20/0.39      inference(and_elim,[status(thm)],[23])).
% 0.20/0.39  tff(39,plain,
% 0.20/0.39      (((~![V: $i] : ((~sorti2(V)) | sorti1(j(V)))) | ((~sorti2(U!0)) | sorti1(j(U!0)))) <=> ((~![V: $i] : ((~sorti2(V)) | sorti1(j(V)))) | (~sorti2(U!0)) | sorti1(j(U!0)))),
% 0.20/0.39      inference(rewrite,[status(thm)],[])).
% 0.20/0.39  tff(40,plain,
% 0.20/0.39      ((~![V: $i] : ((~sorti2(V)) | sorti1(j(V)))) | ((~sorti2(U!0)) | sorti1(j(U!0)))),
% 0.20/0.39      inference(quant_inst,[status(thm)],[])).
% 0.20/0.39  tff(41,plain,
% 0.20/0.39      ((~![V: $i] : ((~sorti2(V)) | sorti1(j(V)))) | (~sorti2(U!0)) | sorti1(j(U!0))),
% 0.20/0.39      inference(modus_ponens,[status(thm)],[40, 39])).
% 0.20/0.39  tff(42,plain,
% 0.20/0.39      (sorti1(j(U!0))),
% 0.20/0.39      inference(unit_resolution,[status(thm)],[41, 38, 37])).
% 0.20/0.39  tff(43,plain,
% 0.20/0.39      (^[U: $i] : refl(((~sorti1(U)) | ![V: $i] : ((~sorti1(V)) | (op1(U, op1(U, V)) = V))) <=> ((~sorti1(U)) | ![V: $i] : ((~sorti1(V)) | (op1(U, op1(U, V)) = V))))),
% 0.20/0.39      inference(bind,[status(th)],[])).
% 0.20/0.39  tff(44,plain,
% 0.20/0.39      (![U: $i] : ((~sorti1(U)) | ![V: $i] : ((~sorti1(V)) | (op1(U, op1(U, V)) = V))) <=> ![U: $i] : ((~sorti1(U)) | ![V: $i] : ((~sorti1(V)) | (op1(U, op1(U, V)) = V)))),
% 0.20/0.39      inference(quant_intro,[status(thm)],[43])).
% 0.20/0.39  tff(45,plain,
% 0.20/0.39      (^[U: $i] : rewrite(((~sorti1(U)) | ![V: $i] : ((~sorti1(V)) | (op1(U, op1(U, V)) = V))) <=> ((~sorti1(U)) | ![V: $i] : ((~sorti1(V)) | (op1(U, op1(U, V)) = V))))),
% 0.20/0.39      inference(bind,[status(th)],[])).
% 0.20/0.39  tff(46,plain,
% 0.20/0.39      (![U: $i] : ((~sorti1(U)) | ![V: $i] : ((~sorti1(V)) | (op1(U, op1(U, V)) = V))) <=> ![U: $i] : ((~sorti1(U)) | ![V: $i] : ((~sorti1(V)) | (op1(U, op1(U, V)) = V)))),
% 0.20/0.39      inference(quant_intro,[status(thm)],[45])).
% 0.20/0.39  tff(47,plain,
% 0.20/0.39      (![U: $i] : ((~sorti1(U)) | ![V: $i] : ((~sorti1(V)) | (op1(U, op1(U, V)) = V))) <=> ![U: $i] : ((~sorti1(U)) | ![V: $i] : ((~sorti1(V)) | (op1(U, op1(U, V)) = V)))),
% 0.20/0.39      inference(transitivity,[status(thm)],[46, 44])).
% 0.20/0.39  tff(48,plain,
% 0.20/0.39      (![U: $i] : ((~sorti1(U)) | ![V: $i] : ((~sorti1(V)) | (op1(U, op1(U, V)) = V))) <=> ![U: $i] : ((~sorti1(U)) | ![V: $i] : ((~sorti1(V)) | (op1(U, op1(U, V)) = V)))),
% 0.20/0.39      inference(rewrite,[status(thm)],[])).
% 0.20/0.39  tff(49,plain,
% 0.20/0.39      (^[U: $i] : trans(monotonicity(quant_intro(proof_bind(^[V: $i] : rewrite((sorti1(V) => (op1(U, op1(U, V)) = V)) <=> ((~sorti1(V)) | (op1(U, op1(U, V)) = V)))), (![V: $i] : (sorti1(V) => (op1(U, op1(U, V)) = V)) <=> ![V: $i] : ((~sorti1(V)) | (op1(U, op1(U, V)) = V)))), ((sorti1(U) => ![V: $i] : (sorti1(V) => (op1(U, op1(U, V)) = V))) <=> (sorti1(U) => ![V: $i] : ((~sorti1(V)) | (op1(U, op1(U, V)) = V))))), rewrite((sorti1(U) => ![V: $i] : ((~sorti1(V)) | (op1(U, op1(U, V)) = V))) <=> ((~sorti1(U)) | ![V: $i] : ((~sorti1(V)) | (op1(U, op1(U, V)) = V)))), ((sorti1(U) => ![V: $i] : (sorti1(V) => (op1(U, op1(U, V)) = V))) <=> ((~sorti1(U)) | ![V: $i] : ((~sorti1(V)) | (op1(U, op1(U, V)) = V)))))),
% 0.20/0.39      inference(bind,[status(th)],[])).
% 0.20/0.39  tff(50,plain,
% 0.20/0.39      (![U: $i] : (sorti1(U) => ![V: $i] : (sorti1(V) => (op1(U, op1(U, V)) = V))) <=> ![U: $i] : ((~sorti1(U)) | ![V: $i] : ((~sorti1(V)) | (op1(U, op1(U, V)) = V)))),
% 0.20/0.39      inference(quant_intro,[status(thm)],[49])).
% 0.20/0.39  tff(51,axiom,(![U: $i] : (sorti1(U) => ![V: $i] : (sorti1(V) => (op1(U, op1(U, V)) = V)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','ax3')).
% 0.20/0.39  tff(52,plain,
% 0.20/0.39      (![U: $i] : ((~sorti1(U)) | ![V: $i] : ((~sorti1(V)) | (op1(U, op1(U, V)) = V)))),
% 0.20/0.39      inference(modus_ponens,[status(thm)],[51, 50])).
% 0.20/0.39  tff(53,plain,
% 0.20/0.39      (![U: $i] : ((~sorti1(U)) | ![V: $i] : ((~sorti1(V)) | (op1(U, op1(U, V)) = V)))),
% 0.20/0.39      inference(modus_ponens,[status(thm)],[52, 48])).
% 0.20/0.39  tff(54,plain,(
% 0.20/0.39      ![U: $i] : ((~sorti1(U)) | ![V: $i] : ((~sorti1(V)) | (op1(U, op1(U, V)) = V)))),
% 0.20/0.39      inference(skolemize,[status(sab)],[53])).
% 0.20/0.39  tff(55,plain,
% 0.20/0.39      (![U: $i] : ((~sorti1(U)) | ![V: $i] : ((~sorti1(V)) | (op1(U, op1(U, V)) = V)))),
% 0.20/0.39      inference(modus_ponens,[status(thm)],[54, 47])).
% 0.20/0.39  tff(56,plain,
% 0.20/0.39      (((~![U: $i] : ((~sorti1(U)) | ![V: $i] : ((~sorti1(V)) | (op1(U, op1(U, V)) = V)))) | ((~sorti1(j(U!0))) | ![V: $i] : ((~sorti1(V)) | (op1(j(U!0), op1(j(U!0), V)) = V)))) <=> ((~![U: $i] : ((~sorti1(U)) | ![V: $i] : ((~sorti1(V)) | (op1(U, op1(U, V)) = V)))) | (~sorti1(j(U!0))) | ![V: $i] : ((~sorti1(V)) | (op1(j(U!0), op1(j(U!0), V)) = V)))),
% 0.20/0.39      inference(rewrite,[status(thm)],[])).
% 0.20/0.39  tff(57,plain,
% 0.20/0.39      ((~![U: $i] : ((~sorti1(U)) | ![V: $i] : ((~sorti1(V)) | (op1(U, op1(U, V)) = V)))) | ((~sorti1(j(U!0))) | ![V: $i] : ((~sorti1(V)) | (op1(j(U!0), op1(j(U!0), V)) = V)))),
% 0.20/0.39      inference(quant_inst,[status(thm)],[])).
% 0.20/0.39  tff(58,plain,
% 0.20/0.39      ((~![U: $i] : ((~sorti1(U)) | ![V: $i] : ((~sorti1(V)) | (op1(U, op1(U, V)) = V)))) | (~sorti1(j(U!0))) | ![V: $i] : ((~sorti1(V)) | (op1(j(U!0), op1(j(U!0), V)) = V))),
% 0.20/0.39      inference(modus_ponens,[status(thm)],[57, 56])).
% 0.20/0.39  tff(59,plain,
% 0.20/0.39      (![V: $i] : ((~sorti1(V)) | (op1(j(U!0), op1(j(U!0), V)) = V))),
% 0.20/0.39      inference(unit_resolution,[status(thm)],[58, 55, 42])).
% 0.20/0.39  tff(60,plain,
% 0.20/0.39      (((~![V: $i] : ((~sorti2(V)) | sorti1(j(V)))) | ((~sorti2(V!1)) | sorti1(j(V!1)))) <=> ((~![V: $i] : ((~sorti2(V)) | sorti1(j(V)))) | (~sorti2(V!1)) | sorti1(j(V!1)))),
% 0.20/0.39      inference(rewrite,[status(thm)],[])).
% 0.20/0.39  tff(61,plain,
% 0.20/0.39      ((~![V: $i] : ((~sorti2(V)) | sorti1(j(V)))) | ((~sorti2(V!1)) | sorti1(j(V!1)))),
% 0.20/0.39      inference(quant_inst,[status(thm)],[])).
% 0.20/0.39  tff(62,plain,
% 0.20/0.39      ((~![V: $i] : ((~sorti2(V)) | sorti1(j(V)))) | (~sorti2(V!1)) | sorti1(j(V!1))),
% 0.20/0.39      inference(modus_ponens,[status(thm)],[61, 60])).
% 0.20/0.39  tff(63,plain,
% 0.20/0.39      (sorti1(j(V!1))),
% 0.20/0.39      inference(unit_resolution,[status(thm)],[62, 25, 37])).
% 0.20/0.39  tff(64,plain,
% 0.20/0.39      (((~![V: $i] : ((~sorti1(V)) | (op1(j(U!0), op1(j(U!0), V)) = V))) | ((~sorti1(j(V!1))) | (op1(j(U!0), op1(j(U!0), j(V!1))) = j(V!1)))) <=> ((~![V: $i] : ((~sorti1(V)) | (op1(j(U!0), op1(j(U!0), V)) = V))) | (~sorti1(j(V!1))) | (op1(j(U!0), op1(j(U!0), j(V!1))) = j(V!1)))),
% 0.20/0.39      inference(rewrite,[status(thm)],[])).
% 0.20/0.39  tff(65,plain,
% 0.20/0.39      ((~![V: $i] : ((~sorti1(V)) | (op1(j(U!0), op1(j(U!0), V)) = V))) | ((~sorti1(j(V!1))) | (op1(j(U!0), op1(j(U!0), j(V!1))) = j(V!1)))),
% 0.20/0.39      inference(quant_inst,[status(thm)],[])).
% 0.20/0.39  tff(66,plain,
% 0.20/0.39      ((~![V: $i] : ((~sorti1(V)) | (op1(j(U!0), op1(j(U!0), V)) = V))) | (~sorti1(j(V!1))) | (op1(j(U!0), op1(j(U!0), j(V!1))) = j(V!1))),
% 0.20/0.39      inference(modus_ponens,[status(thm)],[65, 64])).
% 0.20/0.39  tff(67,plain,
% 0.20/0.39      (op1(j(U!0), op1(j(U!0), j(V!1))) = j(V!1)),
% 0.20/0.39      inference(unit_resolution,[status(thm)],[66, 63, 59])).
% 0.20/0.39  tff(68,plain,
% 0.20/0.39      (h(op1(j(U!0), op1(j(U!0), j(V!1)))) = h(j(V!1))),
% 0.20/0.39      inference(monotonicity,[status(thm)],[67])).
% 0.20/0.39  tff(69,plain,
% 0.20/0.39      (^[U: $i] : refl(((~sorti1(U)) | ![V: $i] : ((~sorti1(V)) | sorti1(op1(U, V)))) <=> ((~sorti1(U)) | ![V: $i] : ((~sorti1(V)) | sorti1(op1(U, V)))))),
% 0.20/0.39      inference(bind,[status(th)],[])).
% 0.20/0.39  tff(70,plain,
% 0.20/0.39      (![U: $i] : ((~sorti1(U)) | ![V: $i] : ((~sorti1(V)) | sorti1(op1(U, V)))) <=> ![U: $i] : ((~sorti1(U)) | ![V: $i] : ((~sorti1(V)) | sorti1(op1(U, V))))),
% 0.20/0.39      inference(quant_intro,[status(thm)],[69])).
% 0.20/0.39  tff(71,plain,
% 0.20/0.39      (^[U: $i] : rewrite(((~sorti1(U)) | ![V: $i] : ((~sorti1(V)) | sorti1(op1(U, V)))) <=> ((~sorti1(U)) | ![V: $i] : ((~sorti1(V)) | sorti1(op1(U, V)))))),
% 0.20/0.39      inference(bind,[status(th)],[])).
% 0.20/0.39  tff(72,plain,
% 0.20/0.39      (![U: $i] : ((~sorti1(U)) | ![V: $i] : ((~sorti1(V)) | sorti1(op1(U, V)))) <=> ![U: $i] : ((~sorti1(U)) | ![V: $i] : ((~sorti1(V)) | sorti1(op1(U, V))))),
% 0.20/0.39      inference(quant_intro,[status(thm)],[71])).
% 0.20/0.39  tff(73,plain,
% 0.20/0.39      (![U: $i] : ((~sorti1(U)) | ![V: $i] : ((~sorti1(V)) | sorti1(op1(U, V)))) <=> ![U: $i] : ((~sorti1(U)) | ![V: $i] : ((~sorti1(V)) | sorti1(op1(U, V))))),
% 0.20/0.39      inference(transitivity,[status(thm)],[72, 70])).
% 0.20/0.39  tff(74,plain,
% 0.20/0.39      (![U: $i] : ((~sorti1(U)) | ![V: $i] : ((~sorti1(V)) | sorti1(op1(U, V)))) <=> ![U: $i] : ((~sorti1(U)) | ![V: $i] : ((~sorti1(V)) | sorti1(op1(U, V))))),
% 0.20/0.39      inference(rewrite,[status(thm)],[])).
% 0.20/0.39  tff(75,plain,
% 0.20/0.39      (^[U: $i] : trans(monotonicity(quant_intro(proof_bind(^[V: $i] : rewrite((sorti1(V) => sorti1(op1(U, V))) <=> ((~sorti1(V)) | sorti1(op1(U, V))))), (![V: $i] : (sorti1(V) => sorti1(op1(U, V))) <=> ![V: $i] : ((~sorti1(V)) | sorti1(op1(U, V))))), ((sorti1(U) => ![V: $i] : (sorti1(V) => sorti1(op1(U, V)))) <=> (sorti1(U) => ![V: $i] : ((~sorti1(V)) | sorti1(op1(U, V)))))), rewrite((sorti1(U) => ![V: $i] : ((~sorti1(V)) | sorti1(op1(U, V)))) <=> ((~sorti1(U)) | ![V: $i] : ((~sorti1(V)) | sorti1(op1(U, V))))), ((sorti1(U) => ![V: $i] : (sorti1(V) => sorti1(op1(U, V)))) <=> ((~sorti1(U)) | ![V: $i] : ((~sorti1(V)) | sorti1(op1(U, V))))))),
% 0.20/0.39      inference(bind,[status(th)],[])).
% 0.20/0.39  tff(76,plain,
% 0.20/0.39      (![U: $i] : (sorti1(U) => ![V: $i] : (sorti1(V) => sorti1(op1(U, V)))) <=> ![U: $i] : ((~sorti1(U)) | ![V: $i] : ((~sorti1(V)) | sorti1(op1(U, V))))),
% 0.20/0.39      inference(quant_intro,[status(thm)],[75])).
% 0.20/0.39  tff(77,axiom,(![U: $i] : (sorti1(U) => ![V: $i] : (sorti1(V) => sorti1(op1(U, V))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','ax1')).
% 0.20/0.39  tff(78,plain,
% 0.20/0.39      (![U: $i] : ((~sorti1(U)) | ![V: $i] : ((~sorti1(V)) | sorti1(op1(U, V))))),
% 0.20/0.39      inference(modus_ponens,[status(thm)],[77, 76])).
% 0.20/0.39  tff(79,plain,
% 0.20/0.39      (![U: $i] : ((~sorti1(U)) | ![V: $i] : ((~sorti1(V)) | sorti1(op1(U, V))))),
% 0.20/0.40      inference(modus_ponens,[status(thm)],[78, 74])).
% 0.20/0.40  tff(80,plain,(
% 0.20/0.40      ![U: $i] : ((~sorti1(U)) | ![V: $i] : ((~sorti1(V)) | sorti1(op1(U, V))))),
% 0.20/0.40      inference(skolemize,[status(sab)],[79])).
% 0.20/0.40  tff(81,plain,
% 0.20/0.40      (![U: $i] : ((~sorti1(U)) | ![V: $i] : ((~sorti1(V)) | sorti1(op1(U, V))))),
% 0.20/0.40      inference(modus_ponens,[status(thm)],[80, 73])).
% 0.20/0.40  tff(82,plain,
% 0.20/0.40      (((~![U: $i] : ((~sorti1(U)) | ![V: $i] : ((~sorti1(V)) | sorti1(op1(U, V))))) | ((~sorti1(j(U!0))) | ![V: $i] : ((~sorti1(V)) | sorti1(op1(j(U!0), V))))) <=> ((~![U: $i] : ((~sorti1(U)) | ![V: $i] : ((~sorti1(V)) | sorti1(op1(U, V))))) | (~sorti1(j(U!0))) | ![V: $i] : ((~sorti1(V)) | sorti1(op1(j(U!0), V))))),
% 0.20/0.40      inference(rewrite,[status(thm)],[])).
% 0.20/0.40  tff(83,plain,
% 0.20/0.40      ((~![U: $i] : ((~sorti1(U)) | ![V: $i] : ((~sorti1(V)) | sorti1(op1(U, V))))) | ((~sorti1(j(U!0))) | ![V: $i] : ((~sorti1(V)) | sorti1(op1(j(U!0), V))))),
% 0.20/0.40      inference(quant_inst,[status(thm)],[])).
% 0.20/0.40  tff(84,plain,
% 0.20/0.40      ((~![U: $i] : ((~sorti1(U)) | ![V: $i] : ((~sorti1(V)) | sorti1(op1(U, V))))) | (~sorti1(j(U!0))) | ![V: $i] : ((~sorti1(V)) | sorti1(op1(j(U!0), V)))),
% 0.20/0.40      inference(modus_ponens,[status(thm)],[83, 82])).
% 0.20/0.40  tff(85,plain,
% 0.20/0.40      (![V: $i] : ((~sorti1(V)) | sorti1(op1(j(U!0), V)))),
% 0.20/0.40      inference(unit_resolution,[status(thm)],[84, 81, 42])).
% 0.20/0.40  tff(86,plain,
% 0.20/0.40      (((~![V: $i] : ((~sorti1(V)) | sorti1(op1(j(U!0), V)))) | ((~sorti1(j(V!1))) | sorti1(op1(j(U!0), j(V!1))))) <=> ((~![V: $i] : ((~sorti1(V)) | sorti1(op1(j(U!0), V)))) | (~sorti1(j(V!1))) | sorti1(op1(j(U!0), j(V!1))))),
% 0.20/0.40      inference(rewrite,[status(thm)],[])).
% 0.20/0.40  tff(87,plain,
% 0.20/0.40      ((~![V: $i] : ((~sorti1(V)) | sorti1(op1(j(U!0), V)))) | ((~sorti1(j(V!1))) | sorti1(op1(j(U!0), j(V!1))))),
% 0.20/0.40      inference(quant_inst,[status(thm)],[])).
% 0.20/0.40  tff(88,plain,
% 0.20/0.40      ((~![V: $i] : ((~sorti1(V)) | sorti1(op1(j(U!0), V)))) | (~sorti1(j(V!1))) | sorti1(op1(j(U!0), j(V!1)))),
% 0.20/0.40      inference(modus_ponens,[status(thm)],[87, 86])).
% 0.20/0.40  tff(89,plain,
% 0.20/0.40      (sorti1(op1(j(U!0), j(V!1)))),
% 0.20/0.40      inference(unit_resolution,[status(thm)],[88, 63, 85])).
% 0.20/0.40  tff(90,plain,
% 0.20/0.40      (^[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.40      inference(bind,[status(th)],[])).
% 0.20/0.40  tff(91,plain,
% 0.20/0.40      (![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.40      inference(quant_intro,[status(thm)],[90])).
% 0.20/0.40  tff(92,plain,
% 0.20/0.40      (^[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.40      inference(bind,[status(th)],[])).
% 0.20/0.40  tff(93,plain,
% 0.20/0.40      (![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.40      inference(quant_intro,[status(thm)],[92])).
% 0.20/0.40  tff(94,plain,
% 0.20/0.40      (![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.40      inference(transitivity,[status(thm)],[93, 91])).
% 0.20/0.40  tff(95,plain,
% 0.20/0.40      (![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.40      inference(rewrite,[status(thm)],[])).
% 0.20/0.40  tff(96,plain,
% 0.20/0.40      (![W: $i] : ((~sorti1(W)) | ![X: $i] : ((~sorti1(X)) | (h(op1(W, X)) = op2(h(W), h(X)))))),
% 0.20/0.40      inference(and_elim,[status(thm)],[7])).
% 0.20/0.40  tff(97,plain,
% 0.20/0.40      (![W: $i] : ((~sorti1(W)) | ![X: $i] : ((~sorti1(X)) | (h(op1(W, X)) = op2(h(W), h(X)))))),
% 0.20/0.40      inference(modus_ponens,[status(thm)],[96, 95])).
% 0.20/0.40  tff(98,plain,(
% 0.20/0.40      ![W: $i] : ((~sorti1(W)) | ![X: $i] : ((~sorti1(X)) | (h(op1(W, X)) = op2(h(W), h(X)))))),
% 0.20/0.40      inference(skolemize,[status(sab)],[97])).
% 0.20/0.40  tff(99,plain,
% 0.20/0.40      (![W: $i] : ((~sorti1(W)) | ![X: $i] : ((~sorti1(X)) | (h(op1(W, X)) = op2(h(W), h(X)))))),
% 0.20/0.40      inference(modus_ponens,[status(thm)],[98, 94])).
% 0.20/0.40  tff(100,plain,
% 0.20/0.40      (((~![W: $i] : ((~sorti1(W)) | ![X: $i] : ((~sorti1(X)) | (h(op1(W, X)) = op2(h(W), h(X)))))) | ((~sorti1(j(U!0))) | ![X: $i] : ((~sorti1(X)) | (h(op1(j(U!0), X)) = op2(h(j(U!0)), h(X)))))) <=> ((~![W: $i] : ((~sorti1(W)) | ![X: $i] : ((~sorti1(X)) | (h(op1(W, X)) = op2(h(W), h(X)))))) | (~sorti1(j(U!0))) | ![X: $i] : ((~sorti1(X)) | (h(op1(j(U!0), X)) = op2(h(j(U!0)), h(X)))))),
% 0.20/0.40      inference(rewrite,[status(thm)],[])).
% 0.20/0.40  tff(101,plain,
% 0.20/0.40      ((~![W: $i] : ((~sorti1(W)) | ![X: $i] : ((~sorti1(X)) | (h(op1(W, X)) = op2(h(W), h(X)))))) | ((~sorti1(j(U!0))) | ![X: $i] : ((~sorti1(X)) | (h(op1(j(U!0), X)) = op2(h(j(U!0)), h(X)))))),
% 0.20/0.40      inference(quant_inst,[status(thm)],[])).
% 0.20/0.40  tff(102,plain,
% 0.20/0.40      ((~![W: $i] : ((~sorti1(W)) | ![X: $i] : ((~sorti1(X)) | (h(op1(W, X)) = op2(h(W), h(X)))))) | (~sorti1(j(U!0))) | ![X: $i] : ((~sorti1(X)) | (h(op1(j(U!0), X)) = op2(h(j(U!0)), h(X))))),
% 0.20/0.40      inference(modus_ponens,[status(thm)],[101, 100])).
% 0.20/0.40  tff(103,plain,
% 0.20/0.40      (![X: $i] : ((~sorti1(X)) | (h(op1(j(U!0), X)) = op2(h(j(U!0)), h(X))))),
% 0.20/0.40      inference(unit_resolution,[status(thm)],[102, 99, 42])).
% 0.20/0.40  tff(104,plain,
% 0.20/0.40      (((~![X: $i] : ((~sorti1(X)) | (h(op1(j(U!0), X)) = op2(h(j(U!0)), h(X))))) | ((~sorti1(op1(j(U!0), j(V!1)))) | (h(op1(j(U!0), op1(j(U!0), j(V!1)))) = op2(h(j(U!0)), h(op1(j(U!0), j(V!1))))))) <=> ((~![X: $i] : ((~sorti1(X)) | (h(op1(j(U!0), X)) = op2(h(j(U!0)), h(X))))) | (~sorti1(op1(j(U!0), j(V!1)))) | (h(op1(j(U!0), op1(j(U!0), j(V!1)))) = op2(h(j(U!0)), h(op1(j(U!0), j(V!1))))))),
% 0.20/0.40      inference(rewrite,[status(thm)],[])).
% 0.20/0.40  tff(105,plain,
% 0.20/0.40      ((~![X: $i] : ((~sorti1(X)) | (h(op1(j(U!0), X)) = op2(h(j(U!0)), h(X))))) | ((~sorti1(op1(j(U!0), j(V!1)))) | (h(op1(j(U!0), op1(j(U!0), j(V!1)))) = op2(h(j(U!0)), h(op1(j(U!0), j(V!1))))))),
% 0.20/0.40      inference(quant_inst,[status(thm)],[])).
% 0.20/0.40  tff(106,plain,
% 0.20/0.40      ((~![X: $i] : ((~sorti1(X)) | (h(op1(j(U!0), X)) = op2(h(j(U!0)), h(X))))) | (~sorti1(op1(j(U!0), j(V!1)))) | (h(op1(j(U!0), op1(j(U!0), j(V!1)))) = op2(h(j(U!0)), h(op1(j(U!0), j(V!1)))))),
% 0.20/0.40      inference(modus_ponens,[status(thm)],[105, 104])).
% 0.20/0.40  tff(107,plain,
% 0.20/0.40      (h(op1(j(U!0), op1(j(U!0), j(V!1)))) = op2(h(j(U!0)), h(op1(j(U!0), j(V!1))))),
% 0.20/0.40      inference(unit_resolution,[status(thm)],[106, 103, 89])).
% 0.20/0.40  tff(108,plain,
% 0.20/0.40      (op2(h(j(U!0)), h(op1(j(U!0), j(V!1)))) = h(op1(j(U!0), op1(j(U!0), j(V!1))))),
% 0.20/0.40      inference(symmetry,[status(thm)],[107])).
% 0.20/0.40  tff(109,plain,
% 0.20/0.40      (((~![X: $i] : ((~sorti1(X)) | (h(op1(j(U!0), X)) = op2(h(j(U!0)), h(X))))) | ((~sorti1(j(V!1))) | (h(op1(j(U!0), j(V!1))) = op2(h(j(U!0)), h(j(V!1)))))) <=> ((~![X: $i] : ((~sorti1(X)) | (h(op1(j(U!0), X)) = op2(h(j(U!0)), h(X))))) | (~sorti1(j(V!1))) | (h(op1(j(U!0), j(V!1))) = op2(h(j(U!0)), h(j(V!1)))))),
% 0.20/0.40      inference(rewrite,[status(thm)],[])).
% 0.20/0.40  tff(110,plain,
% 0.20/0.40      ((~![X: $i] : ((~sorti1(X)) | (h(op1(j(U!0), X)) = op2(h(j(U!0)), h(X))))) | ((~sorti1(j(V!1))) | (h(op1(j(U!0), j(V!1))) = op2(h(j(U!0)), h(j(V!1)))))),
% 0.20/0.40      inference(quant_inst,[status(thm)],[])).
% 0.20/0.40  tff(111,plain,
% 0.20/0.40      ((~![X: $i] : ((~sorti1(X)) | (h(op1(j(U!0), X)) = op2(h(j(U!0)), h(X))))) | (~sorti1(j(V!1))) | (h(op1(j(U!0), j(V!1))) = op2(h(j(U!0)), h(j(V!1))))),
% 0.20/0.40      inference(modus_ponens,[status(thm)],[110, 109])).
% 0.20/0.40  tff(112,plain,
% 0.20/0.40      (h(op1(j(U!0), j(V!1))) = op2(h(j(U!0)), h(j(V!1)))),
% 0.20/0.40      inference(unit_resolution,[status(thm)],[111, 63, 103])).
% 0.20/0.40  tff(113,plain,
% 0.20/0.40      (op2(h(j(U!0)), h(j(V!1))) = h(op1(j(U!0), j(V!1)))),
% 0.20/0.40      inference(symmetry,[status(thm)],[112])).
% 0.20/0.40  tff(114,plain,
% 0.20/0.40      (((~![X1: $i] : ((~sorti2(X1)) | (h(j(X1)) = X1))) | ((~sorti2(U!0)) | (h(j(U!0)) = U!0))) <=> ((~![X1: $i] : ((~sorti2(X1)) | (h(j(X1)) = X1))) | (~sorti2(U!0)) | (h(j(U!0)) = U!0))),
% 0.20/0.40      inference(rewrite,[status(thm)],[])).
% 0.20/0.40  tff(115,plain,
% 0.20/0.40      ((~![X1: $i] : ((~sorti2(X1)) | (h(j(X1)) = X1))) | ((~sorti2(U!0)) | (h(j(U!0)) = U!0))),
% 0.20/0.40      inference(quant_inst,[status(thm)],[])).
% 0.20/0.40  tff(116,plain,
% 0.20/0.40      ((~![X1: $i] : ((~sorti2(X1)) | (h(j(X1)) = X1))) | (~sorti2(U!0)) | (h(j(U!0)) = U!0)),
% 0.20/0.40      inference(modus_ponens,[status(thm)],[115, 114])).
% 0.20/0.40  tff(117,plain,
% 0.20/0.40      (h(j(U!0)) = U!0),
% 0.20/0.40      inference(unit_resolution,[status(thm)],[116, 38, 11])).
% 0.20/0.40  tff(118,plain,
% 0.20/0.40      (op2(h(j(U!0)), h(j(V!1))) = op2(U!0, V!1)),
% 0.20/0.40      inference(monotonicity,[status(thm)],[117, 29])).
% 0.20/0.40  tff(119,plain,
% 0.20/0.40      (op2(U!0, V!1) = op2(h(j(U!0)), h(j(V!1)))),
% 0.20/0.40      inference(symmetry,[status(thm)],[118])).
% 0.20/0.40  tff(120,plain,
% 0.20/0.40      (op2(U!0, V!1) = h(op1(j(U!0), j(V!1)))),
% 0.20/0.40      inference(transitivity,[status(thm)],[119, 113])).
% 0.20/0.40  tff(121,plain,
% 0.20/0.40      (U!0 = h(j(U!0))),
% 0.20/0.40      inference(symmetry,[status(thm)],[117])).
% 0.20/0.40  tff(122,plain,
% 0.20/0.40      (op2(U!0, op2(U!0, V!1)) = op2(h(j(U!0)), h(op1(j(U!0), j(V!1))))),
% 0.20/0.40      inference(monotonicity,[status(thm)],[121, 120])).
% 0.20/0.40  tff(123,plain,
% 0.20/0.40      (op2(U!0, op2(U!0, V!1)) = V!1),
% 0.20/0.40      inference(transitivity,[status(thm)],[122, 108, 68, 29])).
% 0.20/0.40  tff(124,plain,
% 0.20/0.40      (~(op2(U!0, op2(U!0, V!1)) = V!1)),
% 0.20/0.40      inference(or_elim,[status(thm)],[24])).
% 0.20/0.40  tff(125,plain,
% 0.20/0.40      ($false),
% 0.20/0.40      inference(unit_resolution,[status(thm)],[124, 123])).
% 0.20/0.40  % SZS output end Proof
%------------------------------------------------------------------------------