TSTP Solution File: SWV488+2 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SWV488+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n001.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 29 15:17:48 EDT 2022
% Result : Theorem 0.12s 0.40s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWV488+2 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.12/0.34 % Computer : n001.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sun Sep 4 04:19:57 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.34 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.12/0.34 Usage: tptp [options] [-file:]file
% 0.12/0.34 -h, -? prints this message.
% 0.12/0.34 -smt2 print SMT-LIB2 benchmark.
% 0.12/0.34 -m, -model generate model.
% 0.12/0.34 -p, -proof generate proof.
% 0.12/0.34 -c, -core generate unsat core of named formulas.
% 0.12/0.34 -st, -statistics display statistics.
% 0.12/0.34 -t:timeout set timeout (in second).
% 0.12/0.34 -smt2status display status in smt2 format instead of SZS.
% 0.12/0.34 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.12/0.34 -<param>:<value> configuration parameter and value.
% 0.12/0.34 -o:<output-file> file to place output in.
% 0.12/0.40 % SZS status Theorem
% 0.12/0.40 % SZS output start Proof
% 0.12/0.40 tff(int_leq_type, type, (
% 0.12/0.40 int_leq: ( $i * $i ) > $o)).
% 0.12/0.40 tff(tptp_fun_J_1_type, type, (
% 0.12/0.40 tptp_fun_J_1: $i)).
% 0.12/0.40 tff(tptp_fun_I_2_type, type, (
% 0.12/0.40 tptp_fun_I_2: $i)).
% 0.12/0.40 tff(n_type, type, (
% 0.12/0.40 n: $i)).
% 0.12/0.40 tff(int_one_type, type, (
% 0.12/0.40 int_one: $i)).
% 0.12/0.40 tff(real_zero_type, type, (
% 0.12/0.40 real_zero: $i)).
% 0.12/0.40 tff(a_type, type, (
% 0.12/0.40 a: ( $i * $i ) > $i)).
% 0.12/0.40 tff(real_one_type, type, (
% 0.12/0.40 real_one: $i)).
% 0.12/0.40 tff(plus_type, type, (
% 0.12/0.40 plus: ( $i * $i ) > $i)).
% 0.12/0.40 tff(int_less_type, type, (
% 0.12/0.40 int_less: ( $i * $i ) > $o)).
% 0.12/0.40 tff(int_zero_type, type, (
% 0.12/0.40 int_zero: $i)).
% 0.12/0.40 tff(lu_type, type, (
% 0.12/0.40 lu: ( $i * $i ) > $i)).
% 0.12/0.40 tff(1,plain,
% 0.12/0.40 ((~![I: $i, J: $i] : ((~(I = J)) | (~(a(I, J) = real_zero)) | (~(int_leq(int_one, I) & int_leq(I, J) & int_leq(J, n))))) <=> (~![I: $i, J: $i] : ((~(I = J)) | (~(a(I, J) = real_zero)) | (~(int_leq(int_one, I) & int_leq(I, J) & int_leq(J, n)))))),
% 0.12/0.40 inference(rewrite,[status(thm)],[])).
% 0.12/0.40 tff(2,plain,
% 0.12/0.40 ((~![I: $i, J: $i] : (((int_leq(int_one, I) & int_leq(I, J)) & int_leq(J, n)) => ((I = J) => (~(a(I, J) = real_zero))))) <=> (~![I: $i, J: $i] : ((~(I = J)) | (~(a(I, J) = real_zero)) | (~(int_leq(int_one, I) & int_leq(I, J) & int_leq(J, n)))))),
% 0.12/0.40 inference(rewrite,[status(thm)],[])).
% 0.12/0.40 tff(3,axiom,(~![I: $i, J: $i] : (((int_leq(int_one, I) & int_leq(I, J)) & int_leq(J, n)) => ((I = J) => (~(a(I, J) = real_zero))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','lti')).
% 0.12/0.40 tff(4,plain,
% 0.12/0.40 (~![I: $i, J: $i] : ((~(I = J)) | (~(a(I, J) = real_zero)) | (~(int_leq(int_one, I) & int_leq(I, J) & int_leq(J, n))))),
% 0.12/0.40 inference(modus_ponens,[status(thm)],[3, 2])).
% 0.12/0.40 tff(5,plain,
% 0.12/0.40 (~![I: $i, J: $i] : ((~(I = J)) | (~(a(I, J) = real_zero)) | (~(int_leq(int_one, I) & int_leq(I, J) & int_leq(J, n))))),
% 0.12/0.40 inference(modus_ponens,[status(thm)],[4, 1])).
% 0.12/0.40 tff(6,plain,
% 0.12/0.40 (~![I: $i, J: $i] : ((~(I = J)) | (~(a(I, J) = real_zero)) | (~(int_leq(int_one, I) & int_leq(I, J) & int_leq(J, n))))),
% 0.12/0.40 inference(modus_ponens,[status(thm)],[5, 1])).
% 0.12/0.40 tff(7,plain,
% 0.12/0.40 (~![I: $i, J: $i] : ((~(I = J)) | (~(a(I, J) = real_zero)) | (~(int_leq(int_one, I) & int_leq(I, J) & int_leq(J, n))))),
% 0.12/0.40 inference(modus_ponens,[status(thm)],[6, 1])).
% 0.12/0.40 tff(8,plain,
% 0.12/0.40 (~![I: $i, J: $i] : ((~(I = J)) | (~(a(I, J) = real_zero)) | (~(int_leq(int_one, I) & int_leq(I, J) & int_leq(J, n))))),
% 0.12/0.40 inference(modus_ponens,[status(thm)],[7, 1])).
% 0.12/0.40 tff(9,plain,
% 0.12/0.40 (~![I: $i, J: $i] : ((~(I = J)) | (~(a(I, J) = real_zero)) | (~(int_leq(int_one, I) & int_leq(I, J) & int_leq(J, n))))),
% 0.12/0.40 inference(modus_ponens,[status(thm)],[8, 1])).
% 0.12/0.40 tff(10,plain,
% 0.12/0.40 (~![I: $i, J: $i] : ((~(I = J)) | (~(a(I, J) = real_zero)) | (~(int_leq(int_one, I) & int_leq(I, J) & int_leq(J, n))))),
% 0.12/0.40 inference(modus_ponens,[status(thm)],[9, 1])).
% 0.12/0.40 tff(11,plain,(
% 0.12/0.40 ~((~(I!2 = J!1)) | (~(a(I!2, J!1) = real_zero)) | (~(int_leq(int_one, I!2) & int_leq(I!2, J!1) & int_leq(J!1, n))))),
% 0.12/0.40 inference(skolemize,[status(sab)],[10])).
% 0.12/0.40 tff(12,plain,
% 0.12/0.40 (I!2 = J!1),
% 0.12/0.40 inference(or_elim,[status(thm)],[11])).
% 0.12/0.40 tff(13,plain,
% 0.12/0.40 (J!1 = I!2),
% 0.12/0.40 inference(symmetry,[status(thm)],[12])).
% 0.12/0.40 tff(14,plain,
% 0.12/0.40 (int_leq(J!1, J!1) <=> int_leq(I!2, J!1)),
% 0.12/0.40 inference(monotonicity,[status(thm)],[13])).
% 0.12/0.40 tff(15,plain,
% 0.12/0.40 (int_leq(I!2, J!1) <=> int_leq(J!1, J!1)),
% 0.12/0.40 inference(symmetry,[status(thm)],[14])).
% 0.12/0.40 tff(16,plain,
% 0.12/0.40 (int_leq(int_one, I!2) & int_leq(I!2, J!1) & int_leq(J!1, n)),
% 0.12/0.40 inference(or_elim,[status(thm)],[11])).
% 0.12/0.40 tff(17,plain,
% 0.12/0.40 (int_leq(I!2, J!1)),
% 0.12/0.40 inference(and_elim,[status(thm)],[16])).
% 0.12/0.40 tff(18,plain,
% 0.12/0.40 (int_leq(J!1, J!1)),
% 0.12/0.40 inference(modus_ponens,[status(thm)],[17, 15])).
% 0.12/0.40 tff(19,plain,
% 0.12/0.40 (a(I!2, J!1) = real_zero),
% 0.12/0.40 inference(or_elim,[status(thm)],[11])).
% 0.12/0.40 tff(20,plain,
% 0.12/0.40 (a(J!1, J!1) = a(I!2, J!1)),
% 0.12/0.40 inference(monotonicity,[status(thm)],[13])).
% 0.12/0.40 tff(21,plain,
% 0.12/0.40 (a(J!1, J!1) = real_zero),
% 0.12/0.40 inference(transitivity,[status(thm)],[20, 19])).
% 0.12/0.40 tff(22,plain,
% 0.12/0.40 ((a(J!1, J!1) = real_one) <=> (real_zero = real_one)),
% 0.12/0.40 inference(monotonicity,[status(thm)],[21])).
% 0.12/0.40 tff(23,plain,
% 0.12/0.40 ((real_zero = real_one) <=> (a(J!1, J!1) = real_one)),
% 0.12/0.40 inference(symmetry,[status(thm)],[22])).
% 0.12/0.40 tff(24,plain,
% 0.12/0.40 ((~(real_zero = real_one)) <=> (~(a(J!1, J!1) = real_one))),
% 0.12/0.40 inference(monotonicity,[status(thm)],[23])).
% 0.12/0.40 tff(25,plain,
% 0.12/0.40 ((~(real_zero = real_one)) <=> (~(real_zero = real_one))),
% 0.12/0.40 inference(rewrite,[status(thm)],[])).
% 0.12/0.40 tff(26,axiom,(~(real_zero = real_one)), file('/export/starexec/sandbox/benchmark/theBenchmark.p','real_constants')).
% 0.12/0.40 tff(27,plain,
% 0.12/0.40 (~(real_zero = real_one)),
% 0.12/0.40 inference(modus_ponens,[status(thm)],[26, 25])).
% 0.12/0.40 tff(28,plain,
% 0.12/0.40 (~(a(J!1, J!1) = real_one)),
% 0.12/0.40 inference(modus_ponens,[status(thm)],[27, 24])).
% 0.12/0.40 tff(29,plain,
% 0.12/0.40 (int_leq(int_one, J!1) <=> int_leq(int_one, I!2)),
% 0.12/0.40 inference(monotonicity,[status(thm)],[13])).
% 0.12/0.40 tff(30,plain,
% 0.12/0.40 (int_leq(int_one, I!2) <=> int_leq(int_one, J!1)),
% 0.12/0.40 inference(symmetry,[status(thm)],[29])).
% 0.12/0.40 tff(31,plain,
% 0.12/0.40 (int_leq(int_one, I!2)),
% 0.12/0.40 inference(and_elim,[status(thm)],[16])).
% 0.12/0.40 tff(32,plain,
% 0.12/0.40 (int_leq(int_one, J!1)),
% 0.12/0.40 inference(modus_ponens,[status(thm)],[31, 30])).
% 0.12/0.40 tff(33,plain,
% 0.12/0.40 (int_leq(J!1, n)),
% 0.12/0.40 inference(and_elim,[status(thm)],[16])).
% 0.12/0.40 tff(34,plain,
% 0.12/0.40 (^[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) = lu(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I)))))))) <=> ((~int_leq(int_one, I)) | (~int_leq(I, n)) | (~int_leq(int_one, J)) | (~int_leq(J, n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = lu(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I)))))))))),
% 0.12/0.40 inference(bind,[status(th)],[])).
% 0.12/0.40 tff(35,plain,
% 0.12/0.40 (![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) = lu(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I)))))))) <=> ![I: $i, J: $i] : ((~int_leq(int_one, I)) | (~int_leq(I, n)) | (~int_leq(int_one, J)) | (~int_leq(J, n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = lu(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I))))))))),
% 0.12/0.40 inference(quant_intro,[status(thm)],[34])).
% 0.12/0.40 tff(36,plain,
% 0.12/0.40 (^[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) = lu(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I)))))))) <=> ((~int_leq(int_one, I)) | (~int_leq(I, n)) | (~int_leq(int_one, J)) | (~int_leq(J, n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = lu(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I)))))))))),
% 0.12/0.40 inference(bind,[status(th)],[])).
% 0.12/0.40 tff(37,plain,
% 0.12/0.40 (![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) = lu(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I)))))))) <=> ![I: $i, J: $i] : ((~int_leq(int_one, I)) | (~int_leq(I, n)) | (~int_leq(int_one, J)) | (~int_leq(J, n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = lu(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I))))))))),
% 0.12/0.40 inference(quant_intro,[status(thm)],[36])).
% 0.12/0.40 tff(38,plain,
% 0.12/0.40 (![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) = lu(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I)))))))) <=> ![I: $i, J: $i] : ((~int_leq(int_one, I)) | (~int_leq(I, n)) | (~int_leq(int_one, J)) | (~int_leq(J, n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = lu(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I))))))))),
% 0.12/0.40 inference(transitivity,[status(thm)],[37, 35])).
% 0.12/0.40 tff(39,plain,
% 0.12/0.40 (^[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) = lu(plus(K, C), K))) <=> (((~int_leq(int_one, K)) | (~int_leq(K, J))) | (a(plus(K, C), K) = lu(plus(K, C), K))))), rewrite((((~int_leq(int_one, K)) | (~int_leq(K, J))) | (a(plus(K, C), K) = lu(plus(K, C), K))) <=> ((a(plus(K, C), K) = lu(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) = lu(plus(K, C), K))) <=> ((a(plus(K, C), K) = lu(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) = lu(plus(K, C), K))) <=> ![K: $i] : ((a(plus(K, C), K) = lu(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) = lu(plus(K, C), K)))) <=> (((~int_less(int_zero, C)) | (~(I = plus(J, C)))) | ![K: $i] : ((a(plus(K, C), K) = lu(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) = lu(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) = lu(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) = lu(plus(K, C), K)))) <=> ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = lu(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) = lu(plus(K, C), K)))) <=> ![C: $i] : ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = lu(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J)))))), quant_intro(proof_bind(^[K: $i] : trans(monotonicity(trans(monotonicity(rewrite((int_leq(int_one, K) & int_leq(K, J)) <=> (~((~int_leq(int_one, K)) | (~int_leq(K, J))))), ((~(int_leq(int_one, K) & int_leq(K, J))) <=> (~(~((~int_leq(int_one, K)) | (~int_leq(K, J))))))), rewrite((~(~((~int_leq(int_one, K)) | (~int_leq(K, J))))) <=> ((~int_leq(int_one, K)) | (~int_leq(K, J)))), ((~(int_leq(int_one, K) & int_leq(K, J))) <=> ((~int_leq(int_one, K)) | (~int_leq(K, J))))), (((~(int_leq(int_one, K) & int_leq(K, J))) | (a(K, K) = real_one)) <=> (((~int_leq(int_one, K)) | (~int_leq(K, J))) | (a(K, K) = real_one)))), rewrite((((~int_leq(int_one, K)) | (~int_leq(K, J))) | (a(K, K) = real_one)) <=> ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))), (((~(int_leq(int_one, K) & int_leq(K, J))) | (a(K, K) = real_one)) <=> ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))))), (![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(K, K) = real_one)) <=> ![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J))))), quant_intro(proof_bind(^[C: $i] : trans(monotonicity(trans(monotonicity(rewrite((int_less(int_zero, C) & (J = plus(I, C))) <=> (~((~int_less(int_zero, C)) | (~(J = plus(I, C)))))), ((~(int_less(int_zero, C) & (J = plus(I, C)))) <=> (~(~((~int_less(int_zero, C)) | (~(J = plus(I, C)))))))), rewrite((~(~((~int_less(int_zero, C)) | (~(J = plus(I, C)))))) <=> ((~int_less(int_zero, C)) | (~(J = plus(I, C))))), ((~(int_less(int_zero, C) & (J = plus(I, C)))) <=> ((~int_less(int_zero, C)) | (~(J = plus(I, C)))))), quant_intro(proof_bind(^[K: $i] : trans(monotonicity(trans(monotonicity(rewrite((int_leq(int_one, K) & int_leq(K, I)) <=> (~((~int_leq(int_one, K)) | (~int_leq(K, I))))), ((~(int_leq(int_one, K) & int_leq(K, I))) <=> (~(~((~int_leq(int_one, K)) | (~int_leq(K, I))))))), rewrite((~(~((~int_leq(int_one, K)) | (~int_leq(K, I))))) <=> ((~int_leq(int_one, K)) | (~int_leq(K, I)))), ((~(int_leq(int_one, K) & int_leq(K, I))) <=> ((~int_leq(int_one, K)) | (~int_leq(K, I))))), (((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero)) <=> (((~int_leq(int_one, K)) | (~int_leq(K, I))) | (a(K, plus(K, C)) = real_zero)))), rewrite((((~int_leq(int_one, K)) | (~int_leq(K, I))) | (a(K, plus(K, C)) = real_zero)) <=> ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I)))), (((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero)) <=> ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I)))))), (![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero)) <=> ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I))))), (((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero))) <=> (((~int_less(int_zero, C)) | (~(J = plus(I, C)))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I)))))), rewrite((((~int_less(int_zero, C)) | (~(J = plus(I, C)))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I)))) <=> ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I))))), (((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero))) <=> ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I))))))), (![C: $i] : ((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero))) <=> ![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I)))))), ((![C: $i] : ((~(int_less(int_zero, C) & (I = plus(J, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(plus(K, C), K) = lu(plus(K, C), K)))) & ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(K, K) = real_one)) & ![C: $i] : ((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero)))) <=> (![C: $i] : ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = lu(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) & ![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J))) & ![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I))))))), rewrite((![C: $i] : ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = lu(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) & ![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J))) & ![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I))))) <=> (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = lu(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I)))))))), ((![C: $i] : ((~(int_less(int_zero, C) & (I = plus(J, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(plus(K, C), K) = lu(plus(K, C), K)))) & ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(K, K) = real_one)) & ![C: $i] : ((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero)))) <=> (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = lu(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I))))))))), (((~(int_leq(int_one, I) & int_leq(I, n) & int_leq(int_one, J) & int_leq(J, n))) | (![C: $i] : ((~(int_less(int_zero, C) & (I = plus(J, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(plus(K, C), K) = lu(plus(K, C), K)))) & ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(K, K) = real_one)) & ![C: $i] : ((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero))))) <=> (((~int_leq(int_one, I)) | (~int_leq(I, n)) | (~int_leq(int_one, J)) | (~int_leq(J, n))) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = lu(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I)))))))))), rewrite((((~int_leq(int_one, I)) | (~int_leq(I, n)) | (~int_leq(int_one, J)) | (~int_leq(J, n))) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = lu(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I)))))))) <=> ((~int_leq(int_one, I)) | (~int_leq(I, n)) | (~int_leq(int_one, J)) | (~int_leq(J, n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = lu(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I))))))))), (((~(int_leq(int_one, I) & int_leq(I, n) & int_leq(int_one, J) & int_leq(J, n))) | (![C: $i] : ((~(int_less(int_zero, C) & (I = plus(J, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(plus(K, C), K) = lu(plus(K, C), K)))) & ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(K, K) = real_one)) & ![C: $i] : ((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero))))) <=> ((~int_leq(int_one, I)) | (~int_leq(I, n)) | (~int_leq(int_one, J)) | (~int_leq(J, n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = lu(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I))))))))))),
% 0.20/0.41 inference(bind,[status(th)],[])).
% 0.20/0.41 tff(40,plain,
% 0.20/0.41 (![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) = lu(plus(K, C), K)))) & ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(K, K) = real_one)) & ![C: $i] : ((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero))))) <=> ![I: $i, J: $i] : ((~int_leq(int_one, I)) | (~int_leq(I, n)) | (~int_leq(int_one, J)) | (~int_leq(J, n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(I = plus(J, C))) | ![K: $i] : ((a(plus(K, C), K) = lu(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I))))))))),
% 0.20/0.42 inference(quant_intro,[status(thm)],[39])).
% 0.20/0.42 tff(41,plain,
% 0.20/0.42 (![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) = lu(plus(K, C), K)))) & ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(K, K) = real_one)) & ![C: $i] : ((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero))))) <=> ![I: $i, J: $i] : ((~(int_leq(int_one, I) & int_leq(I, n) & int_leq(int_one, J) & int_leq(J, n))) | (![C: $i] : ((~(int_less(int_zero, C) & (I = plus(J, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(plus(K, C), K) = lu(plus(K, C), K)))) & ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(K, K) = real_one)) & ![C: $i] : ((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero)))))),
% 0.20/0.42 inference(rewrite,[status(thm)],[])).
% 0.20/0.42 tff(42,plain,
% 0.20/0.42 (^[I: $i, J: $i] : trans(monotonicity(trans(monotonicity(rewrite(((int_leq(int_one, I) & int_leq(I, n)) & int_leq(int_one, J)) <=> (int_leq(int_one, I) & int_leq(I, n) & int_leq(int_one, J))), ((((int_leq(int_one, I) & int_leq(I, n)) & int_leq(int_one, J)) & int_leq(J, n)) <=> ((int_leq(int_one, I) & int_leq(I, n) & int_leq(int_one, J)) & int_leq(J, n)))), rewrite(((int_leq(int_one, I) & int_leq(I, n) & int_leq(int_one, J)) & int_leq(J, n)) <=> (int_leq(int_one, I) & int_leq(I, n) & int_leq(int_one, J) & int_leq(J, n))), ((((int_leq(int_one, I) & int_leq(I, n)) & int_leq(int_one, J)) & int_leq(J, n)) <=> (int_leq(int_one, I) & int_leq(I, n) & int_leq(int_one, J) & int_leq(J, n)))), trans(monotonicity(rewrite((![C: $i] : ((int_less(int_zero, C) & (I = plus(J, C))) => ![K: $i] : ((int_leq(int_one, K) & int_leq(K, J)) => (a(plus(K, C), K) = lu(plus(K, C), K)))) & ![K: $i] : ((int_leq(int_one, K) & int_leq(K, J)) => (a(K, K) = real_one))) <=> (![C: $i] : ((~(int_less(int_zero, C) & (I = plus(J, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(plus(K, C), K) = lu(plus(K, C), K)))) & ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(K, K) = real_one)))), quant_intro(proof_bind(^[C: $i] : trans(monotonicity(quant_intro(proof_bind(^[K: $i] : rewrite(((int_leq(int_one, K) & int_leq(K, I)) => (a(K, plus(K, C)) = real_zero)) <=> ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero)))), (![K: $i] : ((int_leq(int_one, K) & int_leq(K, I)) => (a(K, plus(K, C)) = real_zero)) <=> ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero)))), (((int_less(int_zero, C) & (J = plus(I, C))) => ![K: $i] : ((int_leq(int_one, K) & int_leq(K, I)) => (a(K, plus(K, C)) = real_zero))) <=> ((int_less(int_zero, C) & (J = plus(I, C))) => ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero))))), rewrite(((int_less(int_zero, C) & (J = plus(I, C))) => ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero))) <=> ((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero)))), (((int_less(int_zero, C) & (J = plus(I, C))) => ![K: $i] : ((int_leq(int_one, K) & int_leq(K, I)) => (a(K, plus(K, C)) = real_zero))) <=> ((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero)))))), (![C: $i] : ((int_less(int_zero, C) & (J = plus(I, C))) => ![K: $i] : ((int_leq(int_one, K) & int_leq(K, I)) => (a(K, plus(K, C)) = real_zero))) <=> ![C: $i] : ((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero))))), (((![C: $i] : ((int_less(int_zero, C) & (I = plus(J, C))) => ![K: $i] : ((int_leq(int_one, K) & int_leq(K, J)) => (a(plus(K, C), K) = lu(plus(K, C), K)))) & ![K: $i] : ((int_leq(int_one, K) & int_leq(K, J)) => (a(K, K) = real_one))) & ![C: $i] : ((int_less(int_zero, C) & (J = plus(I, C))) => ![K: $i] : ((int_leq(int_one, K) & int_leq(K, I)) => (a(K, plus(K, C)) = real_zero)))) <=> ((![C: $i] : ((~(int_less(int_zero, C) & (I = plus(J, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(plus(K, C), K) = lu(plus(K, C), K)))) & ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(K, K) = real_one))) & ![C: $i] : ((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero)))))), rewrite(((![C: $i] : ((~(int_less(int_zero, C) & (I = plus(J, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(plus(K, C), K) = lu(plus(K, C), K)))) & ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(K, K) = real_one))) & ![C: $i] : ((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero)))) <=> (![C: $i] : ((~(int_less(int_zero, C) & (I = plus(J, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(plus(K, C), K) = lu(plus(K, C), K)))) & ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(K, K) = real_one)) & ![C: $i] : ((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero))))), (((![C: $i] : ((int_less(int_zero, C) & (I = plus(J, C))) => ![K: $i] : ((int_leq(int_one, K) & int_leq(K, J)) => (a(plus(K, C), K) = lu(plus(K, C), K)))) & ![K: $i] : ((int_leq(int_one, K) & int_leq(K, J)) => (a(K, K) = real_one))) & ![C: $i] : ((int_less(int_zero, C) & (J = plus(I, C))) => ![K: $i] : ((int_leq(int_one, K) & int_leq(K, I)) => (a(K, plus(K, C)) = real_zero)))) <=> (![C: $i] : ((~(int_less(int_zero, C) & (I = plus(J, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(plus(K, C), K) = lu(plus(K, C), K)))) & ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(K, K) = real_one)) & ![C: $i] : ((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero)))))), (((((int_leq(int_one, I) & int_leq(I, n)) & int_leq(int_one, J)) & int_leq(J, n)) => ((![C: $i] : ((int_less(int_zero, C) & (I = plus(J, C))) => ![K: $i] : ((int_leq(int_one, K) & int_leq(K, J)) => (a(plus(K, C), K) = lu(plus(K, C), K)))) & ![K: $i] : ((int_leq(int_one, K) & int_leq(K, J)) => (a(K, K) = real_one))) & ![C: $i] : ((int_less(int_zero, C) & (J = plus(I, C))) => ![K: $i] : ((int_leq(int_one, K) & int_leq(K, I)) => (a(K, plus(K, C)) = real_zero))))) <=> ((int_leq(int_one, I) & int_leq(I, n) & int_leq(int_one, J) & int_leq(J, n)) => (![C: $i] : ((~(int_less(int_zero, C) & (I = plus(J, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(plus(K, C), K) = lu(plus(K, C), K)))) & ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(K, K) = real_one)) & ![C: $i] : ((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero))))))), rewrite(((int_leq(int_one, I) & int_leq(I, n) & int_leq(int_one, J) & int_leq(J, n)) => (![C: $i] : ((~(int_less(int_zero, C) & (I = plus(J, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(plus(K, C), K) = lu(plus(K, C), K)))) & ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(K, K) = real_one)) & ![C: $i] : ((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero))))) <=> ((~(int_leq(int_one, I) & int_leq(I, n) & int_leq(int_one, J) & int_leq(J, n))) | (![C: $i] : ((~(int_less(int_zero, C) & (I = plus(J, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(plus(K, C), K) = lu(plus(K, C), K)))) & ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(K, K) = real_one)) & ![C: $i] : ((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero)))))), (((((int_leq(int_one, I) & int_leq(I, n)) & int_leq(int_one, J)) & int_leq(J, n)) => ((![C: $i] : ((int_less(int_zero, C) & (I = plus(J, C))) => ![K: $i] : ((int_leq(int_one, K) & int_leq(K, J)) => (a(plus(K, C), K) = lu(plus(K, C), K)))) & ![K: $i] : ((int_leq(int_one, K) & int_leq(K, J)) => (a(K, K) = real_one))) & ![C: $i] : ((int_less(int_zero, C) & (J = plus(I, C))) => ![K: $i] : ((int_leq(int_one, K) & int_leq(K, I)) => (a(K, plus(K, C)) = real_zero))))) <=> ((~(int_leq(int_one, I) & int_leq(I, n) & int_leq(int_one, J) & int_leq(J, n))) | (![C: $i] : ((~(int_less(int_zero, C) & (I = plus(J, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(plus(K, C), K) = lu(plus(K, C), K)))) & ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(K, K) = real_one)) & ![C: $i] : ((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero)))))))),
% 0.20/0.42 inference(bind,[status(th)],[])).
% 0.20/0.42 tff(43,plain,
% 0.20/0.42 (![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) = lu(plus(K, C), K)))) & ![K: $i] : ((int_leq(int_one, K) & int_leq(K, J)) => (a(K, K) = real_one))) & ![C: $i] : ((int_less(int_zero, C) & (J = plus(I, C))) => ![K: $i] : ((int_leq(int_one, K) & int_leq(K, I)) => (a(K, plus(K, C)) = real_zero))))) <=> ![I: $i, J: $i] : ((~(int_leq(int_one, I) & int_leq(I, n) & int_leq(int_one, J) & int_leq(J, n))) | (![C: $i] : ((~(int_less(int_zero, C) & (I = plus(J, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(plus(K, C), K) = lu(plus(K, C), K)))) & ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(K, K) = real_one)) & ![C: $i] : ((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero)))))),
% 0.20/0.42 inference(quant_intro,[status(thm)],[42])).
% 0.20/0.42 tff(44,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) = lu(plus(K, C), K)))) & ![K: $i] : ((int_leq(int_one, K) & int_leq(K, J)) => (a(K, K) = real_one))) & ![C: $i] : ((int_less(int_zero, C) & (J = plus(I, C))) => ![K: $i] : ((int_leq(int_one, K) & int_leq(K, I)) => (a(K, plus(K, C)) = real_zero)))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','qil')).
% 0.20/0.42 tff(45,plain,
% 0.20/0.42 (![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) = lu(plus(K, C), K)))) & ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(K, K) = real_one)) & ![C: $i] : ((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero)))))),
% 0.20/0.42 inference(modus_ponens,[status(thm)],[44, 43])).
% 0.20/0.42 tff(46,plain,
% 0.20/0.42 (![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) = lu(plus(K, C), K)))) & ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(K, K) = real_one)) & ![C: $i] : ((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero)))))),
% 0.20/0.42 inference(modus_ponens,[status(thm)],[45, 41])).
% 0.20/0.42 tff(47,plain,(
% 0.20/0.42 ![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) = lu(plus(K, C), K)))) & ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, J))) | (a(K, K) = real_one)) & ![C: $i] : ((~(int_less(int_zero, C) & (J = plus(I, C)))) | ![K: $i] : ((~(int_leq(int_one, K) & int_leq(K, I))) | (a(K, plus(K, C)) = real_zero)))))),
% 0.20/0.43 inference(skolemize,[status(sab)],[46])).
% 0.20/0.43 tff(48,plain,
% 0.20/0.43 (![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) = lu(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I))))))))),
% 0.20/0.43 inference(modus_ponens,[status(thm)],[47, 40])).
% 0.20/0.43 tff(49,plain,
% 0.20/0.43 (![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) = lu(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I))))))))),
% 0.20/0.43 inference(modus_ponens,[status(thm)],[48, 38])).
% 0.20/0.43 tff(50,plain,
% 0.20/0.43 (((~![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) = lu(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I))))))))) | ((~int_leq(J!1, n)) | (~int_leq(int_one, J!1)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(J!1 = plus(J!1, C))) | ![K: $i] : ((a(plus(K, C), K) = lu(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J!1))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J!1)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J!1 = plus(J!1, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J!1))))))))) <=> ((~![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) = lu(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I))))))))) | (~int_leq(J!1, n)) | (~int_leq(int_one, J!1)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(J!1 = plus(J!1, C))) | ![K: $i] : ((a(plus(K, C), K) = lu(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J!1))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J!1)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J!1 = plus(J!1, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J!1))))))))),
% 0.20/0.43 inference(rewrite,[status(thm)],[])).
% 0.20/0.43 tff(51,plain,
% 0.20/0.43 (((~int_leq(int_one, J!1)) | (~int_leq(J!1, n)) | (~int_leq(int_one, J!1)) | (~int_leq(J!1, n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(J!1 = plus(J!1, C))) | ![K: $i] : ((a(plus(K, C), K) = lu(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J!1))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J!1)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J!1 = plus(J!1, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J!1)))))))) <=> ((~int_leq(J!1, n)) | (~int_leq(int_one, J!1)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(J!1 = plus(J!1, C))) | ![K: $i] : ((a(plus(K, C), K) = lu(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J!1))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J!1)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J!1 = plus(J!1, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J!1))))))))),
% 0.20/0.43 inference(rewrite,[status(thm)],[])).
% 0.20/0.43 tff(52,plain,
% 0.20/0.43 ((~((~![C: $i] : ((~int_less(int_zero, C)) | (~(J!1 = plus(J!1, C))) | ![K: $i] : ((a(plus(K, C), K) = lu(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J!1))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J!1)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J!1 = plus(J!1, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J!1))))))) <=> (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(J!1 = plus(J!1, C))) | ![K: $i] : ((a(plus(K, C), K) = lu(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J!1))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J!1)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J!1 = plus(J!1, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J!1)))))))),
% 0.20/0.43 inference(rewrite,[status(thm)],[])).
% 0.20/0.43 tff(53,plain,
% 0.20/0.43 (((~int_leq(int_one, J!1)) | (~int_leq(J!1, n)) | (~int_leq(int_one, J!1)) | (~int_leq(J!1, n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(J!1 = plus(J!1, C))) | ![K: $i] : ((a(plus(K, C), K) = lu(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J!1))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J!1)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J!1 = plus(J!1, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J!1)))))))) <=> ((~int_leq(int_one, J!1)) | (~int_leq(J!1, n)) | (~int_leq(int_one, J!1)) | (~int_leq(J!1, n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(J!1 = plus(J!1, C))) | ![K: $i] : ((a(plus(K, C), K) = lu(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J!1))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J!1)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J!1 = plus(J!1, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J!1))))))))),
% 0.20/0.43 inference(monotonicity,[status(thm)],[52])).
% 0.20/0.43 tff(54,plain,
% 0.20/0.43 (((~int_leq(int_one, J!1)) | (~int_leq(J!1, n)) | (~int_leq(int_one, J!1)) | (~int_leq(J!1, n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(J!1 = plus(J!1, C))) | ![K: $i] : ((a(plus(K, C), K) = lu(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J!1))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J!1)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J!1 = plus(J!1, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J!1)))))))) <=> ((~int_leq(J!1, n)) | (~int_leq(int_one, J!1)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(J!1 = plus(J!1, C))) | ![K: $i] : ((a(plus(K, C), K) = lu(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J!1))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J!1)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J!1 = plus(J!1, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J!1))))))))),
% 0.20/0.43 inference(transitivity,[status(thm)],[53, 51])).
% 0.20/0.43 tff(55,plain,
% 0.20/0.43 (((~![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) = lu(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I))))))))) | ((~int_leq(int_one, J!1)) | (~int_leq(J!1, n)) | (~int_leq(int_one, J!1)) | (~int_leq(J!1, n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(J!1 = plus(J!1, C))) | ![K: $i] : ((a(plus(K, C), K) = lu(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J!1))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J!1)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J!1 = plus(J!1, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J!1))))))))) <=> ((~![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) = lu(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I))))))))) | ((~int_leq(J!1, n)) | (~int_leq(int_one, J!1)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(J!1 = plus(J!1, C))) | ![K: $i] : ((a(plus(K, C), K) = lu(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J!1))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J!1)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J!1 = plus(J!1, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J!1)))))))))),
% 0.20/0.43 inference(monotonicity,[status(thm)],[54])).
% 0.20/0.43 tff(56,plain,
% 0.20/0.43 (((~![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) = lu(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I))))))))) | ((~int_leq(int_one, J!1)) | (~int_leq(J!1, n)) | (~int_leq(int_one, J!1)) | (~int_leq(J!1, n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(J!1 = plus(J!1, C))) | ![K: $i] : ((a(plus(K, C), K) = lu(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J!1))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J!1)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J!1 = plus(J!1, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J!1))))))))) <=> ((~![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) = lu(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I))))))))) | (~int_leq(J!1, n)) | (~int_leq(int_one, J!1)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(J!1 = plus(J!1, C))) | ![K: $i] : ((a(plus(K, C), K) = lu(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J!1))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J!1)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J!1 = plus(J!1, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J!1))))))))),
% 0.20/0.43 inference(transitivity,[status(thm)],[55, 50])).
% 0.20/0.43 tff(57,plain,
% 0.20/0.43 ((~![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) = lu(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I))))))))) | ((~int_leq(int_one, J!1)) | (~int_leq(J!1, n)) | (~int_leq(int_one, J!1)) | (~int_leq(J!1, n)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(J!1 = plus(J!1, C))) | ![K: $i] : ((a(plus(K, C), K) = lu(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J!1))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J!1)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J!1 = plus(J!1, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J!1))))))))),
% 0.20/0.44 inference(quant_inst,[status(thm)],[])).
% 0.20/0.44 tff(58,plain,
% 0.20/0.44 ((~![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) = lu(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J = plus(I, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, I))))))))) | (~int_leq(J!1, n)) | (~int_leq(int_one, J!1)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(J!1 = plus(J!1, C))) | ![K: $i] : ((a(plus(K, C), K) = lu(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J!1))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J!1)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J!1 = plus(J!1, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J!1)))))))),
% 0.20/0.44 inference(modus_ponens,[status(thm)],[57, 56])).
% 0.20/0.44 tff(59,plain,
% 0.20/0.44 ((~int_leq(int_one, J!1)) | (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(J!1 = plus(J!1, C))) | ![K: $i] : ((a(plus(K, C), K) = lu(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J!1))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J!1)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J!1 = plus(J!1, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J!1)))))))),
% 0.20/0.44 inference(unit_resolution,[status(thm)],[58, 49, 33])).
% 0.20/0.44 tff(60,plain,
% 0.20/0.44 (~((~![C: $i] : ((~int_less(int_zero, C)) | (~(J!1 = plus(J!1, C))) | ![K: $i] : ((a(plus(K, C), K) = lu(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J!1))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J!1)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J!1 = plus(J!1, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J!1))))))),
% 0.20/0.44 inference(unit_resolution,[status(thm)],[59, 32])).
% 0.20/0.44 tff(61,plain,
% 0.20/0.44 (((~![C: $i] : ((~int_less(int_zero, C)) | (~(J!1 = plus(J!1, C))) | ![K: $i] : ((a(plus(K, C), K) = lu(plus(K, C), K)) | (~int_leq(int_one, K)) | (~int_leq(K, J!1))))) | (~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J!1)))) | (~![C: $i] : ((~int_less(int_zero, C)) | (~(J!1 = plus(J!1, C))) | ![K: $i] : ((a(K, plus(K, C)) = real_zero) | (~int_leq(int_one, K)) | (~int_leq(K, J!1)))))) | ![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J!1)))),
% 0.20/0.44 inference(tautology,[status(thm)],[])).
% 0.20/0.44 tff(62,plain,
% 0.20/0.44 (![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J!1)))),
% 0.20/0.44 inference(unit_resolution,[status(thm)],[61, 60])).
% 0.20/0.44 tff(63,plain,
% 0.20/0.44 (((~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J!1)))) | ((~int_leq(int_one, J!1)) | (a(J!1, J!1) = real_one) | (~int_leq(J!1, J!1)))) <=> ((~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J!1)))) | (~int_leq(int_one, J!1)) | (a(J!1, J!1) = real_one) | (~int_leq(J!1, J!1)))),
% 0.20/0.44 inference(rewrite,[status(thm)],[])).
% 0.20/0.44 tff(64,plain,
% 0.20/0.44 (((a(J!1, J!1) = real_one) | (~int_leq(int_one, J!1)) | (~int_leq(J!1, J!1))) <=> ((~int_leq(int_one, J!1)) | (a(J!1, J!1) = real_one) | (~int_leq(J!1, J!1)))),
% 0.20/0.44 inference(rewrite,[status(thm)],[])).
% 0.20/0.44 tff(65,plain,
% 0.20/0.44 (((~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J!1)))) | ((a(J!1, J!1) = real_one) | (~int_leq(int_one, J!1)) | (~int_leq(J!1, J!1)))) <=> ((~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J!1)))) | ((~int_leq(int_one, J!1)) | (a(J!1, J!1) = real_one) | (~int_leq(J!1, J!1))))),
% 0.20/0.44 inference(monotonicity,[status(thm)],[64])).
% 0.20/0.44 tff(66,plain,
% 0.20/0.44 (((~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J!1)))) | ((a(J!1, J!1) = real_one) | (~int_leq(int_one, J!1)) | (~int_leq(J!1, J!1)))) <=> ((~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J!1)))) | (~int_leq(int_one, J!1)) | (a(J!1, J!1) = real_one) | (~int_leq(J!1, J!1)))),
% 0.20/0.44 inference(transitivity,[status(thm)],[65, 63])).
% 0.20/0.44 tff(67,plain,
% 0.20/0.44 ((~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J!1)))) | ((a(J!1, J!1) = real_one) | (~int_leq(int_one, J!1)) | (~int_leq(J!1, J!1)))),
% 0.20/0.44 inference(quant_inst,[status(thm)],[])).
% 0.20/0.44 tff(68,plain,
% 0.20/0.44 ((~![K: $i] : ((a(K, K) = real_one) | (~int_leq(int_one, K)) | (~int_leq(K, J!1)))) | (~int_leq(int_one, J!1)) | (a(J!1, J!1) = real_one) | (~int_leq(J!1, J!1))),
% 0.20/0.44 inference(modus_ponens,[status(thm)],[67, 66])).
% 0.20/0.44 tff(69,plain,
% 0.20/0.44 ((a(J!1, J!1) = real_one) | (~int_leq(J!1, J!1))),
% 0.20/0.44 inference(unit_resolution,[status(thm)],[68, 32, 62])).
% 0.20/0.44 tff(70,plain,
% 0.20/0.44 ($false),
% 0.20/0.44 inference(unit_resolution,[status(thm)],[69, 28, 18])).
% 0.20/0.44 % SZS output end Proof
%------------------------------------------------------------------------------