TSTP Solution File: SWV151+1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SWV151+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n018.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 : Thu Sep 29 15:10:09 EDT 2022
% Result : Theorem 0.19s 0.43s
% Output : Proof 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV151+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.07/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.34 % Computer : n018.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun Sep 4 01:40:45 EDT 2022
% 0.13/0.34 % 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.19/0.43 % SZS status Theorem
% 0.19/0.43 % SZS output start Proof
% 0.19/0.43 tff(gt_type, type, (
% 0.19/0.43 gt: ( $i * $i ) > $o)).
% 0.19/0.43 tff(succ_type, type, (
% 0.19/0.43 succ: $i > $i)).
% 0.19/0.43 tff(tptp_minus_1_type, type, (
% 0.19/0.43 tptp_minus_1: $i)).
% 0.19/0.43 tff(leq_type, type, (
% 0.19/0.43 leq: ( $i * $i ) > $o)).
% 0.19/0.43 tff(tptp_fun_A_13_type, type, (
% 0.19/0.43 tptp_fun_A_13: $i)).
% 0.19/0.43 tff(sum_type, type, (
% 0.19/0.43 sum: ( $i * $i * $i ) > $i)).
% 0.19/0.43 tff(a_select3_type, type, (
% 0.19/0.43 a_select3: ( $i * $i * $i ) > $i)).
% 0.19/0.43 tff(tptp_sum_index_type, type, (
% 0.19/0.43 tptp_sum_index: $i)).
% 0.19/0.43 tff(q_type, type, (
% 0.19/0.43 q: $i)).
% 0.19/0.43 tff(n1_type, type, (
% 0.19/0.43 n1: $i)).
% 0.19/0.43 tff(n4_type, type, (
% 0.19/0.43 n4: $i)).
% 0.19/0.43 tff(n0_type, type, (
% 0.19/0.43 n0: $i)).
% 0.19/0.43 tff(1,plain,
% 0.19/0.43 (^[X: $i, Y: $i] : refl((leq(X, Y) <=> gt(succ(Y), X)) <=> (leq(X, Y) <=> gt(succ(Y), X)))),
% 0.19/0.43 inference(bind,[status(th)],[])).
% 0.19/0.43 tff(2,plain,
% 0.19/0.43 (![X: $i, Y: $i] : (leq(X, Y) <=> gt(succ(Y), X)) <=> ![X: $i, Y: $i] : (leq(X, Y) <=> gt(succ(Y), X))),
% 0.19/0.43 inference(quant_intro,[status(thm)],[1])).
% 0.19/0.43 tff(3,plain,
% 0.19/0.43 (![X: $i, Y: $i] : (leq(X, Y) <=> gt(succ(Y), X)) <=> ![X: $i, Y: $i] : (leq(X, Y) <=> gt(succ(Y), X))),
% 0.19/0.43 inference(rewrite,[status(thm)],[])).
% 0.19/0.43 tff(4,axiom,(![X: $i, Y: $i] : (leq(X, Y) <=> gt(succ(Y), X))), file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax','leq_succ_gt_equiv')).
% 0.19/0.43 tff(5,plain,
% 0.19/0.43 (![X: $i, Y: $i] : (leq(X, Y) <=> gt(succ(Y), X))),
% 0.19/0.43 inference(modus_ponens,[status(thm)],[4, 3])).
% 0.19/0.43 tff(6,plain,(
% 0.19/0.43 ![X: $i, Y: $i] : (leq(X, Y) <=> gt(succ(Y), X))),
% 0.19/0.43 inference(skolemize,[status(sab)],[5])).
% 0.19/0.43 tff(7,plain,
% 0.19/0.43 (![X: $i, Y: $i] : (leq(X, Y) <=> gt(succ(Y), X))),
% 0.19/0.43 inference(modus_ponens,[status(thm)],[6, 2])).
% 0.19/0.43 tff(8,plain,
% 0.19/0.43 ((~![X: $i, Y: $i] : (leq(X, Y) <=> gt(succ(Y), X))) | (leq(succ(tptp_minus_1), tptp_minus_1) <=> gt(succ(tptp_minus_1), succ(tptp_minus_1)))),
% 0.19/0.43 inference(quant_inst,[status(thm)],[])).
% 0.19/0.43 tff(9,plain,
% 0.19/0.43 (leq(succ(tptp_minus_1), tptp_minus_1) <=> gt(succ(tptp_minus_1), succ(tptp_minus_1))),
% 0.19/0.43 inference(unit_resolution,[status(thm)],[8, 7])).
% 0.19/0.43 tff(10,plain,
% 0.19/0.43 ((~![A: $i] : ((~(leq(succ(tptp_minus_1), A) & leq(A, tptp_minus_1))) | (sum(succ(tptp_minus_1), succ(succ(succ(succ(succ(tptp_minus_1))))), a_select3(q, A, tptp_sum_index)) = succ(succ(tptp_minus_1))))) <=> (~![A: $i] : ((~(leq(succ(tptp_minus_1), A) & leq(A, tptp_minus_1))) | (sum(succ(tptp_minus_1), succ(succ(succ(succ(succ(tptp_minus_1))))), a_select3(q, A, tptp_sum_index)) = succ(succ(tptp_minus_1)))))),
% 0.19/0.43 inference(rewrite,[status(thm)],[])).
% 0.19/0.43 tff(11,plain,
% 0.19/0.43 ((~![A: $i] : ((~(leq(n0, A) & leq(A, tptp_minus_1))) | (sum(n0, n4, a_select3(q, A, tptp_sum_index)) = n1))) <=> (~![A: $i] : ((~(leq(succ(tptp_minus_1), A) & leq(A, tptp_minus_1))) | (sum(succ(tptp_minus_1), succ(succ(succ(succ(succ(tptp_minus_1))))), a_select3(q, A, tptp_sum_index)) = succ(succ(tptp_minus_1)))))),
% 0.19/0.43 inference(rewrite,[status(thm)],[])).
% 0.19/0.43 tff(12,plain,
% 0.19/0.43 ((~![A: $i] : ((~(leq(n0, A) & leq(A, tptp_minus_1))) | (sum(n0, n4, a_select3(q, A, tptp_sum_index)) = n1))) <=> (~![A: $i] : ((~(leq(n0, A) & leq(A, tptp_minus_1))) | (sum(n0, n4, a_select3(q, A, tptp_sum_index)) = n1)))),
% 0.19/0.43 inference(rewrite,[status(thm)],[])).
% 0.19/0.43 tff(13,plain,
% 0.19/0.43 ((~![A: $i] : ((leq(n0, A) & leq(A, tptp_minus_1)) => (sum(n0, n4, a_select3(q, A, tptp_sum_index)) = n1))) <=> (~![A: $i] : ((~(leq(n0, A) & leq(A, tptp_minus_1))) | (sum(n0, n4, a_select3(q, A, tptp_sum_index)) = n1)))),
% 0.19/0.43 inference(rewrite,[status(thm)],[])).
% 0.19/0.43 tff(14,axiom,(~![A: $i] : ((leq(n0, A) & leq(A, tptp_minus_1)) => (sum(n0, n4, a_select3(q, A, tptp_sum_index)) = n1))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','cl5_nebula_norm_0001')).
% 0.19/0.43 tff(15,plain,
% 0.19/0.43 (~![A: $i] : ((~(leq(n0, A) & leq(A, tptp_minus_1))) | (sum(n0, n4, a_select3(q, A, tptp_sum_index)) = n1))),
% 0.19/0.43 inference(modus_ponens,[status(thm)],[14, 13])).
% 0.19/0.43 tff(16,plain,
% 0.19/0.43 (~![A: $i] : ((~(leq(n0, A) & leq(A, tptp_minus_1))) | (sum(n0, n4, a_select3(q, A, tptp_sum_index)) = n1))),
% 0.19/0.43 inference(modus_ponens,[status(thm)],[15, 12])).
% 0.19/0.43 tff(17,plain,
% 0.19/0.43 (~![A: $i] : ((~(leq(n0, A) & leq(A, tptp_minus_1))) | (sum(n0, n4, a_select3(q, A, tptp_sum_index)) = n1))),
% 0.19/0.43 inference(modus_ponens,[status(thm)],[16, 12])).
% 0.19/0.44 tff(18,plain,
% 0.19/0.44 (~![A: $i] : ((~(leq(n0, A) & leq(A, tptp_minus_1))) | (sum(n0, n4, a_select3(q, A, tptp_sum_index)) = n1))),
% 0.19/0.44 inference(modus_ponens,[status(thm)],[17, 12])).
% 0.19/0.44 tff(19,plain,
% 0.19/0.44 (~![A: $i] : ((~(leq(succ(tptp_minus_1), A) & leq(A, tptp_minus_1))) | (sum(succ(tptp_minus_1), succ(succ(succ(succ(succ(tptp_minus_1))))), a_select3(q, A, tptp_sum_index)) = succ(succ(tptp_minus_1))))),
% 0.19/0.44 inference(modus_ponens,[status(thm)],[18, 11])).
% 0.19/0.44 tff(20,plain,
% 0.19/0.44 (~![A: $i] : ((~(leq(succ(tptp_minus_1), A) & leq(A, tptp_minus_1))) | (sum(succ(tptp_minus_1), succ(succ(succ(succ(succ(tptp_minus_1))))), a_select3(q, A, tptp_sum_index)) = succ(succ(tptp_minus_1))))),
% 0.19/0.44 inference(modus_ponens,[status(thm)],[19, 10])).
% 0.19/0.44 tff(21,plain,
% 0.19/0.44 (~![A: $i] : ((~(leq(succ(tptp_minus_1), A) & leq(A, tptp_minus_1))) | (sum(succ(tptp_minus_1), succ(succ(succ(succ(succ(tptp_minus_1))))), a_select3(q, A, tptp_sum_index)) = succ(succ(tptp_minus_1))))),
% 0.19/0.44 inference(modus_ponens,[status(thm)],[20, 10])).
% 0.19/0.44 tff(22,plain,
% 0.19/0.44 (~![A: $i] : ((~(leq(succ(tptp_minus_1), A) & leq(A, tptp_minus_1))) | (sum(succ(tptp_minus_1), succ(succ(succ(succ(succ(tptp_minus_1))))), a_select3(q, A, tptp_sum_index)) = succ(succ(tptp_minus_1))))),
% 0.19/0.44 inference(modus_ponens,[status(thm)],[21, 10])).
% 0.19/0.44 tff(23,plain,(
% 0.19/0.44 ~((~(leq(succ(tptp_minus_1), A!13) & leq(A!13, tptp_minus_1))) | (sum(succ(tptp_minus_1), succ(succ(succ(succ(succ(tptp_minus_1))))), a_select3(q, A!13, tptp_sum_index)) = succ(succ(tptp_minus_1))))),
% 0.19/0.44 inference(skolemize,[status(sab)],[22])).
% 0.19/0.44 tff(24,plain,
% 0.19/0.44 (leq(succ(tptp_minus_1), A!13) & leq(A!13, tptp_minus_1)),
% 0.19/0.44 inference(or_elim,[status(thm)],[23])).
% 0.19/0.44 tff(25,plain,
% 0.19/0.44 (leq(A!13, tptp_minus_1)),
% 0.19/0.44 inference(and_elim,[status(thm)],[24])).
% 0.19/0.44 tff(26,plain,
% 0.19/0.44 (leq(succ(tptp_minus_1), A!13)),
% 0.19/0.44 inference(and_elim,[status(thm)],[24])).
% 0.19/0.44 tff(27,plain,
% 0.19/0.44 (![X: $i, Y: $i, Z: $i] : (leq(X, Z) | (~leq(Y, Z)) | (~leq(X, Y))) <=> ![X: $i, Y: $i, Z: $i] : (leq(X, Z) | (~leq(Y, Z)) | (~leq(X, Y)))),
% 0.19/0.44 inference(rewrite,[status(thm)],[])).
% 0.19/0.44 tff(28,plain,
% 0.19/0.44 (^[X: $i, Y: $i, Z: $i] : trans(monotonicity(trans(monotonicity(rewrite((leq(X, Y) & leq(Y, Z)) <=> (~((~leq(Y, Z)) | (~leq(X, Y))))), ((~(leq(X, Y) & leq(Y, Z))) <=> (~(~((~leq(Y, Z)) | (~leq(X, Y))))))), rewrite((~(~((~leq(Y, Z)) | (~leq(X, Y))))) <=> ((~leq(Y, Z)) | (~leq(X, Y)))), ((~(leq(X, Y) & leq(Y, Z))) <=> ((~leq(Y, Z)) | (~leq(X, Y))))), (((~(leq(X, Y) & leq(Y, Z))) | leq(X, Z)) <=> (((~leq(Y, Z)) | (~leq(X, Y))) | leq(X, Z)))), rewrite((((~leq(Y, Z)) | (~leq(X, Y))) | leq(X, Z)) <=> (leq(X, Z) | (~leq(Y, Z)) | (~leq(X, Y)))), (((~(leq(X, Y) & leq(Y, Z))) | leq(X, Z)) <=> (leq(X, Z) | (~leq(Y, Z)) | (~leq(X, Y)))))),
% 0.19/0.44 inference(bind,[status(th)],[])).
% 0.19/0.44 tff(29,plain,
% 0.19/0.44 (![X: $i, Y: $i, Z: $i] : ((~(leq(X, Y) & leq(Y, Z))) | leq(X, Z)) <=> ![X: $i, Y: $i, Z: $i] : (leq(X, Z) | (~leq(Y, Z)) | (~leq(X, Y)))),
% 0.19/0.44 inference(quant_intro,[status(thm)],[28])).
% 0.19/0.44 tff(30,plain,
% 0.19/0.44 (![X: $i, Y: $i, Z: $i] : ((~(leq(X, Y) & leq(Y, Z))) | leq(X, Z)) <=> ![X: $i, Y: $i, Z: $i] : ((~(leq(X, Y) & leq(Y, Z))) | leq(X, Z))),
% 0.19/0.44 inference(rewrite,[status(thm)],[])).
% 0.19/0.44 tff(31,plain,
% 0.19/0.44 (^[X: $i, Y: $i, Z: $i] : rewrite(((leq(X, Y) & leq(Y, Z)) => leq(X, Z)) <=> ((~(leq(X, Y) & leq(Y, Z))) | leq(X, Z)))),
% 0.19/0.44 inference(bind,[status(th)],[])).
% 0.19/0.44 tff(32,plain,
% 0.19/0.44 (![X: $i, Y: $i, Z: $i] : ((leq(X, Y) & leq(Y, Z)) => leq(X, Z)) <=> ![X: $i, Y: $i, Z: $i] : ((~(leq(X, Y) & leq(Y, Z))) | leq(X, Z))),
% 0.19/0.44 inference(quant_intro,[status(thm)],[31])).
% 0.19/0.44 tff(33,axiom,(![X: $i, Y: $i, Z: $i] : ((leq(X, Y) & leq(Y, Z)) => leq(X, Z))), file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax','transitivity_leq')).
% 0.19/0.44 tff(34,plain,
% 0.19/0.44 (![X: $i, Y: $i, Z: $i] : ((~(leq(X, Y) & leq(Y, Z))) | leq(X, Z))),
% 0.19/0.44 inference(modus_ponens,[status(thm)],[33, 32])).
% 0.19/0.44 tff(35,plain,
% 0.19/0.44 (![X: $i, Y: $i, Z: $i] : ((~(leq(X, Y) & leq(Y, Z))) | leq(X, Z))),
% 0.19/0.44 inference(modus_ponens,[status(thm)],[34, 30])).
% 0.19/0.44 tff(36,plain,(
% 0.19/0.44 ![X: $i, Y: $i, Z: $i] : ((~(leq(X, Y) & leq(Y, Z))) | leq(X, Z))),
% 0.19/0.44 inference(skolemize,[status(sab)],[35])).
% 0.19/0.45 tff(37,plain,
% 0.19/0.45 (![X: $i, Y: $i, Z: $i] : (leq(X, Z) | (~leq(Y, Z)) | (~leq(X, Y)))),
% 0.19/0.45 inference(modus_ponens,[status(thm)],[36, 29])).
% 0.19/0.45 tff(38,plain,
% 0.19/0.45 (![X: $i, Y: $i, Z: $i] : (leq(X, Z) | (~leq(Y, Z)) | (~leq(X, Y)))),
% 0.19/0.45 inference(modus_ponens,[status(thm)],[37, 27])).
% 0.19/0.45 tff(39,plain,
% 0.19/0.45 (((~![X: $i, Y: $i, Z: $i] : (leq(X, Z) | (~leq(Y, Z)) | (~leq(X, Y)))) | ((~leq(succ(tptp_minus_1), A!13)) | leq(succ(tptp_minus_1), tptp_minus_1) | (~leq(A!13, tptp_minus_1)))) <=> ((~![X: $i, Y: $i, Z: $i] : (leq(X, Z) | (~leq(Y, Z)) | (~leq(X, Y)))) | (~leq(succ(tptp_minus_1), A!13)) | leq(succ(tptp_minus_1), tptp_minus_1) | (~leq(A!13, tptp_minus_1)))),
% 0.19/0.45 inference(rewrite,[status(thm)],[])).
% 0.19/0.45 tff(40,plain,
% 0.19/0.45 ((leq(succ(tptp_minus_1), tptp_minus_1) | (~leq(A!13, tptp_minus_1)) | (~leq(succ(tptp_minus_1), A!13))) <=> ((~leq(succ(tptp_minus_1), A!13)) | leq(succ(tptp_minus_1), tptp_minus_1) | (~leq(A!13, tptp_minus_1)))),
% 0.19/0.45 inference(rewrite,[status(thm)],[])).
% 0.19/0.45 tff(41,plain,
% 0.19/0.45 (((~![X: $i, Y: $i, Z: $i] : (leq(X, Z) | (~leq(Y, Z)) | (~leq(X, Y)))) | (leq(succ(tptp_minus_1), tptp_minus_1) | (~leq(A!13, tptp_minus_1)) | (~leq(succ(tptp_minus_1), A!13)))) <=> ((~![X: $i, Y: $i, Z: $i] : (leq(X, Z) | (~leq(Y, Z)) | (~leq(X, Y)))) | ((~leq(succ(tptp_minus_1), A!13)) | leq(succ(tptp_minus_1), tptp_minus_1) | (~leq(A!13, tptp_minus_1))))),
% 0.19/0.45 inference(monotonicity,[status(thm)],[40])).
% 0.19/0.45 tff(42,plain,
% 0.19/0.45 (((~![X: $i, Y: $i, Z: $i] : (leq(X, Z) | (~leq(Y, Z)) | (~leq(X, Y)))) | (leq(succ(tptp_minus_1), tptp_minus_1) | (~leq(A!13, tptp_minus_1)) | (~leq(succ(tptp_minus_1), A!13)))) <=> ((~![X: $i, Y: $i, Z: $i] : (leq(X, Z) | (~leq(Y, Z)) | (~leq(X, Y)))) | (~leq(succ(tptp_minus_1), A!13)) | leq(succ(tptp_minus_1), tptp_minus_1) | (~leq(A!13, tptp_minus_1)))),
% 0.19/0.45 inference(transitivity,[status(thm)],[41, 39])).
% 0.19/0.45 tff(43,plain,
% 0.19/0.45 ((~![X: $i, Y: $i, Z: $i] : (leq(X, Z) | (~leq(Y, Z)) | (~leq(X, Y)))) | (leq(succ(tptp_minus_1), tptp_minus_1) | (~leq(A!13, tptp_minus_1)) | (~leq(succ(tptp_minus_1), A!13)))),
% 0.19/0.45 inference(quant_inst,[status(thm)],[])).
% 0.19/0.45 tff(44,plain,
% 0.19/0.45 ((~![X: $i, Y: $i, Z: $i] : (leq(X, Z) | (~leq(Y, Z)) | (~leq(X, Y)))) | (~leq(succ(tptp_minus_1), A!13)) | leq(succ(tptp_minus_1), tptp_minus_1) | (~leq(A!13, tptp_minus_1))),
% 0.19/0.45 inference(modus_ponens,[status(thm)],[43, 42])).
% 0.19/0.45 tff(45,plain,
% 0.19/0.45 (leq(succ(tptp_minus_1), tptp_minus_1)),
% 0.19/0.45 inference(unit_resolution,[status(thm)],[44, 38, 26, 25])).
% 0.19/0.45 tff(46,plain,
% 0.19/0.45 ((~(leq(succ(tptp_minus_1), tptp_minus_1) <=> gt(succ(tptp_minus_1), succ(tptp_minus_1)))) | (~leq(succ(tptp_minus_1), tptp_minus_1)) | gt(succ(tptp_minus_1), succ(tptp_minus_1))),
% 0.19/0.45 inference(tautology,[status(thm)],[])).
% 0.19/0.45 tff(47,plain,
% 0.19/0.45 ((~(leq(succ(tptp_minus_1), tptp_minus_1) <=> gt(succ(tptp_minus_1), succ(tptp_minus_1)))) | gt(succ(tptp_minus_1), succ(tptp_minus_1))),
% 0.19/0.45 inference(unit_resolution,[status(thm)],[46, 45])).
% 0.19/0.45 tff(48,plain,
% 0.19/0.45 (gt(succ(tptp_minus_1), succ(tptp_minus_1))),
% 0.19/0.45 inference(unit_resolution,[status(thm)],[47, 9])).
% 0.19/0.45 tff(49,plain,
% 0.19/0.45 (^[X: $i] : refl((~gt(X, X)) <=> (~gt(X, X)))),
% 0.19/0.45 inference(bind,[status(th)],[])).
% 0.19/0.45 tff(50,plain,
% 0.19/0.45 (![X: $i] : (~gt(X, X)) <=> ![X: $i] : (~gt(X, X))),
% 0.19/0.45 inference(quant_intro,[status(thm)],[49])).
% 0.19/0.45 tff(51,plain,
% 0.19/0.45 (![X: $i] : (~gt(X, X)) <=> ![X: $i] : (~gt(X, X))),
% 0.19/0.45 inference(rewrite,[status(thm)],[])).
% 0.19/0.45 tff(52,axiom,(![X: $i] : (~gt(X, X))), file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax','irreflexivity_gt')).
% 0.19/0.45 tff(53,plain,
% 0.19/0.45 (![X: $i] : (~gt(X, X))),
% 0.19/0.45 inference(modus_ponens,[status(thm)],[52, 51])).
% 0.19/0.45 tff(54,plain,(
% 0.19/0.45 ![X: $i] : (~gt(X, X))),
% 0.19/0.45 inference(skolemize,[status(sab)],[53])).
% 0.19/0.45 tff(55,plain,
% 0.19/0.45 (![X: $i] : (~gt(X, X))),
% 0.19/0.45 inference(modus_ponens,[status(thm)],[54, 50])).
% 0.19/0.45 tff(56,plain,
% 0.19/0.45 ((~![X: $i] : (~gt(X, X))) | (~gt(succ(tptp_minus_1), succ(tptp_minus_1)))),
% 0.19/0.45 inference(quant_inst,[status(thm)],[])).
% 0.19/0.45 tff(57,plain,
% 0.19/0.45 ($false),
% 0.19/0.45 inference(unit_resolution,[status(thm)],[56, 55, 48])).
% 0.19/0.45 % SZS output end Proof
%------------------------------------------------------------------------------