TSTP Solution File: SWV486+3 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SWV486+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n002.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:17:47 EDT 2022
% Result : Theorem 0.20s 0.50s
% Output : Proof 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV486+3 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.34 % Computer : n002.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 04:10:17 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.20/0.50 % SZS status Theorem
% 0.20/0.50 % SZS output start Proof
% 0.20/0.50 tff(int_less_type, type, (
% 0.20/0.50 int_less: ( $i * $i ) > $o)).
% 0.20/0.50 tff(n_type, type, (
% 0.20/0.50 n: $i)).
% 0.20/0.50 tff(tptp_fun_I_2_type, type, (
% 0.20/0.50 tptp_fun_I_2: $i)).
% 0.20/0.50 tff(int_leq_type, type, (
% 0.20/0.50 int_leq: ( $i * $i ) > $o)).
% 0.20/0.50 tff(int_one_type, type, (
% 0.20/0.50 int_one: $i)).
% 0.20/0.50 tff(real_zero_type, type, (
% 0.20/0.50 real_zero: $i)).
% 0.20/0.50 tff(a_type, type, (
% 0.20/0.50 a: ( $i * $i ) > $i)).
% 0.20/0.50 tff(plus_type, type, (
% 0.20/0.50 plus: ( $i * $i ) > $i)).
% 0.20/0.50 tff(tptp_fun_K_0_type, type, (
% 0.20/0.50 tptp_fun_K_0: ( $i * $i ) > $i)).
% 0.20/0.50 tff(int_zero_type, type, (
% 0.20/0.50 int_zero: $i)).
% 0.20/0.50 tff(tptp_fun_J_1_type, type, (
% 0.20/0.50 tptp_fun_J_1: $i)).
% 0.20/0.50 tff(real_one_type, type, (
% 0.20/0.50 real_one: $i)).
% 0.20/0.50 tff(1,plain,
% 0.20/0.50 (^[I: $i, J: $i] : refl((int_leq(I, J) <=> ((I = J) | int_less(I, J))) <=> (int_leq(I, J) <=> ((I = J) | int_less(I, J))))),
% 0.20/0.50 inference(bind,[status(th)],[])).
% 0.20/0.50 tff(2,plain,
% 0.20/0.50 (![I: $i, J: $i] : (int_leq(I, J) <=> ((I = J) | int_less(I, J))) <=> ![I: $i, J: $i] : (int_leq(I, J) <=> ((I = J) | int_less(I, J)))),
% 0.20/0.50 inference(quant_intro,[status(thm)],[1])).
% 0.20/0.50 tff(3,plain,
% 0.20/0.50 (![I: $i, J: $i] : (int_leq(I, J) <=> ((I = J) | int_less(I, J))) <=> ![I: $i, J: $i] : (int_leq(I, J) <=> ((I = J) | int_less(I, J)))),
% 0.20/0.50 inference(rewrite,[status(thm)],[])).
% 0.20/0.50 tff(4,plain,
% 0.20/0.50 (^[I: $i, J: $i] : rewrite((int_leq(I, J) <=> (int_less(I, J) | (I = J))) <=> (int_leq(I, J) <=> ((I = J) | int_less(I, J))))),
% 0.20/0.50 inference(bind,[status(th)],[])).
% 0.20/0.50 tff(5,plain,
% 0.20/0.50 (![I: $i, J: $i] : (int_leq(I, J) <=> (int_less(I, J) | (I = J))) <=> ![I: $i, J: $i] : (int_leq(I, J) <=> ((I = J) | int_less(I, J)))),
% 0.20/0.50 inference(quant_intro,[status(thm)],[4])).
% 0.20/0.50 tff(6,axiom,(![I: $i, J: $i] : (int_leq(I, J) <=> (int_less(I, J) | (I = J)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','int_leq')).
% 0.20/0.50 tff(7,plain,
% 0.20/0.50 (![I: $i, J: $i] : (int_leq(I, J) <=> ((I = J) | int_less(I, J)))),
% 0.20/0.50 inference(modus_ponens,[status(thm)],[6, 5])).
% 0.20/0.50 tff(8,plain,
% 0.20/0.50 (![I: $i, J: $i] : (int_leq(I, J) <=> ((I = J) | int_less(I, J)))),
% 0.20/0.50 inference(modus_ponens,[status(thm)],[7, 3])).
% 0.20/0.50 tff(9,plain,(
% 0.20/0.50 ![I: $i, J: $i] : (int_leq(I, J) <=> ((I = J) | int_less(I, J)))),
% 0.20/0.50 inference(skolemize,[status(sab)],[8])).
% 0.20/0.50 tff(10,plain,
% 0.20/0.50 (![I: $i, J: $i] : (int_leq(I, J) <=> ((I = J) | int_less(I, J)))),
% 0.20/0.50 inference(modus_ponens,[status(thm)],[9, 2])).
% 0.20/0.50 tff(11,plain,
% 0.20/0.50 ((~![I: $i, J: $i] : (int_leq(I, J) <=> ((I = J) | int_less(I, J)))) | (int_leq(I!2, n) <=> ((I!2 = n) | int_less(I!2, n)))),
% 0.20/0.50 inference(quant_inst,[status(thm)],[])).
% 0.20/0.50 tff(12,plain,
% 0.20/0.50 (int_leq(I!2, n) <=> ((I!2 = n) | int_less(I!2, n))),
% 0.20/0.50 inference(unit_resolution,[status(thm)],[11, 10])).
% 0.20/0.50 tff(13,plain,
% 0.20/0.50 (^[I: $i, J: $i] : refl((~((~((~int_less(I, J)) | (~((~(plus(I, tptp_fun_K_0(J, I)) = J)) | (~int_less(int_zero, tptp_fun_K_0(J, I))))))) | (~(int_less(I, J) | ![K: $i] : ((~(plus(I, K) = J)) | (~int_less(int_zero, K))))))) <=> (~((~((~int_less(I, J)) | (~((~(plus(I, tptp_fun_K_0(J, I)) = J)) | (~int_less(int_zero, tptp_fun_K_0(J, I))))))) | (~(int_less(I, J) | ![K: $i] : ((~(plus(I, K) = J)) | (~int_less(int_zero, K))))))))),
% 0.20/0.50 inference(bind,[status(th)],[])).
% 0.20/0.50 tff(14,plain,
% 0.20/0.50 (![I: $i, J: $i] : (~((~((~int_less(I, J)) | (~((~(plus(I, tptp_fun_K_0(J, I)) = J)) | (~int_less(int_zero, tptp_fun_K_0(J, I))))))) | (~(int_less(I, J) | ![K: $i] : ((~(plus(I, K) = J)) | (~int_less(int_zero, K))))))) <=> ![I: $i, J: $i] : (~((~((~int_less(I, J)) | (~((~(plus(I, tptp_fun_K_0(J, I)) = J)) | (~int_less(int_zero, tptp_fun_K_0(J, I))))))) | (~(int_less(I, J) | ![K: $i] : ((~(plus(I, K) = J)) | (~int_less(int_zero, K)))))))),
% 0.20/0.50 inference(quant_intro,[status(thm)],[13])).
% 0.20/0.50 tff(15,plain,
% 0.20/0.50 (^[I: $i, J: $i] : rewrite((~((~((~int_less(I, J)) | (~((~(plus(I, tptp_fun_K_0(J, I)) = J)) | (~int_less(int_zero, tptp_fun_K_0(J, I))))))) | (~(int_less(I, J) | ![K: $i] : ((~(plus(I, K) = J)) | (~int_less(int_zero, K))))))) <=> (~((~((~int_less(I, J)) | (~((~(plus(I, tptp_fun_K_0(J, I)) = J)) | (~int_less(int_zero, tptp_fun_K_0(J, I))))))) | (~(int_less(I, J) | ![K: $i] : ((~(plus(I, K) = J)) | (~int_less(int_zero, K))))))))),
% 0.20/0.50 inference(bind,[status(th)],[])).
% 0.20/0.50 tff(16,plain,
% 0.20/0.50 (![I: $i, J: $i] : (~((~((~int_less(I, J)) | (~((~(plus(I, tptp_fun_K_0(J, I)) = J)) | (~int_less(int_zero, tptp_fun_K_0(J, I))))))) | (~(int_less(I, J) | ![K: $i] : ((~(plus(I, K) = J)) | (~int_less(int_zero, K))))))) <=> ![I: $i, J: $i] : (~((~((~int_less(I, J)) | (~((~(plus(I, tptp_fun_K_0(J, I)) = J)) | (~int_less(int_zero, tptp_fun_K_0(J, I))))))) | (~(int_less(I, J) | ![K: $i] : ((~(plus(I, K) = J)) | (~int_less(int_zero, K)))))))),
% 0.20/0.50 inference(quant_intro,[status(thm)],[15])).
% 0.20/0.50 tff(17,plain,
% 0.20/0.50 (![I: $i, J: $i] : (~((~((~int_less(I, J)) | (~((~(plus(I, tptp_fun_K_0(J, I)) = J)) | (~int_less(int_zero, tptp_fun_K_0(J, I))))))) | (~(int_less(I, J) | ![K: $i] : ((~(plus(I, K) = J)) | (~int_less(int_zero, K))))))) <=> ![I: $i, J: $i] : (~((~((~int_less(I, J)) | (~((~(plus(I, tptp_fun_K_0(J, I)) = J)) | (~int_less(int_zero, tptp_fun_K_0(J, I))))))) | (~(int_less(I, J) | ![K: $i] : ((~(plus(I, K) = J)) | (~int_less(int_zero, K)))))))),
% 0.20/0.50 inference(transitivity,[status(thm)],[16, 14])).
% 0.20/0.50 tff(18,plain,
% 0.20/0.50 (^[I: $i, J: $i] : trans(monotonicity(rewrite(((~int_less(I, J)) | ((plus(I, tptp_fun_K_0(J, I)) = J) & int_less(int_zero, tptp_fun_K_0(J, I)))) <=> ((~int_less(I, J)) | (~((~(plus(I, tptp_fun_K_0(J, I)) = J)) | (~int_less(int_zero, tptp_fun_K_0(J, I))))))), rewrite((int_less(I, J) | ![K: $i] : (~((plus(I, K) = J) & int_less(int_zero, K)))) <=> (int_less(I, J) | ![K: $i] : ((~(plus(I, K) = J)) | (~int_less(int_zero, K))))), ((((~int_less(I, J)) | ((plus(I, tptp_fun_K_0(J, I)) = J) & int_less(int_zero, tptp_fun_K_0(J, I)))) & (int_less(I, J) | ![K: $i] : (~((plus(I, K) = J) & int_less(int_zero, K))))) <=> (((~int_less(I, J)) | (~((~(plus(I, tptp_fun_K_0(J, I)) = J)) | (~int_less(int_zero, tptp_fun_K_0(J, I)))))) & (int_less(I, J) | ![K: $i] : ((~(plus(I, K) = J)) | (~int_less(int_zero, K))))))), rewrite((((~int_less(I, J)) | (~((~(plus(I, tptp_fun_K_0(J, I)) = J)) | (~int_less(int_zero, tptp_fun_K_0(J, I)))))) & (int_less(I, J) | ![K: $i] : ((~(plus(I, K) = J)) | (~int_less(int_zero, K))))) <=> (~((~((~int_less(I, J)) | (~((~(plus(I, tptp_fun_K_0(J, I)) = J)) | (~int_less(int_zero, tptp_fun_K_0(J, I))))))) | (~(int_less(I, J) | ![K: $i] : ((~(plus(I, K) = J)) | (~int_less(int_zero, K)))))))), ((((~int_less(I, J)) | ((plus(I, tptp_fun_K_0(J, I)) = J) & int_less(int_zero, tptp_fun_K_0(J, I)))) & (int_less(I, J) | ![K: $i] : (~((plus(I, K) = J) & int_less(int_zero, K))))) <=> (~((~((~int_less(I, J)) | (~((~(plus(I, tptp_fun_K_0(J, I)) = J)) | (~int_less(int_zero, tptp_fun_K_0(J, I))))))) | (~(int_less(I, J) | ![K: $i] : ((~(plus(I, K) = J)) | (~int_less(int_zero, K)))))))))),
% 0.20/0.50 inference(bind,[status(th)],[])).
% 0.20/0.50 tff(19,plain,
% 0.20/0.50 (![I: $i, J: $i] : (((~int_less(I, J)) | ((plus(I, tptp_fun_K_0(J, I)) = J) & int_less(int_zero, tptp_fun_K_0(J, I)))) & (int_less(I, J) | ![K: $i] : (~((plus(I, K) = J) & int_less(int_zero, K))))) <=> ![I: $i, J: $i] : (~((~((~int_less(I, J)) | (~((~(plus(I, tptp_fun_K_0(J, I)) = J)) | (~int_less(int_zero, tptp_fun_K_0(J, I))))))) | (~(int_less(I, J) | ![K: $i] : ((~(plus(I, K) = J)) | (~int_less(int_zero, K)))))))),
% 0.20/0.50 inference(quant_intro,[status(thm)],[18])).
% 0.20/0.50 tff(20,plain,
% 0.20/0.50 (![I: $i, J: $i] : (int_less(I, J) <=> ?[K: $i] : ((plus(I, K) = J) & int_less(int_zero, K))) <=> ![I: $i, J: $i] : (int_less(I, J) <=> ?[K: $i] : ((plus(I, K) = J) & int_less(int_zero, K)))),
% 0.20/0.50 inference(rewrite,[status(thm)],[])).
% 0.20/0.50 tff(21,axiom,(![I: $i, J: $i] : (int_less(I, J) <=> ?[K: $i] : ((plus(I, K) = J) & int_less(int_zero, K)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','plus_and_inverse')).
% 0.20/0.50 tff(22,plain,
% 0.20/0.50 (![I: $i, J: $i] : (int_less(I, J) <=> ?[K: $i] : ((plus(I, K) = J) & int_less(int_zero, K)))),
% 0.20/0.50 inference(modus_ponens,[status(thm)],[21, 20])).
% 0.20/0.50 tff(23,plain,(
% 0.20/0.50 ![I: $i, J: $i] : (((~int_less(I, J)) | ((plus(I, tptp_fun_K_0(J, I)) = J) & int_less(int_zero, tptp_fun_K_0(J, I)))) & (int_less(I, J) | ![K: $i] : (~((plus(I, K) = J) & int_less(int_zero, K)))))),
% 0.20/0.50 inference(skolemize,[status(sab)],[22])).
% 0.20/0.50 tff(24,plain,
% 0.20/0.50 (![I: $i, J: $i] : (~((~((~int_less(I, J)) | (~((~(plus(I, tptp_fun_K_0(J, I)) = J)) | (~int_less(int_zero, tptp_fun_K_0(J, I))))))) | (~(int_less(I, J) | ![K: $i] : ((~(plus(I, K) = J)) | (~int_less(int_zero, K)))))))),
% 0.20/0.51 inference(modus_ponens,[status(thm)],[23, 19])).
% 0.20/0.51 tff(25,plain,
% 0.20/0.51 (![I: $i, J: $i] : (~((~((~int_less(I, J)) | (~((~(plus(I, tptp_fun_K_0(J, I)) = J)) | (~int_less(int_zero, tptp_fun_K_0(J, I))))))) | (~(int_less(I, J) | ![K: $i] : ((~(plus(I, K) = J)) | (~int_less(int_zero, K)))))))),
% 0.20/0.51 inference(modus_ponens,[status(thm)],[24, 17])).
% 0.20/0.51 tff(26,plain,
% 0.20/0.51 (((~![I: $i, J: $i] : (~((~((~int_less(I, J)) | (~((~(plus(I, tptp_fun_K_0(J, I)) = J)) | (~int_less(int_zero, tptp_fun_K_0(J, I))))))) | (~(int_less(I, J) | ![K: $i] : ((~(plus(I, K) = J)) | (~int_less(int_zero, K)))))))) | (~((~((~int_less(I!2, J!1)) | (~((~(plus(I!2, tptp_fun_K_0(J!1, I!2)) = J!1)) | (~int_less(int_zero, tptp_fun_K_0(J!1, I!2))))))) | (~(int_less(I!2, J!1) | ![K: $i] : ((~int_less(int_zero, K)) | (~(plus(I!2, K) = J!1)))))))) <=> ((~![I: $i, J: $i] : (~((~((~int_less(I, J)) | (~((~(plus(I, tptp_fun_K_0(J, I)) = J)) | (~int_less(int_zero, tptp_fun_K_0(J, I))))))) | (~(int_less(I, J) | ![K: $i] : ((~(plus(I, K) = J)) | (~int_less(int_zero, K)))))))) | (~((~((~int_less(I!2, J!1)) | (~((~(plus(I!2, tptp_fun_K_0(J!1, I!2)) = J!1)) | (~int_less(int_zero, tptp_fun_K_0(J!1, I!2))))))) | (~(int_less(I!2, J!1) | ![K: $i] : ((~int_less(int_zero, K)) | (~(plus(I!2, K) = J!1))))))))),
% 0.20/0.51 inference(rewrite,[status(thm)],[])).
% 0.20/0.51 tff(27,plain,
% 0.20/0.51 ((~((~((~int_less(I!2, J!1)) | (~((~(plus(I!2, tptp_fun_K_0(J!1, I!2)) = J!1)) | (~int_less(int_zero, tptp_fun_K_0(J!1, I!2))))))) | (~(int_less(I!2, J!1) | ![K: $i] : ((~(plus(I!2, K) = J!1)) | (~int_less(int_zero, K))))))) <=> (~((~((~int_less(I!2, J!1)) | (~((~(plus(I!2, tptp_fun_K_0(J!1, I!2)) = J!1)) | (~int_less(int_zero, tptp_fun_K_0(J!1, I!2))))))) | (~(int_less(I!2, J!1) | ![K: $i] : ((~int_less(int_zero, K)) | (~(plus(I!2, K) = J!1)))))))),
% 0.20/0.51 inference(rewrite,[status(thm)],[])).
% 0.20/0.51 tff(28,plain,
% 0.20/0.51 (((~![I: $i, J: $i] : (~((~((~int_less(I, J)) | (~((~(plus(I, tptp_fun_K_0(J, I)) = J)) | (~int_less(int_zero, tptp_fun_K_0(J, I))))))) | (~(int_less(I, J) | ![K: $i] : ((~(plus(I, K) = J)) | (~int_less(int_zero, K)))))))) | (~((~((~int_less(I!2, J!1)) | (~((~(plus(I!2, tptp_fun_K_0(J!1, I!2)) = J!1)) | (~int_less(int_zero, tptp_fun_K_0(J!1, I!2))))))) | (~(int_less(I!2, J!1) | ![K: $i] : ((~(plus(I!2, K) = J!1)) | (~int_less(int_zero, K)))))))) <=> ((~![I: $i, J: $i] : (~((~((~int_less(I, J)) | (~((~(plus(I, tptp_fun_K_0(J, I)) = J)) | (~int_less(int_zero, tptp_fun_K_0(J, I))))))) | (~(int_less(I, J) | ![K: $i] : ((~(plus(I, K) = J)) | (~int_less(int_zero, K)))))))) | (~((~((~int_less(I!2, J!1)) | (~((~(plus(I!2, tptp_fun_K_0(J!1, I!2)) = J!1)) | (~int_less(int_zero, tptp_fun_K_0(J!1, I!2))))))) | (~(int_less(I!2, J!1) | ![K: $i] : ((~int_less(int_zero, K)) | (~(plus(I!2, K) = J!1))))))))),
% 0.20/0.51 inference(monotonicity,[status(thm)],[27])).
% 0.20/0.51 tff(29,plain,
% 0.20/0.51 (((~![I: $i, J: $i] : (~((~((~int_less(I, J)) | (~((~(plus(I, tptp_fun_K_0(J, I)) = J)) | (~int_less(int_zero, tptp_fun_K_0(J, I))))))) | (~(int_less(I, J) | ![K: $i] : ((~(plus(I, K) = J)) | (~int_less(int_zero, K)))))))) | (~((~((~int_less(I!2, J!1)) | (~((~(plus(I!2, tptp_fun_K_0(J!1, I!2)) = J!1)) | (~int_less(int_zero, tptp_fun_K_0(J!1, I!2))))))) | (~(int_less(I!2, J!1) | ![K: $i] : ((~(plus(I!2, K) = J!1)) | (~int_less(int_zero, K)))))))) <=> ((~![I: $i, J: $i] : (~((~((~int_less(I, J)) | (~((~(plus(I, tptp_fun_K_0(J, I)) = J)) | (~int_less(int_zero, tptp_fun_K_0(J, I))))))) | (~(int_less(I, J) | ![K: $i] : ((~(plus(I, K) = J)) | (~int_less(int_zero, K)))))))) | (~((~((~int_less(I!2, J!1)) | (~((~(plus(I!2, tptp_fun_K_0(J!1, I!2)) = J!1)) | (~int_less(int_zero, tptp_fun_K_0(J!1, I!2))))))) | (~(int_less(I!2, J!1) | ![K: $i] : ((~int_less(int_zero, K)) | (~(plus(I!2, K) = J!1))))))))),
% 0.20/0.51 inference(transitivity,[status(thm)],[28, 26])).
% 0.20/0.51 tff(30,plain,
% 0.20/0.51 ((~![I: $i, J: $i] : (~((~((~int_less(I, J)) | (~((~(plus(I, tptp_fun_K_0(J, I)) = J)) | (~int_less(int_zero, tptp_fun_K_0(J, I))))))) | (~(int_less(I, J) | ![K: $i] : ((~(plus(I, K) = J)) | (~int_less(int_zero, K)))))))) | (~((~((~int_less(I!2, J!1)) | (~((~(plus(I!2, tptp_fun_K_0(J!1, I!2)) = J!1)) | (~int_less(int_zero, tptp_fun_K_0(J!1, I!2))))))) | (~(int_less(I!2, J!1) | ![K: $i] : ((~(plus(I!2, K) = J!1)) | (~int_less(int_zero, K)))))))),
% 0.20/0.51 inference(quant_inst,[status(thm)],[])).
% 0.20/0.51 tff(31,plain,
% 0.20/0.51 ((~![I: $i, J: $i] : (~((~((~int_less(I, J)) | (~((~(plus(I, tptp_fun_K_0(J, I)) = J)) | (~int_less(int_zero, tptp_fun_K_0(J, I))))))) | (~(int_less(I, J) | ![K: $i] : ((~(plus(I, K) = J)) | (~int_less(int_zero, K)))))))) | (~((~((~int_less(I!2, J!1)) | (~((~(plus(I!2, tptp_fun_K_0(J!1, I!2)) = J!1)) | (~int_less(int_zero, tptp_fun_K_0(J!1, I!2))))))) | (~(int_less(I!2, J!1) | ![K: $i] : ((~int_less(int_zero, K)) | (~(plus(I!2, K) = J!1)))))))),
% 0.20/0.51 inference(modus_ponens,[status(thm)],[30, 29])).
% 0.20/0.51 tff(32,plain,
% 0.20/0.51 (~((~((~int_less(I!2, J!1)) | (~((~(plus(I!2, tptp_fun_K_0(J!1, I!2)) = J!1)) | (~int_less(int_zero, tptp_fun_K_0(J!1, I!2))))))) | (~(int_less(I!2, J!1) | ![K: $i] : ((~int_less(int_zero, K)) | (~(plus(I!2, K) = J!1))))))),
% 0.20/0.51 inference(unit_resolution,[status(thm)],[31, 25])).
% 0.20/0.51 tff(33,plain,
% 0.20/0.51 (((~((~int_less(I!2, J!1)) | (~((~(plus(I!2, tptp_fun_K_0(J!1, I!2)) = J!1)) | (~int_less(int_zero, tptp_fun_K_0(J!1, I!2))))))) | (~(int_less(I!2, J!1) | ![K: $i] : ((~int_less(int_zero, K)) | (~(plus(I!2, K) = J!1)))))) | ((~int_less(I!2, J!1)) | (~((~(plus(I!2, tptp_fun_K_0(J!1, I!2)) = J!1)) | (~int_less(int_zero, tptp_fun_K_0(J!1, I!2))))))),
% 0.20/0.51 inference(tautology,[status(thm)],[])).
% 0.20/0.51 tff(34,plain,
% 0.20/0.51 ((~int_less(I!2, J!1)) | (~((~(plus(I!2, tptp_fun_K_0(J!1, I!2)) = J!1)) | (~int_less(int_zero, tptp_fun_K_0(J!1, I!2)))))),
% 0.20/0.51 inference(unit_resolution,[status(thm)],[33, 32])).
% 0.20/0.51 tff(35,plain,
% 0.20/0.51 ((~![I: $i, J: $i] : ((~(int_leq(int_one, I) & int_less(I, J) & int_leq(J, n))) | (a(I, J) = real_zero))) <=> (~![I: $i, J: $i] : ((~(int_leq(int_one, I) & int_less(I, J) & int_leq(J, n))) | (a(I, J) = real_zero)))),
% 0.20/0.51 inference(rewrite,[status(thm)],[])).
% 0.20/0.51 tff(36,plain,
% 0.20/0.51 ((~![I: $i, J: $i] : (((int_leq(int_one, I) & int_less(I, J)) & int_leq(J, n)) => (a(I, J) = real_zero))) <=> (~![I: $i, J: $i] : ((~(int_leq(int_one, I) & int_less(I, J) & int_leq(J, n))) | (a(I, J) = real_zero)))),
% 0.20/0.51 inference(rewrite,[status(thm)],[])).
% 0.20/0.51 tff(37,axiom,(~![I: $i, J: $i] : (((int_leq(int_one, I) & int_less(I, J)) & int_leq(J, n)) => (a(I, J) = real_zero))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','lt')).
% 0.20/0.51 tff(38,plain,
% 0.20/0.51 (~![I: $i, J: $i] : ((~(int_leq(int_one, I) & int_less(I, J) & int_leq(J, n))) | (a(I, J) = real_zero))),
% 0.20/0.51 inference(modus_ponens,[status(thm)],[37, 36])).
% 0.20/0.51 tff(39,plain,
% 0.20/0.51 (~![I: $i, J: $i] : ((~(int_leq(int_one, I) & int_less(I, J) & int_leq(J, n))) | (a(I, J) = real_zero))),
% 0.20/0.51 inference(modus_ponens,[status(thm)],[38, 35])).
% 0.20/0.51 tff(40,plain,
% 0.20/0.51 (~![I: $i, J: $i] : ((~(int_leq(int_one, I) & int_less(I, J) & int_leq(J, n))) | (a(I, J) = real_zero))),
% 0.20/0.51 inference(modus_ponens,[status(thm)],[39, 35])).
% 0.20/0.51 tff(41,plain,
% 0.20/0.51 (~![I: $i, J: $i] : ((~(int_leq(int_one, I) & int_less(I, J) & int_leq(J, n))) | (a(I, J) = real_zero))),
% 0.20/0.51 inference(modus_ponens,[status(thm)],[40, 35])).
% 0.20/0.51 tff(42,plain,
% 0.20/0.51 (~![I: $i, J: $i] : ((~(int_leq(int_one, I) & int_less(I, J) & int_leq(J, n))) | (a(I, J) = real_zero))),
% 0.20/0.51 inference(modus_ponens,[status(thm)],[41, 35])).
% 0.20/0.51 tff(43,plain,
% 0.20/0.51 (~![I: $i, J: $i] : ((~(int_leq(int_one, I) & int_less(I, J) & int_leq(J, n))) | (a(I, J) = real_zero))),
% 0.20/0.51 inference(modus_ponens,[status(thm)],[42, 35])).
% 0.20/0.51 tff(44,plain,
% 0.20/0.51 (~![I: $i, J: $i] : ((~(int_leq(int_one, I) & int_less(I, J) & int_leq(J, n))) | (a(I, J) = real_zero))),
% 0.20/0.51 inference(modus_ponens,[status(thm)],[43, 35])).
% 0.20/0.51 tff(45,plain,(
% 0.20/0.51 ~((~(int_leq(int_one, I!2) & int_less(I!2, J!1) & int_leq(J!1, n))) | (a(I!2, J!1) = real_zero))),
% 0.20/0.51 inference(skolemize,[status(sab)],[44])).
% 0.20/0.51 tff(46,plain,
% 0.20/0.51 (int_leq(int_one, I!2) & int_less(I!2, J!1) & int_leq(J!1, n)),
% 0.20/0.51 inference(or_elim,[status(thm)],[45])).
% 0.20/0.51 tff(47,plain,
% 0.20/0.51 (int_less(I!2, J!1)),
% 0.20/0.51 inference(and_elim,[status(thm)],[46])).
% 0.20/0.51 tff(48,plain,
% 0.20/0.51 ((~((~int_less(I!2, J!1)) | (~((~(plus(I!2, tptp_fun_K_0(J!1, I!2)) = J!1)) | (~int_less(int_zero, tptp_fun_K_0(J!1, I!2))))))) | (~int_less(I!2, J!1)) | (~((~(plus(I!2, tptp_fun_K_0(J!1, I!2)) = J!1)) | (~int_less(int_zero, tptp_fun_K_0(J!1, I!2)))))),
% 0.20/0.51 inference(tautology,[status(thm)],[])).
% 0.20/0.51 tff(49,plain,
% 0.20/0.51 ((~((~int_less(I!2, J!1)) | (~((~(plus(I!2, tptp_fun_K_0(J!1, I!2)) = J!1)) | (~int_less(int_zero, tptp_fun_K_0(J!1, I!2))))))) | (~((~(plus(I!2, tptp_fun_K_0(J!1, I!2)) = J!1)) | (~int_less(int_zero, tptp_fun_K_0(J!1, I!2)))))),
% 0.20/0.51 inference(unit_resolution,[status(thm)],[48, 47])).
% 0.20/0.51 tff(50,plain,
% 0.20/0.51 (~((~(plus(I!2, tptp_fun_K_0(J!1, I!2)) = J!1)) | (~int_less(int_zero, tptp_fun_K_0(J!1, I!2))))),
% 0.20/0.51 inference(unit_resolution,[status(thm)],[49, 34])).
% 0.20/0.51 tff(51,plain,
% 0.20/0.51 (((~(plus(I!2, tptp_fun_K_0(J!1, I!2)) = J!1)) | (~int_less(int_zero, tptp_fun_K_0(J!1, I!2)))) | (plus(I!2, tptp_fun_K_0(J!1, I!2)) = J!1)),
% 0.20/0.51 inference(tautology,[status(thm)],[])).
% 0.20/0.51 tff(52,plain,
% 0.20/0.51 (plus(I!2, tptp_fun_K_0(J!1, I!2)) = J!1),
% 0.20/0.51 inference(unit_resolution,[status(thm)],[51, 50])).
% 0.20/0.51 tff(53,plain,
% 0.20/0.51 (J!1 = plus(I!2, tptp_fun_K_0(J!1, I!2))),
% 0.20/0.51 inference(symmetry,[status(thm)],[52])).
% 0.20/0.51 tff(54,plain,
% 0.20/0.51 (((~![I: $i, J: $i] : (~((~((~int_less(I, J)) | (~((~(plus(I, tptp_fun_K_0(J, I)) = J)) | (~int_less(int_zero, tptp_fun_K_0(J, I))))))) | (~(int_less(I, J) | ![K: $i] : ((~(plus(I, K) = J)) | (~int_less(int_zero, K)))))))) | (~((~((~int_less(int_zero, J!1)) | (~((~(plus(int_zero, tptp_fun_K_0(J!1, int_zero)) = J!1)) | (~int_less(int_zero, tptp_fun_K_0(J!1, int_zero))))))) | (~(int_less(int_zero, J!1) | ![K: $i] : ((~int_less(int_zero, K)) | (~(plus(int_zero, K) = J!1)))))))) <=> ((~![I: $i, J: $i] : (~((~((~int_less(I, J)) | (~((~(plus(I, tptp_fun_K_0(J, I)) = J)) | (~int_less(int_zero, tptp_fun_K_0(J, I))))))) | (~(int_less(I, J) | ![K: $i] : ((~(plus(I, K) = J)) | (~int_less(int_zero, K)))))))) | (~((~((~int_less(int_zero, J!1)) | (~((~(plus(int_zero, tptp_fun_K_0(J!1, int_zero)) = J!1)) | (~int_less(int_zero, tptp_fun_K_0(J!1, int_zero))))))) | (~(int_less(int_zero, J!1) | ![K: $i] : ((~int_less(int_zero, K)) | (~(plus(int_zero, K) = J!1))))))))),
% 0.20/0.51 inference(rewrite,[status(thm)],[])).
% 0.20/0.51 tff(55,plain,
% 0.20/0.51 ((~((~((~int_less(int_zero, J!1)) | (~((~(plus(int_zero, tptp_fun_K_0(J!1, int_zero)) = J!1)) | (~int_less(int_zero, tptp_fun_K_0(J!1, int_zero))))))) | (~(int_less(int_zero, J!1) | ![K: $i] : ((~(plus(int_zero, K) = J!1)) | (~int_less(int_zero, K))))))) <=> (~((~((~int_less(int_zero, J!1)) | (~((~(plus(int_zero, tptp_fun_K_0(J!1, int_zero)) = J!1)) | (~int_less(int_zero, tptp_fun_K_0(J!1, int_zero))))))) | (~(int_less(int_zero, J!1) | ![K: $i] : ((~int_less(int_zero, K)) | (~(plus(int_zero, K) = J!1)))))))),
% 0.20/0.51 inference(rewrite,[status(thm)],[])).
% 0.20/0.51 tff(56,plain,
% 0.20/0.51 (((~![I: $i, J: $i] : (~((~((~int_less(I, J)) | (~((~(plus(I, tptp_fun_K_0(J, I)) = J)) | (~int_less(int_zero, tptp_fun_K_0(J, I))))))) | (~(int_less(I, J) | ![K: $i] : ((~(plus(I, K) = J)) | (~int_less(int_zero, K)))))))) | (~((~((~int_less(int_zero, J!1)) | (~((~(plus(int_zero, tptp_fun_K_0(J!1, int_zero)) = J!1)) | (~int_less(int_zero, tptp_fun_K_0(J!1, int_zero))))))) | (~(int_less(int_zero, J!1) | ![K: $i] : ((~(plus(int_zero, K) = J!1)) | (~int_less(int_zero, K)))))))) <=> ((~![I: $i, J: $i] : (~((~((~int_less(I, J)) | (~((~(plus(I, tptp_fun_K_0(J, I)) = J)) | (~int_less(int_zero, tptp_fun_K_0(J, I))))))) | (~(int_less(I, J) | ![K: $i] : ((~(plus(I, K) = J)) | (~int_less(int_zero, K)))))))) | (~((~((~int_less(int_zero, J!1)) | (~((~(plus(int_zero, tptp_fun_K_0(J!1, int_zero)) = J!1)) | (~int_less(int_zero, tptp_fun_K_0(J!1, int_zero))))))) | (~(int_less(int_zero, J!1) | ![K: $i] : ((~int_less(int_zero, K)) | (~(plus(int_zero, K) = J!1))))))))),
% 0.20/0.51 inference(monotonicity,[status(thm)],[55])).
% 0.20/0.51 tff(57,plain,
% 0.20/0.51 (((~![I: $i, J: $i] : (~((~((~int_less(I, J)) | (~((~(plus(I, tptp_fun_K_0(J, I)) = J)) | (~int_less(int_zero, tptp_fun_K_0(J, I))))))) | (~(int_less(I, J) | ![K: $i] : ((~(plus(I, K) = J)) | (~int_less(int_zero, K)))))))) | (~((~((~int_less(int_zero, J!1)) | (~((~(plus(int_zero, tptp_fun_K_0(J!1, int_zero)) = J!1)) | (~int_less(int_zero, tptp_fun_K_0(J!1, int_zero))))))) | (~(int_less(int_zero, J!1) | ![K: $i] : ((~(plus(int_zero, K) = J!1)) | (~int_less(int_zero, K)))))))) <=> ((~![I: $i, J: $i] : (~((~((~int_less(I, J)) | (~((~(plus(I, tptp_fun_K_0(J, I)) = J)) | (~int_less(int_zero, tptp_fun_K_0(J, I))))))) | (~(int_less(I, J) | ![K: $i] : ((~(plus(I, K) = J)) | (~int_less(int_zero, K)))))))) | (~((~((~int_less(int_zero, J!1)) | (~((~(plus(int_zero, tptp_fun_K_0(J!1, int_zero)) = J!1)) | (~int_less(int_zero, tptp_fun_K_0(J!1, int_zero))))))) | (~(int_less(int_zero, J!1) | ![K: $i] : ((~int_less(int_zero, K)) | (~(plus(int_zero, K) = J!1))))))))),
% 0.20/0.51 inference(transitivity,[status(thm)],[56, 54])).
% 0.20/0.51 tff(58,plain,
% 0.20/0.51 ((~![I: $i, J: $i] : (~((~((~int_less(I, J)) | (~((~(plus(I, tptp_fun_K_0(J, I)) = J)) | (~int_less(int_zero, tptp_fun_K_0(J, I))))))) | (~(int_less(I, J) | ![K: $i] : ((~(plus(I, K) = J)) | (~int_less(int_zero, K)))))))) | (~((~((~int_less(int_zero, J!1)) | (~((~(plus(int_zero, tptp_fun_K_0(J!1, int_zero)) = J!1)) | (~int_less(int_zero, tptp_fun_K_0(J!1, int_zero))))))) | (~(int_less(int_zero, J!1) | ![K: $i] : ((~(plus(int_zero, K) = J!1)) | (~int_less(int_zero, K)))))))),
% 0.20/0.51 inference(quant_inst,[status(thm)],[])).
% 0.20/0.51 tff(59,plain,
% 0.20/0.51 ((~![I: $i, J: $i] : (~((~((~int_less(I, J)) | (~((~(plus(I, tptp_fun_K_0(J, I)) = J)) | (~int_less(int_zero, tptp_fun_K_0(J, I))))))) | (~(int_less(I, J) | ![K: $i] : ((~(plus(I, K) = J)) | (~int_less(int_zero, K)))))))) | (~((~((~int_less(int_zero, J!1)) | (~((~(plus(int_zero, tptp_fun_K_0(J!1, int_zero)) = J!1)) | (~int_less(int_zero, tptp_fun_K_0(J!1, int_zero))))))) | (~(int_less(int_zero, J!1) | ![K: $i] : ((~int_less(int_zero, K)) | (~(plus(int_zero, K) = J!1)))))))),
% 0.20/0.51 inference(modus_ponens,[status(thm)],[58, 57])).
% 0.20/0.51 tff(60,plain,
% 0.20/0.51 (~((~((~int_less(int_zero, J!1)) | (~((~(plus(int_zero, tptp_fun_K_0(J!1, int_zero)) = J!1)) | (~int_less(int_zero, tptp_fun_K_0(J!1, int_zero))))))) | (~(int_less(int_zero, J!1) | ![K: $i] : ((~int_less(int_zero, K)) | (~(plus(int_zero, K) = J!1))))))),
% 0.20/0.51 inference(unit_resolution,[status(thm)],[59, 25])).
% 0.20/0.51 tff(61,plain,
% 0.20/0.51 (((~((~int_less(int_zero, J!1)) | (~((~(plus(int_zero, tptp_fun_K_0(J!1, int_zero)) = J!1)) | (~int_less(int_zero, tptp_fun_K_0(J!1, int_zero))))))) | (~(int_less(int_zero, J!1) | ![K: $i] : ((~int_less(int_zero, K)) | (~(plus(int_zero, K) = J!1)))))) | ((~int_less(int_zero, J!1)) | (~((~(plus(int_zero, tptp_fun_K_0(J!1, int_zero)) = J!1)) | (~int_less(int_zero, tptp_fun_K_0(J!1, int_zero))))))),
% 0.20/0.51 inference(tautology,[status(thm)],[])).
% 0.20/0.51 tff(62,plain,
% 0.20/0.51 ((~int_less(int_zero, J!1)) | (~((~(plus(int_zero, tptp_fun_K_0(J!1, int_zero)) = J!1)) | (~int_less(int_zero, tptp_fun_K_0(J!1, int_zero)))))),
% 0.20/0.51 inference(unit_resolution,[status(thm)],[61, 60])).
% 0.20/0.51 tff(63,plain,
% 0.20/0.51 (^[I: $i] : refl((int_less(int_zero, I) <=> int_leq(int_one, I)) <=> (int_less(int_zero, I) <=> int_leq(int_one, I)))),
% 0.20/0.51 inference(bind,[status(th)],[])).
% 0.20/0.51 tff(64,plain,
% 0.20/0.51 (![I: $i] : (int_less(int_zero, I) <=> int_leq(int_one, I)) <=> ![I: $i] : (int_less(int_zero, I) <=> int_leq(int_one, I))),
% 0.20/0.51 inference(quant_intro,[status(thm)],[63])).
% 0.20/0.51 tff(65,plain,
% 0.20/0.51 (![I: $i] : (int_less(int_zero, I) <=> int_leq(int_one, I)) <=> ![I: $i] : (int_less(int_zero, I) <=> int_leq(int_one, I))),
% 0.20/0.51 inference(rewrite,[status(thm)],[])).
% 0.20/0.51 tff(66,axiom,(![I: $i] : (int_less(int_zero, I) <=> int_leq(int_one, I))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','one_successor_of_zero')).
% 0.20/0.51 tff(67,plain,
% 0.20/0.51 (![I: $i] : (int_less(int_zero, I) <=> int_leq(int_one, I))),
% 0.20/0.51 inference(modus_ponens,[status(thm)],[66, 65])).
% 0.20/0.51 tff(68,plain,(
% 0.20/0.51 ![I: $i] : (int_less(int_zero, I) <=> int_leq(int_one, I))),
% 0.20/0.51 inference(skolemize,[status(sab)],[67])).
% 0.20/0.51 tff(69,plain,
% 0.20/0.51 (![I: $i] : (int_less(int_zero, I) <=> int_leq(int_one, I))),
% 0.20/0.51 inference(modus_ponens,[status(thm)],[68, 64])).
% 0.20/0.51 tff(70,plain,
% 0.20/0.51 ((~![I: $i] : (int_less(int_zero, I) <=> int_leq(int_one, I))) | (int_less(int_zero, I!2) <=> int_leq(int_one, I!2))),
% 0.20/0.51 inference(quant_inst,[status(thm)],[])).
% 0.20/0.51 tff(71,plain,
% 0.20/0.51 (int_less(int_zero, I!2) <=> int_leq(int_one, I!2)),
% 0.20/0.51 inference(unit_resolution,[status(thm)],[70, 69])).
% 0.20/0.51 tff(72,plain,
% 0.20/0.51 (int_leq(int_one, I!2)),
% 0.20/0.51 inference(and_elim,[status(thm)],[46])).
% 0.20/0.51 tff(73,plain,
% 0.20/0.51 ((~(int_less(int_zero, I!2) <=> int_leq(int_one, I!2))) | int_less(int_zero, I!2) | (~int_leq(int_one, I!2))),
% 0.20/0.51 inference(tautology,[status(thm)],[])).
% 0.20/0.51 tff(74,plain,
% 0.20/0.51 ((~(int_less(int_zero, I!2) <=> int_leq(int_one, I!2))) | int_less(int_zero, I!2)),
% 0.20/0.51 inference(unit_resolution,[status(thm)],[73, 72])).
% 0.20/0.51 tff(75,plain,
% 0.20/0.51 (int_less(int_zero, I!2)),
% 0.20/0.51 inference(unit_resolution,[status(thm)],[74, 71])).
% 0.20/0.51 tff(76,plain,
% 0.20/0.51 (![I: $i, J: $i, K: $i] : (int_less(I, K) | (~int_less(J, K)) | (~int_less(I, J))) <=> ![I: $i, J: $i, K: $i] : (int_less(I, K) | (~int_less(J, K)) | (~int_less(I, J)))),
% 0.20/0.51 inference(rewrite,[status(thm)],[])).
% 0.20/0.51 tff(77,plain,
% 0.20/0.51 (^[I: $i, J: $i, K: $i] : trans(monotonicity(trans(monotonicity(rewrite((int_less(I, J) & int_less(J, K)) <=> (~((~int_less(J, K)) | (~int_less(I, J))))), ((~(int_less(I, J) & int_less(J, K))) <=> (~(~((~int_less(J, K)) | (~int_less(I, J))))))), rewrite((~(~((~int_less(J, K)) | (~int_less(I, J))))) <=> ((~int_less(J, K)) | (~int_less(I, J)))), ((~(int_less(I, J) & int_less(J, K))) <=> ((~int_less(J, K)) | (~int_less(I, J))))), (((~(int_less(I, J) & int_less(J, K))) | int_less(I, K)) <=> (((~int_less(J, K)) | (~int_less(I, J))) | int_less(I, K)))), rewrite((((~int_less(J, K)) | (~int_less(I, J))) | int_less(I, K)) <=> (int_less(I, K) | (~int_less(J, K)) | (~int_less(I, J)))), (((~(int_less(I, J) & int_less(J, K))) | int_less(I, K)) <=> (int_less(I, K) | (~int_less(J, K)) | (~int_less(I, J)))))),
% 0.20/0.51 inference(bind,[status(th)],[])).
% 0.20/0.51 tff(78,plain,
% 0.20/0.51 (![I: $i, J: $i, K: $i] : ((~(int_less(I, J) & int_less(J, K))) | int_less(I, K)) <=> ![I: $i, J: $i, K: $i] : (int_less(I, K) | (~int_less(J, K)) | (~int_less(I, J)))),
% 0.20/0.51 inference(quant_intro,[status(thm)],[77])).
% 0.20/0.51 tff(79,plain,
% 0.20/0.51 (![I: $i, J: $i, K: $i] : ((~(int_less(I, J) & int_less(J, K))) | int_less(I, K)) <=> ![I: $i, J: $i, K: $i] : ((~(int_less(I, J) & int_less(J, K))) | int_less(I, K))),
% 0.20/0.51 inference(rewrite,[status(thm)],[])).
% 0.20/0.51 tff(80,plain,
% 0.20/0.51 (^[I: $i, J: $i, K: $i] : rewrite(((int_less(I, J) & int_less(J, K)) => int_less(I, K)) <=> ((~(int_less(I, J) & int_less(J, K))) | int_less(I, K)))),
% 0.20/0.51 inference(bind,[status(th)],[])).
% 0.20/0.51 tff(81,plain,
% 0.20/0.51 (![I: $i, J: $i, K: $i] : ((int_less(I, J) & int_less(J, K)) => int_less(I, K)) <=> ![I: $i, J: $i, K: $i] : ((~(int_less(I, J) & int_less(J, K))) | int_less(I, K))),
% 0.20/0.51 inference(quant_intro,[status(thm)],[80])).
% 0.20/0.51 tff(82,axiom,(![I: $i, J: $i, K: $i] : ((int_less(I, J) & int_less(J, K)) => int_less(I, K))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','int_less_transitive')).
% 0.20/0.51 tff(83,plain,
% 0.20/0.51 (![I: $i, J: $i, K: $i] : ((~(int_less(I, J) & int_less(J, K))) | int_less(I, K))),
% 0.20/0.51 inference(modus_ponens,[status(thm)],[82, 81])).
% 0.20/0.51 tff(84,plain,
% 0.20/0.51 (![I: $i, J: $i, K: $i] : ((~(int_less(I, J) & int_less(J, K))) | int_less(I, K))),
% 0.20/0.51 inference(modus_ponens,[status(thm)],[83, 79])).
% 0.20/0.51 tff(85,plain,(
% 0.20/0.51 ![I: $i, J: $i, K: $i] : ((~(int_less(I, J) & int_less(J, K))) | int_less(I, K))),
% 0.20/0.51 inference(skolemize,[status(sab)],[84])).
% 0.20/0.51 tff(86,plain,
% 0.20/0.51 (![I: $i, J: $i, K: $i] : (int_less(I, K) | (~int_less(J, K)) | (~int_less(I, J)))),
% 0.20/0.51 inference(modus_ponens,[status(thm)],[85, 78])).
% 0.20/0.51 tff(87,plain,
% 0.20/0.51 (![I: $i, J: $i, K: $i] : (int_less(I, K) | (~int_less(J, K)) | (~int_less(I, J)))),
% 0.20/0.51 inference(modus_ponens,[status(thm)],[86, 76])).
% 0.20/0.51 tff(88,plain,
% 0.20/0.51 (((~![I: $i, J: $i, K: $i] : (int_less(I, K) | (~int_less(J, K)) | (~int_less(I, J)))) | ((~int_less(int_zero, I!2)) | (~int_less(I!2, J!1)) | int_less(int_zero, J!1))) <=> ((~![I: $i, J: $i, K: $i] : (int_less(I, K) | (~int_less(J, K)) | (~int_less(I, J)))) | (~int_less(int_zero, I!2)) | (~int_less(I!2, J!1)) | int_less(int_zero, J!1))),
% 0.20/0.52 inference(rewrite,[status(thm)],[])).
% 0.20/0.52 tff(89,plain,
% 0.20/0.52 ((int_less(int_zero, J!1) | (~int_less(I!2, J!1)) | (~int_less(int_zero, I!2))) <=> ((~int_less(int_zero, I!2)) | (~int_less(I!2, J!1)) | int_less(int_zero, J!1))),
% 0.20/0.52 inference(rewrite,[status(thm)],[])).
% 0.20/0.52 tff(90,plain,
% 0.20/0.52 (((~![I: $i, J: $i, K: $i] : (int_less(I, K) | (~int_less(J, K)) | (~int_less(I, J)))) | (int_less(int_zero, J!1) | (~int_less(I!2, J!1)) | (~int_less(int_zero, I!2)))) <=> ((~![I: $i, J: $i, K: $i] : (int_less(I, K) | (~int_less(J, K)) | (~int_less(I, J)))) | ((~int_less(int_zero, I!2)) | (~int_less(I!2, J!1)) | int_less(int_zero, J!1)))),
% 0.20/0.52 inference(monotonicity,[status(thm)],[89])).
% 0.20/0.52 tff(91,plain,
% 0.20/0.52 (((~![I: $i, J: $i, K: $i] : (int_less(I, K) | (~int_less(J, K)) | (~int_less(I, J)))) | (int_less(int_zero, J!1) | (~int_less(I!2, J!1)) | (~int_less(int_zero, I!2)))) <=> ((~![I: $i, J: $i, K: $i] : (int_less(I, K) | (~int_less(J, K)) | (~int_less(I, J)))) | (~int_less(int_zero, I!2)) | (~int_less(I!2, J!1)) | int_less(int_zero, J!1))),
% 0.20/0.52 inference(transitivity,[status(thm)],[90, 88])).
% 0.20/0.52 tff(92,plain,
% 0.20/0.52 ((~![I: $i, J: $i, K: $i] : (int_less(I, K) | (~int_less(J, K)) | (~int_less(I, J)))) | (int_less(int_zero, J!1) | (~int_less(I!2, J!1)) | (~int_less(int_zero, I!2)))),
% 0.20/0.52 inference(quant_inst,[status(thm)],[])).
% 0.20/0.52 tff(93,plain,
% 0.20/0.52 ((~![I: $i, J: $i, K: $i] : (int_less(I, K) | (~int_less(J, K)) | (~int_less(I, J)))) | (~int_less(int_zero, I!2)) | (~int_less(I!2, J!1)) | int_less(int_zero, J!1)),
% 0.20/0.52 inference(modus_ponens,[status(thm)],[92, 91])).
% 0.20/0.52 tff(94,plain,
% 0.20/0.52 (int_less(int_zero, J!1)),
% 0.20/0.52 inference(unit_resolution,[status(thm)],[93, 87, 47, 75])).
% 0.20/0.52 tff(95,plain,
% 0.20/0.52 ((~((~int_less(int_zero, J!1)) | (~((~(plus(int_zero, tptp_fun_K_0(J!1, int_zero)) = J!1)) | (~int_less(int_zero, tptp_fun_K_0(J!1, int_zero))))))) | (~int_less(int_zero, J!1)) | (~((~(plus(int_zero, tptp_fun_K_0(J!1, int_zero)) = J!1)) | (~int_less(int_zero, tptp_fun_K_0(J!1, int_zero)))))),
% 0.20/0.52 inference(tautology,[status(thm)],[])).
% 0.20/0.52 tff(96,plain,
% 0.20/0.52 ((~((~int_less(int_zero, J!1)) | (~((~(plus(int_zero, tptp_fun_K_0(J!1, int_zero)) = J!1)) | (~int_less(int_zero, tptp_fun_K_0(J!1, int_zero))))))) | (~((~(plus(int_zero, tptp_fun_K_0(J!1, int_zero)) = J!1)) | (~int_less(int_zero, tptp_fun_K_0(J!1, int_zero)))))),
% 0.20/0.52 inference(unit_resolution,[status(thm)],[95, 94])).
% 0.20/0.52 tff(97,plain,
% 0.20/0.52 (~((~(plus(int_zero, tptp_fun_K_0(J!1, int_zero)) = J!1)) | (~int_less(int_zero, tptp_fun_K_0(J!1, int_zero))))),
% 0.20/0.52 inference(unit_resolution,[status(thm)],[96, 62])).
% 0.20/0.52 tff(98,plain,
% 0.20/0.52 (((~(plus(int_zero, tptp_fun_K_0(J!1, int_zero)) = J!1)) | (~int_less(int_zero, tptp_fun_K_0(J!1, int_zero)))) | (plus(int_zero, tptp_fun_K_0(J!1, int_zero)) = J!1)),
% 0.20/0.52 inference(tautology,[status(thm)],[])).
% 0.20/0.52 tff(99,plain,
% 0.20/0.52 (plus(int_zero, tptp_fun_K_0(J!1, int_zero)) = J!1),
% 0.20/0.52 inference(unit_resolution,[status(thm)],[98, 97])).
% 0.20/0.52 tff(100,plain,
% 0.20/0.52 (^[I: $i, J: $i] : refl((plus(I, J) = plus(J, I)) <=> (plus(I, J) = plus(J, I)))),
% 0.20/0.52 inference(bind,[status(th)],[])).
% 0.20/0.52 tff(101,plain,
% 0.20/0.52 (![I: $i, J: $i] : (plus(I, J) = plus(J, I)) <=> ![I: $i, J: $i] : (plus(I, J) = plus(J, I))),
% 0.20/0.52 inference(quant_intro,[status(thm)],[100])).
% 0.20/0.52 tff(102,plain,
% 0.20/0.52 (![I: $i, J: $i] : (plus(I, J) = plus(J, I)) <=> ![I: $i, J: $i] : (plus(I, J) = plus(J, I))),
% 0.20/0.52 inference(rewrite,[status(thm)],[])).
% 0.20/0.52 tff(103,axiom,(![I: $i, J: $i] : (plus(I, J) = plus(J, I))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','plus_commutative')).
% 0.20/0.52 tff(104,plain,
% 0.20/0.52 (![I: $i, J: $i] : (plus(I, J) = plus(J, I))),
% 0.20/0.52 inference(modus_ponens,[status(thm)],[103, 102])).
% 0.20/0.52 tff(105,plain,(
% 0.20/0.52 ![I: $i, J: $i] : (plus(I, J) = plus(J, I))),
% 0.20/0.52 inference(skolemize,[status(sab)],[104])).
% 0.20/0.52 tff(106,plain,
% 0.20/0.52 (![I: $i, J: $i] : (plus(I, J) = plus(J, I))),
% 0.20/0.52 inference(modus_ponens,[status(thm)],[105, 101])).
% 0.20/0.52 tff(107,plain,
% 0.20/0.52 ((~![I: $i, J: $i] : (plus(I, J) = plus(J, I))) | (plus(int_zero, tptp_fun_K_0(J!1, int_zero)) = plus(tptp_fun_K_0(J!1, int_zero), int_zero))),
% 0.20/0.52 inference(quant_inst,[status(thm)],[])).
% 0.20/0.52 tff(108,plain,
% 0.20/0.52 (plus(int_zero, tptp_fun_K_0(J!1, int_zero)) = plus(tptp_fun_K_0(J!1, int_zero), int_zero)),
% 0.20/0.52 inference(unit_resolution,[status(thm)],[107, 106])).
% 0.20/0.52 tff(109,plain,
% 0.20/0.52 (plus(tptp_fun_K_0(J!1, int_zero), int_zero) = plus(int_zero, tptp_fun_K_0(J!1, int_zero))),
% 0.20/0.52 inference(symmetry,[status(thm)],[108])).
% 0.20/0.52 tff(110,plain,
% 0.20/0.52 (^[I: $i] : refl((plus(I, int_zero) = I) <=> (plus(I, int_zero) = I))),
% 0.20/0.52 inference(bind,[status(th)],[])).
% 0.20/0.52 tff(111,plain,
% 0.20/0.52 (![I: $i] : (plus(I, int_zero) = I) <=> ![I: $i] : (plus(I, int_zero) = I)),
% 0.20/0.52 inference(quant_intro,[status(thm)],[110])).
% 0.20/0.52 tff(112,plain,
% 0.20/0.52 (![I: $i] : (plus(I, int_zero) = I) <=> ![I: $i] : (plus(I, int_zero) = I)),
% 0.20/0.52 inference(rewrite,[status(thm)],[])).
% 0.20/0.52 tff(113,axiom,(![I: $i] : (plus(I, int_zero) = I)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','plus_zero')).
% 0.20/0.52 tff(114,plain,
% 0.20/0.52 (![I: $i] : (plus(I, int_zero) = I)),
% 0.20/0.52 inference(modus_ponens,[status(thm)],[113, 112])).
% 0.20/0.52 tff(115,plain,(
% 0.20/0.52 ![I: $i] : (plus(I, int_zero) = I)),
% 0.20/0.52 inference(skolemize,[status(sab)],[114])).
% 0.20/0.52 tff(116,plain,
% 0.20/0.52 (![I: $i] : (plus(I, int_zero) = I)),
% 0.20/0.52 inference(modus_ponens,[status(thm)],[115, 111])).
% 0.20/0.52 tff(117,plain,
% 0.20/0.52 ((~![I: $i] : (plus(I, int_zero) = I)) | (plus(tptp_fun_K_0(J!1, int_zero), int_zero) = tptp_fun_K_0(J!1, int_zero))),
% 0.20/0.52 inference(quant_inst,[status(thm)],[])).
% 0.20/0.52 tff(118,plain,
% 0.20/0.52 (plus(tptp_fun_K_0(J!1, int_zero), int_zero) = tptp_fun_K_0(J!1, int_zero)),
% 0.20/0.52 inference(unit_resolution,[status(thm)],[117, 116])).
% 0.20/0.52 tff(119,plain,
% 0.20/0.52 (tptp_fun_K_0(J!1, int_zero) = plus(tptp_fun_K_0(J!1, int_zero), int_zero)),
% 0.20/0.52 inference(symmetry,[status(thm)],[118])).
% 0.20/0.52 tff(120,plain,
% 0.20/0.52 (tptp_fun_K_0(J!1, int_zero) = plus(I!2, tptp_fun_K_0(J!1, I!2))),
% 0.20/0.52 inference(transitivity,[status(thm)],[119, 109, 99, 53])).
% 0.20/0.52 tff(121,assumption,(![K: $i] : ((~int_leq(int_one, K)) | (~int_leq(K, I!2)) | (a(K, plus(K, tptp_fun_K_0(J!1, I!2))) = real_zero))), introduced(assumption)).
% 0.20/0.52 tff(122,assumption,(a(I!2, plus(I!2, tptp_fun_K_0(J!1, I!2))) = real_zero), introduced(assumption)).
% 0.20/0.52 tff(123,plain,
% 0.20/0.52 (a(I!2, J!1) = a(I!2, plus(I!2, tptp_fun_K_0(J!1, I!2)))),
% 0.20/0.52 inference(monotonicity,[status(thm)],[53])).
% 0.20/0.52 tff(124,plain,
% 0.20/0.52 (a(I!2, J!1) = real_zero),
% 0.20/0.52 inference(transitivity,[status(thm)],[123, 122])).
% 0.20/0.52 tff(125,plain,
% 0.20/0.52 (~(a(I!2, J!1) = real_zero)),
% 0.20/0.52 inference(or_elim,[status(thm)],[45])).
% 0.20/0.52 tff(126,plain,
% 0.20/0.52 ($false),
% 0.20/0.52 inference(unit_resolution,[status(thm)],[125, 124])).
% 0.20/0.52 tff(127,plain,(~(a(I!2, plus(I!2, tptp_fun_K_0(J!1, I!2))) = real_zero)), inference(lemma,lemma(discharge,[]))).
% 0.20/0.52 tff(128,assumption,(~int_leq(I!2, I!2)), introduced(assumption)).
% 0.20/0.52 tff(129,plain,
% 0.20/0.52 (((~![I: $i, J: $i] : (int_leq(I, J) <=> ((I = J) | int_less(I, J)))) | int_leq(I!2, I!2)) <=> ((~![I: $i, J: $i] : (int_leq(I, J) <=> ((I = J) | int_less(I, J)))) | int_leq(I!2, I!2))),
% 0.20/0.52 inference(rewrite,[status(thm)],[])).
% 0.20/0.52 tff(130,plain,
% 0.20/0.52 ((int_leq(I!2, I!2) <=> $true) <=> int_leq(I!2, I!2)),
% 0.20/0.52 inference(rewrite,[status(thm)],[])).
% 0.20/0.52 tff(131,plain,
% 0.20/0.52 (($true | int_less(I!2, I!2)) <=> $true),
% 0.20/0.52 inference(rewrite,[status(thm)],[])).
% 0.20/0.52 tff(132,plain,
% 0.20/0.52 ((I!2 = I!2) <=> $true),
% 0.20/0.52 inference(rewrite,[status(thm)],[])).
% 0.20/0.52 tff(133,plain,
% 0.20/0.52 (((I!2 = I!2) | int_less(I!2, I!2)) <=> ($true | int_less(I!2, I!2))),
% 0.20/0.52 inference(monotonicity,[status(thm)],[132])).
% 0.20/0.52 tff(134,plain,
% 0.20/0.52 (((I!2 = I!2) | int_less(I!2, I!2)) <=> $true),
% 0.20/0.52 inference(transitivity,[status(thm)],[133, 131])).
% 0.20/0.52 tff(135,plain,
% 0.20/0.52 ((int_leq(I!2, I!2) <=> ((I!2 = I!2) | int_less(I!2, I!2))) <=> (int_leq(I!2, I!2) <=> $true)),
% 0.20/0.52 inference(monotonicity,[status(thm)],[134])).
% 0.20/0.52 tff(136,plain,
% 0.20/0.52 ((int_leq(I!2, I!2) <=> ((I!2 = I!2) | int_less(I!2, I!2))) <=> int_leq(I!2, I!2)),
% 0.20/0.52 inference(transitivity,[status(thm)],[135, 130])).
% 0.20/0.52 tff(137,plain,
% 0.20/0.52 (((~![I: $i, J: $i] : (int_leq(I, J) <=> ((I = J) | int_less(I, J)))) | (int_leq(I!2, I!2) <=> ((I!2 = I!2) | int_less(I!2, I!2)))) <=> ((~![I: $i, J: $i] : (int_leq(I, J) <=> ((I = J) | int_less(I, J)))) | int_leq(I!2, I!2))),
% 0.20/0.52 inference(monotonicity,[status(thm)],[136])).
% 0.20/0.52 tff(138,plain,
% 0.20/0.52 (((~![I: $i, J: $i] : (int_leq(I, J) <=> ((I = J) | int_less(I, J)))) | (int_leq(I!2, I!2) <=> ((I!2 = I!2) | int_less(I!2, I!2)))) <=> ((~![I: $i, J: $i] : (int_leq(I, J) <=> ((I = J) | int_less(I, J)))) | int_leq(I!2, I!2))),
% 0.20/0.52 inference(transitivity,[status(thm)],[137, 129])).
% 0.20/0.52 tff(139,plain,
% 0.20/0.52 ((~![I: $i, J: $i] : (int_leq(I, J) <=> ((I = J) | int_less(I, J)))) | (int_leq(I!2, I!2) <=> ((I!2 = I!2) | int_less(I!2, I!2)))),
% 0.20/0.52 inference(quant_inst,[status(thm)],[])).
% 0.20/0.52 tff(140,plain,
% 0.20/0.52 ((~![I: $i, J: $i] : (int_leq(I, J) <=> ((I = J) | int_less(I, J)))) | int_leq(I!2, I!2)),
% 0.20/0.52 inference(modus_ponens,[status(thm)],[139, 138])).
% 0.20/0.52 tff(141,plain,
% 0.20/0.52 ($false),
% 0.20/0.52 inference(unit_resolution,[status(thm)],[140, 10, 128])).
% 0.20/0.52 tff(142,plain,(int_leq(I!2, I!2)), inference(lemma,lemma(discharge,[]))).
% 0.20/0.52 tff(143,plain,
% 0.20/0.52 (((~![K: $i] : ((~int_leq(int_one, K)) | (~int_leq(K, I!2)) | (a(K, plus(K, tptp_fun_K_0(J!1, I!2))) = real_zero))) | ((~int_leq(int_one, I!2)) | (~int_leq(I!2, I!2)) | (a(I!2, plus(I!2, tptp_fun_K_0(J!1, I!2))) = real_zero))) <=> ((~![K: $i] : ((~int_leq(int_one, K)) | (~int_leq(K, I!2)) | (a(K, plus(K, tptp_fun_K_0(J!1, I!2))) = real_zero))) | (~int_leq(int_one, I!2)) | (~int_leq(I!2, I!2)) | (a(I!2, plus(I!2, tptp_fun_K_0(J!1, I!2))) = real_zero))),
% 0.20/0.52 inference(rewrite,[status(thm)],[])).
% 0.20/0.52 tff(144,plain,
% 0.20/0.52 ((~![K: $i] : ((~int_leq(int_one, K)) | (~int_leq(K, I!2)) | (a(K, plus(K, tptp_fun_K_0(J!1, I!2))) = real_zero))) | ((~int_leq(int_one, I!2)) | (~int_leq(I!2, I!2)) | (a(I!2, plus(I!2, tptp_fun_K_0(J!1, I!2))) = real_zero))),
% 0.20/0.52 inference(quant_inst,[status(thm)],[])).
% 0.20/0.52 tff(145,plain,
% 0.20/0.52 ((~![K: $i] : ((~int_leq(int_one, K)) | (~int_leq(K, I!2)) | (a(K, plus(K, tptp_fun_K_0(J!1, I!2))) = real_zero))) | (~int_leq(int_one, I!2)) | (~int_leq(I!2, I!2)) | (a(I!2, plus(I!2, tptp_fun_K_0(J!1, I!2))) = real_zero)),
% 0.20/0.52 inference(modus_ponens,[status(thm)],[144, 143])).
% 0.20/0.52 tff(146,plain,
% 0.20/0.52 ($false),
% 0.20/0.52 inference(unit_resolution,[status(thm)],[145, 72, 142, 127, 121])).
% 0.20/0.52 tff(147,plain,(~![K: $i] : ((~int_leq(int_one, K)) | (~int_leq(K, I!2)) | (a(K, plus(K, tptp_fun_K_0(J!1, I!2))) = real_zero))), inference(lemma,lemma(discharge,[]))).
% 0.20/0.52 tff(148,assumption,(![C: $i] : ((~int_less(int_zero, C)) | (~(tptp_fun_K_0(J!1, int_zero) = plus(I!2, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I!2))))), introduced(assumption)).
% 0.20/0.52 tff(149,plain,
% 0.20/0.52 (((~(plus(I!2, tptp_fun_K_0(J!1, I!2)) = J!1)) | (~int_less(int_zero, tptp_fun_K_0(J!1, I!2)))) | int_less(int_zero, tptp_fun_K_0(J!1, I!2))),
% 0.20/0.52 inference(tautology,[status(thm)],[])).
% 0.20/0.52 tff(150,plain,
% 0.20/0.52 (int_less(int_zero, tptp_fun_K_0(J!1, I!2))),
% 0.20/0.52 inference(unit_resolution,[status(thm)],[149, 50])).
% 0.20/0.52 tff(151,plain,
% 0.20/0.52 (((~![C: $i] : ((~int_less(int_zero, C)) | (~(tptp_fun_K_0(J!1, int_zero) = plus(I!2, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I!2))))) | ((~int_less(int_zero, tptp_fun_K_0(J!1, I!2))) | (~(tptp_fun_K_0(J!1, int_zero) = plus(I!2, tptp_fun_K_0(J!1, I!2)))) | ![K: $i] : ((~int_leq(int_one, K)) | (~int_leq(K, I!2)) | (a(K, plus(K, tptp_fun_K_0(J!1, I!2))) = real_zero)))) <=> ((~![C: $i] : ((~int_less(int_zero, C)) | (~(tptp_fun_K_0(J!1, int_zero) = plus(I!2, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I!2))))) | (~int_less(int_zero, tptp_fun_K_0(J!1, I!2))) | (~(tptp_fun_K_0(J!1, int_zero) = plus(I!2, tptp_fun_K_0(J!1, I!2)))) | ![K: $i] : ((~int_leq(int_one, K)) | (~int_leq(K, I!2)) | (a(K, plus(K, tptp_fun_K_0(J!1, I!2))) = real_zero)))),
% 0.20/0.52 inference(rewrite,[status(thm)],[])).
% 0.20/0.52 tff(152,plain,
% 0.20/0.52 (((~int_less(int_zero, tptp_fun_K_0(J!1, I!2))) | (~(tptp_fun_K_0(J!1, int_zero) = plus(I!2, tptp_fun_K_0(J!1, I!2)))) | ![K: $i] : ((a(K, plus(K, tptp_fun_K_0(J!1, I!2))) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I!2)))) <=> ((~int_less(int_zero, tptp_fun_K_0(J!1, I!2))) | (~(tptp_fun_K_0(J!1, int_zero) = plus(I!2, tptp_fun_K_0(J!1, I!2)))) | ![K: $i] : ((~int_leq(int_one, K)) | (~int_leq(K, I!2)) | (a(K, plus(K, tptp_fun_K_0(J!1, I!2))) = real_zero)))),
% 0.20/0.52 inference(rewrite,[status(thm)],[])).
% 0.20/0.52 tff(153,plain,
% 0.20/0.52 (((~![C: $i] : ((~int_less(int_zero, C)) | (~(tptp_fun_K_0(J!1, int_zero) = plus(I!2, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I!2))))) | ((~int_less(int_zero, tptp_fun_K_0(J!1, I!2))) | (~(tptp_fun_K_0(J!1, int_zero) = plus(I!2, tptp_fun_K_0(J!1, I!2)))) | ![K: $i] : ((a(K, plus(K, tptp_fun_K_0(J!1, I!2))) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I!2))))) <=> ((~![C: $i] : ((~int_less(int_zero, C)) | (~(tptp_fun_K_0(J!1, int_zero) = plus(I!2, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I!2))))) | ((~int_less(int_zero, tptp_fun_K_0(J!1, I!2))) | (~(tptp_fun_K_0(J!1, int_zero) = plus(I!2, tptp_fun_K_0(J!1, I!2)))) | ![K: $i] : ((~int_leq(int_one, K)) | (~int_leq(K, I!2)) | (a(K, plus(K, tptp_fun_K_0(J!1, I!2))) = real_zero))))),
% 0.20/0.52 inference(monotonicity,[status(thm)],[152])).
% 0.20/0.52 tff(154,plain,
% 0.20/0.52 (((~![C: $i] : ((~int_less(int_zero, C)) | (~(tptp_fun_K_0(J!1, int_zero) = plus(I!2, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I!2))))) | ((~int_less(int_zero, tptp_fun_K_0(J!1, I!2))) | (~(tptp_fun_K_0(J!1, int_zero) = plus(I!2, tptp_fun_K_0(J!1, I!2)))) | ![K: $i] : ((a(K, plus(K, tptp_fun_K_0(J!1, I!2))) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I!2))))) <=> ((~![C: $i] : ((~int_less(int_zero, C)) | (~(tptp_fun_K_0(J!1, int_zero) = plus(I!2, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I!2))))) | (~int_less(int_zero, tptp_fun_K_0(J!1, I!2))) | (~(tptp_fun_K_0(J!1, int_zero) = plus(I!2, tptp_fun_K_0(J!1, I!2)))) | ![K: $i] : ((~int_leq(int_one, K)) | (~int_leq(K, I!2)) | (a(K, plus(K, tptp_fun_K_0(J!1, I!2))) = real_zero)))),
% 0.20/0.52 inference(transitivity,[status(thm)],[153, 151])).
% 0.20/0.52 tff(155,plain,
% 0.20/0.52 ((~![C: $i] : ((~int_less(int_zero, C)) | (~(tptp_fun_K_0(J!1, int_zero) = plus(I!2, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I!2))))) | ((~int_less(int_zero, tptp_fun_K_0(J!1, I!2))) | (~(tptp_fun_K_0(J!1, int_zero) = plus(I!2, tptp_fun_K_0(J!1, I!2)))) | ![K: $i] : ((a(K, plus(K, tptp_fun_K_0(J!1, I!2))) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I!2))))),
% 0.20/0.52 inference(quant_inst,[status(thm)],[])).
% 0.20/0.52 tff(156,plain,
% 0.20/0.52 ((~![C: $i] : ((~int_less(int_zero, C)) | (~(tptp_fun_K_0(J!1, int_zero) = plus(I!2, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I!2))))) | (~int_less(int_zero, tptp_fun_K_0(J!1, I!2))) | (~(tptp_fun_K_0(J!1, int_zero) = plus(I!2, tptp_fun_K_0(J!1, I!2)))) | ![K: $i] : ((~int_leq(int_one, K)) | (~int_leq(K, I!2)) | (a(K, plus(K, tptp_fun_K_0(J!1, I!2))) = real_zero))),
% 0.20/0.52 inference(modus_ponens,[status(thm)],[155, 154])).
% 0.20/0.52 tff(157,plain,
% 0.20/0.52 ($false),
% 0.20/0.52 inference(unit_resolution,[status(thm)],[156, 150, 148, 147, 120])).
% 0.20/0.52 tff(158,plain,(~![C: $i] : ((~int_less(int_zero, C)) | (~(tptp_fun_K_0(J!1, int_zero) = plus(I!2, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I!2))))), inference(lemma,lemma(discharge,[]))).
% 0.20/0.52 tff(159,plain,
% 0.20/0.52 (((~![C: $i] : ((~int_less(int_zero, C)) | (~(I!2 = plus(tptp_fun_K_0(J!1, int_zero), C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero)))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero))))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(tptp_fun_K_0(J!1, int_zero) = plus(I!2, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I!2)))))) | ![C: $i] : ((~int_less(int_zero, C)) | (~(tptp_fun_K_0(J!1, int_zero) = plus(I!2, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I!2))))),
% 0.20/0.52 inference(tautology,[status(thm)],[])).
% 0.20/0.52 tff(160,plain,
% 0.20/0.52 ((~![C: $i] : ((~int_less(int_zero, C)) | (~(I!2 = plus(tptp_fun_K_0(J!1, int_zero), C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero)))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero))))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(tptp_fun_K_0(J!1, int_zero) = plus(I!2, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I!2)))))),
% 0.20/0.52 inference(unit_resolution,[status(thm)],[159, 158])).
% 0.20/0.52 tff(161,plain,
% 0.20/0.52 (tptp_fun_K_0(J!1, int_zero) = J!1),
% 0.20/0.52 inference(transitivity,[status(thm)],[119, 109, 99])).
% 0.20/0.52 tff(162,plain,
% 0.20/0.52 (int_leq(tptp_fun_K_0(J!1, int_zero), n) <=> int_leq(J!1, n)),
% 0.20/0.52 inference(monotonicity,[status(thm)],[161])).
% 0.20/0.52 tff(163,plain,
% 0.20/0.52 (int_leq(J!1, n) <=> int_leq(tptp_fun_K_0(J!1, int_zero), n)),
% 0.20/0.52 inference(symmetry,[status(thm)],[162])).
% 0.20/0.52 tff(164,plain,
% 0.20/0.52 (int_leq(J!1, n)),
% 0.20/0.52 inference(and_elim,[status(thm)],[46])).
% 0.20/0.52 tff(165,plain,
% 0.20/0.52 (int_leq(tptp_fun_K_0(J!1, int_zero), n)),
% 0.20/0.52 inference(modus_ponens,[status(thm)],[164, 163])).
% 0.20/0.52 tff(166,plain,
% 0.20/0.52 ((~![I: $i] : (int_less(int_zero, I) <=> int_leq(int_one, I))) | (int_less(int_zero, tptp_fun_K_0(J!1, int_zero)) <=> int_leq(int_one, tptp_fun_K_0(J!1, int_zero)))),
% 0.20/0.52 inference(quant_inst,[status(thm)],[])).
% 0.20/0.52 tff(167,plain,
% 0.20/0.52 (int_less(int_zero, tptp_fun_K_0(J!1, int_zero)) <=> int_leq(int_one, tptp_fun_K_0(J!1, int_zero))),
% 0.20/0.52 inference(unit_resolution,[status(thm)],[166, 69])).
% 0.20/0.52 tff(168,plain,
% 0.20/0.52 (((~(plus(int_zero, tptp_fun_K_0(J!1, int_zero)) = J!1)) | (~int_less(int_zero, tptp_fun_K_0(J!1, int_zero)))) | int_less(int_zero, tptp_fun_K_0(J!1, int_zero))),
% 0.20/0.52 inference(tautology,[status(thm)],[])).
% 0.20/0.52 tff(169,plain,
% 0.20/0.52 (int_less(int_zero, tptp_fun_K_0(J!1, int_zero))),
% 0.20/0.52 inference(unit_resolution,[status(thm)],[168, 97])).
% 0.20/0.52 tff(170,plain,
% 0.20/0.52 ((~(int_less(int_zero, tptp_fun_K_0(J!1, int_zero)) <=> int_leq(int_one, tptp_fun_K_0(J!1, int_zero)))) | (~int_less(int_zero, tptp_fun_K_0(J!1, int_zero))) | int_leq(int_one, tptp_fun_K_0(J!1, int_zero))),
% 0.20/0.52 inference(tautology,[status(thm)],[])).
% 0.20/0.52 tff(171,plain,
% 0.20/0.52 ((~(int_less(int_zero, tptp_fun_K_0(J!1, int_zero)) <=> int_leq(int_one, tptp_fun_K_0(J!1, int_zero)))) | int_leq(int_one, tptp_fun_K_0(J!1, int_zero))),
% 0.20/0.52 inference(unit_resolution,[status(thm)],[170, 169])).
% 0.20/0.52 tff(172,plain,
% 0.20/0.52 (int_leq(int_one, tptp_fun_K_0(J!1, int_zero))),
% 0.20/0.52 inference(unit_resolution,[status(thm)],[171, 167])).
% 0.20/0.52 tff(173,plain,
% 0.20/0.52 (^[I: $i, J: $i] : refl(((~int_leq(int_one, I)) | (~int_leq(I, n)) | (~int_leq(int_one, J)) | (~int_leq(J, n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I)))))))) <=> ((~int_leq(int_one, I)) | (~int_leq(I, n)) | (~int_leq(int_one, J)) | (~int_leq(J, n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I)))))))))),
% 0.20/0.52 inference(bind,[status(th)],[])).
% 0.20/0.52 tff(174,plain,
% 0.20/0.52 (![I: $i, J: $i] : ((~int_leq(int_one, I)) | (~int_leq(I, n)) | (~int_leq(int_one, J)) | (~int_leq(J, n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I)))))))) <=> ![I: $i, J: $i] : ((~int_leq(int_one, I)) | (~int_leq(I, n)) | (~int_leq(int_one, J)) | (~int_leq(J, n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I))))))))),
% 0.20/0.53 inference(quant_intro,[status(thm)],[173])).
% 0.20/0.53 tff(175,plain,
% 0.20/0.53 (^[I: $i, J: $i] : rewrite(((~int_leq(int_one, I)) | (~int_leq(I, n)) | (~int_leq(int_one, J)) | (~int_leq(J, n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I)))))))) <=> ((~int_leq(int_one, I)) | (~int_leq(I, n)) | (~int_leq(int_one, J)) | (~int_leq(J, n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I)))))))))),
% 0.20/0.53 inference(bind,[status(th)],[])).
% 0.20/0.53 tff(176,plain,
% 0.20/0.53 (![I: $i, J: $i] : ((~int_leq(int_one, I)) | (~int_leq(I, n)) | (~int_leq(int_one, J)) | (~int_leq(J, n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I)))))))) <=> ![I: $i, J: $i] : ((~int_leq(int_one, I)) | (~int_leq(I, n)) | (~int_leq(int_one, J)) | (~int_leq(J, n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I))))))))),
% 0.20/0.53 inference(quant_intro,[status(thm)],[175])).
% 0.20/0.53 tff(177,plain,
% 0.20/0.53 (![I: $i, J: $i] : ((~int_leq(int_one, I)) | (~int_leq(I, n)) | (~int_leq(int_one, J)) | (~int_leq(J, n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I)))))))) <=> ![I: $i, J: $i] : ((~int_leq(int_one, I)) | (~int_leq(I, n)) | (~int_leq(int_one, J)) | (~int_leq(J, n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I))))))))),
% 0.20/0.53 inference(transitivity,[status(thm)],[176, 174])).
% 0.20/0.53 tff(178,plain,
% 0.20/0.53 (^[I: $i, J: $i] : trans(monotonicity(trans(monotonicity(rewrite((int_leq(int_one, I) & int_leq(I, n) & int_leq(int_one, J) & int_leq(J, n)) <=> (~((~int_leq(int_one, I)) | (~int_leq(I, n)) | (~int_leq(int_one, J)) | (~int_leq(J, n))))), ((~(int_leq(int_one, I) & int_leq(I, n) & int_leq(int_one, J) & int_leq(J, n))) <=> (~(~((~int_leq(int_one, I)) | (~int_leq(I, n)) | (~int_leq(int_one, J)) | (~int_leq(J, n))))))), rewrite((~(~((~int_leq(int_one, I)) | (~int_leq(I, n)) | (~int_leq(int_one, J)) | (~int_leq(J, n))))) <=> ((~int_leq(int_one, I)) | (~int_leq(I, n)) | (~int_leq(int_one, J)) | (~int_leq(J, n)))), ((~(int_leq(int_one, I) & int_leq(I, n) & int_leq(int_one, J) & int_leq(J, n))) <=> ((~int_leq(int_one, I)) | (~int_leq(I, n)) | (~int_leq(int_one, J)) | (~int_leq(J, n))))), trans(monotonicity(quant_intro(proof_bind(^[C: $i] : trans(monotonicity(trans(monotonicity(rewrite((int_less(int_zero, C) & (I = plus(J, C))) <=> (~((~int_less(int_zero, C)) | (~(I = plus(J, C)))))), ((~(int_less(int_zero, C) & (I = plus(J, C)))) <=> (~(~((~int_less(int_zero, C)) | (~(I = plus(J, C)))))))), rewrite((~(~((~int_less(int_zero, C)) | (~(I = plus(J, C)))))) <=> ((~int_less(int_zero, C)) | (~(I = plus(J, C))))), ((~(int_less(int_zero, C) & (I = plus(J, C)))) <=> ((~int_less(int_zero, C)) | (~(I = plus(J, C)))))), quant_intro(proof_bind(^[K: $i] : trans(monotonicity(trans(monotonicity(rewrite((int_leq(int_one, K) & int_leq(K, J)) <=> (~((~int_leq(int_one, K)) | (~int_leq(K, J))))), ((~(int_leq(int_one, K) & int_leq(K, J))) <=> (~(~((~int_leq(int_one, K)) | (~int_leq(K, J))))))), rewrite((~(~((~int_leq(int_one, K)) | (~int_leq(K, J))))) <=> ((~int_leq(int_one, K)) | (~int_leq(K, J)))), ((~(int_leq(int_one, K) & int_leq(K, J))) <=> ((~int_leq(int_one, K)) | (~int_leq(K, J))))), (((~(int_leq(int_one, K) & int_leq(K, J))) | (a(plus(K, C), K) = real_zero)) <=> (((~int_leq(int_one, K)) | (~int_leq(K, J))) | (a(plus(K, C), K) = real_zero)))), rewrite((((~int_leq(int_one, K)) | (~int_leq(K, J))) | (a(plus(K, C), K) = real_zero)) <=> ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J)))), (((~(int_leq(int_one, K) & int_leq(K, J))) | (a(plus(K, C), K) = real_zero)) <=> ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J)))))), (![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(plus(K, C), K) = real_zero)) <=> ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J))))), (((~(int_less(int_zero, C) & (I = plus(J, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(plus(K, C), K) = real_zero))) <=> (((~int_less(int_zero, C)) | (~(I = plus(J, C)))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J)))))), rewrite((((~int_less(int_zero, C)) | (~(I = plus(J, C)))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) <=> ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J))))), (((~(int_less(int_zero, C) & (I = plus(J, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(plus(K, C), K) = real_zero))) <=> ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J))))))), (![C: $i] : ((~(int_less(int_zero, C) & (I = plus(J, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(plus(K, C), K) = real_zero))) <=> ![C: $i] : ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J)))))), quant_intro(proof_bind(^[K: $i] : trans(monotonicity(trans(monotonicity(rewrite((int_leq(int_one, K) & int_leq(K, J)) <=> (~((~int_leq(int_one, K)) | (~int_leq(K, J))))), ((~(int_leq(int_one, K) & int_leq(K, J))) <=> (~(~((~int_leq(int_one, K)) | (~int_leq(K, J))))))), rewrite((~(~((~int_leq(int_one, K)) | (~int_leq(K, J))))) <=> ((~int_leq(int_one, K)) | (~int_leq(K, J)))), ((~(int_leq(int_one, K) & int_leq(K, J))) <=> ((~int_leq(int_one, K)) | (~int_leq(K, J))))), (((~(int_leq(int_one, K) & int_leq(K, J))) | (a(K, K) = real_one)) <=> (((~int_leq(int_one, K)) | (~int_leq(K, J))) | (a(K, K) = real_one)))), rewrite((((~int_leq(int_one, K)) | (~int_leq(K, J))) | (a(K, K) = real_one)) <=> ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))), (((~(int_leq(int_one, K) & int_leq(K, J))) | (a(K, K) = real_one)) <=> ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))))), (![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(K, K) = real_one)) <=> ![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J))))), quant_intro(proof_bind(^[C: $i] : trans(monotonicity(trans(monotonicity(rewrite((int_less(int_zero, C) & (J = plus(I, C))) <=> (~((~int_less(int_zero, C)) | (~(J = plus(I, C)))))), ((~(int_less(int_zero, C) & (J = plus(I, C)))) <=> (~(~((~int_less(int_zero, C)) | (~(J = plus(I, C)))))))), rewrite((~(~((~int_less(int_zero, C)) | (~(J = plus(I, C)))))) <=> ((~int_less(int_zero, C)) | (~(J = plus(I, C))))), ((~(int_less(int_zero, C) & (J = plus(I, C)))) <=> ((~int_less(int_zero, C)) | (~(J = plus(I, C)))))), quant_intro(proof_bind(^[K: $i] : trans(monotonicity(trans(monotonicity(rewrite((int_leq(int_one, K) & int_leq(K, I)) <=> (~((~int_leq(int_one, K)) | (~int_leq(K, I))))), ((~(int_leq(int_one, K) & int_leq(K, I))) <=> (~(~((~int_leq(int_one, K)) | (~int_leq(K, I))))))), rewrite((~(~((~int_leq(int_one, K)) | (~int_leq(K, I))))) <=> ((~int_leq(int_one, K)) | (~int_leq(K, I)))), ((~(int_leq(int_one, K) & int_leq(K, I))) <=> ((~int_leq(int_one, K)) | (~int_leq(K, I))))), (((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero)) <=> (((~int_leq(int_one, K)) | (~int_leq(K, I))) | (a(K, plus(K, C)) = real_zero)))), rewrite((((~int_leq(int_one, K)) | (~int_leq(K, I))) | (a(K, plus(K, C)) = real_zero)) <=> ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I)))), (((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero)) <=> ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I)))))), (![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero)) <=> ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I))))), (((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero))) <=> (((~int_less(int_zero, C)) | (~(J = plus(I, C)))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I)))))), rewrite((((~int_less(int_zero, C)) | (~(J = plus(I, C)))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I)))) <=> ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I))))), (((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero))) <=> ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I))))))), (![C: $i] : ((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero))) <=> ![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I)))))), ((![C: $i] : ((~(int_less(int_zero, C) & (I = plus(J, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(plus(K, C), K) = real_zero))) & ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(K, K) = real_one)) & ![C: $i] : ((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero)))) <=> (![C: $i] : ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) & ![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J))) & ![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I))))))), rewrite((![C: $i] : ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) & ![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J))) & ![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I))))) <=> (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I)))))))), ((![C: $i] : ((~(int_less(int_zero, C) & (I = plus(J, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(plus(K, C), K) = real_zero))) & ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(K, K) = real_one)) & ![C: $i] : ((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero)))) <=> (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I))))))))), (((~(int_leq(int_one, I) & int_leq(I, n) & int_leq(int_one, J) & int_leq(J, n))) | (![C: $i] : ((~(int_less(int_zero, C) & (I = plus(J, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(plus(K, C), K) = real_zero))) & ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(K, K) = real_one)) & ![C: $i] : ((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero))))) <=> (((~int_leq(int_one, I)) | (~int_leq(I, n)) | (~int_leq(int_one, J)) | (~int_leq(J, n))) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I)))))))))), rewrite((((~int_leq(int_one, I)) | (~int_leq(I, n)) | (~int_leq(int_one, J)) | (~int_leq(J, n))) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I)))))))) <=> ((~int_leq(int_one, I)) | (~int_leq(I, n)) | (~int_leq(int_one, J)) | (~int_leq(J, n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I))))))))), (((~(int_leq(int_one, I) & int_leq(I, n) & int_leq(int_one, J) & int_leq(J, n))) | (![C: $i] : ((~(int_less(int_zero, C) & (I = plus(J, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(plus(K, C), K) = real_zero))) & ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(K, K) = real_one)) & ![C: $i] : ((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero))))) <=> ((~int_leq(int_one, I)) | (~int_leq(I, n)) | (~int_leq(int_one, J)) | (~int_leq(J, n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I))))))))))),
% 0.20/0.53 inference(bind,[status(th)],[])).
% 0.20/0.53 tff(179,plain,
% 0.20/0.53 (![I: $i, J: $i] : ((~(int_leq(int_one, I) & int_leq(I, n) & int_leq(int_one, J) & int_leq(J, n))) | (![C: $i] : ((~(int_less(int_zero, C) & (I = plus(J, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(plus(K, C), K) = real_zero))) & ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(K, K) = real_one)) & ![C: $i] : ((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero))))) <=> ![I: $i, J: $i] : ((~int_leq(int_one, I)) | (~int_leq(I, n)) | (~int_leq(int_one, J)) | (~int_leq(J, n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I))))))))),
% 0.20/0.53 inference(quant_intro,[status(thm)],[178])).
% 0.20/0.53 tff(180,plain,
% 0.20/0.53 (![I: $i, J: $i] : ((~(int_leq(int_one, I) & int_leq(I, n) & int_leq(int_one, J) & int_leq(J, n))) | (![C: $i] : ((~(int_less(int_zero, C) & (I = plus(J, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(plus(K, C), K) = real_zero))) & ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(K, K) = real_one)) & ![C: $i] : ((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero))))) <=> ![I: $i, J: $i] : ((~(int_leq(int_one, I) & int_leq(I, n) & int_leq(int_one, J) & int_leq(J, n))) | (![C: $i] : ((~(int_less(int_zero, C) & (I = plus(J, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(plus(K, C), K) = real_zero))) & ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(K, K) = real_one)) & ![C: $i] : ((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero)))))),
% 0.20/0.53 inference(rewrite,[status(thm)],[])).
% 0.20/0.53 tff(181,plain,
% 0.20/0.53 (^[I: $i, J: $i] : trans(monotonicity(trans(monotonicity(rewrite(((int_leq(int_one, I) & int_leq(I, n)) & int_leq(int_one, J)) <=> (int_leq(int_one, I) & int_leq(I, n) & int_leq(int_one, J))), ((((int_leq(int_one, I) & int_leq(I, n)) & int_leq(int_one, J)) & int_leq(J, n)) <=> ((int_leq(int_one, I) & int_leq(I, n) & int_leq(int_one, J)) & int_leq(J, n)))), rewrite(((int_leq(int_one, I) & int_leq(I, n) & int_leq(int_one, J)) & int_leq(J, n)) <=> (int_leq(int_one, I) & int_leq(I, n) & int_leq(int_one, J) & int_leq(J, n))), ((((int_leq(int_one, I) & int_leq(I, n)) & int_leq(int_one, J)) & int_leq(J, n)) <=> (int_leq(int_one, I) & int_leq(I, n) & int_leq(int_one, J) & int_leq(J, n)))), trans(monotonicity(rewrite((![C: $i] : ((int_less(int_zero, C) & (I = plus(J, C))) => ![K: $i] : ((int_leq(int_one, K) & int_leq(K, J)) => (a(plus(K, C), K) = real_zero))) & ![K: $i] : ((int_leq(int_one, K) & int_leq(K, J)) => (a(K, K) = real_one))) <=> (![C: $i] : ((~(int_less(int_zero, C) & (I = plus(J, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(plus(K, C), K) = real_zero))) & ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(K, K) = real_one)))), quant_intro(proof_bind(^[C: $i] : trans(monotonicity(quant_intro(proof_bind(^[K: $i] : rewrite(((int_leq(int_one, K) & int_leq(K, I)) => (a(K, plus(K, C)) = real_zero)) <=> ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero)))), (![K: $i] : ((int_leq(int_one, K) & int_leq(K, I)) => (a(K, plus(K, C)) = real_zero)) <=> ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero)))), (((int_less(int_zero, C) & (J = plus(I, C))) => ![K: $i] : ((int_leq(int_one, K) & int_leq(K, I)) => (a(K, plus(K, C)) = real_zero))) <=> ((int_less(int_zero, C) & (J = plus(I, C))) => ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero))))), rewrite(((int_less(int_zero, C) & (J = plus(I, C))) => ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero))) <=> ((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero)))), (((int_less(int_zero, C) & (J = plus(I, C))) => ![K: $i] : ((int_leq(int_one, K) & int_leq(K, I)) => (a(K, plus(K, C)) = real_zero))) <=> ((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero)))))), (![C: $i] : ((int_less(int_zero, C) & (J = plus(I, C))) => ![K: $i] : ((int_leq(int_one, K) & int_leq(K, I)) => (a(K, plus(K, C)) = real_zero))) <=> ![C: $i] : ((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero))))), (((![C: $i] : ((int_less(int_zero, C) & (I = plus(J, C))) => ![K: $i] : ((int_leq(int_one, K) & int_leq(K, J)) => (a(plus(K, C), K) = real_zero))) & ![K: $i] : ((int_leq(int_one, K) & int_leq(K, J)) => (a(K, K) = real_one))) & ![C: $i] : ((int_less(int_zero, C) & (J = plus(I, C))) => ![K: $i] : ((int_leq(int_one, K) & int_leq(K, I)) => (a(K, plus(K, C)) = real_zero)))) <=> ((![C: $i] : ((~(int_less(int_zero, C) & (I = plus(J, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(plus(K, C), K) = real_zero))) & ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(K, K) = real_one))) & ![C: $i] : ((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero)))))), rewrite(((![C: $i] : ((~(int_less(int_zero, C) & (I = plus(J, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(plus(K, C), K) = real_zero))) & ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(K, K) = real_one))) & ![C: $i] : ((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero)))) <=> (![C: $i] : ((~(int_less(int_zero, C) & (I = plus(J, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(plus(K, C), K) = real_zero))) & ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(K, K) = real_one)) & ![C: $i] : ((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero))))), (((![C: $i] : ((int_less(int_zero, C) & (I = plus(J, C))) => ![K: $i] : ((int_leq(int_one, K) & int_leq(K, J)) => (a(plus(K, C), K) = real_zero))) & ![K: $i] : ((int_leq(int_one, K) & int_leq(K, J)) => (a(K, K) = real_one))) & ![C: $i] : ((int_less(int_zero, C) & (J = plus(I, C))) => ![K: $i] : ((int_leq(int_one, K) & int_leq(K, I)) => (a(K, plus(K, C)) = real_zero)))) <=> (![C: $i] : ((~(int_less(int_zero, C) & (I = plus(J, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(plus(K, C), K) = real_zero))) & ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(K, K) = real_one)) & ![C: $i] : ((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero)))))), (((((int_leq(int_one, I) & int_leq(I, n)) & int_leq(int_one, J)) & int_leq(J, n)) => ((![C: $i] : ((int_less(int_zero, C) & (I = plus(J, C))) => ![K: $i] : ((int_leq(int_one, K) & int_leq(K, J)) => (a(plus(K, C), K) = real_zero))) & ![K: $i] : ((int_leq(int_one, K) & int_leq(K, J)) => (a(K, K) = real_one))) & ![C: $i] : ((int_less(int_zero, C) & (J = plus(I, C))) => ![K: $i] : ((int_leq(int_one, K) & int_leq(K, I)) => (a(K, plus(K, C)) = real_zero))))) <=> ((int_leq(int_one, I) & int_leq(I, n) & int_leq(int_one, J) & int_leq(J, n)) => (![C: $i] : ((~(int_less(int_zero, C) & (I = plus(J, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(plus(K, C), K) = real_zero))) & ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(K, K) = real_one)) & ![C: $i] : ((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero))))))), rewrite(((int_leq(int_one, I) & int_leq(I, n) & int_leq(int_one, J) & int_leq(J, n)) => (![C: $i] : ((~(int_less(int_zero, C) & (I = plus(J, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(plus(K, C), K) = real_zero))) & ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(K, K) = real_one)) & ![C: $i] : ((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero))))) <=> ((~(int_leq(int_one, I) & int_leq(I, n) & int_leq(int_one, J) & int_leq(J, n))) | (![C: $i] : ((~(int_less(int_zero, C) & (I = plus(J, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(plus(K, C), K) = real_zero))) & ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(K, K) = real_one)) & ![C: $i] : ((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero)))))), (((((int_leq(int_one, I) & int_leq(I, n)) & int_leq(int_one, J)) & int_leq(J, n)) => ((![C: $i] : ((int_less(int_zero, C) & (I = plus(J, C))) => ![K: $i] : ((int_leq(int_one, K) & int_leq(K, J)) => (a(plus(K, C), K) = real_zero))) & ![K: $i] : ((int_leq(int_one, K) & int_leq(K, J)) => (a(K, K) = real_one))) & ![C: $i] : ((int_less(int_zero, C) & (J = plus(I, C))) => ![K: $i] : ((int_leq(int_one, K) & int_leq(K, I)) => (a(K, plus(K, C)) = real_zero))))) <=> ((~(int_leq(int_one, I) & int_leq(I, n) & int_leq(int_one, J) & int_leq(J, n))) | (![C: $i] : ((~(int_less(int_zero, C) & (I = plus(J, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(plus(K, C), K) = real_zero))) & ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(K, K) = real_one)) & ![C: $i] : ((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero)))))))),
% 0.20/0.54 inference(bind,[status(th)],[])).
% 0.20/0.54 tff(182,plain,
% 0.20/0.54 (![I: $i, J: $i] : ((((int_leq(int_one, I) & int_leq(I, n)) & int_leq(int_one, J)) & int_leq(J, n)) => ((![C: $i] : ((int_less(int_zero, C) & (I = plus(J, C))) => ![K: $i] : ((int_leq(int_one, K) & int_leq(K, J)) => (a(plus(K, C), K) = real_zero))) & ![K: $i] : ((int_leq(int_one, K) & int_leq(K, J)) => (a(K, K) = real_one))) & ![C: $i] : ((int_less(int_zero, C) & (J = plus(I, C))) => ![K: $i] : ((int_leq(int_one, K) & int_leq(K, I)) => (a(K, plus(K, C)) = real_zero))))) <=> ![I: $i, J: $i] : ((~(int_leq(int_one, I) & int_leq(I, n) & int_leq(int_one, J) & int_leq(J, n))) | (![C: $i] : ((~(int_less(int_zero, C) & (I = plus(J, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(plus(K, C), K) = real_zero))) & ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(K, K) = real_one)) & ![C: $i] : ((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero)))))),
% 0.20/0.54 inference(quant_intro,[status(thm)],[181])).
% 0.20/0.54 tff(183,axiom,(![I: $i, J: $i] : ((((int_leq(int_one, I) & int_leq(I, n)) & int_leq(int_one, J)) & int_leq(J, n)) => ((![C: $i] : ((int_less(int_zero, C) & (I = plus(J, C))) => ![K: $i] : ((int_leq(int_one, K) & int_leq(K, J)) => (a(plus(K, C), K) = real_zero))) & ![K: $i] : ((int_leq(int_one, K) & int_leq(K, J)) => (a(K, K) = real_one))) & ![C: $i] : ((int_less(int_zero, C) & (J = plus(I, C))) => ![K: $i] : ((int_leq(int_one, K) & int_leq(K, I)) => (a(K, plus(K, C)) = real_zero)))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','qii')).
% 0.20/0.54 tff(184,plain,
% 0.20/0.54 (![I: $i, J: $i] : ((~(int_leq(int_one, I) & int_leq(I, n) & int_leq(int_one, J) & int_leq(J, n))) | (![C: $i] : ((~(int_less(int_zero, C) & (I = plus(J, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(plus(K, C), K) = real_zero))) & ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(K, K) = real_one)) & ![C: $i] : ((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero)))))),
% 0.20/0.54 inference(modus_ponens,[status(thm)],[183, 182])).
% 0.20/0.54 tff(185,plain,
% 0.20/0.54 (![I: $i, J: $i] : ((~(int_leq(int_one, I) & int_leq(I, n) & int_leq(int_one, J) & int_leq(J, n))) | (![C: $i] : ((~(int_less(int_zero, C) & (I = plus(J, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(plus(K, C), K) = real_zero))) & ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(K, K) = real_one)) & ![C: $i] : ((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero)))))),
% 0.20/0.54 inference(modus_ponens,[status(thm)],[184, 180])).
% 0.20/0.54 tff(186,plain,(
% 0.20/0.54 ![I: $i, J: $i] : ((~(int_leq(int_one, I) & int_leq(I, n) & int_leq(int_one, J) & int_leq(J, n))) | (![C: $i] : ((~(int_less(int_zero, C) & (I = plus(J, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(plus(K, C), K) = real_zero))) & ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(K, K) = real_one)) & ![C: $i] : ((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero)))))),
% 0.20/0.54 inference(skolemize,[status(sab)],[185])).
% 0.20/0.54 tff(187,plain,
% 0.20/0.54 (![I: $i, J: $i] : ((~int_leq(int_one, I)) | (~int_leq(I, n)) | (~int_leq(int_one, J)) | (~int_leq(J, n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I))))))))),
% 0.20/0.54 inference(modus_ponens,[status(thm)],[186, 179])).
% 0.20/0.54 tff(188,plain,
% 0.20/0.54 (![I: $i, J: $i] : ((~int_leq(int_one, I)) | (~int_leq(I, n)) | (~int_leq(int_one, J)) | (~int_leq(J, n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I))))))))),
% 0.20/0.54 inference(modus_ponens,[status(thm)],[187, 177])).
% 0.20/0.54 tff(189,plain,
% 0.20/0.54 (((~![I: $i, J: $i] : ((~int_leq(int_one, I)) | (~int_leq(I, n)) | (~int_leq(int_one, J)) | (~int_leq(J, n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I))))))))) | ((~int_leq(I!2, n)) | (~int_leq(int_one, I!2)) | (~int_leq(int_one, tptp_fun_K_0(J!1, int_zero))) | (~int_leq(tptp_fun_K_0(J!1, int_zero), n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I!2 = plus(tptp_fun_K_0(J!1, int_zero), C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero)))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero))))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(tptp_fun_K_0(J!1, int_zero) = plus(I!2, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I!2))))))))) <=> ((~![I: $i, J: $i] : ((~int_leq(int_one, I)) | (~int_leq(I, n)) | (~int_leq(int_one, J)) | (~int_leq(J, n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I))))))))) | (~int_leq(I!2, n)) | (~int_leq(int_one, I!2)) | (~int_leq(int_one, tptp_fun_K_0(J!1, int_zero))) | (~int_leq(tptp_fun_K_0(J!1, int_zero), n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I!2 = plus(tptp_fun_K_0(J!1, int_zero), C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero)))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero))))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(tptp_fun_K_0(J!1, int_zero) = plus(I!2, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I!2))))))))),
% 0.46/0.54 inference(rewrite,[status(thm)],[])).
% 0.46/0.54 tff(190,plain,
% 0.46/0.54 (((~int_leq(int_one, I!2)) | (~int_leq(I!2, n)) | (~int_leq(int_one, tptp_fun_K_0(J!1, int_zero))) | (~int_leq(tptp_fun_K_0(J!1, int_zero), n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I!2 = plus(tptp_fun_K_0(J!1, int_zero), C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero)))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero))))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(tptp_fun_K_0(J!1, int_zero) = plus(I!2, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I!2)))))))) <=> ((~int_leq(I!2, n)) | (~int_leq(int_one, I!2)) | (~int_leq(int_one, tptp_fun_K_0(J!1, int_zero))) | (~int_leq(tptp_fun_K_0(J!1, int_zero), n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I!2 = plus(tptp_fun_K_0(J!1, int_zero), C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero)))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero))))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(tptp_fun_K_0(J!1, int_zero) = plus(I!2, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I!2))))))))),
% 0.46/0.54 inference(rewrite,[status(thm)],[])).
% 0.46/0.54 tff(191,plain,
% 0.46/0.54 ((~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I!2 = plus(tptp_fun_K_0(J!1, int_zero), C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero)))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero))))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(tptp_fun_K_0(J!1, int_zero) = plus(I!2, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I!2))))))) <=> (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I!2 = plus(tptp_fun_K_0(J!1, int_zero), C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero)))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero))))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(tptp_fun_K_0(J!1, int_zero) = plus(I!2, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I!2)))))))),
% 0.46/0.54 inference(rewrite,[status(thm)],[])).
% 0.46/0.54 tff(192,plain,
% 0.46/0.54 (((~int_leq(int_one, I!2)) | (~int_leq(I!2, n)) | (~int_leq(int_one, tptp_fun_K_0(J!1, int_zero))) | (~int_leq(tptp_fun_K_0(J!1, int_zero), n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I!2 = plus(tptp_fun_K_0(J!1, int_zero), C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero)))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero))))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(tptp_fun_K_0(J!1, int_zero) = plus(I!2, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I!2)))))))) <=> ((~int_leq(int_one, I!2)) | (~int_leq(I!2, n)) | (~int_leq(int_one, tptp_fun_K_0(J!1, int_zero))) | (~int_leq(tptp_fun_K_0(J!1, int_zero), n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I!2 = plus(tptp_fun_K_0(J!1, int_zero), C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero)))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero))))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(tptp_fun_K_0(J!1, int_zero) = plus(I!2, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I!2))))))))),
% 0.46/0.54 inference(monotonicity,[status(thm)],[191])).
% 0.46/0.54 tff(193,plain,
% 0.46/0.54 (((~int_leq(int_one, I!2)) | (~int_leq(I!2, n)) | (~int_leq(int_one, tptp_fun_K_0(J!1, int_zero))) | (~int_leq(tptp_fun_K_0(J!1, int_zero), n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I!2 = plus(tptp_fun_K_0(J!1, int_zero), C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero)))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero))))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(tptp_fun_K_0(J!1, int_zero) = plus(I!2, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I!2)))))))) <=> ((~int_leq(I!2, n)) | (~int_leq(int_one, I!2)) | (~int_leq(int_one, tptp_fun_K_0(J!1, int_zero))) | (~int_leq(tptp_fun_K_0(J!1, int_zero), n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I!2 = plus(tptp_fun_K_0(J!1, int_zero), C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero)))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero))))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(tptp_fun_K_0(J!1, int_zero) = plus(I!2, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I!2))))))))),
% 0.46/0.54 inference(transitivity,[status(thm)],[192, 190])).
% 0.46/0.54 tff(194,plain,
% 0.46/0.54 (((~![I: $i, J: $i] : ((~int_leq(int_one, I)) | (~int_leq(I, n)) | (~int_leq(int_one, J)) | (~int_leq(J, n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I))))))))) | ((~int_leq(int_one, I!2)) | (~int_leq(I!2, n)) | (~int_leq(int_one, tptp_fun_K_0(J!1, int_zero))) | (~int_leq(tptp_fun_K_0(J!1, int_zero), n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I!2 = plus(tptp_fun_K_0(J!1, int_zero), C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero)))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero))))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(tptp_fun_K_0(J!1, int_zero) = plus(I!2, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I!2))))))))) <=> ((~![I: $i, J: $i] : ((~int_leq(int_one, I)) | (~int_leq(I, n)) | (~int_leq(int_one, J)) | (~int_leq(J, n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I))))))))) | ((~int_leq(I!2, n)) | (~int_leq(int_one, I!2)) | (~int_leq(int_one, tptp_fun_K_0(J!1, int_zero))) | (~int_leq(tptp_fun_K_0(J!1, int_zero), n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I!2 = plus(tptp_fun_K_0(J!1, int_zero), C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero)))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero))))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(tptp_fun_K_0(J!1, int_zero) = plus(I!2, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I!2)))))))))),
% 0.46/0.54 inference(monotonicity,[status(thm)],[193])).
% 0.46/0.55 tff(195,plain,
% 0.46/0.55 (((~![I: $i, J: $i] : ((~int_leq(int_one, I)) | (~int_leq(I, n)) | (~int_leq(int_one, J)) | (~int_leq(J, n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I))))))))) | ((~int_leq(int_one, I!2)) | (~int_leq(I!2, n)) | (~int_leq(int_one, tptp_fun_K_0(J!1, int_zero))) | (~int_leq(tptp_fun_K_0(J!1, int_zero), n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I!2 = plus(tptp_fun_K_0(J!1, int_zero), C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero)))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero))))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(tptp_fun_K_0(J!1, int_zero) = plus(I!2, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I!2))))))))) <=> ((~![I: $i, J: $i] : ((~int_leq(int_one, I)) | (~int_leq(I, n)) | (~int_leq(int_one, J)) | (~int_leq(J, n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I))))))))) | (~int_leq(I!2, n)) | (~int_leq(int_one, I!2)) | (~int_leq(int_one, tptp_fun_K_0(J!1, int_zero))) | (~int_leq(tptp_fun_K_0(J!1, int_zero), n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I!2 = plus(tptp_fun_K_0(J!1, int_zero), C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero)))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero))))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(tptp_fun_K_0(J!1, int_zero) = plus(I!2, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I!2))))))))),
% 0.46/0.55 inference(transitivity,[status(thm)],[194, 189])).
% 0.46/0.55 tff(196,plain,
% 0.46/0.55 ((~![I: $i, J: $i] : ((~int_leq(int_one, I)) | (~int_leq(I, n)) | (~int_leq(int_one, J)) | (~int_leq(J, n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I))))))))) | ((~int_leq(int_one, I!2)) | (~int_leq(I!2, n)) | (~int_leq(int_one, tptp_fun_K_0(J!1, int_zero))) | (~int_leq(tptp_fun_K_0(J!1, int_zero), n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I!2 = plus(tptp_fun_K_0(J!1, int_zero), C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero)))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero))))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(tptp_fun_K_0(J!1, int_zero) = plus(I!2, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I!2))))))))),
% 0.46/0.55 inference(quant_inst,[status(thm)],[])).
% 0.46/0.55 tff(197,plain,
% 0.46/0.55 ((~![I: $i, J: $i] : ((~int_leq(int_one, I)) | (~int_leq(I, n)) | (~int_leq(int_one, J)) | (~int_leq(J, n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I))))))))) | (~int_leq(I!2, n)) | (~int_leq(int_one, I!2)) | (~int_leq(int_one, tptp_fun_K_0(J!1, int_zero))) | (~int_leq(tptp_fun_K_0(J!1, int_zero), n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I!2 = plus(tptp_fun_K_0(J!1, int_zero), C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero)))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero))))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(tptp_fun_K_0(J!1, int_zero) = plus(I!2, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I!2)))))))),
% 0.46/0.55 inference(modus_ponens,[status(thm)],[196, 195])).
% 0.46/0.55 tff(198,plain,
% 0.46/0.55 ((~int_leq(I!2, n)) | (~int_leq(tptp_fun_K_0(J!1, int_zero), n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I!2 = plus(tptp_fun_K_0(J!1, int_zero), C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero)))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero))))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(tptp_fun_K_0(J!1, int_zero) = plus(I!2, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I!2)))))))),
% 0.46/0.55 inference(unit_resolution,[status(thm)],[197, 188, 72, 172])).
% 0.46/0.55 tff(199,plain,
% 0.46/0.55 ((~int_leq(I!2, n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I!2 = plus(tptp_fun_K_0(J!1, int_zero), C))) | ![K: $i] : ((a(plus(K, C), K) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero)))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero))))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(tptp_fun_K_0(J!1, int_zero) = plus(I!2, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I!2)))))))),
% 0.46/0.55 inference(unit_resolution,[status(thm)],[198, 165])).
% 0.46/0.55 tff(200,plain,
% 0.46/0.55 (~int_leq(I!2, n)),
% 0.46/0.55 inference(unit_resolution,[status(thm)],[199, 160])).
% 0.46/0.55 tff(201,plain,
% 0.46/0.55 ((~(int_leq(I!2, n) <=> ((I!2 = n) | int_less(I!2, n)))) | int_leq(I!2, n) | (~((I!2 = n) | int_less(I!2, n)))),
% 0.46/0.55 inference(tautology,[status(thm)],[])).
% 0.46/0.55 tff(202,plain,
% 0.46/0.55 ((~(int_leq(I!2, n) <=> ((I!2 = n) | int_less(I!2, n)))) | (~((I!2 = n) | int_less(I!2, n)))),
% 0.46/0.55 inference(unit_resolution,[status(thm)],[201, 200])).
% 0.46/0.55 tff(203,plain,
% 0.46/0.55 (~((I!2 = n) | int_less(I!2, n))),
% 0.46/0.55 inference(unit_resolution,[status(thm)],[202, 12])).
% 0.46/0.55 tff(204,plain,
% 0.46/0.55 (((I!2 = n) | int_less(I!2, n)) | (~int_less(I!2, n))),
% 0.46/0.55 inference(tautology,[status(thm)],[])).
% 0.46/0.55 tff(205,plain,
% 0.46/0.55 (~int_less(I!2, n)),
% 0.46/0.55 inference(unit_resolution,[status(thm)],[204, 203])).
% 0.46/0.55 tff(206,plain,
% 0.46/0.55 ((n = J!1) <=> (J!1 = n)),
% 0.46/0.55 inference(commutativity,[status(thm)],[])).
% 0.46/0.55 tff(207,plain,
% 0.46/0.55 ((~(n = J!1)) <=> (~(J!1 = n))),
% 0.46/0.55 inference(monotonicity,[status(thm)],[206])).
% 0.46/0.55 tff(208,plain,
% 0.46/0.55 (^[I: $i, J: $i] : refl((int_leq(J, I) | int_less(I, J)) <=> (int_leq(J, I) | int_less(I, J)))),
% 0.46/0.55 inference(bind,[status(th)],[])).
% 0.46/0.55 tff(209,plain,
% 0.46/0.55 (![I: $i, J: $i] : (int_leq(J, I) | int_less(I, J)) <=> ![I: $i, J: $i] : (int_leq(J, I) | int_less(I, J))),
% 0.46/0.55 inference(quant_intro,[status(thm)],[208])).
% 0.46/0.55 tff(210,plain,
% 0.46/0.55 (![I: $i, J: $i] : (int_leq(J, I) | int_less(I, J)) <=> ![I: $i, J: $i] : (int_leq(J, I) | int_less(I, J))),
% 0.46/0.55 inference(rewrite,[status(thm)],[])).
% 0.46/0.55 tff(211,plain,
% 0.46/0.55 (^[I: $i, J: $i] : rewrite((int_less(I, J) | int_leq(J, I)) <=> (int_leq(J, I) | int_less(I, J)))),
% 0.46/0.55 inference(bind,[status(th)],[])).
% 0.46/0.55 tff(212,plain,
% 0.46/0.55 (![I: $i, J: $i] : (int_less(I, J) | int_leq(J, I)) <=> ![I: $i, J: $i] : (int_leq(J, I) | int_less(I, J))),
% 0.46/0.55 inference(quant_intro,[status(thm)],[211])).
% 0.46/0.55 tff(213,axiom,(![I: $i, J: $i] : (int_less(I, J) | int_leq(J, I))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','int_less_total')).
% 0.46/0.55 tff(214,plain,
% 0.46/0.55 (![I: $i, J: $i] : (int_leq(J, I) | int_less(I, J))),
% 0.46/0.55 inference(modus_ponens,[status(thm)],[213, 212])).
% 0.46/0.55 tff(215,plain,
% 0.46/0.55 (![I: $i, J: $i] : (int_leq(J, I) | int_less(I, J))),
% 0.46/0.55 inference(modus_ponens,[status(thm)],[214, 210])).
% 0.46/0.55 tff(216,plain,(
% 0.46/0.55 ![I: $i, J: $i] : (int_leq(J, I) | int_less(I, J))),
% 0.46/0.55 inference(skolemize,[status(sab)],[215])).
% 0.46/0.55 tff(217,plain,
% 0.46/0.55 (![I: $i, J: $i] : (int_leq(J, I) | int_less(I, J))),
% 0.46/0.55 inference(modus_ponens,[status(thm)],[216, 209])).
% 0.46/0.55 tff(218,plain,
% 0.46/0.55 (((~![I: $i, J: $i] : (int_leq(J, I) | int_less(I, J))) | (int_leq(I!2, n) | int_less(n, I!2))) <=> ((~![I: $i, J: $i] : (int_leq(J, I) | int_less(I, J))) | int_leq(I!2, n) | int_less(n, I!2))),
% 0.46/0.55 inference(rewrite,[status(thm)],[])).
% 0.46/0.55 tff(219,plain,
% 0.46/0.55 ((~![I: $i, J: $i] : (int_leq(J, I) | int_less(I, J))) | (int_leq(I!2, n) | int_less(n, I!2))),
% 0.46/0.55 inference(quant_inst,[status(thm)],[])).
% 0.46/0.55 tff(220,plain,
% 0.46/0.55 ((~![I: $i, J: $i] : (int_leq(J, I) | int_less(I, J))) | int_leq(I!2, n) | int_less(n, I!2)),
% 0.46/0.55 inference(modus_ponens,[status(thm)],[219, 218])).
% 0.46/0.55 tff(221,plain,
% 0.46/0.55 (int_less(n, I!2)),
% 0.46/0.55 inference(unit_resolution,[status(thm)],[220, 217, 200])).
% 0.46/0.55 tff(222,plain,
% 0.46/0.55 (((~![I: $i, J: $i, K: $i] : (int_less(I, K) | (~int_less(J, K)) | (~int_less(I, J)))) | ((~int_less(I!2, J!1)) | (~int_less(n, I!2)) | int_less(n, J!1))) <=> ((~![I: $i, J: $i, K: $i] : (int_less(I, K) | (~int_less(J, K)) | (~int_less(I, J)))) | (~int_less(I!2, J!1)) | (~int_less(n, I!2)) | int_less(n, J!1))),
% 0.46/0.55 inference(rewrite,[status(thm)],[])).
% 0.46/0.55 tff(223,plain,
% 0.46/0.55 ((int_less(n, J!1) | (~int_less(I!2, J!1)) | (~int_less(n, I!2))) <=> ((~int_less(I!2, J!1)) | (~int_less(n, I!2)) | int_less(n, J!1))),
% 0.46/0.55 inference(rewrite,[status(thm)],[])).
% 0.46/0.55 tff(224,plain,
% 0.46/0.55 (((~![I: $i, J: $i, K: $i] : (int_less(I, K) | (~int_less(J, K)) | (~int_less(I, J)))) | (int_less(n, J!1) | (~int_less(I!2, J!1)) | (~int_less(n, I!2)))) <=> ((~![I: $i, J: $i, K: $i] : (int_less(I, K) | (~int_less(J, K)) | (~int_less(I, J)))) | ((~int_less(I!2, J!1)) | (~int_less(n, I!2)) | int_less(n, J!1)))),
% 0.46/0.55 inference(monotonicity,[status(thm)],[223])).
% 0.46/0.55 tff(225,plain,
% 0.46/0.55 (((~![I: $i, J: $i, K: $i] : (int_less(I, K) | (~int_less(J, K)) | (~int_less(I, J)))) | (int_less(n, J!1) | (~int_less(I!2, J!1)) | (~int_less(n, I!2)))) <=> ((~![I: $i, J: $i, K: $i] : (int_less(I, K) | (~int_less(J, K)) | (~int_less(I, J)))) | (~int_less(I!2, J!1)) | (~int_less(n, I!2)) | int_less(n, J!1))),
% 0.46/0.55 inference(transitivity,[status(thm)],[224, 222])).
% 0.46/0.55 tff(226,plain,
% 0.46/0.55 ((~![I: $i, J: $i, K: $i] : (int_less(I, K) | (~int_less(J, K)) | (~int_less(I, J)))) | (int_less(n, J!1) | (~int_less(I!2, J!1)) | (~int_less(n, I!2)))),
% 0.46/0.55 inference(quant_inst,[status(thm)],[])).
% 0.46/0.55 tff(227,plain,
% 0.46/0.55 ((~![I: $i, J: $i, K: $i] : (int_less(I, K) | (~int_less(J, K)) | (~int_less(I, J)))) | (~int_less(I!2, J!1)) | (~int_less(n, I!2)) | int_less(n, J!1)),
% 0.46/0.55 inference(modus_ponens,[status(thm)],[226, 225])).
% 0.46/0.55 tff(228,plain,
% 0.46/0.55 (int_less(n, J!1)),
% 0.46/0.55 inference(unit_resolution,[status(thm)],[227, 87, 47, 221])).
% 0.46/0.55 tff(229,plain,
% 0.46/0.55 (^[I: $i, J: $i] : refl(((~(I = J)) | (~int_less(I, J))) <=> ((~(I = J)) | (~int_less(I, J))))),
% 0.46/0.55 inference(bind,[status(th)],[])).
% 0.46/0.55 tff(230,plain,
% 0.46/0.55 (![I: $i, J: $i] : ((~(I = J)) | (~int_less(I, J))) <=> ![I: $i, J: $i] : ((~(I = J)) | (~int_less(I, J)))),
% 0.46/0.55 inference(quant_intro,[status(thm)],[229])).
% 0.46/0.55 tff(231,plain,
% 0.46/0.55 (![I: $i, J: $i] : ((~(I = J)) | (~int_less(I, J))) <=> ![I: $i, J: $i] : ((~(I = J)) | (~int_less(I, J)))),
% 0.46/0.55 inference(rewrite,[status(thm)],[])).
% 0.46/0.55 tff(232,plain,
% 0.46/0.55 (^[I: $i, J: $i] : rewrite((int_less(I, J) => (~(I = J))) <=> ((~(I = J)) | (~int_less(I, J))))),
% 0.46/0.55 inference(bind,[status(th)],[])).
% 0.46/0.55 tff(233,plain,
% 0.46/0.55 (![I: $i, J: $i] : (int_less(I, J) => (~(I = J))) <=> ![I: $i, J: $i] : ((~(I = J)) | (~int_less(I, J)))),
% 0.46/0.55 inference(quant_intro,[status(thm)],[232])).
% 0.46/0.55 tff(234,axiom,(![I: $i, J: $i] : (int_less(I, J) => (~(I = J)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','int_less_irreflexive')).
% 0.46/0.55 tff(235,plain,
% 0.46/0.55 (![I: $i, J: $i] : ((~(I = J)) | (~int_less(I, J)))),
% 0.46/0.55 inference(modus_ponens,[status(thm)],[234, 233])).
% 0.46/0.55 tff(236,plain,
% 0.46/0.55 (![I: $i, J: $i] : ((~(I = J)) | (~int_less(I, J)))),
% 0.46/0.55 inference(modus_ponens,[status(thm)],[235, 231])).
% 0.46/0.55 tff(237,plain,(
% 0.46/0.55 ![I: $i, J: $i] : ((~(I = J)) | (~int_less(I, J)))),
% 0.46/0.55 inference(skolemize,[status(sab)],[236])).
% 0.46/0.55 tff(238,plain,
% 0.46/0.55 (![I: $i, J: $i] : ((~(I = J)) | (~int_less(I, J)))),
% 0.46/0.55 inference(modus_ponens,[status(thm)],[237, 230])).
% 0.46/0.55 tff(239,plain,
% 0.46/0.55 (((~![I: $i, J: $i] : ((~(I = J)) | (~int_less(I, J)))) | ((~(n = J!1)) | (~int_less(n, J!1)))) <=> ((~![I: $i, J: $i] : ((~(I = J)) | (~int_less(I, J)))) | (~(n = J!1)) | (~int_less(n, J!1)))),
% 0.46/0.55 inference(rewrite,[status(thm)],[])).
% 0.46/0.55 tff(240,plain,
% 0.46/0.55 ((~![I: $i, J: $i] : ((~(I = J)) | (~int_less(I, J)))) | ((~(n = J!1)) | (~int_less(n, J!1)))),
% 0.46/0.55 inference(quant_inst,[status(thm)],[])).
% 0.46/0.55 tff(241,plain,
% 0.46/0.55 ((~![I: $i, J: $i] : ((~(I = J)) | (~int_less(I, J)))) | (~(n = J!1)) | (~int_less(n, J!1))),
% 0.46/0.55 inference(modus_ponens,[status(thm)],[240, 239])).
% 0.46/0.55 tff(242,plain,
% 0.46/0.55 (~(n = J!1)),
% 0.46/0.55 inference(unit_resolution,[status(thm)],[241, 238, 228])).
% 0.46/0.55 tff(243,plain,
% 0.46/0.55 (~(J!1 = n)),
% 0.46/0.55 inference(modus_ponens,[status(thm)],[242, 207])).
% 0.46/0.55 tff(244,plain,
% 0.46/0.55 ((~![I: $i, J: $i] : (int_leq(I, J) <=> ((I = J) | int_less(I, J)))) | (int_leq(J!1, n) <=> ((J!1 = n) | int_less(J!1, n)))),
% 0.46/0.55 inference(quant_inst,[status(thm)],[])).
% 0.46/0.55 tff(245,plain,
% 0.46/0.55 (int_leq(J!1, n) <=> ((J!1 = n) | int_less(J!1, n))),
% 0.46/0.55 inference(unit_resolution,[status(thm)],[244, 10])).
% 0.46/0.55 tff(246,plain,
% 0.46/0.55 ((~(int_leq(J!1, n) <=> ((J!1 = n) | int_less(J!1, n)))) | (~int_leq(J!1, n)) | ((J!1 = n) | int_less(J!1, n))),
% 0.46/0.55 inference(tautology,[status(thm)],[])).
% 0.46/0.55 tff(247,plain,
% 0.46/0.55 ((~(int_leq(J!1, n) <=> ((J!1 = n) | int_less(J!1, n)))) | ((J!1 = n) | int_less(J!1, n))),
% 0.46/0.55 inference(unit_resolution,[status(thm)],[246, 164])).
% 0.46/0.55 tff(248,plain,
% 0.46/0.55 ((J!1 = n) | int_less(J!1, n)),
% 0.46/0.55 inference(unit_resolution,[status(thm)],[247, 245])).
% 0.46/0.55 tff(249,plain,
% 0.46/0.55 ((~((J!1 = n) | int_less(J!1, n))) | (J!1 = n) | int_less(J!1, n)),
% 0.46/0.55 inference(tautology,[status(thm)],[])).
% 0.46/0.55 tff(250,plain,
% 0.46/0.55 ((J!1 = n) | int_less(J!1, n)),
% 0.46/0.55 inference(unit_resolution,[status(thm)],[249, 248])).
% 0.46/0.55 tff(251,plain,
% 0.46/0.55 (int_less(J!1, n)),
% 0.46/0.55 inference(unit_resolution,[status(thm)],[250, 243])).
% 0.46/0.55 tff(252,plain,
% 0.46/0.55 (((~![I: $i, J: $i, K: $i] : (int_less(I, K) | (~int_less(J, K)) | (~int_less(I, J)))) | ((~int_less(J!1, n)) | (~int_less(I!2, J!1)) | int_less(I!2, n))) <=> ((~![I: $i, J: $i, K: $i] : (int_less(I, K) | (~int_less(J, K)) | (~int_less(I, J)))) | (~int_less(J!1, n)) | (~int_less(I!2, J!1)) | int_less(I!2, n))),
% 0.46/0.55 inference(rewrite,[status(thm)],[])).
% 0.46/0.55 tff(253,plain,
% 0.46/0.55 ((int_less(I!2, n) | (~int_less(J!1, n)) | (~int_less(I!2, J!1))) <=> ((~int_less(J!1, n)) | (~int_less(I!2, J!1)) | int_less(I!2, n))),
% 0.46/0.55 inference(rewrite,[status(thm)],[])).
% 0.46/0.55 tff(254,plain,
% 0.46/0.55 (((~![I: $i, J: $i, K: $i] : (int_less(I, K) | (~int_less(J, K)) | (~int_less(I, J)))) | (int_less(I!2, n) | (~int_less(J!1, n)) | (~int_less(I!2, J!1)))) <=> ((~![I: $i, J: $i, K: $i] : (int_less(I, K) | (~int_less(J, K)) | (~int_less(I, J)))) | ((~int_less(J!1, n)) | (~int_less(I!2, J!1)) | int_less(I!2, n)))),
% 0.46/0.55 inference(monotonicity,[status(thm)],[253])).
% 0.46/0.55 tff(255,plain,
% 0.46/0.55 (((~![I: $i, J: $i, K: $i] : (int_less(I, K) | (~int_less(J, K)) | (~int_less(I, J)))) | (int_less(I!2, n) | (~int_less(J!1, n)) | (~int_less(I!2, J!1)))) <=> ((~![I: $i, J: $i, K: $i] : (int_less(I, K) | (~int_less(J, K)) | (~int_less(I, J)))) | (~int_less(J!1, n)) | (~int_less(I!2, J!1)) | int_less(I!2, n))),
% 0.46/0.55 inference(transitivity,[status(thm)],[254, 252])).
% 0.46/0.55 tff(256,plain,
% 0.46/0.55 ((~![I: $i, J: $i, K: $i] : (int_less(I, K) | (~int_less(J, K)) | (~int_less(I, J)))) | (int_less(I!2, n) | (~int_less(J!1, n)) | (~int_less(I!2, J!1)))),
% 0.46/0.55 inference(quant_inst,[status(thm)],[])).
% 0.46/0.55 tff(257,plain,
% 0.46/0.55 ((~![I: $i, J: $i, K: $i] : (int_less(I, K) | (~int_less(J, K)) | (~int_less(I, J)))) | (~int_less(J!1, n)) | (~int_less(I!2, J!1)) | int_less(I!2, n)),
% 0.46/0.55 inference(modus_ponens,[status(thm)],[256, 255])).
% 0.46/0.55 tff(258,plain,
% 0.46/0.55 ($false),
% 0.46/0.55 inference(unit_resolution,[status(thm)],[257, 87, 47, 251, 205])).
% 0.46/0.55 % SZS output end Proof
%------------------------------------------------------------------------------