%------------------------------------------------------------------------------
% File : Z3---4.15.1
% Problem : SWV486+1 : TPTP v9.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_E %s %d THM
% Computer : n014.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 : Sat Jun 21 05:34:09 AM UTC 2025
% Result : Theorem 0.93s 1.18s
% Output : Proof 1.03s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWV486+1 : TPTP v9.0.0. Released v4.0.0.
% 0.11/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n014.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Fri Jun 20 09:52:39 EDT 2025
% 0.11/0.33 % CPUTime :
% 0.93/1.18 % SZS status Theorem
% 0.93/1.18 % SZS output start Proof
% 0.93/1.18 tff(int_less_type, type, (
% 0.93/1.18 int_less: ( $i * $i ) > $o)).
% 0.93/1.18 tff(n_type, type, (
% 0.93/1.18 n: $i)).
% 0.93/1.18 tff(tptp_fun_I_2_type, type, (
% 0.93/1.18 tptp_fun_I_2: $i)).
% 0.93/1.18 tff(int_leq_type, type, (
% 0.93/1.18 int_leq: ( $i * $i ) > $o)).
% 0.93/1.18 tff(tptp_fun_K_0_type, type, (
% 0.93/1.18 tptp_fun_K_0: ( $i * $i ) > $i)).
% 0.93/1.18 tff(int_zero_type, type, (
% 0.93/1.18 int_zero: $i)).
% 0.93/1.18 tff(tptp_fun_J_1_type, type, (
% 0.93/1.18 tptp_fun_J_1: $i)).
% 0.93/1.18 tff(int_one_type, type, (
% 0.93/1.18 int_one: $i)).
% 0.93/1.18 tff(qr_type, type, (
% 0.93/1.18 qr: ( $i * $i ) > $i)).
% 0.93/1.18 tff(plus_type, type, (
% 0.93/1.18 plus: ( $i * $i ) > $i)).
% 0.93/1.18 tff(a_type, type, (
% 0.93/1.18 a: ( $i * $i ) > $i)).
% 0.93/1.18 tff(real_zero_type, type, (
% 0.93/1.18 real_zero: $i)).
% 0.93/1.18 tff(1,plain,
% 0.93/1.18 (^[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.93/1.18 inference(bind,[status(th)],[])).
% 0.93/1.18 tff(2,plain,
% 0.93/1.18 (![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.93/1.18 inference(quant_intro,[status(thm)],[1])).
% 0.93/1.18 tff(3,plain,
% 0.93/1.18 (![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.93/1.18 inference(rewrite,[status(thm)],[])).
% 0.93/1.18 tff(4,plain,
% 0.93/1.18 (^[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.93/1.18 inference(bind,[status(th)],[])).
% 0.93/1.18 tff(5,plain,
% 0.93/1.18 (![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.93/1.18 inference(quant_intro,[status(thm)],[4])).
% 0.93/1.18 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.93/1.18 tff(7,plain,
% 0.93/1.18 (![I: $i, J: $i] : (int_leq(I, J) <=> ((I = J) | int_less(I, J)))),
% 0.93/1.18 inference(modus_ponens,[status(thm)],[6, 5])).
% 0.93/1.18 tff(8,plain,
% 0.93/1.18 (![I: $i, J: $i] : (int_leq(I, J) <=> ((I = J) | int_less(I, J)))),
% 0.93/1.18 inference(modus_ponens,[status(thm)],[7, 3])).
% 0.93/1.18 tff(9,plain,(
% 0.93/1.18 ![I: $i, J: $i] : (int_leq(I, J) <=> ((I = J) | int_less(I, J)))),
% 0.93/1.18 inference(skolemize,[status(sab)],[8])).
% 0.93/1.18 tff(10,plain,
% 0.93/1.18 (![I: $i, J: $i] : (int_leq(I, J) <=> ((I = J) | int_less(I, J)))),
% 0.93/1.18 inference(modus_ponens,[status(thm)],[9, 2])).
% 0.93/1.18 tff(11,plain,
% 0.93/1.18 ((~![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.93/1.18 inference(quant_inst,[status(thm)],[])).
% 0.93/1.18 tff(12,plain,
% 0.93/1.18 (int_leq(I!2, n) <=> ((I!2 = n) | int_less(I!2, n))),
% 0.93/1.18 inference(unit_resolution,[status(thm)],[11, 10])).
% 0.93/1.18 tff(13,plain,
% 0.93/1.18 (^[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.93/1.18 inference(bind,[status(th)],[])).
% 0.93/1.18 tff(14,plain,
% 0.93/1.18 (![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.93/1.18 inference(quant_intro,[status(thm)],[13])).
% 0.93/1.18 tff(15,plain,
% 0.93/1.18 (^[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.93/1.18 inference(bind,[status(th)],[])).
% 0.93/1.18 tff(16,plain,
% 0.93/1.18 (![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.93/1.18 inference(quant_intro,[status(thm)],[15])).
% 0.93/1.18 tff(17,plain,
% 0.93/1.18 (![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.93/1.18 inference(transitivity,[status(thm)],[16, 14])).
% 0.93/1.18 tff(18,plain,
% 0.93/1.18 (^[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.93/1.18 inference(bind,[status(th)],[])).
% 0.93/1.18 tff(19,plain,
% 0.93/1.18 (![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.93/1.18 inference(quant_intro,[status(thm)],[18])).
% 0.93/1.18 tff(20,plain,
% 0.93/1.18 (![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.93/1.18 inference(rewrite,[status(thm)],[])).
% 0.93/1.18 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.93/1.18 tff(22,plain,
% 0.93/1.18 (![I: $i, J: $i] : (int_less(I, J) <=> ?[K: $i] : ((plus(I, K) = J) & int_less(int_zero, K)))),
% 0.93/1.18 inference(modus_ponens,[status(thm)],[21, 20])).
% 0.93/1.18 tff(23,plain,(
% 0.93/1.18 ![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.93/1.18 inference(skolemize,[status(sab)],[22])).
% 0.93/1.18 tff(24,plain,
% 0.93/1.18 (![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.93/1.18 inference(modus_ponens,[status(thm)],[23, 19])).
% 0.93/1.18 tff(25,plain,
% 0.93/1.18 (![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.93/1.18 inference(modus_ponens,[status(thm)],[24, 17])).
% 0.93/1.18 tff(26,plain,
% 0.93/1.18 (((~![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)) | (~((~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(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)) | (~((~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(I!2, J!1) | ![K: $i] : ((~int_less(int_zero, K)) | (~(plus(I!2, K) = J!1))))))))),
% 0.93/1.18 inference(rewrite,[status(thm)],[])).
% 0.93/1.18 tff(27,plain,
% 0.93/1.18 ((~((~((~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)) | (~((~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(I!2, J!1) | ![K: $i] : ((~int_less(int_zero, K)) | (~(plus(I!2, K) = J!1)))))))),
% 0.93/1.18 inference(rewrite,[status(thm)],[])).
% 0.93/1.18 tff(28,plain,
% 0.93/1.18 (((~![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)) | (~((~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(I!2, J!1) | ![K: $i] : ((~int_less(int_zero, K)) | (~(plus(I!2, K) = J!1))))))))),
% 0.93/1.18 inference(monotonicity,[status(thm)],[27])).
% 0.93/1.18 tff(29,plain,
% 0.93/1.18 (((~![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)) | (~((~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(I!2, J!1) | ![K: $i] : ((~int_less(int_zero, K)) | (~(plus(I!2, K) = J!1))))))))),
% 0.93/1.18 inference(transitivity,[status(thm)],[28, 26])).
% 0.93/1.18 tff(30,plain,
% 0.93/1.18 ((~![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)))))))),
% 1.02/1.19 inference(quant_inst,[status(thm)],[])).
% 1.02/1.19 tff(31,plain,
% 1.02/1.19 ((~![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)) | (~((~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(I!2, J!1) | ![K: $i] : ((~int_less(int_zero, K)) | (~(plus(I!2, K) = J!1)))))))),
% 1.02/1.19 inference(modus_ponens,[status(thm)],[30, 29])).
% 1.02/1.19 tff(32,plain,
% 1.02/1.19 (~((~((~int_less(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(I!2, J!1) | ![K: $i] : ((~int_less(int_zero, K)) | (~(plus(I!2, K) = J!1))))))),
% 1.02/1.19 inference(unit_resolution,[status(thm)],[31, 25])).
% 1.02/1.19 tff(33,plain,
% 1.02/1.19 (((~((~int_less(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(I!2, J!1) | ![K: $i] : ((~int_less(int_zero, K)) | (~(plus(I!2, K) = J!1)))))) | ((~int_less(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)))))),
% 1.02/1.19 inference(tautology,[status(thm)],[])).
% 1.02/1.19 tff(34,plain,
% 1.02/1.19 ((~int_less(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))))),
% 1.02/1.19 inference(unit_resolution,[status(thm)],[33, 32])).
% 1.02/1.19 tff(35,plain,
% 1.02/1.19 ((~![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)))),
% 1.02/1.19 inference(rewrite,[status(thm)],[])).
% 1.02/1.19 tff(36,plain,
% 1.02/1.19 ((~![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)))),
% 1.02/1.19 inference(rewrite,[status(thm)],[])).
% 1.02/1.19 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')).
% 1.02/1.19 tff(38,plain,
% 1.02/1.19 (~![I: $i, J: $i] : ((~(int_leq(int_one, I) & int_less(I, J) & int_leq(J, n))) | (a(I, J) = real_zero))),
% 1.02/1.19 inference(modus_ponens,[status(thm)],[37, 36])).
% 1.02/1.19 tff(39,plain,
% 1.02/1.19 (~![I: $i, J: $i] : ((~(int_leq(int_one, I) & int_less(I, J) & int_leq(J, n))) | (a(I, J) = real_zero))),
% 1.02/1.19 inference(modus_ponens,[status(thm)],[38, 35])).
% 1.02/1.19 tff(40,plain,
% 1.02/1.19 (~![I: $i, J: $i] : ((~(int_leq(int_one, I) & int_less(I, J) & int_leq(J, n))) | (a(I, J) = real_zero))),
% 1.02/1.19 inference(modus_ponens,[status(thm)],[39, 35])).
% 1.02/1.19 tff(41,plain,
% 1.02/1.19 (~![I: $i, J: $i] : ((~(int_leq(int_one, I) & int_less(I, J) & int_leq(J, n))) | (a(I, J) = real_zero))),
% 1.02/1.19 inference(modus_ponens,[status(thm)],[40, 35])).
% 1.02/1.19 tff(42,plain,(
% 1.02/1.19 ~((~(int_leq(int_one, I!2) & int_less(I!2, J!1) & int_leq(J!1, n))) | (a(I!2, J!1) = real_zero))),
% 1.02/1.19 inference(skolemize,[status(sab)],[41])).
% 1.02/1.19 tff(43,plain,
% 1.02/1.19 (int_leq(int_one, I!2) & int_less(I!2, J!1) & int_leq(J!1, n)),
% 1.02/1.19 inference(or_elim,[status(thm)],[42])).
% 1.02/1.19 tff(44,plain,
% 1.02/1.19 (int_less(I!2, J!1)),
% 1.02/1.19 inference(and_elim,[status(thm)],[43])).
% 1.02/1.19 tff(45,plain,
% 1.02/1.19 ((~((~int_less(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(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))))),
% 1.02/1.19 inference(tautology,[status(thm)],[])).
% 1.02/1.19 tff(46,plain,
% 1.02/1.19 ((~((~int_less(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))) | (~(plus(I!2, tptp_fun_K_0(J!1, I!2)) = J!1))))),
% 1.02/1.19 inference(unit_resolution,[status(thm)],[45, 44])).
% 1.02/1.19 tff(47,plain,
% 1.02/1.19 (~((~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)))),
% 1.02/1.19 inference(unit_resolution,[status(thm)],[46, 34])).
% 1.02/1.19 tff(48,plain,
% 1.02/1.19 (((~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))) | (plus(I!2, tptp_fun_K_0(J!1, I!2)) = J!1)),
% 1.02/1.19 inference(tautology,[status(thm)],[])).
% 1.02/1.19 tff(49,plain,
% 1.02/1.19 (plus(I!2, tptp_fun_K_0(J!1, I!2)) = J!1),
% 1.02/1.19 inference(unit_resolution,[status(thm)],[48, 47])).
% 1.02/1.19 tff(50,plain,
% 1.02/1.19 (J!1 = plus(I!2, tptp_fun_K_0(J!1, I!2))),
% 1.02/1.19 inference(symmetry,[status(thm)],[49])).
% 1.02/1.19 tff(51,plain,
% 1.02/1.19 (((~![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)) | (~((~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, 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)) | (~((~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, J!1) | ![K: $i] : ((~int_less(int_zero, K)) | (~(plus(int_zero, K) = J!1))))))))),
% 1.02/1.19 inference(rewrite,[status(thm)],[])).
% 1.02/1.19 tff(52,plain,
% 1.02/1.19 ((~((~((~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)) | (~((~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, J!1) | ![K: $i] : ((~int_less(int_zero, K)) | (~(plus(int_zero, K) = J!1)))))))),
% 1.02/1.19 inference(rewrite,[status(thm)],[])).
% 1.02/1.19 tff(53,plain,
% 1.02/1.19 (((~![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)) | (~((~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, J!1) | ![K: $i] : ((~int_less(int_zero, K)) | (~(plus(int_zero, K) = J!1))))))))),
% 1.02/1.19 inference(monotonicity,[status(thm)],[52])).
% 1.02/1.19 tff(54,plain,
% 1.02/1.19 (((~![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)) | (~((~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, J!1) | ![K: $i] : ((~int_less(int_zero, K)) | (~(plus(int_zero, K) = J!1))))))))),
% 1.02/1.19 inference(transitivity,[status(thm)],[53, 51])).
% 1.02/1.19 tff(55,plain,
% 1.02/1.19 ((~![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)))))))),
% 1.02/1.19 inference(quant_inst,[status(thm)],[])).
% 1.02/1.19 tff(56,plain,
% 1.02/1.19 ((~![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)) | (~((~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, J!1) | ![K: $i] : ((~int_less(int_zero, K)) | (~(plus(int_zero, K) = J!1)))))))),
% 1.02/1.19 inference(modus_ponens,[status(thm)],[55, 54])).
% 1.02/1.19 tff(57,plain,
% 1.02/1.19 (~((~((~int_less(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, J!1) | ![K: $i] : ((~int_less(int_zero, K)) | (~(plus(int_zero, K) = J!1))))))),
% 1.02/1.19 inference(unit_resolution,[status(thm)],[56, 25])).
% 1.02/1.19 tff(58,plain,
% 1.02/1.19 (((~((~int_less(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, J!1) | ![K: $i] : ((~int_less(int_zero, K)) | (~(plus(int_zero, K) = J!1)))))) | ((~int_less(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)))))),
% 1.02/1.19 inference(tautology,[status(thm)],[])).
% 1.02/1.19 tff(59,plain,
% 1.02/1.19 ((~int_less(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))))),
% 1.02/1.19 inference(unit_resolution,[status(thm)],[58, 57])).
% 1.02/1.19 tff(60,plain,
% 1.02/1.19 (^[I: $i] : refl((int_less(int_zero, I) <=> int_leq(int_one, I)) <=> (int_less(int_zero, I) <=> int_leq(int_one, I)))),
% 1.02/1.19 inference(bind,[status(th)],[])).
% 1.02/1.19 tff(61,plain,
% 1.02/1.19 (![I: $i] : (int_less(int_zero, I) <=> int_leq(int_one, I)) <=> ![I: $i] : (int_less(int_zero, I) <=> int_leq(int_one, I))),
% 1.02/1.19 inference(quant_intro,[status(thm)],[60])).
% 1.02/1.19 tff(62,plain,
% 1.02/1.19 (![I: $i] : (int_less(int_zero, I) <=> int_leq(int_one, I)) <=> ![I: $i] : (int_less(int_zero, I) <=> int_leq(int_one, I))),
% 1.02/1.19 inference(rewrite,[status(thm)],[])).
% 1.02/1.19 tff(63,axiom,(![I: $i] : (int_less(int_zero, I) <=> int_leq(int_one, I))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','one_successor_of_zero')).
% 1.02/1.19 tff(64,plain,
% 1.02/1.19 (![I: $i] : (int_less(int_zero, I) <=> int_leq(int_one, I))),
% 1.02/1.19 inference(modus_ponens,[status(thm)],[63, 62])).
% 1.02/1.19 tff(65,plain,(
% 1.02/1.19 ![I: $i] : (int_less(int_zero, I) <=> int_leq(int_one, I))),
% 1.02/1.19 inference(skolemize,[status(sab)],[64])).
% 1.02/1.19 tff(66,plain,
% 1.02/1.19 (![I: $i] : (int_less(int_zero, I) <=> int_leq(int_one, I))),
% 1.02/1.19 inference(modus_ponens,[status(thm)],[65, 61])).
% 1.02/1.19 tff(67,plain,
% 1.02/1.19 ((~![I: $i] : (int_less(int_zero, I) <=> int_leq(int_one, I))) | (int_less(int_zero, I!2) <=> int_leq(int_one, I!2))),
% 1.02/1.19 inference(quant_inst,[status(thm)],[])).
% 1.02/1.19 tff(68,plain,
% 1.02/1.19 (int_less(int_zero, I!2) <=> int_leq(int_one, I!2)),
% 1.02/1.19 inference(unit_resolution,[status(thm)],[67, 66])).
% 1.02/1.19 tff(69,plain,
% 1.02/1.19 (int_leq(int_one, I!2)),
% 1.02/1.19 inference(and_elim,[status(thm)],[43])).
% 1.02/1.19 tff(70,plain,
% 1.02/1.19 ((~(int_less(int_zero, I!2) <=> int_leq(int_one, I!2))) | int_less(int_zero, I!2) | (~int_leq(int_one, I!2))),
% 1.02/1.19 inference(tautology,[status(thm)],[])).
% 1.03/1.19 tff(71,plain,
% 1.03/1.19 ((~(int_less(int_zero, I!2) <=> int_leq(int_one, I!2))) | int_less(int_zero, I!2)),
% 1.03/1.19 inference(unit_resolution,[status(thm)],[70, 69])).
% 1.03/1.19 tff(72,plain,
% 1.03/1.19 (int_less(int_zero, I!2)),
% 1.03/1.19 inference(unit_resolution,[status(thm)],[71, 68])).
% 1.03/1.19 tff(73,plain,
% 1.03/1.19 (![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)))),
% 1.03/1.19 inference(rewrite,[status(thm)],[])).
% 1.03/1.19 tff(74,plain,
% 1.03/1.19 (^[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)))))),
% 1.03/1.19 inference(bind,[status(th)],[])).
% 1.03/1.19 tff(75,plain,
% 1.03/1.19 (![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)))),
% 1.03/1.19 inference(quant_intro,[status(thm)],[74])).
% 1.03/1.19 tff(76,plain,
% 1.03/1.19 (![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))),
% 1.03/1.19 inference(rewrite,[status(thm)],[])).
% 1.03/1.19 tff(77,plain,
% 1.03/1.19 (^[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)))),
% 1.03/1.19 inference(bind,[status(th)],[])).
% 1.03/1.19 tff(78,plain,
% 1.03/1.19 (![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))),
% 1.03/1.19 inference(quant_intro,[status(thm)],[77])).
% 1.03/1.19 tff(79,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')).
% 1.03/1.19 tff(80,plain,
% 1.03/1.19 (![I: $i, J: $i, K: $i] : ((~(int_less(I, J) & int_less(J, K))) | int_less(I, K))),
% 1.03/1.19 inference(modus_ponens,[status(thm)],[79, 78])).
% 1.03/1.19 tff(81,plain,
% 1.03/1.19 (![I: $i, J: $i, K: $i] : ((~(int_less(I, J) & int_less(J, K))) | int_less(I, K))),
% 1.03/1.19 inference(modus_ponens,[status(thm)],[80, 76])).
% 1.03/1.19 tff(82,plain,(
% 1.03/1.19 ![I: $i, J: $i, K: $i] : ((~(int_less(I, J) & int_less(J, K))) | int_less(I, K))),
% 1.03/1.19 inference(skolemize,[status(sab)],[81])).
% 1.03/1.19 tff(83,plain,
% 1.03/1.19 (![I: $i, J: $i, K: $i] : (int_less(I, K) | (~int_less(J, K)) | (~int_less(I, J)))),
% 1.03/1.19 inference(modus_ponens,[status(thm)],[82, 75])).
% 1.03/1.19 tff(84,plain,
% 1.03/1.19 (![I: $i, J: $i, K: $i] : (int_less(I, K) | (~int_less(J, K)) | (~int_less(I, J)))),
% 1.03/1.19 inference(modus_ponens,[status(thm)],[83, 73])).
% 1.03/1.19 tff(85,plain,
% 1.03/1.19 (((~![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))),
% 1.03/1.19 inference(rewrite,[status(thm)],[])).
% 1.03/1.19 tff(86,plain,
% 1.03/1.19 ((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))),
% 1.03/1.19 inference(rewrite,[status(thm)],[])).
% 1.03/1.19 tff(87,plain,
% 1.03/1.19 (((~![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)))),
% 1.03/1.19 inference(monotonicity,[status(thm)],[86])).
% 1.03/1.19 tff(88,plain,
% 1.03/1.19 (((~![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))),
% 1.03/1.19 inference(transitivity,[status(thm)],[87, 85])).
% 1.03/1.19 tff(89,plain,
% 1.03/1.19 ((~![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)))),
% 1.03/1.19 inference(quant_inst,[status(thm)],[])).
% 1.03/1.19 tff(90,plain,
% 1.03/1.19 ((~![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)),
% 1.03/1.19 inference(modus_ponens,[status(thm)],[89, 88])).
% 1.03/1.19 tff(91,plain,
% 1.03/1.19 (int_less(int_zero, J!1)),
% 1.03/1.19 inference(unit_resolution,[status(thm)],[90, 84, 44, 72])).
% 1.03/1.19 tff(92,plain,
% 1.03/1.19 ((~((~int_less(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, 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))))),
% 1.03/1.19 inference(tautology,[status(thm)],[])).
% 1.03/1.19 tff(93,plain,
% 1.03/1.19 ((~((~int_less(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))) | (~(plus(int_zero, tptp_fun_K_0(J!1, int_zero)) = J!1))))),
% 1.03/1.19 inference(unit_resolution,[status(thm)],[92, 91])).
% 1.03/1.19 tff(94,plain,
% 1.03/1.19 (~((~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)))),
% 1.03/1.19 inference(unit_resolution,[status(thm)],[93, 59])).
% 1.03/1.19 tff(95,plain,
% 1.03/1.19 (((~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))) | (plus(int_zero, tptp_fun_K_0(J!1, int_zero)) = J!1)),
% 1.03/1.19 inference(tautology,[status(thm)],[])).
% 1.03/1.19 tff(96,plain,
% 1.03/1.19 (plus(int_zero, tptp_fun_K_0(J!1, int_zero)) = J!1),
% 1.03/1.19 inference(unit_resolution,[status(thm)],[95, 94])).
% 1.03/1.19 tff(97,plain,
% 1.03/1.19 (^[I: $i, J: $i] : refl((plus(I, J) = plus(J, I)) <=> (plus(I, J) = plus(J, I)))),
% 1.03/1.19 inference(bind,[status(th)],[])).
% 1.03/1.19 tff(98,plain,
% 1.03/1.19 (![I: $i, J: $i] : (plus(I, J) = plus(J, I)) <=> ![I: $i, J: $i] : (plus(I, J) = plus(J, I))),
% 1.03/1.19 inference(quant_intro,[status(thm)],[97])).
% 1.03/1.19 tff(99,plain,
% 1.03/1.19 (![I: $i, J: $i] : (plus(I, J) = plus(J, I)) <=> ![I: $i, J: $i] : (plus(I, J) = plus(J, I))),
% 1.03/1.19 inference(rewrite,[status(thm)],[])).
% 1.03/1.19 tff(100,axiom,(![I: $i, J: $i] : (plus(I, J) = plus(J, I))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','plus_commutative')).
% 1.03/1.19 tff(101,plain,
% 1.03/1.19 (![I: $i, J: $i] : (plus(I, J) = plus(J, I))),
% 1.03/1.19 inference(modus_ponens,[status(thm)],[100, 99])).
% 1.03/1.19 tff(102,plain,(
% 1.03/1.19 ![I: $i, J: $i] : (plus(I, J) = plus(J, I))),
% 1.03/1.19 inference(skolemize,[status(sab)],[101])).
% 1.03/1.19 tff(103,plain,
% 1.03/1.19 (![I: $i, J: $i] : (plus(I, J) = plus(J, I))),
% 1.03/1.19 inference(modus_ponens,[status(thm)],[102, 98])).
% 1.03/1.19 tff(104,plain,
% 1.03/1.19 ((~![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))),
% 1.03/1.19 inference(quant_inst,[status(thm)],[])).
% 1.03/1.19 tff(105,plain,
% 1.03/1.19 (plus(int_zero, tptp_fun_K_0(J!1, int_zero)) = plus(tptp_fun_K_0(J!1, int_zero), int_zero)),
% 1.03/1.19 inference(unit_resolution,[status(thm)],[104, 103])).
% 1.03/1.19 tff(106,plain,
% 1.03/1.19 (plus(tptp_fun_K_0(J!1, int_zero), int_zero) = plus(int_zero, tptp_fun_K_0(J!1, int_zero))),
% 1.03/1.19 inference(symmetry,[status(thm)],[105])).
% 1.03/1.19 tff(107,plain,
% 1.03/1.19 (^[I: $i] : refl((plus(I, int_zero) = I) <=> (plus(I, int_zero) = I))),
% 1.03/1.19 inference(bind,[status(th)],[])).
% 1.03/1.19 tff(108,plain,
% 1.03/1.19 (![I: $i] : (plus(I, int_zero) = I) <=> ![I: $i] : (plus(I, int_zero) = I)),
% 1.03/1.19 inference(quant_intro,[status(thm)],[107])).
% 1.03/1.19 tff(109,plain,
% 1.03/1.19 (![I: $i] : (plus(I, int_zero) = I) <=> ![I: $i] : (plus(I, int_zero) = I)),
% 1.03/1.19 inference(rewrite,[status(thm)],[])).
% 1.03/1.19 tff(110,axiom,(![I: $i] : (plus(I, int_zero) = I)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','plus_zero')).
% 1.03/1.19 tff(111,plain,
% 1.03/1.19 (![I: $i] : (plus(I, int_zero) = I)),
% 1.03/1.19 inference(modus_ponens,[status(thm)],[110, 109])).
% 1.03/1.19 tff(112,plain,(
% 1.03/1.19 ![I: $i] : (plus(I, int_zero) = I)),
% 1.03/1.19 inference(skolemize,[status(sab)],[111])).
% 1.03/1.19 tff(113,plain,
% 1.03/1.19 (![I: $i] : (plus(I, int_zero) = I)),
% 1.03/1.19 inference(modus_ponens,[status(thm)],[112, 108])).
% 1.03/1.19 tff(114,plain,
% 1.03/1.19 ((~![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))),
% 1.03/1.19 inference(quant_inst,[status(thm)],[])).
% 1.03/1.19 tff(115,plain,
% 1.03/1.19 (plus(tptp_fun_K_0(J!1, int_zero), int_zero) = tptp_fun_K_0(J!1, int_zero)),
% 1.03/1.19 inference(unit_resolution,[status(thm)],[114, 113])).
% 1.03/1.19 tff(116,plain,
% 1.03/1.19 (tptp_fun_K_0(J!1, int_zero) = plus(tptp_fun_K_0(J!1, int_zero), int_zero)),
% 1.03/1.19 inference(symmetry,[status(thm)],[115])).
% 1.03/1.19 tff(117,plain,
% 1.03/1.19 (tptp_fun_K_0(J!1, int_zero) = plus(I!2, tptp_fun_K_0(J!1, I!2))),
% 1.03/1.19 inference(transitivity,[status(thm)],[116, 106, 96, 50])).
% 1.03/1.19 tff(118,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)).
% 1.03/1.19 tff(119,assumption,(a(I!2, plus(I!2, tptp_fun_K_0(J!1, I!2))) = real_zero), introduced(assumption)).
% 1.03/1.19 tff(120,plain,
% 1.03/1.19 (a(I!2, J!1) = a(I!2, plus(I!2, tptp_fun_K_0(J!1, I!2)))),
% 1.03/1.19 inference(monotonicity,[status(thm)],[50])).
% 1.03/1.19 tff(121,plain,
% 1.03/1.19 (a(I!2, J!1) = real_zero),
% 1.03/1.19 inference(transitivity,[status(thm)],[120, 119])).
% 1.03/1.19 tff(122,plain,
% 1.03/1.19 (~(a(I!2, J!1) = real_zero)),
% 1.03/1.19 inference(or_elim,[status(thm)],[42])).
% 1.03/1.19 tff(123,plain,
% 1.03/1.19 ($false),
% 1.03/1.19 inference(unit_resolution,[status(thm)],[122, 121])).
% 1.03/1.19 tff(124,plain,(~(a(I!2, plus(I!2, tptp_fun_K_0(J!1, I!2))) = real_zero)), inference(lemma,lemma(discharge,[]))).
% 1.03/1.19 tff(125,assumption,(~int_leq(I!2, I!2)), introduced(assumption)).
% 1.03/1.19 tff(126,plain,
% 1.03/1.19 (((~![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))),
% 1.03/1.19 inference(rewrite,[status(thm)],[])).
% 1.03/1.19 tff(127,plain,
% 1.03/1.19 ((int_leq(I!2, I!2) <=> $true) <=> int_leq(I!2, I!2)),
% 1.03/1.19 inference(rewrite,[status(thm)],[])).
% 1.03/1.19 tff(128,plain,
% 1.03/1.19 (($true | int_less(I!2, I!2)) <=> $true),
% 1.03/1.19 inference(rewrite,[status(thm)],[])).
% 1.03/1.19 tff(129,plain,
% 1.03/1.19 ((I!2 = I!2) <=> $true),
% 1.03/1.19 inference(rewrite,[status(thm)],[])).
% 1.03/1.19 tff(130,plain,
% 1.03/1.19 (((I!2 = I!2) | int_less(I!2, I!2)) <=> ($true | int_less(I!2, I!2))),
% 1.03/1.19 inference(monotonicity,[status(thm)],[129])).
% 1.03/1.19 tff(131,plain,
% 1.03/1.19 (((I!2 = I!2) | int_less(I!2, I!2)) <=> $true),
% 1.03/1.19 inference(transitivity,[status(thm)],[130, 128])).
% 1.03/1.19 tff(132,plain,
% 1.03/1.19 ((int_leq(I!2, I!2) <=> ((I!2 = I!2) | int_less(I!2, I!2))) <=> (int_leq(I!2, I!2) <=> $true)),
% 1.03/1.19 inference(monotonicity,[status(thm)],[131])).
% 1.03/1.19 tff(133,plain,
% 1.03/1.19 ((int_leq(I!2, I!2) <=> ((I!2 = I!2) | int_less(I!2, I!2))) <=> int_leq(I!2, I!2)),
% 1.03/1.19 inference(transitivity,[status(thm)],[132, 127])).
% 1.03/1.19 tff(134,plain,
% 1.03/1.19 (((~![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))),
% 1.03/1.19 inference(monotonicity,[status(thm)],[133])).
% 1.03/1.19 tff(135,plain,
% 1.03/1.19 (((~![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))),
% 1.03/1.19 inference(transitivity,[status(thm)],[134, 126])).
% 1.03/1.19 tff(136,plain,
% 1.03/1.19 ((~![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)))),
% 1.03/1.19 inference(quant_inst,[status(thm)],[])).
% 1.03/1.19 tff(137,plain,
% 1.03/1.19 ((~![I: $i, J: $i] : (int_leq(I, J) <=> ((I = J) | int_less(I, J)))) | int_leq(I!2, I!2)),
% 1.03/1.19 inference(modus_ponens,[status(thm)],[136, 135])).
% 1.03/1.19 tff(138,plain,
% 1.03/1.19 ($false),
% 1.03/1.19 inference(unit_resolution,[status(thm)],[137, 10, 125])).
% 1.03/1.19 tff(139,plain,(int_leq(I!2, I!2)), inference(lemma,lemma(discharge,[]))).
% 1.03/1.19 tff(140,plain,
% 1.03/1.19 (((~![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))),
% 1.03/1.19 inference(rewrite,[status(thm)],[])).
% 1.03/1.19 tff(141,plain,
% 1.03/1.19 ((~![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))),
% 1.03/1.19 inference(quant_inst,[status(thm)],[])).
% 1.03/1.19 tff(142,plain,
% 1.03/1.19 ((~![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)),
% 1.03/1.19 inference(modus_ponens,[status(thm)],[141, 140])).
% 1.03/1.19 tff(143,plain,
% 1.03/1.19 ($false),
% 1.03/1.19 inference(unit_resolution,[status(thm)],[142, 69, 139, 124, 118])).
% 1.03/1.19 tff(144,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,[]))).
% 1.03/1.19 tff(145,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)).
% 1.03/1.19 tff(146,plain,
% 1.03/1.19 (((~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))),
% 1.03/1.19 inference(tautology,[status(thm)],[])).
% 1.03/1.19 tff(147,plain,
% 1.03/1.19 (int_less(int_zero, tptp_fun_K_0(J!1, I!2))),
% 1.03/1.19 inference(unit_resolution,[status(thm)],[146, 47])).
% 1.03/1.19 tff(148,plain,
% 1.03/1.19 (((~![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)))),
% 1.03/1.19 inference(rewrite,[status(thm)],[])).
% 1.03/1.19 tff(149,plain,
% 1.03/1.19 (((~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)))),
% 1.03/1.19 inference(rewrite,[status(thm)],[])).
% 1.03/1.19 tff(150,plain,
% 1.03/1.19 (((~![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))))),
% 1.03/1.20 inference(monotonicity,[status(thm)],[149])).
% 1.03/1.20 tff(151,plain,
% 1.03/1.20 (((~![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)))),
% 1.03/1.20 inference(transitivity,[status(thm)],[150, 148])).
% 1.03/1.20 tff(152,plain,
% 1.03/1.20 ((~![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))))),
% 1.03/1.20 inference(quant_inst,[status(thm)],[])).
% 1.03/1.20 tff(153,plain,
% 1.03/1.20 ((~![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))),
% 1.03/1.20 inference(modus_ponens,[status(thm)],[152, 151])).
% 1.03/1.20 tff(154,plain,
% 1.03/1.20 ($false),
% 1.03/1.20 inference(unit_resolution,[status(thm)],[153, 147, 145, 144, 117])).
% 1.03/1.20 tff(155,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,[]))).
% 1.03/1.20 tff(156,plain,
% 1.03/1.20 (((~![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) = qr(plus(K, C), K)) | (~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))))),
% 1.03/1.20 inference(tautology,[status(thm)],[])).
% 1.03/1.20 tff(157,plain,
% 1.03/1.20 ((~![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) = qr(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero))))))),
% 1.03/1.20 inference(unit_resolution,[status(thm)],[156, 155])).
% 1.03/1.20 tff(158,plain,
% 1.03/1.20 (tptp_fun_K_0(J!1, int_zero) = J!1),
% 1.03/1.20 inference(transitivity,[status(thm)],[116, 106, 96])).
% 1.03/1.20 tff(159,plain,
% 1.03/1.20 (int_leq(tptp_fun_K_0(J!1, int_zero), n) <=> int_leq(J!1, n)),
% 1.03/1.20 inference(monotonicity,[status(thm)],[158])).
% 1.03/1.20 tff(160,plain,
% 1.03/1.20 (int_leq(J!1, n) <=> int_leq(tptp_fun_K_0(J!1, int_zero), n)),
% 1.03/1.20 inference(symmetry,[status(thm)],[159])).
% 1.03/1.20 tff(161,plain,
% 1.03/1.20 (int_leq(J!1, n)),
% 1.03/1.20 inference(and_elim,[status(thm)],[43])).
% 1.03/1.20 tff(162,plain,
% 1.03/1.20 (int_leq(tptp_fun_K_0(J!1, int_zero), n)),
% 1.03/1.20 inference(modus_ponens,[status(thm)],[161, 160])).
% 1.03/1.20 tff(163,plain,
% 1.03/1.20 ((~![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)))),
% 1.03/1.20 inference(quant_inst,[status(thm)],[])).
% 1.03/1.20 tff(164,plain,
% 1.03/1.20 (int_less(int_zero, tptp_fun_K_0(J!1, int_zero)) <=> int_leq(int_one, tptp_fun_K_0(J!1, int_zero))),
% 1.03/1.20 inference(unit_resolution,[status(thm)],[163, 66])).
% 1.03/1.20 tff(165,plain,
% 1.03/1.20 (((~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))),
% 1.03/1.20 inference(tautology,[status(thm)],[])).
% 1.03/1.20 tff(166,plain,
% 1.03/1.20 (int_less(int_zero, tptp_fun_K_0(J!1, int_zero))),
% 1.03/1.20 inference(unit_resolution,[status(thm)],[165, 94])).
% 1.03/1.20 tff(167,plain,
% 1.03/1.20 ((~(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))),
% 1.03/1.20 inference(tautology,[status(thm)],[])).
% 1.03/1.20 tff(168,plain,
% 1.03/1.20 ((~(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))),
% 1.03/1.20 inference(unit_resolution,[status(thm)],[167, 166])).
% 1.03/1.20 tff(169,plain,
% 1.03/1.20 (int_leq(int_one, tptp_fun_K_0(J!1, int_zero))),
% 1.03/1.20 inference(unit_resolution,[status(thm)],[168, 164])).
% 1.03/1.20 tff(170,plain,
% 1.03/1.20 (^[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) = qr(plus(K, C), K)) | (~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) = qr(plus(K, C), K)) | (~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)))))))))),
% 1.03/1.20 inference(bind,[status(th)],[])).
% 1.03/1.20 tff(171,plain,
% 1.03/1.20 (![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) = qr(plus(K, C), K)) | (~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) = qr(plus(K, C), K)) | (~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))))))))),
% 1.03/1.20 inference(quant_intro,[status(thm)],[170])).
% 1.03/1.20 tff(172,plain,
% 1.03/1.20 (^[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) = qr(plus(K, C), K)) | (~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) = qr(plus(K, C), K)) | (~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)))))))))),
% 1.03/1.20 inference(bind,[status(th)],[])).
% 1.03/1.20 tff(173,plain,
% 1.03/1.20 (![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) = qr(plus(K, C), K)) | (~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) = qr(plus(K, C), K)) | (~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))))))))),
% 1.03/1.20 inference(quant_intro,[status(thm)],[172])).
% 1.03/1.20 tff(174,plain,
% 1.03/1.20 (![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) = qr(plus(K, C), K)) | (~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) = qr(plus(K, C), K)) | (~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))))))))),
% 1.03/1.20 inference(transitivity,[status(thm)],[173, 171])).
% 1.03/1.20 tff(175,plain,
% 1.03/1.20 (^[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) = qr(plus(K, C), K))) <=> (((~int_leq(int_one, K)) | (~int_leq(K, J))) | (a(plus(K, C), K) = qr(plus(K, C), K))))), rewrite((((~int_leq(int_one, K)) | (~int_leq(K, J))) | (a(plus(K, C), K) = qr(plus(K, C), K))) <=> ((a(plus(K, C), K) = qr(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J)))), (((~(int_leq(int_one, K) & int_leq(K, J))) | (a(plus(K, C), K) = qr(plus(K, C), K))) <=> ((a(plus(K, C), K) = qr(plus(K, C), K)) | (~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) = qr(plus(K, C), K))) <=> ![K: $i] : ((a(plus(K, C), K) = qr(plus(K, C), K)) | (~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) = qr(plus(K, C), K)))) <=> (((~int_less(int_zero, C)) | (~(I = plus(J, C)))) | ![K: $i] : ((a(plus(K, C), K) = qr(plus(K, C), K)) | (~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) = qr(plus(K, C), K)) | (~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) = qr(plus(K, C), K)) | (~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) = qr(plus(K, C), K)))) <=> ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = qr(plus(K, C), K)) | (~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) = qr(plus(K, C), K)))) <=> ![C: $i] : ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = qr(plus(K, C), K)) | (~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) = qr(plus(K, C), K)))) & ![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) = qr(plus(K, C), K)) | (~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) = qr(plus(K, C), K)) | (~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) = qr(plus(K, C), K)) | (~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) = qr(plus(K, C), K)))) & ![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) = qr(plus(K, C), K)) | (~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) = qr(plus(K, C), K)))) & ![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) = qr(plus(K, C), K)) | (~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) = qr(plus(K, C), K)) | (~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) = qr(plus(K, C), K)) | (~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) = qr(plus(K, C), K)))) & ![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) = qr(plus(K, C), K)) | (~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))))))))))),
% 1.03/1.20 inference(bind,[status(th)],[])).
% 1.03/1.20 tff(176,plain,
% 1.03/1.20 (![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) = qr(plus(K, C), K)))) & ![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) = qr(plus(K, C), K)) | (~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))))))))),
% 1.03/1.20 inference(quant_intro,[status(thm)],[175])).
% 1.03/1.20 tff(177,plain,
% 1.03/1.20 (![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) = qr(plus(K, C), K)))) & ![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) = qr(plus(K, C), K)))) & ![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)))))),
% 1.03/1.20 inference(rewrite,[status(thm)],[])).
% 1.03/1.20 tff(178,plain,
% 1.03/1.20 (^[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)))), 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) = qr(plus(K, C), K)))) & ![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) = qr(plus(K, C), K)))) & ![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) = qr(plus(K, C), K)))) & ![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) = qr(plus(K, C), K)))) & ![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) = qr(plus(K, C), K)))) & ![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) = qr(plus(K, C), K)))) & ![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) = qr(plus(K, C), K)))) & ![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) = qr(plus(K, C), K)))) & ![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)))))))),
% 1.03/1.20 inference(bind,[status(th)],[])).
% 1.03/1.20 tff(179,plain,
% 1.03/1.20 (![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) = qr(plus(K, C), K)))) & ![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) = qr(plus(K, C), K)))) & ![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)))))),
% 1.03/1.20 inference(quant_intro,[status(thm)],[178])).
% 1.03/1.20 tff(180,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) = qr(plus(K, C), K)))) & ![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','qih')).
% 1.03/1.20 tff(181,plain,
% 1.03/1.20 (![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) = qr(plus(K, C), K)))) & ![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)))))),
% 1.03/1.20 inference(modus_ponens,[status(thm)],[180, 179])).
% 1.03/1.20 tff(182,plain,
% 1.03/1.20 (![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) = qr(plus(K, C), K)))) & ![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)))))),
% 1.03/1.20 inference(modus_ponens,[status(thm)],[181, 177])).
% 1.03/1.20 tff(183,plain,(
% 1.03/1.20 ![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) = qr(plus(K, C), K)))) & ![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)))))),
% 1.03/1.20 inference(skolemize,[status(sab)],[182])).
% 1.03/1.20 tff(184,plain,
% 1.03/1.20 (![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) = qr(plus(K, C), K)) | (~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))))))))),
% 1.03/1.20 inference(modus_ponens,[status(thm)],[183, 176])).
% 1.03/1.20 tff(185,plain,
% 1.03/1.20 (![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) = qr(plus(K, C), K)) | (~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))))))))),
% 1.03/1.21 inference(modus_ponens,[status(thm)],[184, 174])).
% 1.03/1.21 tff(186,plain,
% 1.03/1.21 (((~![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) = qr(plus(K, C), K)) | (~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)) | (~(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) = qr(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_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) = qr(plus(K, C), K)) | (~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)) | (~(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) = qr(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero)))))))))),
% 1.03/1.21 inference(rewrite,[status(thm)],[])).
% 1.03/1.21 tff(187,plain,
% 1.03/1.21 (((~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)) | (~(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) = qr(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero))))))))) <=> ((~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)) | (~(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) = qr(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero)))))))))),
% 1.03/1.21 inference(rewrite,[status(thm)],[])).
% 1.03/1.21 tff(188,plain,
% 1.03/1.21 ((~((~![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) = qr(plus(K, C), K)) | (~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))))) | (~![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) = qr(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero))))))))),
% 1.03/1.21 inference(rewrite,[status(thm)],[])).
% 1.03/1.21 tff(189,plain,
% 1.03/1.21 (((~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) = qr(plus(K, C), K)) | (~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)) | (~(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) = qr(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero)))))))))),
% 1.03/1.21 inference(monotonicity,[status(thm)],[188])).
% 1.03/1.21 tff(190,plain,
% 1.03/1.21 (((~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) = qr(plus(K, C), K)) | (~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)) | (~(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) = qr(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero)))))))))),
% 1.03/1.21 inference(transitivity,[status(thm)],[189, 187])).
% 1.03/1.21 tff(191,plain,
% 1.03/1.21 (((~![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) = qr(plus(K, C), K)) | (~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) = qr(plus(K, C), K)) | (~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) = qr(plus(K, C), K)) | (~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)) | (~(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) = qr(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero))))))))))),
% 1.03/1.21 inference(monotonicity,[status(thm)],[190])).
% 1.03/1.21 tff(192,plain,
% 1.03/1.21 (((~![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) = qr(plus(K, C), K)) | (~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) = qr(plus(K, C), K)) | (~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) = qr(plus(K, C), K)) | (~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)) | (~(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) = qr(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero)))))))))),
% 1.03/1.21 inference(transitivity,[status(thm)],[191, 186])).
% 1.03/1.21 tff(193,plain,
% 1.03/1.21 ((~![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) = qr(plus(K, C), K)) | (~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) = qr(plus(K, C), K)) | (~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))))))))),
% 1.03/1.21 inference(quant_inst,[status(thm)],[])).
% 1.03/1.21 tff(194,plain,
% 1.03/1.21 ((~![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) = qr(plus(K, C), K)) | (~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)) | (~(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) = qr(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero))))))))),
% 1.03/1.21 inference(modus_ponens,[status(thm)],[193, 192])).
% 1.03/1.21 tff(195,plain,
% 1.03/1.21 ((~int_leq(I!2, n)) | (~int_leq(tptp_fun_K_0(J!1, int_zero), n)) | (~((~![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) = qr(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero))))))))),
% 1.03/1.21 inference(unit_resolution,[status(thm)],[194, 185, 69, 169])).
% 1.03/1.21 tff(196,plain,
% 1.03/1.21 ((~int_leq(I!2, n)) | (~((~![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) = qr(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, tptp_fun_K_0(J!1, int_zero))))))))),
% 1.03/1.21 inference(unit_resolution,[status(thm)],[195, 162])).
% 1.03/1.21 tff(197,plain,
% 1.03/1.21 (~int_leq(I!2, n)),
% 1.03/1.21 inference(unit_resolution,[status(thm)],[196, 157])).
% 1.03/1.21 tff(198,plain,
% 1.03/1.21 ((~(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)))),
% 1.03/1.21 inference(tautology,[status(thm)],[])).
% 1.03/1.21 tff(199,plain,
% 1.03/1.21 ((~(int_leq(I!2, n) <=> ((I!2 = n) | int_less(I!2, n)))) | (~((I!2 = n) | int_less(I!2, n)))),
% 1.03/1.21 inference(unit_resolution,[status(thm)],[198, 197])).
% 1.03/1.21 tff(200,plain,
% 1.03/1.21 (~((I!2 = n) | int_less(I!2, n))),
% 1.03/1.21 inference(unit_resolution,[status(thm)],[199, 12])).
% 1.03/1.21 tff(201,plain,
% 1.03/1.21 (((I!2 = n) | int_less(I!2, n)) | (~int_less(I!2, n))),
% 1.03/1.21 inference(tautology,[status(thm)],[])).
% 1.03/1.21 tff(202,plain,
% 1.03/1.21 (~int_less(I!2, n)),
% 1.03/1.21 inference(unit_resolution,[status(thm)],[201, 200])).
% 1.03/1.21 tff(203,plain,
% 1.03/1.21 ((plus(I!2, tptp_fun_K_0(J!1, I!2)) = n) <=> (J!1 = n)),
% 1.03/1.21 inference(monotonicity,[status(thm)],[49])).
% 1.03/1.21 tff(204,plain,
% 1.03/1.21 ((~(plus(I!2, tptp_fun_K_0(J!1, I!2)) = n)) <=> (~(J!1 = n))),
% 1.03/1.21 inference(monotonicity,[status(thm)],[203])).
% 1.03/1.21 tff(205,plain,
% 1.03/1.21 (((~![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, n) | ![K: $i] : ((~int_less(int_zero, K)) | (~(plus(I!2, K) = n))))) | (~((~int_less(I!2, n)) | (~((~int_less(int_zero, tptp_fun_K_0(n, I!2))) | (~(plus(I!2, tptp_fun_K_0(n, I!2)) = n))))))))) <=> ((~![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, n) | ![K: $i] : ((~int_less(int_zero, K)) | (~(plus(I!2, K) = n))))) | (~((~int_less(I!2, n)) | (~((~int_less(int_zero, tptp_fun_K_0(n, I!2))) | (~(plus(I!2, tptp_fun_K_0(n, I!2)) = n)))))))))),
% 1.03/1.21 inference(rewrite,[status(thm)],[])).
% 1.03/1.21 tff(206,plain,
% 1.03/1.21 ((~((~((~int_less(I!2, n)) | (~((~(plus(I!2, tptp_fun_K_0(n, I!2)) = n)) | (~int_less(int_zero, tptp_fun_K_0(n, I!2))))))) | (~(int_less(I!2, n) | ![K: $i] : ((~(plus(I!2, K) = n)) | (~int_less(int_zero, K))))))) <=> (~((~(int_less(I!2, n) | ![K: $i] : ((~int_less(int_zero, K)) | (~(plus(I!2, K) = n))))) | (~((~int_less(I!2, n)) | (~((~int_less(int_zero, tptp_fun_K_0(n, I!2))) | (~(plus(I!2, tptp_fun_K_0(n, I!2)) = n))))))))),
% 1.03/1.21 inference(rewrite,[status(thm)],[])).
% 1.03/1.21 tff(207,plain,
% 1.03/1.21 (((~![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, n)) | (~((~(plus(I!2, tptp_fun_K_0(n, I!2)) = n)) | (~int_less(int_zero, tptp_fun_K_0(n, I!2))))))) | (~(int_less(I!2, n) | ![K: $i] : ((~(plus(I!2, K) = n)) | (~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, n) | ![K: $i] : ((~int_less(int_zero, K)) | (~(plus(I!2, K) = n))))) | (~((~int_less(I!2, n)) | (~((~int_less(int_zero, tptp_fun_K_0(n, I!2))) | (~(plus(I!2, tptp_fun_K_0(n, I!2)) = n)))))))))),
% 1.03/1.21 inference(monotonicity,[status(thm)],[206])).
% 1.03/1.21 tff(208,plain,
% 1.03/1.21 (((~![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, n)) | (~((~(plus(I!2, tptp_fun_K_0(n, I!2)) = n)) | (~int_less(int_zero, tptp_fun_K_0(n, I!2))))))) | (~(int_less(I!2, n) | ![K: $i] : ((~(plus(I!2, K) = n)) | (~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, n) | ![K: $i] : ((~int_less(int_zero, K)) | (~(plus(I!2, K) = n))))) | (~((~int_less(I!2, n)) | (~((~int_less(int_zero, tptp_fun_K_0(n, I!2))) | (~(plus(I!2, tptp_fun_K_0(n, I!2)) = n)))))))))),
% 1.03/1.21 inference(transitivity,[status(thm)],[207, 205])).
% 1.03/1.21 tff(209,plain,
% 1.03/1.21 ((~![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, n)) | (~((~(plus(I!2, tptp_fun_K_0(n, I!2)) = n)) | (~int_less(int_zero, tptp_fun_K_0(n, I!2))))))) | (~(int_less(I!2, n) | ![K: $i] : ((~(plus(I!2, K) = n)) | (~int_less(int_zero, K)))))))),
% 1.03/1.21 inference(quant_inst,[status(thm)],[])).
% 1.03/1.21 tff(210,plain,
% 1.03/1.21 ((~![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, n) | ![K: $i] : ((~int_less(int_zero, K)) | (~(plus(I!2, K) = n))))) | (~((~int_less(I!2, n)) | (~((~int_less(int_zero, tptp_fun_K_0(n, I!2))) | (~(plus(I!2, tptp_fun_K_0(n, I!2)) = n))))))))),
% 1.03/1.21 inference(modus_ponens,[status(thm)],[209, 208])).
% 1.03/1.21 tff(211,plain,
% 1.03/1.21 (~((~(int_less(I!2, n) | ![K: $i] : ((~int_less(int_zero, K)) | (~(plus(I!2, K) = n))))) | (~((~int_less(I!2, n)) | (~((~int_less(int_zero, tptp_fun_K_0(n, I!2))) | (~(plus(I!2, tptp_fun_K_0(n, I!2)) = n)))))))),
% 1.03/1.21 inference(unit_resolution,[status(thm)],[210, 25])).
% 1.03/1.21 tff(212,plain,
% 1.03/1.21 (((~(int_less(I!2, n) | ![K: $i] : ((~int_less(int_zero, K)) | (~(plus(I!2, K) = n))))) | (~((~int_less(I!2, n)) | (~((~int_less(int_zero, tptp_fun_K_0(n, I!2))) | (~(plus(I!2, tptp_fun_K_0(n, I!2)) = n))))))) | (int_less(I!2, n) | ![K: $i] : ((~int_less(int_zero, K)) | (~(plus(I!2, K) = n))))),
% 1.03/1.21 inference(tautology,[status(thm)],[])).
% 1.03/1.21 tff(213,plain,
% 1.03/1.21 (int_less(I!2, n) | ![K: $i] : ((~int_less(int_zero, K)) | (~(plus(I!2, K) = n)))),
% 1.03/1.21 inference(unit_resolution,[status(thm)],[212, 211])).
% 1.03/1.21 tff(214,plain,
% 1.03/1.21 ((~(int_less(I!2, n) | ![K: $i] : ((~int_less(int_zero, K)) | (~(plus(I!2, K) = n))))) | int_less(I!2, n) | ![K: $i] : ((~int_less(int_zero, K)) | (~(plus(I!2, K) = n)))),
% 1.03/1.21 inference(tautology,[status(thm)],[])).
% 1.03/1.21 tff(215,plain,
% 1.03/1.21 ((~(int_less(I!2, n) | ![K: $i] : ((~int_less(int_zero, K)) | (~(plus(I!2, K) = n))))) | ![K: $i] : ((~int_less(int_zero, K)) | (~(plus(I!2, K) = n)))),
% 1.03/1.21 inference(unit_resolution,[status(thm)],[214, 202])).
% 1.03/1.21 tff(216,plain,
% 1.03/1.21 (![K: $i] : ((~int_less(int_zero, K)) | (~(plus(I!2, K) = n)))),
% 1.03/1.21 inference(unit_resolution,[status(thm)],[215, 213])).
% 1.03/1.21 tff(217,plain,
% 1.03/1.21 (((~![K: $i] : ((~int_less(int_zero, K)) | (~(plus(I!2, K) = n)))) | ((~int_less(int_zero, tptp_fun_K_0(J!1, I!2))) | (~(plus(I!2, tptp_fun_K_0(J!1, I!2)) = n)))) <=> ((~![K: $i] : ((~int_less(int_zero, K)) | (~(plus(I!2, K) = n)))) | (~int_less(int_zero, tptp_fun_K_0(J!1, I!2))) | (~(plus(I!2, tptp_fun_K_0(J!1, I!2)) = n)))),
% 1.03/1.21 inference(rewrite,[status(thm)],[])).
% 1.03/1.21 tff(218,plain,
% 1.03/1.21 ((~![K: $i] : ((~int_less(int_zero, K)) | (~(plus(I!2, K) = n)))) | ((~int_less(int_zero, tptp_fun_K_0(J!1, I!2))) | (~(plus(I!2, tptp_fun_K_0(J!1, I!2)) = n)))),
% 1.03/1.21 inference(quant_inst,[status(thm)],[])).
% 1.03/1.21 tff(219,plain,
% 1.03/1.21 ((~![K: $i] : ((~int_less(int_zero, K)) | (~(plus(I!2, K) = n)))) | (~int_less(int_zero, tptp_fun_K_0(J!1, I!2))) | (~(plus(I!2, tptp_fun_K_0(J!1, I!2)) = n))),
% 1.03/1.21 inference(modus_ponens,[status(thm)],[218, 217])).
% 1.03/1.21 tff(220,plain,
% 1.03/1.21 (~(plus(I!2, tptp_fun_K_0(J!1, I!2)) = n)),
% 1.03/1.21 inference(unit_resolution,[status(thm)],[219, 147, 216])).
% 1.03/1.21 tff(221,plain,
% 1.03/1.21 (~(J!1 = n)),
% 1.03/1.21 inference(modus_ponens,[status(thm)],[220, 204])).
% 1.03/1.21 tff(222,plain,
% 1.03/1.21 ((~![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)))),
% 1.03/1.21 inference(quant_inst,[status(thm)],[])).
% 1.03/1.21 tff(223,plain,
% 1.03/1.21 (int_leq(J!1, n) <=> ((J!1 = n) | int_less(J!1, n))),
% 1.03/1.21 inference(unit_resolution,[status(thm)],[222, 10])).
% 1.03/1.21 tff(224,plain,
% 1.03/1.21 ((~(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))),
% 1.03/1.21 inference(tautology,[status(thm)],[])).
% 1.03/1.21 tff(225,plain,
% 1.03/1.21 ((~(int_leq(J!1, n) <=> ((J!1 = n) | int_less(J!1, n)))) | ((J!1 = n) | int_less(J!1, n))),
% 1.03/1.21 inference(unit_resolution,[status(thm)],[224, 161])).
% 1.03/1.21 tff(226,plain,
% 1.03/1.21 ((J!1 = n) | int_less(J!1, n)),
% 1.03/1.21 inference(unit_resolution,[status(thm)],[225, 223])).
% 1.03/1.21 tff(227,plain,
% 1.03/1.21 ((~((J!1 = n) | int_less(J!1, n))) | (J!1 = n) | int_less(J!1, n)),
% 1.03/1.22 inference(tautology,[status(thm)],[])).
% 1.03/1.22 tff(228,plain,
% 1.03/1.22 ((J!1 = n) | int_less(J!1, n)),
% 1.03/1.22 inference(unit_resolution,[status(thm)],[227, 226])).
% 1.03/1.22 tff(229,plain,
% 1.03/1.22 (int_less(J!1, n)),
% 1.03/1.22 inference(unit_resolution,[status(thm)],[228, 221])).
% 1.03/1.22 tff(230,plain,
% 1.03/1.22 (((~![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))),
% 1.03/1.22 inference(rewrite,[status(thm)],[])).
% 1.03/1.22 tff(231,plain,
% 1.03/1.22 ((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))),
% 1.03/1.22 inference(rewrite,[status(thm)],[])).
% 1.03/1.22 tff(232,plain,
% 1.03/1.22 (((~![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)))),
% 1.03/1.22 inference(monotonicity,[status(thm)],[231])).
% 1.03/1.22 tff(233,plain,
% 1.03/1.22 (((~![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))),
% 1.03/1.22 inference(transitivity,[status(thm)],[232, 230])).
% 1.03/1.22 tff(234,plain,
% 1.03/1.22 ((~![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)))),
% 1.03/1.22 inference(quant_inst,[status(thm)],[])).
% 1.03/1.22 tff(235,plain,
% 1.03/1.22 ((~![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)),
% 1.03/1.22 inference(modus_ponens,[status(thm)],[234, 233])).
% 1.03/1.22 tff(236,plain,
% 1.03/1.22 ($false),
% 1.03/1.22 inference(unit_resolution,[status(thm)],[235, 84, 44, 229, 202])).
% 1.03/1.22 % SZS output end Proof
% 1.06/1.22 % E exiting
%------------------------------------------------------------------------------